Multi-scale kernels using random walks

Computer Graphics Forum

Volumn 33, Issue 1, 2014, Pages 164-177

  Sinha, A ^a   Ramani, K ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

geometric analysis; random walks; shape signatures

Indexed keywords

CONTINUOUS TIME SYSTEMS;

CONTINUOUS TIME RANDOM WALKS; FRACTIONAL MOMENTS; GEOMETRIC ANALYSIS; INFLUENCE PARAMETER; PAIRWISE DISTANCES; PROBABILISTIC INTERPRETATION; RANDOM WALK; SHAPE SIGNATURES;

RANDOM PROCESSES;

EID: 84894513973     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/cgf.12264     Document Type: Article

References (35)

1. [ASC11], Aubry M., Schlickewei U., Cremers D.,: The wave kernel signature: A quantum mechanical approach to shape analysis. In Proceedings of the ICCV Workshops (Barcelona, Spain, 2011), IEEE, pp. 1626-1633.
2. [BB11], Bronstein M. M., Bronstein A. M.,: Shape recognition with spectral distances. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, 5 (2011), 1065-1071.
3. [BBGO11], Bronstein A. M., Bronstein M. M., Guibas L. J., Ovsjanikov M.,: Shape Google: Geometric words and expressions for invariant shape retrieval. ACM Transactions on Graphics, 30, 1 (February 2011), 1:1-1:20.
4. [BP98], Brin S., Page L.,: The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30, 1-7 (1998), 107-117.
5. [Bro11], Bronstein A. M.,: Spectral descriptors for deformable shapes. CoRR abs/1110.5015 (2011).
6. [BWH05], Bai X., Wilson R., Hancock E.,: Manifold embedding of graphs using the heat kernel. In Proceedings of IMA (Loughborough, UK, 2005), vol. 3604, Springer, pp. 34-49.
7. [Chu97], Chung F. R. K.,: Spectral Graph Theory. American Mathematical Society, Providence, RI, USA, 1997.
8. [CY00], Chung F. R. K., Yau S.-T.,: Discrete Green's functions. Journal of Combinatorial Theory, Series A, 91, 1-2 (2000), 191-214.
9. [Dud12], Duda J.,: From maximal entropy random walk to quantum thermodynamics. Journal of Physics: Conference Series, 361, 1 (2012), 012039.
10. [FPmRS07], Fouss F., Pirotte A., michel Renders J., Saerens M.,: Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19 (2007), pp. 355-369.
11. [Kei79], Keilson J.,: Markov Chain Models-Rarity and Exponentiality. No. 28 in Applied Mathematical Sciences. Springer, New York, 1979.
12. [KL02], Kondor R. I., Lafferty J. D.,: Diffusion kernels on graphs and other discrete input spaces. In Proceedings of ICML (Sydney, Australia, 2002), Morgan Kaufmann, pp. 315-322.
13. [Law06], Lawler G.,: Introduction to Stochastic Processes. Chapman and Hall/CRC Probability Series. Chapman & Hall/CRC, Oxford, UK, 2006.
14. [Lév06], Lévy B.,: Laplace-Beltrami eigenfunctions towards an algorithm that "understands" geometry. In Proceedings of SMI (College Station, USA, 2006), IEEE, p. 13.
15. [LHMR08], Lai Y.-K., Hu S.-M., Martin R. R., Rosin P. L.,: Fast mesh segmentation using random walks. In Proceedings of SPM (New York, USA, 2008), ACM, pp. 183-191.
16. [Lov93], Lovász L.,: Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty 2, 1 (1993), 1-46.
17. [LRF10], Lipman Y., Rustamov R., Funkhouser T.,: Biharmonic distance. ACM Transactions on Graphics, 29, 3 (June 2010), 27:1-27:11.
18. [MDSB02], Meyer M., Desbrun M., Schröder P., Barr A. H.,: Discrete differential-geometry operators for triangulated 2-manifolds. In Proceedings of VisMath (2002), pp. 35-57.
19. [New10], Newman M.,: Networks: An Introduction. Oxford University Press, Inc., New York, USA, 2010.
20. [NLCK05], Nadler B., Lafon S., Coifman R. R., Kevrekidis I. G.,: Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators. In Proceedings of NIPS (Vancouver, Canada, 2005), MIT Press, pp. 955-962.
21. [OMMG10], Ovsjanikov M., Mérigot Q., Mémoli F., Guibas L. J.,: One point isometric matching with the heat kernel. Computer Graphics Forum 29, 5 (2010), 1555-1564.
22. [PP93], Pinkall U., Polthier K.,: Computing discrete minimal surfaces and their conjugates. Experimental Mathematics 2 (1993), 15-36.
23. [QH07], Qiu H., Hancock E. R.,: Clustering and embedding using commute times. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 11 (2007), 1873-1890.
24. [Rus07], Rustamov R. M.,: Laplace-Beltrami eigenfunctions for deformation invariant shape representation. In Proceedings of SGP (Barcelona, Spain, 2007), Eurographics, pp. 225-233.
25. [Rus11a], Rustamov R. M.,: Average interpolating wavelets on point clouds and graphs. CoRR abs/1110.2227 (2011).
26. [Rus11b], Rustamov R. M.,: Multiscale biharmonic kernels. Computer Graphics Forum 30, 5 (2011), 1521-1531.
27. [SGGnL*11], Sinatra R., Gómez-Garde nes J., Lambiotte R., Nicosia V., Latora V.,: Maximal-entropy random walks in complex networks with limited information. Physical Review E, 83 (March 2011), 030103.
28. rd ACM national conference (New York, USA, 1968), ACM, pp. 517-524.
29. [SOCG10], Skraba P., Ovsjanikov M., Chazal F., Guibas L.,: Persistence-based segmentation of deformable shapes. In CVPR Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment (June 2010), pp. 45-52.
30. [SOG09], Sun J., Ovsjanikov M., Guibas L. J.,: A concise and provably informative multi-scale signature based on heat diffusion. Computer Graphics Forum 28, 5 (2009), 1383-1392.
31. [SRML07], Sun X., Rosin P. L., Martin R. R., Langbein F. C.,: Random walks for mesh denoising. In Proceedings of SPM (Beijing, China, 2007), ACM, pp. 11-22.
32. [WMKG07], Wardetzky M., Mathur S., Kälberer F., Grinspun E.,: Discrete laplace operators: No free lunch. In Proceedings of SGP (Barcelona, Spain, 2007), Eurographics, pp. 33-37.
33. [XHW09], Xiao B., Hancock E. R., Wilson R. C.,: Graph characteristics from the heat kernel trace. Pattern Recognition 42, 11 (2009), 2589-2606.
34. [ZBS11], Zhou X., Belkin M., Srebro N.,: An iterated graph Laplacian approach for ranking on manifolds. In Proceedings of KDD (San Diego, USA, 2011), ACM, pp. 877-885.
35. [ZZC11], Zhang J., Zheng J., Cai J.,: Interactive mesh cutting using constrained random walks. IEEE Transactions on Visualization and Computer Graphics 17, 3 (May 2011), 357-367.