2015 International Conference on 3D Vision 2015
DOI: 10.1109/3dv.2015.47
|View full text |Cite
|
Sign up to set email alerts
|

Matchability Prediction for Full-Search Template Matching Algorithms

Abstract: While recent approaches have shown that it is possible to do template matching by exhaustively scanning the parameter space, the resulting algorithms are still quite demanding. In this paper we alleviate the computational load of these algorithms by proposing an efficient approach for predicting the matchability of a template, before it is actually performed. This avoids large amounts of unnecessary computations. We learn the matchability of templates by using dense convolutional neural network descriptors tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 29 publications
0
7
0
Order By: Relevance
“…It is important to note that if a better version of the PG collection is adopted, the matching process will not be repeated. Advances in image processing and computer vision techniques such as template matching (Penate-Sanchez et al , 2015), allow for the automatic detection of similar scanned pages and the updating of matching JSON files (Figure 7).…”
Section: Discussionmentioning
confidence: 99%
“…It is important to note that if a better version of the PG collection is adopted, the matching process will not be repeated. Advances in image processing and computer vision techniques such as template matching (Penate-Sanchez et al , 2015), allow for the automatic detection of similar scanned pages and the updating of matching JSON files (Figure 7).…”
Section: Discussionmentioning
confidence: 99%
“…However, it did not address the issue of landmark selection, nor did it consider natural characteristics and environmental changes. Penate-Sanchez et al [23] used a neural network to predict the matchability of a template for solving a panorama-stitching problem of natural scenery.…”
Section: Related Workmentioning
confidence: 99%
“…There are two ways to reduce the running time of the template matching algorithm: One is to decrease the cost of computing in each matching point, and the other is to narrow the search area. In the traditional matching method, such as full-search template matching (FSTM) [32], a large number of search areas are invalid, causing a heavy computational cost. In order to reduce the unnecessary computational time of the template matching in whole video sequences, an effective measure reducing the search area is also very significant.…”
Section: Search Area Selectionmentioning
confidence: 99%