Author
Listed:
- D. Linett Sophia
- S. Kavitha
Abstract
The digital images play a major part in variety of fields such medical, satellite, remote sensing, etc. Advancements in information technology have resulted in a huge number of digital images to be stored and transmitted. Since the demand for storage capacity and communication bandwidth exceeds the available supply capacity, image compression techniques are carried out to overcome these limitations. Many compression algorithms have been proposed to meet these limitations; however, the computational complexity and faster compression rate issues are still challenging. In this research, a simple compression algorithm using Hybrid transformation such as fast wavelet transform (FWT) and discrete cosine transform (DCT) is used to decompose an image signal. Then a fast matrix rank algorithm (FMRA) using the magical graph method is used to compress and encode the image efficiently. The standard test images are used to evaluate the performance of the proposed algorithm in terms of CR, PSNR and MSE using MATLAB software. The proposed scheme works better in terms of its coding complexity and timing constraints compared with state of art algorithms. The findings imply that the proposed approach can be effectively applied in real-time systems such as medical imaging, satellite and wireless sensor networks where low memory use and high speed are essential, offering an important policy and application implication. The originality of this work lies in introducing a hybrid transform framework that integrates FWT, DCT and an FMRA to achieve high compression efficiency with reduced computational complexity.
Suggested Citation
D. Linett Sophia & S. Kavitha, 2026.
"An efficient hybrid transform algorithm for image compression using a matrix rank-based optimization approach,"
African Journal of Science, Technology, Innovation and Development, Taylor & Francis Journals, vol. 18(1), pages 83-95, January.
Handle:
RePEc:taf:rajsxx:v:18:y:2026:i:1:p:83-95
DOI: 10.1080/20421338.2025.2601667
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:rajsxx:v:18:y:2026:i:1:p:83-95. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rajs .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.