Image Processing Techniques for Assessing Contractility in Isolated Adult Cardiac Myocytes

Bazan, Carlos; Barba, David Torres; Blomgren, Peter; Paolini, Paul

doi:https://doi.org/10.1155/2009/352954

International Journal of Biomedical Imaging

On this page

Abstract Introduction Background Materials and Methods Experimental Results Discussion Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2009 | Article ID 352954 | https://doi.org/10.1155/2009/352954

Image Processing Techniques for Assessing Contractility in Isolated Adult Cardiac Myocytes

Carlos Bazan,¹David Torres Barba,¹Peter Blomgren,²and Paul Paolini³

Academic Editor: Jun Zhao

Received24 Aug 2009

Accepted21 Nov 2009

Published24 Feb 2010

Abstract

We describe a computational framework for the comprehensive assessment of contractile responses of enzymatically dissociated adult cardiac myocytes. The proposed methodology comprises the following stages: digital video recording of the contracting cell, edge preserving total variation-based image smoothing, segmentation of the smoothed images, contour extraction from the segmented images, shape representation by Fourier descriptors, and contractility assessment. The different stages are variants of mathematically sound and computationally robust algorithms very well established in the image processing community. The physiologic application of the methodology is evaluated by assessing overall contraction in enzymatically dissociated adult rat cardiocytes. Our results demonstrate the effectiveness of the proposed approach in characterizing the true, two-dimensional, “shortening” in the contraction process of adult cardiocytes. We compare the performance of the proposed method to that of a popular edge detection system in the literature. The proposed method not only provides a more comprehensive assessment of the myocyte contraction process but also can potentially eliminate historical concerns and sources of errors caused by myocyte rotation or translation during contraction. Furthermore, the versatility of the image processing techniques makes the method suitable for determining myocyte shortening in cells that usually bend or move during contraction. The proposed method can be utilized to evaluate changes in contractile behavior resulting from drug intervention, disease modeling, transgeneity, or other common applications to mammalian cardiocytes.

1. Introduction

