Future works

to shape, pose, and geometric detail.

7.2 Future works

To further improve our skeleton correspondence algorithm, we could add other global proper-ties, such as the symmetry, which help to classify the links in more high-level ways (e.g., for the symmetry, we can classify the links into three sets: the first is located at the symmetry line, the second is on the one side and the third is on the other side). We also need some more accurate shape descriptors, or semantic labels to describe the components of the objects. So the links associating with these components could be matched more meaningfully and correctly.

For the segmentation transfer, currently we can only deal with part-type segmentation, since the skeleton correspondence can only describes the parts correspondence between the objects.

In the future we will extend our work to find the complete surface mapping of two objects by using the vertices correspondence information of MSP skeleton. At this time boundaries will map more easily and we can handle any kind of segmentation style.

Bibliography

[ACSD⁺03] P. Alliez, D. Cohen-Steiner, O. Devillers, B. L´evy, and M. Desbrun. Anisotropic polygonal remeshing. ACM Transactions on Graphics, 22(3):485–493, 2003.

[AFS06] M. Attene, B. Falcidieno, and M. Spagnuolo. Hierarchical mesh segmentation based on fitting primitives. The Visual Computer, 22(3):181–193, 2006.

[AKM⁺06] M. Attene, S. Katz, M. Mortara, G. Patane, M. Spagnuolo, and A. Tal. Mesh segmentation - a comparative study. IEEE International Conference on Shape Modeling and Applications, page 7, 2006.

[APP⁺07] A. Agathos, I. Pratikakis, S. Perantonis, N. Sapidis, and P. Azariadis. 3D mesh segmentation methodologies for cad applications. Computer-Aided Design and Applications, 4(6):827–841, 2007.

[ATC⁺08] O. K.-C. Au, C.-L. Tai, H.-K. Chu, D. Cohen-Or, and T.-Y. Lee. Skeleton ex-traction by mesh conex-traction. ACM Transactions on Graphics, 27(3), 2008.

[ATCO⁺10] O. K.-C. Au, C.-L. Tai, D. Cohen-Or, Y. Zheng, and H. Fu. Electors voting for fast automatic shape correspondence. Computer Graphics Forum, 29(2):645–

654, 2010.

[BH03] M. Brand and K. Huang. A unifying theorem for spectral embedding and clus-tering. International Workshop On Artificial Intelligence and Statistics, 2003.

86

Bibliography 87

[BK04] Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pat-tern Analysis and Machine Intelligence, 26(9):1124–1137, 2004.

[BM92] P.J. Besl and N.D. McKay. A method for registration of 3-D shapes. IEEE Trans-actions on Pattern Analysis and Machine Intelligence, 14(2):239–256, 1992.

[BMSF06] S. Biasotti, S. Marini, M. Spagnuolo, and B. Falcidieno. Sub-part corre-spondence by structural descriptors of 3D shapes. Computer-Aided Design, 38(9):1002–1019, 2006.

[BWK05] S. Bischoff, T. Wey, and L. Kobbelt. Snakes on triangle meshes. Bildverar-beitung fur die Medizin, pages 208–212, 2005.

[CGF09] X. Chen, A. Golovinskiy, and T. Funkhouser. A benchmark for 3D mesh seg-mentation. ACM Transactions on Graphics, 28(3):1–12, 2009.

[EK03] A. Elad and R. Kimmel. On bending invariant signatures for surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25:1285–1295, 2003.

[FBCM04] C. Fowlkes, S. Belongie, F. Chung, and J. Malik. Spectral grouping using the nystrom method. IEEE Transactions on Pattern Analysis and Machine Intelli-gence, 26:214–225, 2004.

[GF08] A. Golovinskiy and T. Funkhouser. Randomized cuts for 3D mesh analysis.

ACM Transactions on Graphics, 27(5):145, 2008.

[GF09] A. Golovinskiy and T. Funkhouser. Consistent segmentation of 3D models.

Computers and Graphics, 33(3):262–269, 2009.

[GG04] N. Gelfand and L. J. Guibas. Shape segmentation using local slippage analysis.

Symposium on Geometry processing, pages 214–223, 2004.

Bibliography 88

[HJWC] T. C. Ho, H. X. Ji, S. K. Wong, and J. H. Chuang. Mesh skeletonization using minimum slice perimeter function. Computer Science Technical Report CS-TR-2010-0001.

[HR84] D. D. Hoffman and W. A. Richards. Parts of recognition. Cognition, 18:65–96, 1984.

[HS97] D. D. Hoffman and M. Singh. Salience of visual parts. Cognition, 63:29–78, 1997.

[HSKK01] M. Hilaga, Y. Shinagawa, T. Kohmura, and T. L. Kunii. Topology matching for fully automatic similarity estimation of 3D shapes. In SIGGRAPH 2001, pages 203–212, 2001.

[JK04] M. Jung and H. Kim. Snaking across 3D meshes. In 12th Pacific Graphics, pages 87–93, 2004.

[KHS10] E. Kalogerakis, A. Hertzmann, and K. Singh. Learning 3D mesh segmentation and labeling. ACM Transactions on Graphics, 29(4):1–12, 2010.

[KJS07] V. Kreavoy, D. Julius, and A. Sheffer. Model composition from interchangeable components. In 15th Pacific Graphics, pages 129–138, 2007.

[KLT05] S. Katz, G. Leifman, and A. Tal. Mesh segmentation using feature point and core extraction. The Visual Computer, 21(8-10):649–658, 2005.

