AUTOMATIC BLASTOMERE DETECTION IN DAY 1 TO DAY 2 HUMAN EMBRYO IMAGES USING PARTITIONED GRAPHS AND ELLIPSOIDS

Similar documents
Color Image Segmentation

Modeling and preoperative planning for kidney surgery

Morphological Image Processing

Biomedical Image Analysis. Mathematical Morphology

OTCYMIST: Otsu-Canny Minimal Spanning Tree for Born-Digital Images

Image Segmentation Based on Watershed and Edge Detection Techniques

Robotics Programming Laboratory

TRANSPARENT OBJECT DETECTION USING REGIONS WITH CONVOLUTIONAL NEURAL NETWORK

Morphological Image Processing

Generic Face Alignment Using an Improved Active Shape Model

Towards the completion of assignment 1

HOUGH TRANSFORM CS 6350 C V

Topic 4 Image Segmentation

Identify Curvilinear Structure Based on Oriented Phase Congruency in Live Cell Images

Extracting Layers and Recognizing Features for Automatic Map Understanding. Yao-Yi Chiang

Topic 6 Representation and Description

Segmentation of Fat and Fascias in Canine Ultrasound Images

DATA EMBEDDING IN TEXT FOR A COPIER SYSTEM

6. Object Identification L AK S H M O U. E D U

Improved Non-Local Means Algorithm Based on Dimensionality Reduction

Image Segmentation for Image Object Extraction

Textural Features for Image Database Retrieval

CITS 4402 Computer Vision

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Lecture 6: Edge Detection

Image Segmentation. Selim Aksoy. Bilkent University

2 Proposed Methodology

Image Segmentation. Selim Aksoy. Bilkent University

SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS.

Color Lesion Boundary Detection Using Live Wire

Training-Free, Generic Object Detection Using Locally Adaptive Regression Kernels

Image Resizing Based on Gradient Vector Flow Analysis

2D image segmentation based on spatial coherence

Comparison between Various Edge Detection Methods on Satellite Image

Random spatial sampling and majority voting based image thresholding

NIH Public Access Author Manuscript Proc Soc Photo Opt Instrum Eng. Author manuscript; available in PMC 2014 October 07.

Performance Evaluation Metrics and Statistics for Positional Tracker Evaluation

Detecting Printed and Handwritten Partial Copies of Line Drawings Embedded in Complex Backgrounds

Combining Top-down and Bottom-up Segmentation

CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION

Segmentation and Grouping

Package vesselr. R topics documented: April 3, Type Package

A Neural Classifier for Anomaly Detection in Magnetic Motion Capture

CS 534: Computer Vision Segmentation and Perceptual Grouping

Use of Shape Deformation to Seamlessly Stitch Historical Document Images

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS

doi: /

Chapter - 2 : IMAGE ENHANCEMENT

Segmentation Computer Vision Spring 2018, Lecture 27

SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS

FOREGROUND SEGMENTATION BASED ON MULTI-RESOLUTION AND MATTING

DIGITAL IMAGE ANALYSIS. Image Classification: Object-based Classification

Performance Analysis of Isoperimetric Algorithm Applied to CT Images

Looming Motion Segmentation in Vehicle Tracking System using Wavelet Transforms

Using temporal seeding to constrain the disparity search range in stereo matching

Samuel Coolidge, Dan Simon, Dennis Shasha, Technical Report NYU/CIMS/TR

Comparison of Vessel Segmentations using STAPLE

IMAGE SEGMENTATION. Václav Hlaváč

MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION OF TEXTURES

Iterative Estimation of 3D Transformations for Object Alignment

Detection of Edges Using Mathematical Morphological Operators

Occlusion Detection of Real Objects using Contour Based Stereo Matching

Experimentation on the use of Chromaticity Features, Local Binary Pattern and Discrete Cosine Transform in Colour Texture Analysis

2D Vessel Segmentation Using Local Adaptive Contrast Enhancement

Understanding Tracking and StroMotion of Soccer Ball

Region-based Segmentation

CRF Based Point Cloud Segmentation Jonathan Nation

Graph Based Image Segmentation

AUTOMATIC LOGO EXTRACTION FROM DOCUMENT IMAGES

Patch-based Object Recognition. Basic Idea

09/11/2017. Morphological image processing. Morphological image processing. Morphological image processing. Morphological image processing (binary)

CHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS

Human Motion Detection and Tracking for Video Surveillance

Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial Region Segmentation

Exploring Curve Fitting for Fingers in Egocentric Images

Edge Detection for Dental X-ray Image Segmentation using Neural Network approach

Model-based segmentation and recognition from range data

arxiv: v1 [cs.cv] 2 May 2016

CHAPTER-4 LOCALIZATION AND CONTOUR DETECTION OF OPTIC DISK

An ICA based Approach for Complex Color Scene Text Binarization

Comparison of Local Feature Descriptors

Structural Analysis of Aerial Photographs (HB47 Computer Vision: Assignment)

Schedule for Rest of Semester

Multiscale Blood Vessel Segmentation in Retinal Fundus Images

Application of level set based method for segmentation of blood vessels in angiography images

Multi-pass approach to adaptive thresholding based image segmentation

Image Segmentation Techniques for Object-Based Coding

COSC160: Detection and Classification. Jeremy Bolton, PhD Assistant Teaching Professor

5 Learning hypothesis classes (16 points)

CS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University

Local Features: Detection, Description & Matching

EE 701 ROBOT VISION. Segmentation

CHAPTER 3 RETINAL OPTIC DISC SEGMENTATION

Transactions on Information and Communications Technologies vol 16, 1996 WIT Press, ISSN

Online algorithms for clustering problems

CORRELATION BASED CAR NUMBER PLATE EXTRACTION SYSTEM

Definition, Detection, and Evaluation of Meeting Events in Airport Surveillance Videos

Connected components - 1

Removing Shadows from Images

AUTONOMOUS IMAGE EXTRACTION AND SEGMENTATION OF IMAGE USING UAV S

Transcription:

AUTOMATIC BLASTOMERE DETECTION IN DAY 1 TO DAY 2 HUMAN EMBRYO IMAGES USING PARTITIONED GRAPHS AND ELLIPSOIDS Amarjot Singh 1, John Buonassisi 1, Parvaneh Saeedi 1, Jon Havelock 2 1. School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada 2. Pacific Centre for Reproductive Medicine, Burnaby, BC, Canada ABSTRACT Fertility specialists have linked the size, shape and position of blastomeres in humans embryos with the viability of such embryos. We propose an automatic blastomere identification and modeling approach in an attempt to aid physicians in determining embryo s viability. The proposed method applies isoperimetric graph partitioning, succeeded by a novel region merging algorithm to Hoffman Modulation Contrast (HMC) embryo images, to approximate blastomeres positions. Ellipsoidal models are then used to approximate the shape and the size of each blastomere. We discuss experimental results on a dataset of 40 embryo images, and expand on the advantages and drawbacks of our method while comparing our method to other approaches. Index Terms IVF, Blastomere, Isoperimetric Graph Partitioning, Region Merging, Entropy, Vesselness. 1. INTRODUCTION Assisted Reproduction Technology (ART) is a number of methods for achieving successful pregnancies through the use of techniques like In Vitro Fertilization (IVF). In IVF, the egg is extracted from the patient and is fertilized into an embryo in a controlled laboratory environment. In early development, the resulting embryo is composed of a number of cells called blastomeres, as shown in Fig. 1. It is desirable to automatically track the changes in shape, size, and position of blastomeres to aid physicians in determining the embryo s viability [1]. Here, we propose a novel method for segmenting blastomeres during day 1 and day 2 of the embryonic development by utilizing a graph based segmentation and a model based shape fitting technique. Fig. 1: HMC images for different blastomere category (a) One cell (b) Two cells (c) Three cells (d) Four cells. The most common approach for imaging blastomeres is through HMC. The resulting images represent the embryo as a 3D-like translucent side-lit structure, easy for human interpretation. Difficulties arise with automatic image analysis because of the side-lit nature of HMC images as well as partial or full occlusion in between blastomeres and cellular fragmentation. A handful of attempts have been developed that automatically segment blastomeres using 3D modeling approaches. Pederson et al [2] developed a 3D modeling technique using Z-stack images, utilizing multiphase variation level set with manually extracted contours to determine relative positions and their 3D shapes of blastomeres. Giusti et al [3] also used a 3D modeling Z-stack approach, where a specialized graph-cut method was implemented to segment blastomeres. Both methods required upwards of 20 images at various focus levels to complete an entire model for one embryo. In contrast, we wish to segment blastomeres using a single image, thus reducing the computational complexity. In this paper, we propose a method for segmenting up to four blastomeres in an embryo image using regions that are generated by isoperimetric graph partitioning. Due to nonuniform illumination while imaging and cellular fragmentation within each embryo, the resulting regions (we refer to them as partitions) might not correspond to a complete blastomere. To obtain regions that each correspond to one complete blastomere, we propose a novel region merging algorithm that utilizes length, vesselness [4], and entropy of the borders between regions. These regions are good indicators of the position of blastomeres; however, accurate blastomere shapes are required. To represent blastomeres shapes, ellipsoidal models are generated by a least-squared fitting method using embryo s edges. The generated models that best represent each merged region are then chosen, similarly, based on the area and the partitions overlap. Finally, a final set of ellipsoidal models are determined by eliminating blastomere candidates that do not satisfy the physical constraints of a typical embryo. Such characteristics include the embryos tendency to minimize unused space within Zona Placida and the fact that they rarely fall completely behind one another. The paper is divided into the following sections. Section 2 describes the proposed algorithm. Section 3 presents the stepby-step experimental results leading to blastomere segmenta- 978-1-4799-5751-4/14/$31.00 2014 IEEE 917

