Deconvolution using projections onto the epigraph set of a convex cost function Conference Paper


Authors: Tofighi, M.; Bozkurt, A.; Kose, K.; Çetin, A. E.
Title: Deconvolution using projections onto the epigraph set of a convex cost function
Conference Title: 22nd Signal Processing and Communications Applications Conference, SIU 2014
Abstract: A new deconvolution algorithm based on making orthogonal projections onto the epigraph set of a convex cost function is presented. In this algorithm, the dimension of the minimization problem is lifted by one and sets corresponding to the cost function and observations are defined. If the utilized cost function is convex in RN, the corresponding epigraph set is also convex in RN+1. The deconvolution algorithm starts with an arbitrary initial estimate in RN+1. At each iteration cycle of the algorithm, first deconvolution projections are performed onto the hyperplanes representing observations, then an orthogonal projection is performed onto epigraph of the cost function. The method provides globally optimal solutions for total variation, l1, l2, and entropic cost functions. © 2014 IEEE.
Keywords: algorithms; signal processing; optimal solutions; deconvolution; iterative methods; minimization problems; orthogonal projection; cost functions; epigraph of a cost function; projection onto convex sets; total variation; convex cost function; deconvolution algorithm; initial estimate
Journal Title Proceedings of the 22nd Signal Processing and Communications Applications Conference (SIU) 2014
Conference Dates: 2014 Apr 23-25
Conference Location: Trabzon, Turkey
ISBN: 9781479948741
Publisher: IEEE  
Date Published: 2014-04-01
Start Page: 1638
End Page: 1641
Language: Turkish
DOI: 10.1109/siu.2014.6830560
PROVIDER: scopus
DOI/URL:
Notes: Signal Process. Commun. Appl. Conf., SIU - Proc. -- Conference code: 106053 -- Export Date: 1 August 2014 -- 23 April 2014 through 25 April 2014 -- Source: Scopus
Altmetric
Citation Impact
BMJ Impact Analytics
MSK Authors
  1. Kivanc Kose
    82 Kose