A data compression algorithm for color images based on run-length coding and fractal geometry

2003 ◽  
Author(s):  
B.D. Goel ◽  
S.C. Kwatra
Keyword(s):  
Data Compression ◽  
Fractal Geometry ◽  
Color Images ◽  
Compression Algorithm ◽  
Run Length ◽  
Run Length Coding

scholarly journals Test Data Compression with Alternating Equal-Run-Length Coding

2018 ◽  
Vol 7 (4.10) ◽  
pp. 1089
Author(s):  
Sivanantham S ◽  
Aravind Babu S ◽  
Babu Ramki ◽  
Mallick P.S
Keyword(s):  
Data Compression ◽  
Test Data ◽  
Average Power ◽  
Original Data ◽  
Test Data Compression ◽  
Run Length ◽  
Run Length Coding ◽  
Data Volume ◽  
Ic Testing ◽  
Repeated Runs

This paper presents a new X-filling algorithm for test power reduction and a novel encoding technique for test data compression in scan-based VLSI testing. The proposed encoding technique focuses on replacing redundant runs of the equal-run-length vector with a shorter codeword. The effectiveness of this compression method depends on a number of repeated runs occur in the fully specified test set. In order to maximize the repeated runs with equal run length, the unspecified bits in the test cubes are filled with the proposed technique called alternating equal-run-length (AERL) filling. The resultant test data are compressed using the proposed alternating equal-run-length coding to reduce the test data volume. Efficient decompression architecture is also presented to decode the original data with lesser area overhead and power. Experimental results obtained from larger ISCAS'89 benchmark circuits show the efficiency of the proposed work. The AERL achieves up to 82.05 % of compression ratio as well as up to 39.81% and 93.20 % of peak and average-power transitions in scan-in mode during IC testing.  

Image data compression by DCT with adaptive run-length coding

1991 ◽  
Vol 37 (4) ◽  
pp. 860-866 ◽  
Author(s):  
S.-I. Arazaki ◽  
M. Saigusa ◽  
S. Hashiguchi ◽  
M. Ohki ◽  
M. Uchiyama ◽  
...  
Keyword(s):  
Data Compression ◽  
Image Data ◽  
Run Length ◽  
Run Length Coding ◽  
Image Data Compression

scholarly journals PENGEMBANGAN DAN ANALISIS KOMBINASI RUN LENGTH ENCODING DAN RELATIVE ENCODING UNTUK KOMPRESI CITRA

2016 ◽  
Vol 12 (2) ◽  
Author(s):  
Yosia Adi Jaya ◽  
Lukas Chrisantyo ◽  
Willy Sudiarto Raharjo
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Fast Algorithm ◽  
Data Transfer ◽  
Lossless Compression ◽  
Compression Algorithm ◽  
Storage Space ◽  
Run Length ◽  
Relative Value ◽  
Image Test

Data Compression can save some storage space and accelerate data transfer. Among many compression algorithm, Run Length Encoding (RLE) is a simple and fast algorithm. RLE can be used to compress many types of data. However, RLE is not very effective for image lossless compression because there are many little differences between neighboring pixels. This research proposes a new lossless compression algorithm called YRL that improve RLE using the idea of Relative Encoding. YRL can treat the value of neighboring pixels as the same value by saving those little differences / relative value separately. The test done by using various standard image test shows that YRL have an average compression ratio of 75.805% for 24-bit bitmap and 82.237% for 8-bit bitmap while RLE have an average compression ratio of 100.847% for 24-bit bitmap and 97.713% for 8-bit bitmap.

Sign in / Sign up

Export Citation Format

Share Document