.png){kind=icon}
.png){kind=icon}
Return
Fast algorithm for 2D fragment assembly based on partial EMD
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-016-1303-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
2D Fragment assembly is an important research topic in computer vision and pattern recognition, and has a wide range of applications such as relic restoration and remote sensing image processing. The key to this problem lies in utilizing contour features or visual cues to find the optimal partial matching. Considering that previous algorithms are weak in predicting the best matching configuration of two neighboring fragments, we suggest using the earth mover's distance, based on length/property correspondence, to measure the similarity, which potentially matches a point on the first contour to a desirable destination point on the second contour. We further propose a greedy algorithm for 2D fragment assembly by repeatedly assembling two neighboring fragments into a composite one. Experimental results on map-piece assembly and relic restoration show that our algorithm runs fast, is insensitive to noise, and provides a novel solution to the fragment assembly problem.
Keywords:
Fragment assembly
Partial EMD
Contour features
Lebesgue measure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
4.6K
Citations:
6.5K
View more organizations