scispace - formally typeset
Search or ask a question
Author

Cao Peiliang

Bio: Cao Peiliang is an academic researcher from South China Normal University. The author has contributed to research in topics: Image segmentation & Scale-space segmentation. The author has an hindex of 2, co-authored 2 publications receiving 95 citations.

Papers
More filters
Proceedings ArticleDOI
01 Nov 2009
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.

99 citations

Proceedings ArticleDOI
21 Nov 2009
TL;DR: Fractal dimension and co-occurrence matrix algorithm is adopted to describe the texture characteristics of the indentation image, forming a n-dimensional feature vector, introducing EPNSQ to smooth the features and combined with the k-means clustering algorithm to get texture segmentation result.
Abstract: The algorithm of fractal dimension and co-occurrence matrices is proposed and is applied to material Vickers hardness image segmentation. Based on the characteristics of the indentation images, this article uses texture features to extract the indentation silhouette from the point view of texture segmentation. We adopt fractal dimension and co-occurrence matrix algorithm to describe the texture characteristics of the indentation image, forming a n-dimensional feature vector, introducing EPNSQ to smooth the features. Finally we combine with the k-means clustering algorithm to get texture segmentation result. The experiment demonstrates that in the material Vickers hardness image segmentation the proposed algorithm was significantly effective and robust.

2 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: In this paper, the applicability of various thresholding and locally adaptive segmentation techniques for industrial and synchrotron X-ray CT images of natural and artificial porous media was investigated.
Abstract: [1] Nondestructive imaging methods such as X-ray computed tomography (CT) yield high-resolution, three-dimensional representations of pore space and fluid distribution within porous materials. Steadily increasing computational capabilities and easier access to X-ray CT facilities have contributed to a recent surge in microporous media research with objectives ranging from theoretical aspects of fluid and interfacial dynamics at the pore scale to practical applications such as dense nonaqueous phase liquid transport and dissolution. In recent years, significant efforts and resources have been devoted to improve CT technology, microscale analysis, and fluid dynamics simulations. However, the development of adequate image segmentation methods for conversion of gray scale CT volumes into a discrete form that permits quantitative characterization of pore space features and subsequent modeling of liquid distribution and flow processes seems to lag. In this paper we investigated the applicability of various thresholding and locally adaptive segmentation techniques for industrial and synchrotron X-ray CT images of natural and artificial porous media. A comparison between directly measured and image-derived porosities clearly demonstrates that the application of different segmentation methods as well as associated operator biases yield vastly differing results. This illustrates the importance of the segmentation step for quantitative pore space analysis and fluid dynamics modeling. Only a few of the tested methods showed promise for both industrial and synchrotron tomography. Utilization of local image information such as spatial correlation as well as the application of locally adaptive techniques yielded significantly better results.

510 citations

Journal ArticleDOI
TL;DR: In this article, the authors focus on multiclass segmentation and detailed descriptions as to why a specific method may fail together with strategies for preventing the failure by applying suitable image enhancement prior to segmentation.
Abstract: Easier access to X-ray microtomography (μCT) facilities has provided much new insight from high-resolution imaging for various problems in porous media research. Pore space analysis with respect to functional properties usually requires segmentation of the intensity data into different classes. Image segmentation is a nontrivial problem that may have a profound impact on all subsequent image analyses. This review deals with two issues that are neglected in most of the recent studies on image segmentation: (i) focus on multiclass segmentation and (ii) detailed descriptions as to why a specific method may fail together with strategies for preventing the failure by applying suitable image enhancement prior to segmentation. In this way, the presented algorithms become very robust and are less prone to operator bias. Three different test images are examined: a synthetic image with ground-truth information, a synchrotron image of precision beads with three different fluids residing in the pore space, and a μCT image of a soil sample containing macropores, rocks, organic matter, and the soil matrix. Image blur is identified as the major cause for poor segmentation results. Other impairments of the raw data like noise, ring artifacts, and intensity variation can be removed with current image enhancement methods. Bayesian Markov random field segmentation, watershed segmentation, and converging active contours are well suited for multiclass segmentation, yet with different success to correct for partial volume effects and conserve small image features simultaneously.

475 citations

Journal ArticleDOI
TL;DR: An overview of the literature concerning the automatic analysis of images of printed and handwritten musical scores and a reference scheme for any researcher wanting to compare new OMR algorithms against well-known ones is presented.
Abstract: For centuries, music has been shared and remembered by two traditions: aural transmission and in the form of written documents normally called musical scores. Many of these scores exist in the form of unpublished manuscripts and hence they are in danger of being lost through the normal ravages of time. To preserve the music some form of typesetting or, ideally, a computer system that can automatically decode the symbolic images and create new scores is required. Programs analogous to optical character recognition systems called optical music recognition (OMR) systems have been under intensive development for many years. However, the results to date are far from ideal. Each of the proposed methods emphasizes different properties and therefore makes it difficult to effectively evaluate its competitive advantages. This article provides an overview of the literature concerning the automatic analysis of images of printed and handwritten musical scores. For self-containment and for the benefit of the reader, an introduction to OMR processing systems precedes the literature overview. The following study presents a reference scheme for any researcher wanting to compare new OMR algorithms against well-known ones.

246 citations

Posted Content
TL;DR: This paper describes a locally adaptive thresholding technique that removes background by using local mean and mean deviation and uses integral sum image as a prior processing to calculate local mean.
Abstract: Image binarization is the process of separation of pixel values into two groups, white as background and black as foreground Thresholding plays a major in binarization of images Thresholding can be categorized into global thresholding and local thresholding In images with uniform contrast distribution of background and foreground like document images, global thresholding is more appropriate In degraded document images, where considerable background noise or variation in contrast and illumination exists, there exists many pixels that cannot be easily classified as foreground or background In such cases, binarization with local thresholding is more appropriate This paper describes a locally adaptive thresholding technique that removes background by using local mean and mean deviation Normally the local mean computational time depends on the window size Our technique uses integral sum image as a prior processing to calculate local mean It does not involve calculations of standard deviations as in other local adaptive techniques This along with the fact that calculations of mean is independent of window size speed up the process as compared to other local thresholding techniques

202 citations

Journal ArticleDOI
TL;DR: A novel binarization method for document images produced by cameras that divides an image into several regions and decides how to binarize each region, derived from a learning process that takes training images as input.

104 citations