tion. Section 4 draws conclusions from the experimental results and presents future research directions. 2. PROPOSED ALGORITHM The proposed algorithm comprises of four parts: isoperimetric partitioning, region merging, ellipse fitting and set based outlier removal. Details of each process are represented next. 2.1. Isoperimetric Partitioning Isoperimetric partitioning, proposed by Leo Grady [5], solves a linear system of equations instead of an eigenvector problem for graph partitioning. It has been proven that a minimum value of isoperimetric constant, h, converges to a good image segmentation heuristics [5]. The minimum value of the isoperimetric constant h G for a graph G is defined as: h G = min x x T Lx x T d Here L is the the Laplacian matrix, d is the vector representing nodes degree and x is the real solution. In order to solve for a particular solution x 0, the node with the largest degree in L is chosen as the ground node v g. The gth row and column of the Laplacian matrix L are removed and the modified matrix is denoted as L 0. The gth row is represented as x 0, while the vector of nodes degree is denoted by d 0. Equation (1) can be solved as a linear system by reformulating it as a constrained optimization with a Lagrange multiplier. The real solution of x 0 is obtained by solving the following linear system: (1) L 0 = x 0 d 0 (2) The solution x 0 is classified as foreground or background if it is greater or smaller than a cut value of α, defined by the user. The process is continued for each segment until the isoperimetric constant value of all partitions becomes smaller than a stop value of 0.05. 2.2. Proposed Region Merging Algorithm Isoperimetric partitioning may produce unwanted partitions within a blastomere due to directional illumination of the scene and/or cellular fragmentation as shown in Figs. 2(a) and 2(b) respectively. To remove false partitions, a novel region merging algorithm is introduced. The algorithm uses the length, the entropy, and the vesselness of each partition as well as its area to merge partitions. The vesselness is defined by edges and their strength that are computed after enhancing the input image using a multi-scale enhancing filter [4]. Equation (3) assigns low Potential values to partitions with small areas or short lengths as they more likely correspond to cellular fragmentation or are due to non-uniform illumination of the surface of an embryo. For each partition, the entropy (a) (b) (c) Fig. 2: Partitions that corresponds to: (a) regions with different brightness values despite being from the same blastomere. (b) Cellular fragmentation. (c) An ellipsoidal hypothesis with the highest border- and area-overlap is a over-imposed on the segmented region. is computed using Shannon s multiscale vessel enhancement filtering method [6] and the vesselness is computed using Frangi s [4]. Once all four attributes are computed for each partition, the Potential of each partition is computed by: Potential =1 e ( 3 i=1 Xi Wi) area (3) Here X i is the attribute (length, entropy and vesselness), W i is the weight for that attribute and area is the area of the region to which the partition belongs to. All partitions with Potential values below a merging threshold are removed. In order to estimate the merging threshold and weights in equation (3), we performed test trials on 10 training images. Through these training images, we arrived to the weight values of 0.5, 0.3 and 0.2 for length, vesselness and entropy attributes respectively. We also used these weights to compute the potential for each partition using equation (3). The merging threshold was computed by taking the average value of Potential of all partitions, which for this work was 0.8. 2.3. Ellipse Model Fitting Using Partition Set The region merging algorithm generated an improved, yet reduced partition set compared to the initial isoperimetric segmentation results; however, these regions are better in indicating the position than the actual shape of the blastomeres. To combat this problem, we propose generating ellipsoidal models from the edge image, then finding the ellipses that best fit segmented regions. The edge image is generated by smoothing the original image using anisotropic diffusion [7] and then applying a Hessian based edge detector [8]. A least-squared ellipse fitting algorithm [9] is applied to each pair of edges to produce a set of candidate ellipses. The best ellipses are chosen as those with the highest percentage border and area overlap with the segmented regions as shown in Fig. 2(c). 2.4. Set Based Candidate Selection The set of ellipses that best representing the merged regions of an embryo must satisfy two physical constraints common to every embryo. These constraints are: (i) The centroid of each embryo is near to the centroid of the polygonal shape defined 918