[KT03] S. Katz and A. Tal. Hierarchical mesh decomposition using fuzzy clustering and cuts. ACM Transactions on Graphics, 22(3):954–961, 2003.

[KWT88] M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active contour models. In-ternational Journal of Computer Vision, 1(4):321–331, 1988.

[LF09] Y. Lipman and T. Funkhouser. M¨obius voting for surface correspondence. ACM Transactions on Graphics, 28(3):1–12, 2009.

Bibliography 89

[LHMR08] Y.-K. Lai, S.-M. Hu, R. R. Martin, and P. L. Rosin. Fast mesh segmentation using random walks. ACM symposium on Solid and Physical Modeling, pages 183–191, 2008.

[LL02] Y. Lee and S. Lee. Geometric snakes for triangular meshes. Computer Graphics Forum, 21(3), 2002.

[LLL07] H.-Y. S. Lin, H.-Y. M. Liao, and J.-C. Lin. Visual salience-guided mesh decom-position. IEEE Transactions on Multimedia, 9(1), 2007.

[Llo82] S. P. Lloyd. Least squares quantization in pcm. IEEE Transactions on Informa-tion Theory, 28:129–137, 1982.

[LLS⁺04] Y. Lee, S. Lee, A. Shamir, D. Cohen-Or, and H.-P. Seidel. Intelligent mesh scissoring using 3D snakes. In 12th Pacific Graphics, pages 279–287, 2004.

[LLS⁺05] Y. Lee, S. Lee, A. Shamir, D. Cohen-Or, and H.-P. Seidel. Mesh scissoring with minima rule and part salience. Computer Aided Geometric Design, 22(5):444–

465, 2005.

[LMLR06] S. Liu, R.R. Martin, F.C. Langbein, and P.L. Rosin. Segmenting reliefs on tri-angle meshes. ACM symposium on Solid and Physical Modeling, pages 7–16, 2006.

[LWTH01] X. Li, T. W. Woon, T. S. Tan, and Z. Huang. Decomposing polygon meshes for interactive applications. Symposium on Interactive 3D Graphics, pages 35–42, 2001.

[LZ04] R. Liu and H. Zhang. Segmentation of 3D meshes through spectral clustering.

In 12th Pacific Graphics, pages 298–305, 2004.

[LZ07] R. Liu and H. Zhang. Mesh segmentation via spectral embedding and contour analysis. Computer Graphics Forum, 26(3):385–394, 2007.

Bibliography 90

[MHTG05] M. M¨uller, B. Heidelberger, M. Teschner, and M. Gross. Meshless deforma-tions based on shape matching. ACM Transacdeforma-tions on Graphics, 24(3):471–478, 2005.

[MPS⁺04] M. Mortara, G. Patane, M. Spagnuolo, B. Falcidieno, and J. Rossignac. Plumber:

a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies. ACM symposium on Solid modeling and applications, pages 339–

344, 2004.

[PKA03] D. Page, A. Koschan, and M. Abidi. Perception-based 3D triangle mesh segmen-tation using fast marching watersheds. Computer Vision and Pattern Recogni-tion, pages 27–32, 2003.

[RT07] D. Reniers and A. Telea. Skeleton-based hierarchical shape segmentation. IEEE International Conference on Shape Modeling and Applications, pages 179–188, 2007.

[RT08] D. Reniers and A. Telea. Patch-type segmentation of voxel shapes using simpli-fied surface skeletons. Computer Graphics Forum, 27(7):1837–1844, 2008.

[Sha08] A. Shamir. A survey on mesh segmentation techniques. Computer Graphics Forum, 27(6):1539–1556, 2008.

[SSCO08] L. Shapira, A. Shamir, and D. Cohen-Or. Consistent mesh partitioning and skele-tonisation using the shape diameter function. The Visual Computer, 24(4):249–

259, 2008.

[SSGD03] H. Sundar, D. Silver, N. Gagvani, and S. Dickinson. Skeleton based shape matching and retrieval. In Shape Modeling International, page 130, 2003.

[STK02] S. Shlafman, A. Tal, and S. Katz. Metamorphosis of polyhedral surfaces using decomposition. Computer Graphics Forum, 21(3):219–228, 2002.

Bibliography 91

[TS04] T. Tung and F. Schmitt. Augmented reeb graphs for content-based retrieval of 3D mesh models. In Shape Modeling International, pages 157–166, 2004.

[TVD09] J. Tierny, J.-P. Vandeborre, and M. Daoudi. Partial 3D shape retrieval by reeb pattern unfolding. Computer Graphics Forum, 28(1), March 2009.

[vKZHCO10] O. van Kaick, H. Zhang, G. Hamarneh, and D. Cohen-Or. A survey on shape correspondence. Eurographics State-of-the-art Report, 2010.

[WZ10] Y. Wang and J. Zheng. Tubular triangular mesh parameterization and applica-tions. Computer Animation and Virtual Worlds, 21(2):91–102, 2010.

[XWLB09] Y. Xu, B. Wang, W. Liu, and X. Bai. Skeleton graph matching based on critical points using path similarity. In Asian Conference on Computer Vision(3), pages 456–465, 2009.

[ZL05] H. Zhang and R. Liu. Mesh segmentation via recursive and visually salient spectral cuts. In Vision, Modeling, and Visualization, pages 429–436, 2005.

[ZSCO⁺08] H. Zhang, A. Sheffer, D. Cohen-Or, Q. Zhou, O. van Kaick, and A. Tagliasacchi.

Deformation-driven shape correspondence. Symposium on Geometry Process-ing, pages 1431–1439, 2008.