A new block-based fractal image coding algorithm called Fractal Block Coding in Residue Domain (FBCRD) is proposed. In basic Fractal Block Coding (FBC) algorithm, each block (called range block) is encoded by an affin...A new block-based fractal image coding algorithm called Fractal Block Coding in Residue Domain (FBCRD) is proposed. In basic Fractal Block Coding (FBC) algorithm, each block (called range block) is encoded by an affine mapping from a domain block within the same image to itself. The decoder uses the parameters of these mappings to synthesize the reconstructed image through an iterative procedure. FBCRD is a modification of basic FBC. In FBCRD, range blocks and domain blocks are all residue blocks subtracted from their block means and both the parameters of affine mappings and block means are coded. This modification leads to fewer iterations at the decoder. An optimized decoding strategy is also introduced which reduces total decoding time by more than half of that of basic FBC. This improvement is favorable for real time implementation of fractal image compression.展开更多
Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding schem...Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding scheme with annoying slow encoding speed . In this paper, we classify the image blocks by Classified Vector Quantization (CVQ) technique and present an Adaptive Block Truncation Coding (ABTC) scheme to process the midrange blocks in the image. By this method , we reduce the encoding time to one forty fifth comparing to ordinary FBC method with little change in compression ratio and a little decreased coded image quality.展开更多
Non-destructive testing （NDT） has been widely used in many fields, we can easily see it is being used in shipbuilding, aerospace, weapons manufacturing and so on. ICT is one of the best non destructive testing metho...Non-destructive testing （NDT） has been widely used in many fields, we can easily see it is being used in shipbuilding, aerospace, weapons manufacturing and so on. ICT is one of the best non destructive testing methods currently, but it has not been used widely, because it requires much compute and costs much time. Defect location is one of the most important processing steps in the digital image analysis. Defect location would correspondingly reduce the time spent in the testing. We may only require locating the defects in some case. So, we divide the CT images into several little blocks which the square is equal, and then calculate the fractal on each block. By determining the value and connected region number of the fractal dimension, we can locate defects of the image. The results show that the block ffactal dimension is a useful and time-saving defect location method.展开更多
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block co...This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.展开更多
Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal en...Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal encoding process. In this paper, a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block's neighbours is presented.Experimental results show that the proposed algorithm is very simple in implementation, fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding .展开更多
基金Defence Preresearch FoundationNational Science Foundation of Guangdong ProoinceNational "Chinbing" Project
文摘A new block-based fractal image coding algorithm called Fractal Block Coding in Residue Domain (FBCRD) is proposed. In basic Fractal Block Coding (FBC) algorithm, each block (called range block) is encoded by an affine mapping from a domain block within the same image to itself. The decoder uses the parameters of these mappings to synthesize the reconstructed image through an iterative procedure. FBCRD is a modification of basic FBC. In FBCRD, range blocks and domain blocks are all residue blocks subtracted from their block means and both the parameters of affine mappings and block means are coded. This modification leads to fewer iterations at the decoder. An optimized decoding strategy is also introduced which reduces total decoding time by more than half of that of basic FBC. This improvement is favorable for real time implementation of fractal image compression.
文摘Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding scheme with annoying slow encoding speed . In this paper, we classify the image blocks by Classified Vector Quantization (CVQ) technique and present an Adaptive Block Truncation Coding (ABTC) scheme to process the midrange blocks in the image. By this method , we reduce the encoding time to one forty fifth comparing to ordinary FBC method with little change in compression ratio and a little decreased coded image quality.
基金Supported by National Nature Science Foundation of China(No.61171177)
文摘Non-destructive testing （NDT） has been widely used in many fields, we can easily see it is being used in shipbuilding, aerospace, weapons manufacturing and so on. ICT is one of the best non destructive testing methods currently, but it has not been used widely, because it requires much compute and costs much time. Defect location is one of the most important processing steps in the digital image analysis. Defect location would correspondingly reduce the time spent in the testing. We may only require locating the defects in some case. So, we divide the CT images into several little blocks which the square is equal, and then calculate the fractal on each block. By determining the value and connected region number of the fractal dimension, we can locate defects of the image. The results show that the block ffactal dimension is a useful and time-saving defect location method.
基金supported by the National Natural Science Foundation of China(61171170) the Natural Science Foundation of Anhui Province(1408085QF115)
文摘This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
文摘Fast algorithms for reducing encoding complexity of fractal image coding have recently been an important research topic. Search of the best matched domain block is the most computation intensive part of the fractal encoding process. In this paper, a fast fractal approximation coding scheme implemented on a personal computer based on matching in range block's neighbours is presented.Experimental results show that the proposed algorithm is very simple in implementation, fast in encoding time and high in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding .
