By Topic

Color image coding, indexing and retrieval using binary space partitioning tree

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

2 Author(s)
Qiu, G. ; Sch. of Comput. Sci., Nottingham Univ., UK ; Sudirman, S.

This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, traditionally used in gray scale image coding (Wu 1992, Radha et al. 1996) is extended to represent colour images. The BSP tree, hence the structure, of the image is explicitly coded. A method is developed to compute the similarities of images based on their BSP tree representations. In image database applications, the images in the database are coded by BSP tree to achieve a good balance between storage efficiency and easy manipulation of image data. Content-based image querying is performed in the compressed bit streams by comparing the BSP tree of the query image with those of the images in the database

Published in:

Image Processing, 2001. Proceedings. 2001 International Conference on  (Volume:1 )

Date of Conference:

2001