Tofighi, M.Çetin, A. Enis2018-04-122018-04-122017http://hdl.handle.net/11693/37632Date of Conference: 7-9 December 2016Conference Name: IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016A new deconvolution algorithm based on orthogonal projections onto the hyperplanes and the epigraph set of a convex cost function is presented. In this algorithm, the convex sets corresponding to the cost function are defined by increasing the dimension of the minimization problem by one. The Filtered Variation (FV) function is used as the convex cost function in this algorithm. Since the FV cost function is a convex function in RN, then the corresponding epigraph set is also a convex set in the lifted set in RN+1. At each step of the iterative deconvolution algorithm, starting with an arbitrary initial estimate in RN+1, first the projections onto the hyperplanes are performed to obtain the first deconvolution estimate. Then an orthogonal projection is performed onto the epigraph set of the FV cost function, in order to regularize and denoise the deconvolution estimate, in a sequential manner. The algorithm converges to the deblurred image.EnglishDeconvolutionEpigraph set of a convex cost functionFiltered variationProjection onto convex setsCost benefit analysisCost functionsIterative methodsOrthogonal functionsConvex cost functionDeconvolution algorithmIterative deconvolution algorithmsMinimization problemsOrthogonal projectionSequential mannersConference Paper10.1109/GlobalSIP.2016.7905805