Volume 10 Supplement 15

Eighth International Conference on Bioinformatics (InCoB2009): Bioinformatics

Open Access

Sub-population analysis based on temporal features of high content images

  • Merlin Veronika1, 2Email author,
  • James Evans4,
  • Paul Matsudaira1, 3,
  • Roy Welsch1, 5 and
  • Jagath Rajapakse1, 2
BMC Bioinformatics200910(Suppl 15):S4

DOI: 10.1186/1471-2105-10-S15-S4

Published: 3 December 2009



High content screening techniques are increasingly used to understand the regulation and progression of cell motility. The demand of new platforms, coupled with availability of terabytes of data has challenged the traditional technique of identifying cell populations by manual methods and resulted in development of high-dimensional analytical methods.


In this paper, we present sub-populations analysis of cells at the tissue level by using dynamic features of the cells. We used active contour without edges for segmentation of cells, which preserves the cell morphology, and autoregressive modeling to model cell trajectories. The sub-populations were obtained by clustering static, dynamic and a combination of both features. We were able to identify three unique sub-populations in combined clustering.


We report a novel method to identify sub-populations using kinetic features and demonstrate that these features improve sub-population analysis at the tissue level. These advances will facilitate the application of high content screening data analysis to new and complex biological problems.


Cell motility is an essential component of normal development, inflammation, tissue repair, angiogenesis, and tumor invasion [1]. After conception, selected cells of the developing mammalian zygote invade the uterine wall to establish the placenta, while the intricately programmed migration of other cells within the embryo shapes the complex form of the emerging organism. Fetal nervous system presents us with an example of large scale migration of immature neuroblasts from their place of origin to other locations in order to make right connections [2]. Studies about cell migration pattern have been commonly performed at the population level. Although such analysis gives a general idea of what is happening, they are void of what happens at the sub-population level [3]. A common example is cancer, where variation in cancer cells leads to therapeutic treatments that target a particular subset of the population [4, 5]. Therefore, for studies aiming at potential therapeutic treatment, it is important to focus on sub-populations that can be treated to prevent recurrence and metastasis.

Several studies have developed techniques to mine and infer biological knowledge from high-content screening (HCS) data. Perlman et al employed the Kolomogorov Smirnov statistic for high throughput cytological profiling. Their study reflected more on biological mechanism rather than chemical implications [6]. Tanaka et al used Principal Component Analysis to identify small molecule kinase inhibitors in morphological based screens and neural networks were used by Bakal et al to perform a genetic screen to identify genes controlling different aspects of cell morphology [7, 8]. Support vector machines (SVM) and factor analysis were employed to identify compound activity [9, 10]. These studies have demonstrated the need for simultaneous analysis of features, but the computational and graphical difficulties remain an unsolved challenge for data analysis [11]. The few existing analytical methods used to validate HCS data across a series of experiments require extensive operator interaction and, more importantly lack statistical rigour, resulting in underutilization of information available from the powerful HCS technology. As HCS applications become increasingly complex, so does the composition of the cell populations as well as the underlying covariance structure of the cellular data.

In order to overcome these bottlenecks, we propose to develop a sub-population analysis technique based on kinetic features. Our technique is semi-supervised and aims to find the correlation between cell motility (kinetic features) and cell morphology (static features) and infer biological mechanisms underlying cell motility of tissues under different conditions. This will facilitate studies on molecular signalling pathways involved in cell motility. In this manuscript, we illustrate our sub-population analysis by applying it to a population of IC 21 macrophage cells. Our method consists of several phases: using active contours without edges [12] for segmentation, autoregressive models [13, 14] for modeling cellular trajectories and k-means [15] clustering to classify the cells.

Results and discussion


The cells used in this experiment were mouse macrophage cell lines IC-21 (American Type Culture Collection (ATCC) TIB-186). The cell line was cultured in 85% RPMI-1640 medium, 15% FBS, and antibiotics (50 IU penicillin and 50 μ g/ml streptomycin). Cell culture and maintenance techniques were performed as described by ATCC. Cells are plated overnight to allow them to attach onto 96-well plate. The media is aspirated and incubated in 1:1000 dilution CMFDA. The media is aspirated again and new media containing 200 μ M Trolox is added. Cells were imaged over a period of 75 minutes at every 15 minute interval using Cellomics KineticScan giving a total of six snapshots. The cells do not undergo mitotic division during this time due to absence of activating factors. Four fields per well are imaged and each field contained approximately 125 cells. Each image is 8 bit grayscale (0-255) of size 1024 × 1024 pixels.

