| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0545397 |
| utime |
20240103230144.8 |
| mtime |
20210910235959.9 |
| DOI |
10.2352/ISSN.2470-1173.2021.10.IPAS-226 |
| title
(primary) (eng) |
Projection methods for finding intersection of two convex sets and their use in signal processing problems |
| specification |
| page_count |
6 s. |
| media_type |
E |
|
| serial |
| ARLID |
cav_un_epca*0545459 |
| ISSN |
Image Processing: Algorithms and Systems XIX |
| title
|
Image Processing: Algorithms and Systems XIX |
| publisher |
| place |
Springfield |
| name |
Society for Imaging Science and Technology |
| year |
2021 |
|
|
| keyword |
POCS |
| keyword |
Dykstra's projection algorithm |
| keyword |
ADMM |
| keyword |
JPEG |
| author
(primary) |
| ARLID |
cav_un_auth*0332672 |
| name1 |
Bílková |
| name2 |
Zuzana |
| institution |
UTIA-B |
| full_dept (cz) |
Zpracování obrazové informace |
| full_dept (eng) |
Department of Image Processing |
| department (cz) |
ZOI |
| department (eng) |
ZOI |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0108377 |
| name1 |
Šorel |
| name2 |
Michal |
| institution |
UTIA-B |
| full_dept (cz) |
Zpracování obrazové informace |
| full_dept |
Department of Image Processing |
| department (cz) |
ZOI |
| department |
ZOI |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| cas_special |
| project |
| project_id |
1583117 |
| agency |
GA UK |
| country |
CZ |
| ARLID |
cav_un_auth*0393033 |
|
| project |
| project_id |
SVV-2017-260452 |
| agency |
GA MŠk |
| country |
CZ |
| ARLID |
cav_un_auth*0393278 |
|
| project |
| project_id |
GA18-05360S |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0361425 |
|
| abstract
(eng) |
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 |
| action |
| ARLID |
cav_un_auth*0413788 |
| name |
Image Processing: Algorithms and Systems 2021 /19./ |
| dates |
20210111 |
| mrcbC20-s |
20210128 |
| place |
Springfield (Online) |
| country |
US |
|
| RIV |
IN |
| FORD0 |
10000 |
| FORD1 |
10200 |
| FORD2 |
10201 |
| reportyear |
2022 |
| num_of_auth |
2 |
| presentation_type |
PR |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0322144 |
| mrcbC61 |
1 |
| confidential |
S |
| article_num |
226 |
| arlyear |
2021 |
| mrcbU14 |
SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
WOS |
| mrcbU63 |
cav_un_epca*0545459 Image Processing: Algorithms and Systems XIX 2470-1173 Springfield Society for Imaging Science and Technology 2021 |
|