A new method for image segmentation
01 Nov 2009-Vol. 2, pp 123-125
TL;DR: A new segmentation method which is based on the morphology method, fuzzy K-means algorithm and some parts operator of the Canny algorithm, and the course of Canny operator that calculating the value and direction of grads, non-maxima suppression to the grad value and lag threshold process into the post-treatment process is introduced.
Abstract: On the basis of analyzing the blur images with noise, this paper presents a new segmentation method which is based on the morphology method, fuzzy K-means algorithm and some parts operator of the Canny algorithm. Because of the Canny's good performance on good detection, good localization and only one response to a single edge, we introduce the course of Canny operator that calculating the value and direction of grads, non-maxima suppression to the grad value and lag threshold process into our post-treatment process. Through experiments, it is demonstrated that the image segmentation method in this paper is very effective.
Citations
More filters
TL;DR: An adaptive thresholding technique based on gray level co-occurrence matrix (GLCM) is presented to handle images with fuzzy boundaries to demonstrate the ability of the proposed method and is compared with three other thresholding techniques.
Abstract: In this paper, an adaptive thresholding technique based on gray level co-occurrence matrix (GLCM) is presented to handle images with fuzzy boundaries. As GLCM contains information on the distribution of gray level transition frequency and edge information, it is very useful for the computation of threshold value. Here the algorithm is designed to have flexibility on the edge definition so that it can handle the object’s fuzzy boundaries. By manipulating information in the GLCM, a statistical feature is derived to act as the threshold value for the image segmentation process. The proposed method is tested with the starfruit defect images. To demonstrate the ability of the proposed method, experimental results are compared with three other thresholding techniques.
32 citations
Cites methods from "A new method for image segmentation..."
...The superslice method was also applied and improved in [5, 7]....
[...]
TL;DR: The results from the automatic method were not significantly different from the ground truth provided by manual segmentation, which opens the possibility for large‐scale nuclear analysis based on automatic segmentation of nuclei in Feulgen‐stained histological sections of prostate cancer.
Abstract: Digital image analysis of cell nuclei is useful to obtain quantitative information for the diagnosis and prognosis of cancer. However, the lack of a reliable automatic nuclear segmentation is a limiting factor for high-throughput nuclear image analysis. We have developed a method for automatic segmentation of nuclei in Feulgen-stained histological sections of prostate cancer. A local adaptive thresholding with an object perimeter gradient verification step detected the nuclei and was combined with an active contour model that featured an optimized initialization and worked within a restricted region to improve convergence of the segmentation of each nucleus. The method was tested on 30 randomly selected image frames from three cases, comparing the results from the automatic algorithm to a manual delineation of 924 nuclei. The automatic method segmented a few more nuclei compared to the manual method, and about 73% of the manually segmented nuclei were also segmented by the automatic method. For each nucleus segmented both manually and automatically, the accuracy (i.e., agreement with manual delineation) was estimated. The mean segmentation sensitivity/specificity were 95%/96%. The results from the automatic method were not significantly different from the ground truth provided by manual segmentation. This opens the possibility for large-scale nuclear analysis based on automatic segmentation of nuclei in Feulgen-stained histological sections.
31 citations
Cites background or methods from "A new method for image segmentation..."
...Among these, the method of Yanowitz and Bruckstein (27) includes an object perimeter gradient computation step to remove false objects in the segmented image....
[...]
...The postprocessing step of Yanowitz and Bruckstein (27) was then applied on the thresholded frame image: First, all the connected components (objects and holes) in the thresholded image were labeled....
[...]
...On the basis of the evaluation of Trier and Taxt (24) and Trier and Jain (25) we have used the Niblack method (26) with the postprocessing step of Yanowitz and Bruckstein (27)....
[...]
...2a) and the postprocessing step of Yanowitz and Bruckstein (27) is crucial in removing false objects from the binary frame image (Fig....
[...]
Dissertation•
01 Jan 2006
TL;DR: It is shown that a few recognized characters, returned by handwriting recognition, can be used to construct a linguistic model capable of representing a medical topic category, thereby improving handwriting recognition performance and allowing PCR (Pre-Hospital Care Report) forms to be tagged with a topic category and subsequently searched by information retrieval systems.
29 citations
TL;DR: An original binarization method based on connected operators that enables to filter and/or segment an image by preserving its contours and showed good behavior in various contexts is proposed in this paper.
28 citations
Cites methods from "A new method for image segmentation..."
...Other approaches are based on edge detection algorithms (Chen et al., 2008; Jain and Bhattacharjee, 1992; Jang and Hong, 1999; Parker et al., 1993; Yanowitz and Bruckstein, 1989), on fuzzy classification (Cheng and Chen, 1999) or on multiscale processing (Tabbone and Wendling, 2003)....
[...]
01 Jan 2012
TL;DR: A local thresholding technique using local contrast and mean is described and it is shown that in uniform contrast distribution of background and foreground documents, global thesholding is more suitable than that of local thresholds one and in degraded documents, local technique is more suited to that of global one.
Abstract: is a process of separation of pixel values of an input image into two pixel values like white as background and black as foreground. It is an important part in image processing and it is the first step in many document analysis and OCR processes. Most of the binarization techniques associate a certain intensity value called threshold which separate the pixel values of the concerned input grayscale image into two classes like background and foreground. Each and every pixel should be compared with the threshold and transformed to its respective class according to the threshold value. Thus threshold takes a major role in binarization. Hence determination of proper threshold value in binarization is a major factor of being a good binarised image and it can be approached in two categories like global thresholding and local thresholding techniques. In uniform contrast distribution of background and foreground documents, global thesholding is more suitable than that of local thresholding one. In degraded documents, where considerable background noise or variation in contrast and illumination exists, local technique is more suitable than that of global one. In this paper a local thresholding technique using local contrast and mean is described. Local adaptation is carried out with the local contrast and mean.
26 citations
References
More filters
TL;DR: There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale.
Abstract: This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to a single edge. We use the criteria in numerical optimization to derive detectors for several common image features, including step edges. On specializing the analysis to step edges, we find that there is a natural uncertainty principle between detection and localization performance, which are the two main goals. With this principle we derive a single operator shape which is optimal at any scale. The optimal detector has a simple approximate implementation in which edges are marked at maxima in gradient magnitude of a Gaussian-smoothed image. We extend this simple detector using operators of several widths to cope with different signal-to-noise ratios in the image. We present a general method, called feature synthesis, for the fine-to-coarse integration of information from operators at different scales. Finally we show that step edge detector performance improves considerably as the operator point spread function is extended along the edge.
28,073 citations
"A new method for image segmentation..." refers methods in this paper
...Canny operator[2] transforms the edge detection problem into the problem of unit function maximum detection....
[...]
TL;DR: This work presents a simple and efficient implementation of Lloyd's k-means clustering algorithm, which it calls the filtering algorithm, and establishes the practical efficiency of the algorithm's running time.
Abstract: In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's (1982) algorithm. We present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm's running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation.
5,288 citations
"A new method for image segmentation..." refers methods in this paper
...Fuzzy K-means algorithm[3] that divides the samples on various categories of membership according to the data is a clustering method in more common use....
[...]
Book•
15 Sep 1994
TL;DR: The fundamental principles of Digital Image Processing are explained, as well as practical suggestions for improving the quality and efficiency of image processing.
Abstract: What Is Image Processing?. Fundamentals of Digital Image Processing. The Digital Image. PROCESSING CONCEPTS. Image Enhancement and Restoration. Image Analysis. Image Compression. Image Synthesis. PROCESSING SYSTEMS. Image Origination and Display. Image Data Handling. Image Data Processing. PROCESSING IN ACTION. Image Operation Studies. Appendices. Glossary. Index.
457 citations
12 May 1998
TL;DR: A novel method for measuring the orientation of an edge is introduced and it is shown that it is without error in the noise-free case, and the wreath product transform edge detection performance is shown to be superior to many standard edge detectors.
Abstract: Wreath product group based spectral analysis has led to the development of the wreath product transform, a new multiresolution transform closely related to the wavelet transform. We derive the filter bank implementation of a simple wreath product transform and show that it is in fact, a multiresolution Roberts (1965) Cross edge detector. We also derive the relationship between this transform and the two-dimensional Haar wavelet transform. We prove that, using a non-traditional metric for measuring edge amplitude with the wreath product transform, yields a rotation and translation invariant edge detector. We introduce a novel method for measuring the orientation of an edge and show that it is without error in the noise-free case. The wreath product transform edge detection performance is shown to be superior to many standard edge detectors.
19 citations