The implicit convex feasibility problem and its application to adaptive image denoising
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 applicab...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
March 20, 2016
|
| In: |
Journal of computational mathematics
Year: 2016, Volume: 34, Issue: 6, Pages: 610-625 |
| ISSN: | 1991-7139 |
| Online Access: | Verlag, Volltext: http://www.global-sci.org/intro/article_detail.html?journal=jcm&article_id=9816
|
| Author Notes: | Yair Censor, Aviv Gibali, Frank Lenzen and Christoph Schnörr |
| Summary: | 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 |
|---|---|
| Item Description: | Gesehen am 19.12.2018 |
| Physical Description: | Online Resource |
| ISSN: | 1991-7139 |