Image segmentation by pixel classification

A fast boundary finding algorithm is presented which works without threshold operation and without any interactive control. The procedure can be described as a hierarchical two-step algorithm. In the first step the image is divided into two disjunct regions, one of them including the whole object of interest.In the second step the problem of boundary finding is suggested as a classification problem, which means that for any pixel a four-dimensional feature vector is computed which allows classification of pixels into contour elements and any other pixels.The algorithm was tested on several thousand cell images and can be easily adapted to other problems by modification of a set of parameters.