no code implementations • 17 Mar 2024 • Sunghwan Hong, Seokju Cho, Seungryong Kim, Stephen Lin
In this work, we first show that feature aggregation and cost aggregation exhibit distinct characteristics and reveal the potential for substantial benefits stemming from the judicious use of both aggregation processes.
1 code implementation • 12 Dec 2023 • Sunghwan Hong, Jaewoo Jung, Heeseong Shin, Jiaolong Yang, Seungryong Kim, Chong Luo
This work delves into the task of pose-free novel view synthesis from stereo pairs, a challenging and pioneering task in 3D vision.
1 code implementation • 23 May 2023 • Susung Hong, Junyoung Seo, Heeseong Shin, Sunghwan Hong, Seungryong Kim
In the paradigm of AI-generated content (AIGC), there has been increasing attention to transferring knowledge from pre-trained text-to-image (T2I) models to text-to-video (T2V) generation.
3 code implementations • 21 Mar 2023 • Seokju Cho, Heeseong Shin, Sunghwan Hong, Anurag Arnab, Paul Hongsuck Seo, Seungryong Kim
Open-vocabulary semantic segmentation presents the challenge of labeling each pixel within an image based on a wide range of text descriptions.
Ranked #1 on Open Vocabulary Semantic Segmentation on ADE20K-150
1 code implementation • 6 Oct 2022 • Sunghwan Hong, Jisu Nam, Seokju Cho, Susung Hong, Sangryul Jeon, Dongbo Min, Seungryong Kim
Existing pipelines of semantic correspondence commonly include extracting high-level semantic features for the invariance against intra-class variations and background clutters.
no code implementations • 19 Sep 2022 • Sunghwan Hong, Seokju Cho, Seungryong Kim, Stephen Lin
The current state-of-the-art are Transformer-based approaches that focus on either feature descriptors or cost volume aggregation.
Ranked #1 on Geometric Matching on HPatches
1 code implementation • 22 Jul 2022 • Sunghwan Hong, Seokju Cho, Jisu Nam, Stephen Lin, Seungryong Kim
However, the tokenization of a correlation map for transformer processing can be detrimental, because the discontinuity at token boundaries reduces the local context available near the token edges and decreases inductive bias.
Ranked #2 on Semantic correspondence on PF-WILLOW
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 #3 on Semantic correspondence on PF-PASCAL
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 #3 on Semantic correspondence on PF-WILLOW
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 (using extra training data)
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 #5 on Semantic correspondence on PF-WILLOW