By Topic

Image Retrieval Using Sieve Complement Trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Palma, A.P. ; Fac. de Inf., Univ. Autonoma de Queretaro, Queretaro, Mexico ; Harvey, R. ; Aguilar, J.M.P. ; Perez, L.R.V.
more authors

This paper is about scale-space image trees. We introduce here a variant of the sieve algorithm to produce sieve complement trees where not only extremal regions are characterized but also their corresponding complements. Different simplification methods can transform (or prune) the hierarchy into a simpler form where the remaining nodes represent regions that are noticeably different from their neighbourhood, and that are traditionally known in the literature as "Salient Regions". Although, the resulting scale-space tree hierarchy, can not strictly be defined as a segmentation, its associated signal (a simplified image of the original), can be used for content based image retrieval (CBIR) similarly to a segmentation. Here, we present the resulting retrieval precision rates of testing our trees into three widely known image datasets. Our results confirm the premise that complementary regions can contribute to improve image retrieval rates.

Published in:

Artificial Intelligence, 2009. MICAI 2009. Eighth Mexican International Conference on

Date of Conference:

9-13 Nov. 2009