• No results found

Interactive Level-Set Segmentation on the GPU

N/A
N/A
Protected

Academic year: 2021

Share "Interactive Level-Set Segmentation on the GPU"

Copied!
30
0
0

Loading.... (view fulltext now)

Full text

(1)

Aaron Lefohn

Neoptica / Intel

Interactive Level-Set Segmentation

Interactive Level-Set Segmentation

on the GPU

(2)

Problem Statement

Goal

Interactive system for deformable surface manipulation Level-sets

Challenges

Deformation is slow

Deformation is hard to control

Solution

(3)

Collaborators

University of Utah

Joe Kniss

Joshua Cates

Charles Hansen

Ross Whitaker

(4)

Deformable Surfaces

Applications of Level-Sets

Fluid simulation

Surface reconstruction for 3D scanning Surface processing

Image / Volume segmentation

Introduction Introduction

(5)

Level-Set Method

Implicit surface

Distance transform

denotes inside/outside

Surface motion

Introduction Introduction

(6)

CPU Level-Set Acceleration

Initialize Domain Compute Update Domain

Narrow-Band/Sparse-Grid

Compute PDE only near the surface

Adalsteinson et al. 1995 Whitaker et al. 1998

Peng et al. 1999

Houston et al., 2004

Museth et al., 2004 - 2006

Time-dependent, sparse-grid solver

Introduction Introduction

(7)

GPU Level-Set History

Strzodka et al. 2001

2D level-set solver on NVIDIA GeForce 2 No narrow-band optimization

Lefohn et al. 2002

Brute force 3D implementation on ATI Radeon 8500 No faster than CPU, but ~10x more computations No narrow-band optimization

Lefohn et al. 2003 / 2004

Narrow band GPU 3D level set solver

Crane et al. 2007

3D level set solver as part of fluid simulation in NVIDIA G80 launch demo Mask unused grid cells

Kolb et al. 2007

GPU particle level sets

Introduction Introduction

(8)

GPU Level-Set History

Strzodka et al. 2001

2D level-set solver on NVIDIA GeForce 2 No narrow-band optimization

Lefohn et al. 2002

Brute force 3D implementation on ATI Radeon 8500 No faster than CPU, but ~10x more computations No narrow-band optimization

Lefohn et al. 2003 / 2004

Narrow band GPU 3D level set solver

Crane et al. 2007

3D level set solver as part of fluid simulation in NVIDIA G80 launch demo Mask unused grid cells

Kolb et al. 2007

GPU particle level sets

Introduction Introduction

(9)

Sparse Volume Computation

CPU algorithm: Traverse list of active voxels

GPU algorithm: Compute all active voxels in parallel

Data structures change after each PDE time step

GPU Narrow-Band Solver

Initialize Domain Compute Update Domain Algorithm Algorithm

(10)

A Dynamic, Sparse GPU Solver

GPU: Computes PDE

CPU: Manages GPU memory

Algorithm

CPU

GPU

Physical Addresses for Active Memory Pages

Memory Requests

PDE Computation 15-250 passes

(11)

Level-Set Segmentation

Surface velocity attracts level set to desired feature

Segmentation Parameters

1) Intensity value of interest (center) 2) Width of intensity interval (variance)

Data-Based Speed

Curvature Speed

% Smoothing

(12)

Data speed term

Attract level set to range of voxel intensities

D(I)= 0 D(I)

I (Intensity)

(13)

Curvature speed term

Enforce surface smoothness

Prevent segmentation “leaks” Smooth noisy solution

(14)
(15)

Interactive 3D Level Set Visualization

Use GPU to perform interactive volume rendering of

the level set solution while it evolves

Render with original data

Directly render level set data without reformatting data 3D user interface to guide evolving level set surface

(16)

Multi-Dimensional Virtual Memory

3D virtual memory 2D physical memory 16 x 16 pixel pages

Algorithm

(17)

Direct Volume Rendering of Level Set

Reconstruct 2D Slice of Virtual Memory Space

On-the-fly decompression on GPU

Use 2D geometry and texture coordinates

(18)

Direct Volume Rendering of Level Set

Deferred Filtering: Volume Rendering Compressed Data

2D slice-based rendering: No data duplication Tri-linear interpolation

