Abstract

The convex set feasibility framework has been widely applied to signal and image processing problems including signal deconvolution, tomographic reconstruction, band limited extrapolation, image restoration and image synthesis. In this paper, we consider convex constrained versions of inconsistent signal feasibility problems. First we derive some new properties of variational nonexpansive operators and convex projections. Based on these properties and fixed point theorems, we propose some types of algorithms called constrained parallel projection methods (CPPM) that solve the convex constrained versions of inconsistent signal feasibility problems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.