Image analysis with two-dimensional continuous wavelet transform
Signal Processing
Spherical wavelets: efficiently representing functions on the sphere
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
ACM Transactions on Graphics (TOG)
ACM Transactions on Graphics (TOG)
3D zernike descriptors for content based shape retrieval
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Shape-Similarity Search of Three-Dimensional Models Using Parameterized Statistics
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Robust Texture Image Retrieval Using Hierarchical Correlations of Wavelet Coefficients
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Shape-based retrieval and analysis of 3D models
ACM SIGGRAPH 2004 Course Notes
Spherical Wavelet Descriptors for Content-based 3D Model Retrieval
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Directional histogram model for three-dimensional shape similarity
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
| Hi-index | 0.00 |
Recently, many efforts have concentrated on finding efficient content based retrieval methods of 3D objects. In this paper, we proposed a new retrieval method. The method is constructed on a shape descriptor based on continuous spherical wavelet transform. Continuous 2D wavelet transform has extinct advantages in content based image retrieval. The continuous wavelet transform can be extended from two dimensions to more dimensions, for example, spherical space, with the same properties. As a natural extension, continuous spherical wavelet transform can realize a spherical analysis. Therefore, we map a shape into a unit sphere by spherical parameterization, followed by continuous spherical wavelet transform of the spherical function. This method is our contribution. The result of the transform can be as a new descriptor and be used to match the dissimilarity of two shapes. We have examined our method on a small database of general objects and it is confirmed to be efficient.