A scratch covering algorithm using affine projection method

DOI10.1007/S11786-018-0342-8MaRDI QIDQ1993383zbMATH OpenOpenAlexWikidataFDO

Authors Irina Maria Artinescu, Liviu Octavian Mafteiu-Scai

Publication date 5 November 2018

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-018-0342-8

zbMATH Keywords

convex feasibility problemimage recoveryinpaintingaffine projection

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• A scratch removal method
• Scratch repair algorithm based on \(5 \times 5\) neighborhood pixels correlation
• Free gradient discontinuity and image inpainting
• scientific article; zbMATH DE number 11803
• A framelet-based image inpainting algorithm

Cites work

• Hilbertian convex feasibility problem: Convergence of projection methods
• On Projection Algorithms for Solving Convex Feasibility Problems
• The method of projections for finding the common point of convex sets

Cited in

(3)

• Scratch repair algorithm based on \(5 \times 5\) neighborhood pixels correlation
• A scratch removal method
• "A visual and numerical comparative study of some parallel affine projection algorithms for solving the convex feasibility problem with application to scratch inpainting"

This page was built for publication: A scratch covering algorithm using affine projection method

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