Euclidean distance transform whit the reducted number of multiplications

• Autorzy: Okun O.
• Konferencja: Conference on Computer Graphics and Image Processing, GKPO' 98 (5 ; 18-22.05.1998 ; Borki, Poland)
• Języki publikacji: EN

Abstrakty

EN

A new method of the euclidean distance map generation is developed which reduces the number of multiplication operations needed to compute distances. This method belongs to a class of the ordered propagation distance transforms using mask whose shape depends on a direction of the distance value propagation. To obtain euclidean distances, we apply two non-euclidean transforms (city block and chessboard) simultaneously so that our approach is faster than the standard algorithms because it uses only additions instead of multiplication operatons when labelling the distance map. Experiments confirm a correctness of our method and memory requirements for it do not exceed those for other transforms with the ordered propagation.

Słowa kluczowe

EN

distance transform; ordered propagation; euclidean; city bolck and chessboard distances

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 1998
• Tom: Vol. 7, No. 1/2
• Strony: 463--474
• Opis fizyczny: Bibliogr. 8 poz.

Twórcy

autor

Okun O.

• Institute of Engineering Cybernetics, National Academy of Sciences of BELARUS, Surganov street 6, 220012 Minsk, BELARUS