by the centroids of all candidates. (ii) Blastomeres rarely fully overlap with each other or completely fall behind another, resulting their 2D views to fully fall inside another cell. As the number of blastomeres in an embryo is unknown, the ellipsoidal models, generated in the previous section, are grouped into sets that contain 1 to 4 blastomere candidates. The fact is that blastomeres inside an embryo spatially arrange in a way that minimizes the unused space (state of the equilibrium). Therefore, Euclidean distances between the centroids of each set and the centroid of the embryo are found. It is expected that this distance will be minimized for the set that best represent the actual locations of blastomeres. It was experimentally determined that setting a centroid distance threshold of 10 pixels removes many of the false sets that contradict the equilibrium state. Next, the best set is selected from the remaining sets by retaining the maximum overlap with the original embryo edge map. Sometimes, isoperimetric partitioning may over-segment the image due to low Potentialscore of partitions representing blastomeres. To address this issue edges enclosed by blastomere candidates are removed from the edge image. The ellipse representing missing blastomeres are captured by selecting the ellipses with more than 70% overlap with the reduced edge image. Finally, the ellipsoid candidates are combined to represent all blastomeres existed in the processed image. 3. OVERVIEW OF RESULTS The proposed algorithm is tested on a dataset of 40 HMC embryo images containing up to four blastomeres. An HMC embryo image containing three blastomeres, as shown in Fig. 3(a), is selected to demonstrate step by step results of the proposed algorithm. In this case one additional blastomere is contained within another blastomere. This blastomere in 2D space spatially falls behind the 2D plane at which the image is focused on. As mentioned earlier our method will not detect that specific blastomere. Isoperimetric partitioning segments the input image, into 8 regions using a cut value α of 0.6 (Section 2.1) as shown in Fig. 3(b). The algorithm successfully segments one blastomere while generates multiple segments within the three remaining. Fig. 3: (a) Input image. (b) Isoperimetric partitioning of the input image. Values of (c) vesselness, (d) entropy of the input image. Length, vesselness and entropy along with the area of the regions to which a partition belongs to are computed in the subsequent steps to merge superfluous partitions, as described in Section 2.2. Examples of a good and a bad partition overlapped on vesselness and entropy values of the image are shown in Figs. 3 (c) and 3(d) respectively. Fig. 4: Step by step region merging leading to the removal of three of the seven regions using potential threshold of 0.8. The regions merged in each step are represented with white border. Fig. 4 shows the results for the region merging process. In this case, the region merging algorithm has merged three of the seven regions as shown in Figs. 4(a) to 4(c). Fig. 4(d) shows the regions after the merging process is completed. Here, the algorithm failed to merge the remaining false partitions caused by the non-uniform illumination that resulted in high entropy and gradient values. The ellipsoidal shape of the blastomeres is further exploited to conform each ellipse using a pair of edges generated via Hessian edge operator, and a least-squared fitting method, as shown in Fig. 5(a). All ellipsoidal candidates generated are shown in Fig. 5(b). From all generated candidates, we retain those that have 90% or more overlap in their areas and boundaries with those of the partitions that fully or partially overlap with them. (e) Fig. 5: (a) Ellipse fitting using least-squared method using an edge pair. (b) Ellipse candidates are generated using all edge pairs. A good ellipse candidate has a large intersection with the segmented regions (c) and their boundaries (d). A bad candidate has smaller region (e) and boundary (f) overlaps. Examples of good and bad candidate ellipses are presented in Figs. 5(c) to 5(f). Figs. 5(c) and (d) show an ellipsoidal candidate with more than 90% overlap with the area and boundary values. On the contrary, the area and the boundary overlap of a bad ellipsoidal candidate is small, for the example in Figs. 5(e) and 5(f). Fig. 6 represents some sample sets before applying the equilibrium constraint. The sets with centroids that are less than 10 pixels away from the centroid of the embryo are retained, while others are removed as outliers. This further reduces the blastomeric candidates, as shown in Fig. 7(a). In this case, one blas- (f) 919

