Translator Disclaimer
11 October 2000 Visual feature discrimination versus compression ratio for polygonal shape descriptors
Author Affiliations +
Proceedings Volume 4210, Internet Multimedia Management Systems; (2000)
Event: Information Technologies 2000, 2000, Boston, MA, United States
In the last decade several methods for low level indexing of visual features appeared. Most often these were evaluated with respect to their discrimination power using measures like precision and recall. Accordingly, the targeted application was indexing of visual data within databases. During the standardization process of MPEG-7 the view on indexing of visual data changed, taking also communication aspects into account where coding efficiency is important. Even if the descriptors used for indexing are small compared to the size of images, it is recognized that there can be several descriptors linked to an image, characterizing different features and regions. Beside the importance of a small memory footprint for the transmission of the descriptor and the memory footprint in a database, eventually the search and filtering can be sped up by reducing the dimensionality of the descriptor if the metric of the matching can be adjusted. Based on a polygon shape descriptor presented for MPEG-7 this paper compares the discrimination power versus memory consumption of the descriptor. Different methods based on quantization are presented and their effect on the retrieval performance are measured. Finally an optimized computation of the descriptor is presented.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Joerg Heuer, Francesc Sanahuja, and Andre Kaup "Visual feature discrimination versus compression ratio for polygonal shape descriptors", Proc. SPIE 4210, Internet Multimedia Management Systems, (11 October 2000);

Back to Top