AN IMPROVED DOMAIN CLASSIFICATION SCHEME BASED ON LOCAL FRACTAL DIMENSION
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 1
Abstract
In fractal image compression, most of the time during encoding is spent for finding the best matching pair of range-domain blocks. Different techniques have been analyzed for decreasing the number of operations required for this range-domain matching. Encoding time can be saved by reducing the domain search pool for each range block. Domain blocks can be classified based on local fractal dimension. Fractal dimension is being studied as a measure to analyze the complexity of image portions. This paper proposes application of height balanced binary search trees for storing domain information ordered in terms of the local fractal dimension. The approach is to prepare the domain pool dynamically, by comparing the fractal dimension of range block with that of the domains. Domains with fractal dimension in an interval, evenly covering the fractal dimension of range block alone are given for comparison. We use AVL trees to enlist the domains based on their fractal dimension. The domain pool is prepared at runtime. Since the tree organization is used in the preprocessing phase, the proposed method can be used with any algorithm for fractal compression.
Authors and Affiliations
JAYAMOHAN M. , K. REVATHY
Keywords
Related Articles
- EP ID EP103313
- DOI -
- Views 148
- Downloads 0
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. T...
AN EFFICIENT APPROACH TO PERFORM PRE-PROCESSING
Nowadays, WWW (World Wide Web) becomes more popular and user friendly for transferring information. Therefore people are more interested in analyzing log files which can offer more useful insight into web site usage. Web...
KEYWORD EXTRACTION FOR PUNJABI LAGUAGE
This paper introduces keyword extraction for Punjabi language. Keywords are the index terms that contain the most important information about the contents of the document. Automatic keyword extraction is the task to iden...
QOS PARAMETER ANALYSIS ON AODV AND DSDV PROTOCOLS IN A WIRELESS NETWORK
Wireless networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment. To imp...
MOMENT AND DENSITY BASED HADWRITTEN MARATHI NUMERAL RECOGNITION
In this paper, we present an OCR for handwritten Marathi Numerals recognition using two sets of features, namely, density and central moments. Central moments of order 3 and 4 are computed globally for the numeral image...