- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Computational and Mathematical Methods in Medicine

Volume 2012 (2012), Article ID 436281, 9 pages

http://dx.doi.org/10.1155/2012/436281

## A Hybrid Model of Maximum Margin Clustering Method and Support Vector Regression for Noninvasive Electrocardiographic Imaging

^{1}School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China^{2}School of Information Technology and Electrical Engineering, University of Queensland, St. Lucia, Brisbane, QLD 4072, Australia^{3}School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK 73019, USA

Received 3 August 2012; Accepted 8 October 2012

Academic Editor: Dingchang Zheng

Copyright © 2012 Mingfeng Jiang 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.

#### Abstract

Noninvasive electrocardiographic imaging, such as the reconstruction of myocardial transmembrane potentials (TMPs) distribution, can provide more detailed and complicated electrophysiological information than the body surface potentials (BSPs). However, the noninvasive reconstruction of the TMPs from BSPs is a typical inverse problem. In this study, this inverse ECG problem is treated as a regression problem with multi-inputs (BSPs) and multioutputs (TMPs), which will be solved by the Maximum Margin Clustering- (MMC-) Support Vector Regression (SVR) method. First, the MMC approach is adopted to cluster the training samples (a series of time instant BSPs), and the individual SVR model for each cluster is then constructed. For each testing sample, we find its matched cluster and then use the corresponding SVR model to reconstruct the TMPs. Using testing samples, it is found that the reconstructed TMPs results with the MMC-SVR method are more accurate than those of the single SVR method. In addition to the improved accuracy in solving the inverse ECG problem, the MMC-SVR method divides the training samples into clusters of small sample sizes, which can enhance the computation efficiency of training the SVR model.

#### 1. Introduction

The technique of noninvasive imaging of the heart’s electrical activity from the body surface potentials (BSPs) constitutes one form of the inverse problem of ECG [1, 2]. Approaches to solving the inverse ECG problem have been usually based on either an activation-based model or a potential-based model, which includes epicardial, endocardial, or transmembrane potentials. Activation-based models are used to investigate the arrival time of the propagation wavefront within the myocardium [3, 4]. The potential-based models are used to evaluate the potential values on the cardiac surface [5–7] or within the myocardium [8] at certain time instants. In this study, we explore a new solution for ECG inverse problem using the potential-based approach.

Due to its inherent ill-posed property, the inverse ECG problem is usually solved by “regularization” techniques. In the last decades, numerous regularization methods have been proposed to solve this ill-posed problem, including truncated total least squares (TTLS) [9], GMRes [10], and the LSQR [11, 12]. Most of them are essentially L2-norm based regularization schemes, which inherently lead to considerable smoothness of the inverse solutions. L1-norm regularization method can overcome this drawback of L2-norm regularization method, which has been applied for epicardial potential reconstruction [13–15]. Although the above-mentioned regularization methods can more or less deal with the geometry and measurement noises for the ECG inverse problems, which depends on the regularization parameters, the robustness of the inverse solution is not always guaranteed. In this paper, without seeking assistance from the regularization techniques, we explore an alternative, more robust approach to solve the inverse ECG problem. The method is called Support Vector Regression (SVR) [16]. To find the solution for the inverse ECG problem, a regression model will be set up with multi-inputs (BSPs) and multioutputs (transmembrane potentials, TMPs). This statistic method based solution will be assessed with the quality of the inversely predicated TMPs from the measured BSPs. Compared with conventional regularization methods (e.g., zero order Tikhonov and LSQR), the SVR method can produce more accurate results in terms of reconstruction of the transmembrane potential distributions on epi- and endocardial surface. In addition, when the PCA and KPCA are adopted to extract useful features from the original inputs for building the SVR model, the SVR method with feature extraction (PCA-SVR and KPCA-SVR) outperforms that without the extract feature extraction (single SVR) in terms of the reconstruction of the TMPs [17].

Compared with using single SVR model, the hybrid models by integrating difference methods show better performance. The self-organizing map (SOM) is an unsupervised and competitive learning algorithm, which can be viewed as clustering techniques [18]. Combining the SOM with SVR or LS-SVM, the proposed hybrid method has the potential to find better inverse solutions than using a single SVR model [19, 20]. Xu et al. [21] proposed the Maximum Margin Clustering (MMC) method, which performs clustering by simultaneously finding the large margin separating hyperplane between clusters. The MMC method has been successfully applied to many clustering problems [22]. However, its efficiency is an issue of concern. Recently, Zhang et al. proposed [23, 24] an efficient approach for solving the MMC via an alternative optimization procedure, which was implemented by using the SVR method with the Laplacian loss in the inner optimization subproblem. The modified MMC algorithm is more accurate, much faster and therefore more practical for solving engineering inverse problems. In this paper, the hybrid model of modified MMC method and SVR is proposed to solve the inverse ECG problem, which is referred to as an MCC-SVR method. The conference version of this submission has appeared in CINC 2011 [25]. This submission has undergone substantial revisions and offers extended experiment results.

