The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Fractal Image technique is a lossy compression process utilized to find self similarities in images through range & domain rectangular blocks. A hybrid technique is proposed here with variable range block and optimum domain block using hexagonal structure of Spiral Architecture. The proposed method is tested & implemented on various categories of grey images obtaining significantly improved...
Fractal Image compression (FIC) is a new compression technique in the spatial domain. It is based on block based image compression technique which, detects and codes the existing similarities between different regions in the image. The main drawback of FIC is that the encoding time is comparatively very high, whereas the decompression is very fast. The encoding process consists of the searching for...
One of the main techniques used to de-noise and deblur signals and images is regularization, which is based on the fact that signals and images are usually smoother than noise. Traditional Tikhonov regularization assumes that signals and images are differentiable, but, as Mandelbrot has shown in his fractal theory, many signals and images are not differentiable. To de-noise and de-blur such images,...
The proposed technique presents adaptive new method used to decrease the encoding time in “fractal coding algorithms”. This technique reduces the “number of transforms” used to each domain block. So, the time required for the comparison between one “range block and domain blocks” is decreased. In this technique we partitioned the image depending on the Variance Criteria. Different block sizes ranging...
In this paper, a lemma, and two theorems for a bivariate fractal interpolation surface (BFIS) generated by an iterated function system (IFS) with an individual vertical scaling factor, are provided. Further, as a demonstration for the effect of the individual vertical scaling factor which characterizes the BFIS, the examples of higher resolution reconstructions from low resolution images are illustrated.
For satellite communication, large amount of data storage and transmission are involved as the satellites send data all the time, all day. Storing all these data and analyzing them for various purposes is possible using small low cost memory devices only with the help of image compression. Image compression is the process of removing the redundant information from the image and it can be stored to...
As of today, image compression is still being enhanced bringing new mathematical methods in this interesting field aiming to reduce images' sizes as well as maintaining good level of their corresponding reconstructed images. In this paper, we present a new image compression technique based on polynomial interpolation. It is based on the interpolation of image pixels and converting them into polynomial...
This paper presents a simple hardware architecture for quadtree(QT) partitioning based fractal image decoder. The decoding process in fractal based compression technique is an iterative process and utilizes the parameters extracted during encoding for converging to a fixed point, that approximates the original image. The adaptive sized partitioning scheme provides details of various regions at different...
Fractal compression is a lossy compression method for digital images based on fractals rather than pixels, which are best suited for textures and natural images. It works on self- similarity property in various fractions of images, relying on the fact that parts of an image often resemble other parts of the same image. It takes long encoding time and affects the image quality. This paper introduces...
In order to improve the quality of decoded images in fractal image coding, a novel method by making use of a modified image is proposed in this paper. Since the degradation of decoded images in fractal coding mainly comes from the poor self-similarity of the input image, a modified image that satisfies good self-similarity and approximates the original image well is constructed. After transforming...
Super Resolution (SR) is an interesting topic in video and image research. Super resolution image reconstruction (SRR) is one of the commonest SR technologies and has been proposed in many forms. SRR reconstructs a highresolution image from multiple low-resolution images. However, the low-resolution images require an aliasing process prior to reconstruction. The present paper analyzes SRR in the frequency...
The three-dimensional structure of branch type and bush type electrical trees were analyzed by using the X-ray computed tomography with the spatial resolution of 1.5 micrometer/voxel. The sliced images were reconstructed and treated by the computer software to calculate the fractal dimension of electrical tree. The three-dimensional structure obtained from X-ray computed tomography experiment was...
This paper proposes a novel algorithm for fractal coding of color image sequence, based on the extended CPM (Circular Prediction Mapping). In the extended CPM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Therefore the proposed domain-range mapping is similar to the block matching algorithm in the motion compensation techniques,...
Fractal image compression is an image compression technique which is based on local similarity of image structure. Fractal image compression provides good quality of reconstructed image and high compression ratio with extra feature of fast decompression. Fractal image compression suffers from time consumption in encoding phase. This paper presents a method to reduce the complexity in coding time....
An efficient and secure environment is necessary for data transmission and storage, especially for large-column multimedia data. In this study, a novel compression–encryption scheme is presented using a fractal dictionary and Julia set. For the compression in this scheme, fractal dictionary encoding not only reduces time consumption, but also gives good quality image reconstruction. For the encryption...
In this work we investigate whether cross endoscopic modality classification of colonic polyps is feasible, i.e. images of a high-magnification endoscope are used as training set to classify images of a high-definition endoscope. In order to compensate the scale differences between the images acquired with the different imaging modalities we apply different super-resolution methods to endoscopic high-definition...
In fractal compression the image to be encoded is partitioned into blocks called (ranges). Each range is coded by reference to some other part of the image called (domain) and by some affine transformation parameters. The number of ranges plays an important role in the compression ratio, encoding time and reconstructed image quality. In this paper, the fractal compression technique proposed by Jacquin...
With the improvement in technology of thin-film-transistor liquid-crystal display (TFT-LCD), the resolution requirement of display becomes higher and higher. Super-resolution algorithms are used to enlarge original low-resolution (LR) images to meet the visual quality of the high-resolution (HR) display. In this research, an efficient super resolution algorithm is proposed. The proposed algorithm...
According to the local characteristics of image similarity and transitivity, self-similarity and scale invariance characteristic of fractal characteristics, use fractal coding as the characteristic of similarity evaluation criteria, search internal image blocks and use the low resolution image analogy fusion in a single image to reconstruct a high resolution image information blocks, implement super-resolution...
According to the relationship between matching mean square error and ortho difference sum, range can find the best matching defined-domain within the narrower scope of search. At the same time, the defined-domain having smaller standard deviation will be excluded within the entire codebooks previously and all the ranges having smaller standard deviation will be substituted by their mean values during...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.