VLSI implementation of image compressor using probabilistic run length coding.
Saved in:
| Title: | VLSI implementation of image compressor using probabilistic run length coding. |
|---|---|
| Authors: | Boddu, Mahesh1 (AUTHOR), Mandal, Soumitra Kumar2 (AUTHOR) skmandal@nitttrkol.ac.in |
| Source: | Expert Systems. Jan2025, Vol. 42 Issue 1, p1-14. 14p. |
| Subjects: | Run-length encoding, Finite state machines, Block codes, Error probability, Fuzzy logic, Image compression |
| Abstract: | Multimedia applications, such as image processing including image and video transfer, heavily rely on reduction. The traditional device methods to picture reduction use more space, energy, and processing time. The majority of current efforts use the Golomb‐Rice encoding, due to its larger memory requirement and higher computing difficulty. So, this research concentrated on hardware design‐oriented probability run length (PRL) coding technique based on lossless colour image compression. The block truncation coding (BTC) features of the compression process are used by the suggested PRL method. The proposed image compression hardware consists of various modules such as a Parameter calculator, fuzzy table, bitmap generator, BTC parameters training, prediction, and error control, and PRL‐based finite state machine (PRL‐FSM). The proposed image compressor utilizes the parameter calculator block, which estimates the block type based on the image pixel intensities for each sub‐block. Thus, each block of the image is compressed by using a new block type and generates a variable block size. The proposed method utilizes the PRL‐BTC encoding method, which also calculates the probability of error between the compressed image to the test image. The process is iterated until the performance trade‐off between hardware cost and compression ratio (CR) is achieved. Hence, both smooth regions and non‐smooth regions of images are perfectly compressed by the probability‐based block selection. The simulation results show that the proposed method resulted in a better area, power, delay metrics, peak signal‐to‐noise ratio (PSNR), and CR compared to the state of art approaches. [ABSTRACT FROM AUTHOR] |
| Copyright of Expert Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Multimedia applications, such as image processing including image and video transfer, heavily rely on reduction. The traditional device methods to picture reduction use more space, energy, and processing time. The majority of current efforts use the Golomb‐Rice encoding, due to its larger memory requirement and higher computing difficulty. So, this research concentrated on hardware design‐oriented probability run length (PRL) coding technique based on lossless colour image compression. The block truncation coding (BTC) features of the compression process are used by the suggested PRL method. The proposed image compression hardware consists of various modules such as a Parameter calculator, fuzzy table, bitmap generator, BTC parameters training, prediction, and error control, and PRL‐based finite state machine (PRL‐FSM). The proposed image compressor utilizes the parameter calculator block, which estimates the block type based on the image pixel intensities for each sub‐block. Thus, each block of the image is compressed by using a new block type and generates a variable block size. The proposed method utilizes the PRL‐BTC encoding method, which also calculates the probability of error between the compressed image to the test image. The process is iterated until the performance trade‐off between hardware cost and compression ratio (CR) is achieved. Hence, both smooth regions and non‐smooth regions of images are perfectly compressed by the probability‐based block selection. The simulation results show that the proposed method resulted in a better area, power, delay metrics, peak signal‐to‐noise ratio (PSNR), and CR compared to the state of art approaches. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 02664720 |
| DOI: | 10.1111/exsy.13398 |