The main purpose of this study is to use an MCC-SVR model to investigate the reconstruction capability of TMPs. In this study, based on our previously developed realistic heart-torso model, the equivalent double layer (EDL) source model method was applied to generate the data set for training and testing the SVR model. The proposed algorithm was also compared with a single SVR model for noninvasive ECG imaging.

#### 2. Theory and Methodology

The framework of the proposed MCC-SVR method is shown in Figure 1. The MCC method is used to classify the input data; the SVR is then applied to construct the regression model of each cluster.

##### 2.1. Maximum Margin Clustering (MMC) Method [23, 24]

The clustering principle is to find a labeling to identify dominant structures in the data and to group similar instances together, so the margin obtained would be maximal over all possible labelings, that is, given a training set , where is the input and is the output. The SVM finds a large margin hyperplane to separate patterns of opposite classes by the classify function [26]: where denotes the high-dimensional feature space, which is nonlinearly mapped from the input space by the kernel function , is the normal vector of the hyperplane, and is the offset of the hyperplane. Computationally, this leads to the following optimization problem [24, 26]: where is the vector of a slack variable for the errors, and is the trade-off parameter between the smoothness and the fitness () of the decision function .

MMC attempts to extend large margin methods to allocate the input data points to different classes, leading to large separation between the different classes. Here, the case with two clusters is considered in this work. Since one could simply assign all the data points to the same class and obtain an unbounded margin, a proper constraint on the class balance needs to be imposed. Xu et al. [21] introduced a class constraint that requires to satisfy where is a user-defined constant controlling the class imbalance. Then the margin is maximized with respect to both unknown and unknown SVM parameter (, ) as follows: The origin nonconvex MMC problem in (4) can be formulated as a sequence of QPs which can be solved by some efficient QP solvers. However, it suffers from a premature convergence and easily gets stuck in poor local optima. Zhang et al. [23, 24] proposed to replace the SVM by SVR with Laplacian loss, which can lead to a significant improvement in the clustering performance compared to that of iterative SVM procedure. The primal problem of SVR with Laplacian loss can be formulated as where and are slack variables. With the obtained labels, the MMC problem based on the iterative SVR with the Laplacian loss becomes After is obtained from the optimization of SVR, the problem in (6) is reduced to the form According to Zhang’s proposition [24], for a fixed , the optimal strategy to determine the ’s in (7) is to assign all ’s as −1 for those with and assign ’s as 1 for those with . The bias can be determined as follows. (i) we sort the ’s and use the set of midpoints between any two consecutive sorted values as the candidates of ; (ii) from these sorted ’s, the first and the last of them can be dropped, and the middle can be remained; (iii) for each remaining candidate, we determine the ’s according to the above proposition and compute the corresponding objective value in (7); (iv) finally, we choose the that has the smallest objective. The complete iterative SVR procedure for MCC method is shown in Algorithm 1.

##### 2.2. Support Vector Regression (SVR) Model

The SVR algorithm [26] is only briefly described here; for details, see [16, 26]. As a linear regression model, the SVR algorithm relies on an estimation of a linear regression function: where and are the slope and offset of the regression linear, and denotes the dot product in . The above regression problem can be written as a convex optimization problem: In (9), an implicit assumption is that a function essentially approximates all pairs (, ) with precision, but sometimes this may not be the case. Therefore, one can introduce two additional positive slack variables , to refine the estimation of variables and . Now (9) can be reformulated [16] as where the constant is a trade-off parameter and denotes the number of samples; represents the upper training error, and is the lower training error subject to intensive tube. According to the strategy outlined by Vapnik [26], using Lagrange multipliers, the constrained optimization problem shown in (3) can be further restated as the following equation: where and are the Lagrange multipliers. The term in (11) is defined as the kernel function, whose values are the inner product of two vectors and in the feature space and . And bias can be computed as follows: The kernel function handles any dimension feature space with no explicit calculation of . In this study, the Gaussian kernel function is chosen as the SVR’s application mapping in this study: where and are input vector spaces; is the bandwidth of the kernel function.

