A Second Order Multi-Stencil Fast Marching Method with a Non-Constant Local Cost Model
The Fast Marching method is widely employed in several fields of image processing. Some years ago a Multi-Stencil version (MSFM) was introduced to improve its accuracy by solving the equation for a set of stencils and choosing the best solution at each considered node. The following work proposes a...
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - (2018) vom: 12. Nov. |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , , , , , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2018
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Schlagworte: | Journal Article |
| Zusammenfassung: | The Fast Marching method is widely employed in several fields of image processing. Some years ago a Multi-Stencil version (MSFM) was introduced to improve its accuracy by solving the equation for a set of stencils and choosing the best solution at each considered node. The following work proposes a modified numerical scheme for MSFM to take into account the variation of the local cost, which has proven to be second order. The influence of the stencil set choice on the algorithm outcome with respect to stencil orthogonality and axis swapping is also explored, where stencils are taken from neighborhoods of varying radius. The experimental results show that the proposed schemes improve the accuracy of their original counterparts, and that the use of permutation-invariant stencil sets provides robustness against shifted vector coordinates in the stencil set |
|---|---|
| Beschreibung: | Date Revised 27.02.2024 published: Print-Electronic Citation Status Publisher |
| ISSN: | 1941-0042 |
| DOI: | 10.1109/TIP.2018.2880507 |