Survey of Microscopic Image Segmentation ...

I J C T A, 9(41), 2016, pp. 345-353 © International Science Press

ISSN: 0974-5572

Survey of Microscopic Image Segmentation Techniques and Image Quality Measures Amandeep Singh Sandhu* and Gursharanjeet Singh Kalra**

ABSTRACT Microscopic image segmentation is one of the main application scope of computerized image analysis.Determination of edges and area of cells and sub-cellular structures fromMicroscopicimages is done by segmentation techniques that separate the cell objects in an image from the surrounding background. Relative advantages of different segmentation techniques and their crucial steps are discussed. Quality measures are also discussed for the performance analysis of segmentation techniques. Keywords: Cell segmentation, Object detection, Region of interest, cell edge, Microscopic image, Microscopy .

1. INTRODUCTION In life sciences, more intricate organic models are to be researched. The rising field of frameworks science goes for building models coordinating the administrative procedures of life forms in this manner the significant progression in microscopy is completed. Late advances in microscopy lead to the likelihood to quickly produce a lot of volumetric picture information and even to record an example after some time. By recording a few progressive time focuses, it is even conceivable to screen the improvement of cells and tissues. Because of the tremendous number of parameters that may impact an organic result, cell imaging tests are frequently done in a ‘’high substance’’ mode where huge quantities of matched and reproduce analyses are completed all the while and result in substantial picture datasets. Such a considerable volume of picture data pieces visual evaluation of every picture, and electronic picture taking care of and examination is the fundamental doable approach to manage information investigation. In addition, researchers more often than not as of now expect certain impacts of their trials on the information with the end goal that manual assessments are conceivably one-sided [1, 2]. Conversely, a robotized framework can dissect volumetric data in that capacity. High significance is along these lines joined to electronic techniques that either prompts a full robotization of the investigation of the recorded information or help the master in examining the information in a semi-mechanized manner. Essential strides towards this computerization are information preprocessing, for example, denoising, deblurring, and enlistment of the information [3], item or occasion recognition, and article division. Because of its significance, an extraordinary assortment of division calculations has been proposed for an extensive variety of utilizations and the productions are far reaching in writing: microscopy, biomedical building, biomedical imaging, and bioinformatics. The undertaking of division in minuscule pictures alludes to the way toward finding the limits of cells, cells cores or histological structures with a satisfactory precision. *

School of Electronics and Electrical Engineering Lovely Professional University, Jalandhar-144001 Punjab Indial, Email: [email protected]

**

School of Electronics and Electrical Engineering Lovely Professional University, Jalandhar-144001 Punjab India, Email: [email protected]

346

Amandeep Singh Sandhu and Gursharanjeet Singh Kalra

In this paper, we had talked about all the real division approaches utilized for parceling a picture into non-converging locales with the end goal that every area is homogeneous and the union of no two nearby districts is homogeneous. Significant picture quality measures are additionally talked about for relative investigation of infinitesimal picture division .Accurate similar examination prompts the choice of most appropriate division procedure for sought information set. 2. SEGMENTATION TECHNIQUES In this segment, talk center is on picture Segmentation methods to allotments a picture into unmistakable areas containing every pixel with comparative characteristics. These smooth and non-smooth districts are considered independently with the goal that they can be important and helpful for picture investigation. 2.1. Intensity Thresholding It is the most seasoned division technique is still broadly utilized as a part of straightforward applications. The contribution to a thresholding operation is generally a grayscale or shading picture. In the most clear use, the yield is a double picture speaking to the division. Dark pixels compare to the foundation and white pixels relate to frontal area (or the a different way). In straightforward usage, the division is dictated by a solitary parameter known as the power edge [4, 5]. In a solitary pass, every pixel in the picture is contrasted and this limit. Utilizing range qualities or edge values, pixels are ordered utilizing both of the thresholding methods like worldwide and neighborhood thresholding. Worldwide thresholding strategy chooses one and only limit esteem for the whole picture. Nearby thresholding chooses distinctive limit values for various locales. To fragment complex pictures multilevel thresholding is required [6]. Global thresholding, using an appropriate threshold T: 1, if f  x, y   T g  x, y    0, if f  x, y   T