In this study, an accurate and fast approach based on the GA and the simplex search techniques is presented to determine the optimal hyperparameters of the SVR model [17], as shown in Figure 2. The GA algorithm used here is based on a GA toolbox developed by Chipperfield et al. [27], and the simplex optimization method is implemented using the MATLAB optimization toolbox. The developed SVR model was trained and validated with the software LIBSVM [28].

##### 2.3. Simulation Protocol and Data Set

The SVR model is tested with our previously developed realistic heart-torso model [6, 17]. In this study, an equivalent double layer (EDL) source model is adopted to simulate the cardiac equivalent source, which represents the cardiac electrical activity by means of double layer source on the closed surface (including the endo- and epicardial surface of ventricle). For the ECG inverse problem studies, the ventricular surface TMPs and body surface potentials (BSPs) are evaluated based on the EDL source model. The transfer matrix between TMPs and BSPs is evaluated by the boundary element method (BEM), and it has the dimension of and its condition number (the ratio of largest and smallest singular values) is 5.6 × 10^{12}. As shown in Figure 3, the EDL source method is used to obtain the BSPs and the TMPs . For the construction of the training and testing data set Different Action Potentials (APs) for various myocardial cells and the normal Ventricular Excitation Sequence (VES) are used to calculate the TMPs () at different times; from the calculated TMPs, the corresponding BSPs are deduced with the transfer matrix .

In this study, a normal ventricular excitation data set is prepared for the setup of the SVR model. The considered ventricular excitation period from the first breakthrough to the end is 357 ms and the time step is 1 ms, and, thus, 358 BSPs and TMPs temporal data sets are numerically recorded; in addition, the 30 dB simulated Gaussian white noise is added into the BSPs representing the measurement noises. 60 datasets at times of 3 ms, 9 ms, 15 ms, …, and 357 ms after the first ventricular breakthrough are used as testing samples to evaluate the generalization capacity of the proposed SVR model. The rest 298 in 358 data sets are employed as the training samples for building the SVR model. With the consideration of a wide numerical range of the values, for each time, the values can be scaled to the range (0, 1): where are the body surface potentials at time instant , is the maximum value of BSPs at the time , and is the minimum value of BSPs at the time .

As the TMPs are known in advance in the simulation study, the accuracy of reconstructed TMPs at the testing time can be evaluated by either relative errors (REs): or the correlation coefficient (CC), given by where is the number of nodes on the ventricular surface. denotes the simulated TMPs distribution at time , and are inversely computed. The quantities and are the mean value of and over the whole ventricular surface nodes at time .

#### 3. Results

According to the MCC method, the above 298 training samples are classified four clusters as shown in Figure 4(a), and the numbers of the four clusters is 80, 74, 70, and 74, respectively. Then the individual SVR model is trained for each cluster, and the hyperparameters are determined using the GA-Simplex method. For 60 testing samples, the MCC method is used to find their corresponding clusters, as shown in Figure 4(b).

To illustrate the performances of the reconstructed TMPs, four sequential testing time points (3, 15, 27, and 39 ms after ventricle excitation) are presented. The inverse ECG solutions are shown in Figure 5; in contrast to the conventional regularization methods, such as zero order Tikhonov regularization method and LSQR regularization method, the single SVR method can yield rather better results with lower RE and higher CC. Moreover, it can be seen that the MCC-SVR method offers superior performances than the single SVR method, as its solution is more close to the simulated TMPs distributions. The time courses of the simulated TMPs and reconstructions for one representative source point on the heart surface are depicted in Figure 6. It can be found that, in reconstructing the TMPs for one representative source point over all the testing times, the MCC-SVR method offers better solution compared with single SVR method.

The RE and CC of the reconstructed TMPs with different methods can be found in Figure 7. In contrast to the single SVR method, the MCC-SVR method can yield improved results with a lower RE and a higher CC over the 60 testing samples.

By dividing the training samples into smaller clusters, the training time for each cluster can be reduced. The training times for each cluster by using the MCC-SVR method are 6715.9 seconds, 6821.1 seconds, 4550.6 seconds, and 5162.4 seconds, respectively, and the total time of the four clusters is 23250 seconds. When using the single SVR model to train the model of the all training samples, it takes 35233.4 seconds.

#### 4. Discussion and Conclusion

