Recursive implementation of the Gaussian filter
Signal Processing
Multiscale Nonlinear Decomposition: The Sieve Decomposition Theorem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast parallel algorithms for graph matching problems
Fast parallel algorithms for graph matching problems
Unconstrained Automatic Image Matching Using Multiresolutional Critical-Point Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Topological Structure of Scale-Space Images
Journal of Mathematical Imaging and Vision
Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Scale-Space Theory in Computer Vision
Scale-Space Theory in Computer Vision
Scale-Space Filters and Their Robustness
SCALE-SPACE '97 Proceedings of the First International Conference on Scale-Space Theory in Computer Vision
Recursive Gaussian Derivative Filters
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Techniques and Applications of Digital Watermarking and Content Protection
Techniques and Applications of Digital Watermarking and Content Protection
Image Interpolation Using Enhanced Multiresolution Critical-Point Filters
International Journal of Computer Vision - Special Issue on Computer Vision Research at the Beckman Institute of Advanced Science and Technology
Hi-index | 0.00 |
In this paper, a new method of content identification using topological invariants is proposed. First, we show a Reeb-graph of topological invariants of images in a scale-space. Different from well-known scale-space trees of salient or critical points based on catastrophe or singularity theory, we use topologically stable blobs or primary sketches with nonzero lifetimes in scale and nonzero areas at each scale. The continuum of such blobs as a 3D manifold is featured by trees of topological invariants of the image called a Reeb graph. We show that this Reeb-graph representation is more robust against deformation attacks and perturbation such as numerical errors than traditional scale-space trees. A fast matching algorithm for the graphs is also presented.