(1)

Local threshold, using multiplethresholds T1, T2, T3:  T2  a, if f  x, y   g  x, y   b, if T 1  f  x, y   T 2  c, if f  x, y   T1 

(2)

2.2. Gradient base segmentation Vertical edges can be perceived by using a level angle administrator took after by an edge operation to distinguish the compelling estimations of the inclination. The slope delivers a doublet of extremes, positivenegative or negative-positive, contingent upon the heading of the move. Even edges deliver a vertical slope in the picture, and can be improved with a vertical angle finder [7, 8]. A corner to corner edge is neither flat nor vertical. It will bring about a fractional reaction to both the even and vertical edge locators. A picture that is a mix of the two procedures can be made by consolidating the aftereffects of every slope count. The picture that is so made could be known as an inclination picture, consolidating the even angle and vertical slope [9]. In the accompanying condition i speak to lines and j speak to sections, A and B are info and yield lattice individually. A horizontal gradient filter can be defined by

Survey of Microscopic Image Segmentation Techniques and Image Quality Measures

347

B  i, j   A  i, j  1  A  i, j  1

(3)

A vertical gradient filter can be defined by

B  i, j   A  i  1, j   A  i  1, j 

(4)

After inclination pictures have been processed, pixels with expansive angle values get to be conceivable edge pixels. Edges are nearby changes in the picture force. The fundamental elements can be removed from the edges of a picture which prompts better division and examination. There are numerous edge discovery procedures in the writing for picture division. The most usually utilized intermittence based edge location strategies are surveyed in this area. Those systems are Roberts edge recognition, Sobel Edge Detection, Prewitt edge identification, Kirsh edge location, Robinson edge discovery, Marr-Hildreth edge identification, Log edge recognition and Canny Edge Detection [10, 11, 12]. 2.3. Morphological filtering To comprehend working rule of morphological division in the first place, we have to comprehend morphological picture preparing which is a social event of non-direct operations related to the shape or morphology of components in a photo [13]. Morphological frameworks test a photo with a little shape or design called a sorting out segment. The arranging part is arranged at all possible zones in the photo and it is differentiated and the relating neighborhood of pixels. A couple of operations test whether the segment “fits” inside the range, while others test whether it “hits” or meets the zone [14].A morphological operation on a parallel picture makes another double picture in which the pixel has a non-zero esteem just if the test is fruitful at that area in the info picture. This new picture contains a district of interest. Numerical morphology built up a hypothetical system for non-straight picture investigation, which from its origin prompted critical hypothetical and pragmatic results. Because of its logarithmic establishment and geometrical instinct, the hypothesis of numerical morphology is extremely adaptable, fit for taking care of numerous various picture sorts [15], including traditional multi-dimensional signs and also broad diagrams and surfaces. Essentially all other numerical morphology administrators can be characterized as far as blends of disintegration and expansion alongside set administrators, for example, crossing point and union. Some of the morphological operators • Closing - structured filling in of image region boundary pixels • Opening - structured removal of image region boundary pixels • Granulometry- it is an approach to compute a size distribution of grains in binary images, using a series of morphological opening operations • Skeletonization/Medial Axis Transform - finding skeletons of binary regions • Hit and Miss Transform - image pattern matching and marking • Erosion - shrink image regions • Dilation - grow image regions • Thinning - structured erosion using image pattern matching • Thickening - structured dilation using image pattern matching

348

Amandeep Singh Sandhu and Gursharanjeet Singh Kalra

