No article text was recorded for this version.
quadratic correspondence complexity
Version 1 of 156 papers59 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Guest Editorial: Tracking, Detection and Segmentation
- Blog: Dense Semantic Correspondence Where Every Pixel is a Classifier
- Blog: Dual-Resolution Correspondence Networks
- Blog: Patch-Level Contrasting without Patch Correspondence for Accurate and Dense Contrastive Representation Learning
- Blog: STEREO IMAGE DENSE MATCHING BY INTEGRATING SIFT AND SGM ALGORITHM
- Blog: Mixed-Resolution Patch-Matching
- Blog: Randomized Adaptive Algorithms for Mosaicing Systems
- Blog: Generating Object Segmentation Proposals Using Global and Local Search
- Blog: On the Reconstruction of a Scene from Two Unregistered Images
- Blog: Models Matter, So Does Training: An Empirical Study of CNNs for Optical Flow Estimation
- Blog: Anytime Stereo Image Depth Estimation on Mobile Devices
- Blog: MASA-SR: Matching Acceleration and Spatial Adaptation for Reference-Based Image Super-Resolution
- Blog: MONet: Multi-scale Overlap Network for Duplication Detection in Biomedical Images
- Blog: PCW-Net: Pyramid Combination and Warping Cost Volume for Stereo Matching
- Blog: Self-Supervised Learning of Class Embeddings from Video
- Blog: FlowFormer: A Transformer Architecture for Optical Flow
- Blog: Efficient Neighbourhood Consensus Networks via Submanifold Sparse Convolutions
- Blog: Stereo under Sequential Optimal Sampling: A Statistical Analysis Framework for Search Space Reduction
- Blog: Coarse-to-Fine Embedded PatchMatch and Multi-Scale Dynamic Aggregation for Reference-Based Super-resolution
- Blog: Patch-NetVLAD+: Learned patch descriptor and weighted matching strategy for place recognition
- Blog: Stereo Matching by Hierarchical, Microcanonical Annealing
- Blog: DenseGAP: Graph-Structured Dense Correspondence Learning with Anchor Points
- Blog: Detail Recovery for Single-image Defocus Blur
- Blog: PARN: Position-Aware Relation Networks for Few-Shot Learning
- Blog: Globally Optimal Rigid Intensity Based Registration: A Fast Fourier Domain Approach
- Blog: Learning Texture Transformer Network for Image Super-Resolution
- Blog: A LEAST SQUARE ALGORITHM FOR GEOMETRIC MATCHING OF REMOTE SENSED IMAGES
- Blog: Dense Non-rigid Point-Matching Using Random Projections
- Blog: Dense Relation Distillation With Context-Aware Aggregation for Few-Shot Object Detection
- Blog: PWC-Net: CNNs for Optical Flow Using Pyramid, Warping, and Cost Volume
- Blog: SGAD: Semantic and Geometric-aware Descriptor for Local Feature Matching
- Blog: The Global Patch Collider
- Blog: Deformable Spatial Pyramid Matching for Fast Dense Correspondences
- Blog: Efficient Euclidean distance transform using perpendicular bisector segmentation
- Blog: Nonparametric scene parsing: Label transfer via dense scene alignment
- Blog: Grounding Image Matching in 3D with MASt3R
- Blog: Bi-level Feature Alignment for Versatile Image Translation and Manipulation
- Blog: CoCosNet v2: Full-Resolution Correspondence Learning for Image Translation
- Blog: End-to-End Deep Kronecker-Product Matching for Person Re-Identification
- Blog: High-Resolution Optical Flow from 1D Attention and Correlation
- Blog: Semantic-Sparse Colorization Network for Deep Exemplar-Based Colorization
- Blog: EBDM: Exemplar-Guided Image Translation with Brownian-Bridge Diffusion Models
- Blog: Video Frame Interpolation with Densely Queried Bilateral Correlation
- Blog: Progressive Feature Matching with Alternate Descriptor Selection and Correspondence Enrichment
- Blog: Image Processing Using Smooth Ordering of its Patches
- Blog: Self-Supervised Alignment Learning for Medical Image Segmentation
- Blog: Cross-Domain Correspondence Learning for Exemplar-Based Image Translation
- Blog: SuperPatchMatch: an Algorithm for Robust Correspondences using Superpixel Patches
- Blog: Feedback Network for Mutually Boosted Stereo Image Super-Resolution and Disparity Estimation
- Blog: X Resolution Correspondence Networks
- Blog: Unifying Feature and Cost Aggregation with Transformers for Semantic and Visual Correspondence
- Blog: Neural Matching Fields: Implicit Representation of Matching Fields for Visual Correspondence
- Blog: Efficient High-Resolution Stereo Matching Using Local Plane Sweeps
- Blog: RAFT: Recurrent All-Pairs Field Transforms for Optical Flow
- Blog: Patch-Based Evaluation of Image Segmentation
- Blog: Parameterized Cost Volume for Stereo Matching
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_quadratic_correspondence_complexity_6c772cbe,
title = {quadratic correspondence complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quadratic-correspondence-complexity/rdr_6c772cbe70714adf8ae02b2bffd8d77c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_quadratic_correspondence_complexity_6c772cbe_v1,
title = {quadratic correspondence complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quadratic-correspondence-complexity/rdr_6c772cbe70714adf8ae02b2bffd8d77c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}