Optimization Online


The implicit convex feasibility problem and its application to adaptive image denoising

Yair Censor(yair***at***math.haifa.ac.il)
Aviv Gibali(avivg***at***braude.ac.il)
Frank Lenzen(frank.lenzen***at***iwr.uni-heidelberg.de)
Christoph Schnörr(schnoerr***at***math.uni-heidelberg.de)

Abstract: The implicit convex feasibility problem attempts to find a point in the intersection of a finite family of convex sets, some of which are not explicitly determined but may vary. We develop simultaneous and sequential projection methods capable of handling such problems and demonstrate their applicability to image denoising in a specific medical imaging situation. By allowing the variable sets to undergo scaling, shifting and rotation, this work generalizes previous results wherein the implicit convex feasibility problem was used for cooperative wireless sensor network positioning where sets are balls and their centers were implicit.

Keywords: Implicit convex feasibility, split feasibility, projection methods, variable sets, proximity function, image denoising

Category 1: Convex and Nonsmooth Optimization

Category 2: Applications -- Science and Engineering (Biomedical Applications )

Citation: Journal of Computational Mathematics, accepted for publication.

Download: [PDF]

Entry Submitted: 06/18/2016
Entry Accepted: 06/18/2016
Entry Last Modified: 06/18/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society