QKRK FACTORIZATION FOR IMAGE COMPRESSION

Erik Eckenberg, Knarik Tunyan

DOI Number
https://doi.org/10.22190/FUMI210825038E
First page
563
Last page
578

Abstract


We store and exchange more digital images than ever before. Image qualities are often reduced to decrease the cost of storage and transfer of the images. Digital image compression is a technique that reduces the size of an image while preserving its quality to be acceptable for a particular purpose. Matrix factorizations are widely used for this purpose. This paper presents an application of the QKRK and block QKRK factorizations of a matrix to image compression. We have conducted a series of experiments using Matlab software. This paper presents the comparative analysis of the compressed images using the QR, SV D, QKRK, and block QKRK factorizations. The similarity between the original and compressed images is measured using the L2-norm and structural similarity. It is demonstrated that using the QKRK factorization for image compression allows the achievement of the desired quality of a fragment of the image compared to the rest of the image and is also computationally efficient.

Keywords

QKRK factorization, QR factorization, SV D factorization, block QKRK factorization.

Full Text:

PDF

References


K. E. Asnaoui: Image compression based on block SV D power method. Journal of Intelligent Systems, 29(1) (2020), 1345-1359.

S. Chountasis, D. Pappas and V. Katsikis: Image restoration via fast computing of the Moore-Penrose inverse matrix. 16th International Conference on Systems, Signals and Image Processing, Chalkida, Greece (2009). doi:10.1109/IWSSIP.2009.5367731

M. T. Chu, R. E. Funderlic and R. J. Plemmons: Structured low rank approximation. Linear Algebra and Its Applications, 366 (2003), 157-172.

H. Dadkhahi, A. Gotchev and K. Egiazarian: Inverse polynomial reconstruction method in DCT domain. EURASIP Journal on Advances in Signal Processing, 2012(133) (2012).

C. Eckart and G. Young: The approximation of one matrix by another of lower rank. Psychometrika, 1 (1936), 211-218.

G. E. Forsythe and C. B. Moler: Computer Solution of Linear Algebraic Systems. Prentice Hall, Englewood Cliffs, New Jersey, (1967).

G. H. Golub and C. F. Van Loan: Matrix Computations. The Johns Hopkins University Press, Baltimore, Maryland, 4th edition, (2013).

N. Halko, P. G. Martinsson and J. A. Tropp: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2) (2011), 217-288.

N. J. Higham: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA, (1996)

A. J. Hussain, A. Al-Fayadh and N. Radi: Image compression techniques: A survey in lossless and lossy algorithms. Neurocomputing, 300 (2018), 44-69.

W. Jang and S-Y. Lee: Partial image encryption using format-preserving encryption in image processing systems for Internet of things environment. International Journal on Distributed Sensor Networks, 16(3) (2020).

S. Krivenko, V. Lukin, O. Krylova and K. Egiazarian: A fast method of visually lossless compression of dental images. Applied sciences, 11(1) (2021).

R. Kumar, U. Patbhaje and A. Kumar: An efficient technique for image compression and quality retrieval using matrix completion. Computer and Information Sciences, 34(4) (2022), 1231-1239.

K. Li and G. Wu: A randomized generalized low rank approximations of matrices algorithm for high dimensionality reduction and image compression. Numerical Linear Algebra with Applications, 28(1) (2021).

P. G. Martinsson and S. Voronin: A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices. SIAM Journal on Scientific Computing, 38(5) (2016), S485-S507.

W. S. Ng and W. W. Tan: Some properties of various types of matrix factorization. The 16th International Conference on Mathematics, Statistics, and Their Applications, ITM Web Conf., 36 (2021). doi:10.1051/itmconf/20213603003

A. Pandey and S. Shrotriya: Comparing the effect of matrix factorization techniques in reducing the time complexity for traversing the big data of recommendation systems. International Journal of Computer and Communication Engineering, 2(2) (2013), 170-173.

M. A. Rahman, M. Hamada and J. Shin: The impact of state-of the-art techniques for lossless still image compression. Electronics, 3(10(360)) (2021), 1-40.

A. Rowayda: SVD based image processing applications: state of the art, contributions and research challenges. International Journal of Advanced Computer Science and Applications, 7(3) (2012), 26-34.

Q. Su, Y. Niu, G. Wang, S. Jia and J. Yue: Color image blind watermarking scheme based on QR decomposition. Signal Processing, 94 (2014), 219-235.

A. D. Tuniev: Pivot vector method and its applications. Cybernetics and Systems Analysis, 28(1) (1992), 99-109.

K. Tunyan, K. Egiazarian, A. Tuniev and J. Astola: An efficient approach to the linear least squares problem. SIAM J. Matrix Anal. Appl., 26(2) (2005), 583-598.

Z. Wang, A. C. Bovik, H. R. Sheikh and E. P. Simoncelli: Image quality assessment: from error visibility to structural similarity. IEEE Transactions on Image Processing, 13(4) (2004), 600-612.

J. H. Wilkinson: Rounding Errors in Algebraic Processes. Prentice Hall, Englewood Cliffs, New Jersey, (1963).

J. Xiao, M. Gu and J. Langou: Fast parallel randomized QR with column pivoting algorithms for reliable low-rank matrix approximations. IEEE 24th International Conference on High Performance Computing (HiPC), (2017), 233-242. doi:10.1109/HiPC.2017.00035




DOI: https://doi.org/10.22190/FUMI210825038E

Refbacks

  • There are currently no refbacks.




© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)