Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Multichannel Blind Deconvolution Using Low-rank and Sparse Decomposition
 
conference paper not in proceedings

Multichannel Blind Deconvolution Using Low-rank and Sparse Decomposition

Hosseini Kamal, Mahdad  
•
Vandergheynst, Pierre  
2013
SPARS

Multiple images of the same scene improve the result of multichannel blind deconvolution problem. However, existing techniques require alignment of channels. We define a multichannel deconvolution scheme for highly correlated images to estimated the blur kernel and the underlying images. The recovery algorithm is formulated by alternating minimization which is proved to have the convergence guarantee. The scheme does not require the image alignment and decompose the acquired images into a low-rank and sparse component in order to exploit different types of correlations. Our scheme has applications in video sequence, biomedical images, and light fields blind deconvolution.

  • Details
  • Metrics
Type
conference paper not in proceedings
Author(s)
Hosseini Kamal, Mahdad  
•
Vandergheynst, Pierre  
Date Issued

2013

Subjects

Convex optimization

•

Low-rank matrix recovery

•

Sparse recovery

•

Blind deconvolution

•

<S2

Editorial or Peer reviewed

NON-REVIEWED

Written at

OTHER

EPFL units
LTS2  
Event nameEvent date
SPARS

2013

Available on Infoscience
January 18, 2013
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/87951
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés