fast computation of all pairs of geodesic distances
Clicks: 104
ID: 191420
2011
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
30.0
/100
104 views
23 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #55 of 58 articles by views in archives of toxicology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show that our method in which the source point of geodesic propagations is chosen according to its minimum number of distances to the other points, improves the previous method up to 32 % and the naive method up to 50 % in terms of reduction of the number of operations.
| Reference Key |
noyel2011imagefast
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Guillaume Noyel;Jesús Angulo;Dominique Jeulin |
| Journal | archives of toxicology |
| Year | 2011 |
| DOI |
10.5566/ias.v30.p101-109
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.