Cell segmentation

Macrophage cells are identified by level sets, preserving the topology of the cells that is vital for extracting the static parameters. The results are furnished in Fig 1. Almost all the cells were properly identified by this method. Fig 1(a) shows a snapshot of unprocessed image. Fig 1(b) shows the segmented cells (enclosed in red contour). The CPU time for this method is 17.4 mins compared to classical Otsu method which took 1 s and fuzzy c-means clustering (50 s) on a 1.86 Ghz and 1 GB RAM desktop computer [16, 17]. Segmentation is the first step in any image analysis pipeline and extraction of static features depend on how well shape features are conserved during segmentation. This method was compared with classical Otsu and fuzzy c-means, which resulted in severe loss of morphological information (Fig 2).
Figure 1

Segmentation by level set method. (a) Snapshot of the image data used for analysis (b) Initial (green) and final (red) contour representing segmented cells.

Figure 2

Comparison of level set segmentation with Otsu's and fuzzy c-means method. (a) Snapshot of unprocessed image. (b) Otsu's method. (c) Fuzzy c-means and (d) Level set segmentation.

Static features

Ensemble of basic and Zernike shape features were measured using MatLab's Image Processing toolbox (ver 6.1 R2008a). Zernike features describe more intuitive aspects of the cell and are calculated using an orthogonal basis set, the Zernike polynomials, which are defined over the unit circle. The amplitude of these complex-valued moments were used as features in subsequent analysis [18]. For the current analysis, Zernike polynomials from order 0 to 9 were calculated, giving in total 7 basic and 30 Zernike measurements. While there is no limit to the order which can be calculated, we found that this number of features was sufficient.

Kinetic features

Snapshot of tracks identified by auto-regressive models (AR) are shown in Fig 3. As we can observe, the movement of cells are anisotrophic. Features like (i) speed of cell, (ii) chemotactic index, (iii) length of the trajectory, and (iv) total displacement of the cell were measured using the method described above.
Figure 3

Tracks of cells identified by AR Model. Red spots represent initial position of the cell and dragon tail in black represent the trajectories.

Sub-population analysis

In K-means clustering, each cell is treated as an object having a location in multidimensional space. It finds a partition in which the cells in one cluster are close to each other and far off from cells belonging to other clusters. Eventually, total sum of the distances levels out even if data is partitioned into multiple clusters. The point of inflection indicates optimal cluster number.

Clustering static features showed three clusters (Fig 4) with minimum homogeneity and maximum separation, whereas clustering with dynamic features showed four clusters with maximum homogeneity and minimum separation (Fig 5). Only when dynamic features were combined with static, did we get better resolution clusters which are homogeneous and well separated as shown in Table 1. Fig 6 shows optimal cluster number for combined static and dynamic features clustering. The three clusters of cells identified from the data can be described as follows: (i) Cluster 1: Compact cells which move or slide against the 2D surface steadily. This population formed the bulk and they had fan a shaped spread suggestive of active mobility. (ii) Cluster 2: Cells with much bigger area and perimeter. The speed of migration is the maximum among the three clusters showing directional bias. (iii) Cluster 3: Bigger cells which move very slowly and do not translate much. This is evident from low path displacement measure. This cluster showed clear directional bias and pattern of movement and is quite different from the previous clusters. A wind rose plot for top 20 cells representing each cluster shows the trend in directionality and variation in total displacement. A wind rose plot for cluster 1 is shown in (Fig 7), cluster 2 (Fig 8), cluster 3 (Fig 9). The features along with the mean values for each cluster are shown in Table 2.
Table 1

Validity indices for clustering based on static, dynamic and combination





Homogeneity Index




Separation Index




Weighted inter-to-intra cluster ratio




Table 2

Features of individual clusters


Cluster 1

Cluster 2

Cluster 3

Area (μ2)








Orientation (degree)












Perimeter (μ)
































































































































