Modified Runlength Coding for Improved JPEG Performance

Gupta, Abhinav; Srivastava, Madhur; Pandey, Shubha; Bhandari, Vijay

doi:10.1109/icict.2007.375383

Cited by 7 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The enhancement was made so that the algorithm will deal with a small number of symbols and encoding RUN and LEVEL separately. Gupta et al [24] followed another approach to improve Run-Length coding algorithm by using three symbols (RUNLENGTH, SIZE, AMPLITUDE) instead of two (RUN/LEVEL) which is the standard of Run-Length algorithm. Their research was done for only gray scale images.…”

Section: Related Workmentioning

confidence: 99%

“…Many researchers are trying to optimize this algorithm to speed up the compression time of a gray scale image. Their proposed work was to optimize the algorithm either by encoding RUN and LEVEL separately [23] or by encoding three symbols (RUNLENGTH, SIZE, AMPLITUDE) instead of two, in addition the research was done only for the gray scale images [24]. However, in this paper, we are going to divide the array produced by the previous step into sub-arrays and scan these sub-arrays using Run Length algorithm at the same time which will make the compression process faster.…”

Section: Related Workmentioning

confidence: 99%

“…However, in this design we are going to approximate this approach by discarding the ending zeroes from the first array. In the original design in [24], they also discard EOB of 64 element array where these zeroes belong to the next 64 element array since the image was divided into blocks. The flowchart of P-RL algorithm is presented in Fig.…”

Section: B P-rl Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

FPGA Implementation of Enhanced JPEG Algorithm for Colored Images

Abed¹

2020

IJCDS

View full text Add to dashboard Cite

Image quality and size have been growing very fast over the last decades requiring large storage space and high transmission rate. Image compression is an efficient method used to reduce the size of the image. JPEG algorithm has been considered as one of the famous techniques used for image compression. This paper proposed and implemented an optimized hardware solution called Hybrid Compression using Faster Color Conversion and Run Length (HC-FCC-RL) algorithm for JPEG algorithm based on FPGA to reduce the latency and accelerate the compression process. The paper also proposed a Fast Color Conversion with Approximation (FCCA) step to accelerate the conversion process from RGB to YC b C r . Using approximate techniques will reduce the number of resources used as well as the latency with some percentage error. In addition, the paper proposed a Parallel Run Length (P-RL) algorithm to speed up the design. The enhancement approach in this paper aimed to optimize the overall design of the JPEG algorithm targeting color images. To evaluate the performance of the proposed framework, the HC-FCC-RL architecture was implemented in Verilog and synthesized on FPGA board. The color conversion architecture uses 331 logic elements, a latency of 13.930 ns for converting the three colors component of blocks and a power dissipation of 861.03 mW. The percentage errors for the color conversion is 11.6%, 1.8% and 5.3% for Y, C b , C r components, respectively. The Run Length algorithm performs better than existing work by saving 48.36% in logic elements, 53.79% in latency and 62.86% in power dissipation. Thus, the proposed work demonstrated superior performance compared to current work in the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: B P-rl Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

FPGA Implementation of Enhanced JPEG Algorithm for Colored Images

Abed¹

2020

IJCDS

View full text Add to dashboard Cite

show abstract

“…Although the proposed algorithm is no exception but aims towards the better or even equal compression rates(in worst case) as ever offered by the other algorithms by further modifying the conventional [7] and optimized run length coding [8].…”

Section: Related Workmentioning

confidence: 99%

Squashed JPEG Image Compression via Sparse Matrix

Qadir¹

2017

IJCSIT

View full text Add to dashboard Cite

To store and transmit digital images in least memory space and bandwidth image compression is needed. Image compression refers to the process of minimizing the image size by removing redundant data bits in a manner that quality of an image should not be degrade. Hence image compression reduces quantity of the image size without reducing its quality. In this paper it is being attempted to enhance the basic JPEG compression by reducing image size. The proposed technique is about amendment of the conventional run length coding for JPEG (Joint Photographic Experts Group) image compression by using the concept of sparse matrix. In this algorithm, the redundant data has been completely eliminated and hence leaving the quality of an image unaltered. The JPEG standard document specifies three steps: Discrete cosine transform, Quantization followed by Entropy coding. The proposed work aims at the enhancement of the third step which is Entropy coding.

show abstract

Improving image quality by SSIM based increase of run-length zeros in GPGPU JPEG encoding

Petersson

Grahn

2014

2014 48th Asilomar Conference on Signals, Systems and Computers

View full text Add to dashboard Cite

Modified Runlength Coding for Improved JPEG Performance

Cited by 7 publications

References 15 publications

FPGA Implementation of Enhanced JPEG Algorithm for Colored Images

FPGA Implementation of Enhanced JPEG Algorithm for Colored Images

Squashed JPEG Image Compression via Sparse Matrix

Improving image quality by SSIM based increase of run-length zeros in GPGPU JPEG encoding

Contact Info

Product

Resources

About