Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Local and Global Comparison of Continuous Functions
VIS '04 Proceedings of the conference on Visualization '04
Laplace-spectra as fingerprints for shape matching
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Feature-based similarity search in 3D object databases
ACM Computing Surveys (CSUR)
Robust 3D Shape Correspondence in the Spectral Domain
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Efficient Computation of Isometry-Invariant Distances Between Surfaces
SIAM Journal on Scientific Computing
Discrete laplace operators: no free lunch
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Laplace-Beltrami eigenfunctions for deformation invariant shape representation
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Controlled field generation for quad-remeshing
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Discrete laplace operator on meshed surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
A Linear Time Histogram Metric for Improved SIFT Matching
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Constructing Laplace operator from point clouds in Rd
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Technical Section: Discrete Laplace-Beltrami operators for shape analysis and segmentation
Computers and Graphics
Information Theory in Computer Vision and Pattern Recognition
Information Theory in Computer Vision and Pattern Recognition
Discrete Laplace--Beltrami operators and their convergence
Computer Aided Geometric Design
Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids
Computer-Aided Design
A concise and provably informative multi-scale signature based on heat diffusion
SGP '09 Proceedings of the Symposium on Geometry Processing
Shape analysis using the auto diffusion function
SGP '09 Proceedings of the Symposium on Geometry Processing
Approximating gradients for meshes and point clouds via diffusion metric
SGP '09 Proceedings of the Symposium on Geometry Processing
Comparing sets of 3D digital shapes through topological structures
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Convergence, stability, and discrete approximation of Laplace spectra
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Robust volumetric shape descriptor
EG 3DOR'10 Proceedings of the 3rd Eurographics conference on 3D Object Retrieval
Feature selection for enhanced spectral shape comparison
EG 3DOR'10 Proceedings of the 3rd Eurographics conference on 3D Object Retrieval
SMI 2013: Grouping real functions defined on 3D surfaces
Computers and Graphics
PHOG: photometric and geometric functions for textured shape retrieval
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.01 |
Spectral analysis provides a library of shape description elements intrinsically defined by the shape itself. Among all, the eigenfunctions of the Laplace-Beltrami operator can be thought as a set of real valued functions that implicitly abstract and code the shape. In this scenario, this paper introduces a new shape signature derived from the mutual distances between couples of Laplace-Beltrami eigenfunctions. This signature can be seen as a feature vector that acts as an intrinsic shape pattern. Experiments show that it can be effectively used for shape retrieval and its robustness with respect to changes in topology, model resampling, small perturbations and pose variations.