z-logo
open-access-imgOpen Access
Accuracy of least squares designed spatial FIR filters for segmentation of images of fluorescence stained cell nuclei
Author(s) -
Price Jeffrey H.,
Hunter Edward A.,
Gough David A.
Publication year - 1996
Publication title -
cytometry
Language(s) - English
Resource type - Journals
eISSN - 1097-0320
pISSN - 0196-4763
DOI - 10.1002/(sici)1097-0320(19961201)25:4<303::aid-cyto1>3.0.co;2-e
Subject(s) - artificial intelligence , segmentation , computer vision , computer science , composite image filter , thresholding , pattern recognition (psychology) , sharpening , contrast (vision) , image segmentation , filter (signal processing) , scale space segmentation , image (mathematics)
A method for accurate, real‐time image segmentation is needed for the development of a fully automated image cytometer that combines the speed and ease‐of‐use of flow cytometry with the detailed morphometry of imaging. Object intensity variation and inherent optical blur make real‐time segmentation challenging. The best spatial finite impulse response (FIR) filter, implemented as a convolution, was tested for sharpening edges and creating the required contrast. The filter and threshold segmentation steps were treated as a two‐category linear classifier. Best 3 × 3 through 25 × 25 filters were designed utilizing the perceptron criterion and nonlinear least squares, and tested on ten montage images of a combined 1,070 manually segmented DAPI stained cell nuclei. The resulting image contrast, or class separation, led to simple automatic thresholding via the histogram intermodal minimum. Image segmentation accuracy began to plateau at 7 × 7 filters and did not increase above 15 × 15. Little loss in accuracy occurred with application to the images not used for design. This segmentation method provides a systematic, fast and accurate means of creating binary object maps useful for subsequent measurement, processing and cell classification. © 1996 Wiley‐Liss, Inc.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here