Speed (μ/h)




Chemotactic Index




Path Length (μ)




Path displacement(μ)




Figure 4

Optimal clusters from static features. For static features, the point of inflection is in cluster 3.

Figure 5

Optimal clusters from dynamic features. For dynamic features, the point of inflection is in cluster 4.

Figure 6

Optimal clusters from static and dynamic features. Adding dynamic features has increased the resolution of cluster size bringing the optimal cluster size to 3.

Figure 7

Wind rose plot for cluster 1. Wind rose plot for cluster 1. The numbers in red indicate total path length in μ

Figure 8

Wind rose plot for cluster 2. Wind rose plot for cluster 2. The numbers in red indicate total path length in μ

Figure 9

Wind rose plot for cluster 3. Wind rose plot for cluster 3. The numbers in red indicate total path length in μ


We have demonstrated a novel exploratory method of identifying sub-populations by combining static and dynamic features, in particular how dynamic features improve sub-population analysis at the tissue level. This kind of analysis is important in transplantation studies because macrophages being the sentries of immune systems, accumulate at the site of transplantation and the number and type of inflammatory cells often are more related to the surgical trauma and material [19]. Static features like area, eccentricity and perimeter are indicators of the protrusive forces that steer the cell to move forward or retract and are the main indicators to study the impact of any perturbation on macrophage cells. This is further supported by kinetic features like speed, chemotactic index and path length. The changes in these features indicate the response of cells to stimulus which in turn depends on the milieu where the cell is positioned.

Since our approach is semi-supervised, no prior knowledge or little intervention is required. This study also showcases the importance of kinetic features needed to quantify sub-populations. Features such as area, eccentricity, perimeter, speed, chemotactic index, path length/displacement capture all the essential information required to characterize any group of cells. There is much to be done to understand the intricacies of the features in play during cell motility. We outlined a framework that can be easily reproduced by using common data mining techniques (k-means) to gain insight into morphological and motility features obtained from HCS image data.

Our future work will focus on bridging cell morphology with cell motility to understand the underlying biological mechanisms. Not many studies have been dedicated to understanding the spatio-temporal relation at the sub-population level especially by making use of kinetic features. Understanding how these sub-populations change with drug treatment will give insight to how any morphology is related to one another and with motility factors. In particular, this framework will help in associating cell morphology with function which might be useful in detecting aberrant cancer cells or the differentiating potential of stem cells.


Let us denote a set of coordinates of the pixel site in the image by Ω 2 and the image μ is denoted as a function f : Ω → Q, where Q is the range of all possible intensities. Intensity at each pixel x, where x Ω is given by f(x).


Segmentation of tissue images involves separating a tissue image into individual cells. It is done by identifying regions with common properties or identifying contours which delineate regions. So, a natural way to segment such regions is through thresholding the intensity. This method is optimal for thresholding large objects and those with fairly distinct classes, but does not work well with small objects with blurry edges [16]. Active Contour Models (ACM), first introduced by Kass et al, represent an intelligent way of detecting boundary edges by considering boundaries as inherently connected and smooth structures [20]. An energy term is associated with the contour and is designed to be inversely proportional to the contour's smoothness and fit to the desired image features. Certain forces can be designed (or derived from energy terms) in a way that the resulting contour deformations will reduce the contour's energy. Because of the way the contours slither while minimizing their energy, ACM are also called snakes. The contour is said to possess an energy given by the sum of the three energy terms: internal, external and constraints. The energy terms are defined in such a way that the final position of the contour will have a minimum energy and therefore the problem of detecting objects reduces to an energy minimization problem. A caveat for active contours is that cells are under segmented when the border between the clustered cells are much brighter than the border between cell and background.

Because classical snakes and active contour models rely on the edge-function, depending on the image gradient, to stop the curve evolution, these models can detect objects only with edges defined by the gradient [21]. In practice, the discrete gradients are bounded and then the stopping function is never zero on the edges, and the curve may pass through the boundary. If the image is very noisy, then the isotropic smoothing gaussian has to be strong, which will smooth the edges too. Tony and Vese proposed a different active contour model, without a stopping edge-function, i.e, a model which is not based on the gradient of the image f(x) for the stopping process [12]. The stopping term is based on Mumford-Shah segmentation techniques [22]. The energy function of the active contour based on this function is given by:

