By Topic

Domain classification using B+trees in fractal image compression

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)

The computational complexity of fractal image compression is mainly because of the huge number of comparisons required to find a matching domain block corresponding to the range blocks within the image. Various schemes have been presented by researchers for domain classification which can lead to significant reduction in the time spent for range-domain matching. All the schemes propose to first separate domains into different classes and then select the appropriate class for matching with selected range block. Here, we propose a dynamic classification scheme based on local fractal dimensions. The method can be experimented with other features of image blocks measured locally. In this work we have investigated the computational efficiency of multi-way search trees for storing domain information. The domains can be listed in a B+ tree ordered on one or more selected local features of each domain.

Published in:

Computing and Communication Systems (NCCCS), 2012 National Conference on

Date of Conference:

21-22 Nov. 2012