Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature

In color image processing based on mathematical optimization, a color-line image feature has been considered and many methods that give good results have been proposed. A color-line is a linear color distribution (correlation line) observed in a local image region, and is numerically represented by...

Full description

Bibliographic Details
Main Authors: Keiichiro Shirai, Yuya Ito, Hidetoshi Miyao, Minoru Maruyama
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9440957/
id doaj-7dad83fe405c4e23a07e025803dc959a
record_format Article
spelling doaj-7dad83fe405c4e23a07e025803dc959a2021-06-03T23:09:18ZengIEEEIEEE Access2169-35362021-01-019794497946010.1109/ACCESS.2021.30838959440957Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line FeatureKeiichiro Shirai0https://orcid.org/0000-0003-2072-5087Yuya Ito1Hidetoshi Miyao2https://orcid.org/0000-0002-7937-4894Minoru Maruyama3https://orcid.org/0000-0002-6406-0649Academic Assembly School of Science and Technology Institute of Engineering, Shinshu University, Nagano city, JapanAcademic Assembly School of Science and Technology Institute of Engineering, Shinshu University, Nagano city, JapanAcademic Assembly School of Science and Technology Institute of Engineering, Shinshu University, Nagano city, JapanAcademic Assembly School of Science and Technology Institute of Engineering, Shinshu University, Nagano city, JapanIn color image processing based on mathematical optimization, a color-line image feature has been considered and many methods that give good results have been proposed. A color-line is a linear color distribution (correlation line) observed in a local image region, and is numerically represented by the sparsity of a data matrix generated from the neighboring pixel values. However, the calculation requires a lot of processing time because each data matrix is processed by inverse calculation or singular value decomposition (SVD) with some operations on the decomposed singular values. In this paper, in order to address this problem, we propose a method that can effectively compute SVD for each data matrix. Using the experimental knowledge that matrices obtained from neighboring regions (each centered at an adjacent pixel) are similar to each other, we intentionally design the SVD by using an iterative method (Arnoldi iteration), and propagate the converged singular vectors at a pixel to the next pixel as the initial vectors of the iteration. This propagation can drastically reduce the number of iterations required for convergence. Additionally, the singular values and vectors are obtained in descending order, which is advantageous when a matrix is reconstructed after reducing small singular values, so we can truncate the calculation when a singular value becomes lower than a threshold value. To show the effectiveness, we apply the proposed method to a denoising method, arranged structure-tensor total variation (ASTV), and show that the processing time is shortened by 95% compared to the naive method without losing numerical accuracy.https://ieeexplore.ieee.org/document/9440957/Color image processinghyper spectral imagessingular value decompositionsparse representation
collection DOAJ
language English
format Article
sources DOAJ
author Keiichiro Shirai
Yuya Ito
Hidetoshi Miyao
Minoru Maruyama
spellingShingle Keiichiro Shirai
Yuya Ito
Hidetoshi Miyao
Minoru Maruyama
Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
IEEE Access
Color image processing
hyper spectral images
singular value decomposition
sparse representation
author_facet Keiichiro Shirai
Yuya Ito
Hidetoshi Miyao
Minoru Maruyama
author_sort Keiichiro Shirai
title Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
title_short Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
title_full Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
title_fullStr Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
title_full_unstemmed Efficient Pixel-Wise SVD Required for Image Processing Using the Color Line Feature
title_sort efficient pixel-wise svd required for image processing using the color line feature
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2021-01-01
description In color image processing based on mathematical optimization, a color-line image feature has been considered and many methods that give good results have been proposed. A color-line is a linear color distribution (correlation line) observed in a local image region, and is numerically represented by the sparsity of a data matrix generated from the neighboring pixel values. However, the calculation requires a lot of processing time because each data matrix is processed by inverse calculation or singular value decomposition (SVD) with some operations on the decomposed singular values. In this paper, in order to address this problem, we propose a method that can effectively compute SVD for each data matrix. Using the experimental knowledge that matrices obtained from neighboring regions (each centered at an adjacent pixel) are similar to each other, we intentionally design the SVD by using an iterative method (Arnoldi iteration), and propagate the converged singular vectors at a pixel to the next pixel as the initial vectors of the iteration. This propagation can drastically reduce the number of iterations required for convergence. Additionally, the singular values and vectors are obtained in descending order, which is advantageous when a matrix is reconstructed after reducing small singular values, so we can truncate the calculation when a singular value becomes lower than a threshold value. To show the effectiveness, we apply the proposed method to a denoising method, arranged structure-tensor total variation (ASTV), and show that the processing time is shortened by 95% compared to the naive method without losing numerical accuracy.
topic Color image processing
hyper spectral images
singular value decomposition
sparse representation
url https://ieeexplore.ieee.org/document/9440957/
work_keys_str_mv AT keiichiroshirai efficientpixelwisesvdrequiredforimageprocessingusingthecolorlinefeature
AT yuyaito efficientpixelwisesvdrequiredforimageprocessingusingthecolorlinefeature
AT hidetoshimiyao efficientpixelwisesvdrequiredforimageprocessingusingthecolorlinefeature
AT minorumaruyama efficientpixelwisesvdrequiredforimageprocessingusingthecolorlinefeature
_version_ 1721398467549462528