Abstract
Techniques for dense semantic correspondence have provided limited ability to deal with the geometric variations that commonly exist between semantically similar images. While variations due to scale and rotation have been examined, there is a lack of practical solutions for more complex deformations such as affine transformations because of the tremendous size of the associated solution space. To address this problem, we present a discrete-continuous transformation matching (DCTM) framework where dense affine transformation fields are inferred through a discrete label optimization in which the labels are iteratively updated via continuous regularization. In this way, our approach draws solutions from the continuous space of affine transformations in a manner that can be computed efficiently through constant-time edge-aware filtering and a proposed affine-varying CNN-based descriptor. Experimental results show that this model outperforms the state-of-the-art methods for dense semantic correspondence on various benchmarks.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2017 IEEE International Conference on Computer Vision, ICCV 2017 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 4539-4548 |
| Number of pages | 10 |
| ISBN (Electronic) | 9781538610329 |
| DOIs | |
| Publication status | Published - 2017 Dec 22 |
| Event | 16th IEEE International Conference on Computer Vision, ICCV 2017 - Venice, Italy Duration: 2017 Oct 22 → 2017 Oct 29 |
Publication series
| Name | Proceedings of the IEEE International Conference on Computer Vision |
|---|---|
| Volume | 2017-October |
| ISSN (Print) | 1550-5499 |
Other
| Other | 16th IEEE International Conference on Computer Vision, ICCV 2017 |
|---|---|
| Country | Italy |
| City | Venice |
| Period | 17/10/22 → 17/10/29 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Computer Vision and Pattern Recognition
Cite this
}
DCTM : Discrete-Continuous Transformation Matching for Semantic Flow. / Kim, Seungryong; Min, Dongbo; Lin, Stephen; Sohn, Kwanghoon.
Proceedings - 2017 IEEE International Conference on Computer Vision, ICCV 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 4539-4548 8237747 (Proceedings of the IEEE International Conference on Computer Vision; Vol. 2017-October).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - DCTM
T2 - Discrete-Continuous Transformation Matching for Semantic Flow
AU - Kim, Seungryong
AU - Min, Dongbo
AU - Lin, Stephen
AU - Sohn, Kwanghoon
PY - 2017/12/22
Y1 - 2017/12/22
N2 - Techniques for dense semantic correspondence have provided limited ability to deal with the geometric variations that commonly exist between semantically similar images. While variations due to scale and rotation have been examined, there is a lack of practical solutions for more complex deformations such as affine transformations because of the tremendous size of the associated solution space. To address this problem, we present a discrete-continuous transformation matching (DCTM) framework where dense affine transformation fields are inferred through a discrete label optimization in which the labels are iteratively updated via continuous regularization. In this way, our approach draws solutions from the continuous space of affine transformations in a manner that can be computed efficiently through constant-time edge-aware filtering and a proposed affine-varying CNN-based descriptor. Experimental results show that this model outperforms the state-of-the-art methods for dense semantic correspondence on various benchmarks.
AB - Techniques for dense semantic correspondence have provided limited ability to deal with the geometric variations that commonly exist between semantically similar images. While variations due to scale and rotation have been examined, there is a lack of practical solutions for more complex deformations such as affine transformations because of the tremendous size of the associated solution space. To address this problem, we present a discrete-continuous transformation matching (DCTM) framework where dense affine transformation fields are inferred through a discrete label optimization in which the labels are iteratively updated via continuous regularization. In this way, our approach draws solutions from the continuous space of affine transformations in a manner that can be computed efficiently through constant-time edge-aware filtering and a proposed affine-varying CNN-based descriptor. Experimental results show that this model outperforms the state-of-the-art methods for dense semantic correspondence on various benchmarks.
UR - http://www.scopus.com/inward/record.url?scp=85041900769&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85041900769&partnerID=8YFLogxK
U2 - 10.1109/ICCV.2017.485
DO - 10.1109/ICCV.2017.485
M3 - Conference contribution
AN - SCOPUS:85041900769
T3 - Proceedings of the IEEE International Conference on Computer Vision
SP - 4539
EP - 4548
BT - Proceedings - 2017 IEEE International Conference on Computer Vision, ICCV 2017
PB - Institute of Electrical and Electronics Engineers Inc.
ER -