A Novel Fractal Wavelet Image Compression Approach

By investigating the limitation of existing wavelet tree based image compression methods, we propose a novel wavelet fractal image compression method in this paper. Briefly, the initial errors are appointed given the different levels of importance accorded the frequency sublevel band wavelet coefficients. Higher frequency sublevel bands would lead to larger initial errors. As a result, the sizes of sublevel blocks and super blocks would be changed according to the initial errors. The matching sizes between sublevel blocks and super blocks would be changed according to the permitted errors and compression rates. Systematic analyses are performed and the experimental results demonstrate that the proposed method provides a satisfactory performance with a clearly increasing rate of compression and speed of encoding without reducing SNR and the quality of decoded images. Simulation results show that our method is superior to the traditional wavelet tree based methods of fractal image compression.

An improved fast fractal image compression using spatial texture correlation

This paper utilizes a spatial texture correlation and the intelligent classification algorithm （ICA） search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.

An effective fractal image compression algorithm based on plane fitting

A new method using plane fitting to decide whether a domain block is similar enough to a given range block is proposed in this paper. First, three coefficients are computed for describing each range and domain block. Then, the best-matched one for every range block is obtained by analysing the relation between their coefficients. Experimental results show that the proposed method can shorten encoding time markedly, while the retrieved image quality is still acceptable. In the decoding step, a kind of simple line fitting on block boundaries is used to reduce blocking effects. At the same time, the proposed method can also achieve a high compression ratio.

Static Image Compression Based on Fractal Theory

In this paper, image compression and decompression are realized on a personal computer based on fractal theory. The algorithm is effectiveas as the reconstructed image is similar to the original. In the algorithm, the formulas for contrast scaling and luminance shift are simplified,and the Hausdorff distance is replaced by the Euclidean distance. Thus, the calculation load is reduced. The formula for compression ratio is presented for an ideal situation, from which one can analyze how the different factors influence image compression ratio.

Visual Evaluation of the Morphologic Structure of Nonwovens Using Image Analysis and Fractal Geometry

Nonwovens are fiber materials which are based on nonwoven technologies. For the complexity and randomness of nonwovens morphologic structures, it is difficult to express them effectively using classical method. Fractal geometry gives us a new idea and a powerful tool to study on irregularity of geometric objects. Therefore, we studied on the pore size, pore shape, pore size distribution and fiber orientation distribution of real nonwovens using fractal geometry combined with computer image analysis to evaluate nonwovens’ morphologic structures.

Application study of image segmentation methods on pattern recognition in the course of wood across-compression

Image segmentation is one of important steps on pattern recognition study in the course of wood across-compression. By comparing and studying processing methods in finding cell space and cell wall, this paper puts forward some image segmentation methods that are suitable for study of cell images of wood crossgrained compression. The method of spline function fitting was used for linking edges of cell, which perfects the study of pattern recognition in the course of wood across-compression.

Structured-light Image Compression Based on Fractal Theory

The method of fractal image compression is introduced which is applied to compress the line structured light image. Based on the self similarity of the structured light image, we attain satisfactory compression ratio and higher peak signal to noise ratio (PSNR). The experimental results indicate that this method can achieve high performance.

Fractal Image Compression Using Self-Organizing Mapping

One of the main disadvantages of fractal image data compression is a loss time in the process of image compression (encoding) and conversion into a system of iterated functions (IFS). In this paper, the idea of the inverse problem of fixed point is introduced. This inverse problem is based on collage theorem which is the cornerstone of the mathematical idea of fractal image compression. Then this idea is applied by iterated function system, iterative system functions and grayscale iterated function system down to general transformation. Mathematical formulation form is also provided on the digital image space, which deals with the computer. Next, this process has been revised to reduce the time required for image compression by excluding some parts of the image that have a specific milestone. The neural network algorithms have been applied on the process of compression (encryption). The experimental results are presented and the performance of the proposed algorithm is discussed. Finally, the comparison between filtered ranges method and self-organizing method is introduced.

A Distributed Web GIS Application Based on Component Technology and Fractal Image Compression

Geographic information system(GIS)technology is a combination of computer’s graphic and database to store and process spatial information.According to the users’ demands,GIS exports the exact geographic information and related in- formation for users with map and description through associating geographic place and related attributes.Based on the existing pop- ular technology,this paper presents a distributed web GIS application based on component technology and fractal image compres- sion.It presents the basic framework of the proposed system at first,and then discusses the key technology of implementing this sys- tem;finally it designs a three-layer WEB GIS instance using VC++ATL based on Geo Beans.The example suggests the proposed design is correct,feasible and valid.

