cvpr cvpr2013 cvpr2013-259 cvpr2013-259-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Nikolaos Pitelis, Chris Russell, Lourdes Agapito
Abstract: In this work, we return to the underlying mathematical definition of a manifold and directly characterise learning a manifold as finding an atlas, or a set of overlapping charts, that accurately describe local structure. We formulate the problem of learning the manifold as an optimisation that simultaneously refines the continuous parameters defining the charts, and the discrete assignment of points to charts. In contrast to existing methods, this direct formulation of a manifold does not require “unwrapping ” the manifold into a lower dimensional space and allows us to learn closed manifolds of interest to vision, such as those corresponding to gait cycles or camera pose. We report state-ofthe-art results for manifold based nearest neighbour classification on vision datasets, and show how the same techniques can be applied to the 3D reconstruction of human motion from a single image.
[1] M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in neural information processing systems, 14:585–591, 2001 . 1, 4
[2] I. Borg and P. Groenen. Modern multidimensional scaling: Theory and applications. Springer, 2005. 4
[3] M. Brand. Charting a manifold. In Advances in Neural Information Processing Systems, pages 961–968, 2003. 2
[4] R. R. Coifman and S. Lafon. Diffusion maps. Applied and Computational Harmonic Analysis, 21(1):5 30, 2006. 4
[5] D. Donoho and C. Grimes. Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data. Proceedings of the National Academy of Sciences, 100(10):5591–5596, 2003. 1, 4
[6] E. Elhamifar and R. Vidal. Sparse manifold clustering and embedding. In Advances in Neural Information Processing Systems, pages 55–63, 2011. 2, 4, 5
[7] J. Fayad, C. Russell, and L. Agapito. Automated articulated structure and 3d shape recovery from point correspondences. In International Conference in Computer Vision, 2011. 3
[8] A. Georghiades, P. Belhumeur, and D. Kriegman. From few –
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17] to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(6):643–660, 2001. 4 J. Ham, D. Lee, S. Mika, and B. Sch o¨lkopf. A kernel view of the dimensionality reduction of manifolds. In Proceedings of the twenty-first international conference on Machine learning, page 47. ACM, 2004. 1 H. Isack and Y. Boykov. Energy-based geometric multimodel fitting. International Journal of Computer Vision (IJCV), 97(2), 2012. 2 L. Ladicky, C. Russell, P. Kohli, and P. Torr. Graph cut based inference with co-occurrence statistics. In European Conference on Computer Vision, 2010. 3 A. B. Lee, K. S. Pedersen, and D. Mumford. The nonlinear statistics of high-contrast patches in natural images. International Journal of Computer Vision, 54(1-3), 2003. 1 K. Lee, J. Ho, and D. Kriegman. Acquiring linear subspaces for face recognition under variable lighting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(5):684–698, 2005. 4 J. C. Nascimento and J. G. Silva. Manifold learning for object tracking with multiple motion dynamics. In European Conference on Computer Vision, pages 172–185, 2010. 2 S. Roweis, L. K. Saul, G. E. Hinton, et al. Global coordination of local linear models. Advances in neural information processing systems, 2:889–896, 2002. 2 C. Russell, J. Fayad, and L. Agapito. Energy based multiple model fitting for non-rigid structure from motion. In Computer Vision and Pattern Recognition, 2011. 2, 3 C. Russell, J. Fayad, and L. Agapito. Dense non-rigid structure from motion. 3dimPVT, 2012. 3
[18] L. Saul and S. Roweis. Think globally, fit locally: unsupervised learning of low dimensional manifolds. The Journal of Machine Learning Research, 4: 119–155, 2003. 1, 3, 4
[19] G. Strang. Introduction to Linear Algebra. WellesleyCambridge Press, 1993. 6
[20] J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 2000. 1, 3, 4
[21] P. Tseng. Nearest q-flat to m points. Journal of Optimization Theory and Applications, 105(1):249–252, April 2000. 2
[22] R. Vidal. Subspace clustering. IEEE Signal Processing Magazine, 28(2):52–68, 2011. 2
[23] T. Wittman. Manifold learning matlab demo, 2005. URL: http://www.math.umn.edu/˜wittman/mani/index.html. 4, 5
[24] R. Zabih and V. Kolmogorov. Spatially coherent clustering using graph cuts. In Computer Vision and Pattern Recognition, pages 437–444, 2004. 2
[25] Z. Zhang, J. Wang, and H. Zha. Adaptive manifold learning. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 34(2):253 –265, feb. 2012. 1, 2, 4, 5, 6
[26] Z. Zhang and H. Zha. Principal manifolds and nonlinear dimension reduction via local tangent space alignment. SIAM Journal of Scientific Computing, 26:3 13–338, 2002. 1, 3, 4 111666444977