2.4. Active contour 2.4.1. Active Contours and Level Set Methods The optimization methods generally called Active Contour Models. The “active contours” start with an initialized contour and actively deform themselves to the desired border while reducing the defined energy in each iteration until convergence. Convergence is achieved when reaching a balance between the “External” powers that attracts the contour to its place and the “Internal” powers which keep it smooth [16, 17, 18], usually by maintaining some function of its curvature.The first model was suggested and implemented was called “Snakes” [20]. Later evolution occurred in the Level Set model that embedded 2D contour in a surface in 3D [19]. Further optimization to the Level Set algorithm reached in the form of Narrow Band andfastmarching. The next changes in the theory appeared as Geodesic Active Contours which showed a relationship between Snakes and Level Sets and proposed a better convergence scheme. 2.4.2. Active Contour Models (“Snakes”) Active Contour Models were first proposed by Kass et al [20] in 1987 as an Interactive Segmentation method for 2D images. Instead of following previews bottom-up approaches (e.g.: [20] where edges are first detected and then linked to form a contour) article suggest a top-down approach.The model treats the desired contour as a time evolvingcurve and the segmentation process as an optimization over time of an adequate energy functional. The curve location C is parameterized by a spatial parameter p and the iteration time t as follows: C(p, t) = (x(p, t), y(p, t)) (5) The curve is considered to be applied tomultiple types of forces, reaching equilibrium when the energy is minimized: 1. “External Forces”, attracting the contour to its desired location using image features and other knowledge. 2. “Internal forces”, keeping the contour regular and “well behaved”, assuming some form of tension in the curve. Therefore, the energy functional to minimize is generally written as: 1

1

E (C ( p ))   Einternal (C ( p ))dp   Eexternal (C ( p ))dp 0

(6)

0

The ideal arrangement is accomplished when the vitality minimization process accomplishes harmony, that is, the vitality useful achieves a neighborhood least. Note that worldwide least is not ensured by this strategy and this is the motivation behind why client association is required [21]. Calculation can part the outer powers to: a. “Image forces”, attracting the contour (“Snake”) to significant image features. b. “External Constraint”, added by user to make the Snake attract (or retract) to (from) significant high-knowledge features. Therefore, the Snake’s energy functional is written as: 1

1

E (C ( p ))   Einternal (C ( p )) dp   Eimage (C ( p )) dp  Econstarints (C ( p )) 0

0

(7)

Survey of Microscopic Image Segmentation Techniques and Image Quality Measures

349

2.5. Region growing This is most likely the least complex among the crossover procedures. Area developing is a procedure to extricate an associated district from a 3D volume in view of some pre-characterized interfacing rule. These criteria can be as straightforward as the voxel force or could be the yield of some other division calculation [22]. In the easiest structure, district developing requires a seed point to begin with. From the seed point, the calculation develops till the interfacing criteria are fulfilled. Likewise with thresholding, area developing is basic, however not frequently utilized for division without anyone else. As a general rule, locale developing structures a part of a division pipeline for a specific methodology. It is frequently utilized as the essential technique to comprehend a 3D information before more mind boggling division is connected to it [23]. The essential impediment of this calculation is that it requires seed focuses which by and large mean manual cooperation. Subsequently for every district to be divided, a seed point is required. Area developing can likewise be touchy to commotion and incomplete volume impact bringing on the separated locale to have gaps or disengagements. Some late work has been accounted for which tries to ease these issues. In another late work, fluffy analogies to district developing have additionally been created. District developing division is a way to deal with inspect the neighboring pixels of the underlying “seed focuses” and figure out whether the pixels are added to the seed point or not. Step 1. Selecting an arrangement of one or all the more beginning stage (seed) regularly can be founded on the way of the issue. Step 2. The districts are developed from these seed focuses to adjoining point contingent upon a limit or criteria. Step 3. Area development ought to stop when no more pixels fulfill the criteria for consideration in that district. 2.6. Watersheds The idea of a watershed depends on picturing a picture in three measurements: two spatial directions and force. We consider three sorts of focuses: 1. The focuses having a place with the nearby least. 2. The focuses where a drop of water, if set at the areas of these focuses, would tumble to a solitary nearby least. It is called catchment bowl or watershed. 3. He focuses where water would be similarly liable to tumble to more than one neighborhood least. They are like the peak lines on the topographic surface and are named partition lines or watershed lines. The two fundamental properties of watershed division result are constant limits and over-divisions. As we probably am aware, the limits that made by the watershed calculation are precise the watershed lines in the picture [24, 25]. Along these lines, the quantities of district essentially will be equivalent to the quantities of minima in the picture. There are two stages to accomplish the arrangement utilizing marker: 1. Preprocessing of the picture. 2. Defining the criteria that the markers must be fulfilled. 2.7. Normalized cuts Standardized cuts go for part so that the division is ideal. Every pixel is a vertex in a chart, edges join nearby pixels. Weights on the edge are appointed by likeness between two relating pixels. The rule for