MULTISCALE IMAGE SEGMENTATION USING FRACTAL AND NEURAL NETWORK

Clustering algorithms in feature space are important methods in image segmentation. The choice of the effective feature parameters and the construction of the clustering method are key problems encountered with clustering algorithms. In this paper, the multifractal dimensions are chosen as the segmentation feature parameters which are extracted from original image and wavelet-transformed image. SOM (Self-Organizing Map) network is applied to cluster the segmentation feature parameters. The experiment shows that the performance of the presented algorithm is very good.

Study of Symmetry Process Behavior in Fractal Gray Image Compression by Traditional Method

This paperstudiesthe effect of symmetry process on the compression parameters of thefractal image compression technique proposed by Jacquin.Two kinds of tests have been conducted. The first all kind of the symmetry operations [0-7] were taken;while the second tests were concentrated on studying the effect of the following parameters Block Size, Step Size, Domain Size on the probability distribution of symmetry operation. The results show that the higher value of PSNR and the lower value of ET occur atevensymmetry operation only, but compression ratio is not affected with symmetry process. Also the occurrence probability of even symmetry is more than odd symmetry for all compression parameters. This behaviour can be utilized to reducethe encoding time to 50% with preserving PSNR.

A mathematical morphological approach for region of interest coding of microscopy image compression

A novel mathematical morphological approach for region of interest(ROI) automatic determination and JPEG2000-based coding of microscopy image compression is presented.The algorithm is very fast and requires lower computing power,which is particularly suitable for some irregular region-based cell microscopy images with poor qualities.Firstly,an active threshold-based method is discussed to create a rough mask of regions of interest(cells).And then some morphological operations are designed and applied to achieve the segmentation of cells.In addition,an extra morphological operation,dilation,is applied to create the final mask with some redundancies to avoid the"edge effect"after removing false cells.Finally,ROI and region of background(ROB) are obtained and encoded individually in different compression ratio flexibly based on the JPEG2000,which can adjust the quality between ROI and ROB without coding for ROI shape.The experimental results certify the effectiveness of the proposed algorithm,and compared with JPEG2000,the proposed algorithm has better performance in both subjective quality and objective quality at the same compression ratios.

Semantic segmentation-based semantic communication system for image transmission

With the rapid development of artificial intelligence and the widespread use of the Internet of Things, semantic communication, as an emerging communication paradigm, has been attracting great interest. Taking image transmission as an example, from the semantic communication's view, not all pixels in the images are equally important for certain receivers. The existing semantic communication systems directly perform semantic encoding and decoding on the whole image, in which the region of interest cannot be identified. In this paper, we propose a novel semantic communication system for image transmission that can distinguish between Regions Of Interest (ROI) and Regions Of Non-Interest (RONI) based on semantic segmentation, where a semantic segmentation algorithm is used to classify each pixel of the image and distinguish ROI and RONI. The system also enables high-quality transmission of ROI with lower communication overheads by transmissions through different semantic communication networks with different bandwidth requirements. An improved metric θPSNR is proposed to evaluate the transmission accuracy of the novel semantic transmission network. Experimental results show that our proposed system achieves a significant performance improvement compared with existing approaches, namely, existing semantic communication approaches and the conventional approach without semantics.

A semantic segmentation-based underwater acoustic image transmission framework for cooperative SLAM

With the development of underwater sonar detection technology,simultaneous localization and mapping(SLAM)approach has attracted much attention in underwater navigation field in recent years.But the weak detection ability of a single vehicle limits the SLAM performance in wide areas.Thereby,cooperative SLAM using multiple vehicles has become an important research direction.The key factor of cooperative SLAM is timely and efficient sonar image transmission among underwater vehicles.However,the limited bandwidth of underwater acoustic channels contradicts a large amount of sonar image data.It is essential to compress the images before transmission.Recently,deep neural networks have great value in image compression by virtue of the powerful learning ability of neural networks,but the existing sonar image compression methods based on neural network usually focus on the pixel-level information without the semantic-level information.In this paper,we propose a novel underwater acoustic transmission scheme called UAT-SSIC that includes semantic segmentation-based sonar image compression(SSIC)framework and the joint source-channel codec,to improve the accuracy of the semantic information of the reconstructed sonar image at the receiver.The SSIC framework consists of Auto-Encoder structure-based sonar image compression network,which is measured by a semantic segmentation network's residual.Considering that sonar images have the characteristics of blurred target edges,the semantic segmentation network used a special dilated convolution neural network(DiCNN)to enhance segmentation accuracy by expanding the range of receptive fields.The joint source-channel codec with unequal error protection is proposed that adjusts the power level of the transmitted data,which deal with sonar image transmission error caused by the serious underwater acoustic channel.Experiment results demonstrate that our method preserves more semantic information,with advantages over existing methods at the same compression ratio.It also improves the error tolerance and packet loss resistance of transmission.

