Morphological Shape Context: Semi-locality and Robust Matching in Shape Recognition
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
A decision step for shape context matching
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Scale invariant feature transform (SIFT) parametric optimization using Taguchi design of experiments
ICIRA'10 Proceedings of the Third international conference on Intelligent robotics and applications - Volume Part I
How to overcome perceptual aliasing in ASIFT?
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
A contrario detection of false matches in iris recognition
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Artistic line-drawings retrieval based on the pictorial content
Journal on Computing and Cultural Heritage (JOCCH)
Journal of Mathematical Imaging and Vision
How Accurate Can Block Matches Be in Stereo Vision?
SIAM Journal on Imaging Sciences
Random walk distances in data clustering and applications
Advances in Data Analysis and Classification
On the Role of Contrast and Regularity in Perceptual Boundary Saliency
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
Recent years have seen dramatic progress in shape recognition algorithms applied to ever-growing image databases. They have been applied to image stitching, stereo vision, image mosaics, solid object recognition and video or web image retrieval. More fundamentally, the ability of humans and animals to detect and recognize shapes is one of the enigmas of perception. The book describes a complete method that starts from a query image and an image database and yields a list of the images in the database containing shapes present in the query image. A false alarm number is associated to each detection.Many experiments will show that familiar simple shapes or images can reliably be identified with false alarm numbers ranging from 10-5 to less than 10-300. Technically speaking, there are two main issues. The first is extracting invariant shape descriptors from digital images. Indeed, a shape can be seen from various angles and distances and in various lights. A shape can even be partially occluded by other shapes and still be identifiable. Because the extraction step is so crucial, three acknowledged shape descriptors, SIFT, MSER and LLD, are introduced. The second issue is deciding whether two shape descriptors are identifiable as the same shape or not.A perceptual principle, the Helmholtz principle, is the cornerstone of this decision. It asserts that two shapes can be identified if the probability, that their resemblance may be due to chance, is very small. Not only may this principle be useful in this identification step, but it is also used throughout the complete system that will be presented: from the extraction of shape descriptors in digital images to their grouping in whole shapes. These decisions rely on elementary stochastic geometry and compute a false alarm number. The lower this number, the more secure the identification. The description of the processes, the many experiments on digital images and the simple proofs of mathematical correctness are interlaced so as to make a reading accessible to various audiences, such as students, engineers, and researchers.