350

Amandeep Singh Sandhu and Gursharanjeet Singh Kalra

similitude is diverse in various applications. Likeness can be characterized the separation, shading, dim level, surfaces etc. The upside of this procedure is that it expels the need to union areas subsequent to part. It gives better definition around the edges Shi and Jitendra Malik [26], in their paper Normalized cuts and picture division demonstrates how standardized cut is an unprejudiced measure of disassociation between subgroups of a diagram and it has the pleasant property that minimizing standardized slice drives specifically to expanding the standardized affiliation, which is an impartial measure of aggregate relationship inside the subgroups. Change in the execution of the standardized cut was made by presenting the shape data [27]. This technique can accurately portion the article, despite the fact that a part of the limit is absent or numerous loud areas go with the item. In this way there are different points of interest of this technique like it introduces another optimality paradigm for apportioning a diagram into groups, diverse picture highlights like power, shading surface, form progression are dealt with in one uniform system. Yet, there are sure disservices like a great deal of computational intricacy included particularly for full-scale pictures .The execution and dependability of the dividing exceedingly rely on upon the decision of the parameters. 2.8. Cluster base division procedures 2.8.1. Kmean Means K-Means is a minimum squares parceling strategy that partitions a gathering of items into K bunches. The calculation repeats more than two stages: 1. Compute the mean of every bunch. 2. Compute the separation of every point from every bunch by processing its separation from the comparing group mean. Allot every point to the bunch it is closest to. 3. Iterate over the above two stages till the entirety of squared inside gathering mistakes can’t be brought down any more. The quantity of highlight pictures utilized for the division procedure. The K-Means can then be utilized to portion the picture into three groups - comparing to two scripts and foundation separately [28]. For each extra script, one more bunch is included. Here, every component is appointed an alternate weight, which is computed taking into account the element significance as depicted in the past Section. The separation between two vectors is processed. Once the picture has been fragmented utilizing the K-Means calculation, the grouping can be enhanced by expecting that neighboring pixels have a high likelihood of falling into the same bunch [29]. In this way, regardless of the possibility that a pixel has been wrongly bunched, it can be rectified by taking a gander at the neighboring pixels. 2.8.2. Fuzzy c-mean Fuzzy c-means (FCM) grouping [30] is an unsupervised system that has been effectively connected to highlight investigation, bunching, and classifier plans in fields, for example, stargazing, geography, restorative imaging, the objective acknowledgment, and picture division. A picture can be spoken to in different component spaces, and the FCM calculation orders the picture by gathering comparative information focuses in the element space into groups [31]. This grouping is accomplished by iteratively minimizing a cost capacity that is reliant on the separation of the pixels to the bunch focuses in the component area. 3. IMAGE QUALITY MEASURES To dissect the execution of division strategies these Image quality measures can be utilized and they are subdivided into taking after classifications. • Edge-based measures whichis displacement of edge positions or their consistency across resolution level. Examples are

