Name
Abstract | ||
|---|---|---|
We propose a fast pattern matching scheme termed Matching by Tone Mapping (MTM) which allows matching under non-linear tone mappings. We show that, when tone mapping is approximated by a piecewise constant function, a fast computational scheme is possible requiring computational time similar to the fast implementation of Normalized Cross Correlation (NCC). In fact, the MTM measure can be viewed as a generalization of the NCC for non-linear mappings and actually reduces to NCC when mappings are restricted to be linear. The MTM is shown to be invariant to non-linear tone mappings, and is empirically shown to be highly discriminative and robust to noise. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICCV.2011.6126389 | ICCV |
Keywords | Field | DocType |
piecewise constant function,normalized cross correlation,fast pattern,fast computational scheme,mtm measure,template matching,computational time,fast implementation,non-linear tone-mapped image,tone mapping,non-linear tone mapping,non-linear mapping,pattern matching,approximation theory | Template matching,Cross-correlation,Pattern recognition,Computer science,Approximation theory,Tone mapping,Artificial intelligence,Invariant (mathematics),Pattern matching,Discriminative model,Piecewise | Conference |
Volume | Issue | ISSN |
2011 | 1 | 1550-5499 |
Citations | PageRank | References |
6 | 0.45 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yacov Hel-Or | 1 | 461 | 40.74 |
| Hagit Zabrodsky Hel-Or | 2 | 371 | 28.19 |
| Eyal David | 3 | 30 | 1.68 |