In this study, MCC-SVR method is proposed to solve the noninvasive ECG imaging problem. Here, the MMC approach is adopted to cluster the training samples firstly, and then SVR method is applied to construct the model for each cluster. After building different cluster models, for the testing sample, we can find its matched cluster and then use the corresponding SVR model to reconstruct the TMPs. From the reconstructed TMPs as shown in Figures 5 and 6, it can be seen that the MCC-SVR methods offer better solution compared with single SVR method. According to the evaluation indices RE and CC, the performances of the reconstructed TMPs by using the MCC-SVR can constantly converge to a smaller RE and a higher CC on the testing samples than those of the single SVR method, as shown in Figure 7. In terms of the computation efficiency of the training SVR model, for the given training samples, the MCC-SVR method can save about 34% time than the single SVR method. With the increasing of the training samplings, the MCC-SVR method lessens more training time than the single SVR method. Moreover, the training process for each cluster can be implemented simultaneously using parallel computing, therefore further enhance the training efficiency.

In summary, this paper proposed the MCC-SVR method for the inverse solutions of the ECG problem. The new algorithm was tested and compared with single SVR schemes using a realistic heart-torso model. The experimental results show that the MCC-SVR can improve the generalization performance of the single SVR in reconstructing the TMPs, leading to a more accurate reconstruction of the TMPs. In our future work, we plan to improve the MCC-SVR method for solving various nonlinear regression problems in noninvasive ECG imaging.

#### Acknowledgments

This work is supported by the National Natural Science Foundation of China (30900322, 61070063, and 61101046). This work is also funded by the Zhejiang Provincial Natural Science Foundation of China (Y2090398).

#### References

