An Interactive Algorithm for Image Smoothing and Segmentation

This work introduces an interactive algorithm for image smoothing and segmentation. A non-linear partial differential equation is employed to smooth the image while preserving contours. The segmentation is a region-growing and merging process initiated around image minima (seeds), which are automatically detected, labeled and eventually merged. The user places one marker per region of interest. Accurate and fast segmentation results can be achieved for gray and color images using this simple method

An Interactive Algorithm for Image Smoothing and Segmentation

This work introduces an interactive algorithm for image smoothing and segmentation. A non-linear partial differential equation is employed to smooth the image while preserving contours. The segmentation is a region-growing and merging process initiated around image minima (seeds), which are automatically detected, labeled and eventually merged. The user places one marker per region of interest. Accurate and fast segmentation results can be achieved for gray and color images using this simple method

Electronic Letters on Computer Vision and Image Analysis 4(1):32-48, 2004 An Interactive Algorithm for Image Smoothing and Segmentation

This work introduces an interactive algorithm for image smoothing and segmentation. A non-linear partial differential equation is employed to smooth the image while preserving contours. The segmentation is a regiongrowing and merging process initiated around image minima (seeds), which are automatically detected, labeled and eventually merged. The user places one marker per region of interest. Accurate and fast segmentation results can be achieved for gray and color images using this simple method