Paper
23 March 1995 θ-index of imagebase
Ying Liu
Author Affiliations +
Proceedings Volume 2420, Storage and Retrieval for Image and Video Databases III; (1995) https://doi.org/10.1117/12.205309
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States
Abstract
In this paper, we study the possibility of using θ-index for retrieval of imagebase. Image retrieval is related to partition in an image space. If there exists a mapping from an image space to a feature space, the partition in the image space can be converted into a partition in the feature space. To retrieve an image, some features of the image must be identified. Feature identification can be considered as optimal assignment of some indices to images. This is equivalent to an optimal partition of image space into mutual exclusive regions, each corresponding to particular values of a set of indices. In our system, the feature extraction is implemented by a two-dimensional θ-transformation. The time complexity for a θ-transformation is very low. Therefore, for a certain class of images, θ- transformation is a very efficient algorithm for image indexing.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ying Liu "θ-index of imagebase", Proc. SPIE 2420, Storage and Retrieval for Image and Video Databases III, (23 March 1995); https://doi.org/10.1117/12.205309
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Feature extraction

Image retrieval

Distortion

Neurons

Data compression

Neural networks

RELATED CONTENT

Two new classes of Boltzmann machines
Proceedings of SPIE (August 19 1993)
Boltzmann machines for image-block coding
Proceedings of SPIE (March 28 1995)
Image compression using Boltzmann machines
Proceedings of SPIE (October 29 1993)

Back to Top