Name
Abstract | ||
|---|---|---|
We propose a fast algorithm for speeding up the process of template matching that uses M-estimators for dealing with outliers. We propose a particular image hierarchy called the p-pyramid that can be exploited to generate a list of ascending lower bounds of the minimal matching errors when a nondecreasing robust error measure is adopted. Then, the set of lower bounds can be used to prune the search of the p-pyramid, and a fast algorithm is thereby developed in this paper. This fast algorithm ensures finding the global minimum of the robust template matching problem in which a nondecreasing M-estimator serves as an error measure. Experimental results demonstrate the effectiveness of our method. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/TSP.2002.806551 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
p-pyramid,template matching,image matching,global minimum,parameter estimation,image hierarchy,error analysis,nondecreasing m-estimator,nondecreasing robust error measure,outliers,minimal matching errors,fast algorithm,error measure,minimal matching error,lower bounds,robust template matching,robust template matching problem,lower bound,robust template | Template matching,Image processing,Robustness (computer science),Artificial intelligence,Estimation theory,Hierarchy,Mathematical optimization,Pattern recognition,Algorithm,Outlier,Pattern matching,Mathematics,Estimator | Journal |
Volume | Issue | ISSN |
51 | 1 | 1053-587X |
Citations | PageRank | References |
33 | 1.38 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiun-hung Chen | 1 | 150 | 12.08 |
| Chu-Song Chen | 2 | 2071 | 128.23 |
| Yong-Sheng Chen | 3 | 314 | 30.12 |