Projection methods for finding intersection of two convex sets and their use in signal processing problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F21%3A00545397" target="_blank" >RIV/67985556:_____/21:00545397 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.2352/ISSN.2470-1173.2021.10.IPAS-226" target="_blank" >http://dx.doi.org/10.2352/ISSN.2470-1173.2021.10.IPAS-226</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.2352/ISSN.2470-1173.2021.10.IPAS-226" target="_blank" >10.2352/ISSN.2470-1173.2021.10.IPAS-226</a>
Alternative languages
Result language
angličtina
Original language name
Projection methods for finding intersection of two convex sets and their use in signal processing problems
Original language description
Finding a point in the intersection of two closed convex sets is a common problem in image processing and other areas. Projections onto convex sets (POCS) is a standard algorithm for finding such a point. Dykstra’s projection algorithm is a well known alternative that finds the point in the intersection closest to a given point. Yet another lesser known alternative is the alternating direction method of multipliers (ADMM) that can be used for both purposes. In this paper we discuss the differences in the convergence of these algorithms in image processing problems. The ADMM applied to finding an arbitrary point in the intersection is much faster than POCS and any algorithm for finding the nearest point in the intersection.n
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-05360S" target="_blank" >GA18-05360S: Solving inverse problems for the analysis of fast moving objects</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Image Processing: Algorithms and Systems XIX
ISBN
—
ISSN
2470-1173
e-ISSN
2470-1173
Number of pages
6
Pages from-to
226
Publisher name
Society for Imaging Science and Technology
Place of publication
Springfield
Event location
Springfield (Online)
Event date
Jan 11, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—