[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Octave-bug-tracker] [bug #62192] [octave forge](image) bwdist gives inc
From: |
Avinoam Kalma |
Subject: |
[Octave-bug-tracker] [bug #62192] [octave forge](image) bwdist gives incorrect result in rare cases |
Date: |
Wed, 25 May 2022 01:04:04 -0400 (EDT) |
Follow-up Comment #3, bug #62192 (project octave):
Indeed, Octave used the Algorithm proposed by Per-Erik Danielsson,
“Euclidean distance mapping”, in Computer Graphics and Image Processing,
Volume 14, Issue 3, 1980, Pages 227-248,
https://doi.org/10.1016/0146-664X(80)90054-4.
(https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.322.7605&rep=rep1&type=pdf),
while MATLAB uses the algorithm of C. R. Maurer, Rensheng Qi and V. Raghavan,
"A linear time algorithm for computing exact Euclidean distance transforms of
binary images in arbitrary dimensions," in IEEE Transactions on Pattern
Analysis and Machine Intelligence, vol. 25, no. 2, pp. 265-270, Feb. 2003,
doi: 10.1109/TPAMI.2003.1177156.
https://ieeexplore.ieee.org/document/1177156 (paywall).
In the paper of Ricardo Fabbri, Luciano Da F. Costa, Julio C. Torelli, and
Odemir M. Bruno. 2008. "2D Euclidean distance transform algorithms: A
comparative survey". ACM Comput. Surv. 40, 1, Article 2 (February 2008), 44
pages. DOI:https://doi.org/10.1145/1322432.1322434
(https://rfabbri.github.io/stuff/fabbri-EDT-survey-ACMCSurvFeb2008.pdf), the
authors write, regarding Danielsson algorithm: “Although it is simple and
efficient, it is not exact"
Meanwhile, I have added a xtest to the code:
http://hg.code.sf.net/p/octave/image/rev/02de12903c73
_______________________________________________________
Reply to this item at:
<https://savannah.gnu.org/bugs/?62192>
_______________________________________________
נשלחה הודעה דרך Savannah
https://savannah.gnu.org/
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Octave-bug-tracker] [bug #62192] [octave forge](image) bwdist gives incorrect result in rare cases,
Avinoam Kalma <=