A Continuous Probabilistic Framework for Image Matching
β Scribed by Hayit Greenspan; Jacob Goldberger; Lenny Ridel
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 509 KB
- Volume
- 84
- Category
- Article
- ISSN
- 1077-3142
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we describe a probabilistic image matching scheme in which the image representation is continuous and the similarity measure and distance computation are also defined in the continuous domain. Each image is first represented as a Gaussian mixture distribution and images are compared and matched via a probabilistic measure of similarity between distributions. A common probabilistic and continuous framework is applied to the representation as well as the matching process, ensuring an overall system that is theoretically appealing. Matching results are investigated and the application to an image retrieval system is demonstrated.
π SIMILAR VOLUMES
The problem considered in this paper is how to classify image databases in terms of semantically coherent image categories. An image category (image concept) is represented by a set of images with visual and semantic similarities. We propose a topological framework to model each image concept and al
We show in this paper that the average over translations of an operator diagonal in a wavelet packet basis is a convolution. We also show that an operator diagonal in a wavelet packet basis can be decomposed into several operators of the same kind, each of them being better conditioned. We investiga
This paper provides a formal specification for concept-based image retrieval using triples. To effectively manage a vast amount of images, we may need an image retrieval system capable of indexing and searching images based on the characteristics of their content. However, such a content-based image