loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 IEEE Conference on Computer Vision and Pattern Recognition
Intrinsic mean shift for clustering on Stiefel and Grassmann manifolds
Miami, FL, USA
June 20-June 25
ISBN: 978-1-4244-3992-8
H.E. Cetingul, Center for Imaging Sci., Johns Hopkins Univ., Baltimore, MD, USA
R. Vidal, Center for Imaging Sci., Johns Hopkins Univ., Baltimore, MD, USA
The mean shift algorithm, which is a nonparametric density estimator for detecting the modes of a distribution on a Euclidean space, was recently extended to operate on analytic manifolds. The extension is extrinsic in the sense that the inherent optimization is performed on the tangent spaces of these manifolds. This approach specifically requires the use of the exponential map at each iteration. This paper presents an alternative mean shift formulation, which performs the iterative optimization ldquoonrdquo the manifold of interest and intrinsically locates the modes via consecutive evaluations of a mapping. In particular, these evaluations constitute a modified gradient ascent scheme that avoids the computation of the exponential maps for Stiefel and Grassmann manifolds. The performance of our algorithm is evaluated by conducting extensive comparative studies on synthetic data as well as experiments on object categorization and segmentation of multiple motions.
Index Terms:
object segmentation, intrinsic mean shift, clustering, Grassmann manifolds, Stiefel manifolds, nonparametric density estimator, Euclidean space, exponential map, alternative mean shift formulation, iterative optimization, modified gradient ascent scheme, synthetic data, object categorization, multiple motions
Citation:
H.E. Cetingul, R. Vidal, "Intrinsic mean shift for clustering on Stiefel and Grassmann manifolds," cvpr, pp.1896-1902, 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009
Usage of this product signifies your acceptance of the Terms of Use.