Approximations of the Euclidean distance by chamfer distances
نویسندگان
چکیده
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× 5 and 7× 7) neighborhoods.
منابع مشابه
Optimum Design of Chamfer Distance
The distance transform has found many applications in image analysis. The Euclidean distance transform is computationally very intensive, and eecient discrete algorithms based on chamfer metrics are used to obtain its approximations. The chamfer metrics are selected to minimize an approximation error. In this paper, a new approach is developed to nd optimal chamfer local distances. This new app...
متن کاملApproximation of the Euclidean Distance by Chamfer Distances
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 v...
متن کاملThe Stepping Distance Transformation
An algorithm Mscan is proposed for the computation of the distance transform of a feature in an image with respect to a chamfer distance. The algorithm is na vely simple and can therefore be easily parallellized. It seems to be new, even for special cases. It is not correct for arbitrary chamfer distances but, by a general analysis of masks and their weights, suucient conditions for its correct...
متن کاملRegion Growing Euclidean Distance Transforms
By propagating a vector for each pixel, we show that nearly Euclidean distance maps can be produced quickly by a region growing algorithm using hierarchical queues. Properties of the propagation scheme are used to detect potentially erroneous pixels and correct them by using larger neighbourhoods, without significantly affecting the computation time. Thus, Euclidean distance maps are produced i...
متن کاملOptimum design of chamfer distance transforms
The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desired Euclidean distance transform at a lower computational cost. They can also give integer-valued distances that are more suitable for several digital image processing tasks. The local distances used to compute a chamfer ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1201.0876 شماره
صفحات -
تاریخ انتشار 2012