Fig. 6: Hypotheses sets with cardinality of 1 to 4. tomere is fully fallen behind another and therefore is removed, Fig. 7(b). The accuracy of the ellipse modeling on blastomeres is computed using the intersection of the obtained results with those of the manually identified ground truth as shown in Fig. 7(c). (a) (b) (c) Fig. 7: Blastomeres: (a) satisfying the equilibrium, (b) after removal of contained candidates. (c) Final results are displayed on the top of ground truth. Some typical results for our proposed algorithm are shown in Fig. 8. Fig. 9: (a) Percentage of blastomeres detected in each category. (b) Accuracy of the models fitted to the blastomeres in each category. (c) Percentage of blastomere candidates correctly segmented in all four-cell embryo images. all 4 blastomeres in most of the images but in some cases it selects three or less candidates. Due to the complexity of images with more blastomeres, the average time for segmenting such images is higher than the ones with lower number, Fig. 10(a). The average time for segmenting blastomeres as a function of number of partitioned regions is presented for each category in Fig. 10(b). (a) (b) Fig. 8: Sample results for the proposed algorithm. Each column represents input images with a certain number (1 to 4) of cells. Experimental results demonstrate that the proposed algorithm is capable of identification and modeling of blastomeres in HMC images of human embryos with an average accuracy of 80%. Currently the only reported work in this area is by Giusti et al [3] which has an accuracy of 71%. Single cells are easier to segment as compared to four cells due to the fact that there are more overlaps between the blastomeres and the existence of the cellular fragmentation seems to make the task harder in these cases. The accuracy of the detector is presented in Figs. 9(a) to 9(c). The algorithm correctly segments Fig. 10: Average running time for (a) blastomere detection for each category, (b) region merging for different number of regions. 4. CONCLUSION An algorithm was proposed for segmenting up to 4 blastomeres in a single HMC human embryo image. The algorithm performs under conditions such as cellular, fragmentation, and side-lit illumination of cells. In future, we aim to extend our work towards time-lapse imaging as time and history of the blastomeres development could significantly improve the recognition and modeling accuracy. 920

5. REFERENCES [1] M.C. Magli, L. Gianaroli, A.P. Ferraretti, M. Lappi, A. Ruberti, and V. Farfalli, Embryo morphology and development are dependent on the chromosomal complement, Fertility Sterility, vol. 87, no. 3, 2007. [2] U.D. Pedersen, O.F. Olsen, and N.H. Olsen, A multiphase variational level set approach for modelling human embryos, in Proceedings of the 2nd IEEE Workshop on variational, Geometric and Level Set Methods, 2003. [3] A. Giusti, G. Corani, L. Gambardella, C. Magli, and L. Gambardella, Blasotmere segmentation and 3d morphology measurements of early embryos from hoffman modulation contrast image stacks, in IEEE International Symposium on Biomedical Imaging, January 2010, pp. 13 17. [4] A.F. Frangi, W.J. Niessen, K.L. Vincken, and M.A. Viergever, Multiscale vessel enhancement filtering, in International Conference on Medical Image Computing and Computer Assisted Intervention, 1998, pp. 130 137. [5] L. Grady and E. Schwartz, Isoperimetric graph partitioning for image segmentation, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 3, pp. 469 475, 2006. [6] C.E. Shannon, A mathematical theory of communication, Bell System Technical Journal, vol. 27, no. 3, pp. 379 423, 1948. [7] P. Perona and J. Malik, Scale space and edge detection using anisotropic diffusion, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 629 639, 1990. [8] R. Haralick, Digital step edges from zero crossing of second directional derivatives, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 1, pp. 58 68, 1984. [9] A. Fitzgibbon, M. Pilu, and R. Fisher, Direct leastsquare fitting of ellipses, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 5, pp. 476 480, 1999. 921