where ϕ is the level set function defined on Ω whose zero level set {(x) Ω|ϕ(x) = 0} defines the segmentation such that ϕ > 0 is inside the cell and ϕ < 0 is outside the cell. c I and c O are mean intensities of pixels inside and outside the zero level set. H and δ are the Heaviside and Dirac functions. α, λ I and λ O are fixed positive parameters.

The minimization of image energy is achieved by evolving the level set for time t, starting from an initiation ϕ (t = 0, x) according to,

where . https://static-content.springer.com/image/art%3A10.1186%2F1471-2105-10-S15-S4/MediaObjects/12859_2009_Article_3449_IEq1_HTML.gif is the mean curvature of the level set, generating a regulating force which smoothens the contours. The two forces expand or shrink the contour towards the actual boundary of the cells. We segmented the cells using the above method.

Modeling cell trajectories

Among the different models developed for describing a stochastic process, auto-regressive model (AR) is perhaps the most popular [13, 14]. The practical utility of an AR model becomes compelling when the stochastic process is non-stationary especially biological cell movement which sustains spatio-temporal patterns. An AR model computes the position of a cell o at time t based on the previous positions by,

where o(t) is the centroid of the cell at time t, β0 is a constant mostly ignored for simplicity purposes, β τ are autoregressive parameters, and ε(t) is the noise level at time t included to cover the possible cell positions.

Quantifying cell motility

Eukaryotic cell migration in isotropic environments can be described as a persistent random walk. Over short time periods, cells follow a relatively straight path, showing persistence of movement. If long time intervals are used to observe the cell position, however, cell movement appears similar to Brownian motion with frequent direction changes. If a cell is executing a random walk, its expected distance (or displacement) <d > of its centroid from its original position varies with time according to the formula.

where <d2 > denotes the mean square displacement of the cell, γ is the random motility coefficient (formally equivalent to a diffusion coefficient), and m is a constant giving the dimensionality of the random walk. According to the above formula, the average distance travelled by a cell is proportional to the square root of the elapsed time. Although they cover short distances rapidly, cells performing random walks travel long distances much more slowly.

At least two parameters are needed to describe a persistent random walk [23]. The first characteristic of cell movement is the persistence time ρ which is the measure of the average time between significant direction changes. The second motility parameter is the cell speed ν that is intuitively defined as the displacement of the cell centroid per unit time. If the speed is computed in this fashion, care must be taken to use time intervals small enough so that cells move in a constant direction. The persistence time ρ and cell speed ν can also be rigorously defined using mathematical analysis. Starting from different assumptions about the details of cell paths, [24, 25] developed the following mathematical model to describe persistent random walks:
For long times (t >>ρ), the above formula reduces to the much simpler expression:

The persistent random walk analysis is applicable only when cell movement takes place in an isotropic environment. Modifications are necessary to analyze biased cell movement (e.g., in the presence of a chemoattractant) or to check whether cell locomotion has a preferred direction. One such approach is based on the stochastic concept of Markov chains.

The method proposed by Dickinson and Tranquillo uses a generalized non-linear regression algorithm wherein the cell tracks are assumed to consist of a sequence of cell positions associated with a series of increasing time points differing by a constant time increment [26]. If o(t) represents the centroid of the cell at time t, then the squared displacement d2(τ) of the cell over time interval τ, from o(t) to o(t + τ), is:

then, d2(τ) is considered a random variable with expected value η τ ≡ <d2(τ) > = <d2(t) >, where η τ is the theoretical mean-squared displacement over τ.

To obtain the measured mean squared displacement of any cell, several squared displacements over the cell track should be averaged. Two obvious and commonly used sampling methods, overlapping and nonoverlapping can be used. The total number of samples available from a single track is maximized by averaging squared displacements from overlapping time intervals. However, it is not statistically independent. An alternate method is to average only nonoverlapping intervals. Speed and persistence were calculated by fitting mean square displacement to a persistent walk model. Since the distance travelled in the given time is known, speed was calculated directly and persistence by fitting the model.

Cell clustering