Worldwide, it is estimated that 17.5 million people die of cardiovascular disease (CVD) every year, with an approximate cost of €310.23 billion (World Heart Federation. Available at http://www.worldheart.org. Accessed 20090514). Because CVD remains the main cause of death in the world, considerable amounts of resources are devoted to cardiovascular research every year.

The study of cardiocyte contractility has helped unveil the fundamental processes underlying heart function in health and disease [1, 2]. The analysis of cardiocyte mechanics has historically proven an excellent tool in providing relevant information on the excitation-contraction coupling of the heart. Many inotropic factors modulate the contractile behavior of the heart, which can be conveniently studied in enzymatically dissociated (isolated) cardiocytes [2–5]. Researchers commonly measure calcium transient signals, gene and protein expression, and contractility to assess the function and state of these isolated cardiocytes in all their stages [1, 6].

Isolated adult, neonatal, and embryonic cardiocytes from mammalian hearts are widely used in cardiovascular research [2–5]. Adult cardiac ventricular myocytes have been used as analysis tool in cardiovascular research for almost thirty years, and the popularity of this approach is constantly reinforced by the numerous studies published every year [3]. However, during the last decade, the majority of researchers performing long-term (longer than 1 week) studies have favored the use of embryonic and neonatal cardiocytes [5]. Yet, changes in expression of ion channels and contractile protein isoforms during the development of the cardiocytes, pose a problem when making the extrapolation to the fully developed adult cardiocyte. These are strong reasons for researchers to consider using adult cardiocytes when possible [5].

There are several methodologies for assessing the contractility of cardiocytes. The most popular methods include the ones that use laser diffraction techniques [7] and photodiode arrays [8], and those that employ the monitoring of microscopic cell images [9–11]. Among the latter of these is the edge detection method that employs a raster-line to detect changes in myocyte length by sensing left and right cell boundaries using a threshold [10]. This edge detection method is a widespread approach in research involving adult cardiocytes [4, 10, 12, 13]. This method presents some practical difficulties in its implementation. Geometrical and boundary characteristics of adult cardiocytes are the most commonly irregular due to gap junction ends (jagged edge ends), multiple intercalated disks, and variable cell widths, which can potentially complicate the application of the edge detection system on the cardiocyte [4]. Cardiocyte motion can also occur in unexpected directions since cardiocytes will commonly rotate or move vertically—perpendicular to the raster line—depending upon the location or absence of adhesion points [4]. These conditions can lead to complications in the implementation of the edge detection system, and consequently, can result in an inaccurate analysis [4, 12, 13].

2. Background and Previous Work

The cardiac myocyte is approximately 25 m in diameter and about 100 m in length. It is composed of bundles of myofibrils that contain myofilaments. Myofibrils have distinct, repeating microanatomical units, termed sarcomeres, which are the basic contractile units that make up a myocyte. The region of myofilament structures between two Z-lines is defined as a sarcomere. The Z-line's associated structures are responsible for the lateral alignment of myofibrils and the generation of active contraction in cardiac muscles [14]. The distance between Z-lines—which is equivalent to the sarcomere length—ranges from about 1.6 to 2.2 m in human hearts. The sarcomere is composed of thick and thin filaments, myosin and actin, respectively. Chemical and physical interactions between the actin and myosin cause the sarcomere length to shorten, allowing the myocyte to contract during the process of excitation-contraction coupling [15].

Contractility can be defined as the intrinsic ability of the heart muscle to generate force and to shorten. At the molecular level, the contractile process originates from the change in concentrations of calcium () ions in the myocardial cytosol. ions enter through the calcium channel that opens in response to the wave of depolarization that travels along the sarcolemma. These ions trigger the release of additional calcium from the sarcoplasmic reticulum, thereby initiating a contraction-relaxation cycle [16].

The need for an accurate method to assess different aspects of a myocyte has led researchers to explore several techniques in order to quantify contractility. Some of these methods are not very popular due to the expensive equipment required, as in the case of the scanning ion conductance microscopy method [6]. This method involves using a distance modulated approach for scanning ion conductance microscopy. It provides a distance control mechanism to image surface sections of contracting myocytes. This technique, combined with laser confocal microscopy, measures myocyte height and local calcium concentration during contractility.

Other methods—such as light diffraction techniques—have been applied to the study of muscle mechanics since the nineteenth century [17]. The reliability of these studies is relatively high, although they are highly dependent upon different factors. These include the temporal resolution of the detection system, sarcomere periodicity values, and other optical artifacts [4]. The sarcomere striation pattern detection method has also been used as a way to quantify contractility. The method can achieve high temporal resolution with the aid of CCD line array detectors and it provides a measure of average sarcomere periodicity from the entire cell or cell regions [18]. One drawback is this method's vulnerability to errors introduced by cell geometry and rotational and translational changes which can occur during contraction [4].

One of the first video-based efforts to measure contraction was performed with the assistance of a device capable of capturing the extent and rate of length shortening of isolated cardiac myocytes [10]. The video-based method uses two tracking points at each end of the myocyte to track edge displacement as the myocyte contracts. The distance between the two edges is measured using edge detection while a record of the data is stored in a separate file. The method generally produces satisfactory results and has been an approved and widely used method for measuring contractile responses of adult myocytes for over twenty years [4, 12].

Several problems have been identified with the application of the video-based edge detection method for measuring adult myocyte contractility [4]. The method can potentially introduce errors to the analysis caused by several factors. The first inconvenience when analyzing myocyte contractility with this method is the need to have the cell positioned parallel to the raster-line. The myocyte should be perfectly positioned in the center of the screen (parallel to the raster-line), and the proper threshold conditions must be set to detect the edges and follow them through a contraction. These threshold conditions are somewhat difficult to set depending upon the characteristics of the cell. The most important source of error that can be potentially introduced during the application of this method is the result of unexpected myocyte movements. Myocytes will often rotate sideways or out of the plane of focus depending upon the presence or absence of adhesion points. The changes in myocyte geometry, dynamic torquing, and rotation can lead to errors in the experiment [2, 4, 12].

We propose a complete computational framework-based on well-established image processing techniques for the assessment of contractility of isolated cardiac myocytes. The proposed methodology is a multi-step process that provides a comprehensive account of the cardiac myocyte contraction process. The proposed method is discussed in the next section.

3. Materials and Methods

The proposed computational framework for assessing the contractility in cardiac myocytes comprises the following stages: digital video recording of the contracting cell, edge preserving total variation-based image smoothing, segmentation of the smoothed images, contour extraction from the segmented images, shape representation by Fourier descriptors, and contractility assessment.

Previous to the application of the proposed methodology, the specimen is appropriately prepared as follows. Sprage-Dawley rats purchased from Harlan (CA, USA) were used for this study. The cardiocytes were enzymatically dissociated as described in [19]. After the isolation, the cells remained in the incuvator at least 12 hours in serum-free Medium 199 (GIBCO 12350, Invitrogen Corporation, Carlsbad, CA, USA) before any measurements were performed. Once ready for measurements, the cells were washed twice using serum-free media. Fresh media was then gently added back to the wells. Cardiocytes were platted without Laminin to ensure that the cells were free floating (without adhesion points) in the wells during the digital video recording.

3.1. Digital Video Recording

To capture the contraction process of the isolated cardiac myocytes the following procedure was employed. Cells were placed in a chamber mounted on the stage of an inverted microscope (NIKON ELWD, Nikon Corporation, Tokyo, Japan). Myocytes with obvious sarcolemmal blebs or spontaneous contractions were not used. Only rod-shaped myocytes with clear edges were selected for recording of mechanical properties. The cells were field stimulated with a suprathreshold (50%) voltage at a frequency of 0.33 Hz, for a 3 millisecond duration. The stimulation was performed using a pair of platinum wires placed on opposite sides of the chamber connected to an electrical stimulator (Grass SD9, Grass Technologies, West Warwick, RI, USA). The polarity of the stimulatory electrodes was reversed automatically every 10 stimuli to prevent electrode polarization. Myocyte motion was digitally recorded with a camera (PULNIX TM-1327, JAI PULNiX Inc., San Jose, CA, USA) mounted on the microscope, at a rate of 30 fps. Video files containing the contraction activities were stored for the analysis.

3.2. Edge Preserving Total Variation-Based Image Smoothing

We chose a total variation-(TV-)-based method for smoothing isotropic regions while preserving the cell's edges in order to facilitate the segmentation step of the computational framework. Rudin et al. [20] have argued that there are a number of reasons for preferring TV-based image smoothing models over their counterparts. TV-based algorithms are relatively simple to implement and result in minimal ringing (nonoscillatory) while recovering sharp edges (noninvasive). In other words, the TV-norm allows piecewise smooth functions with jumps and is the proper space for the analysis and recovery of discontinuous functions. Also, the TV-based formulations make a priori assumptions about the noise, and therefore they can be tailored to address the specific image restoration problem at hand. Furthermore, empirical evidence suggests that “the human vision favors the -norm” [21]. In summary, the TV-based formulations seem to be a suitable approach for restoring piecewise continuous functions from noisy and blurry signals. Appendix A provides a more detailed exposition of the original TV-based formulation due to Rudin et al. [22] along with some of the improvements proposed over the years, including the ones by two of the authors of this paper [23–25].

The edge preserving TV-based image smoothing model used in our experiments is given by

where and are the filtered and the observed images, respectively. The dynamic parameter is defined as

with the approximation to the variance of the noise given by

and the dynamic time step expressed as

with . For more details on this model the reader is referred to [23]. The algorithm to implement the edge preserving total variation-based image smoothing model is given in Appendix B. Figure 1 shows an example of the application of the edge preserving TV-based image smoothing model to a frame depicting an adult myocyte.

(a)

(b)

3.3. Segmentation of the Smoothed Images

Segmentation of an image produces a set of labeled partitions or segments that represent the different components or features. This simplified image allows for an easier extraction of the main contours of the image. In our application this facilitates the identification of the contours of the cell that will permit the assessment of contractility of the cardiac myocyte. Most segmentation algorithms can be used for this purpose. In our application, the speed of execution becomes the principal constraint—because the segmentation of several hundreds of images is required. Thus, we implemented a fast and robust segmentation technique-based on the one presented in [26]. Figure 2-Top shows the segmented image of the cell after applying the segmentation procedure.

(a)

(b)

3.4. Contour Extraction from the Segmented Images

For the contour extraction step of the framework we employ the built-in MATLAB (The MathWorks, Inc., Natick, MA, USA) function that creates a contour plot of image data. We convolve the extracted contour with a Gaussian kernel to eliminate the typical noise produced in the segmentation procedure. We also resample the contour points in all the frames so that they will have the same number of contour points and for this to be equal to . This facilitates the implementation of the discrete Fourier transform algorithm of the next section.

3.5. Shape Representation by Fourier Descriptors

Fourier descriptors have been extensively proposed for the purpose of shape recognition, retrieval, classification, and analysis [27–35]. Among the contour-based shape representation methods the ones that have proven more promising for our application are the complex coordinates function and the centroid distance function. In both methods, the Fourier transformed coefficients form the Fourier descriptors of the shape. These Fourier descriptors represent the shape of the object in the frequency domain. The number of Fourier coefficients generated from the Fourier transform is normally large. Nonetheless, the lower frequency Fourier descriptors are the ones that contain the main information about the overall features of the shape. The higher frequency Fourier descriptors, in turn, contain information relative to the finer details of the shape. Therefore, only a relative small number of Fourier descriptors are usually employed to capture the overall features of the shape [36]. For completeness, we present both methods in the following subsections.

3.6. Complex Coordinates Function Method

Let , for , be a discrete function representing the coordinates of a (closed) contour of an image's shape in the Cartesian space, such as the one in Figure 2(b). In the complex plane, we can define this contour as a complex coordinates function , such that

Then, the Fourier descriptors for the contour of the shape—described by —can be computed using the discrete Fourier transform (DFT) [37]. These Fourier descriptors are the normalized Fourier coefficients

which represent the discrete contour of the shape in the frequency domain [38, 39].

In order to use the Fourier descriptors as abstract representation of image features in each frame, it is customary to make them invariant to translation, scale, rotation, and their starting point. (In some cases, retaining the step information can be advantageous [38].) For our particular application, we want the Fourier descriptors to change covariantly with the shape of the cell. In other words, we want the Fourier coefficients to capture the contractions of the cell, disregarding only the translation and rotation of the cell. (We also want to make the Fourier descriptors independent of their starting point.)

Translation of the contour function by results in a change only to the first Fourier descriptor, . Therefore, by setting , we move the centroid of the contour onto , and make the Fourier descriptors invariant to translations. Invariance with respect to the starting point can be achieved by subtracting the step of the second Fourier descriptor, , weighted by , from the step of all the Fourier descriptors, . Rotation of the contour function by an angle corresponds to a constant step shift of in the Fourier descriptors. We can make the Fourier descriptors rotation invariant by computing the magnitude of the Fourier descriptors, . The performance of this method is almost identical that of the centroid distance function method explained in the next subsection.

3.7. Centroid Distance Function Method

A shape signature—a one-dimensional function derived from the shape boundary coordinates , for —can be used to generate Fourier descriptors of the shape [39]. Fourier descriptors derived from centroid distance function generally outperform other shape signatures [36, 40]. The centroid distance function of a shape is expressed by the distance of the points on the shape's boundary from the centroid of the shape

where

Figure 3 shows the centroid distance function of the cell shape used in the description of these methods. Since function (7) is real-valued, there are only distinct frequencies in the Fourier transform. Thus, only half of the Fourier descriptors will be necessary to describe the shape. Also, by construction, the shape signature is invariant to translation. Therefore, we only need to make the Fourier descriptors invariant to rotation and the starting point by identical procedures as in the case of the complex coordinates function method. Figure 4 shows two identical cell shapes, one of which has been translated and rotated with respect to the other. Along with the two shapes, Figure 4 shows both of their first 30 Fourier descriptors superimposed. We observe that both sets of Fourier descriptors match almost perfectly for the case of translation, rotation, and starting point invariance. Figure 5 shows two cell shapes of which one is slightly smaller and has been translated and rotated with respect to the other. Along with the two shapes, Figure 5 shows both of their first 30 Fourier descriptors superimposed. We observe that their Fourier descriptors are able to capture this change in shape size by making the Fourier descriptors variant to scale but invariant to translation, rotation, and starting point.

(a)

(b)

(a)

(b)

4. Experimental Results

We tested the proposed approach by assessing the contractile responses in isolated adult rat cardiocytes, and compared them against the classic raster-line approach [9–11]. We used a sequence of digitized images obtained as previously described for both the proposed method and the raster-line technique. Our results show good qualitative agreement between both methods as far as frequency, pacing, and overall behavior of the contractions are concerned (see Figure 6). Nonetheless, the raster-line method—being a one-dimensional technique—is unable to capture the contraction processes occurring outside its domain of influence. The proposed method, on the other hand, captures the contraction of the cell as a two dimensional event over the entire boundary of the cell. The proposed methodology was also able to capture a slower recovery period than the raster-line method (see Figure 7), which can be attributed to the dimensionality characteristics of both methods. This means that the proposed method is capable of not only assessing the myocyte's length, but also its overall changes in shape and geometry. In other words, it is capable of assessing the myocyte's dimensional changes during contraction while remaining invariant to rotation, translation and starting point.

(a)

(b)

Figure 7

Average of four contractions shown in Figure 6 for both the video-based edge detection system (dashed) and our proposed image analysis-based contractility measuring method (solid). The contractile responses were normalized to fit a desired range. Both records exhibit similar behaviors during the precontraction period, and the contraction to relaxation period, whereas the records show a noticeable difference in the late relaxation period that can be attributed to the two dimensional properties of the proposed image analysis-based contractility measuring method.

5. Discussion

We presented a complete computational framework for the comprehensive assessment of contractile responses of isolated adult cardiac myocytes. The proposed methodology comprises the following stages: digital video recording of the contracting cell, edge preserving total variation-based image smoothing, segmentation of the smoothed images, contour extraction from the segmented images, shape representation by Fourier descriptors, and contractility measurements. These stages are-based on mathematically sound and computational robust algorithms that are very well established in the image processing community. This makes the methodology easy to understand and implement.

Our results show that this approach—being a two-dimensional technique—is capable of capturing the contractile processes that are otherwise missed by the one-dimensional techniques. This capability makes the method suitable for determining myocyte contraction in cells that usually bend or move during contraction, for example, atrial myocytes and isolated smooth muscle cells, or in cardiac myocytes which develop spatially nonuniform oscillatory contractile activity induced by intracellular calcium fluctuations [10, 41].

Our future work entails the application of the proposed method to analyzing the contractility of myocytes that have been exposed to a drug over a given period of time. We have been investigating one category of the mechanisms that may be responsible for the observed effects on heart cells from a synthetic antidiabetic drug, rosiglitazone (AVANDIA, GlaxoSmithKline, Brentford, UK) of the thiazolidinedione (TZD) family of insulin-sensitizing compounds used in the treatment of type II diabetes. We are anticipating that the proposed method will be an essential tool in that it will complement the analysis of our drug studies, which have been also performed using microarray, transient, gene and protein expression measurements. Furthermore, we are in the process of deploying a more sophisticated image acquisition technology that includes a high-speed camera. This will allow for a more in-depth analysis of the contraction process undergone by the cardiac myocyte.

Appendices

A. Total Variation-Based Models in Image Processing

Rudin et al. [22] proposed removing noise from images by minimizing the TV norm of the estimated solution. They derived a constrained minimization algorithm as a time-dependent nonlinear PDE, where the constraints are determined by the noise statistics. They stated that the space of bounded (total) variation (BV) is the proper class for many basic image processing tasks. Thus, given a noisy image , where the true image has been perturbed by additive white noise , the restored image is the solution of

subject to the following constraints involving the noise: where represents the area of the image. The first constraint uses a priori information that the standard deviation of the noise is , while the second constraint assumes that the noise has zero mean. (It can also be shown that (A.1) and (A.2) imply that the noise is normally distributed [42].) The TV-norm does not penalize discontinuities in , and; therefore, it allows the recovery of the edges in the observed image .

To solve this minimization problem we would usually solve its associated Euler-Lagrange equation, namely, on a closed domain , and subject to homogeneous Neumann boundary conditions on the boundary . The solution procedure proposed in [22] employs a parabolic equation with time as an evolution (scale) parameter, or equivalently, the gradient descent method, that is, for , on a closed domain , with the observed image as initial condition, , and homogeneous Neumann boundary conditions, , on the boundary . For the parameter , they suggested a dynamic value estimated by Rosen's gradient-projection method, which as converges to Existence and uniqueness results for this nonlinear PDE have been obtained by Lions et al. [43]. Other successful implementations of this minimization problem include the second order cone programming [44], convex programming [45], duality [46], and a fast and exact minimization method-based on graph cuts [47, 48].

Nonetheless, the Rudin-Osher-Fatemi model, in its original form, presents several practical challenges [49]. This evolution scheme is not trivial to implement since it is highly nonlinear and not well-posed [50]. When the scheme converges it does so at a linear rate. It can also run into trouble when beyond machine accuracy. In practice, it is very common to use a slightly modified version of the TV-norm [49]: where is a small positive number which “smoothes out the corner” at . The two other practical (observable) limitations presented by the Rudin-Osher-Fatemi original model are the loss of contrast [51, 52] and the “staircase” effect, that is, a strong preference for piecewise constant patches [53, 54]. The Rudin-Osher-Fatemi model has been extensively studied and improved upon by many scientists [20, 49–52, 54–65].

Marquina and Osher [54] proposed a different version of the transient parabolic equation that helps speed up the convergence of the time-marching scheme. The new evolution equation is for , on a closed domain , with the observed image as initial condition, , and homogeneous Neumann boundary conditions, , on the boundary , and where is a blurring operator (Gaussian kernel). This approach fixes the staircase problem of the original scheme and is used for the removal of both blur and noise.

Bazán and Blomgren [24] implemented a variation of the Blomgren et al. [55] version of the Rudin [22] Euler-Lagrange equation as modified by Marquina and Osher [54]. They referred to this approach as Parameter-Free Adaptive Total Variation-Based Noise Removal and Edge Strengthening Model. For our current application, we will use this method for estimating the unknown noise level and their pixel-wise definition for the parameter . Given the assumption that the image has been perturbed by additive white noise, , and that this noise is independent from the signal, the variance of the noisy image must be equal to the sum of the variance of the true image and the variance of the noise, that is, . Here, the variance of the (unknown) true image is approximated by the variance of the convolved noisy image with a Gaussian kernel of width . This parameter will be updated at every iteration which provides a positive effect. For the parameter they proposed a variation of the method suggested in [22]. Instead of integrating (or summing) over the domain , they assumed a pixel-wise parameter as For a detailed explanation of the attributes of the dynamic parameter , the reader can consult [23].

Due to the high nonlinearity of the TV-based models, to ensure stability, the required time step is very small. Song [50] has shown that the CFL condition for the Rudin-Osher-Fatemi model is , with . He has also shown that the CFL condition for the Marquina-Osher model is , with . As a rule of thumb, Gilboa [66] has suggested (assuming ) setting the value of , where is the regularization constant used in (A.6). Weickert et al. [67] have shown that for explicit discretization schemes, the stability condition for the Perona-Malik-type models (assuming and ) is , with being the number of dimensions of the data. In his dissertation, Bazán [23] argued that since the explicit discretization schemes used in the TV-based models produce updates of the following form: then, in practice, the smaller the time-step, the slower the restoration process. He used the aforementioned findings to devise an “adaptive time-step” , which does not only make the TV-based schemes more stable (smooth), but also speeds up the restoration process. The proposed adaptive time-step is where, as before, is the regularization constant used in (A.6), and is the number of dimensions of the data. For a detailed description of the characteristics of the adaptive time-step the reader is referred to [23].

B. Numerical Implementation of the Edge Preserving Total Variation-Based Image Smoothing

The algorithm to implement the parameter-free adaptive TV-based noise removal and edge strengthening model is in Table 1.

Acknowledgments

The authors thank Xian Zhang and Kirubel Gebresenbet for the help in the preparation of biological procedures. This work has been supported in part by NIH Roadmap Initiative Award R90 DK07015 and NIH NIDDK.

References

V. A. Maltsev, H. N. Sabbah, M. Tanimura, M. Lesch, S. Goldstein, and A. I. Undrovinas, “Relationship between action potential, contraction-relaxation pattern, and intracellular Ca2+ transient in cardiomyocytes of dogs with chronic heart failure,” Cellular and Molecular Life Sciences, vol. 54, no. 6, pp. 597–605, 1998.
View at: Publisher Site | Google Scholar
J. Ren and L. E. Wold, “Measurement of cardiac mechanical function in isolated ventricular myocytes from rats and mice by computerized video-based imaging,” Biological Procedures Online, vol. 3, no. 1, pp. 43–53, 2001.
View at: Google Scholar
T. Banyasz, I. Lozinskiy, C. E. Payne et al., “Transformation of adult rat cardiac myocytes in primary culture,” Experimental Physiology, vol. 93, no. 3, pp. 370–382, 2008.
View at: Publisher Site | Google Scholar
L. M. D. Delbridge and K. P. Roos, “Optical methods to evaluate the contractile function of unloaded isolated cardiac myocytes,” Journal of Molecular and Cellular Cardiology, vol. 29, no. 1, pp. 11–25, 1997.
View at: Publisher Site | Google Scholar
J. S. Mitcheson, J. C. Hancox, and A. J. Levi, “Cultured adult cardiac myocytes: future applications, culture methods, morphological and electrophysiological properties,” Cardiovascular Research, vol. 39, no. 2, pp. 280–300, 1998.
View at: Publisher Site | Google Scholar
A. I. Shevchuk, J. Gorelik, S. E. Harding, M. J. Lab, D. Klenerman, and Y. E. Korchev, “Simultaneous measurement of ${Ca}^{2 +}$ and cellular dynamics: combined scanning ion conductance and optical microscopy to study contracting cardiac myocytes,” Biophysical Journal, vol. 81, no. 3, pp. 1759–1764, 2001.
View at: Google Scholar
Y. Lecarpentier, J.-L. Martin, and V. Claes, “Real-time kinetics of sarcomere relaxation by laser diffraction,” Circulation Research, vol. 56, no. 3, pp. 331–339, 1985.
View at: Google Scholar
C. M. Philips, V. Duthinh, and S. R. Houser, “A simple technique to measure the rate and magnitude of shortening of single isolated cardiac myocytes,” IEEE Transactions on Biomedical Engineering, vol. 33, no. 10, pp. 929–934, 1986.
View at: Google Scholar
P. J. Harris, D. Stewart, M. C. Cullinan, L. M. Delbridge, L. Dally, and P. Grinwald, “Rapid measurement of isolated cardiac muscle cell length using a line-scan camera,” IEEE Transactions on Biomedical Engineering, vol. 34, no. 6, pp. 463–467, 1987.
View at: Google Scholar
B. W. Steadman, K. B. Moore, K. W. Spitzer, and J. H. B. Bridge, “A video system for measuring motion in contracting heart cells,” IEEE Transactions on Biomedical Engineering, vol. 35, no. 4, pp. 264–272, 1988.
View at: Publisher Site | Google Scholar
T. Tameyasu, T. Toyoki, and H. Sugi, “Nonsteady motion in unloaded contractions of single frog cardiac cells,” Biophysical Journal, vol. 48, no. 3, pp. 461–465, 1985.
View at: Google Scholar
R. Mukherjee, F. A. Crawford, K. W. Hewett, and F. G. Spinale, “Cell and sarcomere contractile performance from the same cardiocyte using video microscopy,” Journal of Applied Physiology, vol. 74, no. 4, pp. 2023–2033, 1993.
View at: Google Scholar
R. Mukherjee, F. Spinale, and F. Crawford, “Measurement of dynamic cellular and sarcomere contractile properties from the same cardiocyte,” in Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, vol. 2, pp. 392–393, November 1992.
View at: Google Scholar
B. Kovačič-Milivojević, C. C. Damsky, D. G. Gardner, and D. Ilič, “Requirements for the localization of p130 cas to z-lines in cardiac myocytes,” Cellular and Molecular Biology Letters, vol. 7, no. 2, pp. 323–329, 2002.
View at: Google Scholar
R. E. Klabunde, Cardiovascular Physiology Concepts, Lippincott Williams & Wilkins, Philadelphia, Pa, USA, 2005.
A. Katz, Physiology of the Heart, Lippincott Williams & Wilkins, Philadelphia, Pa, USA, 4th edition, 2006.
K. P. Roos and A. F. Leung, “Theoretical Fraunhofer light diffraction patterns calculated from three-dimensional sarcomere arrays imaged from isolated cardiac cells at rest,” Biophysical Journal, vol. 52, no. 2, pp. 329–341, 1987.
View at: Google Scholar
J. W. Krueger, A. Denton, and G. Siciliano, “Nature of motions between sarcomeres in asynchronously contracting cardiac muscle cells,” Biophysical Journal, vol. 61, no. 1, pp. 145–160, 1992.
View at: Google Scholar
H. E. Reuben, M. V. Godinez, P. J. Paolini, and E. Bejar, “Analysis of contractile dynamics of adult cardiac myocytes using a computer-controlled video edge detector: effects of 5-hydroxytryptamine,” Cardiovascular Pathobiology, vol. 2, no. 3-4, pp. 149–158, 1997.
View at: Google Scholar
L. Rudin, P.-L. Lions, and S. Osher, “Multiplicative denoising and deblurring: theory and algorithms,” in Geometric Level Set Methods in Imaging, Vision, and Graphics, Springer, New York, NY, USA, 2003.
View at: Google Scholar
R. A. DeVore, B. Jawerth, and B. J. Lucier, “Image compression through wavelet transform coding,” IEEE Transactions on Information Theory, vol. 38, no. 2, part 2, pp. 719–746, 1992.
View at: Publisher Site | Google Scholar
L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,” Physica D, vol. 60, no. 1–4, pp. 259–268, 1992.
View at: Google Scholar
C. Bazán, PDE-based image and structure enhancement for electron tomography of mitochondria, Ph.D. thesis, San Diego State University & Claremont Graduate University, San Diego, Calif, USA, 2008.
C. Bazán and B. Blomgren, “Parameter-free adaptive total variation-based noise removal and edge strengthening for mitochondrial structure extraction,” Research Report CSRCR 2007-16, San Diego State University, San Diego, Calif, USA, 2007.
View at: Google Scholar
D. M. Strong, P. Blomgren, and T. F. Chan, “Spatially adaptive local-feature-driven total variation minimizing image restoration,” in Statistical and Stochastic Methods in Image Processing II, vol. 3167 of Proceedings of SPIE, pp. 222–233, San Diego, Calif, USA, July 1997.
View at: Publisher Site | Google Scholar
MathWorks, “Detecting a Cell Using Image Segmentation. Image Processing Toolbox 6.3,” 2008.
View at: Google Scholar
G. Granlund, “Fourier preprocessing for hand print character recognition,” IEEE Transactions on Computers, vol. 21, no. 2, pp. 195–201, 1972.
View at: Google Scholar
C.-L. Huang and D.-H. Huang, “A content-based image retrieval system,” Image and Vision Computing, vol. 16, no. 3, pp. 149–163, 1998.
View at: Google Scholar
H. Kauppinen, T. Seppanen, and M. Pietikainen, “Experimental comparison of autoregressive and Fourier-based descriptors in 2D shape classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 201–207, 1995.
View at: Publisher Site | Google Scholar
G. Lu and A. Sajjanhar, “Region-based shape representation and similarity measure suitable for content-based image retrieval,” Multimedia Systems, vol. 7, no. 2, pp. 165–174, 1999.
View at: Publisher Site | Google Scholar
B. M. Mehtre, M. S. Kankanhalli, and W. F. Lee, “Shape measures for content based image retrieval: a comparison,” Information Processing and Management, vol. 33, no. 3, pp. 319–337, 1997.
View at: Google Scholar
E. Persoon and K. S. Fu, “Shape discrimination using Fourier descriptors,” IEEE Transactions on Systems, Man and Cybernetics, vol. 7, no. 3, pp. 170–179, 1977.
View at: Google Scholar
P. Van Otterloo, “Measurement of similarity, mirror-similarity and symmetry,” in A Contour-Oriented Approach to Shape Analysis, chapter 4, Prentice-Hall, London, UK, 1991.
View at: Google Scholar
D. Zhang and G. Lu, “Content-based shape retrieval using different shape descriptors: a comparative study,” in Proceedings of IEEE International Conference on Multimedia and Expo, pp. 317–320, Tokyo, Japan, 2001.
View at: Google Scholar
C. Zahn and R. Roskies, “Fourier descriptors for plane closed curves,” IEEE Transactions on Computers, vol. 21, no. 3, pp. 269–281, 1972.
View at: Google Scholar
D. Zhang and G. Lu, “A comparative study of Fourier descriptors for shape representation and retrieval,” in Proceedings of the 5th Asian Conference on Computer Vision, pp. 646–651, Melbourne, Australia, 2002.
View at: Google Scholar
A. Jain, Fundamentals of Digital Image Processing, Information and Systems Science Series, Prentice Hall, Upper Saddle River, NJ, USA, 1989.
A. Folkers and H. Samet, “Content-based image retrieval using fourier descriptors on a logo database,” in Proceedings of the 16th International Conference on Pattern Recognition, vol. 3, pp. 521–524, Quebec City, Canada, 2002.
View at: Google Scholar
Y. Mingqiang, K. Kidiyo, and R. Joseph, “A survey of shape feature extraction techniques,” in Pattern Recognition, chapter 3, IN-TECH, Vienna, Austria, 2008.
View at: Google Scholar
D. Zhang and G. Lu, “A comparative study of curvature scale space and Fourier descriptors for shape-based image retrieval,” Journal of Visual Communication and Image Representation, vol. 14, no. 1, pp. 41–60, 2003.
View at: Google Scholar
W. G. Wier, A. A. Kort, and M. D. Stern, “Cellular calcium fluctuations in mammalian heart: direct evidence from noise analysis of aequorin signals in Purkinje fibers,” Proceedings of the National Academy of Sciences of the United States of America, vol. 80, no. 23, pp. 7367–7371, 1983.
View at: Google Scholar
A. Chambolle and P.-L. Lions, “Image recovery via total variation minimization and related problems,” Numerische Mathematik, vol. 76, no. 2, pp. 167–188, 1997.
View at: Google Scholar
P.-L. Lions, S. Osher, and L. Rudin, “Denoising and deblurring images using constrained nonlinear partial differential equation,” Tech. Rep., Cognitech, Pasadena, Calif, USA, 1993.
View at: Google Scholar
D. Goldfarb and W. Yin, “Second-order cone programming methods for total variation-based image restoration,” SIAM Journal of Scientific Computing, vol. 27, no. 2, pp. 622–645, 2005.
View at: Publisher Site | Google Scholar
P. L. Combettes and J.-C. Pesquet, “Image restoration subject to a total variation constraint,” IEEE Transactions on Image Processing, vol. 13, no. 9, pp. 1213–1222, 2004.
View at: Publisher Site | Google Scholar
A. Chambolle, “An algorithm for total variation minimization and applications,” Journal of Mathematical Imaging and Vision, vol. 20, no. 1-2, pp. 89–97, 2004.
View at: Publisher Site | Google Scholar
J. Darbon and M. Sigelle, “Image restoration with discrete constrained total variation part I: fast and exact optimization,” Journal of Mathematical Imaging and Vision, vol. 26, no. 3, pp. 261–276, 2006.
View at: Publisher Site | Google Scholar
J. Darbon and M. Sigelle, “Image restoration with discrete constrained total variation part II: levelable functions, convex priors and non-convex cases,” Journal of Mathematical Imaging and Vision, vol. 26, no. 3, pp. 277–291, 2006.
View at: Publisher Site | Google Scholar
R. Acar and C. R. Vogel, “Analysis of bounded variation penalty methods for ill-posed problems,” Inverse Problems, vol. 10, no. 6, pp. 1217–1229, 1994.
View at: Publisher Site | Google Scholar
B. Song, Topics in variational PDE image segmentation, inpainting and denoising, Ph.D. thesis, University of California Los Angeles, Los Angeles, Calif, USA, 2003.
T. F. Chan and S. Esedoglu, “Aspects of total variation regularized L¹ function approximation,” Tech. Rep. CAM 05-01, University of California Los Angeles, Los Angeles, Calif, USA, 2004.
View at: Google Scholar
D. Strong and T. Chan, “Edge-preserving and scale-dependent properties of total variation regularization,” Inverse Problems, vol. 19, no. 6, pp. S165–S187, 2003.
View at: Publisher Site | Google Scholar
M. Lysaker and X.-C. Tai, “Iterative image restoration combining total variation minimization and a second-order functional,” International Journal of Computer Vision, vol. 66, no. 1, pp. 5–18, 2006.
View at: Publisher Site | Google Scholar
A. Marquina and S. Osher, “Explicit algorithms for a new time dependent model based on level set motion for nonlinear deblurring and noise removal,” SIAM Journal of Scientific Computing, vol. 22, no. 2, pp. 387–405, 2001.
View at: Publisher Site | Google Scholar
P. Blomgren, T. F. Chan, and P. Mulet, “Extensions to total variation denoising,” in Advanced Signal Processing: Algorithms, Architectures, and Implementations VII, vol. 3162 of Proceedings of SPIE, pp. 367–375, 1997.
View at: Publisher Site | Google Scholar
Y. Chen, S. Levine, and M. Rao, “Variable exponent, linear growth functionals in image restoration,” SIAM Journal on Applied Mathematics, vol. 66, no. 4, pp. 1383–1406, 2006.
View at: Publisher Site | Google Scholar
T. F. Chan, G. H. Golub, and P. Mulet, “Nonlinear primal-dual method for total variation-based image restoration,” SIAM Journal of Scientific Computing, vol. 20, no. 6, pp. 1964–1977, 1999.
View at: Google Scholar
T. Goldstein and S. Osher, “The split Bregman algorithm for L1 regularized problems,” Tech. Rep. 08-29, University of California Los Angeles, Los Angeles, Calif, USA, 2008.
View at: Google Scholar
S. Levine, Y. Chen, and J. Stanich, “Image restoration via nonstandard diffusion,” Tech. Rep. 04-01, Department of Mathematics and Computer Science, Duquesne University, Pittsburgh, Pa, USA, 2004.
View at: Google Scholar
S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, “An iterative regularization method for total variation-based image restoration,” Multiscale Modeling and Simulation, vol. 4, no. 2, pp. 460–489, 2005.
View at: Publisher Site | Google Scholar
S. Osher, A. Solé, and L. Vese, “Image decomposition and restoration using total variation minimization and the $H^{- 1}$ norm,” Multiscale Modeling and Simulation, vol. 1, pp. 349–370, 2003.
View at: Google Scholar
E. M. Bollt, R. Chartrand, S. Esedoglu, P. Schultz, and K. R. Vixie, “Graduated adaptive image denoising: local compromise between total variation and isotropic diffusion,” Advances in Computational Mathematics, vol. 31, no. 1–3, pp. 61–85, 2009.
View at: Publisher Site | Google Scholar
D. Strong and T. Chan, “Spatially and scale adaptive total variation based regularization and anisotropic diffusion in image processing,” Tech. Rep. 46, University of California Los Angeles, Los Angeles, Calif, USA, 1996.
View at: Google Scholar
L. A. Vese and S. J. Osher, “Modeling textures with total variation minimization and oscillating patterns in image processing,” Journal of Scientific Computing, vol. 19, no. 1–3, pp. 553–572, 2003.
View at: Publisher Site | Google Scholar
C. R. Vogel and M. E. Oman, “Iterative methods for total variation denoising,” SIAM Journal of Scientific Computing, vol. 17, no. 1, pp. 227–238, 1996.
View at: Google Scholar
G. Gilboa, Super-resolution algorithms based on inverse diffusion-type processes, Ph.D. thesis, Israel Institute of Technology, Haifa, Israel, 2004.
J. Weickert, B. M. Ter Haar Romeny, and M. A. Viergever, “Efficient and reliable schemes for nonlinear diffusion filtering,” IEEE Transactions on Image Processing, vol. 7, no. 3, pp. 398–410, 1998.
View at: Google Scholar

Copyright

Copyright © 2009 Carlos Bazan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

2852

Downloads

1309

Citations