Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

DOI10.1109/TIP.2010.2045710MaRDI QIDQ5366447zbMATH OpenOpenAlexWikidataFDO

Authors Yue M. Lu, Mina Karzand, Martin Vetterli

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

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited in

(3)

• A non-interior continuation algorithm for solving the convex feasibility problem
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• Joint demosaicking and denoising benefits from a two-stage training strategy

This page was built for publication: Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366447)