Proceedings Article | 26 February 2008
Proc. SPIE. 6811, Real-Time Image Processing 2008
KEYWORDS: Mechanics, Image segmentation, Image processing, Interfaces, Computing systems, Gaussian filters, Fractal analysis, Electronic imaging, Real time image processing, Binary data
The level set method for curve evolution is a popular technique used in image processing applications. However,
the numerics involved make its use in high performance systems computationally prohibitive. This paper proposes
an approximate level set scheme that removes much of the computational burden while maintaining accuracy.
Abandoning a floating point representation for the signed distance function, we use the integral values to
represent the interior, zero level set, and exterior. We detail rules governing the evolution and maintenance of
these three regions. Arbitrary energies can be implemented with the definition of three operations: initialize
iteration, move points in, move points out.
This scheme has several nice properties. First, computations are only performed along the zero level set.
Second, this approximate distance function representation requires only a few simple integer comparisons for
maintenance. Third, smoothness regularization involves only a few integer calculations and may be handled apart
from the energy itself. Fourth, the zero level set is represented exactly removing the need for interpolation off the
interface. Lastly, evolution proceeds on the order of milliseconds per iteration using conventional uniprocessor
workstations.
To highlight its accuracy, flexibility and speed, we demonstrate the technique on standard intensity tracking
and stand alone segmentation.