Survey of Microscopic Image Segmentation Techniques and Image Quality Measures

351

o Pratt Edge Measure o Edge Stability Measure • Pixel difference-based measures such as mean square distortion. Examples are o Mean Square Error o Mean Absolute Error o Neighborhood Error • Context-based measures, that is penalties based on various functions of the multidimensional context probability. Examples are o Rate Distortion Measure o Hellinger distance o Generalized Matusita distance • Correlation-based measures, that is acorrelation of pixels, or of the vector angular directions. Examples are o Normalized Cross-Correlation o Image Fidelity o Czenakowski Correlation • Human Visual System-based measures, measures either based on the HVS weighted spectral distortion measures or dissimilarity criteria used in image database browsing functions. Examples are o HVS Absolute Norm o HVS L2 Norm • Spectral distance-based measures that are Fourier magnitude and/or phase spectral discrepancy on a block basis. Examples are o Spectral Phase Error o Spectral Phase-Magnitude Error o Block Spectral Magnitude Error 4. CONCLUSION In this paper, we had discussed several image segmentation techniques and by the study, it is very evident that any single segmentation technique can not be used on all types of microscopic datasets, so a lot of scope for improvement is there in the field of microscopic images segmentation. The performance of segmentation technique is dependent on many factors such as intensity, texture, image content which is also varying with respect to the type of data set. Therefore to identify optimal performing segmentation technique for desired dataset selection of quality measure become important to compare the performance of different segmentation techniques REFERENCES [1]

J. R. Swedlow and K. W. Eliceiri, “Open source bioimage informatics for cell biology”, Trends in Cell Biology,vol. 19, no. 11, pp. 656–660, November 2009.

352

Amandeep Singh Sandhu and Gursharanjeet Singh Kalra

[2]

J. Rittscher, “Characterization of biological processes through automated image analysis”, Annual Review ofBiomedical Engineering, vol. 12, pp. 315–344, August 2010.

[3]

E. D. Gelasca, J. Byun, B. Obara, and B.S. Manjunath, “Evaluation and benchmark for biological image segmentation,” in IEEE International Conference on Image Processing, Oct 2008, pp. 1816–1819.

[4]

Tao, H. and T. Huang, “Color Image Edge Detection using Cluster Analysis”, IEEEX. Chen; X. Zhou; Wong, S.T.C., “Automated segmentation,classification, and tracking of cancer cell nuclei in time-lapsemicroscopy,” Biomedical Engineering, IEEE Transactions,April, 4, 2006, Vol. 53, pp. 762-766.

[5]

N. Kharma; H. Moghnieh; J. Yao; Y.P. Guo; A. Abu-Baker; J. Laganiere; G. Rouleau; M. Cheriet, “Automaticsegmentation of cells from microscopic imagery using ellipsedetection,” BImage Processing, IET, March 1, 2007,Vol. 1, pp. 39-47.

[6]

N. Otsu, “A Threshold Selection Method from Gray-LevelHistogram,” IEEE Trans. on Systems, Man, and Cybernetics,January 1979, Vol. 9, pp. 62-66.

[7]

Heath, M., Sarkar, S., Sanocki, T., & Bowyer, K. A robust method for assessing the relative performance of edge-detection algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19, 1338–1359. 1997

[8]

Zhu . Efficient evaluations of edge connectivityand width uniformity. Image and Vision Computing, 14, 21–34. 1996

[9]

Shin, M. C., Goldgof, D. B., & Bowyer, K. W. Comparison of edge detectors using and object recognition task. Computer Vision and Pattern Recognition (pp. 360–365). 1999

[10]

Forbes, L. A., & Draper, B. A. Inconsistencies in edge detector evaluation. Computer Vision and Pattern Recognition (pp.398–404). Hilton Head, SC. 2000

