Some improvements for the fast sweeping method

Stanley Bak, Joyce Mclaughlin, Paul Renzi

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapidly. The conventional wisdom is that fast sweeping works best when the speed changes slowly, and fast marching is the algorithm of choice when the speed changes rapidly. The goal here is to achieve run times for the fast sweeping method that are at least as fast, or faster, than competitive methods, e.g. fast marching, in the case where the speed is changing rapidly. The first improvement, which we call the locking method, dynamically keeps track of grid points that have either already had the solution successfully calculated at that grid point or for which the solution cannot be successfully calculated during the current iteration. These locked points can quickly be skipped over during the fast sweeping iterations, avoiding many time-consuming calculations. The second improvement, which we call the two queue method, keeps all of the unlocked points in a data structure so that the locked points no longer need to be visited at all. Unfortunately, it is not possible to insert new points into the data structure while maintaining the fast sweeping ordering without at least occasionally sorting. Instead, we segregate the grid points into those with small predicted solutions and those with large predicted solutions using two queues. We give two ways of performing this segregation. This method is a label correcting (iterative) method like the fast sweeping method, but it tends to operate near the front like the fast marching method. It is reminiscent of the threshold method for finding the shortest path on a network, [F. Glover, D. Klingman, and N. Phillips, Oper. Res., 33 (1985), pp. 65-73]. We demonstrate the numerical efficiency of the improved methods on a number of examples.

Original languageEnglish
Pages (from-to)2853-2874
Number of pages22
JournalSIAM Journal on Scientific Computing
Volume32
Issue number5
DOIs
Publication statusPublished - 15 Nov 2010
Externally publishedYes

Fingerprint

Sweeping
Data structures
Fast Marching Method
Grid
Iteration
Iterative methods
Sorting
Queue
Data Structures
Labels
Large Solutions
Small Solutions
Locking
Segregation
Shortest path
Tend

Keywords

  • Eikonal equation
  • Fast marching
  • Fast sweeping
  • Static Hamilton-Jacobi equation

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Cite this

Some improvements for the fast sweeping method. / Bak, Stanley; Mclaughlin, Joyce; Renzi, Paul.

In: SIAM Journal on Scientific Computing, Vol. 32, No. 5, 15.11.2010, p. 2853-2874.

Research output: Contribution to journalArticle

Bak, Stanley ; Mclaughlin, Joyce ; Renzi, Paul. / Some improvements for the fast sweeping method. In: SIAM Journal on Scientific Computing. 2010 ; Vol. 32, No. 5. pp. 2853-2874.
@article{e9169754c6de492490b0b8fb4ecbb7e4,
title = "Some improvements for the fast sweeping method",
abstract = "In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapidly. The conventional wisdom is that fast sweeping works best when the speed changes slowly, and fast marching is the algorithm of choice when the speed changes rapidly. The goal here is to achieve run times for the fast sweeping method that are at least as fast, or faster, than competitive methods, e.g. fast marching, in the case where the speed is changing rapidly. The first improvement, which we call the locking method, dynamically keeps track of grid points that have either already had the solution successfully calculated at that grid point or for which the solution cannot be successfully calculated during the current iteration. These locked points can quickly be skipped over during the fast sweeping iterations, avoiding many time-consuming calculations. The second improvement, which we call the two queue method, keeps all of the unlocked points in a data structure so that the locked points no longer need to be visited at all. Unfortunately, it is not possible to insert new points into the data structure while maintaining the fast sweeping ordering without at least occasionally sorting. Instead, we segregate the grid points into those with small predicted solutions and those with large predicted solutions using two queues. We give two ways of performing this segregation. This method is a label correcting (iterative) method like the fast sweeping method, but it tends to operate near the front like the fast marching method. It is reminiscent of the threshold method for finding the shortest path on a network, [F. Glover, D. Klingman, and N. Phillips, Oper. Res., 33 (1985), pp. 65-73]. We demonstrate the numerical efficiency of the improved methods on a number of examples.",
keywords = "Eikonal equation, Fast marching, Fast sweeping, Static Hamilton-Jacobi equation",
author = "Stanley Bak and Joyce Mclaughlin and Paul Renzi",
year = "2010",
month = "11",
day = "15",
doi = "10.1137/090749645",
language = "English",
volume = "32",
pages = "2853--2874",
journal = "SIAM Journal of Scientific Computing",
issn = "1064-8275",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "5",

}

