Skip to main navigation Skip to search Skip to main content

A Fast Algorithm for Image Deconvolution Based on a Rank Constrained Inverse Matrix Approximation Problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this paper, we present a fast method for image deconvolution, which is based on the rank constrained inverse matrix approximation (RCIMA) problem. The RCIMA problem is a general case of the low-rank approximation problem proposed by Eckart-Young. This new algorithm, so-called the fast-RCIMA method, is based on tensor product and Tikhonov’s regularization to approximate the pseudoinverse and bilateral random projections to estimate the rank constrained approximation. The fast-RCIMA method reduces the execution time to estimate optimal solution and preserves the same accuracy of classical methods. We use training data as a substitute for knowledge of a forward model. Numerical simulations on measuring execution time and speedup confirmed the efficiency of the proposed method.

Original languageEnglish
Title of host publicationProceedings of 6th International Congress on Information and Communication Technology, ICICT 2021
EditorsXin-She Yang, Simon Sherratt, Nilanjan Dey, Amit Joshi
PublisherSpringer Science and Business Media Deutschland GmbH
Pages165-176
Number of pages12
ISBN (Print)9789811623790
DOIs
StatePublished - 2022
Event6th International Congress on Information and Communication Technology, ICICT 2021 - Virtual, Online
Duration: 25 Feb 202126 Feb 2021

Publication series

NameLecture Notes in Networks and Systems
Volume236
ISSN (Print)2367-3370
ISSN (Electronic)2367-3389

Conference

Conference6th International Congress on Information and Communication Technology, ICICT 2021
CityVirtual, Online
Period25/02/2126/02/21

Keywords

  • Fast algorithm
  • Image deconvolution
  • Pseudoinverse
  • Rank constrained
  • Speedup

Fingerprint

Dive into the research topics of 'A Fast Algorithm for Image Deconvolution Based on a Rank Constrained Inverse Matrix Approximation Problem'. Together they form a unique fingerprint.

Cite this