The K-means algorithm is one of the most popular iterative descent clustering methods and is used for clustering features gathered from HCS analysis [3, 27]. It is intended for situations in which all variables are of the quantitative type. Each cluster is defined by a cluster centroid which is the mean of the features of the cluster population. The optimal number of clusters from K means were determined by three different indices; weighted inter to intra cluster ratio (Wint), homogeneity index and separation index. In Wint, squared euclidean distances, normalised for distinct variances of different populations are computed for pairs of cells within and across clusters. By weighting these average distances we restrict outlier cells from influencing the number of populations. Homogeneity index reflects the compactness of the cluster and is the average distance between the cells in the cluster and its respective centroid. Separation index is a measure of between-cluster variance defined by weighted average distance between clusters. Decreasing homogeneity index and increasing separation index suggest better clusters.


Other papers from the meeting have been published as part of BMC Genomics Volume 10 Supplement 3, 2009: Eighth International Conference on Bioinformatics (InCoB2009): Computational Biology, available online at http://​www.​biomedcentral.​com/​1471-2164/​10?​issue=​S3.



We like to thank Dr. Hyung-Do Kim of Massachusetts Institute of Technology, USA, for providing Matlab scripts required for computing kinetic features. This work is supported by Computation and Systems Biology programme of the Singapore-MIT Alliance.

This article has been published as part of BMC Bioinformatics Volume 10 Supplement 15, 2009: Eighth International Conference on Bioinformatics (InCoB2009): Bioinformatics. The full contents of the supplement are available online at http://​www.​biomedcentral.​com/​1471-2105/​10?​issue=​S15.

Authors’ Affiliations

