File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TPAMI.2023.3316770
- Scopus: eid_2-s2.0-85178664439
- WOS: WOS:001123923900020
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: DualRC: A Dual-Resolution Learning Framework With Neighbourhood Consensus for Visual Correspondences
Title | DualRC: A Dual-Resolution Learning Framework With Neighbourhood Consensus for Visual Correspondences |
---|---|
Authors | |
Keywords | Correspondence estimation dense matching geometric matching semantic matching |
Issue Date | 19-Sep-2024 |
Publisher | Institute of Electrical and Electronics Engineers |
Citation | IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024, v. 46, n. 1, p. 236-249 How to Cite? |
Abstract | We address the problem of establishing accurate correspondences between two images. We present a flexible framework that can easily adapt to both geometric and semantic matching. Our contribution consists of three parts. Firstly, we propose an end-to-end trainable framework that uses the coarse-to-fine matching strategy to accurately find the correspondences. We generate feature maps in two levels of resolution, enforce the neighbourhood consensus constraint on the coarse feature maps by 4D convolutions and use the resulting correlation map to regulate the matches from the fine feature maps. Secondly, we present three variants of the model with different focuses. Namely, a universal correspondence model named DualRC that is suitable for both geometric and semantic matching, an efficient model named DualRC-L tailored for geometric matching with a lightweight neighbourhood consensus module that significantly accelerates the pipeline for high-resolution input images, and the DualRC-D model in which we propose a novel dynamically adaptive neighbourhood consensus module (DyANC) that dynamically selects the most suitable non-isotropic 4D convolutional kernels with the proper neighbourhood size to account for the scale variation. Last, we thoroughly experiment on public benchmarks for both geometric and semantic matching, showing superior performance in both cases. |
Persistent Identifier | http://hdl.handle.net/10722/339380 |
ISSN | 2023 Impact Factor: 20.8 2023 SCImago Journal Rankings: 6.158 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Xinghui | - |
dc.contributor.author | Han, Kai | - |
dc.contributor.author | Li, Shuda | - |
dc.contributor.author | Prisacariu, Victor | - |
dc.date.accessioned | 2024-03-11T10:36:08Z | - |
dc.date.available | 2024-03-11T10:36:08Z | - |
dc.date.issued | 2024-09-19 | - |
dc.identifier.citation | IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024, v. 46, n. 1, p. 236-249 | - |
dc.identifier.issn | 0162-8828 | - |
dc.identifier.uri | http://hdl.handle.net/10722/339380 | - |
dc.description.abstract | <p>We address the problem of establishing accurate correspondences between two images. We present a flexible framework that can easily adapt to both geometric and semantic matching. Our contribution consists of three parts. Firstly, we propose an end-to-end trainable framework that uses the coarse-to-fine matching strategy to accurately find the correspondences. We generate feature maps in two levels of resolution, enforce the neighbourhood consensus constraint on the coarse feature maps by 4D convolutions and use the resulting correlation map to regulate the matches from the fine feature maps. Secondly, we present three variants of the model with different focuses. Namely, a universal correspondence model named DualRC that is suitable for both geometric and semantic matching, an efficient model named DualRC-L tailored for geometric matching with a lightweight neighbourhood consensus module that significantly accelerates the pipeline for high-resolution input images, and the DualRC-D model in which we propose a novel dynamically adaptive neighbourhood consensus module (DyANC) that dynamically selects the most suitable non-isotropic 4D convolutional kernels with the proper neighbourhood size to account for the scale variation. Last, we thoroughly experiment on public benchmarks for both geometric and semantic matching, showing superior performance in both cases.</p> | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.relation.ispartof | IEEE Transactions on Pattern Analysis and Machine Intelligence | - |
dc.subject | Correspondence estimation | - |
dc.subject | dense matching | - |
dc.subject | geometric matching | - |
dc.subject | semantic matching | - |
dc.title | DualRC: A Dual-Resolution Learning Framework With Neighbourhood Consensus for Visual Correspondences | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/TPAMI.2023.3316770 | - |
dc.identifier.scopus | eid_2-s2.0-85178664439 | - |
dc.identifier.volume | 46 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 236 | - |
dc.identifier.epage | 249 | - |
dc.identifier.eissn | 1939-3539 | - |
dc.identifier.isi | WOS:001123923900020 | - |
dc.identifier.issnl | 0162-8828 | - |