1 code implementation • 14 Feb 2022 • Seokju Cho, Sunghwan Hong, Seungryong Kim
Cost aggregation is a highly important process in image matching tasks, which aims to disambiguate the noisy matching scores.
Ranked #1 on
Semantic correspondence
on SPair-71k
2 code implementations • 22 Dec 2021 • Sunghwan Hong, Seokju Cho, Jisu Nam, Seungryong Kim
We introduce a novel cost aggregation network, dubbed Volumetric Aggregation with Transformers (VAT), to tackle the few-shot segmentation task by using both convolutions and transformers to efficiently handle high dimensional correlation maps between query and support.
Ranked #1 on
Few-Shot Semantic Segmentation
on FSS-1000 (5-shot)
no code implementations • 17 Aug 2021 • Hojoon Lee, Dongyoon Hwang, Sunghwan Hong, Changyeon Kim, Seungryong Kim, Jaegul Choo
Successful sequential recommendation systems rely on accurately capturing the user's short-term and long-term interest.
1 code implementation • ICCV 2021 • Sunghwan Hong, Seungryong Kim
Conventional techniques to establish dense correspondences across visually or semantically similar images focused on designing a task-specific matching prior, which is difficult to model.
Ranked #1 on
Dense Pixel Correspondence Estimation
on HPatches
1 code implementation • NeurIPS 2021 • Seokju Cho, Sunghwan Hong, Sangryul Jeon, Yunsung Lee, Kwanghoon Sohn, Seungryong Kim
We propose a novel cost aggregation network, called Cost Aggregation Transformers (CATs), to find dense correspondences between semantically similar images with additional challenges posed by large intra-class appearance and geometric variations.
Ranked #2 on
Semantic correspondence
on PF-PASCAL