CSDL Home IEEE Transactions on Visualization & Computer Graphics 2009 vol.15 Issue No.05 - September/October

Subscribe

Issue No.05 - September/October (2009 vol.15)

pp: 853-866

Hung-Kuo Chu , National Cheng-Kung University, Tainan

Tong-Yee Lee , National Cheng-Kung University, Tainan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2009.40

ABSTRACT

In this paper, we solve the problem of 3D shape interpolation with significant pose variation. For an ideal 3D shape interpolation, especially the articulated model, the shape should follow the movement of the underlying articulated structure and be transformed in a way that is as rigid as possible. Given input shapes with compatible connectivity, we propose a novel multiresolution mean shift (MMS) clustering algorithm to automatically extract their near-rigid components. Then, by building the hierarchical relationship among extracted components, we compute a common articulated structure for these input shapes. With the aid of this articulated structure, we solve the shape interpolation by combining 1) a global pose interpolation of near-rigid components from the source shape to the target shape with 2) a local gradient field interpolation for each pair of components, followed by solving a Poisson equation in order to reconstruct an interpolated shape. As a result, an aesthetically pleasing shape interpolation can be generated, with even the poses of shapes varying significantly. In contrast to a recent state-of-the-art work [CHECK END OF SENTENCE], the proposed approach can achieve comparable or even better results and have better computational efficiency as well.

INDEX TERMS

Shape interpolation, pose configuration, multiresolution mean shift (MMS) clustering.

CITATION

Hung-Kuo Chu, Tong-Yee Lee, "Multiresolution Mean Shift Clustering Algorithm for Shape Interpolation",

*IEEE Transactions on Visualization & Computer Graphics*, vol.15, no. 5, pp. 853-866, September/October 2009, doi:10.1109/TVCG.2009.40REFERENCES

- [1] M. Alexa, “Differential Coordinates for Local Mesh Morphing and Deformation,”
The Visual Computer, vol. 19, nos. 2/3, pp. 105-114, 2003.- [3] M. Alexa, “Linear Combination of Transformations,”
ACM Trans. Graphics, vol. 21, no. 3, pp. 380-387, 2002.- [4] M. Alexa, D. Cohen-Or, and D. Levin, “As-Rigid-As-Possible Shape Interpolation,”
Proc. ACM SIGGRAPH '00, pp. 157-164, 2000.- [5] D. Anguelov, D. Koller, H.-C. Pang, P. Srinivasan, and S. Thrun, “Recovering Articulated Object Models from 3D Range Data,”
Proc. 20th Conf. Uncertainty in Artificial Intelligence, pp. 18-26, 2004.- [6] D. Anguelov, P. Srinivasan, D. Koller, S. Thrun, J. Rodgers, and J. Davis, “Scape: Shape Completion and Animation of People,”
ACM Trans. Graphics, vol. 24, no. 3, pp. 408-416, 2005.- [8] M. Botsch, D. Bommes, and L. Kobbelt, “Efficient Linear System Solvers for Mesh Processing,”
Proc. IMA Conf. Math. Surfaces, pp.62-83, 2005.- [9] M. Botsch, R. Sumner, M. Pauly, and M. Gross, “Deformation Transfer for Detail-Preserving Surface Editing,”
Proc. Vision, Modeling, and Visualization Conf. (VMV), pp. 357-364, 2006.- [10] E. Carmel and D. Cohen-Or, “Warp-Guided Object-Space Morphing,”
The Visual Computer, vol. 13, nos. 9/10, pp. 465-478, 1997.- [15] K.G. Der, R.W. Sumner, and J. Popović, “Inverse Kinematics for Reduced Deformable Models,”
ACM Trans. Graphics, vol. 25, no. 3, pp. 1174-1179, 2006.- [16] M. Garland and P.S. Heckbert, “Surface Simplification Using Quadric Error Metrics,”
Proc. ACM SIGGRAPH '97, pp. 209-216, 1997.- [17] D.L. James and C.D. Twigg, “Skinning Mesh Animations,”
Proc. ACM SIGGRAPH '05, pp. 399-407, 2005.- [22] J.E. Lengyel, “Compression of Time-Dependent Geometry,”
Proc. Symp. Interactive 3D Graphics, pp. 89-95, 1999.- [25] N.J. Mitra, Personal Comm., 2009.
- [26] N.J. Mitra, L.J. Guibas, and M. Pauly, “Symmetrization,”
Proc. ACM SIGGRAPH '07, p. 63, 2007.- [28] E. Praun, W. Sweldens, and P. Schröder, “Consistent Mesh Parameterizations,”
Proc. ACM SIGGRAPH '01, pp. 179-184, 2001.- [29] S. Schaefer and C. Yuksel, “Example-Based Skeleton Extraction,”
Proc. Symp. Geometry Processing, pp. 153-162, 2007.- [31] T.W. Sederberg, P. Gao, G. Wang, and H. Mu, “2D Shape Blending: An Intrinsic Solution to the Vertex Path Problem,”
Proc. ACM SIGGRAPH '93, pp. 15-18, 1993.- [32] A. Sheffer and V. Kraevoy, “Pyramid Coordinates for Morphing and Deformation,”
Proc. 3D Data Processing, Visualization, and Transmission Conf. (3DPVT), pp. 68-75, 2004.- [33] K. Shoemake and T. Duff, “Matrix Animation and Polar Decomposition,”
Proc. Conf. Graphics Interface, pp. 258-264, 1992.- [36] S. Toledo, “Taucs: A Library of Sparse Linear Solvers, Version 2.2,” http://www.tau.ac.il/stoledotaucs, 2003.
- [39] H.-B. Yan, S.-M. Hu, and R. Martin, “Skeleton-Based Shape Deformation Using Simplex Transformations,”
Proc. Int'l Conf. Computer Graphics, pp. 66-77, 2006.- [40] T.-Y. Lee and P.-H. Huang, “Fast and Intuitive Polyhedra Morphing Using SMCC Mesh Merging Scheme,”
IEEE Trans. Visualization and Computer Graphics, vol. 9, no. 1, pp. 85-98, 2003. |