Abstract
We introduce a novel approach for computing high quality point-to-point maps among a collection of related shapes. The proposed approach takes as input a sparse set of imperfect initial maps between pairs of shapes and builds a compact data structure which implicitly encodes an improved set of maps between all pairs of shapes. These maps align well with point correspondences selected from initial maps; they map neighboring points to neighboring points; and they provide cycle-consistency, so that map compositions along cycles approximate the identity map.
The proposed approach is motivated by the fact that a complete set of maps between all pairs of shapes that admits nearly perfect cycle-consistency are highly redundant and can be represented by compositions of maps through a single base shape. In general, multiple base shapes are needed to adequately cover a diverse collection. Our algorithm sequentially extracts such a small collection of base shapes and creates correspondences from each of these base shapes to all other shapes. These correspondences are found by global optimization on candidate correspondences obtained by diffusing initial maps. These are then used to create a compact graphical data structure from which globally optimal cycle-consistent maps can be extracted using simple graph algorithms.
Experimental results on benchmark datasets show that the proposed approach yields significantly better results than state-of-the-art data-driven shape matching methods.
- Anguelov, D., Srinivasan, P., Pang, H.-C., Koller, D., Thrun, S., and Davis, J. 2004. The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces. NIPS 17, 33--40.Google ScholarDigital Library
- Chaudhuri, S., Kalogerakis, E., Guibas, L., and Koltun, V. 2011. Probabilistic reasoning for assembly-based 3d modeling. ACM Trans. Graph. 30, 4 (Aug.), 35:1--35:10. Google ScholarDigital Library
- Cho, T. S., Avidan, S., and Freeman, W. T. 2010. A probabilistic image jigsaw puzzle solver. In CVPR, 183--190.Google Scholar
- Chui, H., and Rangarajan, A. 2003. A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst. 89, 2--3 (Feb.), 114--141. Google ScholarDigital Library
- Fisher, M., Savva, M., and Hanrahan, P. 2011. Characterizing structural relationships in scenes using graph kernels. ACM Trans. Graph. 30, 4 (Aug.), 34:1--34:12. Google ScholarDigital Library
- Funkhouser, T., Kazhdan, M., Shilane, P., Min, P., Kiefer, W., Tal, A., Rusinkiewicz, S., and Dobkin, D. 2004. Modeling by example. ACM Trans. Graph. 23, 3 (Aug.), 652--663. Google ScholarDigital Library
- Giorgi, D., Biasotti, S., and Paraboschi, L., 2007. Shape retrieval contest 2007: Watertight models track.Google Scholar
- Goldberg, D., Malon, C., and Bern, M. 2004. A global approach to automatic solution of jigsaw puzzles. Comput. Geom. Theory Appl. 28 (June), 165--174. Google ScholarDigital Library
- Golovinskiy, A., and Funkhouser, T. A. 2009. Consistent segmentation of 3d models. Computers & Graphics 33, 3, 262--269. Google ScholarDigital Library
- Huang, Q.-X., Flöry, S., Gelfand, N., Hofer, M., and Pottmann, H. 2006. Reassembling fractured objects by geometric matching. ACM Trans. Graph. 25, 3, 569--578. Google ScholarDigital Library
- Huang, Q., Koltun, V., and Guibas, L. 2011. Joint shape segmentation using linear programming. ACM Trans. Graph. 30, 6 (Dec.), 125:1--125:12. Google ScholarDigital Library
- Huber, D. 2002. Automatic Three-dimensional Modeling from Reality. PhD thesis, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA. Google ScholarDigital Library
- James, D. L., and Twigg, C. D. 2005. Skinning mesh animations. ACM Trans. Graph. 24, 3 (July), 399--407. Google ScholarDigital Library
- Kalogerakis, E., Hertzmann, A., and Singh, K. 2010. Learning 3d mesh segmentation and labeling. ACM Trans. Graph. 29 (July), 102:1--102:12. Google ScholarDigital Library
- Kim, V. G., Lipman, Y., and Funkhouser, T. 2011. Blended intrinsic maps. ACM Trans. Graph. 30, 4 (Aug.), 79:1--79:12. Google ScholarDigital Library
- Kim, V. G., Li, W., Mitra, N., DiVerdi, S., and Funkhouser, T. 2012. Exploring collections of 3d models using fuzzy correspondences. In ACM SIGGRAPH 2012 papers, SIGGRAPH '12, to appear. Google ScholarDigital Library
- Kumar, M. P., Kolmogorov, V., and Torr, P. H. S. 2009. An analysis of convex relaxations for MAP estimation of discrete MRFs. Journal of Machine Learning Research 10, 71--106. Google ScholarDigital Library
- Leordeanu, M., and Hebert, M. 2006. Efficient map approximation for dense energy functions. ICML '06, 545--552. Google ScholarDigital Library
- Lipman, Y., and Funkhouser, T. 2009. Mobius voting for surface correspondence. ACM Trans. Graph. 28, 3 (July), 72:1--72:12. Google ScholarDigital Library
- Marande, W., and Burger, G. 2007. Mitochondrial dna as a genomic jigsaw puzzle. Science 318 (October), 415.Google ScholarCross Ref
- Mémoli, F., and Sapiro, G. 2005. A theoretical and computational framework for isometry invariant recognition of point cloud data. Foundations of Computational Mathematics 5, 3, 313--347. Google ScholarDigital Library
- Nguyen, A., Ben-Chen, M., Welnicka, K., Ye, Y., and Guibas, L. 2011. An optimization approach to improving collections of shape maps. SGP '11, 1481--1491.Google Scholar
- Ovsjanikov, M., Ben-Chen, M., Solomon, J., Butscher, A., and Guibas, L. 2012. Functional maps: A flexible representation of maps between shapes. ACM Transactions on Graphics 31, 4. Google ScholarDigital Library
- Roberts, R., Sinha, S. N., Szeliski, R., and Steedly, D. 2011. Structure from motion for scenes with large duplicate structures. In CVPR, 3137--3144. Google ScholarDigital Library
- Rubner, Y., Tomasi, C., and Guibas, L. J. 2000. The earth mover's distance as a metric for image retrieval. Int. J. Comput. Vision 40, 2 (Nov), 99--121. Google ScholarDigital Library
- Sidi, O., va n Kaick, O., Kleiman, Y., Zhang, H., and Cohen-Or, D. 2011. Unsupervised co-segmentation of a set of shapes via descriptor-space spectral clustering. ACM Trans. Graph. 30, 6 (Dec.), 126:1--126:10. Google ScholarDigital Library
- Solomon, J., Nguyen, A., Butscher, A., Ben-Chen, M., and Guibas, L. 2012. Soft maps between surfaces. Computer Graphics Forum 31, 5, 1617--1626. Google ScholarDigital Library
- Sumner, R. W., and Popović, J. 2004. Deformation transfer for triangle meshes. ACM Trans. Graph. 23, 3 (Aug.), 399--405. Google ScholarDigital Library
- Sun, J., Ovsjanikov, M., and Guibas, L. 2009. A concise and provably informative multi-scale signature based on heat diffusion. Symposium on Geometry Processing '09, 1383--1392. Google ScholarDigital Library
- van Kaick, O., Tagliasacchi, A., Sidi, O., Zhang, H., Cohen-Or, D., Wolf, L., and Hamarneh, G. 2011. Prior knowledge for shape correspondence. Computer Graphics Forum 30, 2, 553--562.Google ScholarCross Ref
- Zach, C., Klopschitz, M., and Pollefeys, M. 2010. Disambiguating visual relations using loop constraints. In CVPR, 1426--1433.Google Scholar
Index Terms
- An optimization approach for extracting and encoding consistent maps in a shape collection
Recommendations
Functional maps: a flexible representation of maps between shapes
We present a novel representation of maps between pairs of shapes that allows for efficient inference and manipulation. Key to our approach is a generalization of the notion of map that puts in correspondence real-valued functions rather than points on ...
Map-based exploration of intrinsic shape differences and variability
We develop a novel formulation for the notion of shape differences, aimed at providing detailed information about the location and nature of the differences or distortions between the two shapes being compared. Our difference operator, derived from a ...
Conformal Geometry and Its Applications on 3D Shape Matching, Recognition, and Stitching
Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However, shape matching with noise, occlusion, and clutter is a challenging problem. ...
Comments