[11] Konishi, S., Yuille, A., & Coughlan, J. Statistical edge detection: Learning and evaluating edge cues. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25.2003 [12] Canny, J., “A Computational Approach to Edge Detection”, IEEE Transactions onPattern Analysis and Machine Intelligence, Vol. 8, No. 6, pp. 679-698, 1986 . [13] P. T. Jackway, “Gradient watershed in morphological scale-space “, IEEE Trans. Image Processing, vol. 5, pp. 913-921, 1996 [14] J. H. Bosworth and S. T. Acton, “Morphological image segmentation by local monotonicity”, Proc. Asilomar Conf. Signals, Systems, and Computers , vol. 1, pp. 53-57, 1999 [15] J. Serra, Image Analysis Using Mathematical Morphology, 1982, Academic [16] Yang L., Meer P., Foran D.J., Unsupervised Segmentation Based on Robust Estimation and Color Active Contour Models. IEEE Trans. Inf. Technol. Biomed., Vol. 9, 3, 475–486, 2005. [17] P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik, “Contour detectionand hierarchical image segmentation,” IEEE Trans. Pattern Anal. Mach.Intell., vol. 33, no. 5, pp. 898–916, May 2011. [18] Osher, Stanley J. Fedkiw, Ronald P. Level Set Methods and Dynamic Implicit Surfaces. Springer-Verlag. ISBN 0-38795482-1.2002 [19] Sethian, James A. Level Set Methods, and Fast Marching Methods : Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science.Cambridge University Press. ISBN 0-521-64557-3.1999 [20] Kass M., Witkin A., Terzopoulos. D.: Snakes: Active Contour Models, inProceedings of 1st International Conference on Computer Vision, London,1987, pp. 259-267 [21] Cremers, D.; Schnorr, C.; Weickert, J. “Diffusion-snakes: combining statistical shape knowledge and image information in a variational framework”. Proceedings. IEEE Workshop on 50: 137–144. [22] Carevic, D. and T. Caelli, “Region-Based Coding of Color Images Using KLT”,Graphical Models and Image Processing, Vol. 59, No. 1, pp. 27-38, 1997. [23] Pavlidis T.,Liow I.-T: Integrating Region Growing and Edge Detection, in Proceedings of IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 12, No. 3, March 1990 [24] Roshni V.S., Raju G., Image Segmentation Using Multiresolution Texture Gradient and Watershed Algorithm. International Journal of Computer Applications, Vol. 22, 21"28, 2011 [25] Laurent Najman, Michel Couprie and Gilles Bertrand. Watersheds, mosaics, and the emergence paradigm. In Discrete Applied Mathematics, Vol. 147, Num. 2–3, Pages 301–324.2005 [26] Shi, J., and Malik, J “Normalized cuts and image segmentation” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 731–737 1997 [27] Wenchao Cai, JueWu, Albert C. S. Chung, “shape-based image segmentation using normalized cuts”, ICIP, 2006, IEEE.

Survey of Microscopic Image Segmentation Techniques and Image Quality Measures

353

[28] J. Xie and S. Jiang, “A simple and fast algorithm for global K-meansclustering,” in Proc. 2nd Int. Workshop Edu. Technol. Comput. Sci.vol. 2. 2010, pp. 36–40. [29] Chen Zhang and Shixiong Xia, “ K-means Clustering Algorithm with Improved Initial center,” in Second International Workshop on Knowledge Discovery and Data Mining (WKDD), pp. 790-792, 2009. [30] Kiyotaka Mizutani and Sadaaki Miyamoto, Possibilistic Approach to Kernel- Based Fuzzy c-Means Clustering with Entropy Regularization, in V.Torra, et al.(Eds.),Modeling Decisions for Artificial Intelligence, LNAI3558, 2005, pp. 144-155. [31] S.L.Chiu, Fuzzy model identification based on cluster estimation, Journal of Intelligent and Fuzzy Systems 2 . 267-278.