- L. K. Cheng, J. M. Bodley, and A. J. Pullan, “Comparison of potential- and activation-based formulations for the inverse problem of electrocardiology,”
*IEEE Transactions on Biomedical Engineering*, vol. 50, no. 1, pp. 11–22, 2003. View at Publisher · View at Google Scholar · View at Scopus - C. Ramanathan, R. N. Ghanem, P. Jia, K. Ryu, and Y. Rudy, “Noninvasive electrocardiographic imaging for cardiac electrophysiology and arrhythmia,”
*Nature Medicine*, vol. 10, no. 4, pp. 422–428, 2004. View at Publisher · View at Google Scholar · View at Scopus - P. M. Van Dam, T. F. Oostendorp, A. C. Linnenbank, and A. Van Oosterom, “Non-invasive imaging of cardiac activation and recovery,”
*Annals of Biomedical Engineering*, vol. 37, no. 9, pp. 1739–1756, 2009. View at Publisher · View at Google Scholar · View at Scopus - Z. Liu, C. Liu, and B. He, “Noninvasive reconstruction of three-dimensional ventricular activation sequence from the inverse solution of distributed equivalent current density,”
*IEEE Transactions on Medical Imaging*, vol. 25, no. 10, pp. 1307–1318, 2006. View at Publisher · View at Google Scholar · View at Scopus - B. F. Nielsen, X. Cai, and M. Lysaker, “On the possibility for computing the transmembrane potential in the heart with a one shot method: an inverse problem,”
*Mathematical Biosciences*, vol. 210, no. 2, pp. 523–553, 2007. View at Publisher · View at Google Scholar · View at Scopus - M. Jiang, L. Xia, G. Shou, Q. Wei, F. Liu, and S. Crozier, “Effect of cardiac motion on solution of the electrocardiography inverse problem,”
*IEEE Transactions on Biomedical Engineering*, vol. 56, no. 4, pp. 923–931, 2009. View at Publisher · View at Google Scholar · View at Scopus - M. Jiang, L. Xia, W. Huang, G. Shou, F. Liu, and S. Crozier, “The application of subspace preconditioned LSQR algorithm for solving the electrocardiography inverse problem,”
*Medical Engineering and Physics*, vol. 31, no. 8, pp. 979–985, 2009. View at Publisher · View at Google Scholar · View at Scopus - L. Wang, H. Zhang, K. C. Wong, H. Liu, and P. Shi, “Physiological-model-constrained noninvasive reconstruction of volumetric myocardial transmembrane potentials,”
*IEEE transactions on Bio-Medical Engineering*, vol. 57, no. 2, pp. 296–315, 2010. View at Publisher · View at Google Scholar · View at Scopus - G. Shou, L. Xia, M. Jiang, Q. Wei, F. Liu, and S. Crozier, “Truncated total least squares: a new regularization method for the solution of ECG inverse problems,”
*IEEE Transactions on Biomedical Engineering*, vol. 55, no. 4, pp. 1327–1335, 2008. View at Publisher · View at Google Scholar · View at Scopus - C. Ramanathan, P. Jia, R. Ghanem, D. Calvetti, and Y. Rudy, “Noninvasive electrocardiographic imaging (ECGI): application of the generalized minimal residual (GMRes) method,”
*Annals of Biomedical Engineering*, vol. 31, no. 8, pp. 981–994, 2003. View at Publisher · View at Google Scholar · View at Scopus - M. Jiang, L. Xia, G. Shou, and M. Tang, “Combination of the LSQR method and a genetic algorithm for solving the electrocardiography inverse problem,”
*Physics in Medicine and Biology*, vol. 52, no. 5, pp. 1277–1294, 2007. View at Publisher · View at Google Scholar · View at Scopus - M. Jiang, L. Xia, G. Shou, F. Liu, and S. Crozier, “Two hybrid regularization frameworks for solving the electrocardiography inverse problem,”
*Physics in Medicine and Biology*, vol. 53, no. 18, pp. 5151–5164, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. Ghosh and Y. Rudy, “Application of L1-norm regularization to epicardial potential solution of the inverse electrocardiography problem,”
*Annals of Biomedical Engineering*, vol. 37, no. 5, pp. 902–912, 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Shou, L. Xia, F. Liu, M. Jiang, and S. Crozier, “On epicardial potential reconstruction using regularization schemes with the L1-norm data term,”
*Physics in Medicine and Biology*, vol. 56, no. 1, pp. 57–72, 2011. View at Publisher · View at Google Scholar · View at Scopus - L. Wang, J. Qin, T. T. Wong, and P. A. Heng, “Application of L1-norm regularization to epicardial potential reconstruction based on gradient projection,”
*Physics in Medicine and Biology*, vol. 56, pp. 6291–6310, 2011. - A. J. Smola and B. Schölkopf, “A tutorial on support vector regression,”
*Statistics and Computing*, vol. 14, no. 3, pp. 199–222, 2004. View at Publisher · View at Google Scholar · View at Scopus - M. Jiang, L. Zhu, Y. Wang et al., “Application of kernel principal component analysis and support vector regression for reconstruction of cardiac transmembrane potentials,”
*Physics in Medicine and Biology*, vol. 56, no. 6, pp. 1727–1742, 2011. View at Publisher · View at Google Scholar · View at Scopus - M. M. Mostafa, “Clustering the ecological footprint of nations using Kohonen's self-organizing maps,”
*Expert Systems with Applications*, vol. 37, no. 4, pp. 2747–2755, 2010. View at Publisher · View at Google Scholar · View at Scopus - S. Ismail, A. Shabri, and R. Samsudin, “A hybrid model of self-organizing maps (SOM) and least square support vector machine (LSSVM) for time-series forecasting,”
*Expert Systems with Applications*, vol. 38, no. 8, pp. 10574–10578, 2011. View at Publisher · View at Google Scholar · View at Scopus - S. H. Hsu, J. P. A. Hsieh, T. C. Chih, and K. C. Hsu, “A two-stage architecture for stock price forecasting by integrating self-organizing map and support vector regression,”
*Expert Systems with Applications*, vol. 36, no. 4, pp. 7947–7951, 2009. View at Publisher · View at Google Scholar · View at Scopus - L. Xu, J. Neufeld, B. Larson, and D. Schuurmans, “Maximum margin clustering,” in
*Advances in Neural Information Processing Systems*, vol. 17, pp. 1537–1544, MIT Press, Cambridge, Mass, USA, 2005. - L. Xu and D. Schuurmans, “Unsupervised and semi-supervised multi-class support vector machines,” in
*20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05*, pp. 904–910, usa, July 2005. View at Scopus - K. Zhang, I. W. Tsang, and J. T. Kwok, “Maximum margin clustering made practical,” in
*24th International Conference on Machine Learning, ICML 2007*, pp. 1119–1126, usa, June 2007. View at Publisher · View at Google Scholar · View at Scopus - K. Zhang, I. W. Tsang, and J. T. Kwok, “Maximum margin clustering made practical,”
*IEEE Transactions on Neural Networks*, vol. 20, no. 4, pp. 583–596, 2009. View at Publisher · View at Google Scholar · View at Scopus - M. Jiang, J. Lv, C. Wang, W. Huang, L. Xia, and G. Shou, “A hybrid model of maximum margin clustering method and support vector regression for solving the inverse ECG problem,”
*Computing in Cardiology*, vol. 38, pp. 457–460, 2011. - V. Vapnik,
*Statistical Learning Theory*, John Wiley & Sons, New York, NY, USA, 1998. - A. Chipperfield, P. Flemming, H. Pohlheim, and C. Fonseca,
*Genetic Algorithm Toolbox for Use with MATLAB*, University of Sheffield, Sheffield, UK, 1994. - C. C. Chang and C. J. Lin, “LIBSVM: a library for support vector machines,” 2001, http://www.csie.ntu.edu.tw/~cjlin/libsvm/.