Abstract
Many problems in medical image reconstruction and machine learning can be formulated as nonconvex set theoretic feasibility problems. Among efficient methods that can be put to work in practice, successive projection algorithms have received a lot of attention in the case of convex constraint sets. In the present work, we provide a theoretical study of a general projection method in the case where the constraint sets are nonconvex and satisfy some other structural properties. We apply our algorithm to image recovery in magnetic resonance imaging (MRI) and to a signal denoising in the spirit of Cadzow’s method.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference36 articles.
1. Convex Analysis and Monotone Operator Theory in Hilbert Spaces;Bauschke,2011
2. Alternating Projection Methods;Escalante,2011
3. The method of projections for finding the common point of convex sets;Gurin;Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki,1967
4. Strong convergence of projection-like methods in Hilbert spaces
5. Iterations of parallel convex projections in hilbert spaces