SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
ACM Transactions on Graphics (TOG)
Finding Near-Replicas of Documents and Servers on the Web
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Rotation invariant spherical harmonic representation of 3D shape descriptors
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A Reflective Symmetry Descriptor for 3D Models
Algorithmica
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
Laplace-spectra as fingerprints for shape matching
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Shape-based retrieval and analysis of 3d models
Communications of the ACM - 3d hard copy
A fragile watermarking scheme for 3D meshes
MM&Sec '05 Proceedings of the 7th workshop on Multimedia and security
Salient geometric features for partial shape matching and similarity
ACM Transactions on Graphics (TOG)
Reassembling fractured objects by geometric matching
ACM SIGGRAPH 2006 Papers
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
4-points congruent sets for robust pairwise surface registration
ACM SIGGRAPH 2008 papers
3D Part identification based on local shape descriptors
PerMIS '08 Proceedings of the 8th Workshop on Performance Metrics for Intelligent Systems
Volumetric heat kernel signatures
Proceedings of the ACM workshop on 3D object retrieval
Shape google: Geometric words and expressions for invariant shape retrieval
ACM Transactions on Graphics (TOG)
Investigating the bag-of-words method for 3D shape retrieval
EURASIP Journal on Advances in Signal Processing - Special issue on advanced image processing for defense and security applications
A correspondence-less approach to matching of deformable shapes
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
SMI 2012: Short Stable volumetric features in deformable shapes
Computers and Graphics
Contour canonical form: an efficient intrinsic embedding approach to matching non-rigid 3D objects
Proceedings of the 2nd ACM International Conference on Multimedia Retrieval
Learning the compositional structure of man-made objects for 3D shape retrieval
EG 3DOR'10 Proceedings of the 3rd Eurographics conference on 3D Object Retrieval
Morphological analysis of the left ventricular endocardial surface and its clinical implications
MICCAI'12 Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Local signature quantization by sparse coding
3DOR '13 Proceedings of the Sixth Eurographics Workshop on 3D Object Retrieval
Hi-index | 0.00 |
We propose a new probabilistic framework for the efficient estimation of similarity between 3D shapes. Our framework is based on local shape signatures and is designed to allow for quick pruning of dissimilar shapes, while guaranteeing not to miss any shape with significant similarities to the query model in shape database retrieval applications. Since directly evaluating 3D similarity for large collections of signatures on shapes is expensive and impractical, we propose a suitable but compact approximation based on probabilistic fingerprints which are computed from the shape signatures using Rabin's hashing scheme and a small set of random permutations. We provide a probabilistic analysis that shows that while the preprocessing time depends on the complexity of the model, the fingerprint size and hence the query time depends only on the desired confidence in our estimated similarity. Our method is robust to noise, invariant to rigid transforms, handles articulated deformations, and effectively detects partial matches. In addition, it provides important hints about correspondences across shapes which can then significantly benefit other algorithms that explicitly align the models. We demonstrate the utility of our method on a wide variety of geometry processing applications.