Full transfer function and lighting capabilities

(19)

Level-Set Segmentation Application

Idea: Segment Surface from 3D Image

Begin with “seed” surface

Deform surface into target segmentation

(20)

Demo

Segmentation of MRI volumes

1283 scalar volume

Hardware Details

ATI Radeon 9800 Pro 1.7 GHz Intel Pentium 4 1 GB of RAM

(21)
(22)

Region-of-Interest Volume Rendering

Limit extent of volume rendering

Use level-set segmentation to specify region Add level-set value to transfer function

(23)

Evaluation User Study

Goal

Can a user quickly find parameter settings to create an accurate, precise 3D segmentation?

Relative to hand contouring

(24)

User Study Methodology

Six users and nine data sets

Harvard Brigham and Women’s Hospital Brain Tumor Database

256 x 256 x 124 MRI

No pre-processing of data & no hidden parameters

Ground truth

Expert hand contouring

STAPLE method (Warfield et al. MICCAI 2002)

(25)

User Study Results

Efficiency

6 ± 3 minutes per segmentation (vs multiple hours) Solver idle 90% - 95% of time

Precision

Intersubject similarity significantly better 94.04% ± 0.04% vs. 82.65% ± 0.07%

Accuracy

Within error bounds of expert hand segmentations Compares well with other semi-automatic techniques

Kaus et al., Radiology, 2001

(26)

Summary

Interactive Level-Set System

10x – 15x speedup over optimized CPU implementation Intuitive parameter tuning

User study evaluation

But…

(27)

That was three+ years ago…

GPUs are 6-7x faster!

New GPU capabilities make building dynamic data

structures easier and more efficient

GPU data structures better understood (Glift, etc.)

New, faster CPU level-set methods (RLE, etc.)

(28)

Future Directions

Other Level-Set Applications

Surface processing, surface reconstruction, physical simulation

Better User Interface for Level Sets

Add more user control of evolving level set solver More powerful editing of level set solution

“Interactive Visulation”

User-controllable PDE solvers

Combine automatic and by-hand methods

(29)

Acknowledgements

Joe Kniss – Volume rendering Josh Cates – Tumor user study

Gordon Kindlmann – “Teem” raster-data toolkit

Milan Ikits – “GLEW” OpenGL extension wrangler Ross Whitaker, Charles Hansen, Steven Parker and John Owens ATI: Evan Hart, Mark Segal, Jeff Royle, and Jason Mitchell

Brigham and Women’s Hospital

National Science Foundation Graduate Fellowship Office of Naval Research grant #N000140110033

(30)

Questions?

For More Information

Google “Lefohn level set”

http://graphics.cs.ucdavis.edu/~lefohn/

Journal Papers Based on this Work

Lefohn, Kniss, Hansen, Whitaker, “A Streaming Narrow Band

Algorithm: Interactive Computation and Visualization of

Level Sets,” IEEE Transactions on Visualization and Computer

Graphics, 10 (40), Jul / Aug, pp. 422-433, 2004

Cates, Lefohn, Whitaker, “GIST: An Interactive, GPU-Based

References

Related documents

STRATEGY Project Assessment Competitive Analysis Metrics Mapping USER EXPERIENCE Project Assessment Competitive Analysis Metrics Mapping DEVELOPMENT .Net/MVC

We measured the LAWT at 24 pre- selected locations, including the roof, anterior wall, posterior wall, septum, and lateral wall.. The LAA base was excluded owing to

Table 1.7 School Choice and Educational Outcomes: Heterogeneous Effects by Distance to Nearest Private Voucher School with Add-ons that Joined the

4 approaches to risk may be distinguished in the risk management process: risk avoidance (a company does not invest), risk mitigation (risk reduction through limiting the degree

The disassembling of this second level shows that the economic dimension depends on three important factors: Demand , Supply and expected GDP growth , while the Extended

Caseyville 21 Caseyville Township Garage 6990 Old Collinsville Rd Ofallon, Illinois 62269.

implementing Mobile Marketing and those already using it are seeing strong benefits – more than half of respondents (52%) stated that Mobile Marketing’s ROI is higher than

This paper proposed that modern agricultural growth in the cerrado regions in Brazil should be analysed on the basis of a model of the land market in which there occurs a