SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Wang Chunliang 1980 )
 

Search: WFRF:(Wang Chunliang 1980 ) > (2010-2014) > Fast level-set base...

Fast level-set based image segmentation using coherent propagation

Wang, Chunliang, 1980- (author)
Linköpings universitet,Avdelningen för radiologiska vetenskaper,Hälsouniversitetet,Centrum för medicinsk bildvetenskap och visualisering, CMIV
Frimmel, Hans (author)
Uppsala universitet,Avdelningen för beräkningsvetenskap,Bildanalys och människa-datorinteraktion
Smedby, Örjan, Professor, 1956- (author)
Östergötlands Läns Landsting,Linköpings universitet,Avdelningen för radiologiska vetenskaper,Hälsouniversitetet,Centrum för medicinsk bildvetenskap och visualisering, CMIV,Röntgenkliniken i Linköping
 (creator_code:org_t)
2014-06-09
2014
English.
In: Medical physics (Lancaster). - : John Wiley and Sons Ltd. - 0094-2405. ; 41:7
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • Purpose: The level-set method is known to require long computation time for 3D image segmentation, which limits its usage in clinical workflow. The goal of this study was to develop a fast level-set algorithm based on the coherent propagation method and explore its character using clinical datasets. Methods: The coherent propagation algorithm allows level set functions to converge faster by forcing the contour to move monotonically according to a predicted developing trend. Repeated temporary backwards propagation, caused by noise or numerical errors, is then avoided. It also makes it possible to detect local convergence, so that the parts of the boundary that have reached their final position can be excluded in subsequent iterations, thus reducing computation time. To compensate for the overshoot error, forward and backward coherent propagation is repeated periodically. This can result in fluctuations of great magnitude in parts of the contour. In this paper, a new gradual convergence scheme using a damping factor is proposed to address this problem. The new algorithm is also generalized to non-narrow band cases. Finally, the coherent propagation approach is combined with a new distance-regularized level set, which eliminates the needs of reinitialization of the distance. Results: Compared with the sparse field method implemented in the widely available ITKSnap software, the proposed algorithm is about 10 times faster when used for brain segmentation and about 100 times faster for aorta segmentation. Using a multiresolution approach, the new method achieved 50 times speed-up in liver segmentation. The Dice coefficient between the proposed method and the sparse field method is above 99% in most cases. Conclusions: A generalized coherent propagation algorithm for level set evolution yielded substantial improvement in processing time with both synthetic datasets and medical images.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Medicinteknik -- Medicinsk bildbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Medical Engineering -- Medical Image Processing (hsv//eng)
MEDICIN OCH HÄLSOVETENSKAP  -- Klinisk medicin (hsv//swe)
MEDICAL AND HEALTH SCIENCES  -- Clinical Medicine (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Medicinteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Medical Engineering (hsv//eng)

Keyword

image segmentation; level set; coherent propagation; monotonic propagation; medical imaging

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

Find more in SwePub

By the author/editor
Wang, Chunliang, ...
Frimmel, Hans
Smedby, Örjan, P ...
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Medical Engineer ...
and Medical Image Pr ...
MEDICAL AND HEALTH SCIENCES
MEDICAL AND HEAL ...
and Clinical Medicin ...
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Medical Engineer ...
Articles in the publication
Medical physics ...
By the university
Royal Institute of Technology
Linköping University
Uppsala University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view