TY - GEN
T1 - A work-efficient GPU algorithm for level set segmentation
AU - Roberts, Mike
AU - Sousa, Mario Costa
AU - Mitchell, Joseph Ross
PY - 2010
Y1 - 2010
N2 - We present a novel GPU level set segmentation algorithm that is both work-efficient and step-efficient. Our algorithm has O(log n) step-complexity, in contrast to previous GPU algorithms [Lefohn et al. 2004; Jeong et al. 2009] which have O(n) step-complexity. Moreover our algorithm limits the active computational domain to the minimal set of changing elements by examining both the temporal and spatial derivatives of the level set field. We apply our algorithm to 3D medical images (Figure 1) and demonstrate that our algorithm reduces the total number of processed level set field elements by 16× and is 14× faster than previous GPU algorithms with no reduction in segmentation accuracy.
AB - We present a novel GPU level set segmentation algorithm that is both work-efficient and step-efficient. Our algorithm has O(log n) step-complexity, in contrast to previous GPU algorithms [Lefohn et al. 2004; Jeong et al. 2009] which have O(n) step-complexity. Moreover our algorithm limits the active computational domain to the minimal set of changing elements by examining both the temporal and spatial derivatives of the level set field. We apply our algorithm to 3D medical images (Figure 1) and demonstrate that our algorithm reduces the total number of processed level set field elements by 16× and is 14× faster than previous GPU algorithms with no reduction in segmentation accuracy.
UR - http://www.scopus.com/inward/record.url?scp=77956218287&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77956218287&partnerID=8YFLogxK
U2 - 10.1145/1836845.1836903
DO - 10.1145/1836845.1836903
M3 - Conference contribution
AN - SCOPUS:77956218287
SN - 9781450303934
T3 - ACM SIGGRAPH 2010 Posters, SIGGRAPH '10
BT - ACM SIGGRAPH 2010 Posters, SIGGRAPH '10
T2 - ACM SIGGRAPH 2010 Posters, SIGGRAPH '10
Y2 - 26 July 2010 through 30 July 2010
ER -