Computation and Systems Biology, Singapore-MIT Alliance, Nanyang Technological University
Bioinformatics Research Centre, Nanyang Technological University
Department of Biological Science, National University of Singapore
Whitehead Institute for Biomedical Research
Sloan School of Management, Massachusetts Institute of Technology


  1. Singer S, Kupfer A: The directed migration of eukaryotic cells. Annu Rev Cell Biol 1986, 2: 337–365. 10.1146/annurev.cb.02.110186.002005View ArticlePubMed
  2. Trinkaus T: Cells into Organs. The forces that shape the embryo. In Annual Reviews in Cell Biology. New Jersey, USA: Prentice Hall; 1984.
  3. Low J, Huang S, Blosser W, Dowless M, Burch J, Neubauer B, Louis S: High-content imaging characterization of cell cycle therapeutics through in vitro and in vivo subpopulation analysis. Molecular Cancer Therapeutics 2008, 7(8):2455–2463. 10.1158/1535-7163.MCT-08-0328View ArticlePubMed
  4. Carnero A: Targeting the cell cycle for cancer therapy. British Journal of Cancer 2002, 87: 129–133. 10.1038/sj.bjc.6600458PubMed CentralView ArticlePubMed
  5. Stewart ZA, Westfall MD, Pietenpol JA: Cell-cycle dysregulation and anticancer therapy. Trends Pharmocol Sci 2003, 24: 139–145. 10.1016/S0165-6147(03)00026-9View Article
  6. Perlman E, Slack D, Feng Y, Mitchison J, Wu F, Altschuler J: Multidimensional drug profiling by automated microscopy. Science 2004, 306: 1194–1198. 10.1126/science.1100709View ArticlePubMed
  7. Tanaka M, Bateman R, Rauh D, Vaisberg E, Ramachandani S, Zhang C, Hansen K, Burlingame A, Trautman J, Shokat M, Adams L: An unbiased cell morphology-based screen for new, biologically active small molecules. PLoS Biol 2005, 3(5):e128. 10.1371/journal.pbio.0030128PubMed CentralView ArticlePubMed
  8. Bakal C, Aach J, Church G, Perrimon N: Quantitative morphological signatures define local signalling networks regulating cell morphology. Science 2007, 316: 1753–1756. 10.1126/science.1140324View ArticlePubMed
  9. Loo LH, Wu F, Altschuler J: Image-based multivariate profiling of drug responses from single cells. Nature Methods 2007, 4(5):445–453.PubMed
  10. Young W, Bender A, Hoyt J, McWhinnie E, Chirn GW, Tao Y, Tallarico A, Labow M, Jenkins L, JTimothy M, Feng Y: Integrating high-content screening and ligand-target prediction to identify mechanism of action. Nature Chemical Biology 2008, 4: 59–68. 10.1038/nchembio.2007.53View ArticlePubMed
  11. Jones R, Carpenter EA, Lamprecht RM, Moffat J, Silver S, Grenier KJ, Castoreno BA, Eggert SU, David RE, Golland P, Sabatini D: Scoring diverse cellular morphologies in image-based screens with iterative feedback and machine learning. PNAS 2009, 106(6):1826–1831. 10.1073/pnas.0808843106PubMed CentralView ArticlePubMed
  12. Chan T, Vese L: Active contours without edges. IEEE Transactions on Image Processing 2001, 10(2):266–277. 10.1109/83.902291View ArticlePubMed
  13. Cazares S, Moulden M, Redman W, Tarassenko L: Tracking poles with an autoregressive model: A confidence index for the analysis of the intrapartum cardioectogram. Medical Engineering and Physics 2001, 23: 603–614. 10.1016/S1350-4533(01)00092-3View ArticlePubMed
  14. Elnagar A, Gupta K: Motion prediction of moving objects based on Autoregressive model. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans 1998, 28(6):803–810. 10.1109/3468.725351View Article
  15. Hastie T, Tibshirani R, Friedman J: The elements of statistical learning: data mining, inference and prediction. New Jersey, USA: Springer series in Statistics; 2001.View Article
  16. Otsu N: A threshold selection method from gray-level histograms. IEEE Transactions on Systems, Man, and Cybernetics 1979, 9: 62–66. 10.1109/TSMC.1979.4310076View Article
  17. Sahaphong S, Hiransakolwong N: Unsupervised Image Segmentation Using Automated Fuzzy c-Means. In CIT '07: Proceedings of the 7th IEEE International Conference on Computer and Information Technology. Washington, DC, USA: IEEE Computer Society; 2007:690–694. full_text
  18. Boland MV, Markey M, Murphy RF: Automated recognition of patterns characteristic of subcellular structures in fluorescence microscopy images. Cytometry 1998, 33: 366–375. 10.1002/(SICI)1097-0320(19981101)33:3<366::AID-CYTO12>3.0.CO;2-RView ArticlePubMed
  19. Rhodes N, Hunt J, Williams D: Macrophage subpopulation differentiation by simulation with biomaterials. Biomedical Materials Research Part A 1998, 37(4):481–488. 10.1002/(SICI)1097-4636(19971215)37:4<481::AID-JBM6>3.0.CO;2-HView Article
  20. Kass M, Witkin A, Terzopoulos D: Snakes:Active contour models. International Journal of Computer Vision 1997, 1(4):321–331. 10.1007/BF00133570View Article
  21. Cheng J, Rajapakse J: Segmentation of clustered nuclei with shape markers and marking function. IEEE Transactions on Biomedical Engineering 2009, 56(3):741–748. 10.1109/TBME.2008.2008635View ArticlePubMed
  22. Mumford D, Shah J: Optimal approximation by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics 1989, 42: 577–685. 10.1002/cpa.3160420503View Article
  23. Zygourakis K: Quantification and regulation of cell migration. Tissue Engineering 1996, 2: 1–16. 10.1089/ten.1996.2.1View ArticlePubMed
  24. Dunn G: Characterizing a kinesis response: time averaged measures of cell speed and directional persistence. Agents Actions[Suppl] 1994, 12(7):14.
  25. Othmer H, Dunbar S: Models of dispersal in biological systems. Journal of Mathematical Biology 1988, 26(3):263–298. 10.1007/BF00277392View ArticlePubMed
  26. Dickinson B, Tranquillo T: Optimal estimation of cell movement indices from statistical analysis of cell tracking data. Bioengineering, Food and Natural Products AIChE Journal 1993, 39(12):1995–2010.
  27. Peng H: Bioimage Informatics: A new Area of engineering biology. Bioinformatics 2008, 24(17):1827–1836. 10.1093/bioinformatics/btn346PubMed CentralView ArticlePubMed


© Veronika et al; licensee BioMed Central Ltd. 2009

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://​creativecommons.​org/​licenses/​by/​2.​0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.