
arXiv: 1201.0876
Chamfer distances play an important role in the theory of distance transforms. Though the determination of the exact Euclidean distance transform is also a well investigated area, the classical chamfering method based upon "small" neighborhoods still outperforms it e.g. in terms of computation time. In this paper we determine the best possible maximum relative error of chamfer distances under various boundary conditions. In each case some best approximating sequences are explicitly given. Further, because of possible practical interest, we give all best approximating sequences in case of small (i.e. 5 by 5 and 7 by 7) neighborhoods.
Preprint submitted to Acta Cybernetica, 20 pages
FOS: Computer and information sciences, 41A50, 68U10, Computer Science - Information Theory, Information Theory (cs.IT)
FOS: Computer and information sciences, 41A50, 68U10, Computer Science - Information Theory, Information Theory (cs.IT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
