A method to improve sugar crystals classification

There has been a long development of sugar crystal analysis techniques. Initially crystals were manually passed through various increasingly finer sieves so that one could manually calculate what percentage of crystals and crystal masses lay in various size groups. Later microscopes were used on small samples to take pictures of crystals so that they could be sized manually at higher degree of accuracy. In order to increase the accuracy, image processing are being used to analyze the pictures taken under microscope. The main concern is to analyze crystals with width greater than 50 micrometers. The ideal crystal is roughly square and has a width of approximately 120 micrometers. There is then a need to separate crystals into two main classes: the class of crystals that have to be considered for the analysis and those that will be rejected. This classification process involves: the enhancement of the quality of the image, the binarization of the image, the extraction of the connected components, the features extraction from each connected component and the characterization of the classes. During this process, there is more often a lost of information and in some case an intrusion of noise. These can have as result some misclassifications. These misclassifications can be caused by touching crystals or overlapping crystals that are treated as single crystal. These can also be due to the fact that edges of crystals are not well extracted. In this paper we present a method to alleviate those misclassifications using mathematical morphology and a combination of binarization and edge detection. This method gives better classification. Some results are presented.

[1]  Andreas E. Savakis,et al.  Adaptive document image thresholding using foreground and background clustering , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[2]  Bimal Kumar Ray,et al.  An algorithm for detection of dominant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[3]  BIMAL KUMAR RAY,et al.  Determination of optimal polygon from digital curve using L1 norm , 1993, Pattern Recognit..

[4]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Anil K. Jain,et al.  Goal-Directed Evaluation of Binarization Methods , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  T. Fukumura,et al.  An Analysis of Topological Properties of Digitized Binary Pictures Using Local Features , 1975 .

[7]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[8]  T. Pavlidis Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.