1 November 1992 Efficient image partition algorithm based on edge information
Author Affiliations +
Proceedings Volume 1818, Visual Communications and Image Processing '92; (1992) https://doi.org/10.1117/12.131394
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
The iterative algorithm presented in this paper partitions an image into piecewise-constant regions. Each iteration consists of three steps. The first step extracts edges from the image. The extracted edges, which must exhibit high connectivity, are computed using a Laplacian- like morphological edge detector in the first iteration and a simple gradient thresholding in subsequent iterations. After the first iteration, the edge detector operates on a piecewise- constant image for which the edge detection problem is well defined and well posed. In the second step, a fast one-pass averaging of connected pixels within closed boundaries defines the regions in the image. Finally, edge pixels (both true and spurious edge pixels) are each assigned to an underlying region. The advantages of this algorithm are: (1) both local and region-based information are incorporated, (2) convergence occurs in a few iterations, and (3) the component operations are relatively simple.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jose Vicente, Jose Vicente, Ronald W. Schafer, Ronald W. Schafer, } "Efficient image partition algorithm based on edge information", Proc. SPIE 1818, Visual Communications and Image Processing '92, (1 November 1992); doi: 10.1117/12.131394; https://doi.org/10.1117/12.131394

Back to Top