Flag of best fit as a representative for a collection of linear subspaces, The
This thesis will develop a technique for representing a collection of subspaces with a flag of best fit, and apply it to practical problems within computer vision and pattern analysis. In particular, we will find a nested sequence of subspaces that are central, with respect to an optimization criterion based on the projection Frobenius norm, to a set of points in the disjoint union of a collection of Grassmann manifolds. Referred to as the flag mean, this sequence can be computed analytically. Three existing subspace means in the literature, the Karcher mean, the extrinsic manifold mean, and ...
(For more, see "View full record.")