TY - JOUR

T1 - Some improvements for the fast sweeping method

AU - Bak, Stanley

AU - Mclaughlin, Joyce

AU - Renzi, Paul

PY - 2010/11/15

Y1 - 2010/11/15

N2 - In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapidly. The conventional wisdom is that fast sweeping works best when the speed changes slowly, and fast marching is the algorithm of choice when the speed changes rapidly. The goal here is to achieve run times for the fast sweeping method that are at least as fast, or faster, than competitive methods, e.g. fast marching, in the case where the speed is changing rapidly. The first improvement, which we call the locking method, dynamically keeps track of grid points that have either already had the solution successfully calculated at that grid point or for which the solution cannot be successfully calculated during the current iteration. These locked points can quickly be skipped over during the fast sweeping iterations, avoiding many time-consuming calculations. The second improvement, which we call the two queue method, keeps all of the unlocked points in a data structure so that the locked points no longer need to be visited at all. Unfortunately, it is not possible to insert new points into the data structure while maintaining the fast sweeping ordering without at least occasionally sorting. Instead, we segregate the grid points into those with small predicted solutions and those with large predicted solutions using two queues. We give two ways of performing this segregation. This method is a label correcting (iterative) method like the fast sweeping method, but it tends to operate near the front like the fast marching method. It is reminiscent of the threshold method for finding the shortest path on a network, [F. Glover, D. Klingman, and N. Phillips, Oper. Res., 33 (1985), pp. 65-73]. We demonstrate the numerical efficiency of the improved methods on a number of examples.

AB - In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapidly. The conventional wisdom is that fast sweeping works best when the speed changes slowly, and fast marching is the algorithm of choice when the speed changes rapidly. The goal here is to achieve run times for the fast sweeping method that are at least as fast, or faster, than competitive methods, e.g. fast marching, in the case where the speed is changing rapidly. The first improvement, which we call the locking method, dynamically keeps track of grid points that have either already had the solution successfully calculated at that grid point or for which the solution cannot be successfully calculated during the current iteration. These locked points can quickly be skipped over during the fast sweeping iterations, avoiding many time-consuming calculations. The second improvement, which we call the two queue method, keeps all of the unlocked points in a data structure so that the locked points no longer need to be visited at all. Unfortunately, it is not possible to insert new points into the data structure while maintaining the fast sweeping ordering without at least occasionally sorting. Instead, we segregate the grid points into those with small predicted solutions and those with large predicted solutions using two queues. We give two ways of performing this segregation. This method is a label correcting (iterative) method like the fast sweeping method, but it tends to operate near the front like the fast marching method. It is reminiscent of the threshold method for finding the shortest path on a network, [F. Glover, D. Klingman, and N. Phillips, Oper. Res., 33 (1985), pp. 65-73]. We demonstrate the numerical efficiency of the improved methods on a number of examples.

KW - Eikonal equation

KW - Fast marching

KW - Fast sweeping

KW - Static Hamilton-Jacobi equation

UR - http://www.scopus.com/inward/record.url?scp=78149354082&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78149354082&partnerID=8YFLogxK

U2 - 10.1137/090749645

DO - 10.1137/090749645

M3 - Article

VL - 32

SP - 2853

EP - 2874

JO - SIAM Journal of Scientific Computing

JF - SIAM Journal of Scientific Computing

SN - 1064-8275

IS - 5

ER -