Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
From MaRDI portal
Publication:5366447
DOI10.1109/TIP.2010.2045710zbMath1371.94242OpenAlexW2140772072WikidataQ39924521 ScholiaQ39924521MaRDI QIDQ5366447
Mina Karzand, Martin Vetterli, Yue M. Lu
Publication date: 9 October 2017
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tip.2010.2045710
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (3)
A non-interior continuation algorithm for solving the convex feasibility problem ⋮ Joint demosaicking and denoising benefits from a two-stage training strategy ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
This page was built for publication: Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
