Efficient Semantic Matching with Hypercolumn Correlation
- URL: http://arxiv.org/abs/2311.04336v1
- Date: Tue, 7 Nov 2023 20:40:07 GMT
- Title: Efficient Semantic Matching with Hypercolumn Correlation
- Authors: Seungwook Kim, Juhong Min, Minsu Cho
- Abstract summary: HCCNet is an efficient yet effective semantic matching method.
It exploits the full potential of multi-scale correlation maps.
It eschews the reliance on expensive match-wise relationship mining on the 4D correlation map.
- Score: 58.92933923647451
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent studies show that leveraging the match-wise relationships within the
4D correlation map yields significant improvements in establishing semantic
correspondences - but at the cost of increased computation and latency. In this
work, we focus on the aspect that the performance improvements of recent
methods can also largely be attributed to the usage of multi-scale correlation
maps, which hold various information ranging from low-level geometric cues to
high-level semantic contexts. To this end, we propose HCCNet, an efficient yet
effective semantic matching method which exploits the full potential of
multi-scale correlation maps, while eschewing the reliance on expensive
match-wise relationship mining on the 4D correlation map. Specifically, HCCNet
performs feature slicing on the bottleneck features to yield a richer set of
intermediate features, which are used to construct a hypercolumn correlation.
HCCNet can consequently establish semantic correspondences in an effective
manner by reducing the volume of conventional high-dimensional convolution or
self-attention operations to efficient point-wise convolutions. HCCNet
demonstrates state-of-the-art or competitive performances on the standard
benchmarks of semantic matching, while incurring a notably lower latency and
computation overhead compared to the existing SoTA methods.
Related papers
- Local All-Pair Correspondence for Point Tracking [59.76186266230608]
We introduce LocoTrack, a highly accurate and efficient model designed for the task of tracking any point (TAP) across video sequences.
LocoTrack achieves unmatched accuracy on all TAP-Vid benchmarks and operates at a speed almost 6 times faster than the current state-of-the-art.
arXiv Detail & Related papers (2024-07-22T06:49:56Z) - Label-efficient Segmentation via Affinity Propagation [27.016747627689288]
Weakly-supervised segmentation with label-efficient sparse annotations has attracted increasing research attention to reduce the cost of laborious pixel-wise labeling process.
We formulate the affinity modeling as an affinity propagation process, and propose a local and a global pairwise affinity terms to generate accurate soft pseudo labels.
An efficient algorithm is also developed to reduce significantly the computational cost.
arXiv Detail & Related papers (2023-10-16T15:54:09Z) - Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
We show that semantic correlations between relations are inherently edge-level and entity-independent.
We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations.
To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
arXiv Detail & Related papers (2023-09-20T08:11:58Z) - FECANet: Boosting Few-Shot Semantic Segmentation with Feature-Enhanced
Context-Aware Network [48.912196729711624]
Few-shot semantic segmentation is the task of learning to locate each pixel of a novel class in a query image with only a few annotated support images.
We propose a Feature-Enhanced Context-Aware Network (FECANet) to suppress the matching noise caused by inter-class local similarity.
In addition, we propose a novel correlation reconstruction module that encodes extra correspondence relations between foreground and background and multi-scale context semantic features.
arXiv Detail & Related papers (2023-01-19T16:31:13Z) - ECO-TR: Efficient Correspondences Finding Via Coarse-to-Fine Refinement [80.94378602238432]
We propose an efficient structure named Correspondence Efficient Transformer (ECO-TR) by finding correspondences in a coarse-to-fine manner.
To achieve this, multiple transformer blocks are stage-wisely connected to gradually refine the predicted coordinates.
Experiments on various sparse and dense matching tasks demonstrate the superiority of our method in both efficiency and effectiveness against existing state-of-the-arts.
arXiv Detail & Related papers (2022-09-25T13:05:33Z) - Spatial-Spectral Clustering with Anchor Graph for Hyperspectral Image [88.60285937702304]
This paper proposes a novel unsupervised approach called spatial-spectral clustering with anchor graph (SSCAG) for HSI data clustering.
The proposed SSCAG is competitive against the state-of-the-art approaches.
arXiv Detail & Related papers (2021-04-24T08:09:27Z) - Hypercorrelation Squeeze for Few-Shot Segmentation [33.45698767126036]
Few-shot semantic segmentation aims at learning to segment a target object from a query image using only a few annotated support images of the target class.
This challenge requires to understand diverse levels of visual cues and analyze fine-grained correspondence relations between the query and the support images.
We propose Hypercorrelation Squeeze Networks (HSNet) that leverages multi-level feature correlation and efficient 4D convolutions.
arXiv Detail & Related papers (2021-04-04T05:27:13Z) - Self-supervised asymmetric deep hashing with margin-scalable constraint
for image retrieval [3.611160663701664]
We propose a novel self-supervised asymmetric deep hashing method with a margin-scalable constraint(SADH) approach for image retrieval.
SADH implements a self-supervised network to preserve semantic information in a semantic feature map and a semantic code map for the semantics of the given dataset.
For the feature learning part, a new margin-scalable constraint is employed for both highly-accurate construction of pairwise correlations in the hamming space and a more discriminative hash code representation.
arXiv Detail & Related papers (2020-12-07T16:09:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.