Sub-sampling for efficient spectral mesh processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4035 LNCS, Issue , 2006, Pages 172-184

  Liu, Rong ^a   Jain, Varun ^a   Zhang, Hao ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; IMAGE PROCESSING; IMAGE RECONSTRUCTION; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; SAMPLING;

KERNEL PRINCIPAL COMPONENT ANALYSIS (KPCA); MESH SEGMENTATION; NYSTRÖM METHOD; POINT SAMPLING;

COMPUTER GRAPHICS;

EID: 33746216231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11784203_15     Document Type: Conference Paper

References (23)

1. Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: NIPS. (2002) 857-864
2. Weiss, Y.: Segmentation using eigenvectors: a unifying view. In: ICCV. (1999) 975-982
3. Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Trans. on PAMI 26(4) (2004) 515-519
4. Carcassoni, M., Hancock, E.R.: Spectral correspondence for point pattern matching. Pattern Recognition 36 (2003) 193-204
5. Karni, Z., Gotsman, C.: Spectral compression of mesh geometry. In: SIGGRAPH 2000. (2000) 279-286
6. Liu, R., Zhang, H.: Segmentation of 3d meshes through spectral clustering. In: Proc. Pacific Graphics. (2004) 298-305
7. Jain, V., Zhang, H.: Robust 3d shape correspondence in the spectral domain. In: Shape Modeling International. (2006) to appear
8. Isenburg, M., Lindstrom, P.: Streaming meshes. In: IEEE Visualization. (2005) 231-238
9. Zhang, H., Liu, R.: Mesh segmentation via recursive and visually salient spectral cuts. In: Vision, Modeling, and Visualization. (2005)
10. Kolluri, R., Shewchuk, J.R., O'Brien, J.F.: Spectral surface reconstruction from noisy point clouds. In: Eurographics SGP. (2004) 11-21
11. Zigelman, G., Kimmel, R., Kiryati, N.: Texture mapping using surface flattening via multidimensional scaling. IEEE TVCG 8(2) (2002) 198-207
12. Press, W., Tekolsky, S., Vetterling, W., Flannery, B.: Numerical Recipies in C. Cambridge Univ. Press (1992)
13. Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the nyström method. IEEE Trans. PAMI 26 (2004) 214-225
14. de Silva, V., Tenenbaum, B.: Sparse multidimensional scaling using landmark points. Technical report, Stanford University (2004)
15. Sorkine, O.: Laplacian mesh processing. In: Eurographics State-of-the-Art Report. (2005)
16. Shi, J., Malik, J.: Normalized cuts and image segmentation. In: CVPR. (1997) 731-737
17. Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Graph Drawing. (2000) 183-196
18. Williams, C., Seeger, M.: Using the nyström method to speed up kernel machines. In: Advances in Neural Information Processing Systems. (2001) 682-688
19. Scholkopf, B., Smola, A., Muller, K.R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10 (1998) 1299-1319
20. Kraevoy, V., Sheffer, A.: Cross-parameterization and compatible remeshing of 3d models. In: ACM SIGGRAPH. (2004)
21. Shapiro, L.S., M., B.J.: Feature based correspondence: An eigenvector approach. Image and Vision Computing 10(5) (1992) 283-288
22. Garland, M.: (Qslim simplification software - qslim 2.1)
23. Shamir, A.: A formalization of boundary mesh segmentation. In: Proc. 2nd Int'l Symposium on 3D Data Processing, Visualization, and Transmission. (2004) 82-89