A Compression Algorithm of Hyperspectral Remote Sensing Image Based on 3-D Wavelet-Fractal Coder

In this paper, the 3-D Wavelet-Fractal coder was used to compress the hyperspectral remote sensing image, which is a combination of 3-D improved set partitioning in hierarchical trees （SPIHT） coding and 3-D fractal coding. Hyperspectral image date cube was first translated by 3-D wavelet and the 3-D fractal compression ceding was applied to lowest frequency subband. The remaining coefficients of higher frequency sub-bands were encoding by 3-D improved SPIHT. We used the block set instead of the hierarchical trees to enhance SPIHT＇s flexibility. The classical eight kinds of affme transformations in 2-D fractal image compression were generalized to nineteen for the 3-D fractal image compression. The new compression method had been tested on MATLAB. The experiment results indicate that we can gain high compression ratios and the information loss is acceptable.

A hyperspectral image compression algorithm based on wavelet transformation and fractal composition (AWFC)

Starting with a fractal-based image-compression algorithm based on wavelet transformation for hyperspectral images, the authors were able to obtain more spectral bands with the help of of hyperspectral remote sensing. Because large amounts of data and limited bandwidth complicate the storage and transmission of data measured by TB-level bits, it is important to compress image data acquired by hyperspectral sensors such as MODIS, PHI, and OMIS; otherwise, conventional lossless compression algorithms cannot reach adequate compression ratios. Other loss-compression methods can reach high compression ratios but lack good image fidelity, especially for hyperspectral image data. Among the third generation of image compression algorithms, fractal image compression based on wavelet transformation is superior to traditional compression methods,because it has high compression ratios and good image fidelity, and requires less computing time. To keep the spectral dimension invariable, the authors compared the results of two compression algorithms based on the storage-file structures of BSQ and of BIP, and improved the HV and Quadtree partitioning and domain-range matching algorithms in order to accelerate their encode/decode efficiency. The authors' Hyperspectral Image Process and Analysis System (HIPAS) software used a VC++6.0 integrated development environment (IDE), with which good experimental results were obtained. Possible modifications of the algorithm and limitations of the method are also discussed.

Chaos-based encryption for fractal image coding

A chaos-based cryptosystem for fractal image coding is proposed. The Renyi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence. Compared with the standard approach of fraetal image coding followed by the Advanced Encryption Standard, our scheme offers a higher sensitivity to both plaintext and ciphertext at a comparable operating efficiency. The keystream generated by the Renyi chaotic map passes the randomness tests set by the United States National Institute of Standards and Technology, and so the proposed scheme is sensitive to the key.

An Adaptive Block-Based Fractal Image Coding Scheme

Based on Jacquin's work. this paper presents an adaptive block-based fractal image coding scheme. Firstly. masking functions are used to classify range blocks and weight the mean Square error (MSE) of images. Secondly, an adaptive block partition scheme is introduced by developing the quadtree partition method. Thirdly. a piecewise uniform quantization strategy is appled to quantize the luminance shifting. Finally. experiment results are shown and compared with what reported by Jacquin and Lu to verify the validity of the methods addressed by the authors.

Fractal image encoding based on adaptive search

Finding the optimal algorithm between an efficient encoding process and therate distortion is the main research in fractal image compression theory. A new method has beenproposed based on the optimization of the Least-Square Error and the orthogonal projection. A largenumber of domain blocks can be eliminated in order to speed-up fractal image compression. Moreover,since the rate-distortion performance of most fractal image coders is not satisfactory, an efficientbit allocation algorithm to improve the rate distortion is also proposed. The implementation andcomparison have been done with the feature extraction method to prove the efficiency of the proposedmethod.