Professional Documents
Culture Documents
6, NOVEMBER 2007
AbstractThis paper presents evolvable block-based neural ventricular contraction [2], [3]. Association for the Advance-
networks (BbNNs) for personalized ECG heartbeat pattern clas- ment of Medical Instrumentation (AAMI, Arlington, VA) rec-
sification. A BbNN consists of a 2-D array of modular component ommends that each heartbeat be classified into one of the fol-
NNs with flexible structures and internal configurations that can
be implemented using reconfigurable digital hardware such as lowing five ECG patterns: (beats originating in the sinus
field-programmable gate arrays (FPGAs). Signal flow between node), (supraventricular ectopic beats), (ventricular ectopic
the blocks determines the internal configuration of a block as beats), (fusion beats), and (unclassifiable beats) for heart
well as the overall structure of the BbNN. Network structure monitoring [4], [5]. A number of methods have been proposed to
and the weights are optimized using local gradient-based search classify ECG heartbeat patterns based on the features extracted
and evolutionary operators with the rates changing adaptively
according to their effectiveness in the previous evolution period. from ECG signals, such as morphological features [5], heartbeat
Such adaptive operator rate update scheme ensures higher fitness temporal intervals [5], frequency domain features [3], [6], and
on average compared to predetermined fixed operator rates. The wavelet transform coefficients [7]. Classification techniques for
Hermite transform coefficients and the time interval between two ECG patterns include linear discriminant analysis [5], support
neighboring R-peaks of ECG signals are used as inputs to the vector machines [8], artificial neural networks (NNs) [9][14],
BbNN. A BbNN optimized with the proposed evolutionary algo-
rithm (EA) makes a personalized heartbeat pattern classifier that mixture-of-experts method [12], and statistical Markov models
copes with changing operating environments caused by individual [15], [16]. Unsupervised clustering of ECG complexes using
difference and time-varying characteristics of ECG signals. Simu- self-organizing maps has also been studied [17]. Many conven-
lation results using the Massachusetts Institute of Technology/Beth tional supervised ECG classification methods based on fixed
Israel Hospital (MIT-BIH) arrhythmia database demonstrate high classification models [5], [8], [15], [16] or fixed network struc-
average detection accuracies of ventricular ectopic beats (98.1%)
and supraventricular ectopic beats (96.6%) patterns for heartbeat tures [9][11] do not take into account physiological variations
monitoring, being a significant improvement over previously in ECG patterns caused by temporal, personal, or environmental
reported electrocardiogram (ECG) classification results. differences.
Index TermsBlock-based neural networks (BbNNs), evolu- Evolvable NNs [18] change the network structure and in-
tionary algorithms (EAs), personalized electrocardiogram (ECG) ternal configurations as well as the parameters to cope with
classification. dynamic operating environments. Block-based neural network
(BbNN) models [19] provide a unified approach to the two
fundamental problems of artificial NN design: simultaneous
I. INTRODUCTION optimization of structures and weights and implementation
using reconfigurable digital hardware. An integrated represen-
LECTROCARDIOGRAM (ECG) is an important routine tation of network structure and connection weights of BbNNs
E clinical practice for continuous monitoring of cardiac ac-
tivities. However, ECG signals vary greatly for different indi-
offers simultaneous optimization by use of evolutionary opti-
mization algorithms. BbNNs have a modular structure suitable
viduals and within patient groups [1]. Even for the same in- for implementation using reconfigurable digital hardware. The
dividual, heartbeat patterns significantly change with time and network can be easily expanded in size by adding more blocks.
under different physical conditions. While normal sinus rhythm A BbNN can be implemented using field-programmable gate
originates from the sinus node of heart, arrhythmias have var- arrays (FPGAs) that can modify and fine-tune its internal
ious origins and indicate a wide variety of heart problems. Under structure on the fly during the evolutionary optimization
different situations, the same symptoms of arrhythmia produce procedure. A library-based approach [20] creates a library of
different morphologies due to their origins such as premature VHSIC hardware description language (VHDL) modules of the
basic BbNN blocks and interconnects the modules to form a
Manuscript received April 11, 2006; revised October 5, 2006 and February
custom BbNN network, which is then synthesized, placed and
24, 2007; accepted March 25, 2007. This work was supported by the National routed, and downloaded to an FPGA. A more recent effort [21]
Science Foundation under Grant ECS-0319002. proposes a smart block to implement a basic block of any
W. Jiang is with the Department of Electrical and Computer Engineering, The
input/output type with an Amirix AP130 board that features a
University of Tennessee, Knoxville, TN 37996-2100 USA (e-mail: wjiang@utk.
edu). Xilinx Virtex-II Pro FPGA, dual on-chip PowerPC 405 proces-
S. G. Kong is with the Department of Electrical and Computer Engineering, sors, and on-chip block random access memories (BRAMs).
Temple University, Philadelphia, PA 19122 USA (e-mail: skong@utk.edu). This approach is a system-on-chip design with an evolutionary
Color versions of one or more of the figures in this paper are available online
at http://ieeexplore.ieee.org. algorithm (EA) running on PowerPC and a BbNN network
Digital Object Identifier 10.1109/TNN.2007.900239 implemented on the FPGA. Research work [22], [23] has been
1045-9227/$25.00 2007 IEEE
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
JIANG AND KONG: BBNNS FOR PERSONALIZED ECG SIGNAL CLASSIFICATION 1751
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
1752 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 18, NO. 6, NOVEMBER 2007
Fig. 2. Three possible internal configuration types of a block. (a) One input and three outputs (1/3). (b) Three inputs and one output (3/1). (c) Two inputs and two
outputs (2/2).
biases. For the case of two inputs and two outputs (2/2), there
are four weights and two biases. The 1/3 case has three weights
and three biases, and the 3/1 three weights and one bias. Internal
configuration of a BbNN is characterized by the input/output
connections of the nodes. A node can be an input or an output
according to the internal configuration determined by the signal
flow. An incoming arrow to a block specifies the node as an
input, and output nodes are associated with outgoing arrows.
Generalization capability of BbNN emerges through various in-
ternal configurations of a block.
The signal denotes the input and the output of the block.
The output of a block is computed with an activation function
and are index sets for input and output nodes. For type 1/3 ulation, the algorithm enters into the evolution loop. The cur-
block, and . For blocks of the type 3/1, rent population is evaluated to update individual fitness values.
and . The type 2/2 blocks have The fitness rescaling by disruptive pressure ensures the selec-
and . The term is the bias of the th node. In this tion of some individuals with high and low fitness values. Ini-
paper, a sigmoid activation function of the form tially, each operator is selected according to a uniform distribu-
tion. Applying this operator according to its rate to the parent(s)
(2) chosen with tournament selection produces new offspring. This
offspring is reinserted into the population and replaces an infe-
is used with and [26]. These parameters rior individual chosen with a tournament selection. The evolu-
were chosen so that the first derivative at zero approximately tion process during a predetermined number of generations
equals 1, the second derivative achieves its extremum at approx- is called an evolution period. After each evolution period, the
imately 2 and 2, and its linear range is 1, 1. operator rates are updated based on their effectiveness. The EA
is terminated either by finding a satisfactory solution or after
III. EVOLUTIONARY OPTIMIZATION OF BBNN the maximum generation is reached. Two successive popula-
tions differ by a single individual in this incremental EA [27],
A. EA for BbNN Optimization [28]. In generational EA models, a new population replaces the
Evolutionary optimization of BbNN involves four main old population. An incremental EA is preferred over the gener-
procedures: fitness scaling, selection, evolutionary and gradient ational model in order to reduce the computational and memory
search operations, and adaptive operator rate adjustment. The requirements at each generation.
fitness is rescaled with a generalized disruptive pressure that
favors the individuals with both high and low fitness values. A B. Fitness Scaling and Tournament Selection
tournament selection chooses parent individuals into a mating In many optimization problems, the search landscape can be
pool subject to crossover, mutation, and gradient-based local rather mountainous or multipeaked. The search space of BbNNs
search operations. The rate of an operator is updated adaptively resembles a mountainous characteristic due to the two reasons.
in terms of the effectiveness of the operator in generating fitter First, each of the possible structures will lead to a local op-
individuals. timum if the weights are properly optimized. Second, for a given
Fig. 3 shows a pseudocode description of the evolutionary op- structure, the weight space can also contain many peaks. In
timization algorithm. After a random generation of initial pop- the needle-in-a-haystack problem, the global optimum is sur-
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
JIANG AND KONG: BBNNS FOR PERSONALIZED ECG SIGNAL CLASSIFICATION 1753
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
1754 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 18, NO. 6, NOVEMBER 2007
Fig. 5. Crossover operation example of two 3 2 4 BbNNs. A pair of individual BbNNs (a) and (b) before crossover and (c) and (d) after crossover.
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
JIANG AND KONG: BBNNS FOR PERSONALIZED ECG SIGNAL CLASSIFICATION 1755
flow is reversed after mutation, all the irrelevant weights are re- where is the sensitivity of the output node of the block in
moved and new weights are created with random values in a stage that is connected to the current output node via .
proper direction. A weight selected for mutation will be updated Thus, the weight update can be summarized in the following
with a random perturbation equation using (10)(12):
(6) (13)
where denotes zero-mean unit-variance Gaussian noise. The sensitivities of the output nodes of the blocks in calcu-
3) GradientDescent Search: The gradientdescent search lation stage are calculated, and then, the internal weights of
(GDS) operator updates internal weights in a BbNN. A GDS these blocks are updated by adding the increment given in
epoch consists of forward pass to compute network outputs and (13). After calculating the sensitivities and updating the weights
a backward pass of error signals to update internal weights. The of all blocks in stage , the sensitivities of the output nodes of
computation stage of a block determines the computational the blocks in stage are computed with the weights update
priority of the block followed. This procedure continues until the calculation of the
blocks in the first computation stage is finished. The GDS op-
(7) eration stops when either a preset maximum number of epochs
are reached or the fitness improvement between two successive
where denotes the computation stage of the blocks connected epochs falls below a threshold. The maximum number of epochs
to the current block with outgoing signal flows. If a block does or a small threshold ensure a reasonable
not receive input from the neighboring blocks, computation amount of computation at each generation.
stage becomes 1. The inputs to the blocks in stage are 4) Operator Rate Update: An operator rate determines the
updated with the outputs of the blocks in stage , followed by probability of the operator to be applied. The proposed update
computing the outputs of the blocks in stage . This forward scheme automatically adjusts an operators rate based on both
pass is complete when the network output is obtained. its effectiveness in improving the fitness in the previous step
In a backward pass, the error signals propagate from the and current fitness trend. Operator rates are updated at every
blocks of higher stages to lower stages. The error criterion evolution period and remain unchanged during each evolution
function is defined as period. In the th evolution period, the first step is to assign
a probability to each of the operators based on its performance
during the th period. Then, the operator rates are increased
(8) if the maximum fitness has not been improved during the past
period. The performance of an operator during the th evolution
where is the total number of training patterns. The two vec- period is measured by the effectiveness defined as
tors and are the target and actual outputs for the th training
pattern, respectively. Gradient steepest descent rule updates the (14)
weights according to the following equation [34]:
where denotes the number of generations within each evo-
(9) lution period that an operator produces offspring with higher
fitness value than that of its parents, and indicates the total
where is the learning rate. and are the index sets of input number of generations that an operator is selected in the same
and output nodes. The increment of the internal weight of evolution period. Thus, the value of has a range from 0 (least
a block can be deduced using generalized delta rule [35], [36] effective) to 1 (most effective). The effectiveness of an operator
determines its probability in the next evolution period ,
as defined in the following:
(10)
if
where is the sensitivity of the output node of the block to if
the error, and is the input to the input node of the block. For (15)
a network output node, the sensitivity becomes where is a scaling factor that controls the amount of rate ad-
justment and has been set to 0.02 randomly for initial simula-
(11) tions. and denote lower and upper limits of the prob-
ability for an operator to be applied. If , the operator
where and are the desired and actual outputs at the node. will never be applied, and if , then the operator will
is the first derivative of the tangent activation function and is always be applied. Initially, is set to a big value (e.g., 1.0)
a net input to the node. The sensitivity of an output node of a to ensure an effective operator to be applied with a higher rate
block in stage is computed as and is set to a small value (e.g., 0.1) to give less effec-
tive operators a lower chance being applied. Overall, the update
(12) scheme uses high operator rates in early evolution stages, and
then, gradually decreases the rates for less effective operators.
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
1756 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 18, NO. 6, NOVEMBER 2007
Effective operators keep higher rates. The logarithmic function The normal and various abnormal types have been combined
is used in the rate update scheme to implement gradual rate ad- into five heartbeat classes according to the AAMI recommended
justment. practice [4]. In earlier work [25], a binary classification of VEB
The next step in rate adjustment considers the fitness trend and non-VEB problem was addressed. Paced beats refer to ECG
during the previous evolution periods. The algorithm tends to signals generated by the heart under the help of an external or
fall in a local maximum point if the maximum fitness stops im- implanted artificial pacemaker for the patients whose electrical
proving before a desired solution is found. It is thus desired to conduction path of heart is blocked or the native pacemaker
perform more searches in order to help the search escape from a is not functioning properly. In agreement with the AAMI-rec-
local solution, and the operator rates are accordingly increased ommended practice, paced beats are not included in the clas-
to consider such situation as described in the following: sification experiments in this paper as well as in the previous
works [5], [12] chosen for comparison. The remaining records
are divided into two sets. The first set contains the 20 records
if Fitness (16) numbered from 100 to 124 and is intended to provide common
representative training data. The second set is composed of the
where is the set slightly bigger than to ensure the rate is rest records numbered from 200 to 234, and each of the records
increased ( equals 5% percent bigger than in the experi- in this set will be used in the test for performance evaluation.
ments). Fitness means the maximum fitness has The training data for a patient consist of two parts, the first part
not been improved during the th evolution period. An operator coming from the common set and being the same for all testing
rate is determined according to the performance and the current patients. The other part includes the heartbeats from the first
fitness trend. An operator will maintain a high rate if it is effec- 5 min of the ECG recording of the patient, which conforms to
tive in generating fitter individuals; otherwise, its rate will be the AAMI recommended practice that allows at most 5 min of
gradually decreased. If the maximum fitness has not been im- recordings from a subject to be used for training purpose. The
proved before a desired solution was found, the operator rates remaining beats of the record are test patterns.
will be increased to do denser searches. B. Feature Extraction
Basis function representations have been shown to be an effi-
IV. ECG SIGNAL CLASSIFICATION cient feature extraction method for ECG signals [37], [38]. Her-
mite basis functions provide an effective approach for character-
The AAMI recommends that each ECG beat be classified into
izing ECG heartbeats and have been widely used in ECG signal
the following five heartbeat types: (beats originating in the
classification [8], [9], [17] and compression [37]. Hermite basis
sinus node), (supraventricular ectopic beats), (ventricular
function expansion has a unique width parameter that is an ef-
ectopic beats), (fusion beats), and (unclassifiable beats)
fective parameter to represent ECG beats with different QRS
[4]. A large interindividual variation of ECG waveforms is ob-
complex duration. The coefficients of Hermite expansions char-
served among individuals and within patient groups [1]. The
acterize the shape of QRS complexes and serve as input features.
waveforms of ECG beats from the same class may differ signif-
Hermite basis functions are given by the following:
icantly and different types of heartbeats sometime possess sim-
ilar shapes. Hence, the sensitivity and specificity of ECG classi-
(17)
fication algorithms are often unsatisfactorily low. For instance,
a recent method [5] reports a sensitivity rate of 77.7% for VEB
detection and 75.9% for SVEB detection. where is the width parameter and approximately equals the
half-power duration. The functions are the Hermite
A. ECG Data polynomials [9], [17]. Hermite functions are orthonormal for
any fixed value of width
The MIT-BIH arrhythmia database [2] is used in the experi-
ment. The database contains 48 records obtained from 47 dif- (18)
ferent individuals (two records came from the same patient).
Each record contains two-channel ECG signals measured for 30 This useful property enables the calculation of expansion co-
min. Twenty-three records (numbered from 100 to 124, inclu- efficients of an arbitrary signal. Specifically, the QRS complex
sive with some numbers missing) serve as representative sam- is extracted as a 250-ms window centered at the R-peak, which
ples of routine clinical recordings. The remaining 25 (numbered is sufficient to cover both normal and wider-than-normal QRS
from 200 to 234, inclusive with some numbers missing) records signals [9], [39]. A QRS complex can be approximated by
include unusual heartbeat waveforms such as complex ventric- a combination of Hermite basis functions weighted by expan-
ular, junctional, and supraventricular arrhythmias. Continuous sion coefficients
ECG signals are filtered using a bandpass filter with a passband
from 0.1 to 100 Hz. Filtered signals are then digitized at 360 Hz.
(19)
The beat locations are automatically labeled at first and verified
later by independent experts to reach a consensus. The whole
database contains more than 109 000 annotations of normal and where as . Multiplying to both
14 different types of abnormal heartbeats. sides of (19) and summing them up over time, a set of coef-
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
JIANG AND KONG: BBNNS FOR PERSONALIZED ECG SIGNAL CLASSIFICATION 1757
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
1758 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 18, NO. 6, NOVEMBER 2007
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
JIANG AND KONG: BBNNS FOR PERSONALIZED ECG SIGNAL CLASSIFICATION 1759
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
1760 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 18, NO. 6, NOVEMBER 2007
REFERENCES
[1] R. Hoekema, G. J. H. Uijen, and A. v. Oosterom, Geometrical aspects
of the interindividual variability of multilead ECG recordings, IEEE
Trans. Biomed. Eng., vol. 48, no. 5, pp. 551559, May 2001.
[2] R. Mark and G. Moody, MIT-BIH Arrhythmia Database Directory,
[Online]. Available: http://ecg.mit.edu/dbinfo.html
[3] K. Minami, H. Nakajima, and T. Toyoshima, Real-Time discrimina-
tion of ventricular tachyarrhythmia with Fourier-transform neural net-
work, IEEE Trans. Biomed. Eng., vol. 46, no. 2, pp. 179185, Feb.
1999.
[4] Recommended practice for testing and reporting performance results
of ventricular arrhythmia detection algorithms, Association for the
Advancement of Medical Instrumentation, Arlington, VA, 1987.
[5] P. de Chazal, M. ODwyer, and R. B. Reilly, Automatic classification
of heartbeats using ECG morphology and heartbeat interval features,
IEEE Trans. Biomed. Eng., vol. 51, no. 7, pp. 11961206, Jul. 2004.
[6] I. Romero and L. Serrano, ECG frequency domain features extraction:
A new characteristic for arrhythmias classification, in Proc. Int. Conf.
Eng. Med. Biol. Soc. (EMBS), Oct. 2001, pp. 20062008.
[7] P. de Chazal and R. B. Reilly, A comparison of the ECG classification
performance of different feature sets, Proc. Comput. Cardiology, vol.
27, pp. 327330, 2000.
[8] S. Osowski, L. T. Hoai, and T. Markiewicz, Support vector machine-
Fig. 11. Comparison of true positive rate and false positive rate for the three based expert system for reliable heartbeat recognition, IEEE Trans.
algorithms in terms of (a) VEB and (b) SVEB detection. Biomed. Eng., vol. 51, no. 4, pp. 582589, Apr. 2004.
[9] T. H. Linh, S. Osowski, and M. Stodolski, On-line heart beat recog-
nition using Hermite polynomials and neuro-fuzzy network, IEEE
TABLE II Trans. Instrum. Meas., vol. 52, no. 4, pp. 12241231, Aug. 2003.
PERFORMANCE COMPARISON OF VEB AND SVEB DETECTION (IN PERCENT) [10] S. Osowski and T. H. Linh, ECG beat recognition using fuzzy hy-
brid neural network, IEEE Trans. Biomed. Eng., vol. 48, no. 11, pp.
12651271, Nov. 2001.
[11] Y. H. Hu, W. J. Tompkins, J. L. Urrusti, and V. X. Afonso, Applica-
tions of artificial neural networks for ECG signal detection and classi-
fication, J. Electrocardiol., pp. 6673, 1994.
[12] Y. Hu, S. Palreddy, and W. J. Tompkins, A patient-adaptable ECG
beat classifier using a mixture of experts approach, IEEE Trans.
Biomed. Eng., vol. 44, no. 9, pp. 891900, Sep. 1997.
[13] S. B. Ameneiro, M. Fernndez-Delgado, J. A. Vila-Sobrino, C. V.
Regueiro, and E. Snchez, Classifying multichannel ECG patterns
with an adaptive neural network, IEEE Eng. Med. Biol. Mag., vol. 17,
QRS complexes. Osowski et al. [8] presented a heartbeat clas- no. 1, pp. 4555, Jan./Feb. 1998.
sification method using support vector machines and two dif- [14] M. Fernndez-Delgado and S. B. Ameneiro, MART: A multichannel
ferent types of features, Hermite characterization and high-order ART-based neural network, IEEE Trans. Neural Netw., vol. 9, no. 1,
pp. 139150, Jan. 1998.
cumulants. The overall accuracy of heart beat recognition is [15] D. A. Coast, R. M. Stern, G. G. Cano, and S. A. Briller, An approach
95.91% for normal and 12 abnormal types. to cardiac arrhythmia analysis using hidden Markov models, IEEE
Trans. Biomed. Eng., vol. 37, no. 9, pp. 826836, Sep. 1990.
V. CONCLUSION [16] R. V. Andreao, B. Dorizzi, and J. Boudy, ECG signal analysis through
hidden Markov models, IEEE Trans. Biomed. Eng., vol. 53, no. 8, pp.
This paper presents an evolutionary optimization of the feed- 15411549, Aug. 2006.
forward implementation of BbNNs and the application of BbNN [17] M. Lagerholm, C. Peterson, G. Braccini, L. Edenbrandt, and L.
Srnmo, Clustering ECG complexes using Hermite functions and
approach to personalized ECG heartbeat classification. Network self-organizing maps, IEEE Trans. Biomed. Eng., vol. 47, no. 7, pp.
structure and connection weights are optimized using an EA that 838848, Jul. 2000.
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.
JIANG AND KONG: BBNNS FOR PERSONALIZED ECG SIGNAL CLASSIFICATION 1761
[18] X. Yao, Evolving artificial neural networks, Proc. IEEE, vol. 87, no. [37] N. Ahmed, P. J. Milne, and S. G. Harris, Electrocardiographic data
9, pp. 14231447, Sep. 1999. compression via orthogonal transforms, IEEE Trans. Biomed. Eng.,
[19] S. W. Moon and S. G. Kong, Block-based neural networks, IEEE vol. BME-22, no. 6, pp. 484487, Nov. 1975.
Trans. Neural Netw., vol. 12, no. 2, pp. 307317, Mar. 2001. [38] L. Srnmo, P. O. Brjesson, M. E. Nygrds, and O. Pahlm, A method
[20] S. Kothandaraman, Implementation of block-based neural networks for evaluation of QRS shape features using a mathematical model
on reconfigurable computing platforms, M.S. thesis, Dept. Electr. for the ECG, IEEE Trans. Biomed. Eng., vol. BME-28, no. 10, pp.
Comp. Eng., Univ. Tennessee, Knoxville, TN, 2004. 713717, Oct. 1981.
[21] S. Merchant, G. D. Peterson, S. K. Park, and S. G. Kong, FPGA im- [39] J. T. Catalano, Guide to ECG Analysis, 2nd ed. Baltimore, MD:
plementation of evolvable block-based neural networks, Proc. Congr. Williams & Wilkins, 2002.
Evolut. Comput., pp. 31293136, Jul. 2006. [40] J. A. Swets, Measuring the accuracy of diagnostic systems, Science,
[22] P. Martin, A hardware implementation of a GP system using FPGAs vol. 240, pp. 12851293, Jun. 1998.
and handel-C, Genetic Programm. Evolvable Mach., vol. 2, no. 4, pp.
317343, 2001. Wei Jiang (S04) received the B.S. degree in
[23] B. Shackleford, G. Snider, R. Carter, E. Okushi, M. Yasuda, K. Seo, electrical engineering from Sichuan University,
and H. Yasuura, A high performance, pipelined, FPGA-based genetic Chengdu, Sichuan, China, in 2000 and the M.S.
algorithm machine, Genetic Programm. Evolvable Mach., vol. 2, no. and Ph.D. degrees in computer engineering from
1, pp. 3360, 2001. the University of Tennessee, Knoxville, in 2004 and
[24] W. Jiang, S. G. Kong, and G. D. Peterson, ECG signal classification 2007, respectively.
with evolvable block-based neural networks, in Proc. Int. Joint Conf. His research interests include pattern recognition
Neural Netw. (IJCNN), Jul. 2005, vol. 1, pp. 326331. and image processing and, in particular, ECG signal
[25] W. Jiang, S. G. Kong, and G. D. Peterson, Continuous heartbeat moni- classification, artificial neural networks, evolutionary
toring using evolvable block-based neural networks, in Proc. Int. Joint algorithms, and image registration.
Conf. Neural Netw. (IJCNN), Vancouver, BC, Canada, Jul. 2006, pp.
19501957.
[26] R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Recognition, 2nd ed.
New York: Wiley, 2000.
[27] T. C. Fogarty, An incremental genetic algorithm for real-time optimi- Seong G. Kong (S89M92SM03) received the
sation, in Proc. Int. Conf. Syst., Man, Cybern., 1989, pp. 321326. B.S. and the M.S. degrees in electrical engineering
[28] A. E. Eiben and J. E. Smith, Introduction to Evolutionary Com- from Seoul National University, Seoul, Korea, in
puting. Berlin, Germany: Springer-Verlag, 2003. 1982 and 1987, respectively, and the Ph.D. degree
[29] M. Li and H.-Y. Tam, Hybrid evolutionary search method based on in electrical engineering from the University of
clusters, IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 8, pp. Southern California, Los Angeles, in 1991.
786799, Aug. 2001. From 1992 to 2000, he was an Associate Professor
[30] T. Kuo and S.-Y. Hwang, A genetic algorithm with disruptive selec- of Electrical Engineering at Soongsil University,
tion, IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 26, no. 2, pp. Seoul, Korea. He was Chair of the Department
299307, Apr. 1996. from 1998 to 2000. During 20002001, he was with
[31] T. Blickle and L. Thiele, A mathematical analysis of tournament se- School of Electrical and Computer Engineering
lection, in Proc. 6th Int. Conf. Genetic Algorithms, 1995, pp. 916. at Purdue University, West Lafayette, IN, as a Visiting Scholar. From 2002
[32] B. A. Julstrom, Its all the same to me: Revisiting rank-based proba- to 2007, he was an Associate Professor at the Department of Electrical and
bilities and tournaments, Proc. Congr. Evolut. Comput. (CEC), vol. 2, Computer Engineering, University of Tennessee, Knoxville. Currently, he is an
pp. 15011505, 1999. Associate Professor at the Department of Electrical and Computer Engineering,
[33] J. Sarma and K. D. Jong, An analysis of local selection algorithms in Temple University, Philadelphia, PA. He published more than 70 refereed
a spatially structured evolutionary algorithm, in Proc. 7th Int. Conf. journal articles, conference papers, and book chapters in the areas of image
Genetic Algorithms (ICGA), 1997, pp. 181186. processing, pattern recognition, and intelligent systems.
[34] D. P. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Dr. Kong was the Editor-in-Chief of Journal of Fuzzy Logic and Intel-
Athena Scientific, 1999. ligent Systems from 1996 to 1999. He is an Associate Editor of the IEEE
[35] S. Haykin, Neural Networks: A Comprehensive Foundation, 2nd ed. TRANSACTIONS ON NEURAL NETWORKS. He received the Award for Academic
Upper Saddle River, NJ: Prentice-Hall, 1999. Excellence from Korea Fuzzy Logic and Intelligent Systems Society in 2000
[36] D. E. Rumelhart, G. E. Hinton, and R. J. Williams, Learning internal and the Most Cited Paper Award from the Journal of Computer Vision and
representations by back-propagating errors, Nature, vol. 323, pp. Image Understanding in 2007. He is a Technical Committee member of the
533536, Oct. 1986. IEEE Computational Intelligence Society.
Authorized licensed use limited to: University of Nebraska Omaha Campus. Downloaded on July 08,2010 at 22:41:08 UTC from IEEE Xplore. Restrictions apply.