A Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling
원문 초록
In this paper a new fractal image compression algorithm is proposed in which the time of encoding process is considerably reduced. The algorithm exploits a domain pool reduction approach, along with using innovative predefined values for contrast scaling factor, S, instead of scanning the parameter space [0,1]. Within this approach only domain blocks with entropies greater than a threshold are considered. As a novel point, it is assumed that in each step of the encoding process, the domain block with small enough distance shall be found only for the range blocks with low activity (equivalently low entropy). This novel point is used to find reasonable estimations of S, and use them in the encoding process as predefined values, mentioned above. The algorithm has been examined for some well-known images. This result shows that our proposed algorithm considerably reduces the encoding time producing images that are approximately the same in quality.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Perception-Oriented Latent Coding for High-Performance Compressed Domain Semantic Inference
NIC-RobustBench: A Comprehensive Open-Source Toolkit for Neural Image Compression and Robustness Analysis
DiffO: Single-step Diffusion for Image Compression at Ultra-Low Bitrates
ABC: Adaptive BayesNet Structure Learning for Computational Scalable Multi-task Image Compression
Flexible Mixed Precision Quantization for Learned Image Compression
Structured Pruning and Quantization for Learned Image Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.