nextupprevious
 

Algorithm: FLST

The Fast Level Set Transform
Input: A discrete image (an array of values)
Output: The tree of shapes. Each shape stores its pixels and its gray level (and maybe its geometric characteristics: area, perimeter, moments)
Interpretation: The image is considered as constant on each pixel and upper semicontinuous
 

Reconstruction: Each pixel gets the gray level of the smallest shape containing it. Complexity $ O(N)$.
Memory usage: Number of shapes $ \leq N$




Summer School on Mathematical Problems in Image Processing, Trieste, Italy, September 4th-18th 2000