A scheme based on Bitplane Signatures for fast image searching is presented. It makes use of Composite Bitplanes obtained from overlaying Bitplane Signatures to form Composite Bitplane Signatures. For large image databases, a hierarchical structure of Composite Bitplane Signatures can be used to provide ranked images without the need to compare and traverse all the images in the database as many existing retrieval methods do. To search a particular signature embedded in a Composite Bitplane Signature, we rank all the signatures not by the number of matched bits but by the least difference of 1 bits from the query signature. Experiments are performed using 1000 images to observe the behavior of Composite Bitplane Signatures under wavelets, and we have also determined the most suitable number of images for insertion into a composite bitplane signature for its efficient operation. Copyright © 1999 by The Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
|Title of host publication||Proceedings IEEE International Conference on Multimedia Computing and Systems|
|Place of Publication||Danvers, MA|
|Publisher||Institute of Electrical and Electronics Engineers, Inc|
|Publication status||Published - 1999|