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 154
- Downloads 0
IMPROVED PROBABILISTIC INTEGRATED OBJECT RECOGNITION AND TRACKING (PIORT) METHODOLOGY
A thinning algorithm is used to reduce unnecessary information by peeling objects layer by layer so that the result is sufficient to allow topological analysis. It has several applications, but is particularly useful for...
DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimension...
A SURVEY OF TIME SERIES DATA PREDICTION ON SHOPPING MALL
Tremendous amount of data streams are often generated by dynamic environments such as stock’s and bond’s price indices, telecommunications data, audio and video data, Network traffic and data related to various Shopping...
APPLICATION OF DATA MINING IN BIOINFORMATICS
This article highlights some of the basic concepts of bioinformatics and data mining. The major research areas of bioinformatics are highlighted. The application of data mining in the domain of bioinformatics is explaine...
NETWORK INTRUSION DETECTION SYSTEM USING REDUCED DIMENSIONALITY
Intrusion Detection System (IDS) is the science of detection of malicious activity on a computer network and the basic driver for network security. It is defined as a process of monitoring the events occurring in a compu...