Name
Abstract | ||
|---|---|---|
In this paper, we address the problem of projective template matching which aims to estimate parameters of projective transformation. Although homography can be estimated by combining key-point-based local features and RANSAC, it can hardly be solved with feature-less images or high outlier rate images. Estimating the projective transformation remains a difficult problem due to high-dimensionality and strong non-convexity. Our approach is to quantize the parameters of projective transformation with binary finite field and search for an appropriate solution as the final result over the discrete sampling set. The benefit is that we can avoid searching among a huge amount of potential candidates. Furthermore, in order to approximate the global optimum more efficiently, we develop a level-wise adaptive sampling ( LAS) method under genetic algorithm framework. With LAS, the individuals are uniformly selected from each fitness level and the elite solution finally converges to the global optimum. In the experiment, we compare our method against the popular projective solution and systematically analyse our method. The result shows that our method can provide convincing performance and holds wider application scope. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1587/transinf.2016EDP7038 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
projective template matching, binary finite field, level-wise adaptive sampling, homography estimation | Template matching,Computer vision,Computer science,Artificial intelligence,Projective test | Journal |
Volume | Issue | ISSN |
E99D | 9 | 1745-1361 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Zhang | 1 | 939 | 103.66 |
| Takuya Akashi | 2 | 20 | 9.57 |