.png){kind=icon}
Return
Structured-Patch Optimization for Dense Correspondence
.png){kind=icon}
PRE
AI
DOI：10.1109/TMM.2015.2395078.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new method to compute the dense correspondences between two images by using the energy optimization and the structured patches. In terms of the property of the sparse feature and the principle that nearest sub-scenes and neighbors are much more similar, we design a new energy optimization to guide the dense matching process and find the reliable correspondences. The sparse features are also employed to design a new structure to describe the patches. Both transformation and deformation with the structured patches are considered and incorporated into an energy optimization framework. Thus, our algorithm can match the objects robustly in complicated scenes. Finally, a local refinement technique is proposed to solve the perturbation of the matched patches. Experimental results demonstrate that our method outperforms the state-of-the-art matching algorithms.
Keywords:
Dense correspondence
features
match
optimization
structured patch
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.7
Papers:
4.6K
Citations:
2.4W
Organization
View more organizations
Cited Papers
ShareSaveSteroids for the treatment of corrosive esophageal injury: A statistical analysis of past studies
OAAI
OAAIShareSaveShareSave
Northward oceanic heat transport in the main branch of the Norwegian Atlantic Current over the late Holocene.png)
The Holocene
The HoloceneIF0
PREAI
ShareSave0.18um low voltage 12-bit successive-approximation-register analog-to-digital converter (SAR ADC)
PREAI
ShareSave View more