Abstract
Space savings is a demand of these days. Almost all applications are trying to represent their data in the least possible amount of space. It is the goal of all algorithms to consume as less memory as possible in the computer. Many techniques have been developed to compress large bulk of data so that large amount of information can be accommodated in lesser amount of space. The proposed approach called Coded B+ tree is a modified approach to the conventional B+ Tree index and can be applied only to chain codes of images and to a search of an image database based on chain codes of images as its search key value. The proposed method brings about considerable space savings of more than a half at the cost of 4 to 5 more comparisons. It is a useful technique of indexing for systems that require saving memory spaces. General Terms Image data base indexing, Digital Image Processing, Content Based Image Retrieval.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
