Lecture Notes in Bioinformatics
4689
Edited by S. Istrail, P. Pevzner, and M. Waterman Editorial Board: A. Apostolico S. Brunak M. Gelfand T. Lengauer S. Miyano G. Myers M.-F. Sagot D. Sankoff R. Shamir T. Speed M. Vingron W. Wong
Subseries of Lecture Notes in Computer Science
Kang Li Xin Li George William Irwin Guosen He (Eds.)
Life System Modeling and Simulation International Conference, LSMS 2007 Shanghai, China, September 14-17, 2007 Proceedings
13
Series Editors Sorin Istrail, Brown University, Providence, RI, USA Pavel Pevzner, University of California, San Diego, CA, USA Michael Waterman, University of Southern California, Los Angeles, CA, USA Volume Editors Kang Li George William Irwin Queen’s University Belfast School of Electronics, Electrical Engineering and Computer Science Ashby Building, Stranmillis Road, BT9 5AH Belfast, UK E-mail: {K.Li, g.irwin}@ee.qub.ac.uk Xin Li Guosen He Shanghai University, School of Mechatronics and Automation, China E-mail: {su_xinli, guosenhe}@yahoo.com.cn
Library of Congress Control Number: 2007933845
CR Subject Classification (1998): F.2.2, F.2, E.1, G.1, I.2, J.3 LNCS Sublibrary: SL 8 – Bioinformatics ISSN ISBN-10 ISBN-13
1865-0929 3-540-74770-2 Springer Berlin Heidelberg New York 978-3-540-74770-3 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2007 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12118502 06/3180 543210
Preface
The International Conference on Life System Modeling and Simulation (LSMS) was formed to bring together international researchers and practitioners in the field of life system modeling and simulation as well as life system-inspired theory and methodology. The concept of a life system is quite broad. It covers both micro and macro components ranging from cells, tissues and organs across to organisms and ecologic niches. These interact and evolve to produce an overall complex system whose behavior is difficult to comprehend and predict. The arrival of the 21st century has been marked by a resurgence of research interest both in arriving at a systems-level understanding of biology and in applying such knowledge in complex real-world applications. Consequently, computational methods and intelligence in systems, biology, as well as bio-inspired computational intelligence, have emerged as key drivers for new computational methods. For this reason papers dealing with theory, techniques and real-world applications relating to these two themes were especially solicited. Building on the success of a previous workshop in 2004, the 2007 International Conference on Life System Modeling and Simulation (LSMS 2007) was held in Shanghai, China, September 14–17, 2007. The conference was jointly organized by The Shanghai University, Queen's University Belfast together with The Life System Modeling and Simulation Special Interest Committee of the Chinese Association for System Simulation. The conference program offered the delegates keynote addresses, panel discussions, special sessions and poster presentations, in addition to a series of social functions to enable networking and future research collaboration. LSMS 2007 received a total of 1,383 full paper submissions from 21 countries. All these papers went through a rigorous peer-review procedure, including both prereview and formal referring. Based on the referee reports, the Program Committee finally selected 333 good-quality papers for presentation at the conference, from which 147 were subsequently selected and recommended for publication by Springer in one volume of Lecture Notes in Computer Science (LNCS) and one volume of Lecture Notes in Bioinformatics (LNBI). This particular volume of Lecture Notes in Computer Science (LNCS) includes 84 papers covering 6 relevant topics. The organizers of LSMS 2007 would like to acknowledge the enormous contributions made by the following: the Advisory Committee and Steering Committee for their guidance and advice, the Program Committee and the numerous referees worldwide for their efforts in reviewing and soliciting the papers, and the Publication Committee for their editorial work. We would also like to thank Alfred Hofmann, from Springer, for his support and guidance. Particular thanks are of course due to all the authors, as without their high-quality submissions and presentations, the LSMS 2007 conference would not have been possible. Finally, we would like to express our gratitude to our sponsor – The Chinese Association for System Simulation, – and a number of technical co-sponsors: the IEEE United Kingdom and Republic of Ireland Section, the IEEE CASS Life Science Systems and Applications Technical Committee, the IEEE CIS Singapore Chapter, the
VI
Preface
IEEE Shanghai Section for their technical co-sponsorship and the Systems and Synthetic Biology (Springer) for their financial sponsorship. The support of the Intelligent Systems and Control group at Queen’s University Belfast, Fudan University, the Shanghai Institute for Biological Sciences, the Chinese Academy of Sciences, the Shanghai Association for System Simulation, the Shanghai Association for Automation, Shanghai Association for Instrument and Control, the Shanghai Rising-star Association, the Shanghai International Culture Association, Shanghai Medical Instruments Trade Association is also acknowledged.
June 2007
Bohu Li Guosen He Mitsuo Umezu Min Wang Minrui Fei George W. Irwin Kang Li Luonan Chen Shiwei Ma
LSMS 2007 Organization
Advisory Committee Panos J. Antsaklis, USA Aike Guo, China Huosheng Hu, UK Iven Mareels, Australia Shuzhi Sam Ge, Singapore Yishan Wang, China Zhenghai Xu, China Xiangsun Zhang, China Mengchu Zhou, USA
John L. Casti, Austria Roland Hetzer, Germany Okyay Kaynak, Turkey Kwang-Hyun Park, Korea Eduardo Sontag, USA Paul Werbos, USA Hao Ying, USA Guoping Zhao, China
Joseph Sylvester Chang, Singapore Tom Heskes, Netherlands
Kwang-Hyun Cho, Korea
Seung Kee Han, Korea
Yan Hong, HK China
Fengju Kang, China Yixue Li, China Sean McLoone, Ireland Dhar Pawan, Singapore
Young J Kim, Korea Zaozhen Liu, China David McMillen, Canada Chen Kay Tan, Singapore
Stephen Thompson, UK Tianyuan Xiao, China Tianshou Zhou, China
Svetha Venkatesh, Australia Jianxin Xu, Singapore Quanmin Zhu, UK
Jenn-Kang Hwang, Taiwan China Gang Li, UK Zengrong Liu, China Yi Pan, USA Kok Kiong Tan, Singapore YuguoWeng, Germany Wu Zhang, China
Kazuyuki Aihara, Japan Zongji Chen, China Alfred Hofmann, Germany Frank L. Lewis, USA Xiaoyuan Peng, China Steve Thompson, UK Stephen Wong, USA Minlian Zhang, China Yufan Zheng, Australia
Steering Committee
Honorary Chairs Bohu Li, China Guosen He, China Mitsuo Umezu, Japan
General Chairs Min Wang, China Minrui Fei, China George W. Irwin, UK
VIII
Organization
International Program Committee IPC Chairs Kang Li, UK Luonan Chen, Japan IPC Local Chairs Luis Antonio Aguirre, Brazil Xingsheng Gu, China WanQuan Liu, Australia T.C. Yang, UK
Yongsheng Ding, China
Orazio Giustolisi, Italy
Pheng-Ann Heng, HK, China Zhijian Song, China Jun Zhang, USA
Nicolas Langlois, France Shu Wang, Singapore
IPC Members Akira Amano, Japan Ming Chen, China Xiaochun Cheng, UK Patrick Connally, UK Huijun Gao, China Ning Gu, China Liqun Han, China Guangbin Huang, Singapore Ping Jiang, UK
Vitoantonio Bevilacqua, Italy Zengqiang Chen, China Minsen Chiu, Singapore Rogers Eric, UK Xiaozhi Gao, Finland Weihua Gui, China Jiehuan He, China Sunan Huang, Singapore
Weidong Cai, Australia Wushan Cheng, China Sally Clift, UK Haiping Fang, China Zhinian Gao, China Lingzhong Guo, UK Liangjian Hu, China Peter Hung, Ireland
Prashant Joshi, Austria
Abderrafiaa Koukam, France Keun-Woo Lee, Korea Jun Li, Singapore Xiaoou Li, Mexico Guoqiang Liu, China Junfeng Liu, USA Zuhong Lu, China Kezhi Mao, Singapore Carlo Meloni, Italy Manamanni Noureddine, France Girijesh Prasad, UK
Xuecheng Lai, Singapore
Tetsuya J Kobayashi, Japan Ziqiang Lang, UK
Raymond Lee, UK Shaoyuan Li, China Yunfeng Li, China Han Liu, China Mandan Liu, China Guido Maione, Italy Marco Mastrovito, Italy Zbigniew Mrozek, Poland Philip Ogunbona, Australia
Donghai Li, China Wanqing Li, Australia Paolo Lino, Italy Julian Liu, UK Wei Lou, China Fenglou Mao, USA Marion McAfee, UK Antonio Neme, Mexico Jianxun Peng, UK
Yixian Qin, USA
Wei Ren, China
Organization
Qiguo Rong, China Ziqiang Sun, China Nigel G Ternan, UK Bing Wang, UK Ruiqi Wang, Japan Xiuying Wang, Australia Guihua Wen, China Lingyun Wu, China Qingguo Xie, China Jun Yang, Singapore Ansheng Yu, China Jingqi Yuan, China Jun Zhang, USA Cishen Zhang, Singapore Yisheng Zhu, China
Da Ruan, Belgium Sanjay Swarup, Singapore Shanbao Tong, China Jihong Wang, UK Ruisheng Wang, Japan Yong Wang, Japan
Chenxi Shao, China Shin-ya Takane, Japan Gabriel Vasilescu, France Ning Wang, China Xingcheng Wang, China Zhuping Wang, Singapore
Peter A. Wieringa, Netherlands Xiaofeng Wu, China Meihua Xu, China Tao Yang, USA Weichuan Yu, HK China Dong Yue, China Yi Zhang, China Xingming Zhao, Japan
Guangqiang Wu, China Hong Xia, UK Zhenyuan Xu, China Maurice Yolles, UK Wen Yu, Mexico Zhoumo Zeng, China Zuren Zhang, China Huiyu Zhou, UK
Secretary General Shiwei Ma, China Ping Zhang, China
Co-Secretary-General Li Jia, China Qun Niu, China Banghua Yang, China
Lixiong Li, China Yang Song, China
Publication Chairs Xin Li, China Sanjay Swarup, Singapore
Special Session Chair Hai Lin, Singapore
IX
Xin Li, China Ling Wang, China
X
Organization
Organizing Committee OC Chairs Jian Wang, China Yunjie Wu, China Zengrong Liu, China Yuemei Tan, China OC Co-chairs Tingzhang Liu, China Shiwei Ma, China Weiyi Wang, China Xiaojin Zhu, China OC Members Jian Fan, China Zhihua Li, China Zhongjie Wang, China
Weiyan Hou, China Hai Lin, Singapore Lisheng Wei, China
Aimei Huang, China Xin Sun, China Xiaolei Xia, UK
Reviewers Jean-Francois Arnold Xiaojuan Ban Leonora Bianchi Mauro Birattari Ruifeng Bo Jiajun Bu Dongsheng Che Fei Chen Feng Chen Guochu chen Hang Chen Mingdeng Chen Lijuan Chen Zengqiang Chen Cheng Cheng Guojian Cheng Jin Cheng Maurizio Cirrincione Patrick Connally Marco Cortellino
Jean-Charles Creput Shigang Cui Dan Diaper Chaoyang Dong Guangbo Dong Shuhai Fan Lingshen Fang Dongqing Feng Hailin Feng Zhanshen Feng Cheng Heng Fua Jie Gao Padhraig Gormley Jinhong Gu Lan Guo Qinglin Guo Yecai Guo Yu Guo Dong-Han Ham Zhang Hong
Aimin Hou Yuexian Hou Jiangting Hu Qingxi Hu Wenbin Hu Xianfeng Huang Christian Huyck George W. Irwin Yubin Ji Li Jian Shaohua Jiang Guangxu Jin Hailong Jin Xinsheng Ke Mohammad Khalil Yohei Koyama Salah Laghrouche Usik Lee Chi-Sing Leung Gun Li
Organization
Honglei Li Kan Li Kang Li Ning Li Xie Li Yanbo Li Yanyan Li Zhonghua Li Xiao Liang Xiaomei Lin Binghan Liu Chunan Liu Hongwei Liu Junfang Liu Lifang Liu Renren Liu Wanquan Liu Weidong Liu Xiaobing Liu Xiaojie Liu Xuxun Liu Yumin Liu Zhen Liu Zhiping Liu Xuyang Lou Tao Lu Dajie Luo Fei Luo Suhuai Luo Baoshan Ma Meng Ma Xiaoqi Ma Quentin Mair Xiong Men Zhongchun Mi Claude Moog Jin Nan Jose Negrete Xiangfei Nie Xuemei Ning Dongxiao Niu Jingchang Pan Paolo Pannarale Konstantinos Pataridis Jianxun Peng Son Lam Phung Xiaogang Qi
Chaoyong Qin peng qin Zhaohui Qin Lipeng Qiu Yuqing Qiu Yi Qu Qingan Ren Didier Ridienger Giuseppe Romanazzi R Sanchez Jesus Savage Ssang-Hee Seo Tao Shang Zichang Shangguan Chenxi Shao JeongYon Shim Chiyu Shu Yunxing Shu Vincent Sircoulomb Anping Song Chunxia Song Guanhua Song Yuantao Song Yan Su Yuheng Su Suixiulin Shibao Sun Wei Sun Da Tang Pey Yuen Tao Shen Tao Keng Peng Tee Jingwen Tian Han Thanh Trung Callaghan Vic Ping Wan Hongjie Wang Kundong Wang Lei Wang Lin Wang Qing Wang Qingjiang Wang Ruisheng Wang Shuda Wang Tong Wang Xiaolei Wang Xuesong Wang
Ying Wang Zhelong Wang Zhongjie Wang Hualiang Wei Liang Wei Guihua Wen Qianyong Weng Xiangtao Wo Minghui Wu Shihong Wu Ting Wu Xiaoqin Wu Xintao Wu Yunna Wu Zikai Wu Chengyi Xia Linying Xiang Xiaolei Xia Yougang Xiao Jiang Xie Jun Xie Xiaohui Xie Lining Xing Guangning Xu Jing Xu Xiangmin Xu Xuesong Xu Yufa Xu Zhiwen Xu Qinghai Yang Jin Yang Xin Yang Yinhua Yang Zhengquan Yang Xiaoling Ye Changming Yin Fengqin Yu Xiaoyi Yu Xuelian Yu Guili Yuan Lulai Yuan Zhuzhi Yuan Peng Zan Yanjun Zeng Chengy Zhang Kai Zhang Kui Zhang
XI
XII
Organization
Hongjuan Zhang Hua Zhang Jianxiong Zhang Limin Zhang Lin Zhang Ran Zhang Xiaoguang Zhang Xing Zhang
Haibin Zhao Shuguang Zhao Yi Zhao Yifan Zhao Yong Zhao Xiao Zheng Yu Zheng Hongfang Zhou
Huiyu Zhou Qihai Zhou Yuren Zhou Qingsheng Zhu Xinglong Zhu Zhengye Zhu Xiaojie Zong
Table of Contents
The First Section: Modeling and Simulation of Societies and Collective Behavior Phase Synchronization of Circadian Oscillators Induced by a Light-Dark Cycle and Extracellular Noise . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ying Li, Jianbao Zhang, and Zengrong Liu
1
Detecting RNA Sequences Using Two-Stage SVM Classifier . . . . . . . . . . . Xiaoou Li and Kang Li
8
Frequency Synchronization of a Set of Cells Coupled by Quorum Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jianbao Zhang, Zengrong Liu, Ying Li, and Luonan Chen
21
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Min Xu, Yongsheng Ding, and Liangjian Hu
28
Simulation of Artificial Life of Bee’s Behaviors . . . . . . . . . . . . . . . . . . . . . . . Bin Wu, Hongying Zhang, and Xia Ni
38
Hybrid Processing and Time-Frequency Analysis of ECG Signal . . . . . . . Ping Zhang, Chengyuan Tu, Xiaoyang Li, and Yanjun Zeng
46
Robust Stability of Human Balance Keeping . . . . . . . . . . . . . . . . . . . . . . . . Minrui Fei, Lisheng Wei, and Taicheng Yang
58
Modelling Pervasive Environments Using Bespoke and Commercial Game-Based Simulators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Marc Davies, Vic Callaghan, and Liping Shen
67
The Research of Artificial Animal’s Behavior Memory Based on Cognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiaojuan Ban, Shurong Ning, Jing Shi, and Dongmei Ai
78
The Second Section: Computational Methods and Intelligence in Biomechanical Systems, Tissue Engineering and Clinical Bioengineering How to Ensure Safety Factors in the Development of Artificial Heart: Verified by the Usage of “Modeling and Simulation” Technology . . . . . . . Mitsuo Umezu
88
XIV
Table of Contents
Parametric-Expression-Based Construction of Interior Features for Tissue Engineering Scaffold with Defect Bone . . . . . . . . . . . . . . . . . . . . . . . Chunxiang Dai, Qingxi Hu, and Minglun Fang Computation of Uniaxial Modulus of the Normal and Degenerated Articular Cartilage Using Inhomogeneous Triphasic Model . . . . . . . . . . . . Haijun Niu, Qing Wang, Yongping Zheng, Fang Pu, Yubo Fan, and Deyu Li Effect of the Plantar Ligaments Injury on the Longitudinal Arch Height of the Human Foot . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yunfeng Yang, Guangrong Yu, Wenxin Niu, Jiaqian Zhou, Yanxi Chen, Feng Yuan, and Zuquan Ding Internet Living Broadcast of Medical Video Stream . . . . . . . . . . . . . . . . . . Shejiao Li, Bo Li, and Fan Zhang Predicting Syndrome by NEI Specifications: A Comparison of Five Data Mining Algorithms in Coronary Heart Disease . . . . . . . . . . . . . . . . . . Jianxin Chen, Guangcheng Xi, Yanwei Xing, Jing Chen, and Jie Wang Application of Image Processing and Finite Element Analysis in Bionic Scaffolds’ Design Optimizing and Fabrication . . . . . . . . . . . . . . . . . . . . . . . . Liulan Lin, Huicun Zhang, Yuan Yao, Aili Tong, Qingxi Hu, and Minglun Fang The Mechanical Properties of Bone Tissue Engineering Scaffold Fabricating Via Selective Laser Sintering . . . . . . . . . . . . . . . . . . . . . . . . . . . . Liulan Lin, Aili Tong, Huicun Zhang, Qingxi Hu, and Minglun Fang
97
104
111
120
129
136
146
The Third Section: Computational Intelligence in Bioinformatics and Biometrics Informational Structure of Agrobacterium Tumefaciens C58 Genome . . . Zhihua Liu and Xiao Sun
153
Feature Extraction for Cancer Classification Using Kernel-Based Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shutao Li and Chen Liao
162
A New Hybrid Approach to Predict Subcellular Localization by Incorporating Protein Evolutionary Conservation Information . . . . . . . . . ShaoWu Zhang, YunLong Zhang, JunHui Li, HuiFeng Yang, YongMei Cheng, and GuoPing Zhou
172
Table of Contents
Support Vector Machine for Prediction of DNA-Binding Domains in Protein-DNA Complexes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jiansheng Wu, Hongtao Wu, Hongde Liu, Haoyan Zhou, and Xiao Sun
XV
180
Feature Extraction for Mass Spectrometry Data . . . . . . . . . . . . . . . . . . . . . Yihui Liu
188
An Improved Algorithm on Detecting Transcription and Translation Motif in Archaeal Genomic Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Minghui Wu, Xian Chen, Fanwei Zhu, and Jing Ying
197
Constructing Structural Alignment of RNA Sequences by Detecting and Assessing Conserved Stems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiaoyong Fang, Zhigang Luo, Bo Yuan, Zhenghua Wang, and Fan Ding
208
Iris Verification Using Wavelet Moments and Neural Network . . . . . . . . . . Zhiqiang Ma, Miao Qi, Haifeng Kang, Shuhua Wang, and Jun Kong
218
Comprehensive Fuzzy Evaluation Model for Body Physical Exercise Risk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yizhi Wu, Yongsheng Ding, and Hongan Xu
227
The Fourth Section: Brain Stimulation, Neural Dynamics and Neural Interfacing The Effect of Map Information on Brain Activation During a Driving Task . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tao Shang, Shuoyu Wang, and Shengnan Zhang
236
Worm 5: Pseudo-organics Computer and Natural Live System . . . . . . . . . Yick Kuen Lee and Ying Ying Lee
246
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics of Coupled Neurons . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jiang Wang, Xiumin Li, and Dong Feng
254
Distinguish Different Acupuncture Manipulations by Using Idea of ISI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jiang Wang, Wenjie Si, Limei Zhong, and Feng Dong
264
The Study on Internet-Based Face Recognition System Using PCA and MMD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jong-Min Kim
274
Simulation of Virtual Human’s Mental State in Behavior Animation . . . . Zhen Liu
284
XVI
Table of Contents
Hemodynamic Analysis of Cerebral Aneurysm and Stenosed Carotid Bifurcation Using Computational Fluid Dynamics Technique . . . . . . . . . . Yi Qian, Tetsuji Harada, Koichi Fukui, Mitsuo Umezu, Hiroyuki Takao, and Yuichi Murayama
292
Active/Inactive Emotional Switching for Thinking Chain Extraction by Type Matching from RAS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . JeongYon Shim
300
Pattern Recognition for Brain-Computer Interfaces by Combining Support Vector Machine with Adaptive Genetic Algorithm . . . . . . . . . . . . Banghua Yang, Shiwei Ma, and Zhihua Li
307
The Fifth Section: Biological and Biomedical Data Integration, Mining and Visualization Improved Locally Linear Embedding by Cognitive Geometry . . . . . . . . . . Guihua Wen, Lijun Jiang, and Jun Wen
317
Predicting the Free Calcium Oxide Content on the Basis of Rough Sets, Neural Networks and Data Fusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yunxing Shu, Shiwei Yun, and Bo Ge
326
Classification of Single Trial EEG Based on Cloud Model for Brain-Computer Interfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shaobin Li and Chenxi Shao
335
The Modified Self-organizing Fuzzy Neural Network Model for Adaptability Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zuohua Miao, Hong Xu, and Xianhua Wang
344
Predicting Functional Protein-Protein Interactions Based on Computational Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Luwen Zhang and Wu Zhang
354
The Chaos Model Analysis Based on Time-Varying Fractal Dimension . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jianrong Hou, Dan Huang, and Hui Zhao
364
Bi-hierarchy Medical Image Registration Based on Steerable Pyramid Transform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiuying Wang and David Feng
370
Table of Contents
XVII
The Sixth Section: Computational Methods and Intelligence in Organism Modeling and Biochemical Networks and Regulation A Multiagent Quantum Evolutionary Algorithm for Global Numerical Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chaoyong Qin, Jianguo Zheng, and Jiyu Lai
380
Developing and Optimizing a Finite Element Model of Phalange Using CT Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Qingxi Hu, Quan Zhang, and Yuan Yao
390
Reverse Engineering Methodology in Broken Skull Surface Model Reconstruction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Luyue Ju, Gaojian Zhong, and Xia Liu
399
Identification and Application of Nonlinear Rheological Characteristics of Oilseed Based on Artificial Neural Networks . . . . . . . . . . . . . . . . . . . . . . . Xiao Zheng, Guoxiang Lin, Dongping He, Jingzhou Wang, and Yan You
406
Prediction of Death Rate of Breast Cancer Induced from Average Microelement Absorption with Neural Network . . . . . . . . . . . . . . . . . . . . . . Shouju Li, Jizhe Wang, Yingxi Liu, and Xiuzhen Sun
414
An Adaptive Classifier Based on Artificial Immune Network . . . . . . . . . . . Zhiguo Li, Jiang Zhong, Yong Feng, and ZhongFu Wu
422
Investigation of a Hydrodynamic Performance of a Ventricular Assist Device After Its Long-Term Use in Clinical Application . . . . . . . . . . . . . . . Yuma Kokuzawa, Tomohiro Shima, Masateru Furusato, Kazuhiko Ito, Takashi Tanaka, Toshihiro Igarashi, Tomohiro Nishinaka, Kiyotaka Iwasaki, and Mitsuo Umezu
429
The Seventh Section: Computational Methods and Intelligence in Modeling of Molecular, Cellular, Multi-cellular Behavior and Design of Synthetic Biological Systems QSAR and Molecular Docking Study of a Series of Combretastatin Analogues Tubulin Inhibitors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yubin Ji, Ran Tian, and Wenhan Lin
436
A Software Method to Model and Fabricate the Defective Bone Repair Bioscaffold Using in Tissue Engineering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Qingxi Hu, Hongfei Yang, and Yuan Yao
445
XVIII
Table of Contents
Using Qualitative Technology for Modeling the Process of Virus Infection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hailin Feng and Chenxi Shao
453
AOC-by-Self-discovery Modeling and Simulation for HIV . . . . . . . . . . . . . . Chunxiao Zhao, Ning Zhong, and Ying Hao
462
A Simulation Study on the Encoding Mechanism of Retinal Ganglion Cell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chao-Feng Cai, Pei-Ji Liang, and Pu-Ming Zhang
470
Modelling the MAPK Signalling Pathway Using a Two-Stage Identification Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Padhraig Gormley, Kang Li, and George W. Irwin
480
The Eighth Section: Others Design and Path Planning for a Remote-Brained Service Robot . . . . . . . . Shigang Cui, Xuelian Xu, Zhengguang Lian, Li Zhao, and Zhigang Bing
492
Adaptive Fuzzy Sliding Mode Control of the Model of Aneurysms of the Circle of Willis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Peijun Ju, Guocai Liu, Li Tian, and Wei Zhang
501
Particle Swarm Optimization Applied to Image Vector Quantization . . . . Xubing Zhang, Zequn Guan, and Tianhong Gan
507
Face Detection Based on BPNN and Wavelet Invariant Moment in Video Surveillance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hongji Lin and Zhengchun Ye
516
Efficient Topological Reconstruction for Medical Model Based on Mesh Simplification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chunxiang Dai, Ying Jiang, Qingxi Hu, Yuan Yao, and Hongfei Yang
526
Repetitive Motion Planning of Redundant Robots Based on LVI-Based Primal-Dual Neural Network and PUMA560 Example . . . . . . . . . . . . . . . . Yunong Zhang, Xuanjiao Lv, Zhonghua Li, and Zhi Yang
536
Tensile Test to Ensure a Safety of Cannula Connection in Clinical Ventricular Assist Device (VAD) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Takashi Tanaka, Tomohiro Shima, Masateru Furusato, Yuma Kokuzawa, Kazuhiko Ito, Kiyotaka Iwasaki, Yi Qian, and Mitsuo Umezu
546
Table of Contents
A Reproduction of Inflow Restriction in the Mock Circulatory System to Evaluate a Hydrodynamic Performance of a Ventricular Assist Device in Practical Conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Masateru Furusato, Tomohiro Shima, Yuma Kokuzawa, Kazuhiko Ito, Takashi Tanaka, Kiyotaka Iwasaki, Yi Qian, Mitsuo Umezu, ZhiKun Yan, and Ling Zhu Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
XIX
553
559
Phase Synchronization of Circadian Oscillators Induced by a Light-Dark Cycle and Extracellular Noise Ying Li1 , Jianbao Zhang1 , and Zengrong Liu2 1
2
Department of Mathematics, Shanghai University, 200444 Shanghai, China
[email protected] Institute of Systems Biology, Shanghai University, 200444 Shanghai, China
[email protected]
Abstract. In mammals, the master circadian pacemaker is considered the suprachiasmatic nucleus (SCN) of the hypothalamus. Individual cellular clocks in SCN, the circadian center, are integrated into a stable and robust pacemaker with a period length of about 24 hours, which are remarkably accurate at timing biological events despite the randomness of their biochemical reactions. In this paper, we study the effect of the Light-Dark cycle and environment noise on the daily rhythms of mammals and give some numerical analysis. The results show that the environment noise makes for phase synchronization but it can not make the oscillators get phase synchronization with period of 24-h. On the contrary, the threshold of the strength of light that makes the oscillators to get the phase synchronization with period of 24-h with environment noise is larger than that in the case without environment noise.
1
Introduction
Circadian rhythms are observed in the physiology of mammals and other higher organisms. In mammals, physiological and behavioral circadian rhythms are controlled by a pacemaker located in the suprachiasmatic nucleus(SCN) of the hypothalamus[1,2]. SCN consists of 16000 neurons arranged in a symmetric bilateral structure, and it is generally believed that each isolated SCN neuron behaves as an oscillator by itself. It has been shown that isolated individual neurons are able to produce circadian oscillations, with periods ranging from 20 to 28 hours[3,4]. Daily rhythms in behavior, physiology and metabolism are controlled by endogenous circadian clocks. At the heart of these clocks is a circadian oscillator that keeps circadian time. There are many factors that entrain circadian oscillators such as the intercellular coupling, a 24-h LD cycle and intercellular and extracellular noise and the structure of SCN. In this article, we mainly analyze the effect of a 24-h LD cycle and the environment noise. Firstly, a mathematical model to describe the behavior of a population of SCN neurons is presented. The single cell oscillator is described by a K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 1–7, 2007. c Springer-Verlag Berlin Heidelberg 2007
2
Y. Li, J. Zhang, and Z. Liu
three-variable model similar to the widely used Goodwin model that was able to simulate physiological oscillations on the basis of a negative feedback. This model, based on the negative feedback loop, accounts for the core molecular mechanism leading to self-sustained oscillations of clock genes. Then under the condition to have periodic solution, we show that, the models of cells with different parameter values, their individual periods are different. Our attention is mainly focused on the analysis and comparison of their effects on the circadian oscillator from numerical viewpoint. The result of this paper is that the environment noise can make for phase synchronization but it increases the threshold of the strength of light to make the oscillators synchronize to 24-h compared to the case without noise and the 24-h LD cycle plays the crucial role on entraining the 24-h clocks.
2
Model of Self-sustained Oscillation in a SCN Neuron
To simulate circadian oscillations in single mammalian cells, we resort to a threevariable model, based on the Goodwin oscillator[5]. In this model, a clock gene mRNA (X ) produces a clock protein (Y ) which, in turn, actives a transcriptional inhibitor (Z ). The latter inhibits the transcription of the clock gene, closing a negative feedback loop. In circadian clocks, protein degradation is controlled by phosphorylation, ubiquitination and proteasomal degradation and thus it is reasonable to assume Michaelian kinetics. Here,we advise the model of an individual cell as following: ⎧ K1n X ⎪ ⎨ X˙ = v1 K1n +Z n − v2 K2 +X , (1) Y˙ = k3 X − v4 K4Y+Y , ⎪ ⎩ ˙ Z = k5 Y − v6 K6Z+Z . where v1 , v2 , v4 , v6 , K1 , K2 , K4 , K6 , k3 , k5 are parameters. In this version, self-sustained oscillation can be obtained for a Hill coefficient of n = 4. The variable X represents mRNA concentration of a clock gene, per or cry; Y is the resulting protein, PER or CRY; and Z is the active protein or the nuclear form of the protein(inhibitor). This model is closely related to those proposed by Ruoff and Rensing[7], Leloup and co-workers[6], or Ruoff and co-workers[8] for the circadian clock in Neurospora. In [10], we analyzed the dynamics of model (1) for which we gave the sufficient conditions to be a self-sustained oscillator. Now, we consider the multi-cell system under the effect of 24-h LD cycle and environment noise. The evolution equations for the population composed of N oscillators(denoted by i = 1, 2, ..., N ) are then written as ⎧ K1n Xi ⎪ ⎨ X˙ i = v1 K1n +Zin − v2 K2 +Xi + L + Dξi , i (2) Y˙i = k3 Xi − v4 K4Y+Y , i ⎪ ⎩ ˙ Zi Zi = k5 Yi − v6 K6 +Zi . L is a square-wave function which reflects the effect of a LD cycle. The term L switches from L = 0 in dark phase to L = L0 in light phase. That is to say
Phase Synchronization of Circadian Oscillators
L(t) =
L0 t ∈ [24k, 24k + 12), 0 t ∈ [24k + 12, 24(k + 1)),
3
(3)
where k is a natural number. The parameter D describes the strength of noise. ξi , called as extracellular noises representing external noises originated outside the cells due to environment perturbations, are assumed as independent Gaussian white noises with zero mean < ξi (t) >= 0 and covariances < ξi (t), ξj (t ) >= δ(t − t ).
3
The Main Results
In paper [10], we proved theoretically that the oscillators can get phase synchronization with period of 24-h under the effect of the 24-h LD cycle as if the strength of light was large enough. Here we invest the effect of the environment noises. When L0 = D = 0, system Eq.(2) is exactly the self-sustained oscillators of individual cells. Here we consider 20 cells that is to say N = 20. The values of parameters consult Ref.[9]. From Fig.1, we can see that the twenty self-sustained oscillators have different periods ranging from 20-h to 30-h. Now we consider the effect of environment noise that is to say D = 0. The simulation shows that the extracellular noise makes for phase synchronization(See Fig.3). But at the same time, the noise increases the threshold of L0 that makes the oscillators get phase synchronization with period of 24-h compared to the case without noise, which is verified by Fig.3-6. Fig.3 shows that the noise makes the oscillators to get phase synchronization but their periods are not 24-h. At the same time the light is added, when L0 = 0.01 the oscillators can not get the phase synchronization with period of 24-h while they can without 0.25
Variable X for 20 oscillators
0.2
0.15
0.1
0.05
1
1.002
1.004
1.006 Time(h)
1.008
1.01
1.012 4
x 10
Fig. 1. The time evolution of variable X for 20 oscillators, when L0 = D = 0
4
Y. Li, J. Zhang, and Z. Liu 0.4
0.35
L and Variable X for 20 oscillators
0.3
0.25
0.2
0.15
0.1
0.05
0
1
1.002
1.004
1.006 Time(h)
1.008
1.01
1.012 4
x 10
Fig. 2. The time evolution of L and variable X for 20 oscillators, when L0 = 0.02 and D=0 1
0.9
0.8
Variable X for 20 oscillators
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
2
2.002
2.004
2.006 Time(h)
2.008
2.01
2.012 4
x 10
Fig. 3. The time evolution of variable X for 20 oscillators, when L0 = 0 and D = 0.1
noise. With the increase of L0 , the periods of these synchronized oscillators approach 24-h gradually. Until L0 ≥ 0.2 with noise, these oscillators get the phase synchronization with period of 24-h. That is to say the threshold is increased greatly. When only the 24-h LD cycle is added, from paper [10], we know that as long as L0 is large enough, these oscillators can get phase synchronization and their periods are all 24-h. Our simulation results show that when L0 ≥ 0.015, the phase synchronization with period of 24-h is got(See Fig.2).
Phase Synchronization of Circadian Oscillators
5
0.8
0.7
L and variable X for 20 oscillators
0.6
0.5
0.4
0.3
0.2
0.1
0
1
1.002
1.004
1.006 Time(h)
1.008
1.01
1.012 4
x 10
Fig. 4. The time evolution of L and variable X for 20 oscillators, when L0 = 0.01 and D = 0.1 1
0.9
L and variable X for 20 oscillators
0.8
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
1
1.002
1.004
1.006 Time(h)
1.008
1.01
1.012 4
x 10
Fig. 5. The time evolution of L and variable X for 20 oscillators, when L0 = 0.1 and D = 0.1
From the Fig.1-6, we get a summary result that the extracellular noise and the 24-h LD cycle can accelerate phase synchrony of oscillators with different respective periods. But only the 24-h LD cycle can entrain the 24-h circadian clocks of the population of cells and the extracellular noise increases the threshold of the strength of light that makes the oscillators to get phase synchronization with period of 24-h.
6
Y. Li, J. Zhang, and Z. Liu 2
1.8
L and variable X for 20 oscillators
1.6
1.4
1.2
1
0.8
0.6
0.4
0.2
0
1
1.002
1.004
1.006 Time(h)
1.008
1.01
1.012 4
x 10
Fig. 6. The time evolution of L and variable X for 20 oscillators, when L0 = 0.2 and D = 0.1
4
Discussion and Conclusions
In this letter, we have introduced a molecular model for the regulatory network underlying the circadian oscillations in the SCN. We analyze the effect of the 24h LD cycle and extracellular noise numerically. From these numerical simulation we can see that the 24-h LD plays a crucial role in entraining the circadian clocks 24-h which accords with the biologic experiments. The results of this paper establish quantitative basis for understanding the essential cooperative dynamics. The effect of intercellular coupling and the SCN structure will be discussed later. Acknowledgments. This research is supported by the NNSF of China (Grants: 70431002) and Innovation Foundation of Shanghai University for Postgraduates. We express special thanks.
References 1. Reppert, S.M., Weaver, D.R.: Coordination of circadian timing in mammals. Nature 418, 935–941 (2002) 2. Moore, R.Y., Speh, J.C., Leak, R.K.: Suprachiasmatic nucleus organizarion. Cell Tissue Res. 309, 89–98 (2002) 3. Welsh, D.K., Logothetis, D.E., Meister, M., Reppert, S.M.: Individual neurons dissociated from rat suprachiasmatic nucleus express independently phased circadian firing rhythms. Neuron 14, 697–706 (1995) 4. Honma, S., Nakamura, W., Shirakawa, T., Honma, K.: Diversity in the circadian periods of single neurons of the rat suprachiasmatic nucleus on nuclear structure and intrinsic period. Neurosci. Lett. 358, 173–176 (2004)
Phase Synchronization of Circadian Oscillators
7
5. Goodwin, B.C.: Oscillatory behavior in enzymatic control processes. Adv. Enzyme Regul. 3, 425–438 (1965) 6. Leloup, J., Gonze, C.D., Goldbeter, A.: Limit cycle models for circadian rhythms based on thanscriptional regulation in Drosophila and Neurospora. J. Bilo. Rhy. 14, 433–448 (1999) 7. Rouff, P., Rensing, L.: The temperature-conpensated Goodwin model simulates many circadian clock properties. J. Theor. Biol. 179, 275–285 (1996) 8. Rouff, P., Vinsjevik, M., Monnerjahn, C., Rensing, L.: The Goodwin model: simulating the effect of light pulses on the circadian sporulation rhythm of Neurospora crassa. J. Theor. Biol. 209, 29–42 (2001) 9. Didier, G., Bernard, S., Waltermann, C., Kramer, A., Herzel, H.: Spontaneous synchronization of coupled circadian oscillators. Biophysical J. 89, 120–129 (2005) 10. Li, Y., Zhang, J.B., Liu, Z.R.: Circadian oscillators and phase synchronization under a light-dark cycle. Int. J. Nonlinear Science 1(3), 131–138 (2006)
Detecting RNA Sequences Using Two-Stage SVM Classifier Xiaoou Li1 and Kang Li2 1
2
Departamento de Computaci´ on CINVESTAV-IPN A.P. 14-740, Av.IPN 2508, M´exico D.F., 07360, M´exico School of Electronics, Electrical Engineering and Computer Science Queen’s University Belfast Ashby Building, Stranmillis Road, Belfast, BT9 5AH, UK
[email protected]
Abstract. RNA sequences detection is time-consuming because of its huge data set size. Although SVM has been proved to be useful, normal SVM is not suitable for classification of large data sets because of its high training complexity. A two-stage SVM classification approach is introduced for fast classifying large data sets. Experimental results on several RNA sequences detection demonstrate that the proposed approach is promising for such applications.
1
Introduction
RNA plays many important biological roles other than as a transient carrier of amino acid sequence information [14]. It catalyzes peptide bond formation, participates in protein localization, serves in immunity, catalyzes intron splicing and RNA degradation, serves in dosage compensation. It is also an essential subunit in telomeres, guides RNA modification, controls development, and has an abundance of other regulatory functions [29]. Non-coding RNAs (ncRNAs) are transcripts that have function without being translated to protein [12]. The number of known ncRNAs is growing quickly, and their significance had been severely underestimated in classic models of cellular processes. It is desirable to develop high-throughput methods for discovery of novel ncRNAs for greater biological understanding and for discovering candidate drug targets. However, novel ncRNAs are difficult to detect in conventional biochemical screens. They are frequently short, often not polyadenylic, and might only be expressed under specific cellular conditions. Experimental screens have found many ncRNAs, but have demonstrated that no single screen is capable of discovering all known ncRNAs for an organism. A more effective approach, demonstrated in previous studies [2,28], may be to first detect ncRNA candidates computationally, then verify them biochemically. Considering the number of available whole genome sequences, SVM can be applied to a large and diverse data set, and has massive potential for novel ncRNA discovery[21,27]. However, long training K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 8–20, 2007. c Springer-Verlag Berlin Heidelberg 2007
Detecting RNA Sequences Using Two-Stage SVM Classifier
9
time is needed. Therefore, it is impossible to repeat the SVM classification on the updated data set in an acceptable time when new data are included into the data set frequently or continuously. Many researchers have tried to find possible methods to apply SVM classification for large data sets. Generally, these methods can be divided into two types: 1) modify SVM algorithm so that it could be applied to large data sets, and 2) select representative training data from a large data set so that a conventional SVM could handle. For the first type, a standard projected conjugate gradient (PCG) chunking algorithm can scale somewhere between linear and cubic in the training set size [8,16]. Sequential Minimal Optimization (SMO) is a fast method to train SVM [23,7]. Training SVM requires the solution of QP optimization problem. SMO breaks this large QP problem into a series of smallest possible QP problems, it is faster than PCG chunking. [10] introduced a parallel optimization step where block diagonal matrices are used to approximate the original kernel matrix so that SVM classification can be split into hundreds of subproblems. A recursive and computational superior mechanism referred as adaptive recursive partitioning was proposed in [17], where the data is recursively subdivided into smaller subsets. Genetic programming is able to deal with large data sets that do not fit in main memory [11]. Neural networks technique can also be applied for SVM to simplify the training process [15]. For the second type, clustering has been proved to be an effective method to collaborate with SVM on classifying large data sets. For examples, hierarchical clustering [31,1], k-means cluster [4] and parallel clustering [7]. Clustering based methods can reduce the computations burden of SVM, however, the clustering algorithms themselves are still complicated for large data set. Rocchio bundling is a statistics-based data reduction method [25]. The Bayesian committee machine is also reported to be used to train SVM on large data sets, where the large data set is divided into m subsets of the same size, and m models are derived from the individual sets [26]. But, it has higher error rate than normal SVM and the sparse property does not hold. Falling into the second type of SVM classification methods for large data sets, a two stages SVM classification approach has been proposed in our previous work[4,5,18]. At first, we select representative training data from the original data set using the results of clustering, and these selected data are used to train the first stage SVM. Note that the first stage SVM is not precise enough because of the great reduction on original data set. So we use a second stage SVM to refine the classification. The obtained support vectors of the first stage SVM are used to select data for the second stage SVM by recovering their clustermates (we call the process de-clustering). At last, the second stage SVM is applied on those de-clustered data. Our experimental results show that the accuracy obtained by our approach is very close to the classic SVM methods, while the training time is significantly shorter. Furthermore, the proposed approach can be applied on huge data sets regardless of their dimensionality. In this paper, we apply our approach on several RNA sequences data sets. The rest of the paper is organized as follows: Section II introduces our two
10
X. Li and K. Li
stages SVM classifier. Section III show the experiment results on RNA sequence detection with comparisons with other well known classifiers. Conclusion is given in Section IV.
2
Two-Stage SVM Classifier
By the sparse property of SVM, data samples which are not support vectors will not contribute the optimal hyperplane. The input data sets which are far away from the decision hyperplane should be eliminated, meanwhile the data sets which are possibly support vectors should be used. In this paper, we select the cluster centers and data of mix-labeled clusters as training data for the first stage SVM. We believe these data are the most useful and representative in a large data set for finding support vectors. Nota that, the training data set in the first stage SVM classification is only a small percentage of the original data. Data of the clusters near the hyperplane are not used totally for training SVM, since we only select the cluster centers. This may affect the classification precision, i.e., the obtained decision hyperplane may not be precise enough. However, at least it gives us a reference on data distribution. According to above analysis, we make the following modification on the training data set of the first stage SVM. 1). Remove the data far from the hyperplane from the training data set because they will not contribute to find the support vectors, 2). Retain the data of the mix-labeled clusters since they are more likely support vectors. 3). Additionally, we add the data of the clusters whose centers are support vectors of the first stage SVM. In general, our approach consists of the four steps which are shown in Figure 1: 1) data selection, 2) the first stage SVM classification, 3) de-clustering, 4) the second stage SVM classification. The following subsections will give a detailed explanation on each step. 2.1
Selecting Training Data
The goal of clustering is to separate a finite number of unlabeled items into a finite and discrete set of “natural” hidden data structures, such that items in the same cluster are more similar to each other, and those in different clusters tend to be dissimilar according to certain measure of similarity or proximity. A large number of clustering methods have been developed, e.g., squared error-based kmeans [3], fuzzy C-means [22], kernel-base clustering [13]. By our experience, fuzzy C-means clustering, Minimum enclosing ball(MEB) clustering and random selection have been proved very effective for selecting training data for the first stage SVM.[4,5,18] Let l be the cluster number, then the process of clustering is to find l partitions (or clusters) Ωi from input data set X, i = 1, . . . , l, l < n, Ωi = ∅, ∪li=1 Ωi = X.
Detecting RNA Sequences Using Two-Stage SVM Classifier
11
Fig. 1. Two-stage SVM classification
Note that the data in a cluster may have same label (positive or negative) or different labels (both positive and negative). The obtained clusters can be classified into three types: 1) clusters with only positive labeled data, denoted by Ω + , i.e., Ω + = {∪Ωi | y = +1}; 2) clusters with only negative labeled data, denoted by Ω − , i.e., Ω − = {∪Ωi | y = −1}; 3) clusters with both positive and negative labeled data (or mix-labeled), denoted by Ωm , i.e., Ωm = {∪Ωi | y = ±1}. Figure 2 (a) illustrates the clusters after clustering, where the clusters with only red points are positive labeled (Ω + ), the clusters with green points are negative labeled (Ω − ) , and clusters A and B are mix-labeled (Ωm ).
Fig. 2. Data selection: (a) Clusters (b) The first stage SVM
12
X. Li and K. Li
We select not only the centers of the clusters but also all the data of mixlabeled clusters as training data in the first SVM classification stage. If we denote the set of the centers of the clusters in Ω + and Ω − by C + and C − respectively, i.e., C + = {∪Ci | y = +1} positive labeled centers C − = {∪Ci | y = −1} negative labeled centers Then the selected data which will be used in the first stage SVM classification is the union of C + , C − and Ωm , i.e., C + ∪ C − ∪ Ωm . In Figure 2 (b), the red points belongs to C + , and the green points belong to C − . It is clear that the data in Figure 2 (b) are all cluster centers except the data in mix-labeled clusters A and B. 2.2
The First Stage SVM Classification
We consider binary classification. Let (X, Y ) be the training patterns set, X = {x1 , · · · , xn }, Y = {y1 , · · · , yn } yi = ±1, xi = (xi1, . . . , xip )T ∈ Rp
(1)
The training task of SVM classification is to find the optimal hyperplane from the input X and the output Y , which maximize the margin between the classes. That is, training SVM yields to find an optimal hyperplane or to solve the following quadratic programming problem (primal problem), 1 T 2w w
n
+ c ξk minw,b J (w) = k=1 T subject : yk w ϕ (xk ) + b ≥ 1 − ξk
(2)
where ξk is slack variables to tolerate mis-classifications ξk > 0, k = 1 · · · n, c > 0, wk is the distance from xk to the hyperplane wT ϕ (xk ) + b = 0, ϕ (xk ) is a nonlinear function. The kernel which satisfies the Mercer condition [9] is T K (xk , xi ) = ϕ (xk ) ϕ (xi ) . (2) is equivalent to the following quadratic programming problem which is a dual problem with the Lagrangian multipliers αk ≥ 0, n n maxα J (α) = − 21 yk yj K (xk , xj ) αk αj + αk subject :
n
k,j=1
αk yk = 0,
k=1
(3)
0 ≤ αk ≤ c
k=1
Many solutions of (3) are zero, i.e., αk = 0, so the solution vector is sparse, the sum is taken only over the non-zero αk . The xi which corresponds to nonzero αi is called a support vector (SV). Let V be the index set of SV, then the optimal hyperplane is αk yk K (xk , xj ) + b = 0 (4) k∈V
Detecting RNA Sequences Using Two-Stage SVM Classifier
The resulting classifier is
y(x) = sign
13
αk yk K (xk , x) + b
k∈V
where b is determined by Kuhn-Tucker conditions. Sequential minimal optimization (SMO) breaks the large QP problem into a series of smallest possible QP problems [23]. These small QP problems can be solved analytically, which avoids using a time-consuming numerical QP optimization as an inner loop. The memory required by SMO is linear in the training set size, which allows SMO to handle very large training sets [16]. A requirement l αi yi = 0, it is enforced throughout the iterations and implies that in (3) is i=1
the smallest number of multipliers can be optimized at each step is two. At each step SMO chooses two elements αi and αj to jointly optimize, it finds the optimal values for these two parameters while all others are fixed. The choice of the two points is determined by a heuristic algorithm, the optimization of the two multipliers is performed analytically. Experimentally the performance of SMO is very good, despite needing more iterations to converge. Each iteration uses few operations such that the algorithm exhibits an overall speedup. Besides convergence time, SMO has other important features, such as, it does not need to store the kernel matrix in memory, and it is fairly easy to implement [23]. In the first stage SVM classification, we use SVM classification with SMO algorithm to get the decision hyperplane. Here, the training data set is C + ∪ C − ∪ Ωm , which has been obtained in the last subsection. Figure 2 (b) shows the results of the first stage SVM classification. 2.3
De-clustering
We propose to recover the data into the training data set by including the data in the clusters whose centers are support vectors of the first stage SVM, we call this process de-clustering. Then, more original data near the hyperplane can be found through the de-clustering. The de-clustering results of the support vectors in Figure 2 (b) are shown in Figure 3 (a). The de-clustering process not only overcomes the drawback that only small part of the original data near the support vectors are trained, but also enlarge the training data set size of the second stage SVM which is good for improving the accuracy. 2.4
The Second Stage SVM Classification
Taking the recovered data as new training data set, we use again SVM classification with SMO algorithm to get the final decision hyperplane yk α∗2,k K (xk , x) + b∗2 = 0 (5) k∈V2
where V2 is the index set of the support vectors in the second stage. Generally, the hyperplane (4) is close to the hyperplane (5).
14
X. Li and K. Li
Fig. 3. (a) De-clustering (b) The second stage SVM
In the second stage SVM, we use the following two types of data as training data: 1). The data of the clusters whose centers are support vectors, i.e., ∪Ci ∈V {Ωi }, where V is a support vectors set of the first stage SVM; 2). The data of mix-labeled clusters, i.e, Ωm . Therefore, the training data set is ∪Ci ∈V {Ωi } ∪ Ωm . Figure 3 (b) illustrates the second stage SVM classification results. One can observe that the two hyperplanes in Figure 2 (b) and Figure 3 (b) are different but similar.
3
RNA Sequence Detection
We use three case studies to show the two-stage SVM classification approach introduced in the last section. The first example is done to show the necessities of the second stage SVM by comparing the accuracy of both stages. The second example is not a large data set, but it shows that training time, accuracy can be improved through adjusting the cluster number. The third example is a real large data set, we made a complete comparison with several well known algorithms as well as our two stage SVM with different clustering methods. Example 1. The training data is at www.ghastlyfop.com/blog/tag index svm.html/ .To train the SVM classifier, a training set containing every possible sequence pairing. This resulted in 47, 5865 rRNA and 114, 481 tRNA sequence pairs. The input data were computed for every sequence pair in the resulting training set of 486, 201 data points. Each record has 8 attributes with continuous values between 0 to 1. In [27], a SVM-based method was proposed to predict the common structure of two RNA sequences on the basis of minimizing folding free energy change. RNA, the total free energy change of an input sequence pair can either be compared with the total free energy changes of a set of control sequence pairs, or be used in combination with sequence length and nucleotide frequencies as input to a classification support vector machine.
Detecting RNA Sequences Using Two-Stage SVM Classifier
15
Fig. 4. The first stage SVM classification on the RNA sequences data set used in [27] with 103 data
In our experiments, we obtained 12 clusters from 1000 original data using FCM clustering. Then, in the first stage SVM, 113 training data including the cluster centers and data of mix-labeled clusters are obtained using the data selection process introduced in section II, and we got 23 support vectors. Figure 4 shows the result of the first stage SVM. Following the de-clustering technique, 210 data were recovered as training data for the second stage SVM. In the second stage SVM, we got 61 support vectors, see Figure 5. Table 1 shows the comparisons on training time and accuracy between our two SVM stages. The training time of our two-stage SVM and LIBSVM is first compared. For training 103 data, our classifier needs 67 seconds while LIBSVM needs about 100 seconds. For training 104 data, our classifier needs 76 seconds while LIBSVM needs about 1, 000 seconds. And, for 486, 201 data, our classifier needs only 279 seconds while the LIBSVM should use a very long time, it is not reported in [27], (we guess it maybe around 105 seconds). On the other hand, there is almost no difference between their accuracies. This implies that our approach has great advantage on gaining training time. Then, the accuracy between the first stage SVM and two-stage SVM is compared. From the figures and Table 1, it is obvious that the accuracy of two-stage SVM is much better than the first stage SVM. This shows that the two stages are necessary. Example 2. 3mer Dataset. The original work on string kernels – kernel functions defined on the set of sequences from an alphabet S rather than on a vector space [9] – came from the field of computational biology and was motivated by algorithms for aligning DNA and protein sequences. The recently presented k-spectrum (gap-free k-gram) kernel and the (k,m) mismatch kernel provide an alternative model for string kernels for biological sequences, and were designed, in particular, for the application of SVM
16
X. Li and K. Li
Fig. 5. The two stages SVM classification on the RNA sequences data set used in [27] with 103 data
protein classification. These kernels use counts of common occurrences of short k-length subsequences, called k-mers, rather than notions of pairwise sequence alignment, as the basis for sequence comparison. The k-mer idea still captures a biologically-motivated model of sequence similarity, in that sequences that diverge through evolution are still likely to contain short subsequences that match or almost match. We use SVM to classify proteins based on sequence data into homologous groups (evolutionary similar) to understand the structure and functions of proteins. The 3mer data set has 2000 data points, and each record has 84 attributes with continuous values between 0 to 1. The data set contains 1000 positive sequences and 1000 negative sequences. The data set is available at noble.gs.washington.edu/proj/hs/ In [21], spectrum kernel was used as a feature set representing the distribution of every possible k-mer in a RNA sequence. The value for each feature is the number of times that particular feature appears in the sequence divided by the number of times any feature of the same length appears in the sequence. In our experiments, we used MEB clustering to select data for the first stage SVM, and k=3 (i.e., 3mers, 2mers and 1mers are our features) to train our two stages SVM classifier. Table 2 shows the accuracy and training time of our classifier and LIBSVM, where the accuracies are almost the same. Also there is no much deference on training time, this is because that the data set contains only 2,000 data. However, we did experiments with cluster number (l) 400 and 100. We can see that, when we use less cluster number, the training time is less too, since the training data size is smaller, but, we get a worse accuracy. Example 3. This RNA data set is available at http://www.pubmedcentral. nih.gov /articlerender.fcgi?artid=1570369#top from Supplementary Material (additional file 7). The data set consists of 23605 data points, each record has 8 attributes with
Detecting RNA Sequences Using Two-Stage SVM Classifier
17
Table 1. Accuracy and training time on the RNA sequences data set in [27]
Data set size 103 104 486, 201
First stage SVM T (s) Acc (%) 31 67.2 70 76.9 124 81.12
Two-stage SVM T (s) Acc (%) 76 88.9 159 92.7 279 98.4
LIBSVM T (s) Acc (%) 102 87.4 103 92.6 98.3 105 ?
Table 2. Accuracy and training time on the RNA sequences data set in [21] Two-stage SVM # t(s) Acc(%) l 2000 17.18 75.9 400 2000 7.81 71.7 100
LIBSVM # t(s) 2000 8.71 — —
Acc(%) 73.15 —
continuous values between 0 to 1. The data set contains 3919 ncRNAs and 19686 negative sequences. We used sizes 500, 1, 000, 2, 500, 5, 000, 10, 000 and 23, 605 in our experiments. Experiments were done using MEB two-stage, RS two-stage, SMO, LIBSVM and simple SVM. Table 3 shows our experiment results on different data size with MEB two-stage and RS two-stage. Table 4 shows the comparisons between our approach and other algorithms. In Table 3 and 4, the notations are as explained as follows. “#” is the data size; “t” is the training time of the whole classification which includes the time of clustering, the first stage SVM training, de-clustering and the second stage SVM training; “Acc” is the accuracy; “l” is the number of clusters used in the experiment; “TrD2” is the number of training data for the second stage SVM training; “SV1” is the number of support vectors obtained in the first stage SVM; “SV2” is the number of support vectors obtained in the second stage SVM. Table 3 shows our experiment results on different data size with MEB twostage and RS two-stage. For example, in the experiment on 10, 000 data points, we sectioned it into 650 clusters using MEB clustering and random selection. In the first stage classification of MEB two-stage, we got 199 support vectors. Following the de-clustering technique, 862 data were recovered as training data for the second stage SVM, which is much less than the original data size 10, 000. In the second stage SVM, 282 support vectors were obtained. From Table 2, we can also see that MEB two-stage has a little better accuracy than random selection (RS) two-stage, while its training time is longer than that of RS two-stage. Table 4 shows the comparison results on training time and accuracy between our two-stage classification and some other SVM algorithms including SMO, simple SVM and LIBSVM. For example, to classify 5000 data, LIBSVM is the fastest, and SMO has the best accuracy, our two approaches are not better than them,
18
X. Li and K. Li
although the time and accuracy are similar to them. However, to classify 23, 605 data, Simple SVM and SMO have no better accuracy than the others, but their training time is tremendous longer. Comparing to our two approaches, LIBSVM takes almost double training time of MEB two-stage, and almost 7 times of the time of RS two-stage, although it has the same accuracy as ours. This experiment implies that our approach has great advantage on large data sets since it can reach the same accuracy as the other algorithm can in a very short training time. Table 3. Two-stage SVM classification results on RNA sequence data set MEB two-stage # t Acc 500 4.71 85.3 1000 5.90 86.2 2500 15.56 86.3 5000 26.56 86.7 10000 69.26 86.9 23605 174.5 88.5
l 350 400 450 500 650 1500
SV1 87 108 124 149 199 278
TrD2 397 463 529 656 862 1307
RS two-stage # t Acc 500 4.07 85.3 1000 4.37 85.7 2500 11.2 86.5 5000 15.8 86.1 10000 30.2 86.5 23605 65.7 88.3
SV2 168 162 209 227 282 416
l 350 400 450 500 650 1500
SV1 88 97 132 146 187 257
TrD2 421 453 581 637 875 1275
SV2 172 153 221 211 278 381
Table 4. Training time and accuracy on RNA sequence data set
# 500 1000 2500 5000 10000 23605
4
MEB two-stage RS two-stage t Acc t Acc 4.71 85.3 4.07 85.3 5.90 86.2 4.37 85.7 15.56 86.3 11.21 86.5 26.56 86.7 15.79 86.1 69.26 87.9 30.22 86.5 174.5 88.2 65.7 88.3
LIBSVM t Acc 0.37 86 0.72 87.2 3.06 87.4 12.53 87.6 48.38 88.2 298.3 88.6
SMO t 1.56 3.54 4.20 212.43 1122.5 —-
Acc 87.7 88.3 87.7 88.8 89.6 —-
Simple SVM t Acc 2.78 86.7 8.18 87.1 561.3 88.1 ——————-
Conclusions and Discussions
Our two-stage SVM classification approach is much faster than other SVM classifiers without loss of accuracy when data set is large enough. From the results of the experiments we made on biological data sets in this work, our approach has been showed suitable for classifying large and huge biological data sets. Additionally, another promising application on genomics machine learning is under study.
References 1. Awad, M.L., Khan, F., Bastani, I., Yen, L.: An Effective support vector machine(SVMs) Performance Using Hierarchical Clustering. In: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, pp. 663– 667. IEEE Computer Society Press, Los Alamitos (2004) 2. Axmann, I.M., Kensche, P., Vogel, J., Kohl, S., Herzel, H., Hess, W.R.: Identification of cyanobacterial non-coding RNAs by comparative genome analysis. Genome Biol R73 6 (2005)
Detecting RNA Sequences Using Two-Stage SVM Classifier
19
3. Babu, G., Murty, M.: A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm. Pattern Recognit. Lett. 14, 763–769 (1993) 4. Cervantes, J., Li, X., Yu, W.: Support Vector Machine Classification Based on Fuzzy Clustering for Large Data Sets. In: Gelbukh, A., Reyes-Garcia, C.A. (eds.) MICAI 2006. LNCS (LNAI), vol. 4293, pp. 572–582. Springer, Heidelberg (2006) 5. Cervantes, J., Li, X., Yu, W., Li, K.: Support vector machine classification for large data sets via minimum enclosing ball clustering. Neurocomputing (accepted for publication) 6. Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines (2001), http://www.csie.ntu.edu.tw/∼ cjlin/libsvm 7. Chen, P.H., Fan, R.E., Lin, C.J.: A Study on SMO-Type Decomposition Methods for Support Vector Machines. IEEE Trans. Neural Networks 17, 893–908 (2006) 8. Collobert, R., Bengio, S.: SVMTorch: Support vector machines for large regression problems. Journal of Machine Learning Research 1, 143–160 (2001) 9. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000) 10. Dong, J.X., Krzyzak, A., Suen, C.Y.: Fast SVM Training Algorithm with Decomposition on Very Large Data Sets. IEEE Trans. Pattern Analysis and Machine Intelligence 27, 603–618 (2005) 11. Folino, G., Pizzuti, C., Spezzano, G.: GP Ensembles for Large-Scale Data Classification. IEEE Trans. Evol. Comput. 10, 604–616 (2006) 12. Griffiths-Jones, S., Moxon, S., Marshall, M., Khanna, A., Eddy, S.R., Bateman, A.: RFAM: annotating non-coding RNAs in complete genomes. Nucleic Acids Res. 33, 121–124 (2005) 13. Girolami, M.: Mercer kernel based clustering in feature space. IEEE Trans. Neural Networks 13, 780–784 (2002) 14. Hansen, J.L., Schmeing, T.M., Moore, P.B., Steitz, T.A.: Structural insights into peptide bond formation. Proc. Natl. Acad. Sci. 99, 11670–11675 (2002) 15. Huang, G.B., Mao, K.Z., Siew, C.K., Huang, D.S.: Fast Modular Network Implementation for Support Vector Machines. IEEE Trans. on Neural Networks (2006) 16. Joachims, T.: Making large-scale support vector machine learning practice. Advances in Kernel Methods: Support Vector Machine. MIT Press, Cambridge (1998) 17. Kim, S.W., Oommen, B.J.: Enhancing Prototype Reduction Schemes with Recursion: A Method Applicable for Large Data Sets. IEEE Trans. Syst. Man, Cybern. B. 34, 1184–1397 (2004) 18. Li, X., Cervantes, J., Yu, W.: Two Stages SVM Classification for Large Data Sets via Randomly Reducing and Recovering Training Data. In: IEEE International Conference on Systems, Man, and Cybernetics, Montreal Canada (2007) 19. Lin, C.T., Yeh, L.C.M., S, F., Chung, J.F., Kumar, N.: Support-Vector-Based Fuzzy Neural Network for Pattern Classification. IEEE Trans. Fuzzy Syst. 14, 31–41 (2006) 20. Mavroforakis, M.E., Theodoridis, S.: A Geometric Approach to Support Vector Machine(SVM) Classification. IEEE Trans. Neural Networks 17, 671–682 (2006) 21. Noble, W.S., Kuehn, S., Thurman, R., Yu, M., Stamatoyannopoulos, J.: Predicting the in vivo signature of human gene regulatory sequences. Bioinformatics 21, 338– 343 (2005) 22. Pal, N., Bezdek, J.: On cluster validity for the fuzzy c-means model. IEEE Trans. Fuzzy Syst. 3, 370–379 (1995)
20
X. Li and K. Li
23. Platt, J.: Fast Training of support vector machine using sequential minimal optimization. Advances in Kernel Methods: support vector machine. MIT Press, Cambridge, MA (1998) 24. Prokhorov, D.: IJCNN 2001 neural network competition. Ford Research Laboratory (2001), http://www.geocities.com/ijcnn/nnc ijcnn01.pdf 25. Shih, L., Rennie, D.M., Chang, Y., Karger, D.R.: Text Bundling: Statistics-based Data Reduction. In: Proc. of the Twentieth Int. Conf. on Machine Learning, Washington DC (2003) 26. Tresp, V.: A Bayesian Committee Machine. Neural Computation 12, 2719–2741 (2000) 27. Uzilov, A.V., Keegan, J.M., Mathews, D.H.: Detection of non-coding RNAs on the basis of predicted secondary structure formation free energy change. BMC Bioinformatics 173 (2006) 28. Washietl, S., Hofacker, I.L., Lukasser, M., Huttenhofer, A., Stadler, P.F.: Mapping of conserved RNA secondary structures predicts thousands of functional noncoding RNAs in the human genome. Nat. Biotechnol. 23, 1383–1390 (2005) 29. Weilbacher, T., Suzuki, K., Dubey, A.K., Wang, X., Gudapaty, S., Morozov, I., Baker, C.S., Georgellis, D., Babitzke, P., Romeo, T.: A novel sRNA component of the carbon storage regulatory system of Escherichia coli. Mol. Microbiol. 48, 657– 670 (2003) 30. Xu, R., WunschII, D.: Survey of Clustering Algorithms. IEEE Trans. Neural Networks 16, 645–678 (2005) 31. Yu, H., Yang, J., Han, J.: Classifying Large Data Sets Using SVMs with Hierarchical Clusters. In: Proc. of the 9th ACM SIGKDD (2003)
Frequency Synchronization of a Set of Cells Coupled by Quorum Sensing Jianbao Zhang2 , Zengrong Liu1 , Ying Li2 , and Luonan Chen1 1
Institute of Systems Biology, Shanghai University, Shanghai. 200444, China
[email protected],
[email protected] 2 College of Sciences, Shanghai University, Shanghai, 200444, China
Abstract. Collective behavior of a set of cells coupled by quorum sensing is a hot topic of biology. Noticing the potential applications of frequency synchronization, the paper studies frequency synchronization of a set of cells with different frequencies coupled by quorum sensing. By phase reduced method, the multicell system is transformed to a phase equation, which can be studied by master stability function method. The sufficient conditions for frequency synchronization of the multicell system is obtained under two general hypotheses. Numerical simulations confirm the validity of the results.
1
Introduction
Recently, collective dynamics in a population of cells communicated with each other through intercellular signaling have attracted much attention from many fields of biology and many researches have been carried out[1,2,3] . In the sight of biology, this type of collective dynamics is caused by intercellular signaling from identical and unreliable components, whereas bacteria display various social behaviors and cellular differentiations, such as quorum sensing in grampositive and gram-negative strains because of intercellular communications[4,5,6] . In order to study the theoretical mechanism of such phenomena, many interesting studies were carried out such as Ref.[2]. But most of studies are based on theory of synchronization and two hypotheses are adopted for the convenience of mathematical analysis[2,7] : (1). The network consists of identical cells, in other words, all the individual cells are with identical parameters; (2). The hypothesis of quasi-steady-state approximation of the network holds. Under the two hypotheses above, the authors give the conditions for complete synchronization. It is very difficult to study theoretically without the two hypotheses. Luckily, there are many different synchronization states such as frequency synchronization, which is more important than complete synchronization in the fields of biology. Plenty of phenomena such as the circadian rhythms of mammals[3] verify the importance of frequency synchronization. Therefore, we try to deduce
Supported by National Natural Science Foundation of China (70431002,10672093).
K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 21–27, 2007. c Springer-Verlag Berlin Heidelberg 2007
22
J. Zhang et al.
the theoretical mechanism of frequency synchronization caused by intercellular signaling without the two hypotheses mentioned above. In this direction, we give an introduction to the advances of phase synchronization. In order to study phase synchronization of a set of limit-cycle oscillators, some researchers proposed the phase reduced method[8,9,10] . Initially, the method transformed an oscillator under a small perturbation to a compact dynamical equation of phase. Then Kuramoto considered a network consisting of n identical subsystems with intrinsic frequency ωi and obtain the famous Kuramoto model[12] . Later[13] , phase synchronization in random sparse complex networks of small-world and scale-free topologies with long-range decayed couplings was studied. Recently, population of identical limit-cycle oscillators driven by common additive noise[14] and uncoupled limit-cycle oscillators under random impulses[15] was also studied. The results mentioned above show that the phase reduced method is a valid method to study phase synchronization. In our point, the more important collective dynamics in multicell systems or multicellular structures is frequency synchronization. The paper studies frequency synchronization of cells communicated with each other by intercellular signaling through the method mentioned above.
2
A Synthetic Multicellular Network
Now, we introduce a synthetic gene network in Escherichia coli[7] and all cells communicate with each other by signaling molecules based on the quorumsensing mechanism. The repressilator is a network of three genes, a, b, c, the products of which inhibit the transcription of each other in a cyclic way. Specifically (see Fig. 1), the gene c expresses protein C, which inhibits transcription of the gene a. The product of gene a inhibits transcription of the gene b, the protein product B of which in turn inhibits expression of gene b, completing the cycle. These bacteria exhibit cell-to-cell communication through a mechanism that makes use of two proteins, the first one of which (LuxI) synthesizes a small molecule known as an autoinducer (AI), which can diffuse freely through the cell membrane. When a second protein (LuxR) binds to this molecule, the resulting complex activates transcription of various genes, including some coding for light-producing enzymes. The scheme of the network is shown in Figure 1, and the detailed description is provided by Garcia-Ojalvo and others (2004). The dynamics of genes a, b, c and proteins A, B, C are given respectively as dai (t) αC = −d1i ai (t) + μC +C , m dt i (t) dbi (t) αA , dt = −d2i bi (t) + μA +Am i (t) dci (t) αS Si (t) αB dt = −d3i ci (t) + μB +Bim (t) + μS +Si (t) , dAi (t) = −d4i Ai (t) + βa ai (t), dt dBi (t) = −d5i Bi (t) + βb bi (t), dt dCi (t) = −d6i Ci (t) + βc ci (t), dt
(1)
Frequency Synchronization of a Set of Cells
Bi
23
Ci
cI (
bi
)
lac I (
ci
) AI
te tR ( a i )
Ai
Ci la cI (
ci
lu x I
)
AI
Ai
LuxR
AI AI
the ith cell CELL
CELL
CELL
AI
CELL
C ELL CELL
C ELL
Fig. 1. Scheme of the repressilators communicated with each other through autoinducer (AI), which can diffuse freely through the cell membrane
dSi (t) = −ds Si (t) + βs Ai (t), (2) dt where ai , bi , and ci are the concentrations of mRNA transcribed from genes a, b, and c in cell i, respectively; concentrations of the corresponding proteins are represented by Ai , Bi , and Ci , respectively. Concentration of AI inside each cell is denoted by Si . αA , αB , and αC are the dimensionless transcription rates in the absence of repressor. αs is the maximal contribution to the gene c transcription in the presence of saturating amounts of AI. Parameters βa , βb and βc are the translation rates of the proteins from the mRNAs. βs is the synthesis rate of AI. m is the Hill coefficient, and dji are the respective dimensionless degradation rates of mRNA or proteins for genes a, b, and c and the corresponding proteins in cell i. Consider that AI can diffuse freely through the cell membrane and denote ηs and ηe as the diffusion rate of AI inward and outward the cell, the dynamics of AI can be rewritten as follows, dSi (t) dt dSe (t) dt
= −ds Si (t) + βs Ai (t) − ηs (Si (t) − Se (t)), N Sj (t)−Se (t) = −de Se (t) + ηe . n j=1
(3)
24
J. Zhang et al.
Then the individual cells (1)-(2) communicated with each other through the signaling molecules and form a biological network (1)-(3). One can regard the signaling molecules in the extracellular environment as the (n+1)th node, which implies that the n cells communicated with the (n + 1)th node and construct a star-type network. Then we can apply the method to study frequency synchronization of oscillator networks to study frequency synchronization of multicell systems (1)-(3). The dynamics of most of biologic systems are periodic. For example, it can be concluded that system (1)-(2) exhibits limit-cycle oscillations in a wide region of parameter ds space from Fig. 2 of Ref[2]. Then denote xi = (ai , bi , ci , Ai , Bi , Ci , Si ) , it is reasonable to assume that each individual cells in network exhibits limitcycle oscillations. Let x0i (t) and Oi denote the stable periodic solution of individual cells and the orbit corresponding to x0i (t). In the light of phase reduced method, we can produce a definition of phase φi on the orbit Oi such that φ˙i (x0i ) = ωi . Extending the definition of φi to the absorbing domain Di of the orbit Oi , which is essentially the same as asymptotic phase[9] , one obtains φ˙i (xi ) = ωi , xi ∈ Di .
(4)
Then consider the network (1)-(3). The exact expression of Se is easily to obtain as follows, n ηe t −(de +ηe )t Se (t) = Se0 e + Sj (s)e(d+ηe )(s−t) ds. n j=1 0 Based on equation (3) and φ˙i (xi ) = gradxi φi · x˙ i , one gets ηe φ˙i = ωi +ηgradSi φi {Se0 1e−(de +ηe )t + n
n j=1
t 0
(de +ηe )(s−t) xm ds − Si (φi (t))}. j (φj (s))e
(5)
It is reasonable to assume the following hypothesis holds, especially for a periodic function Sj (φj (t)). φi as the gradient of φi along xm (H1 ). Denote gradxm i , there holds i t t (d+ηy )(s−t) φi xm ds = Gij (φi , φj ) e(d+ηy )(s−t) ds. (6) gradxm j (φj (s))e i 0
0
Motivated by Ref.[16], we can further assume that hypothesis (H2 ) holds and a numerical example has been given to illustrate the rationality of such hypothesis. (H2 )[16] There exists d + 1 constants φ01 , . . . , φ0d , ω such that the following conditions. 1. Denoting ϕi = ωt + φ0i , Δωi = ωi − ω, there holds, n ηq Δωi + Gij (ϕi , ϕj ) − ηHi (ϕi ) = 0. n j=1
(7)
2. G(φi , φj ) is differentiable and Gyij (φi , φj )|φ=ϕ = −Gxij (φi , φj )|φ=ϕ , where ∂ ∂ Gxij (φi , φj ) = ∂φ Gij (φi , φj ), Gyij (φi , φj ) = ∂φ Gij (φi , φj ). i j Then one obtain the following results.
Frequency Synchronization of a Set of Cells
25
Theorem 1. Under hypotheses (H1 ) and (H2 ), system (1)-(3) realizes collective rhythms if q is large enough. The detailed derivation and proof are similar to our recent work[16]. Though the conditions of the results relate with the initial values of system (2)-(4), but once some initial values are verified to satisfy Theorem.1, Theorem.1 still holds when the initial values deviates slightly. Therefore, Theorem.1 has many practical applications in the fields of biology.
3
Numerical Simulations
As far as the system mentioned in section 2 is concerned, we can not give the explicit expression of Gij (ϕi , ϕj ), Hi (φi ), but we can presume that Gij (ϕi , ϕj ), Hi (φi ) satisfy hypotheses (H1 ), (H2 ) because of the generality of the two hypotheses. Then we consider the multicell systems (2)-(4) consists of 6 cells with the initial values and parameters in Tab.1 and Tab.2.It has been shown thatparameters βa , βb , , βc and d4i , d5i , , d6i affects most markedly the oscillation frequency. Then all the repressilators oscillate at different frequencies because of the different values of β and d. Figure 2 shows that frequency synchronization Table 1. The initial values of the 6-cell system (2)-(4) n
1
2
3
4
5
6
ai0 8.2803 9.1756 1.1308 8.1213 9.0826 1.5638 bi0
1.2212 7.6267 7.2180 6.5164 7.5402 6.6316
ci0
8.8349 2.7216 4.1943 2.1299 0.3560 0.8116
Ai0 8.5057 3.4020 4.6615 9.1376 2.2858 8.6204 Bi0 6.5662 8.9118 4.8814 9.9265 3.7333 5.3138 Ci0 1.8132 5.0194 4.2219 6.6043 6.7365 9.5733 Si0 1.9187 1.1122 5.6505 9.6917 0.2374 8.7022 Se0 0.2688
Table 2. The parameters of the 6-cell system (2)-(4) n
1
2
3
4
5
6
αAi
2.9823 3.7146 3.8071 2.6168 2.8173 2.8836
βi
0.1302 0.1301 0.1303 0.1301 0.1304 0.1301
di
0.5008 0.5004 0.5012 0.5004 0.5015 0.5004
others αB = αC = 1.96, αs = 1.βs = 0.018, ds = 0.016, μA = μB = μC = 0.2, m = 4, ηs = 0.4.
26
J. Zhang et al.
can be realized, which confirms the validity of the results. The numerical simulations are consistent with the previous researches on system (2)-(4) which show that a network of coupled repressilators with identical parameters can realize e is large enough. complete synchronization when Q = ηeη+d e
ai:tetR in the ith cell
20
15
10
5
0 0
50
t→
100
150
1750
1800
ai:tetR in the ith cell
20
15
10
5
0 1650
1700
t→
Fig. 2. Time evolution of ai (tetR in the ith cell) of multicell systems (2)-(4) consists of 6 cells with different frequencies. Fig.a implies that the 6 cells oscillate at different frequencies when t ∈ [0, 150], but the 6 cells oscillate at identical frequency, different amplitudes when t ∈ [1650, 1800] (see Fig.b).
References 1. Wang, R., Jing, Z., Chen, L.: Modelling periodic oscillation in gene regulatory networks by cyclic feedback networks. Bull. Math. Biol. 67, 339–367 (2004) 2. Wang, R., Chen, L.: Synchronizing Genetic Oscillators by Signaling Molecules. Journal of biological Rhythms 20, 257–269 (2005) 3. Li, Y., Zhang, J., Liu, Z.: Circadian Oscillators and Phase Synchronization under a Light-Dark Cycle. International Journal of Nonlinear Science 1, 131–138 (2006) 4. Taga, M.E., Bassler, B.L.: Chemical communication among bacteria. PNAS 100, 14549–14554 (2003) 5. Weiss, R., Knight, T.F.: Engineering communications for microbial robotics. DNA 6, 13–17 (2000)
Frequency Synchronization of a Set of Cells
27
6. Chen, L., Wang, R., Zhou, T., Aihara, K.: Noise-induced cooperative behavior in a multi-cell system. Bioinformatics 21, 51–62 (2005) 7. Garcia-Ojalvo, J., Elowitz, M., Strogatz, S.H.: Modeling a synthetic multicellular clock: repressilators coupled by quorum sensing. PNAS 101, 10955–10960 (2004) 8. Guckenheimer, J.: Isochrons and phaseless sets. J. Math. Biol. 1, 259C273 (1975) 9. Kuramoto, Y.: Chemical Oscillations, Waves and Turbulence. Springer, New York (1984) 10. Winfree, A.T.: Biological Rhythms and the Behavior of Populations of Coupled Oscillators. J. Theoret. Biol. 16, 15–42 (1967) 11. Izhikevich, E.M.: Phase equations for relaxation oscillators. SIAM Journal on Applied Mathematics 60, 1789–1804 (2000) 12. Strogatz, S.H.: From Kuramoto to Crawford: Exploring the onset of synchronization in populations of coupled oscillators. Physica D 143, 1–20 (2000) 13. Li, X.: Phase synchronization in complex networks with decayed long-range interactions. Physica D 223, 242C247 (2006) 14. Teramae, J., Tanaka, D.: Robustness of the noise-induced phase synchronization in a general class of limit cycle oscillators. Physical Review Letters 93, 20 (2004) 15. Nakao, H., Arai, K., Nagai, K., Tsubo, Y., Kuramoto, Y.: Synchrony of limit-cycle oscillators induced by random external impulses. Phys. Rev. E. 72, 026220 (2005) 16. Zhang, J., Liu, Z., Li, Y.: An approach to analyze phase synchronization in oscillator networks with weak coupling. Chinese Physics Review Letters 24(6) (2007) 17. Pecora, L.M., Carroll, T.L.: Master Stability Functions for Synchronized Coupled Systems. Phycical Review Letters 80, 2109 (1998) 18. Jordi, G.O., Elowitz, M.B., Steven, H.S.: Modeling a synthetic multicellular clock: Repressilators coupled by quorum sensing. PNAS 101, 10955–10960 (2004)
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics Min Xu1, Yongsheng Ding1,2, and Liangjian Hu3 1
Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China 2 College of Information Sciences and Technology, Donghua University, Shanghai 201620, China
[email protected] 3 Department of Applied Mathematics, Donghua University, Shanghai 201620, China
Abstract. In this paper, we first present a stochastic model of the proportion of the population infected with HIV against total population, and prove the existence and uniquess of its solution. Through computer simulation, we forecast the proportion of the population infected with HIV against the total population in the transmission course of AIDS in China in next 20 years. Especially, we study the control index of the transmission rate β to obtain its effect on the epidemic trend of AIDS when it fluctuates. As such, we present a strategy to adjust β to reach a certain control aim based on the analysis of the mean value and variance of the proportion.
1 Introduction The AIDS epidemic is spreading very fast according to the report from the United Union. The number of people infected with HIV increased from 35 million in 2001 to 38 million in 2003. According to a report from the Ministry of Health of the People’s Republic of China, the number of people infected with HIV was 135630 at the end of September of 2005. More and more researchers focus on prevention and control of AIDS. And most of them work on the spread of HIV based on ordinary differential equations. Haynatzka [1] studied the spread of AIDS among interactive transmission. Castillo [2] formulated a group of ordinary differential equations and studied the incubation in the dynamics of AIDS. Blythe and Anderson [3-5] studied various models, including heterogeneity population among whom AIDS is spreading. Jacquez et al. [6-7] presented a compartmental model of homosexual population for AIDS spreading. Greenhalgh et al. [8] discussed a two group model for the susceptible and infected populations. However, the above models have not considered the stochastic attributes during the transmission course of AIDS. Roberts [9] formulated a stochastic differential equation model for a fatal epidemic’s. In this paper, based on the above model, we extend it for AIDS and prove the existence and uniquess of the solution. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 28–37, 2007. © Springer-Verlag Berlin Heidelberg 2007
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics
29
In our model, the control index of the transmission rate β has been changed from a constant in the deterministic model to a stochastic one in the stochastic process because of environment factor. And what’s more, the proportion of population infected with HIV against the total population in the future will also be a stochastic process correspondingly. In the deterministic model, a corresponding control aim can be obtained only if β is a certain constant. But it can not be obtained with 100% probability when the environment disturbance with a certain intension exists. In reality, the stochastic model can describe the transmission course exactly. Based on the formulation of the stochastic model, we analyses the proportion of the population infected with HIV against the total population in next few years under the environmental disturbance with a certain intensity. We present a method to adjust β to reach a certain control aim.
2 Stochastic Differential Equation Model of AIDS Transmission 2.1 The Stochastic Differential Equation Model When the infection rate of the disease is a constant, the proportion of the population infected with HIV against the total population satisfies the ordinary differential equation, dZ = ( p − 1) BZ + ( β C − α )(1 − Z ) Z dt
(1)
where Z is the proportion of the population infected with HIV against the total population; B is the birth rate independent on the total population; C is the contact rate between individuals; α is the increase of the death rate suffering from AIDS; p is the vertical distribution probability, which is more than 0 and less than 1. β is the constant transmission rate. Because of the environmental effect, β should be a stochastic process. We regard it as a Gaussian white noise β0 + ρη(t ) , and replace it in the Eq. (1). Then we get the stochastic differential equation (SDE) model for AIDS transmission, dZ = F ( Z )dt + G ( Z ) dW
(2)
F ( Z ) = ( p − 1) BZ + ( β 0 C − α )(1 − Z ) Z
(3)
G ( Z ) = ρC (1 − Z ) Z
(4)
Where
E (η (t )) = 0, D(η (t )) = 1,
β0 is the average transmission rate and ρ is the intensity of the
environmental disturbance. Z is a stochastic process reflecting the trend of fluctuation of the proportion under the environmental disturbance. 2.2 Existence and Uniquess of Solution Following, we prove the solution of the SDE model (2) is existent and unique. Theorem 1. [10] (Existence and uniquess of the solution of SDE model (2)) If X t satisfies n dimensional SDE
30
M. Xu, Y. Ding, and L. Hu
b( x, t ) = (b1 ( x, t ), b2 ( x, t ),..., bn ( x, t ))T
(5)
σ ( x, t ) = (σ ij ( x, t )) 1 ≤ i, j ≤ n
(6)
X 0 = x0 , x0 ∈ R n
(7)
The initial condition is
Assume that
b( x, t ) and σ ( x, t ) are continuous vector value function and matrix
value function about conditions below,
( x, t ) ∈ R n × [0, T ] , respectively, and satisfy the − − ⎧ ⎪ b( x, t ) − b( x, t ) ≤ c* x − x ⎪ ⎪ ο ( x, t ) − σ ( x− , t ) ≤ c x − x− * ⎨ ⎪ b( x, t ) ≤ c(1 + x ) ⎪ ⎪ σ ( x, t ) ≤ c(1 + x ) ⎩
Lipschitz
(8)
where c* and c are constants. Then the unique strong solution of Eqs. (1) and (2) exists in
(Ω, F , Ft , P) as far as any
x ∈ R n is concerned. Here, we always assume that Wt is Brown motion in the probability space (Ω, F , P ) , Ft is its natural σ algebra.
Theorem 2. Assume that p , B , β , α and C are positive real numbers. Then for any initial condition Z 0 (0 < Z 0 < 1) , there is a unique solution to Eq. (2). Proof. We just need prove the coefficients satisfy Lipschitz condition. Here, b( z, t ) = ( p − 1) Bz + ( β0C − α )(1 − z ) z
(9)
σ ( z, t ) = ρC (1 − z ) z
(10)
Then we verify that they satisfy the conditions in Theorem 1, −
−
−
−
−
_
b( z, t ) − b( z , t ) = ( p − 1) B( z − z ) + ( β 0C − α )[( z − z )(1 − ( z + z ))]
(11)
By means of three triangle inequality, we get −
−
b( z, t ) − b( z , t ) ≤ ( p − 1) B ( z − z ) + ( β 0C − α )[( z − z )(1 − ( z + z ))]
(12)
Noticing that z represents the proportion of the population infected with HIV against the total population, so −
z ≤ 1 . Then we get −
b( z, t ) − b( z , t ) ≤ 2 max( ( p − 1) B , 3( β 0 C − α ) ) z − z
(13)
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics
31
In addition, −
−
σ ( z , t ) − σ ( z , t ) ≤ 3 ρC z − z
(14)
c* = max(2 max(( p − 1)B , 3(β0C − α ) ),3 ρC )
(15)
So if we let
then the first and second conditions are proved. Next we prove that the third and fourth conditions are satisfied. b( z , t ) ≤ ( ( p − 1) B + β 0 C − α )(1 + z )
(16)
σ ( z , t ) = ρC (1 − z ) z ≤ ρC (1 + z )
(17)
c = max(( p − 1) B + β0C − α , ρC )
(18)
Then we put
So the third and fourth conditions are proved. As a result, the solution of Eq. (1) is existent and unique according to Theorem 1.
3 Strategy for AIDS Prevention and Control We can predict the proportion of the population infected with HIV against the total population in next few years with the application of SDE (2) under a certain intensity of the environmental disturbance. Compared with the deterministic one, it shows the trend of fluctuation. Since only a few of SDEs can have explicit solution [11-15], we can not obtain the explicit solution of the Eq. (2). So we simulate the proportion of the population infected with HIV against the total population by means of numerical solution. Furthermore, we analyses how to adjust β to reach a certain control under the condition of a certain intensity of the environmental disturbance. 3.1 Numerical Solution of the SDE The numerical solution methods include Euler method, Milsteins method, RungeKutta method and so on [16, 17]. We can get the approximation of the sample trajectory on the node one by one by a definite partition on the time interval with consideration of stochastic increment. An iterated expression can be obtained when we use Euler method. Z ( j , k ) = Z ( j − 1, k ) + F ( Z ( j − 1, K ))( t j − t j −1 ) + G ( Z ( j − 1, k ))[W ( j ) − W ( j − 1)]
(19)
j = 1,2,..., M ; k = 1,2,..., K
(20)
F ( Z ( j − 1, k )) = ( p − 1) BZ ( j − 1, k ) + ( β 0 C − α )[1 − Z ( j − 1, k )]Z ( j − 1, k )
(21)
Where
32
M. Xu, Y. Ding, and L. Hu
G ( Z ( j − 1, k )) = ρC (1 − Z ( j − 1, k )) Z ( j − 1, k )
(22)
j and k represent the time node and trajectory, respectively. M and K are the number of time node and sample trajectory, respectively. According to the expression above and the known condition, we can get Z (1, k ), Z (2, k ),..., Z ( M , k ) , the values of the proportion of the population infected with HIV against the total population on different time node as far as every given trajectory is concerned. Furthermore, the mean value of this process is, −
Z ( j) =
1 K
K
∑ Z ( j, k ),
1≤ j ≤ M
k =1
(23)
and the variance is, S 2 ( j) =
− − 1 K 1 K Z ( j, k ) 2 − [Z ( j )]2 , 1 ≤ j ≤ M ∑ (Z ( j, k ) − Z ( j))2 = K − 1 ∑ K − 1 k =1 k =1
(24)
3.2 Adjusting for the Control Index of the Infection Rate β We put t1 as the beginning year and t2 as the end year in the deterministic model. The proportion of the population infected with HIV against the total population Z (t ) on [t1 , t 2 ] is a curve with constant β. So the control can be obtained in the deterministic model if we put γ as the given control aim, where γ is a little more than Z (t 2 ) . But in fact, β is changed to a stochastic process because of the environmental disturbance. Correspondingly, Z (t ) is also changed to a stochastic process. We write it as Zt in order to avoid confusion in the deterministic model. Then we can get a series of curves, Z ( j ,1), Z ( j ,2),..., Z ( j , K ) , representing the proportion of the population infected with HIV against the total population on [t1, t2 ] . These curves show the character of probability of the process. In other word, Z t , the proportion of the population in2
fected with HIV against the total population on time t 2 , will have M results, Z ( M ,1), Z ( M ,2),..., Z (M , K ) corresponding to the end points of k trajectories. So we can compute the number of trajectories, H (β 0 ) which can reach the aim on time t2 (we put it as H (β 0 ) , for it only has something to do with β0 when ρ , the intensity of the disturbance is a certain value.), H (β 0 ) =
∑l
(25)
1≤l ≤ K
where l ∈ L = {l : Z ( M , l ) ≤ γ } . Then we can compute the probability of reaching the aim P , P=
H (β 0 ) K
(26)
Obviously, P equals to 100% in the deterministic model, while it may reach 50% or less than 50% under the condition of stochastic disturbance. In order to ensure P to
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics
33
reach a bigger value, we must decrease the average transmission rate β 0 , when the intensity of the disturbance is given.
4 Strategy for AIDS Prevention and Control Plenty of investigations demonstrate that the year of 1995 is a very important year in the history of AIDS epidemic and control. The number of people infected with HIV reached more than 15000 according to the statistics from health ministry of People’s Republic of China this year. We estimate the value of β based on the statistics of year from 1995 to 2015. And then we put the year of 1995 as the beginning point and use the model to forecast the trend of change of the proportion of the population infected with HIV against the total population in next 20 years. According to the statistics offered by Chinese center for disease control and prevention, the number of people infected with HIV was about 15000, and the number of total population was 1207.78 million in 1995 in China. So the proportion of the population infected with HIV against the total population was about 1.25 × 10 −5 in 1995. The vertical transmission probability from mother to child is 35%. The birth rate B is about 18.3556 × 10-3 according to the statistics from the same resource. Generally speaking, people will die one year after developing symptoms of AIDS. Therefore, α equals to 1, and C equals to 0.5256 [9,18]. Furthermore, we postulate that the parameters are also the same during this time period. Then we forecast the proportion of the population infected with HIV against the total population in next 10 years with Eq. (2) and we put M and K as 20 and 100 in Eq. (3), respectively. Firstly, we find the value of β to make the deterministic model satisfy the fact according to the number of people infected with HIV from year 1995 to 2005. By computing, we determine that β is 10. 6
x 10 -4
5
4
3
2
1
0
1995 1997
1999
2001
2003
2005
2007
2009
2011
2013
2015
Fig. 1. The proportion of the population infected with HIV against the total population under deterministic situation from 1995 to 2015 (Line 1 represents the simulation result, while line 2 represents the actual data)
34
M. Xu, Y. Ding, and L. Hu
In Fig. 1, line 1 represents the simulation result from the deterministic model, while line 2 represents the actual data from year 1995 to 2005. From it, we can see that the proportion of the population infected with HIV against the total population will reach about 6 ×10 −4 in 2015. While, we must use the stochastic model (2) for the transmission rate of the AIDS is disturbed by the environment noise. Fig. 2 demonstrates that the fluctuation of the proportion of the population infected with HIV against the total population from 1995 to 2015 when ρ is 0.5. We conclude that the proportion exceeds 6 × 10 −4 under some circumstances because of environmental disturbance. 8
x 10-4
7 6 5 4 3 2 1 0 1995
1997
1999
2001 2003
2005
2007
2009
2011
2013
2015
Fig. 2. The proportion of the population infected with HIV from 1995 to 2005, where ρ the number of sample trajectory is 10
= 0.5 and
We postulate that the control reaches below 6 × 10 −4 in the next 20 years. Then we can obtain the aim when β equals to 10 in the deterministic model. But the probability of obtaining such an aim is not as big as expected when the control index β equals 0
to 10. Table 1. The value of the end point of every trajectory when
Value(1× 10–3)
β0 β0
=9 =10
k=1
k=2
k=3
k=4
k=5
k=6
β0 k=7
0.34 0.31 0.37 0.33 0.34 0.35 0.42 0.71 0.61 0.54 0.63 0.56 0.62 0.42
is 9 and 10, respectively
k=8 k=9
k=10
0.51 0.38 0.49 0.70 0.63 0.39
We compute that the probability equals to about 40% with the application of numerical method of the stochastic model. Consequently, we must decrease β 0 in order to ensure the proportion not to exceed 6×10-4 with the probability of 95%. We find that β 0 should be put as 9 when we use numerical simulation and skip from 9.9 to 9.8 to 9.7, etc.
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics
35
Fig. 3 demonstrates the fluctuation of the proportion of the population infected with HIV from 1995 to 2005 when ρ is the same, while the average transmission rate β equals to 9. Fig. 4 demonstrates the mean value of the proportion of the population 0
infected with HIV from 1995 to 2005 when
ρ equals to 0.5 and β 0 equals to 9 and
10, respectively.
6
x 10-4
5
4
3
2
1
0 1995
1997 1999
2001
2003
2005
2007
2009
2011
2013
2015
Fig. 3. The proportion of the population infected with HIV from 1995 to 2005, where and, β 0 is 9. The number of sample trajectory is 10.
6
ρ is to 0.5
x 10-4
β =10 β =9 0 0
5
4
3
2
1
0 1995
1997 1999
2001 2003
2005 2007 2009
2011
2013
2015
Fig. 4. The mean value of the proportion of the population infected with HIV from 1995 to 2005, where ρ is 0.5 and β 0 is 9, respectively −4 We find that the mean value will reach about 6 × 10 in 1995 when
it will fall below 4×10
-4.
β0
is 10, while
36
M. Xu, Y. Ding, and L. Hu
5 Conclusions Based on the formulation of a stochastic model of the proportion of the population infected with HIV against the total population, we first prove its solution is existent and unique. we analyses the effect of the control index of the transmission rate on the proportion of the population based on the estimation of the distribution of the proportion from 1995 to 2015 in China with the application of stochastic model. Acknowledgements. This work was supported in part by Program for New Century Excellent Talents in University from Ministry of Education of China (No. NCET-04415), the Cultivation Fund of the Key Scientific and Technical Innovation Project from Ministry of Education of China (No. 706024), International Science Cooperation Foundation of Shanghai (No. 061307041), and Specialized Research Fund for the Doctoral Program of Higher Education from Ministry of Education of China (No. 20060255006).
References 1. Haynatzka, V.R., Gani, J., Rachevn, S.T.: The spread of AIDS among interactive transmission. Biosystems 73(3), 157–161 (2004) 2. Castillo, C.C., et al.: The role of long incubation periodic in the dynamics of acquired immunodeficiency syndrome—Single population models. Math. Biol. 7, 373–398 (1989) 3. Blythe, S.P., Anderson, R.M.: Distributed incubation and infections periods in models of transmission dynamics of human immunodeficiency virus (HIV). IMA J. Math. Appl. Med. Biol. 1–19 (1988) 4. Blythe, S.P., Anderson, R.M.: Variable infectiousness in HIV transmission models. IMA. Math. Appl. Med. Biol. 5, 181–200 (1988) 5. Blythe, S.P., Anderson, R.M.: Heterogeneous sexual activity models of HIV transmission in male homosexual populations. IMA J. Math. Appl. Med. Biol. 5, 237–260 (1988) 6. Jacquez, J.A., Simon, C.P., Koopman, J.S.: Structured mixing: Heterogeneous mixing by the definition of activity groups. In: Castillo-Chavez, C. (ed.) Mathematical and Statistical Approaches to AIDS Epidemiology. Lecture Notes in Biomath., pp. 301–315. Springer, Heidelberg (1989) 7. Jacquez, J.A., Simon, C.P., Koopman, J.S.: The reproduction number in deterministic models of contagious disease. Comments Theor. Biol. 2, 159–209 (1988) 8. Greenhalgh, D., Doyle, M., Lewis, F.: A mathematical model of AIDS and condom use. IMA J. Math. Appl. Med. Biol. 18, 225–262 (2001) 9. Roberts, M.G., Saha, A.K.: The asymptotic behavior of a logistic epidemic model with stochastic disease transmission. Applied Mathematics Letters 12, 37–41 (1999) 10. Friedman, A.: Stochastic Differential Equations and Their Applications. Academic Press, New York (1976) 11. Okesendel, B.: Stochastic Differential Equations. Springer, Heidelberg (1985) 12. Kloeden, P.E., Platen, E.: Numerical solution of stochastic differential equations. Springer, Heidelberg (1992) 13. Saito, Y., Higham, T.: Stability analysis of numerical scheme for stochastic differential equations. SIAM, Numer. Anal. 33, 2254–2267 (1996)
A Stochastic Model for Prevention and Control of HIV/AIDS Transmission Dynamics
37
14. Higham, D.J.: Mean-square and asymptotic stability of the stochastic theta method. SIAM, Numer. Anal. 38(3), 753–769 (2000) 15. Ryden, T., Wiktorsson, M.: On the simulation of iterated Ito integrals. Stochastic Processes and their Applications 91(1), 116–151 (2001) 16. Burrage, K., Burrage, P., Mitsui, T.: Numerical solutions of stochastic differential equations-implementation and stability issues. Computational and Applied Mathematics 125, 171–182 (2000) 17. Slominski, L.: Euler’s approximations of solutions of SDEs with reflecting boundary. Stochastic Processes and their Applications 94(2), 317–337 (2001) 18. Liu, M.X., Zhou, Y.C.: An age-structured dynamic model of HIV. Journal of North China Institute of Technology 25(2), 25–30 (2004)
Simulation of Artificial Life of Bee’s Behaviors Bin Wu, Hongying Zhang, and Xia Ni School of Information Engineering, Southwest University of Science and Technology, Sichuan, Mianyang 621002, China {wbxn,zhanghongying,nixia}@swust.edu.cn
Abstract. Based on the ‘bottom-up’ programming approach in Artificial Life, Finite-State Machine is adopted to describe the behavior of the individual bee, and the behavior in different period was realized in this paper. As a result, the interaction of the individual bee each other, individual bee and virtual environment produce the Emergence of swarm’s collective behaviors. Finally, we apply the graphical interfaces to realize the simulation.
1 Introduction Artificial life is a charming topic in researching of complexity. Bionic system of life phenomenon is an important research topic in Artificial Life. All kinds of complicated life phenomenon are reappeared through setting up bionic system of life phenomenon, which can help us to understanding the essence of life. Biologic behaviors in the nature are rich and colorful, especially, biologists are more and more interested in the complicated colony behaviors of insects. Recently, many of the biologists have thought that the communications of all these insects were based on the theory of cooperation without communication. The basic idea of this theory is that each of the insects adjusts its behavior according to the changes of its surroundings without any leaders and obvious communications of each other. Based on this, this entire colony can complete very complicated tasks. In general, individual behavior is sample, blind and random, while colony behaviors are coherent, fluent and accordant [1]. According to the above theory, the behaviors of the swarm are simulated by artificial life in this paper. We can see that although the behavior of the individual bee is signal, it emerges complicated structures of the swarm under the interaction of the bees and their surroundings.
2 Behavior of Bees Although the behavior of the individual bee is sample and disorderly, the behavior of the swarm is complicated and orderly. A queen bee, many worker bees and a few drones make up of a swarm. Their conformations and functions are different. They divide the work and cooperate with each other. Queen bee is the only bee which can lay eggs in a swarm. Generally speaking, she can live from three to five year after successful amphimixis. In her life, queen bee K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 38–45, 2007. © Springer-Verlag Berlin Heidelberg 2007
Simulation of Artificial Life of Bee’s Behaviors
39
goes through three phases. In the first phase, she becomes eclosion imago from eggs. During this period, the main task of the queen bee is eating and flying around the honeycomb. After twenty-one days, the queen bee step into her second phase. She begins to fly out and copulate with drones. When the queen bee is entire impregnation, she steps into her third phase.In this period, the queen bee does nothing but give birth to children. Drone is a male individual in the swarm which is developed by unoosperm in the male comb. His only task is copulated with the queen bee to multiply their offspring. The number of the drone is about two percent of the total number of the swarm. The age of the drone is about two months. The drone goes through two phases in his life. In the first phase, it speeds the drone about twenty-four day to become eclosion imago from eggs. After twelve days, the drone is mature. During this period, the main task of the queen bee is eating and flying around the honeycomb. After that, the drone steps into his second phase. He copulated with the queen bee. Once the amphimixis is successful, the drone is died at once. Worker bee is a female individual which developed by the germ cell. With the age be increasing, the worker bee takes on all works in the comb. The number of the worker bee is very large, it occupies the ninety-eight percents of the total number of the swarm. The age of the worker bee is about four or six weeks in the summer and three or six months in the winter. It speeds the worker bee about twenty-one days to become eclosion imago from eggs. In this period, the main tasks of the worker bee are keeping the comb clean, feeding the baby bees, excreting the queen bee milk, building the comb, and guarding. After twenty-one days, the worker bee flies out their comb and pick the farina, which is the last work in her life. Although the bees live in a colony life, the swarms do not communicate with each other. The bees have the abilities of guarding their comb in order to resisting the outside swarms and insects. If the outside swarms thrust themselves in the comb, the bees which guard the comb must be fighted with them until the outside bees are running away or died. On the contrary, when all the bees are in the outside combs, such as in the flowers or in the watering place, different swarms are not hostile and interference to each other. If the queen bee flies in the outside swarm, she must be killed by the worker bees. On the contrary, if the drone flies in the outside swarm, the worker bees do not hurt him. It is may be show that the swarm wants to avoid propagating with close relative to make their offspring better[2].
3 The Basic Ideas 3.1 Adaptability Ashby, who is the one of the outrunner of the control theory, has understood in the 1950 that it is must be look on the controlled objects and their surroundings as a whole. When researching on a control system, we not only establish the model of the controlled objects, but also the model of objects and their surroundings. The viewpoint of Ashby is in fact that we study the behaviors of the organism from the point of adaptability. To research the adaptability in artificial intelligence is more and more important[1].
40
B. Wu, H. Zhang, and X. Ni
The individual, which make up of the artificial life system, is a self-determination body which has the abilities of self-study. It has the characteristics of selfadaptability, self-organization and evolution. All these characteristics represent action and counteractive between the self-determination body and surroundings. Through the interaction of the elf-determination body each other and the self-determination body and surroundings, the behaviors which are applied to different environments will be selected by training and studying local information. All these embody macroscopically the intelligent performance of emergence[3]. 3.2 Emergence Unlike designing car or robot, artificial life is not beforehand designed. The most interesting example of artificial life exhibits the behavior of ‘emergence’. The meaning of ‘emergence’ is that the interactions of many simple units produce remarkably total performance in the complicated environment. In artificial life, the exhibition of the system is not deduced by the genotype, where the genotype represents sample rules of the system running, the exhibition represents total emergence of the system. Computer speaking, ‘bottom-up’ programming approach allows emerging newly unpredictable phenomenon on the up level. This phenomenon is the key to life system[4]. In this paper, we apply ‘bottom-up’ programming approach to simulate the behaviors of the individual bee in order to emerge the total behaviors of the swarm. 3.3 Finite-State Machine Finite-state machine is a mechanism which made up of finite state. A state in it is called current state. Finite-state machine can receive an input which will result in occurring state transformation, that is, the state transforms from current state to output state. This state transformation is based on a state transformation function. After finishing the state transformation, the output state is become current state. In the state transformation figure of finite-state machine, vertex is represented as state, arrowhead is represented as transfer because it describes FSM transforming from a state to another state. Label text of the transfer is divided into two parts by a bias, which the left part is the name of touching off transfer event and the right one is the name of behavior after touched off transfer. In this paper, we apply finite-state machine to describe the behavior of bee individual in the simulation.
4 Simulations In this section, we will apply the graphical interfaces to realize the simulation, which can visually show the behaviors of virtual swarm in virtual environment at different phases. 4.1 Finite-State Machine The object of our simulation is to simulate the behavior of bees with the method of artificial life. So we not only establish the model of bees, but also place these bee individuals into a dynamic virtual environment. When the environment changes, the
Simulation of Artificial Life of Bee’s Behaviors
41
individuals produce different behaviors vary from different environments. This phenomenon shows that the individuals are adapted to the environment. The environment and the bees can be looked as two objects which oppose and contact with each other. Based on these, we can establish a simulation system through a layered structure, this can be shown in Fig.1. Main program Module Management
Resource Module
Comb Module
Bee Module
flower
Comb
Bee
Fig. 1. Layered structure of the program
4.2 Realization of the Program The best method of implementing the synthesis of artificial life is the ‘bottom-up’ programming approach. The basic idea of this method is that we define a lot of small units in the bottom and several simple rules which relative to their inner and local interaction, then coherent collectivity behavior is produced from the interaction. This behavior does not beforehand organize based on the special rules. The aim of the simulation in our paper is not aim at implementing the behaviors of the swarm but implementing the individual behavior of bee. Although the individual behavior of the artificial bee is single, it produces complicated behaviors of the swarm under the interactions of many individual bees. (1)Establishing the Virtual Environment As we know, the behaviors of the bees are relative to the changes of the seasons or the temperature. So the first task of our simulation is to realize the changes of the seasons in the virtual environment. In general, the life of the swarm in one year can be divided into some periods[2]. According to this, we can divide the seasons as follows: Early spring: February. The queen bee begins to lay eggs in this period. If the queen bee lays eggs, the temperature must be beyond 10 . Based on this, we set the temperature of February 10 ~15 .
℃ ℃
℃
Spring: from March to May.
℃ ℃
Summer: from June to August. We set the temperature of March to July 15 ~35 and August 35 ~25 .
℃ ℃
Autumn: from September to October. We set the temperature of this period 25 ~15 .
℃ ℃
℃ ℃
Late autumn: November. We set the temperature of this period 15 ~5 Winter: from December to January in the following year.
42
B. Wu, H. Zhang, and X. Ni
Fig. 2. The relation between season and temperature
Fig.2 describes the temperature distribution in our simulation. Based on this figure, we can establish a simple function of the temperature change. In the virtual environment, we also simulate the food of the virtual bees, that is, establish the flower. In our simulation, we set some parameters to describe these flowers, such as the location of the flower (X, Y), florescence(BloomingP), the number of farina (UnitFPN), color and size. (2)The Behavior of Bees In our simulation, we describe the behaviors of the queen bee, the worker bee and the drone through finite-state machine. 4.3 The Interface of the Simulation The main interface of the simulation program is shown as Fig.3. The simulation program is divided into five parts: the control of original parameter, data statistic and
Fig. 3. The main interface of the simulation program
Simulation of Artificial Life of Bee’s Behaviors
43
analysis, establishing new comb, motion comb and motion monitor. The user can set original parameters through parameter control panel, such as season, month, the performance of the queen bee, the number of swarm in the system, and the total number of the bees. We set different original parameters in order to observe the affects of these parameters. During the program running, if you put down the button of “establish the new swarm”, you can add the swarm arbitrarily. The aim of this button is that you can observe the affects when the new swarm adds into the virtual environment. 4.4 The Results of the Simulation In this section, we give an experiment of moving bee colony. Firstly, we set the initial values which are as follows: Season: Spring; Month: April; Queen bee is impregnation; The number of the comb: one; The number of the bee: eighty The number of the farina in comb: ten thousands The number of the flower: one hundred; The content of the farina in one flower: one thoudred The position of the comb is (5496, 4577) which is established randomly by the system. Fig.4 (a) gives the emluator running statement after eleven days. From this picture, we can see that the number of flower is very small around the comb. This can affect the number of the farina in the comb. After that, we move the comb to a new position (1000, 5000). The picture after moving the comb is as shown in Fig.4(b). Just on this, the swarming is happened. Fig.4(c) is the statement picture of the original swarming. After producing the new queen bee, the old queen bee and some worker bees leave the comb to build a new comb which new position is at (6310,4769). Fig.5 is the increasing picture of the farina in the comb after twenty days. In this picture,
(a) Fig. 4. The progress picture of emluator running
44
B. Wu, H. Zhang, and X. Ni
(b)
(c) Fig. 4. (continued)
Fig. 5. The schedule graph of pollen in hive when emluator run for 20 days
there are two curves, C1 and C2. C1 is represent as the increasing curve of the farina of the old comb, while C2 is represent as the increasing curve of the farina of the new comb after swarming.
Simulation of Artificial Life of Bee’s Behaviors
45
5 Conclusions In this paper, we apply the graphical interfaces to realize the behaviors of the swarm in the virtual environment. The proposed program emerged the collectivity behaviors of the whole swarm through implementing the individual behaviors of the bees. That is not simple simulation but is virtual swarm which has artificial life. In the visual interface, we can see that new swarms produce and old swarms die. All of these are the results of the interactions of individual bees each other. If the program runs forever, we must be think that it is an ecosystem of the bees.
References 1. Zhou, D.Y., Dai, R.W.: Adaptability Behavior and Simulation. Journal of System Simulation 6, 578–583 (2000) 2. Sun, Y.X.: The Bees. Chinese curatorial Press, Beijing (2001) 3. Wu, J.B.: Emergent Behaviors of Autonomous Agents. Micromachine Development 6, 6–8 (1997) 4. Li, J.H.: Artificial Life: Explore New Form of Life. Research on Nature Dialectic 7, 1–5 (2001)
Hybrid Processing and Time-Frequency Analysis of ECG Signal Ping Zhang, Chengyuan Tu, Xiaoyang Li, and Yanjun Zeng* Beijing University of Technology, P.R. China 100022
[email protected]
Abstract. A new simple approach basing on the histogram and genetic algorithm(GA) to efficiently detect QRS-T complexes of the ECG curve is described, so as to easily get the P-wave (when AF does not happen) or the f-wave (when AF happens). By means of signal processing techniques such as the power spectrum function the auto-correlation function and cross-correlation function, two kinds of ECG signal when AF does or does not happen were successively analyzed, showing the evident differences between them.
,
1 Introduction The ECG (electrocardiogram) is a standard clinical examination method and as such a valuable tool in the diagnosis of cardiac disease. A key element in the automatic analysis of the ECG signal is the detection of QRS complexes [1]. Once the QRS complexex is detected, one can analyse the patient’s HRV (heart rate variability) along with a number of other parameters which are of diagnostic significance. ECG processing strategies which have been applied to detect QRS complexes are based on various methods such as band-pass filtering, adaptive filtering, nonlinear adaptive filtering, etc. [1-2]. Owing to the complexity and considerable computational expense associated with these filtering methods, their applicability (particularly, in clinical practise) is restricted. Recently, along with the development of analysis techniques by means of wavelets, a number of methods based on wavelet transform for detecting QRS complexes have been put forward[1,3-9]. These methods demand, however, the availability of a suitable mother-wave reflecting the properties of the signal to be analysed so that the important local features of this signal in the time domain as well as in the frequency domain are all preserved after a wavelet transform. Moreover, these methods rely on the definition of a suitable scale so that the signal abruptness may be preserved. If these conditions are not fulfilled, it is quite possible that there appears an omission (a QRS complex is not detected) or a mistake (something detected is not a QRS complex). In order to find a better solution to these problems, a simple and effective method based on histogram and the improved GA to search and detect QRS complexes has been developed by the authors. And as an example of its novel application, the P-wave can be extracted easily and efficiently from ECG curve whenever AF is absent or the f-wave can be analogously extracted when AF occurs. *
Corresponding author.
K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 46–57, 2007. © Springer-Verlag Berlin Heidelberg 2007
Hybrid Processing and Time-Frequency Analysis of ECG Signal
47
2 Detection of QRS Complexes from the ECG Curve 2.1 Fast Search for QRS Complexes The ECG plot appeared on a computer screen may be considered as a two-dimensional picture consisting of elements, organised in rows and columns, with value 0 (corresponds to white) and 1 (corresponds to black). The parameter QOP (quantity of pixels) is defined as the total number of picture elements per column, from which a histogram over the entire plot is obtained. The information embodied in the histogram can be used for a rapid detection of QRS complexes The ECG signal appears as a curve in the t-(time-) domain is shown in Fig. 1. For the further analys, we define several technical terms: X ECG picture matrix (binary: 0 corresponds to white, 1 corresponds to black)
Fig. 1. Typical ECG waveform
x(i, j) the related element of the matrix X d(j) QOP(the total number of picture elements of the related column) i, j the row coodinate and column coordinate of the element x(i, j) thereby
d ( j ) = ∑ x(i, j ) i
(1)
D={d(j)} where the set D = { d(j)} appears as a vector. The range of i and that of j are determined by the size and resolution of the ECG plot considered. For a typical ECG frame on a computer screen, we generally let: i = 1, 2, . . . , 600; j = 1, 2, . . . , 1200 Figure 2 shows the picture corresponding to the set D, namely the histogram, in which the abscissa is time, and the ordinate is QOP. Figure 3 shows the histogram after thresholding, i.e., the picture corresponding to a new set Dth obtained by means of selecting a suitable threshold value d0 (see Eq. (2)).
48
P. Zhang et al.
Fig. 2. The histogram corresponding to Fig. 1
Fig. 3. The threshold-form of Fig. 2
Dth={dth(j)} dth(j)= d(j), when d(j)≥d0 dth(j)=0 , when d(j)
(2)
Comparing Fig.1, Fig.2 and Fig.3, we easily see that the relative maxima in Fig. 3 correspond to the peaks of the underlying R-wave. Let n(k) denote the column coordinate of the peak of k-th R-wave, then a new set, N, constructed from these column coordinates, is obtained as follows N = {n(k)} = {n(1), n(2), . . .}
(3)
2.2 Criterion to Detect QRS Complexes Let the size of picture matrix, X, be K ×L (row × column), and that of the figure matrix Qqrs of the QRS mould (Fig. 3) be K1 ×L1 (elements qij ), and the characteristic vector of the mould be Dqrs :
Dqrs = [ y j ] j =1,2,LL, L1 ,
K1
y j = ∑ qij i =1
(4)
Then we can easily find out by means of this mould the positions of related QRS complexes through a few sequential searching at the corresponding coordinates in Fig. 1, as expressed by Eq. (3). The criterion utilized in this search process is related to the quantity of unmatched points, ek, and a new characteristic vector, Dk. An unmatched point is defined as such a point in the searched region where a difference exists between the values of the
Hybrid Processing and Time-Frequency Analysis of ECG Signal
49
corresponding elements of the two matrix Qqrs and Qk. Here,Qk is a figure matrix with the same size as the mould matrix Qqrst. As for the quantity of unmatched point ek, it can be calculated as follows:
∑ (Q xorQ k
qrs
)
(5)
where xor denotes an exclusive-or operation. This operation is carried out between the corresponding elements of ek and those of Qqrs and results in a new matrix. Thereafter we perform a ∑ operation (summation operation) with all the elements of this new matrix. As for the characteristic vector Dk, it is a set whose elements corresponds to QOP of the k-th column in the sub-region to be searched. The matching principle is as follows: A pattern that satisfies the following two requirements is just the QRS complex we want
(1-cp)*Dqrs ≤Dk≤(1+cp)* Dqrs, cp∈(0,1) e = min{ ek }k=1,2,…≤ ε
(6)
where ε is the given tolerance of e. 2.3 Using an Improved GA to Determine the Value of CP and Which Mould Will Be Adopted In this paper, we developed an improved GA, which is distinguished by its three new operations: restoration, reconstruction and recording-the-better, and by its ability of auto-adjustment of the parameters pc and pm(as shown in step 4 of the algorithm below) so as to converge to a globally-optimal solution without any influence on the stochastic ability of the following search process. This GA can be expressed as
: GA = { Se,Cr,Mu,Rs,Rc,Rb,Ed,fv }
(7)
where the elements of this set are Se......selection; Cr......crossover; Mu......mutation ; Ed......encoding, decoding; Fv......evaluation of fitness; Rs......restoration; Rc......reconstruction; Rb......recording-the-better
(8)
Now, we introduce several expressions of the functions of fitness, such as f((i,t)≡ f(xi(t))...... fitness of the i-th individual xi(t) at moment t
(9)
the better fitness at moment t
f m (t ) ≡ min{ f (i, t )} i
fm≡ the fitness (known as recording the better one) stored in the computer f*m (t)←fm(t) whenever fm (t)< fm ε= the given tolerance of fm and the meanings of these three new operations are as follows:
(10)
50
P. Zhang et al.
restoration Rs: whenever a crossover or a mutation fails( as fm(t)>fm ), we reject this unfavorable operation, and let the population state return to its state previous to that operation. reconstruction Rc: while a crossover or a mutation fails many times, let the population be reconstructed. recording the better Rb: whenever a crossover or a mutation succeeds( as fm(t)
Hybrid Processing and Time-Frequency Analysis of ECG Signal
51
ELSE GOTO
step 3;
END ELSE GOTO END
step 6;
END step 5(recording-the-better): f*m(t) ←fm(t); fm ←f*m (t); t ← t+1; k ←0; GOTO step 3; step 6: restoration; GOTO step 4; step 7: reconstruction; GOTO step 3; step 8: decoding; output the solution; step 9: stop. In the algorithm described above, t denotes the number of times of iteration, whereas T is the upper limit of t (as any real-time optimization process adopts a finite t), n denotes how many times the crossover or mutation successively failed, and N is the upper limit of n; k denotes how many times the restoration failed, and K is the upper limit of k. As for the algorithm of a crossover or a mutation, refer to reference [10]. It is worthy to point out that, generally, N=0.001~0.01T for a large T value, whereas N=0.01~0.2T for a small T value. A suitable value must be also chosen for K, and it may be K=0.01~0.1T. Applying this improved GA to optimize the selection of QRS-T moudle and the value of cp, there are two parameters we must deal with: the series number of QRS-T moudle and the value of cp. With the data from MIT/BIH database and that from the Beijing Chao-Yang Hospital, we took 100 QRS-T moudles. And from domain (0, 1), we took 50 numeral values. All these 100×50=5000 data together constructs the original population group under our consideration. Another two parameters of the above GA may be choosen as population size Popsize =100 length of the chromosome string L =13 As regards the function of fitness, the following is preferable: f(t) = e . where e is defined as the same as in Eq.(6).
(11)
52
P. Zhang et al.
3 Detection Rate With the data from MIT/BIH database and those from the Beijing Chao-Yang Hospital, we make a random sampling of 20070 times of cardiac cycle from 32 ECG plots, and try to detect one by one the QRS complex of each period by means of the method developed by the authors as described above. The results are as follows Table 1. The results of QRS complexes detection
times of cardiac cycle 20070
numbers of mistake 37
numbers of omission 42
detection rate 99.61 %
* detection rate =[times of cardiac cycle-(number of mistake+number of omision)]/ times of cardiac cycle.
4 Extracation of the P-Wave and F-Wave from ECG Curve The authors developed a novel application of the above method as follows. While a QRS-T complex (instead of a QRS complex) has been identified, remove it from the ECG curve. As the U-wave can be negligible, the remainder is nothing but the P-wave when AF (atrial fibrillation) does not happen, or is the f-wave when AF happens.
(a) P-wave
(b) f-wave Fig. 4. P-wave and f-wave
Hybrid Processing and Time-Frequency Analysis of ECG Signal
53
As shown in Fig. 4, the P-wave appears to be a series of smallwave-packets with relatively concentrated energy, whereas the f-wave takes the form of a series of irregular oscillations with their energy quite dispersed. 4.1 The Signal Processing and Analysis of ECG Signal Data used in our work are taken from MIT/BIH database as well as from Beijing Chao-Yang Hospital, among them there are 50 examples wherein AF happened, and the other 50 ones wherein AF did not happen. Our methods of signal processing and analysis relate to many techniques: the power spectrum function, the auto-correlation function and the cross-correlation function. Curves corresponding to the related functions have been normalized so that we can easily deal with them. 4.2 The Power Spectrum After a FFT operation on ECG's data, we can discover the related amplitude-frequency characters, so as to draw the ECG's power spectrum curve as shown in Fig.5. It is easily seen that the spectrum lines are uniformly distributed and the spectrum valleys stay at or near the zero value points when AF does not happen, whereas those lines distributed quite non-uniformly and the valleys stay somewhat far away from the zero value points when AF does happen.
(a) when AF does not happen
(b) when AF happens Fig. 5. The power spectrum
54
P. Zhang et al.
Now we discuss the dynamic frequency spectrum. For each sampling, ECG signal of eight sequential time intervals (10 seconds as one interval) is as group of data prepared. As QRS-T complexes are removed, the remainder will be P-wave( when AF does not happen ), or be f-wave( when AF does happen ), and then we do a FFT operation on each sample and draw a corresponding dynamic frequency spectrum, as shown in fig.6. Comparing Fig.6 (a) with Fig.6 (b), the difference between these two kinds of dynamic spectrum is very evident. The energy distribution of f-wave looks concentrating in quite an arrow interval (such as 0-5 Hz) when AF happens, whereas that of P-wave looks dispersing within a relatively wide interval when AF does not happen. Moreover, f-wave's dynamic frequency spectrum curves in different time interval differ one another, showing the irregularity of f-wave. 4.3 The Auto-correlation Function The auto-correlation function is utilized for describing the degree of correlation of values of a signal sampled at different time, being a kind of measurement of the degree of interrelation between these values. Let the sampling-series of values of ECG signal be x(n), its auto-correlation function is then as follows:
1 N →∞ 2 N
Rxx (m) = lim
N
∑ x ( n) x ( n − m)
n =− N
(12)
This function, shown as a corresponding curve, is given in Fig.7 (a) when AF does not happen, or in Fig.7 (b) when AF happens.
(a) when AF does not happen
(b) when AF happens Fig. 6. The dynamic frequency spectrum
Hybrid Processing and Time-Frequency Analysis of ECG Signal
55
(a) when AF does not happen
(b) when AF happens Fig. 7. The auto-correlation function
Comparing Fig.7 (a) with Fig.7(b), we see that the amplitudes on the auto-correlation curve descends rapidly with their amplitude ratio(Rmax1/Rmax2) >4.5 when AF happens, whereas that descends relatively slowly (Rmax1/Rmax2)<3 when AF does not happen.
5 The Cross-Correlation Function The cross-correlation function denotes the correlation between the values of two different signals sampled at different time.
1 N →∞ 2 N
Rxy (m) = lim
N
∑ x ( n) y ( n − m)
(13)
n =− N
Let the sampling series of the signal values of QRS-T mould be y(n), and that of ECG signal be x(m), the cross-correlation function is then as follows: This function, shown as a corresponding curve, is given in Fig.8 (a) when AF does not happen, or in Fig.8 (b) when AF happens. It is easily seen from fig.8, that the degree of correlation between ECG signal and the QRS-T mould signal appears to be relatively maximal at points where QRS-T complexes occur, and that on the cross-correlation curve there appear all the corresponding waves quite similar to the QRS-T complexes. It is also seen that, when AF does not happen, QRS-T complexes separate each other relatively uniformly, and
56
P. Zhang et al.
(a)
when AF does not happen
(b)
when AF happens
Fig. 8. The cross-correlation function
within the spaces between these complexes there are some relatively regular oscillations; whereas whenever AF happens , the QRS-T complexes separate each other non-uniformly and there are a series of very irregular oscillations within the spaces between two successive complexes.
6 Summary The authors developed a simple and effective new approach to remove QRS-T complexes from ECG curve, so as to easily get the P-wave when AF does not happen, or gain the f-wave when AF happens. By means of the signal processing methods used in this paper such as the power spectrum function the auto-correlation function the cross-correlation function etc., the distinctions between these two kinds of ECG curve, even too minor to be observed by a common people, do appear obviously on its frequency-domain pattern, which enable us to easily diagnose whether AF happens or not.
、
、
References 1. Kohler, B.U., Henning, C., Orglmeister, R.: The Principles of Software QRS Detection. IEEE Engineering in Medicine and Biology, pp. 42–57 (January/February 2002) 2. Keselbrener, L., Keselbrener, M., Akselrod, S.: Nonlinear high pass filter for R-wave detection in ECG signal. Med. Eng. Phys. 19(5), 481–484 (1997)
Hybrid Processing and Time-Frequency Analysis of ECG Signal
57
3. Gamo, C., Gaydecki, P., Zaidi, A., Fitzpatrick, A.: An implementation of the wavelet transform for ECG analysis, Advances in Medical Signal and Information Processing, 2000. In: First International Conference on (IEE Conf. Publ. No. 476), 4-6 September, pp. 32–40 (2000) 4. Li, X.Y., Wang, T., Zhou, P., Feng, H.Q.: ST-T complex automatic analysis of the electrocardiogram signals based on wavelet transform. In: IEEE 29th Annual, Proceedings of Bioengineering Conference, 2003, 22-23 March, pp. 144–145 (2003) 5. lnoue, H., Iwasaki, S., Shimazu, M., Katsura, T.: Detection of QRS complex in ECG using wavelet transform (in Japanese). In: IEICE Gen. Conf., vol. 67(A-4), pp. 198–207 (March 1997) 6. Kadambe, S., Murray, R., Boudreaux-Bartels, G.F.: Wavelet transform -based QRS complex detector. IEEE Tran. Biomed. Eng. 46, 838–848 (1999) 7. Bahoura, M., Hassami, M., Hubin, M.: DSP implementation of wavelet transform for real time ECG waveforms detection and heart rate analysis. Computer Methods and program in Biomedicine 55(1), 35–44 (1997) 8. Sahambi, J.S., Tandon, S.N., Bhatt, R.K.P.: A new approach for in-line ECG characterization. In: Proceeding of Fifteenth Southern Biomedical Engineering Conference, Dayton, USA, pp. 409–411 (1996) 9. Sahambi, J.S., Tandam, S.N., Bhatt, R.K.P.: Using wavelet transform for ECG characterization. IEEE Eng. Med. Biol. 16(1), 77–83 (1997) 10. Mitsuo, G., et al.: Genetic Algorithms and Engineering Design[M]. John Wiley & Sons Inc., New York, USA (1997)
Robust Stability of Human Balance Keeping Minrui Fei1, Lisheng Wei1, and Taicheng Yang2 1 Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics and Automation, Shanghai University, Shanghai 200072, China
[email protected],
[email protected] 2 Department of Engineering and Design, University of Sussex, Brighton, BN1 9QT, UK
[email protected]
Abstract. Despite its apparent simplicity, the nature of the control mechanisms that allow humans to stand up is still an object of great research interest [1-9]. In a recent paper [1], a PID controller with a sensory delay is proposed to model the central nervous system for the control of balance keeping; and based on experiment data it is suggested that ageing people with poor balance keeping ability can be explained by a reduced derivative gain in the PID controller. Using the models presented in [1], this paper studies a further topic: robust stability of human balance keeping. Computation methods to find the ranges of the controller parameters for which the closed loop system is stable, and with a given stability phase or gain margin, are presented. An example is used in the paper to demonstrate the application of these methods.
1 Introduction Human bipedal stance is inherently unstable since it requires that a large body consisting of multiple flexible segments is kept in an erect posture with its center of mass (COM) located high above a relatively small base of support. The complexity of this system and its ability to maintain stable stance, despite various perturbations, have attracted the attention of many researchers in the field and have inspired various theories that try to explain the control mechanism of bipedal quiet stance, for example see [2] and references therein. The ankle joint torque needed to control the body during quiet stance can be evoked actively and passively. Passive torque components are the result of the intrinsic mechanical property, i.e. stiffness and/or viscosity, produced by muscle and surrounding tissue, such as ligaments and tendons. We can refer to the additional torque as active torque, which is generated by active muscle contraction. Since the COM is located in front of the ankle joint, plantar flexing torque is continuously required to prevent the body from falling forward [2]. However, the passive torque by itself is not sufficient to ensure this required plantar flexing torque [3–5]. Therefore, an additional active torque, regulated by the central nervous system (CNS) and produced by the plantar flexors, is needed [3–9]. In a recent work [1], based on experiment data, a model of “PID plus a delay” for the central nervous system is K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 58–66, 2007. © Springer-Verlag Berlin Heidelberg 2007
Robust Stability of Human Balance Keeping
59
proposed and it is found that (1) Balance-keeping ability can be analyzed based on body sway and the body sway is significantly increased in a balance-deficient group compared to a normal group. The elderly, who are more prone to falls, exhibit more extensive body sway, suggesting poorer balance-keeping ability; (2) To quantify the influence of aging, a model of PID plus a delay is used and it is observed that aging causes the value of kd in the PID controller to decrease; and (3) the clinical importance of kp and ki is still unclear and further research is necessary. This paper extends this work to study robust stability of a closed-loop system model of human balancing keeping. The model consists of an “inverted pendulum”, a simplified and commonly used “plant model” for the study of human upright standing [2-9], and a PID controller plus a delay for the central nervous system [1]. The details of the closed-loop system model and the robust stability analysis are presented in Section 2 and Section 3 respectively.
2 Model of Human Balance Keeping Figure 1 is a simplified structural model of static upright standing. Where m1 is the mass of the two legs, m2 is the mass of the pelvis, and m3 is the mass of the upper trunk. Experimental results show that the lumbosacral joint moves opposite to the direction of the ankle joint, suggesting that the trunk is kept perpendicular to the horizontal. The inverted pendulum provides a simplified model of upright standing in humans since, like the inverted pendulum, humans need feedback to maintain balance. Similar to control systems for engineering systems, balance-keeping control consists of sensors, actuators, and a controller. If the central nervous system is modeled as a PID controller, then the closed-loop system can be represented by a block-diagram of Figure 2.
left
m3
right
D
θ
l2
C
θ m1 A
m2
l1
B
m1
lg d
d
Fig. 1. A simplified structural model of static upright standing [1]
60
M. Fei, L. Wei, and T. Yang
Sensors+ Neuromuscular System kp + + kd s + + ki/s e- s
Inverted Pendulum Body [2m1lg+(m2+m3)l1]gsin
θ
+ +
2 1 g
2 1
[2m l +(m2+m3)l ]s
τ
2
com
sensory systems
Fig. 2. A block diagram of a closed-loop system for human balancing keeping [1]
It can show that the closed-loop system characteristic equation of Figure 2, the roots of which determine the system stability, is given by:
1 + Gc ( s)G p ( s ) = 0
(1)
Where: Gc ( s ) is the transfer function of the PID controller; and
G p ( s ) is the
transfer function for the plant and the sensing delay.
Gc ( s ) = k p +
ki + kd s s
(2)
G p ( s ) = G p1 ( s )G p 2 ( s ) =
(3)
1 e −τ s αs −β 2
Where
α = 2m1lg2 + (m2 + m3 )l12 , β = [2m1lg + (m2 + m3 )l1 ]g (sin θ ≈ θ ) Using the data in [1] gives:
k p = 519; ki = 3.0; kd = 72.3; τ = 0.11sec; α = 66.0; β = 107.0 The system step response in shown in Figure 3, and as expected it is stable. Step Response kd=72.3 2.5 2 1.5 1 0.5 0
0
2
4
6
8
10
Fig. 3. The closed-loop system step response (kd =72.3)
Robust Stability of Human Balance Keeping
61
3 Robust Stability of Human Balance Keeping 3.1 Heads Fundamental: Stability Range of kd For the model presented in Section 2, a general question people likely to ask is: for people have the same body parameters α and β, what are ranges of the central nervous system parameters kp , ki , kd and τ which can keep the body balancing stable. This is a robust stability problem in feedback control theory. A very useful theory for the application here is the “boundary crossing” theory [10]. It says that if the system characteristic equation (1) corresponding to a set of system nominal parameters is stable, varying a parameter or a group of parameters continuously from their nominal values leads to an unstable system, then in such a process, ± jω must be the roots of the characteristic equation for a particular set of changed parameters. Intuitively, when a system changes from stable, when all roots of the characteristic equation are at the left-hand of the s-plane, to unstable, when some or all roots of the characteristic equation are at the right-hand of the s-plane, the root locus must cross the boundary of imaginary axis in the s-plane. In practice, one can put s = jω in Equation (1) and find solutions for values of system parameters. These values are critical values of system parameters and beyond these values, system becomes unstable. To illustrate this, we first assume that the values of kp , ki and τ are fixed and we try to find a critical value of kd . Substituting jω into (2) and (3) gives: we first assume that the values of kp , ki and τ are fixed and put we try to find a critical value of kd .
ki + jk d ω jω k k = k p − j i + jk d ω = k p + j ( k d ω − i )
s = jω , then
Gc ( jω ) = k p +
ω
(4)
ω
and
G p ( jω ) = γ (ω )e − jτω = γ (ω ) cos(τω ) − jγ (ω ) sin(τω )
(5)
Where
γ (ω ) = G p1 ( jω ) =
1
(6)
− αω 2 − β
From (4) and (5) it gives:
GOL ( jω ) = Gc ( jω )G p ( jω ) = [k pγ (ω ) cos(τω ) + γ (ω ) sin(τω )( kd ω − j[γ (ω ) cos(τω )(kd ω −
ki
ω
ki
ω
)] +
) − k pγ (ω ) sin(τω )]
(7)
62
M. Fei, L. Wei, and T. Yang
For 1 + GOL ( jω ) = 0 , the real part and the imaginary part of (7) must satisfy:
A(ω ) = k p γ (ω ) cos(τω ) + γ (ω ) sin(τω )(k d ω −
ki
ω
) = −1
(8)
And
B(ω ) = γ (ω ) cos(τω )(k d ω −
ki
ω
) − k p γ (ω ) sin(τω ) = 0
(9)
From (9):
cos(τω )(k d ω −
ki
ω
) = k p sin(τω )
(10)
Now for a value of ω*, from (10) one can find a value of kd* (kp , ki and τ are fixed known values). Substituting this kd* into (8), if the equation holds, then this kd* is the critical value of kd critical. If equation (8) fails, then try another ω and repeat this process. A computer program can search kd critical over a range of ω. In this example, Step Response kd=59.1 3 2 1 0 -1
0
2
4
6
8
10
Fig. 4. The closed-loop system step response (kd= kd critical =59.1) Step Response kd=50 4
2
0
-2
0
2
4
6
8
10
Fig. 5. The closed-loop system step response (kd= 50)
Robust Stability of Human Balance Keeping
63
we get kd critical = 59.1 and for this critical value ω = 2.56 rad/s. The system step response when kd = kd critical = 59.1 is shown in Figure 4. It also shows that the oscillation frequency is equal to 2.56/2π = 0.41 Hz. Any kd < kd critical will lead to an unstable system. Figure 5 shows an unstable step response when kd = 50. 3.2 Stability with a Phase Margin or a Gain Margin
In practice, one often wants to find a critical value of kd = kd cri_pahse when the system is stable and has a specified stability margin. A phase margin φ is commonly used. In term, we replace G p (s) in (3) with G * p ( s ) = G p ( s )e −ϕ , this leads to:
G * p ( jω ) = (cos ϕ − j sin ϕ )[γ (ω ) cos(τω ) − jγ (ω ) sin(τω )] = [cos ϕγ (ω ) cos(τω ) − sin ϕγ (ω )sin(τω )] + j[ − sin ϕγ (ω ) cos(τω ) − cos ϕγ (ω ) sin(τω )] = C (ω ) + jD(ω )
(11)
Follow the same procedure before, we have: G *OL ( jω ) = [k p C (ω ) − D(ω )(kd ω −
ki
ω
)] + j[C (ω )(kd ω −
A *(ω ) = k p C (ω ) − D(ω )(kd ω − B *(ω ) = C (ω )(kd ω −
ki
ω
ki
ω
ki
ω
) + k p D (ω )]
) = −1
(12)
) + k p D(ω ) = 0
Using the above equations and the same method as before, for a phase margin of φ = 20 degree, we find that kd cri_phase = 132.26 and ω =5.35 rad/s for this kd cri_phase value. Similarly, if it is required to have a gain stability margin of M, one only needs to change (6) to
γ (ω ) = G p1 ( jω ) =
M −αω 2 − β
(13)
Then follow the procedures given in Section 3.1. For example, for a gain margin of M = 1.2, we find that kd cri_gain = 59.43 and ω = 2.87 rad/s for this kd cri_gain value. 3.3 Critical Values of kd for Different Sensing Delays
Due to different characteristics of central nervous system for different people, the value of τ is not the same for different people. Even for the same person, the value of τ is also not fixed under different physical and mental conditions. Following the same
64
M. Fei, L. Wei, and T. Yang 200
Kd
150 100 50 0
τ 0
0.05
0.1
0.15
0.2
0.25
Fig. 6. Critical values of kd for different sensing delay of τ
procedures as before, kd critical is calculated for different sensing delay of τ, and the result is plotted in Figure 6. 3.4 Critical Values of kp and kd for Different Sensing Delays
From equation (10), we have:
kd = ( k p tan(τω ) +
ki
ω
)/ω
(14)
Then, substitute them into equation (8) is obtained
k pγ (ω ) cos(τω ) + γ (ω ) sin(τω )k p tan(τω ) = −1
(15)
That is:
k pγ (ω ) cos(τω )
= −1
So the kp can be substituted as:
kp = −
cos(τω ) γ (ω )
(16)
Substitute equation (15) into equation (13) is obtained
sin(τω ) ki ⎧ ⎪ kd = (− γ (ω ) + ω ) / ω ⎪ ⎨ ⎪ k = − cos(τω ) ⎪⎩ p γ (ω )
(17)
Use the same data ki = 3.0; α = 66.0; β = 107.0 , and assume the sensing delay τ from 0.04sec to 0.20sec. Then we get
Robust Stability of Human Balance Keeping
65
sensing delays from 0.04sec to 0.20sec
0.2
τ(s)
0.15
0.1
0.05
0 2.5
4
x 10
2000 2
1.5
1
1000 0.5
kp(Nm/rad)
0 kd(Nm*s/rad)
(A)
0.15
0.15
0.1 0.05 0
2.5
0.1 0.05
0
1 2 kp(Nm/rad)
(B)
3 4
x 10
0
x 10
2 kp(Nm/rad)
0.2
τ(s)
τ(s)
4
0.2
1.5 1 0.5
0
1000 kd(Nm*s/rad)
(C)
2000
0
0
1000 kd(Nm*s/rad)
2000
(D)
Fig. 7. Critical values of kp and kd for different sensing delays (A): 3D visualization, (B):Kp–τ projection, (C):Kd–τ projection, and (D):Kp–Kd projection
4 Conclusions In this paper, we study the robust stability of the balance keeping control model that can be used for analyzing the balance keeping ability in humans. Experimental results indicate that the central nervous system parameters kd decreases with aging. It is a balance and stability related parameter. Some newly developed methods to find successfully the ranges of kd for which the closed loop system is stable, and with a given stability phase or gain margin, are presented, when the body parameters and the other central nervous system parameters are fixed. All the research findings of robust stability of human balance keeping have crucial theoretical and practicable values. Acknowledgments. This work was supported by Program for New Century Excellent Talents in University under grant NCET-04-0433, Research Project for Doctoral Disciplines in University under grant 20040280017, Key Project of Science &
66
M. Fei, L. Wei, and T. Yang
Technology Commission of Shanghai Municipality under Grant 061107031 and 061111008, Sunlight Plan Following Project of Shanghai Municipal Education Commission, and Shanghai Leading Academic Disciplines under grant T0103.
References 1. Hidenori, K., Jiang, Y.: A PID Model of Human Balance Keeping. IEEE Control Systems Magazine, 18–23 (December 2006) 2. Masani, K., Vette, A.H., Popovic, M.R.: Controlling balance during quiet standing: Proportional and derivative controller generates preceding motor command to body sway position observed in experiments. Gait & Posture 23, 164–172 (2006) 3. Morasso, P.G., Schieppati, M.: Can muscle stiffness alone stabilize upright standing? J. Neurophysiol. 83, 1622–1626 (1999) 4. Morasso, P.G., Sanguineti, V.: Ankle muscle stiffness alone cannot stabilize balance during quiet standing. J. Neurophysiol. 88, 2157–2162 (2002) 5. Loram, I.D., Lakie, M.: Direct measurement of human ankle stiffness during quiet standing: the intrinsic mechanical stiffness is insufficient for stability. J. Physiol. 545, 1041–1053 (2002) 6. Gatev, P., Thomas, S., Kepple, T., Halett, M.: Feedforward ankle strategy of balance during quiet stance in adults. J. Physiol. 514, 915–928 (1999) 7. Loram, I.D., Lakie, M.: Human balancing of an inverted pendulum: position control by small, ballistic-like, throw and catch movements. J. Physiol. 540, 1111–1124 (2002) 8. Lakie, M., Caplan, N., Loram, I.D.: Human balancing of an inverted pendulum with a compliant linkage: neural control by anticipatory intermittent bias. J. Physiol. 551, 357– 370 (2003) 9. Masani, K., Popovic, M.R., Nakazawa, K., Kouzaki, M., Nozaki, D.: Importance of body sway velocity information in controlling ankle extensor activities during quiet stance. J. Neurophysiol. 90, 3774–3782 (2003) 10. Ackermann, J.: Robust Control – system with uncertain physical parameters. Springer, Heidelberg (1993)
Modelling Pervasive Environments Using Bespoke and Commercial Game-Based Simulators Marc Davies1, Vic Callaghan1, and Liping Shen2 1 Digital Lifestyles Centre, Essex University, UK eLearning Lab, Shanghai Jiao Tong University, China
[email protected],
[email protected],
[email protected] 2
Abstract. This paper details an ongoing investigation, linking intelligent buildings and computer game technology. Intelligent buildings are containers for life-sized organisms (people, pets etc), sustaining ecologies that evolve and interact in a symbiotic way with the technological infrastructure, which includes intelligent agents. This work explores how computer games software can be used to create a simulation tool for the development of new ubiquitous agent programs and environments. We report on our experiences of adapting a retail package, (Electronic Arts’ Sims) and building our own bespoke simulator. We use a table to compare and summarise the strengths and weaknesses of each approach; the general conclusion being that there are significant benefits to be gained from adapting commercial games packages for use as professional simulation tools. Finally, we conclude the paper by describing our plans to apply this work to the development of a mixed-reality eLearning application.
1 Introduction 1.1 Why Use a Simulator over a Real-World Test-Bed? Technology is assuming an ever increasing role within the environments in which we live and work [4]. Developing intelligent embedded-agents and pervasive computing environments can be a costly process. When testing agents in a real-world environment, researchers can only perform experiments in real-time (e.g. with each iteration taking days) and often have little control over natural elements, (e.g. sunlight). The reasons for this are that agents model and learn behaviours by monitoring people, as they go about their everyday activities [1]. This makes it practically impossible to repeat tests under identical conditions. When developing a new pervasive agent, current researchers inevitably need a physical device, and/or environment to test their program. Building a simulator from scratch is a formidable task, requiring a considerable programming effort to create realistic graphical environments and user-behaviours (especially interactive behaviours). We hypothesized that a Pervasive Environment Simulator, (PES) based on computer game technology, could take advantage of the existing high-detail graphics physics and some artificial intelligence techniques used in modern games, to provide a high-quality model of a real-world test-bed. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 67–77, 2007. © Springer-Verlag Berlin Heidelberg 2007
68
M. Davies, V. Callaghan, and L. Shen
Additionally we hypothesized that creating a PES by modifying a computer game would be easier and produce a higher quality simulation than a bespoke system. 1.2 Existing Projects Computer games and related technologies are already being used for researching nonentertainment applications by various private and public organizations around the world. The Entertainment Technology Center at Carnegie Mellon University has run a project using their ‘Alice’ graphics engine, to teach artists how to program virtual worlds [11]; In another example, the U.S. ‘Darwars’ training program uses a simulated environment based on the Unreal Tournament game engine, to produce foreign landscapes where soldiers can interact with virtual inhabitants allowing them to acquire language skills [18]. Computer Science skills are taught by allowing participants to design their own computer games, matching the expectations of younger generations, who are unimpressed by simple visualizations [13]. Bespoke simulators are already being used to model household environments. The ‘MavHome’ Project [5] consisted of an intelligent living environment, with certain components, (e.g. window blinds) controllable from by a simulator created for the project [5]. Simulators are also being used to augment telemetry from sensors in realworld locations, improving the reliability of readings and allowing other operations that would otherwise be impossible. For example a security system that augments a camera-feed to allow an observer to ‘see-through’ solid objects, by rendering the hidden space in the simulator [14]. Additionally, simulators can provide training tools for complex tools and vehicles, e.g. flying aircraft, manoeuvring underwater robots etc [3]. Aircraft simulators have been converted into several popular computer game titles, most notably the ‘Microsoft Flight Simulator’ series, useful to prospective pilots learning to fly [12] and of high entertainment value to gamers around the world. This provides encouragement for this project. As a simulator can be converted into a commercial game, the process should be reversible, with games modified into simulators for research and development applications? 1.3 Bespoke Vs. Game-Based Simulators As part of our research two simulators were developed; a) A completely bespoke system, written using the Java programming language. b) A simulator created by modifying an off-the-shelf copy of a popular computer game. Both programs modelled the iDorm2, at the University of Essex. A full sized two-bedroom apartment, constructed to be a pervasive computing test-bed, featuring hollow walls and ceilings fitted with a myriad of embedded-computer based technology [2] [8].
Figs. 1 and 4. Views of the University of Essex iDorm test-bed
Modelling Pervasive Environments Using Bespoke
69
2 Simulator Design 2.1 Bespoke PES Design Rationale. A two-dimensional PES, (2D-PES), aimed to provide a benchmark, for comparison with the game-based PES. Additionally by creating a bespoke system we were able to further our understanding of the program architecture required. This knowledge was used when implementing the game-based 3D-PES, letting us identify the components of the original program requiring modification. It was important to identify how pervasive devices and features could be simulated, later assess which could be incorporated into a game-based PES. Simulator Architecture. In more technical terms the 2D-PES consisted of four Java programs, linked by socket communication; a) Two-programs operating the actual simulator. b) A central server program. c) A third-party agent program, also written using Java. Threads were used to handle time-delays and loops in program code. The central server regulated the exchange of all data between the simulator and the third-party agent program. Readings for sensors in the environment were transmitted Thread Simulator Human Interface
Thread
Simulator, Controllers & Rendering Components
Thread C l 3rd Party Agent Program
Server Program
Fig. 5. Bespoke 2D-PES Architecture
Going to selected room / device B
Going to selected room / device
Hunger > 70%
Hunger = 1%
Hygiene = 100% E
A Hygiene < 30%
Tiredness > 70%
C
Tiredness = 1% Boredom > 70%
Boredom = 1% D
Going to selected room / device
Going to selected room / device
Fig. 6. The Bespoke 2D-PES
Fig. 7. Avatar A.I. architecture FSM
70
M. Davies, V. Callaghan, and L. Shen Table 1. 2D-PES Avatar AI states State A B C D E
Actor Action All needs outside thresholds. No action required from the A.I. Actor continues using current device or following user instructions. Hunger need > 70%. Actor moves to a randomly selected device which can be used to reduce hunger, (refrigerator, oven). Tiredness need > 70%. Actor moves to a randomly selected device which can be used to reduce tiredness, (sofa, chair, bed). Boredom need > 70%. Actor moves to a randomly selected device which can be used to reduce boredom, (phone, television). Hygiene need < 30%. Actor moves to a randomly selected device which can be used to raise its hygiene level, (shower, washing machine).
from the simulator to the agent program on each thread cycle. A list of settings was also received by the simulator, from the agent program, containing states pervasive objects needed setting to by the simulator. The agent determined settings by analysing sensor data sent on the previous thread cycle. Simulation Environment. The simulated iDorm environment, (Fig. 6) contained an avatar inhabitant, (represented by a magenta circle), and numerous static, (grey rectangles) and pervasive objects, (orange/green rectangles). As the avatar interacted with an object, the device changed colour showing the state of an attached sensor, (interaction amounted to switching appliances on/off). If an object was green the attached sensor equalled 1 (high). If orange, the sensor equalled 0 (low). The avatar interacted with objects in response to the level of four ‘needs’ attributes, (hunger, tiredness, boredom, hygiene), which influenced activities performed (Fig. 7, Table 1). 2.2 Commercial Game-Based PES Design Rationale. A three-dimensional PES, (3D-PES), created by modifying an off-the-shelf copy of the Sims computer game, (Maxis/EA Games, 2000). Apart from the 3D graphics and supporting tools, a particularly attractive feature in the Sims was the fairly realistic behaviour of inhabitants. Simulating the behaviour of people is a considerable challenge, the game avatar artificial intelligence, (AI) uses a “competing weighted behaviour” approach. One possible variation of this technique used for the avatar AI in the 2D-PES, is shown in Fig. 7 above. Using a series of weights to create an artificial bias in decision making, an artificial personality representative of a person of any gender or age can be created for an avatar, and with additional research characteristics such as psychological/mental illness, could also be modelled. A PES could create a safety barrier, allowing agents/environments to be tested on a target audience, without placing real people at risk. Possibilities also include social research applications, (e.g. observing people with conflicting personalities living together).
Modelling Pervasive Environments Using Bespoke
71
Simulator Architecture. In more technical terms this system consisted of a five room environment, again modelled on the iDorm2. Each object and person contained in the environment was controlled by at least one thread, placed on a stack and run in sequence by the game. Object threads were used to regulate the animation displayed by the game virtual machine [6]. Most objects could only access their own threads, so for example a television couldn’t access information contained in a thread for a lamp. To create a Sims-based PES, the original program code had to be modified so objects could access threads for other devices and information contained within. For this stage of the project, the most efficient way to achieve this was to program a single Sims object to act as a ‘remote-control’ for other pervasive devices. The ‘Dumbold Voting Machine’ [7] an add-on device available online, was modified to act as a remote-interface, and once re-programmed stored the current state of each pervasive object in the environment to memory. Agent code ran from the voting machine thread prompting state changes to other objects as required. Agents determined when to make changes using sensor values, updated on each thread cycle. Menus from the voting machine were re-programmed providing a manual interface to force actions performed by a Sims avatar, (Fig. 9).
Figs. 8 and 9. The Sims-Based 3D-PES & A Modified Sims Object Interface
Simulation Environment. The Sims game is a simulated domestic environment, designed to model one or several people living their daily lives. The original program allows a player to design, build and furnish a house to their own specifications, using numerous pre-programmed materials and objects available in the game libraries. Using a game to create a PES introduced several advanced features that add greater realism to the environment, but were too minor to allocate resources for programming into a bespoke system; including, avatars who randomly visit the virtual home.
3 PES Comparison Creating two different simulators allowed a comparative study. The results intending to expose issues involved in modifying games, and relative advantages/disadvantages compared to a bespoke system. We discussed the performance of the simulators under four criteria we regarded as important for pervasive computing applications;
72
M. Davies, V. Callaghan, and L. Shen
• • • •
Environment Representation. This criterion covered how realistic the simulator graphics used, made the environment and its objects appear to be. Avatar Representation. How life-like were the movements and behaviours of the avatar inhabiting the virtual environment? How advanced was the AI used? Where actions purely reactive or could the avatar make decisions? Agent Representation. Perhaps the most important feature of a PES, allowing observation of environment changes, to evaluate how test-agents perform. How was influence of agents operating in the environment shown? Programmability. How easy was it to program? Did the platform used contain restrictions, which caused problems during simulator development?
3.1 Comparison Results Table Table 2. The strengths and weaknesses for both simulators under the chosen criteria Bespoke PES
Game-Based PES Environment Representation The speed-of-time could be Realistic 3D Sims graphics and animations. The speed-of-time could be changed. changed. The simulator could be paused. The simulator could be paused. Dawn and dusk are represented Objects were added / changed in the with natural-style changes to light environment quickly using the Sims game levels. features. Two-dimensional Java graphics Lights and windows both illuminated made some features difficult to rooms naturally, with stronger illumination identify. in areas closer to the light source. Added/changing objects in the While dawn and dusk were represented environment required modifying with changes to light levels in the code. environment, the transitions occurred too Lights, radiators and windows quickly to appear natural and sometimes affected the environment evenly caused sensors to miss events. rather than having weaker influence in proportion to the distance from the source object. Avatar Representation Four A.I. ‘needs’ variables were Eight A.I ‘needs’ variables plus social used. values. Avatars interacted with objects by Thought bubbles showed an avatar’s standing next to or sitting on them. desires. No visitors were available. Animations show avatar interaction with Avatars didn’t show any emotion. objects. Inhabitants couldn’t leave the Avatars can visit and/or leave the environment. environment. Avatars didn’t perform event Avatars performed event chains, (e.g. to eat chains for tasks, instead only using they walked to the fridge, cooked a meal at a single object. the stove, then ate at the table). Avatars were messy, leaving rubbish around in unnatural locations and ignoring rotting food.
Modelling Pervasive Environments Using Bespoke
73
Table 2. (continued) Agent Representation Colour changes to objects made Animations make state changes easily state changes easily visible. visible. Agent activities were recorded to Multiple states were available for some file. objects. Agents were loaded from a 3rd Agents could make modifications to the party Java program file, with the environment faster than for the bespoke server blocking any direct system, since the code was part of the simulator contact. simulator program. Only on/off states were possible. Objects could randomly breakdown. Sensors were invisible in the A ‘control’ object in the Sims-PES allowed simulator. agents to be tested by forced avatar The time required for messages interaction. from the simulator and the agent SimAntics agent code had to be program to be passed across the programmed directly into the simulator. server created a short lag-time, Special sections were created during rebefore the environment reacted to programming to facilitate this. It was not possible to create output files. any required changes. Sensors couldn’t be seen in the simulator. Programmability No restricted code. Changes to object code could be made Java is a multi-purpose OO quickly by re-structuring behaviour trees. Edits occur in real-time with the game language with many libraries and running. facilities. A popular programming language Little code other than Sims objects was with programming guides and IDE editable. SimAntics is a visual programming tools. Since everything had to be written language designed for the Sims game, so is from scratch programming took a very specific in which operations could be long time. performed.
3.2 Comparison Environment Representation. The game-based simulator was created by modifying an existing infrastructure, adding and removing code-fragments where necessary. By using the Sims as a template the game-based PES objects looked realistic and could randomly breakdown where appropriate. Avatars had the appearance of real-people, interacting with the environment using realistic motions. The bespoke Java simulator visualized the same objects, but the devices were only shown as rectangles. This could cause confusion in complex demonstrations, if an observer had no knowledge of the layout in the iDorm environment. The 3D simulation of the Sims-PES also included features lost in the bespoke 2D-PES; For example objects mounted on walls. Avatar Representation. Both simulators used ‘needs’ attributes to create an artificial intelligence for avatars inhabiting the environment. The bespoke system was simpler using just four variables to produce a reactive A.I, whilst the Sims game used eight ‘needs’ attributes, plus additional variables allowing some deliberation by avatars in
74
M. Davies, V. Callaghan, and L. Shen
social situations. Small thought-bubbles appear above the head of a Sims avatar showing that character’s mood and/or desires. In a PES this feature can be used to observe how an agent/environment design affects the emotional state of avatars, possibly revealing areas requiring improvement. Agent Representation. The Sims uses pre-programmed animations for many of its objects, to visually display any state changes, (e.g. switching a television on/off). Most of these animations were still present in the 3D-PES, although some were modified or removed for operational purposes. As explained earlier, the bespoke simulator also used animation on a much simpler scale, limited to two animations representing the on/off states of pervasive objects. By re-programming some of the original SimAntics code, some 3D-PES objects could visualise several new states and give different responses from normal to certain scenarios, allowing agents to remotely control devices. The 2D-PES system created output files recording the activities of the avatar and agents interacting with objects in the environment during testing. It was not possible to include this feature in the 3D-PES due to the restrictions and limitations of the Sims code. The simulator could use a feature of the Sims game, which saved/re-loaded the current environment, but no data was recorded to file. Programmability. Sims object code was programmed using the visual language SimAntics, running from the Edith Virtual Machine [6] [16]. A new piece of code was added to the original game, where SimAntics agent programs could be attached directly to the simulator. Components were added to the bespoke 2D-PES ensuring agent programs could be loaded into the simulator from an external Java file, written by a developer. The Sims game required re-programming before objects could be controlled by an agent. This wasn’t a problem for the bespoke PES. 3.3 Comparison Summary Criteria such as ‘Computational Performance’ were intentionally omitted from this evaluation. The aim was to accurately simulate a real-world environment; therefore at this stage of the research we were not concerned with simulator efficiency. Features such as ambient light changes representing dawn and dusk and the needs attributes for the avatar AI were programmed into the bespoke simulator, while the Sims-based simulator had many of these minor-features included as part of the original game. The Sims uses a more advanced AI system for avatars than the bespoke PES. A single inhabitant was used to test both PES environments, partly to reduce the programming requirements for the bespoke system, but mostly to allow each program to be tested using the same set of rules, allowing a more accurate comparison. Neither PES actually displayed sensors in their simulation. This was a decision made during the development stage to reduce the complexity of the simulated environments for this stage of the project. A next-generation PES will include sensors in the simulation, allowing several to be attached to a single object.
Modelling Pervasive Environments Using Bespoke
75
4 The Next Step Our immediate aims are to extend the work to simulate the smart-classrooms (see Figs.10 and 11) used in the Open eLearning Platform in Shanghai, which supports more than 15000 learners. The platform delivers fully interactive lectures to PCs, laptops, PDA, IPTV and mobile phones from high-tech teaching rooms known as smart classrooms. The Essex iDorm includes a study-room, which is typical of the domestic space where remote learning from Shanghai can be delivered. Using the modified simulator, we aim to investigate how a virtual classroom might be best created to give teachers and distributed learners a sense of sharing the same space.
Figs. 10 and 11. The SJTU Smart Classroom & the Remote Classroom
With the simulator, and emotion sensing developed in another project [9], we will also investigate how learner’s emotion evolves and affects the activities in the classroom [15]. This is part of a broader research strategy seeking to link a nextgeneration game-based PES with a real-world test-bed, creating a mixed-reality environment. Some advantages of this set-up would be allowing virtual avatars to interact with real-world objects and vice-versa. Additionally, using virtual sensors to augment real-world counterparts should allow; a) more complex environments to be simulated; b) innovative devices and functions to be evaluated ahead of realisation, (particularly speculative devices that may not physically exist); c) the experience of playing games made more exciting by connecting it to the physical environment. We are also looking at how PES might be situated in globally distributed simulations such as Second Life [10] and Project Darkstar [17].
5 Conclusions In this paper we described the first stage of an ongoing investigation into modelling pervasive environments with computer game technology. Primarily this stage focused on whether it was possible to take advantage of high quality graphics, and pseudorealistic avatar behaviours, provided by computer games, to create a pervasive environment simulator, (PES). We discovered a PES had numerous advantages over a real-world test-bed, most notably; a) the speed-of-time was variable, allowing testing to be performed faster; b) event and sensor readings within the environment could be recorded, allowing experiments to be replayed in full or partially; c) environmental
76
M. Davies, V. Callaghan, and L. Shen
parameters in the virtual home could be specified, allowing agent programs to be tested under identical conditions; d) it has proven to be less expensive, in terms of cost, floor-space and maintenance requirements than using a real environment. We also noted that: a) several researchers could simultaneously use their own copy of a PES, customized to their experimental requirements; b) a PES would be easily portable and presentable, unlike a full-scale real-world environment; and c) a PES eliminates the problem for computer scientists who develop pervasive agents but lack skills required to build real-world devices to test the code. To test our hypotheses we assessed whether modifying a computer game, had greater benefits than creating a bespoke PES or using a real-world environment to test pervasive agent programs. On comparison, (Table 2) for all but one of four criteria, a game-based PES would be more beneficial for pervasive computing research, than a bespoke counterpart. Our hypotheses were proven after modifying a retail-copy of the Sims computer game. A PES boasting high-level graphics and artificial intelligence was created in the same timeframe as a bespoke Java-based simulator, using simple two-dimensional visualisations and more basic A.I. Since the original game code was written by a team of developers with their own ideas, a single person could modify it into a PES but still maintain the ideals of the original programmers, preventing any personal bias from being introduced into the new simulator. In more scientific terms, the more natural behaviours of the Sims avatar and devices are a significant advantage to environments incorporating learning agents. Game A.I. can also be programmed with weights to let an avatar mimic a person of any age or gender. Such features are reflective of the real-world, so must be included in a simulated test-bed useful for developing pervasive agents and environments. Finally, our immediate aims are to extend this simulation work to the creation of mixed reality distributed shared spaces, involving a richer combination of simulated people and appliance based agents. Initially, we plan to create a virtual classroom, based on our well proven Open eLearning and iDorm platforms. Our longer terms aims are to extend this simulation so that it can be used, not only to develop intelligent environments but to study the symbiotic relationships that evolve in such spaces. We hope that this paper will have shown that game technology offers a means to provide an environment that has the potential to support such exciting research. Acknowledgments. We are pleased to acknowledge the support of Electronics Arts who supplied the Edith editor for the Sims. Thanks are also due to Bernard Horan, Sun Microsystems, Michael Gardner, Chimera Socio-Technical Research Institute and Ruimin Shen, Shanghai Jiaotong University, who have greatly motivated this work by describing longer term visions, which we hope to address in future phases.
References 1. Callaghan, V., Clark, G., Colley, M., Hagras, H., Chin, J.S.Y., Doctor, F.: Intelligent Inhabited Environments. BT Technology Journal 22(3) (2004) 2. Callaghan, V., Woods, J., Fitz, S., Dennis, T., Hagras, H., Colley, M., Henning, I.: The Essex iDorm: A Testbed for Exploring Intelligent Energy Usage Technologies in the Home. In: Proceeding of the 3rd International Conference on Intelligent Green and Energy Efficient Building & New Technologies, International Convention Centre, Beijing China, pp. 26–28 (2007)
Modelling Pervasive Environments Using Bespoke
77
3. Chernett, P., Callaghan, V., Colley, M.J., Duffy, N.D., Edwards, I., Herd, J.T., Hunter, J., Lane, D.M., Penrose, J., Randall, G.W., Smith, D., Smith, J., Standeven, J., Whittaker, G.A., Wood, A.: Mixing Simulated and Real Subsystems for Subsea Robot Development. In: IEEE International Conference Oceans 98, Nice, France (1998) 4. Clarke, G., Callaghan, V.: Ubiquitous Computing Informatization, Urban Structures and Density. Built Environment Journal 33(2) (2007) 5. Cook, D.J., Youngblood, M., Heierman III, E.O., Gopalratnam, K., Rao, S., Litvin, A., Khawaja, F.: MavHome: An Agent-Based Smart Home. In: Mattern, F., Naghshineh, M. (eds.) Pervasive computing: first international conference, Pervasive 2002, Zurich, Switzerland, August 26-28, 2002, pp. 521–524. Springer, Heidelberg (2002) 6. Forbus, K.D., Wright, W.: Some notes on programming objects in The Sims™. Northwestern University (2001) 7. Hopkins, D.: Dumbold Voting Machine, Retrieved (2006), http://www.donhopkins.com/ drupal 8. IIEG: iDorm2, Retrieved (March 18th, 2007), http://iieg.essex.ac.uk/idorm2/index.htm 9. Leon, E., Clarke, G., Callaghan, V., Sepulveda, F.: A user-independent real-time emotion recognition system for software agents in domestic environments. Engineering Applications of Artificial Intelligence 20(3), 337–345 (2007) 10. Linden Lab.: Second Life, Retrieved (April 5th, 2007) http://www.secondlife.com 11. Marinelli, D., Pausch, R., LaForce, J.: Entertainment Technology Center. In: Catarci, T., Little Thomas, D.C. (eds.) IEEE Multimedia, Multimedia At Work, vol. 7(4), pp. 78–81 (2000) 12. Microsoft Game Studios: Microsoft Flight Simulator 2004: A Century of Flight, CD (2004) 13. Overmars, M.: Teaching Computer Science through Game Design. IEEE Computer 37(4), 81–83 (2004) 14. Ou, S., Karuppiah, D.R., Fagg, A.H., Riseman, E.: An Augmented Virtual Reality Interface for Monitoring of Smart Spaces. In: Second Annual Conference on Pervasive Computing and Communications, Orlando, Florida ( March 14-17th, 2004) 15. Shen, L., Leon, E., Callaghan, V., Shen, R.: Exploratory Research on an Affective eLearning Model. In: International Workshop on Blended Learning 2007 (WBL 07), University of Edinburgh, Scotland (August 15-17, 2007) 16. Barrett III, P.J.: Sims Zone, The Interview: Retrieved (March 15th, 2007) http:// www.thesimszone.co.uk/interviews/index.php?ID=1 17. Sun Microsystems: Project Darkstar, Retrieved (April 20th, 2007) https://games-darkstar. dev.java.net 18. Voth, D.: Gaming technology helps troops learn language. IEEE Intelligent Systems 19(5), 4–6 (2004)
The Research of Artificial Animal’s Behavior Memory Based on Cognition Xiaojuan Ban1, Shurong Ning1, Jing Shi1, and Dongmei Ai2 1
,
University of Science and Technology Beijing Information Engineering School, Postfach 100083, Xueyuan Road No.30, Hai Dian District, Beijing
[email protected] 2 University of Science and Technology Beijing, Application Science School
,
Abstract. In some artificial systems, performing the realistic perception for actors which will handle both the processes to simulate the sensing organs and identify, will spend most computational time. Unfortunately, this matter even ruins the result of decision based on perception. In order to reduce the computation cost from a systemic view and optimize the performance of system, a brand-new perceptual focuser was proposed. The perceptual focuser is the core of artificial animal sensation system, which provides the external environment and internal condition information for the behavior decision system. Artificial animal behavior memory formation is also the result of the focuser’s analysis focusing. This paper proposes and analyzes two kinds of memory-form algorithm. The quadratic method to food spot which gains has made the variance computation, rejects noise spots which are apart from other normal spots, so that it obtains the expected food distribution position. In view of the quadratic method’s insufficiency, the improvement mean-cluster algorithm profits from the data mining theory, which makes the noise-spotrejection accurately. Select the algorithm according to the different situation, which can make the focuser achieve the validity of the realization of artificial animal food memory.
1 Introduction The cognition, one important part in a memory process, which is also called to recognize again, refers to the apperceived thing in currently to reappear could still be known. The modern cognition psychology thought the cognition process is the information accepting, coding, storing, extracting and using process. Artificial animal model based on the cognition straddles the boundary between the fields of computer graphics and artificial life, and carry on the simulation in the hypothesized environment to it. The important manifestation of cognition in the model is the behavior memory, which is mainly formed by the focuser. This article takes the forage task memory K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 78–87, 2007. © Springer-Verlag Berlin Heidelberg 2007
The Research of Artificial Animal’s Behavior Memory Based on Cognition
79
as the example, and shows the realization process of artificial fish’s behavior memory. The focuser is the core of artificial animal sensation system, namely depends upon a group of online virtual sensors to provide the related information, and has included the sensation attention mechanism, which enables it to control the focuser working under the demand of current task, and filter the useless sensation information to the current behavior demand. Regarding to the artificial fish, the first we must do is to abstract the states which is possibly carried on, and obtain the DFA model describing changes of state. Then focuser abstracts the information and induces into two state primitives, and takes the current state together for the automaton’s input. Then the corresponding output can be obtained, namely the next expected step artificial fish is in. Among them, Hp is the hunger primitive, which describes artificial fish interior states; Hd is the risk factor primitive, which describes artificial fish external environment information. Next time, the focuser will feed back newly produced state primitives, and carry on the revision to the previous step primitive, which realizes the intellectualized focusing process. The DFA model described artificial fish behavior is shown in Fig. 1.
Fig. 1. DFA Model of Artificial Fish Behavior
2 A Realization of Behavior Memory An important characteristic of Animal behavior intellectualization is that it can consider many kinds of behaviors and the environment, then chooses compromise motion. Moreover, animal (including fish) behavior process also is continuous, which cannot make “the behavior blank” appear between two behaviors. In other words, in the process of current behavior, the animal itself already makes the decision of what should be carried on next step, or at least has the tendency and the desire to carry on this behavior. The behavior memory has solved the continuous problem of artificial animal behavior process. After the behavior memory has formed, the artificial animal may act according to the current condition and its own memory, to complete behaviors such as searching for food, mating and so on. 2.1 Description of Data Structure The behavior memory is saved through the chain structure, which is also called the memory chain. After the artificial animal takes the food each time successfully, they
80
X. Ban et al.
store food space position information in the memory chain as a node, and after a period of time tm to form a food position memory chain with certain length. Data Structure is shown in Fig.2.
Fig. 2. Structure of Memory Chain
Among them, head is a memory chain indicator, rear is the tail indicator, and mark is the indicator. The memory chain capacity is not infinite, therefore we set Maxlength=30, which is attribute to memory capacity. It will not be the goal to take the food position record, and what we need is to obtain the expectation position of food distribution by computing, and store it into the Head node, which is the expecting memory of forage task. When the artificial fish returns once again to taking food condition, its memory becomes effective, and then the artificial fish will swim towards a more crowded food position in memory, so that they can easily get food again. 2.2 Description of Algorithm Because of the irregularity of food spatial positions, it is quite difficult to find out the central point of distribution precisely. If we now asks the center of mean value or the center of gravity, the answer will be influenced by some points that are far away from most points, which are called noise points. And the expected position of food distribution will be quite different from the actual. The solution is to use the focuser to kick the noise points out of the memory chain. Then calculate the central point using the points set which has been disposed by focuser. Meanwhile, the memory can also be renewed. When the memory chain is full, it will use the FIFO algorithm, which deletes first several points in the memory chain, and simultaneously save the new obtained points to rear of the chain. As the updating points goes each time, kick out noise points by calculating, so it maintains the forage task memory always in most expected condition. The artificial fish takes the food the position as a node to save in the memory chain. And the algorithms are shown as follows. •
Quadratic Variance Algorithm
The variance is popularly said to be the degree of central deviation, for describing undulation size of one batch of data from central position. The bigger variance is, the more unstable data shows. The quadratic variance algorithm is carried on to calculate two times variance of the data.
The Research of Artificial Animal’s Behavior Memory Based on Cognition
81
1 S 12 = [( x1 − x)2 + ( x2 − x) 2 + ... + ( xn − x) 2 ] n
(1)
S x2n = ( xn − x)2
(2)
1 S 22 = [( S x21 − S 12 ) 2 + ( S x22 − S 12 )2 + ... + ( S x2n − S 12 ) 2 ] n
(3)
S2 Among them, 1 is the first variance value which figures out according to the samS2 ple point, xn is square of the difference between the length of vector according to 2 point N’s position (or the angle with coordinates) and the mean value. S 2 expresses 2 (S 2 − S12 ) 2 the variance of second time. Finally point X whose xn is bigger than S 2 will be considered to be noise point and should be deleted first. Asking the variance one time may not be often unsatisfied, because the noise spots influence the result, and some non-noise spots can also be considered as the noise spot to be rejected. Asking the quadratic variance for the second time so that the noise points deviation scope will be enlarged, which can reduce the influence of the noise points. What needs to explain is, this noise reduction method is to find out most irregular points. But when points are distributing in several pieces, in one piece points are very close to each other, this algorithm will almost lose its efficiency.
•
The improved mean-cluster algorithm
In view of the flaw of quadratic variance algorithm, I improve the mean- cluster algorithm, to carry on noise reduction processing. The algorithm description is as follows. 1. Take each initial sample point as a cluster project. 2. Put one project into a class which is closest to it, then calculate center coordi nates of two classes which obtains or loses projects. 3. Do step 2 till projects cannot be redistribution. 4. Give each kind of fish its own respective identification scope, and kick out all noise points that fall outside the scope. 5. Calculate gravity center of points left, and it would be the memory of food position. Although cluster algorithm is quite complex, but it may accurately calculate the expected food distributed center position, which has overcome the flaw of quadratic variance algorithm.
82
X. Ban et al.
3 Experiment Result 3.1 Quadratic Variance Algorithm Take the vectors in the memory chain as a sample, and test the effect of the algorithm. The sample set shows in the following Table 1. By calculating, point 1 6 8 and 18 must be the noise points, and the average vector modulus is 5.875 after kicking them out of the set. Noise points’ distribution shows in Fig. 3. When the sample vector modulus distribution assumes as several crowded spot cloud, the quadratic variance algorithm cannot pick one of those spots clouds out,
、、
Fig. 3. Distribution of Noise points Table 1. Sample set 1 ID 1 2 3 4 5 6 7 8 9 10
Modulus 2.23 6.85 5.56 3.92 8.10 10.58 2.91 9.65 7.56 5.73
ID 11 12 13 14 15 16 17 18 19
Modulus 4.89 6.32 7.67 5.61 7.58 6.54 3.13 2.49 5.75
The Research of Artificial Animal’s Behavior Memory Based on Cognition
83
Table 2. Sample set 2 ID 1 2 3 4 5 6 7 8
Modulus 1.1 1.2 1.3 1.4 1.25 1.34 1.61 1.54
ID 9 10 11 12 13 14 15 16
Modulus 7.8 8.7 8.0 8.5 7.98 8.21 8.35 8.13
Fig. 4. Sample Set 2
while rejects some spots of each piece from spots cloud, then the result must be incorrect, which has big error. The sample set 2 shows this question. Point 1 7 9 10 12 and 13 are noise points, and the result is 4.702, which is obviously incorrect and is shown in Fig.4.
、、、 、
3.2 The Improved Mean-Cluster Algorithm The sample set of points is shown in Table 3. The minimum distance between two points (one is 6, the other is 15) of the set is 0.977. After calculate central point (ID=18) of point 6 and point 15, delete them temporarily. Then calculate distances again and do the same operation till there is only two points left. Points whose ID numbers are larger than 17 are central points. The cluster relationship shows in Table 4 and Fig.5. The account ’n’ of notation ’-’expresses that after n times of calculation that point can be chosen.
84
X. Ban et al. Table 3. Sample set 3 ID 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
X 10.23 2.85 5.12 -1.23 -7.5 1.03 -3.6 2.8 2.3 1.47 1.29 -1.6 0.01 0.39 1.23 5.2 -3.9
Y 2.15 2.36 2.15 -2.15 2.1 5.36 -4.2 6.39 -3.2 2.15 -1.23 -1.03 -2.41 1.27 5.25 -5.23 1.28
Z 1.68 3.2 4.25 -1.68 -3.45 1.36 -5.2 1.2 1.1 -3.21 0.2 1.64 -1.38 -1.3 2.31 -2.09 1.08
Table 4. Cluster relationship ID 6 4 8 10 9 2 19 12 17 20 21 27 5 1 16 30
ID 15 13 18 14 11 3 22 24 25 23 26 28 7 29 31 32
C 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 End
D 0.977 1.302 2.090 2.364 2.390 2.510 3.247 3.258 4.508 4.675 4.791 5.909 7.613 9.093 8.262 11.69
Center coordinate 1.13 5.305 1.835 -0.61 -2.28 -1.53 1.965 5.848 1.518 0.93 1.71 -2.255 1.795 -2.215 0.65 3.985 2.255 3.725 0.593 -2.248 -0.44 -0.50 -1.639 0.6 -2.20 -0.179 0.84 2.975 4.051 2.621 -0.64 0.765 -0.708 1.169 2.408 0.957 -5.55 -1.05 -4.325 5.700 2.279 1.318 5.450 -1.475 -0.386 -0.05 -1.263 -2.355
Each cluster result corresponds to a distance value. Regarding to the given artificial fish sensation scope d, distances which are smaller than d are out of sensation scope.
The Research of Artificial Animal’s Behavior Memory Based on Cognition
85
Fig. 5. Cluster relationship
Fig. 6. The route choice of artficial fish without behavior memory
In this example, when d=2.42, we can get the center point G=(1.032,1.27,-0.156), and that would be what we need. In the space of three dimensions, artificial fish can get foods use this method. This can be shown in Fig.7 and Fig.8. The artificial fish (shown in Fig.7) with behavior memory can swim and tend towards the center point of foods by computing. The artificial fish (shown in Fig.6) without behavior memory swam and kept away from foods.
86
X. Ban et al.
Fig. 7. The route choice of artficial fish with behavior memory
4 Conclusions As is shown in experiment above, the quadratic variance algorithm has smaller computational complexity, but its application is also limited. The improved mean-cluster algorithm can discover precisely each cluster, but it’s more complex than the former. Animal's sensation result is the feedback of its own impression, which forms the memory through the cognition to be fuzzier. As artificial fish’s low status, it enables the sensation result only to form a general impression. Therefore, in hypothesized environment artificial fish may only need to get the sensation to the environment approximately, and this causes the probability of quadratic variance algorithm to be used in A Fish as well as the improved mean-cluster algorithm. The artificial animal is the hypothesized realization to the nature survival animal; therefore its kind is varied. Each kind has different sensation ability. If one kind of fish has shorter life cycle, worse sensation ability and smaller type, the quadratic variance algorithm is the good suitable choice. On the contrary, if it is longer life cycle, well developed sense organ, the improved mean-cluster algorithm will be better. This article is mainly discussed the behavior memory formed algorithm, its good and bad points and the application scope based on the focuser, which enable the artificial animal to have certain life characteristic, and has confirmed the efficiency of the theory. The next step is sensation fusion, which will cause the sensation focuser to be more functional, and then the artificial animal will be able to be more lifelike, and its life characteristic will also be able to be richer. Acknowledgments. This work is supported by National Natural Science Foundation of P.R. China (No.60503024).
The Research of Artificial Animal’s Behavior Memory Based on Cognition
87
References 1. Langton, C.G.: Artificial Life[J], SFI Studies in the Science of Complexity (1998) 2. Xiaoyuan, T.: Artificial Fish–Artificial Life Approach of Computer Animation[M], Beijing, Tsinghua University (2001) 3. Xiaojuan, B., Hongjuan, C., Zhaoshun, W., Xuyan, T.: Research on Cognitive Modeling Approach for Artificial Fish[J]. Computer Engineering and Applications 8, 13–15 (2002) 4. Xiaojuan, B., Guangping, Z., Xuyan, T.: Design and Implementation of Perception System Based on Self-Learning for Artificial Fish. Chinese Institute of Electronics 32, 2041–2045 (2004)
How to Ensure Safety Factors in the Development of Artificial Heart: Verified by the Usage of “Modeling and Simulation” Technology Mitsuo Umezu Integrative Bioscience and Biomedical Engineering, Graduate School of Waseda University, #58-322 3-4-1 Ohkubo, Shinjuku, Tokyo, 169-8555, Japan
[email protected]
Abstract. The author has involved in two types of clinically available artificial hearts in Japan for these 30 years. Firstly, Toyobo auxiliary pulsatile ventricular assist pump was commercialized in 1991 and over 700 clinical cases are reported in Japanese market. Secondly, an implantable non-pulsatile ventricular assist pump (EVAHEART, Sunmedical Tech. Res. Co.) has been implanted into 11 patients in Japan. The author has been establishing a methodology to eliminate considerable risk factors through a development of hydrodynamic performance test, durability test and biocompatibility test. These in vitro tests are all effective to ensure a safety of the system and also in vitro tests have a contribution to reduce a number of animal experiments.
1 Introduction The author has 30 years experience on the development of artificial hearts, and involved in two types of Japanese-made artificial hearts which have been applied clinically in Japan, as shown in Fig.1. Firstly, auxiliary pneumatically-driven pulsatile assist pump was commercialized by Toyobo Company in 1991 based on the fundamental studies by the artificial heart group of the National Cardiovascular Center Research Institute, Osaka. [1-2] This device has been implanted in over 700 patients in Japan up to now. On the other hand, implantable centrifugal type ventricular assist device project was organized by Dr.Kenji Yamazaki of Tokyo Women’s Medical University in 1990 and Sun Medical Technology Research Co., Waseda University and University of Pittuburgh Medical Center have been contributed for the development of clinical quality ventricular assist pump, called EVAHEART[3-4]. It has been implanted into 11 human cases in Japan. The first three cases were all discharged and alive over 2 years. The first patient received EVAHEART in May, 2005. He has a full-time job, and drives a car for work everyday. To achieve this present successful level, huge number of in vitro experiments and animal experiments were performed. Throughout the project, roles of biomedical engineers become more important. Bioengineers have been establishing a methodology of various types of in vitro tests to eliminate considerable risk factors, through a development of hydrodynamic performance tests, fatigue tests and K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 88–96, 2007. © Springer-Verlag Berlin Heidelberg 2007
How to Ensure Safety Factors in the Development of Artificial Heart
Pulsatile (Toyobo)
89
Non-pulsatile (EVAHEART)
Fig. 1. Two types of clinical ventricular assist device (VAD)
biocompatibitity tests. As in vitro tests have been proved effective, some typical tests are briefly introduced in this paper.
2 Present Status of the Toyobo VAD 2.1 Description of the Toyobo VAD System Fig.2 shows the Toyobo VAD system, consisting of a pneumatically-driven pulsatile pump (Fig.2, left) and its drive console (Fig.2 right). The VAD has two mechanical disc valves and moving diaphragm to eject pulsatile flow. As the VAD is located outside of the body, inlet and outlet cannulae are placed through the chest wall. The inlet cannula is generally inserted into the apex of the left ventricle (LV), whereas the outlet cannula is anastomosed to the ascending aorta.
Fig. 2. Implantation of Toyobo LVAD (LV apex ~ Ascending Aorta Bypass)
2.2 Clinical Application of the Toyobo VAD The Toyobo VAD has been implanted into more than 700 patients in Japan. When a clinical application of the Toyobo VAD was started in early 1980s, major VAD candidates were the patients with profound heart failure following acute myocardial
90
M. Umezu
infarction or after collective surgery, because the mortality in above cases were very high even though medical therapy or circulatory assist by intra-aortic balloon pumping(IABP) were applied. Implantation of the initial 16 clinical cases was performed at the National Cardiovascular Center, Osaka, where the original developmental study for Toyobo VAD was carried out. 9 cases could be weaned from the VAD after 6~15 days pumping, but only two patients could be discharged from the hospital. According to the recent clinical data summary, patients with dilated cardiomyoathy (DCM) have had more opportunity to receive VAD since early 90s [5]. It was reported that number of DCM patients with Toyobo VAD was 161 cases in between 1992 and 2004. And average pumping duration was 226 days (4~1245 days). This value is much longer than that of initial VAD patients in early 80s, all of which were mainly expected for a cardiac recovery of the natural failing heart. Major causes of the termination with VAD assisted patients were cerebral bleeding (41 cases), multiple organ failure (35 cases) and infection (16 cases). Although the Toyobo guaranteed onemouth pumping in clinical application, longer period of usage and exchange of the device are recognized as a common procedure in postoperative care. However, reliable data to justify above procedure must be obtained based on biomedical engineering analysis, because there was no consideration for such a long term use at the initial developmental stage.
3 Present Status of EVAHEART 3.1 Introduction of the EVAHEART System EVAHEART is a Japanese-made centrifugal blood pump as an implantable LVAD. The EVAHEART project was organized by a cardiac surgeon, Dr. Kenji Yamazaki of Tokyo Women's Medical University, and supported by Sun Medical Technology Research Corporation and Waseda University since 1991. Through the developmental process, more than 50 industrial companies with unique technologies have been contributed to the improvement of EVAHEART, and University of Pittsburgh Medical Center has joined for animal experiments since 1993. The weight and volume of the clinical available model is 422g and 132ml, respectively. Sufficient pump performance has already been confirmed through in vitro durability test as well as long term animal experiments. Three cases of clinical application were performed at Tokyo Women's Medical University and the National Cardiovascular Center in 2005 as a pilot clinical evaluation, and all discharged in favorable condition. The first patient has a full-time job. There are 8 more clinical applications up to now, and only one case was died from brain bleeding. 3.2 Hydrodynamic Performance of the EVAHEART Six times of the EVAHEART design modification was performed based on both in in vitro and in vivo study for 8 years. The in vitro data have been obtained from Wasedaoriginal mock circulatory system shown in Fig.3. Special features of this loop are as follows:
How to Ensure Safety Factors in the Development of Artificial Heart
91
1) Anatomically identical shaped silicone left ventricle and atrium. 2) Similar pressure-volume curves in one cardiac cycle driven by linear actuator. The EVAHEART was installed into the mock loop between LV apex and ascending aorta. This location is just simulated to the animal model.
Fig. 3. Schematic drawing of mock circulatory system with EVAHEART
Fig.4 shows one of the fundamental flow characteristics represented as a “HeadFlow” relationship. 9L/min of blood pump flow was achieved against 100mmHg at the pump speed of 2400 rpm, which exhibited a satisfactory bypass flow for the patient of profound heart failure. On the other head, it is essential to know the reliable bypass flow at any time for the safe postoperative care. Therefore a software was designed to estimate the bypass flow. The estimated flow by motor current and rotational speed was continuously compared with that measured by electromagnetic flow meter using the previouslydescribed mock circulatory system. Fig. 5 is a display of the flow monitor used for the clinical application. When a normal circulating condition (awake) was simulated in the mock circuit, the estimated flow was 5.84L/min, whereas the flow measured by the electromagnetic flow meter was 5.68L/min. Even if the pump flow was increased by twice as a simulation of exercise state, a difference between two flow values was also small and permissible. Therefore, it was confirmed that non-invasive flow measurement system can be used clinically.
M. Umezu
Head (mmHg)
92
200 180 160 140 120 100 80 60 40 20 0 0
5
10 Flow Rate (L/min)
3,000rpm 2,200rpm
2,800rpm 2,000rpm
2,600rpm 1,800rpm
15
20
2,400rpm 1,600rpm
Fig. 4. Fundamental flow characteristics of EVAHEART
Fig. 5. Example of monitor display of EVAHEART flow estimated by motor current and rotational speed
3.3 Durability Test for EVAHEART Durability test protocol, including a design of the machine, was discussed with US Food and Drug Administration (FDA), because there are new design and function in the EVAHEART, such as cool seal system. Whole view and schematic drawing are indicate in Fig. 6.[6] Major circulatory loop of the durability test machine is composed of motor-driven left ventricle with two valves, elastic tubes for afterload compliance, screwclamp for peripheral resistance and overflow-type preload chamber. The pulsatile flow is circulated in the mock circuit, where EVAHEART is also driven in between LV and aorta, which is the same way as the clinical implantation. To ensure a practical durability for a long-time usage, general cycle of three activity levels, these are “sleep”, “awake” and “exercise”, are sequentially shifted one after the other everyday. Operating condition is summarized as shown in Table 1. For example, normal cardiac function (awake) was set at 70 BPM with a total flow (sum of the cardiac output and the bypass flow) of 6.6 L/min and bypass flow from EVAHEART was automatically sent at 6.3 L/min, if the rpm was fixed at 1900 rpm.
How to Ensure Safety Factors in the Development of Artificial Heart
93
18 identical durability mock loops were placed and 18 EVAHEARTs were evaluated over one year. Fortunately, no injured surface was observed. There was no termination of the test due to the pump failure. It was statistically proved that this EVAHEART system was successfully passed the reliability of 80% and the confidence level of 90%, even if one system had a problem.
Fig. 6. Durability test circuit for EVAHEART
3.4 Biocompatibility Test for EVAHEART Biocompatibility is one of the most important items to be considered for long-term usage of the blood pump. Fig. 7 shows our in vitro biocompatibility test circuit for hemolysis and / or thsombus formation tests. [7] Test protcol of biocompatibility is as follows: 1) Heparinized fresh porcine blood harvested from the same animal should be used for comparative study. Table 1. Operating Condition of Durability test for EVAHEART
L/min L/min
Sleep (50 BPM) 5.7 5
Awake (70 BPM) 6.6 6.3
Exercise (120 BPM) 9 6.4
Active level (pulse rate) TF BF
AoP
mean Systolic Diastolic
mmHg mmHg mmHg
83.3 100 75
84.7 105 75
87.3 110 75
LVP
Systolic Diastolic
mmHg mmHg
100 15
105 15
130 10
8
15
1
Duration Hour/day EVAHEART: 1900 rpm (const.).
94
M. Umezu
2) Therefore, identical two circuits should be always prepared for comparative study. 3) Pulsatile circulation to simulate hemodynamic pressure / flow condition is preferable to obtain practical data. Based on the protcol, the complete closed circuit was developed. In each circuit in Fig. 7, three spiral-vortex diaphragm-type pulsatile pumps are installed [8], but each function is different. The circulation is guaranteed by the LV pump as shown at the left bottom of the circuit in Fig. 7. Only this pump has two valves and ejects pusatile flow by pneumatic pressure. Polyurethane compliance tube is installed at the outlet of the LV to reproduce similar aortic pressure waveforms. The pump located at the top is used as a compliance adjustment. The right bottom pump was used for venous reservoir. The resistance is placed between compliance and venous pumps. Fig. 8 is one of the test results after one hour circulation of fresh bovine blood. Anticoagurant agent (heparin) was used to maintain the ACT of around 300sec. The same amount of blood was divided and injected into two identical circuits. As can be seen on the upper photographs of Fig. 8, fibrin network was observed and some blood cells were captured on the miractran surface of the LV pump. On the contrary, MPC surface was clean.[9] Although both coating materials are polyurethane, biocompatibility was clearly differenciated.
Fig. 7. In vitro biocompatibility test circuits for hemolysis and for thrombus formation test
Fig. 9 is one of the mechanical hemolysis test results. Instead of the SV pump at the LV portion, non-pulsatile pumps (Biopump and EVAHEART) were installed in each circuit. Hemoglobin level was represented as N.I.H (Hemolytic Index) which was derived from the equation in Fig. 9. It was found that the hemolysis level data were reproducible and hemolysis by EVAHEART was much lower than that by Biopump.
How to Ensure Safety Factors in the Development of Artificial Heart
95
Miractran H
μ
μ
μ
100 m
D-HJunction
Diaphragm
Housing
D
500 m
100 m
MPC H
μ
μ
Housing
μ
500 m
100 m
100 m
D
Diaphragm
D-HJunction
Fig. 8. Example of the biocompatibility test results obtained from our circuit 0.006 0.005
00 1/ 0.004 g( .H 0.003 .I .N 0.002 0.001
⊿
N.I.H= PFH×V×(100-Ht)/(Q×T)
⊿PFH : Increase in Plasma Free
Hemoglobin V : Circulation blood volume Ht : Hematcrit Q : Pump flow T : Circulation time
0
Fig. 9. Comparison of mechanical hemolysis between Biopump and EVAHEART
4 Conclusions The author has been establishing a methodology to eliminate considerable risk factors through a development of practical in vitro test circuits. As mentioned above, it was confirmed that all in vitro tests are effective to ensure a safety toward clinical application. The author would like to propose this kind of approach, as another EBM: Engineering Based Medicine. Acknowledgment. This EVAHEART research is performed as a collaboration among Tokyo Women’s Medical University, Sunmedical Technology Research Corporation, and Waseda University. And research on in vitro testings have been achieved by
96
M. Umezu
research associates and graduate students of Umezu Laboratory, Waseda Graduate School, organized by Advanced Research Institute for Science and Engineering (05P29).
References 1. Takano, H., Hayashi, K., Umezu, M., Tomino, T., Koh, Y., Kito, Y., Koyanagi, H., Naito, Y., Fujita, T., Manabe, H.: Fundamental studies of clinically applicable heart assist device: Development of the system for heart assist device. Jpn. J. Artif. Organs 9, 601–603 (1980) 2. Umezu, M., Takano, H., Hayashi, K., Taenaka, Y., Nakamura, T., Matsuda, T., Akutsu, T.: Development of a control-drive unit for left ventricular assist device. In: Proceedings of Multi-international Instrumental Conference (MICONEX ’83), pp. 759–763 (1983) 3. Yamazaki, K., Mori, T., et al.: The cool-seal concept: A low temperature mechanical seal with recirculating purge system for blood pumps. In: Kobayashi, H., Akutsu, T. (eds.) Artificial Heart, Tokyo, Japan, vol. 6, pp. 339–344. Springer, Heidelberg (1994) 4. Umezu, M., Yamazaki, K., Yamazaki, S., Iwasaki, K., Miyakoshi, T., Kitano, T., Tokuno, T.: Japanese-made implantable centrifugal type ventricular assist system (LVAS): EVAHEART. Biocybernetics and Biomedical Engineering 27(1/2), 111–119 (2007) 5. Registry of artificial organs-2000: The Japanese J. Artif. Organs (in Japanese) 30, 46–53 (2000) 6. Kitano, T., Tokuno, T., Kaneko, K., Yamazaki, K., Kihara, S., Umezu, M., Iwasaki, K., Conti, J.C.: A new and more practical approach for in vitro durability test for rotary LVAS pump. ASIO J. 50(2), 133 (2004) 7. Iwasaki, K., Umezu, M., Tsujimoto, T., Saeki, W., Inoue, A., Nakazawa, T., Arita, M., Ye, C.X., Imachi, K., Ishihara, K., Tanaka, T.: A challenge to develop an inexpensive ’Spiral vortex pump’. In: 2nd Waseda-Renji Hospital BioMedical Engineering Symposium, Shanghai, China, pp. 8–10 (2002) 8. Umezu, M., Ye, C.X., Nugent, A., Nakamura, T., Iwasaki, K., Arita, M., Shiraishi, Y., Tanaka, T., Imachi, K., Ishihara, K., Chang, V.P.: Spiral vortex ventricular assist device: Its history and present status. In: 2nd Waseda-Renji Hospital BioMedical Engineering Symposium, Shanghai, China, pp. 6–7 (2002) 9. Ishihara, K., Tsuji, T., Kurosaki, T., Nakabayashi, N.: Hemocompatibility on graft copolymers of poly (2-methacryloyloxyethyl phosphorylcholine) side chain and poly (n-butyl methacrylate) backbone. Journal of Biomedical Materials Research 28, 225–232 (1994)
Parametric-Expression-Based Construction of Interior Features for Tissue Engineering Scaffold with Defect Bone Chunxiang Dai, Qingxi Hu, and Minglun Fang Rapid Manufacturing Engineering Center, Shanghai University, 200444 Shanghai, China
[email protected]
Abstract. Constructive features of tissue engineering scaffold with defect bone are defined. And based on the definitions and medical image 3D reconstructions as well as CAD technology, the constructing method for macrostructure of its interior features of tissue engineering scaffold with defect bone is presented, which is based on parametric expressions. And demonstrations of two constructing methods are given. Finally from calculations of the porosity, the structures of interior features are proven to meet the demand of porosity of tissue engineering scaffold with defect bone.
1 Introduction As development of advanced manufacturing technology, material science and biomedicine, researches and applications for bone tissue engineering have been greatly progressed in recent years and constructing tissue-engineered bone is being on marketing way. Repairing bone defect with tissue engineering is a brand-new therapy mode, which is related to bone defect reparation, scaffold construction and 3D-reconstruction [1, 2]. And these technologies have become the research hotspot in the fields of tissue engineering and bio-manufacturing home and abroad [3, 4, 7]. This paper, based on definitions of tissue engineering scaffold with defect bone, presents and analyzes the constructing method for macrostructure of its interior features.
2 Feature Definitions of Tissue Engineering Scaffold with Defect Bone Bone tissue engineering scaffold plays an important role in repairing defect bone, which acts not only as a support to retain the shape of original tissue but also as a template to provide cells with space for lodging, growing, differentiating and proliferating, and with which the regeneration of harmed tissue is guided and the structure of regenerating tissue is controlled. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 97–103, 2007. © Springer-Verlag Berlin Heidelberg 2007
98
C. Dai, Q. Hu, and M. Fang
Features of TESD
Exterior feature
Interior feature
Macrostructure
Microstructure
Fig. 1. Feature definitions of TESD
Tissue engineering scaffold with defect bone, simplified as TESD below, is the carrier adapt to tissue cell growing. According to constructing demands for bone scaffold applied by tissue engineering, biomaterial and rapid manufacturing, features of TESD are divided into exterior feature and interior feature. The definition levels are shown as figure 1. Exterior feature is the exterior shape feature of TESD, i.e., the shape of defect bone, and interior feature is the inner porous structure of scaffold whose function is to provide the environment of bone cell growing. Interior feature is the channels of supplying cells with nourishment and oxygen. Macrostructure is the inner porous structure constructed inside scaffold through computer modeling technology and microstructure is that constructed within scaffold by biomaterial through shaping technology. Exterior and interior features constitute the whole character of TESD while Macroand microstructures compose the inside porous character of TESD which functions as porousity and connectivity of TESD.
3 Construction of Macrostructure for TESD Based on the definitions above, the interior macrostructure of TESD is constructed inside scaffold through computer modeling technology, which should be modeled on tissue engineering and process requirement [5-6]. 3.1 Parametric-Expression-Based Construction of Macrostructure for TESD When constructing Macrostructure for TESD, the pore diameters and their intervals can be controlled and adjusted through the parametric expressions of CAD technology, as shown as figure 1, where dx, dy and dz are the pore diameters in directions of X, Y and Z, k is the coefficient of pore interval, here take k as 1.4, and tx, ty and tz are the pore intervals in directions of X, Y and Z. The intervals are different since pore diameters of
Parametric-Expression-Based Construction of Interior Features
99
Fig. 2. Building the related parameter expressions
Fig. 3. Defect bone model
three directions are distinct. Also, xx, yy and zz are pore number in directions of X, Y and Z, and trnc( ) is the round function in CAD technology. In the expressions above, x, y and z are constant which means the maximum length of bounding box of TESD, determined by practical TESD. As an example in this paper, defect bone model is shown as figure 2, and from its maximum size of outline, take x=50, y=16 and z=52, shown as figure 3.
(a) isometric view
(b) front view
(c) top view
Fig. 4. The maximum bounding box of defect bone model
(d) side view
100
C. Dai, Q. Hu, and M. Fang
front view
side view
top view
Fig. 5. The geometric meaning of dx, dy, dz and tx, ty, tz
The geometric meaning of above-mentioned parameters, dx, dy, dz and tx, ty, tz are shown as figure 4. 3.2 Demonstrations of Constructing Methods In order to illuminate the constructing methods of macrostructure based on parametric expressions, hereinafter, scaffold models will be constructed through setup
(a)
(b)
(c)
Fig. 6. The generated TESD model when dx=2, dy=1.5 and dz=1, here (a) is the original scaffold without pores whose volume is V1=9840mm3, (b) is the negative model with pores and (c) is the result whose volume is V2=4475mm3
Parametric-Expression-Based Construction of Interior Features
101
demonstrations of two groups of pore diameters, which are non-homogeneous. Also the porosities are calculated. Demonstration 1 According to the parameters setup in figure 1, i.e., dx=2, dy=1.5 and dz=1, then the interval distances between pores are separately 2.8, 2.1 and 1.4 in direction X, Y and Z. After Boolean operation the TESD model with non-homogeneous macrostructure is generated as shown as figure 6. From the formula of calculating porosity
【
】
δ= Vp÷Vs
δ
(1)
where is the porosity of scaffold, Vp is the volume of scaffold pores and Vs is the volume of scaffold without pores, and through the function of mass properties in CAD technology, the values can be calculated, that is, Vs=V1=9840mm3, Vp=V1-V2= 5365mm3. Thus, the porosity of scaffold is
δ= Vp÷Vs =(V -V )÷V 1
2
1
= 54.5%
If accounting for the porosity, 20%~30%, generated from biomaterial and manufacturing technology, then the model gained above can theoretically meet the porous demand of TESD model.
Fig. 7. Setup the related parameter expressions, i.e., dx=1.3, dy=1 and dz=0.8
【
】
Demonstration 2 According to the parameters setup in figure 7, i.e., dx=1.3, dy=1 and dz=0.8, then the interval distances between pores are separately 1.82, 1.4 and 1.12 in direction X, Y and Z. After Boolean operation the TESD model with non-homogeneous macrostructure is generated as shown as figure 8. And now the porosity of scaffold is
δ= Vp÷Vs =(V -V )÷V 1
3
1
= 57.0%
Similarly, if taking account for the porosity, 20%~30%, generated from biomaterial and manufacturing technology, then the model gained above can also theoretically meet the porous demand of TESD model.
102
C. Dai, Q. Hu, and M. Fang
dz dy
dx (a)
(b)
Fig. 8. The generated TESD model when dx=1.3, dy=1.0 and dz=0.8, here (a) is the whole scaffold with pores whose volume is V3=4227mm3 and (b) is magnified vew of the local area
From two setups of pore diameters demonstrated above, it can be drawn out that descent of diameters, i.e., from dx=2, dy=1.5 and dz=1 to dx=1.3, dy=1.0 and dz=0.8, effects unobviously the porosity which increases only fromδ= 54.5% toδ= 57.0%. So pursuing too small diameters of macro-pore for scaffold to increase porosity is not available. Sometimes it will bring on dramatical reduction of calculating speed, even on computer break-down. After the model, which is generated in Demonstration 2, being converted into STL format, it can be imported to RP machine and manufactured into RP model, as shown as figure 9, where (a) is SLS model and (b) is SLA model.
(a)
(b)
Fig. 9. The RP model of TESD with macrostructure, where (a) is SLS model and (b) is SLA model
Parametric-Expression-Based Construction of Interior Features
103
4 Conclusion Based on the definitions and medical image 3D reconstructions as well as CAD technology, the constructing method for macrostructure of its interior features of TESD is presented, which is based on parametric expressions. And demonstrations of two constructing methods are given. From calculations of the porosity, the structures of interior features are proven to meet the demand of porosity of TESD. And the final scaffold model can be transformed into STL format to import to RP machine to be manufactured. Acknowledgements. The author thanks to Shanghai Municipal Education Committee’s Development Fund (No. 06AZ029) for its financial support in this research.
References [1] Giltaij, L.R.: BMP-7 in orthopaedic applications: a review. Musculoskel. Res. 6, 55–62 (2002) [2] Minamide, A., Boden, S.D., Viggeswarapu, M., Hair, G.A., Oliver, C., Titus, L.: Mechanism of bone formation with gene transfer of the DNA encoding for the intracellular protein LMP-1. Bone Joint Surg. 85, 1030–1039 (2003) [3] Karageorgiou, V., Kaplan, D.: Porosity of 3D biomaterial scaffolds and osteogenesis. Biomaterials 26, 5474–5491 (2005) [4] Elutmacher, D.W.: Scaffold design and fabrication technologies for engineering tissues – state of the art and future perspectives. Biomaterials: Sci. Polymer Edn. 12, 107–124 (2001) [5] Borden, M., Attawia, M., Khan, Y., Laurencin, C.T.: Tissue engineered microsphere-based matrices for bone repair, design and evaluation. Biomaterials 23, 551–559 (2002) [6] Sun, W., Starly, B., Nam, J., Darling, A.: Bio-CAD modeling and its applications in computer-aided tissue engineering. Computer-Aided Design 37, 1097–1114 (2005) [7] Shao, X.X., Hutmacher, D.W., Ho, S.T., Goh, J.C.H., Lee, E.H.: Evaluation of a hybrid scaffold/cell construct in repair of high-load-bearing osteochondral defects in rabbits. Biomaterials 27, 1071–1080 (2006)
Computation of Uniaxial Modulus of the Normal and Degenerated Articular Cartilage Using Inhomogeneous Triphasic Model Haijun Niu1, Qing Wang2, Yongping Zheng2, Fang Pu1, Yubo Fan1, and Deyu Li1 1
Department of Bioengineering, The Beihang University, Beijing, China, 100083 2 HTI, The Hong Kong Polytechnic University, Hongkong, China, 00852
[email protected]
Abstract. Articular cartilage is a biological weight-bearing tissue covering the bony ends of articulating joints. Subtle changes in tissue composition can lead to degeneration of articular cartilage. This study develops an improved inhomogeneous triphasic model with four parameters and extracts the uniaxial modulus (Ha) for both normal and degenerated articular cartilage, and then predicts the swelling pattern of the cartilage. The results indicated that the new inhomogeneous triphasic model can extract uniaxial modulus more accurately, and the predict results also appeared to well match the experimental strain data. This inhomogeneous triphasic model can describe the depth-dependent material attribute of normal and degenerated articular cartilage more exactly.
1 Introduction Articular cartilage is the layer of low friction, load-bearing soft tissue that covers the articulating bony ends in diarthrodial joints. The functions of this tissue are to distribute stresses and to provide a low-friction bearing surface for joint motion. Under normal physiological conditions, these functional properties can persist for many decades [1]. However, some reasons such as overloading could lead to the degeneration of this tissue and even result in osteoarthritis (OA) the most common one of all joint diseases [2]. Articular cartilage is a multiphasic mixture. The special mechanical properties of this tissue are controlled by its complex biochemical composition, the molecular and ultrastructural architecture of the macromolecules, and the heterogenous distribution throughout the depth of the tissue. [3-4]. Under biological condition, articular cartilage is in a swollen state, which plays a significant role in the biomechanical behavior of articular cartilage when the tissue is loaded [4-5]. Factors such as proteoglycan concentration, fixed charge density, water volume fraction, and the intrinsic material properties of the cartilage solid matrix govern the inhomogeneous swelling strain distribution. It has been suggested that the elasticity modulus
-
K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 104–110, 2007. © Springer-Verlag Berlin Heidelberg 2007
Computation of Uniaxial Modulus of the Normal and Degenerated Articular Cartilage
105
extraction based on the triphasic model and quantification of the swelling effects can be used to detect material inhomogeneity, anisotropy as well as to characterize the degenerative changes associated with osteoarthritis [5-8]. Mixture models have been successfully used to predict the response of articular cartilage to various loading conditions. Mow et al. built on a biphasic mixture model of articular cartilage where the collagen–proteoglycan matrix is modeled as an intrinsically incompressible porous-permeable solid matrix, and the interstitial fluid is modeled as an incompressible fluid [10]. The biphasic model was able to predict the mechanical responses of articular cartilage in the confined compression creep, stressrelaxation, and dynamic loading [6,10]. The biphasic model was later extended by many researchers. Mak combined the linear biphasic theory with the quasi-linear viscoelasticity theory of Fung and developed a biphasic poroviscoelastic theory [11]. This model can describe the response of cartilage in unconfined compression well. Lai et al. [6] proposed a triphasic model of articular cartilage as an extension of the biphasic theory, where proteoglycans are modeled as the negative charge density fixed to the solid matrix and the monovalent ions in the interstitial fluid modeled as an additional fluid phase. This model provides a more accurate description of the tissue composition and mechano-electrochemical response. However, in this model, the cartilage solid matrix was assumed to have homogeneous material properties with uniform aggregate modulus, Ha, and Poisson’s ratio, ns. Narmoneva et al. extended this model to include the layered material properties to describe the depth-dependent strains of cartilage. In their bi-layer model, Ha was assumed to change linearly with the depth in the upper layer and to be a constant in the lower layer [9]. In this study, an improved layered inhomogeneous triphasic model with four parameters is developed based on the one proposed by Narmoneva et al [9]. This model was used to extract the uniaxial modulus (Ha) of both normal and degenerated articular cartilage, and then predicts the swelling pattern for normal and degenerated articular cartilage.
2 Model 2.1 Triphasic Theory The central concept of the theoretical model of articular cartilage is the principle of balance of forces i.e. that at equilibrium the sum of all forces inside cartilage is zero, including the osmotic pressure, applied pressure and tensile stresses in the collagen network. Lai et al. proposed a triphasic theory on the basis of the mixture theory to model the free-swelling behavior of cartilage [6]. In the model, the cartilage was dealt as a mixture of linear, isotropic, incompressible collagen-proteoglycan solid matrix and incompressible fluid consisting of water and ions. Narmoneva et al. extended the model to include the layered material properties [9]. According to the triphasic theory [6] and the extended layered model [9], the total stress in the isotropic porouspermeable mixture of the fluid, solid and ion phases in cartilage, σ , can be written as follow,
σ = σ s + σ w + σ + + σ − = − pI + λ s tr ( E ) I + 2μ s E
(1)
106
H. Niu et al.
Where σ represents the total stress for the mixture; the indices w, s, +, - denote quantities associated with water, solid, cation and anion, respectively; E is the infinitesimal strain tensor measured from the physiological salt bath corresponding to the hypertonic reference configuration; p is the fluid pressure; in here,
p = pDonnan + p0 −T1, pDonnan and p0 are the Donnan and the entropic components of the swelling pressure in the fluid phase, respectively, and T1 = c0 kTN Avo /1.5 ⋅[1 − φ0 ] , F
w
c0F is fixed charge density and φ0w is water volume fraction. λs and μs are Lame coefficients of the solid matrix. According to Eq. (1), the total stress in cartilage at equilibrium under free-swelling conditions consists of two components, the interstitial fluid pressure (p) and the elastic stress dependent on the material properties of the solid matrix. The relationship between aggregate modulus (HA) and the material parameters can be described as H A = λs + 2 μ s . It was assumed in the model that the contribution of the entropic effects to cartilage swelling pressure was zero and there was no external applied hydrostatic pressure [9]. Therefore, the fluid pressure (p) approximately equaled to the Donnan osmotic pressure pDonnan , i.e., all swelling effects arising from the electrostatic interaction between negatively charged PGs and ions. A linear constitutive expression for
p Donnan can be obtained from the boundary conditions for equivalent chemical potential of water and NaCl ions across the free surface:
([
p Donnan ≈ RT (c0F ) 2 + (2c * ) 2
]
1/ 2
− 2c * − tr ( E ) ⋅ (c0F ) 2 /(φ 0w [(c0F ) 2 + (2c * ) 2 ]1 / 2 )
Where R is gas constant, T is the absolute temperature and
)
(2)
c* is the NaCl
concentration; Fixed charge density ( c0 ) and water volume fraction ( φ0 ) values of F
w
cartilage could be measured using biochemical method. 2.2 Inhomogeneous Bi-layer Model Previous studies had showed that the distribution of the fixed negative charges and the water volume fraction in cartilage are inhomogeneous. The distribution of the swelling-induced strains is also different at different depths [8-9]. Therefore, the homogeneous model can not predict the alteration in the swelling-induced strain and the aggregate modulus, especially for the degraded cartilage well [9]. The single layer homogeneous model is showed in Fig1-a. Narmoneva et al. [9] modeled cartilage to be a two-layer structure in terms of Ha , where Ha in the upper layer (near the cartilage surface) linearly increased with the depth and Ha in the lower layer was a constant (Fig1-b). Based on our earlier observation that the modulus in the deep layer also increased with the increase of the depth [12], we proposed an improved two-layer model with four parameters. In here, we called it four parameters triphasic model (Fig1-c). In this model, we used three
Computation of Uniaxial Modulus of the Normal and Degenerated Articular Cartilage
107
Ha to describe the bi-layer structure. In the deep region (Layer1), which was attached to the subchondral bone, the aggregate modulus varied linearly from Ha1 at the cartilage-bone interface to the value
Ha2 at the Layer1-Layer2 interface. In the
upper layer (Layer2), the aggregate modulus was also proposed to vary linearly from Ha2 at the Layer1-Layer2 interface to Ha3 at the articular surface. The thickness of Layer1 was defined as h1 . Therefore, these four parameters
Ha1 , Ha2 , Ha3 and h1 determine the magnitude and distribution of the axial swelling-induced strain E F
together with the other parameters including c0 ,
0
Bone
Cartilage
Bone
φ0W , vs .
1
Cartilage
Bone
Cartilage
Fig. 1. Schematic diagram of the cartilage biomechanics models (a) homogeneous model; (b) Narmoneva’s triphasic model; (c) Four parameters triphasic model. The thickness of the cartilage specimen was normalized.
3 Results In order to verifying the model, some free-swelling experiment strains data should be gotten to extract aggregate modulus (HA). in this study, all the data include the swelling-induced strains E and the values of c0F and φ0W for one normal canine articular cartilage specimen (approximately 1 mm in thickness) and one degenerated human articular cartilage specimen (approximately 3.5 mm in thickness) were excerpted from Narmoneva’s dissertation [9]. The distribution of strains of two cartilage specimens caused by changing the NaCl concentration from 2 Mol to 0.15 F
Mol. The value of c0 and
φ0W
of two specimens were shown in figure 2, both of
them vary with the thickness in the cartilage layer. In our computation, poisson’s ratio vs =0.37 was used for normal canine cartilage and vs =0.05 for degenerated human cartilage.
108
H. Niu et al.
Fig. 2. The depth-dependent distribution of Fixed Charge Density c 0F and Water Volume Fraction φ 0W of the normal canine cartilage specimen and degenerated human cartilage specimen. (from Narmoneva’s thesis[9]). The thickness of the cartilage specimen was normalized. Table 1. The value of the parameters for two cartilage specimens calculated using homogeneous model, Narmoneva’s triphasic model and four parameters triphasic model respectively Normal Canine Cartilage Specimen Homogeneous Model
Ha =39.0MPa, (err=0.50)
Narmoneva’s triphasic model
Ha1=50.2 MPa, Ha2=8.1 MPa, h1*=0.26, (err=0.46)
Four Parameters Triphasic Model
Ha1=60.8MPa, Ha2=27.5MPa, Ha3=7.5 MPa h1*=0.79, (err=0.43)
Degenerated Human Cartilage Specimen Homogeneous Model
Ha =34.0MPa, (err=0.43)
Narmoneva’s Triphasic Model
Ha1=34.2 MPa, Ha2=0.01 MPa, h1*=0.6, (err=0.39)
Four Parameters Triphasic Model
Ha1=50.3MPa, Ha2=16.6MPa, Ha3=0.01MPa h1*=0.55, (err=0.35)
* The thickness of the cartilage specimen was normalized.
Computation of Uniaxial Modulus of the Normal and Degenerated Articular Cartilage
109
Using the distribution of the axial component of the swelling-induced strain E F
and the assigned c0 ,
φ0W and vs ,
the four parameters Ha1 , Ha2 , Ha3 and
h1 were
predicted. The least square error (LSE) between the predicted strain values and the swelling-induced strains E was used as the curve fitting criteria. For comparison purpose, we also calculated the parameters using Narmoneva’s model and homogeneous model. The computation program was edit using Mathematic software (Mathematics 5.0). Table 1 shows the comparison between the uniaxial modulus results predicted using the three different models. The least square error (err) between the predicted strains and the experimented strains also were shown in the table. Combined with the results of the unaxial modulus Ha shown in Table 1, the nonuniform distribution of the swelling-induced strains of the normal and degenerated cartilage specimen caused by changing the NaCl concentration from 2 Mol to 0.15 Mol were predicted using homogeneous model, Narmoneva’s triphasic model and four parameters triphasic model respectively. For comparing clearly, the distributions of strains predicted by three models were shown in the same figure 3(a) and (b). It is obvious that no matter for normal cartilage or for degenerated cartilage, no matter for animal cartilage or for human cartilage, the triphasic model with four parameters could predict the distribution of strains better. Strain
Strain
Depth
(a) Normal Cartilage Specimen –––––homogeneous model ―four parameters triphasic model
――
Depth
(b) Degenerated Cartilage Specimen - - - - three parameters triphasic model ♦ the experimental swelling-induced strains
Fig. 3. The nonuniform distribution of the experimental swelling-induced strains of the normal and degenerated cartilage specimen caused by changing the NaCl concentration from 2 M to 0.15 M and the theoretically predicted strain using homogeneous model, Narmoneva’s triphasic model and four parameters triphasic model respectively. The thickness of the cartilage specimen was normalized.
4 Conclusions Swelling is one of the early indicators of cartilage pathological change with osteoarthritis, the modulus extraction based on the triphasic model and the swellinginduced strains are important to the study of the damage of cartilage matrix. This study built a triphasic model with four parameters; the model can effectively predict a
110
H. Niu et al.
highly nonuniform distribution of swelling strains of articular cartilage and estimate material properties of articular cartilage tissue more exactly. This study is also important for understanding of the pathogenesis of OA and designing methods for the diagnosis and treatment of the disease. Acknowledgments. The work has been supported by the Research Grant Council of Hong Kong (PolyU5199/02E, PolyU 5245/03E) and National Natural Science Foundation of China. (10672014 and 10527001).
References 1. Mow, V.C., Ratcliffe, A., Poole, A.R.: Cartilage and diarthrodial joints as paradigms for hierarchical materials and structures. Biomaterials, 67–97 (1992) 2. Brandt, K., Doherty, M., Lohmander, S.: Osteoarthritis Cartilage. Oxford University Press, Oxford (1998) 3. Kempson, G.E.: The Joints and Synovial Fluid, vol. II, pp. 177–238. Academic Press, New York (1980) 4. Mow, V.C., Zhu, W., Ratcliffe, A.: Structure and function of articular cartilage and meniscus. In: Mow, V.C., Hayes, W.C. (eds.) Basic Othopaedic Biomechanics, pp. 143– 198. Raven Press, New York (1991) 5. Maroudas, A.: Balance between swelling pressure and collagen tension in normal and degenerate cartilage. Nature, 808–809 (1976) 6. Lai, W.M., Hou, J.S., Mow, V.C.: A triphasic theory for the swelling and deformation behaviors of articular cartilage. J. Biomech. Eng. 245–258 (1991) 7. Maroudas, A.: Transport of solutes through cartilage – permeability to large molecules. J. Anat. 335–347 (1976) 8. Narmoneva, D.A., Wang, J.Y., Setton, L.A.: Nonuniform swelling-induced residual strains in articular cartilage. J. Biomech. 401–408 (1999) 9. Narmoneva, D.A.: Material property determination for normal and osteoarthritic articular cartilage using triphasic mechano-chemical theoretical model of osmotic loading [D]. Phd Thesis, Duke university, Durham, North Carolina (2000) 10. Mow, V.C., Kuer, S.C., Lai, W.M., Armstrong, C.G.: Biphasic Creep And Stress Relaxation Of Articular Cartilage In Compression: Theory And Experiments. J. Biomech. Eng. 73–84 (1980) 11. Mak, A.F.: The Apparent Viscoelastic Behavior of Articular Cartilage—The Contributions from the Intrinsic Matrix Viscoelasticity and Interstitial Fluid Flows. J. Biomech. Eng. 123–130 (1986) 12. Zheng, Y.P., Mak, A.F.T., Lau, K.P., Qin, L.: An ultrasonic measurement for in vitro depth-dependent equilibrium strains of articular cartilage in compression. Phys. Med. Biol. 3165–3180 (2002)
Effect of the Plantar Ligaments Injury on the Longitudinal Arch Height of the Human Foot Yunfeng Yang1, Guangrong Yu1, Wenxin Niu2, Jiaqian Zhou1, Yanxi Chen1, Feng Yuan1, and Zuquan Ding2 1
Orthopaedic department of Tongji hospital affiliated to Tongji University, Shanghai, China
[email protected] 2 School of Life Science and Technology of Tongji University, Shanghai, China
Abstract. Most of the foot deformities relate with the arch collapse or instability, especially the medial longitudinal one. Though the function of the plantar fascia to the arch height has been investigated by some authors, the other plantar ligaments` effects are still unclear. The purpose of this study is to explore the roles of the plantar soft tissues in the foot arch biomechanics, including the plantar fascia, spring ligament complex, short plantar ligament and long plantar ligament through normal adult fresh frozen specimens in different injured condition. Also, a three-dimensional finite element model of a normal left foot was developed, which was comprising most joints of the foot and consisted of bone segments, major ligaments and plantar soft tissue. The validity of the three-dimensional finite element model was verified by comparing results with experimentally measured data via the displacements and Von-mise stress of each bone segments. These intrinsic ligaments of the foot arch were sectioned in different sequences in the cadaveric experiment, which simulated the different pathologic situations of the plantar ligaments injury and described the bone segments displacement and stress distribution.
1 Introduction The main factors that contribute to an acquired flat foot deformity are excessive tension in the triceps surae, obesity, PTT dysfunction, or ligamentous laxity in the spring ligament, plantar fascia, or other supporting plantar ligaments. Too little support for the arch or too much arch flattening effect will lead to collapse of the arch. The plantar fascia, or plantar aponeurosis, is the investing fascial layer of the plantar aspect of the foot. It is part of the retinacular system, which consists of a network of connective and adipose tissues whose main functions are to support and protect underlying vital structures of the body. The anatomy and functions of the plantar fascia has been well described by Sarrafianand[1] and others[2],[3],[4]. The spring ligament has been reported to be composed of the inferior calcaneonavicular and superomedial calcaneonavicular ligaments and an important stabilizer of the longitudinal arch of the human foot[5]. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 111–119, 2007. © Springer-Verlag Berlin Heidelberg 2007
112
Y. Yang et al.
Cadaveric studies have been done to investigate the biomechanical consequence of plantar ligamnets release. Huang[6] reported that the average vertical displacements between the talar neck and supporting platform were 7.3 and 8.4 mm, respectively in 12 cadaveric feet with intact plantar fascia and fasciotomy under a load of 690 N. Kitaoka et al.[ 7],[ 8] noted the high tensile loads required for failure of the plantar fascia in a biomechanical cadaver study. He also found the majority of failures, or ruptures, during testing occurred at the plantar fascia origin from the os calcis, the most common site of clinical plantar fascial rupture and symptoms of plantar fasciitis. Daly et al.[9] found evidence of flattening of the arch in 16 feet in 13 patients who underwent plantar fasciotomy for intractable plantar fasciitis. However, there is no report about the biomechanics of the foot bones in cadaveric experiment combined with finite element analysis in the situations of plantar ligaments injury. The objective of this study is to establish a detail FEM of a normal human adult foot and analyze the effect of plantar ligaments on the tarsal bones displacements and the foot arch deformation, including the plantar fascia, spring ligament complex, short plantar ligament and long plantar ligament.
2 Methods The geometry of the left foot was acquired from a 24 year male without any foot pathology by computed tomography scan. The contours of the bone and soft tissue were determined by an automatic contouring program, and used to generate the solid models by a CAD program (AutoCADR14.0). The foot bones were created with 4-node tetrahedral elements and analyzed using a CAE program (ANSYS9.0). The articulations and ligament structures of the foot were created with LINK10 and Link12 model respectively, and Shell93 model was used to construct the plantar soft tissues. The material properties were assumed to be linear elastic. A detail left foot model was built, which consisted of 170426 nodes, including articular cartilages, ligaments, and plantar soft tissue. Static loading of 700N was employed axially through distal tibia to simulate the one foot standing with the heel of the model fixed and the other part of the plantar soft tissue elements restrained in the vertical axis and free in the transverse plane. All nodes on the upper cross-sectional area of the distal tibia were restrained in the transverse plane but free in the coronal axis. Then a rigid plane under the foot plantar soft tissues was established to simulate the ground. The reaction of each bone segment of the foot arch was recorded and analyzed. Seven fresh adult cadaveric feet (the 1/3 part of the shranks were attached) were tested in the cadaveric experiments. The skin and muscles above the ankle joint were detached while kept the ligaments of the ankle intact (Fig. 1). The four major bone segments and stabilizer of the foot arch (plantar fascia, spring ligament, long and short plantar ligament) were marked and identified before all experiments. 700N axial loading from the proximal tibia was applied by MTS in the gradient of 100N. Simulation of the ligaments injury was undertaken by ligaments release in different combination and sequence. The displacements of the major bones were collected in
Effect of the Plantar Ligaments Injury on the Longitudinal Arch Height
113
gray level images by two digital cameras and recorded into personal computer. The displacements of the bone segments were calculated by Digital Speckle Correlated Methods and compared with the FEM results for verification. The FEM angular displacement of the major tarsal bones were also analyzed based on the lines passed through the middle points of the articulations, such as the subtalar joint, talonavicular joint, chopart joint, Lisfranc joint, and metatarsophalangeal joints.
Fig. 1. Cadaveric feet were loaded with MTS to 700N axialy. The displacement of the marked bone segments were recorded by digital two cameras.
3 Results All the bone segments marked moved downward in the sagittal plane under axial load in intact situation.The calcaneus showed plantarflexion and the other tarsal and metatarsal bones appeared dorsiflexion, which lead to the longitudinal and transversal arch of the model flatten. The finite element model and the cadaveric feet showed the same tendancy when 700N load was applied to the distal part of the tibial axialy in intact situation except the calcaneus and the fifth metatarsal. When all the four plantar ligaments were sectioned, all the bone segments appeared to displace in all three global planes, which was dorsiflexion in the saggital plane, abduction in the transverce plane and external rotation in the coronal plane. The FEM and the cadaveric experiment showed the same tendancy(Fig.2, Fig.3). The rotation changes between intact, plantar fascia realesed and all four major ligaments released of the finite element model were showed in the Figures (Fig.6- Fig.8).
114
Y. Yang et al.
Fig. 2. The vertical displacement of the finite element model(FEM) under 700N loading as the intact(1) and all four major ligaments released(3)
Fig. 3. The vertical displacement of the cadaveric foot in sagittal and coronal planes captured by two digital cameras under 700N loading before (upper two images) and after (images below) the four major ligaments released
Effect of the Plantar Ligaments Injury on the Longitudinal Arch Height
115
The vertical displacement of the bone segments under 700N axial loading of the FEM and CSE 30 ) m 25 m ( t 20 n e m 15 e c l a 10 p s i 5 d
CSE FEM
0 Ca
Na
Mc
M1
M2
M3
M4
M5
Fig. 4. The vertical displacement of the bone segments under 700N axial loading in the intact finite element model (FEM) and cadaveric specimen experiments CSE), showed the same tendancy except the calcaneous and the fifth metatarsal
The vertical displacements of the bone segments of the foot under 700N in the FEM 30 )m m( tn 25 em ec 20 al ps 15 id la 10 ci tr 5 ev 0
intact AR
Ca Ta
Na
Cu Mc
Ic Lc
M1 M2
M3
M4 M5
Fig. 5. The displacements of the bone segments of the finite element foot model under 700N in intact and four plantar ligaments released(AR)
The bone segments rotated in the three planes and showed the same tendancy except the calcaneous and the fifth metartasal in the coronal plane. Following the flatten of the longitudinal arch, the foot bones showed dorsiflexion in the sagittal plane, abduction in
116
Y. Yang et al.
The angle in sagittal plane of the bone segments under 700N axial loading ) 25 e e r 20 g e d ( 15 n o i x 10 e l f i 5 s r o d 0
intact AR
Ca
Na
Mc
M1
M2
M3
M4
M5
Fig. 6. Rotations of the bone segments in the sagittal plane in the intact and four major plantar ligaments released
The angle in transverce plane of the bone segments under 700N axial loading 20 ) e e r 15 g e d ( n 10 o i t c u 5 d b a 0
intact AR
Ca
Na
Mc
M1
M2
M3
M4
M5
Fig. 7. Rotations of the bone segments in the transverce plane in the intact and four major plantar ligaments released
the transversal plane and external rotation in the coronal plane. The degrees of the rotation changed when the plantar ligaments were released and reach to the top as the four major ligaments were all sectioned. Supposing the last condition to be 100%, the contribution of the plantar fascia to the stability of the foot arch was calculated. They were 34.53%, 22.46% and 12.63% in sagittal, transversal and coronal plane respectively.
Effect of the Plantar Ligaments Injury on the Longitudinal Arch Height
117
The angle in coronal plane of the bone segments under 700N axial loading ) e e 4.5 r g 4 e d 3.5 ( n 3 o i t 2.5 a t 2 o r 1.5 l 1 a n 0.5 r e t 0 x e
intact AR
Ca
Na
Mc
M1
M2
M3
M4
M5
Fig. 8. Rotations of the bone segments in the coronal plane in the intact and four major plantar ligaments released
4 Discussion Computer models have several features that make them more appealing than other types of models[10]. An infinite number of computer models can be developed and tested for different conditions and it`s primary characteristic is maintained after exhaustive testing. Also, computer models provide information that cannot be easily obtained using other types of models, such as load distributions within soft tissues, internal stresses, joint reaction forces, and muscle force analysing[11]. Once an accurate computer model has been developed and validated appropriately, simulations can be performed quickly and at low cost in diverse situations, such as injury, surgery, dynamic motion simulation and graphical animation of the experimentation and help to enhance the understanding of the underlying mechanisms. The capability of the FE model to predict the internal stress within the bony and soft tissue structures makes it a valuable tool to enrich the knowledge of ankle-foot biomechanics. Computational analysis of the foot biomechanics has its advantage in providing an overall stress distribution of the foot. It is also more economical than in vitro cadaver experiments. In view of the previously existed computational models, only a detailed representation of the foot geometry and joint characteristics together with realistic loading conditions can depict the internal stress and strain distributions of the foot complex. Many authors have used FEM to quantify the biomechanical role of plantar fascia in load bearing and found the vertical displacement of the foot increased with fasciotomy[12,][13]. In the literature, 3D geometrical detailed FE models have been developed[14],[15],[16],[17],[18],[19], but were not employed to quantify the biomechanical role of plantar fascia to the tarsal and metatarsal bone simultaneously and did not aim at the one foot standing posture, which is important to support the body weight in walking. Based on the anatomy and computer software, a detail finite element model of a normal adult left foot was established, including the bone segments, articulations,
118
Y. Yang et al.
foot intrinsic ligaments and plantar soft tissue. The elements used to construct the foot joints, ligaments and plantar tissue were distinct from the literatures, which could not be used to analyze significant displacement of the foot arch. The section of the plantar fascia is used to treat some foot problems, such as heel pain, poliomyelitis and congenital equinovarus[5]. But later outcome were still unknown. Some patients suffered a flatten foot and occurrence of lateral pain of the mid-foot. The current study simulated the contribution of the plantar fascia in the supportive function to the longitudinal foot arch, which comprised one third of the function of plantar ligaments in sagittal plane and helped to restrict abduction and external rotation of the bone structure. The plantar fasciotomy should be the last option in clinical therapy following the conservative methods. To simplify the FE analysis, homogeneous and linearly elastic material properties were assigned to the bony and ligamentous structures and the ligaments within the toes and other connective tissues such as the joint capsules were not considered. The current FE model did not account for the surface interactions between bony, ligamentous and muscles structures. The structural simplification of the FE model would result in a reduction of joint stability of the foot arch structures and an increase in predictions of joint and arch deformation. Because of the use of linear truss elements to approximate the nonlinear profile of the plantar fascia structure, assumption of linear material property and the neglection of structural interface between the plantar fascia and surrounding tissue, the predicted plantar fascia strain in this study was likely underestimated.
5 Conclusions All the four plantar ligaments play an important role in stabilizing the normal foot arch, especially the plantar fascia. The medial longitudinal foot arch collapses and elongate significantly flowing fore foot abduction and hind foot valgus following the four plantar ligaments released without the function of the tendons and extrinsic stabilizer. The current study proposed a validated three-dimensional foot model which can be modified to simulate other foot conditions in the future. This foot model can be useful in observing stress distributions inside the foot, designing footwear, investigating the biomechanical behavior of the foot subjected to different damages and operation design.
References 1. Sarrafian, S.K.: Functional characteristics of the foot and plantar aponeurosis under tibiotalar loading. Foot Ankle 8, 4–18 (1987) 2. Murphy, A.: Pneumaticos. Biomechanical Consequences of Sequential Plantar Fascia Release. Foot Ankle Int. 19, 149–152 (1998) 3. Chuter, V., Payne, C.: Limited joint mobility and plantar fascia function in Charcot’s neuroarthropathy. Diabet Med. 18, 558–561 (2001) 4. Snider, M.P., Clancy, W.G., McBeath, A.A.: Plantar fascia release for chronic plantar fasciitis in runners. Am. J. Sports Med. 11, 215–219 (1983)
Effect of the Plantar Ligaments Injury on the Longitudinal Arch Height
119
5. Taniguchi, A., Tanaka, Y., Takakura, Y., Kadono, K., Maeda, M., Yamamoto, H.: Anatomy of the spring ligament. J. Bone Joint Surg. Am. 85, 2174–2178 (2003) 6. Huang, C.K., Kitaoka, H.B., An, K.N., et al.: Biomechanical evaluation of longitudinal arch stability. Foot Ankle 14, 353–357 (1993) 7. Kitaoka, H.B., Luo, Z.P., An, K.N.: Analysis of longitudinal arch supports in stabilizing the arch of the foot. Clin. Orthop. Relat. Res. 250–256 (1997) 8. Kitaoka, H.B., Luo, Z.P., An, K.N.: Reconstruction operations for acquired flatfoot: biomechanical evaluation. Foot Ankle Int. 19, 203–207 (1998) 9. Daly, P.J., Kitaoka, H.B., Chao, E.Y.: Plantar fasciotomy for intractable plantar fasciitis: clinical results and biomechanical evaluation. Foot Ankle 13, 188–195 (1992) 10. Berkelmans, W.A.M., Poort, H.W., Slooff, T.J.J.H.: A new method to analysis the mechanical behavior of skeletal parts. ACTA. Orthop. Scand. 34, 301–317 (1972) 11. Salathe Jr., E.P., Arangio, G.A., Salathe, E.P.: A biomechanical model of the foot. J Biomech. 19, 989–1001 (1986) 12. Arangio, G.A., Reinert, K.L., Salathe, E.P.: A biomechanical model of the effect of subtalar arthroereisis on the adult flexible flat foot. Clin. Biomech. (Bristol, Avon) 19, 847–852 (2004) 13. Gefen, A.: Stress analysis of the standing foot following surgical plantar fascia release. J. Biomech. 35, 629–637 (2002) 14. Camacho, D.L., Ledoux, W.R., Rohr, E.S., et al.: A three-dimensional, anatomically detailed foot model: a foundation for a finite element simulation and means of quantifying foot-bone position. J. Rehabil. Res. Dev. 39, 401–410 (2002) 15. Jacob, S., Patil, M.K.: Three-dimensional foot modeling and analysis of stresses in normal and early stage Hansen’s disease with muscle paralysis. J. Rehabil. Res. Dev. 36, 252–263 (1999) 16. Gefen, A., Megido-Ravid, M., Itzchak, Y., et al.: Biomechanical analysis of the three-dimensional foot structure during gait: a basic tool for clinical applications. J. Biomech. Eng. 122, 630–639 (2000) 17. Chu, T.M., Reddy, N.P., Padovan, J.: Three-dimensional finite element stress analysis of the polypropylene, ankle-foot orthosis: static analysis. Med. Eng. Phys. 17, 372–379 (1995) 18. Patil, K.M., Braak, L.H., Huson, A.: Analysis of stresses in two-dimensional models of normal and neuropathic feet. Med. Biol. Eng. Comput. 34, 280–284 (1996) 19. Cheung, J.T., Zhang, M., Leung, A.K., et al.: Three-dimensional finite element analysis of the foot during standing–a material sensitivity study. J. Biomech. 38, 1045–1054 (2005)
Internet Living Broadcast of Medical Video Stream Shejiao Li1 , Bo Li1 , and Fan Zhang1,2 1
2
College of Computer & Information Engineering, Henan University, Kaifeng 475001, P.R. China
[email protected] College of Electronic and Information Engineering, Tianjin University, Tianjin 300072, P.R. China
Abstract. DirectShow based network living broadcast scheme of MPEG-4 medical video stream is presented. In this scheme, Digital Subtraction Angiography (DSA) video stream are captured by an advanced image capture board. MPEG-4 and DirectShow framework technique are used for data’s compression and transmission. Data of DSA video stream can be transported easily from server sender Filter to client receiver Filter according to TCP and UDP protocols. Experimental results show that the image is clear in 100M LAN, and the delay is less than one second. High performances of definition and real-time of the DSA video are both achieved in this scheme.
1
Introduction
Telemedicine is medical care and health supporting practices based on patient information derived from images transmitted from a remote site. It may be as simple as two health professionals discussing a case over the telephone, or as sophisticated as using satellite technology to broadcast a consultation between providers at facilities in two countries, using video conference equipment or robotic technology. Telemedicine can be practiced in many ways and each has challenges and conditions that must be considered. Telemedicine can vary depending on either the facilities using telemedicine, or the type of data transmitted. In telemedicine, surgery digital living broadcast and discussion is one of the most important application [1]. Videoconferencing via Internet is a viable method for transmitting information in real time allowing surgeons worldwide to work together during surgical procedures. The broadcasting computer station was also able to receive real-time video and sound from the distant computers, allowing complete interaction between both parties over the duration of each transmission session [2],[3]. In this case, transmission of patient related information is necessary. Video and other data from the output of medical equipment, such as DSA, should be stored and transmitted for the living broadcast via network. In the main digital system of the DSA machine, the images are digitized and archived incorporating the Digital Imaging and Communications in Medicine K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 120–128, 2007. c Springer-Verlag Berlin Heidelberg 2007
Internet Living Broadcast of Medical Video Stream
121
(DICOM) format [4]. A single DICOM file contains both a header (which stores information about the patient’s name, the type of scan, image dimensions, etc), as well as all of the image data which can contain information in three dimensions. This is different from the popular Analyze format, which stores the image data in one file and the header data in another file. DICOM image data can be compressed to reduce the image size. Files can be compressed using lossy or lossless variants of the JPEG format, as well as a lossless Run-Length Encoding format which is identical to the packed-bits compression found in some TIFF format images. Usually the size of DSA image is 10241024. DSA images must be compressed to reduce the bandwidth requirement and allow cost-effective delivery [5],[6]. In this scheme, MPEG-4 is adopted. The DSA video is gained from TV terminal of medical equipment. To capture the video stream, an advance capture board and DirectShow technology are used. The video stream are transported to client using TCP and UDP protocols. Then client decode the compressed data stream and display it. The video image can be processed by the image processing Filter, such as edge detecting, sharping, noise reduction etc..
2
Digital Subtraction Angiography
Blood vessels often absorb as much radiation as the surrounding tissues and therefore cannot be discerned on X-ray images. By injecting contrast agents into blood vessels, these vessels can be visualized: the contrast medium contains iodine, which absorbs x-rays. Due to the presence of bone, the small contrast differences caused by the contrast medium in the blood vessels are difficult to distinguish in the presence of bone structures, since the eye is not able to detect contrast differences less than about 3%. It is necessary to use a procedure that enhances contrast. Over the past two decades, DSA has become a well-established modality for the visualization of blood vessels in the human body [7]. With this technique, a sequence of 2D digital X-ray projection images is acquired to show the passage of a bolus of injected contrast material through the vessels of interest. In the images that show opacified vessels (often referred to as contrast images or live images), background structures are largely removed by subtracting an image acquired injection (usually called the mask image). Sample DSA Images are shown in Fig. 1. A digital mask image is made prior to the injection of a contrast agent and stored in the computer. Then a contrast medium is injected into a vein or artery. When the bolus arrives a sequence of images is obtained. The pre-contrast mask image is now subtracted from these subsequent live images (with contrast). The resulting images will only contain information that was not present in the mask, that is: information about the location of the contrast medium. The resulting images will only show the vessels; other anatomical details that disturb the image have been removed by the subtraction procedure. In reality things are somewhat more difficult due to the introduction of artifacts, such as motion of the anatomy.
122
S. Li, B. Li, and F. Zhang
Fig. 1. DSA images
3
Video Encoding and Decoding
The increasing demand to incorporate video data into telecommunications services, the corporate environment, the entertainment industry, and even at home has made digital video technology a necessity. A problem, however, is that still image and digital video data rates are very large. For example, if we have 640 × 480 image, 3 bytes per pixel (R,G,B) and 30 frames/second, then for 30-minutes stream, it would need 46.3 GB and bandwidth would require 26.4 MB/s. So the compression of video data is needed. For this reason, Video compression standards have been developed to eliminate redundancy, allowing video information to be transmitted and stored in a compact and efficient manner. MPEG (Motion Picture Experts Group) video compression is used in many current and emerging products. It is at the heart of digital television set-top boxes, DSS, HDTV decoders, DVD players, video conference, Internet video, and other applications [8]. MPEG-4 compression algorithms were developed to address the need for higher quality pictures and increased system flexibility, which are required by multi-media systems. Since it was developed later, MPEG-4 was able to leverage the efforts behind the development of both the JPEG and H.261 algorithms. As with H.261, only the YUV color component separation with the 4:2:0 sampling ratio is allowed by the MPEG-4 standard. Unlike H.261, the frame size is not fixed although a 352240 frame size is typically used. MPEG-4 adopted the macro block of H.261 (4 Y blocks, 1 U block, and 1 V block) as the basic unit for compression. To compress each macro block, the MPEG-4 standard allows the compressor to select from several compression options.
4
DirectShow Framework
Microsoft DirectShow is an architecture for streaming media on the Microsoft Windows platform. DirectShow provides for high-quality capture and playback
Internet Living Broadcast of Medical Video Stream
123
of multimedia streams [9],[10]. It supports a wide variety of formats, including Advanced Streaming Format (ASF), Motion Picture Experts Group (MPEG), Audio-Video Interleaved (AVI), MPEG Audio Layer-3 (MP3), and WAV sound files. It supports capture from digital and analog devices based on the Windows Driver Model (WDM) or Video for Windows. DirectShow is integrated with other DirectX technologies. DirectShow is designed to address each of these challenges. Its main design goal is to simplify the task of creating multimedia applications on the Windows platform by isolating applications from the complexities of data transports, hardware differences, and synchronization issues. To achieve the throughput necessary for streaming video and audio, DirectShow uses Microsoft DirectDraw and Microsoft DirectSound to render data efficiently to the system’s sound and graphics cards. Synchronization is achieved by encapsulating the multimedia data in time-stamped media samples. To handle the variety of sources, formats, and hardware devices, DirectShow uses a modular architecture in which operating system components called Filters can be mixed and matched to provide support for many different scenarios. DirectShow includes Filters that support codes written for the Audio Compression Manager (ACM) and Video Compression Manager (VCM) interfaces. DirectShow enables applications to play files and streams from various sources, including local files and remote files on a network. DirectShow has native compressors and de-compressors for some file formats, and many third-party hardware and software decoders are compatible with DirectShow. In addition, DirectShow supports legacy VFW codes based on the Video Compression Manager (VCM) and Audio Compression Manager (ACM) interfaces.
5
DirectShow Based Video Stream Transmission
Capture
Encoder
NetSender
VideoRender
Decoder
NetReceiver
Internet
The basic principle of video stream transmission based on DirectShow is shown in Fig. 2.
Fig. 2. The basic principle of video stream transmission based on DirectShow
Video stream are captured by Capture Source Filter in sever, and transmitted to MPEG-4 Encoder Filter where the video stream are compressed. The coded video stream is transmitted to Netsender Filter and send to Internet by UDP protocol or send to the multicast group by multicast.In client, the Receiver Source Filter receives data from Internet , deliver it to MPEG-4 Decoder Filter where the video stream are decompressed. Then the decoded data are send to Video Render Filter.
124
5.1
S. Li, B. Li, and F. Zhang
CnetSender Filter
The inheritance relationship of CNetSender Filter is: CBaseFilter
CNetSender
Implement method is as follows: (1) Implement the pure virtual function CBaseFilter :: GetPin, which retrieves object’s pointer of filter pins. In this case, it retrieves object’s pointer of the CnetSenderPin. (2) Implement the pure virtual function CbaseFilter :: GetPinCount. , which retrieves the number of filter pins. CnetSenderPin is a pin class of CnetSender Filter. The inheritance relationship of CnetSenderPin is: CRenderedInputPin
CNetSenderPin
Implement method is as follows: (1) Implement the pure virtual function CrenderedInputPin :: Receive (ImediaSample ∗ pMediaSample). This function is used to receive one frame data, pMediaSample is the pointer of this data. (2) Implement the pure virtual function CrenderedInputPin :: CheckMediaType (const CmediaType ∗ inMediaType). This function is used to check the type of connection media, inMediaType is the pointer of media type. 5.2
CNetReceiver Filter
The inheritance relationship of CNetReceiver Filter is: CBaseFilter
CNetReceiver
Implement method is as follows: (1) Implement the pure virtual function Csource :: GetPin, which retrieves object’s pointer of filter pins. In this case, it retrieves object’s pointer of the CNetReceiverPin.
Internet Living Broadcast of Medical Video Stream
125
CBaseOutputPin
CSourceStream CNetSenderPin
(2) Implement the pure virtual function Csource :: GetPinCount. , which retrieves the number of filter pins. CnetSenderPin is a pin class of CnetReceiver Filter. The inheritance relationship of CnetReceiverPin is: Implement method is as follows: (1) Implement the pure virtual function CBaseOutputPin :: DecideBufferSize (ImemAllocator ∗ pAlloc, ALLOCATOR-PROPERTIES ∗ pprop). This function is used to set the maximum length of one frame data to prop-¿cbBuffer. (2) Implement the pure virtual function CSourceStream :: CheckMediaType (const CMediaType ∗ inMediaType). This function is used to the type of connection media, inMediaType is the pointer of the media type.
6 6.1
Video Stream Transmission Via Internet Internet Transmission
(1) Media transmission via Internet In DirectShow, the Filters connects successfully, and the data receive correctly only when the media types are consistence,. So the client must receives the server’s media type. Because the TCP is dependable connection, it is adopt to send media type. A TCP socket thread is constructed in server. As long as detecting the client trying to connect, the server send media type. (2) Video stream transmission via UDP multicast Due to the large number of video stream data and many clients, the UDP multicast is a good way to transmit video stream. In this way, the less bandwidth are used while many clients are connected.The video stream are implemented in Receive function of CnetSenderPin. 6.2
Receiving Data from Internet
Internet data transmission scheme is as follows: (1) After the connection by TCP, client can receive media type immediately and create CnetReceiverPin instance according to the media type. CMediaType ∗ pmt pmt.SetType(& MEDIATYPE-Video); //set the Majortype pmt.SetFormatType(& FORMAT-VideoInfo); //set the media format type // inFormat is the media type data received from Internet VIDEOINFOHEADER ∗ pvi = (VIDEOINFOHEADER ∗) inFormat;
126
S. Li, B. Li, and F. Zhang
const GUID subtype = GetBitmapSubtype(& pvi − > bmiHeader); pmt.SetSubtype(& subtype); //set subtype pmt.SetFormat((BYTE∗)inFormat, inLength); //set video format type (2) After adding in the multicast group, a double-buffer queue is constructed. The queue constitutes by two single chained list, writing data queue and reading data queue:
PData
PData
PData
PData
Head
PData
PData Tail
PData
PData
PData
PData
After finished a frame data in write chain, this data block is delete from head of writing queue and send it to the tail of reading queue. After run out of this data block in reading chain, it is deleted from reading queue and send it to the tail of writing queue. 6.3
Video Stream Render
When the Filters are connected successfully, FilterGraph display the received Video stream under the control of Filter Graph Manager. IMediaControl ∗ pMC = NULL; IMediaEventEx ∗ pME = NULL; // media control interface pGraph − > Queryinterface ( IID-ImediaControl, (void ∗ ∗ ) & pMC); //media event interface pGraph − > Queryinterface ( IID-ImediaEventEx, (void ∗ ∗ ) & pME); pMC − > Run (); //run Filter chain
7
Experimental Result
Experiment is implemented in Huaihe Hospital of Henan University. The specification of digital subtraction angiography equipment of Huaihe Hospital is GE LCV+. Digital subtraction angiography video stream are captured by an advanced image capture board. The specification of image capture board is OKM30A. MPEG-4 and DirectShow framework technique are used for data’s compression and transmission. Data of DSA video stream are transported easily from server sender Filter to client receiver Filter according to TCP and UDP protocols. Table 1 shows the experimental environment and equipments of this scheme.
Internet Living Broadcast of Medical Video Stream
127
Experimental results show that the image is clear in 100M LAN, and the delay is less than one second. High performances of definition and real-time of the DSA video are both achieved in this scheme. Memory usage in server is 10M. Memory usage is 6M and 21M in Client(render model VMR) and Client(render model Normal) respectively. The frame frequency is always 29 frames/second. Experimental results under above environment are shown as Table 2. Table 1. Experimental environment Equipments Specification DSA equipment GE LCV+ Image capture board OK-M30A,1024 × 1024, 10bit MPEG-4 Codec/Decodecer Xvid Network 100M Lan Server CPU PV 2.0G, 512M memory Client CPU XP 1700+, 512M memory, 32M video card Table 2. Experimental results
Server Client(render model VMR) Client(render model Normal)
Memory usage Frames/second 10M 29 6M 29 21M 29
VMR (Video Mixing Render) is used firstly to render in client according to the data type. In addition, if the CPU occupancy rate is high in client, the packet dropping rate of data received from Internet will rise, and will result the Mosaic when the video render.If close some other programs, quality of video is all right.
8
Conclusion
In this scheme, Digital Subtraction Angiography (DSA) video stream are captured by an advanced image capture board. MPEG-4, and DirectShow framework technique are used for data’s compression and transmission. Data of DSA video stream can be transported easily from server sender Filter to client receiver Filter according to TCP and UDP protocols. Experimental results show that the image is clear in 100M LAN, and the delay is less than one second. High performances of definition and real-time of the DSA video are both achieved in this scheme. And by the image processing function, we can also process images received from Internet. Experimental results show that the living broadcast of interventional operation/surgery via Internet is a feasible scheme.
128
S. Li, B. Li, and F. Zhang
References 1. Perednia, D.A., Allen, A.: Telemedicine technology and clinical applications. Journal of the American Medical Association 273(6), 483–488 (1995) 2. Gandsas, A., Altrudi, R., Pleatman, M., Silva, Y.: Live interactive broadcast of laparoscopic surgery via the Internet. Current Surgery 60(2), 126–129 (2003) 3. Tao, Y., Miao, J.: Workstation scheme and implementation for a medical imaging information system. Chinese Medical Journal 116(5), 654–657 (2003) 4. Huang, Z., Zhuang, T.: Evolution of DICOM Standard and its Latest Changes. Chinese Journal of Medical Instrumentation 28(3), 203–207 (2004) 5. Jose, R., Pablo, G., Miguel, S.: A Compression and Transmission Scheme of Computer Tomography Images for Telemedicine Based on JPEG2000. Telemedicine Journal and e-Health 10, 40–44 (2004) 6. Ramakrishnan, B., Sriraam, N.: Internet transmission of DICOM images with effective low bandwidth utilization. Digital Signal Processing 16(6), 825–831 (2006) 7. Brody, W.: Digital Subtraction Angiography. IEEE Transactions on Nuclear Science 29(3), 1176–1180 (1982) 8. Prasad, R., Ramkishor, K.: Implementation of MPEG-4 Video Encoder on RISC Core. IEEE Transactions on Consumer Electronics 49(2), 1–6 (2003) 9. Dasu, A., Panchanathan, S.: A Survey of Media Processing Approaches. IEEE Transactions on Circuit and System for Video Technology 12(8), 1–13 (2002) 10. Lu, Q.: DirectShow Development Guidebook. Tsinghua University Press, Beijing (2003)
Predicting Syndrome by NEI Specifications: A Comparison of Five Data Mining Algorithms in Coronary Heart Disease Jianxin Chen1 , Guangcheng Xi1 , Yanwei Xing2 , Jing Chen1 , and Jie Wang2 1
2
Key Laboratory of Complex Systems and Intelligence Science Institute of Automation, Chinese Academy of Sciences 100080, Beijing, China {jianxin.chen,guangcheng.xi}@ia.ac.cn GuangAnMen Hospital, Chinese Academy of Chinese Medical Science 100053, Beijing, China
Abstract. Nowadays, most Chinese take a way of integration of TCM and western medicine to heal CHD. However, the relation between them is rarely studied. In this paper, we carry out a clinical epidemiology to collect 102 cases, each of which is a CHD instance confirmed by Coronary Artery Angiography. Moreover, each case is diagnosed by TCM experts as what syndrome and the corresponding nine NEI specifications are measured.We want to explore whether there exist relation between syndrome and NEI specifications. Therefore, we employ five distinct kinds of data mining algorithms: Bayesian model; Neural Network; Support vector machine ,Decision trees and logistic regression to perform prediction task and compare their performances. The results indicated that SVM is the best identifier with 90.5% accuracy on the holdout samples. The next is neural network with 88.9% accuracy, higher than Bayesian model with 82.2% counterpart. The decision tree is less worst,77.9%, logistic regression models performs the worst, only 73.9%. We concluded that there do exist relation between syndrome and western medicine and SVM is the best model for predicting syndrome by NEI specifications.
1
Introduction
Coronary heart disease (CHD)is a serious disease causing more than 1 million Chinese to death each year. [1].In China, most people take a way of integration of TCM and western medicine to heal CHD.The following is a brief introduction to TCM. 1.1
TCM
TCM has been always regarded as a key component in five thousand years of Chinese civilization history. It has a history of more than 3000 years, while 1000 years are spending on healing CHD, so it piles up extensive experience. TCM, K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 129–135, 2007. c Springer-Verlag Berlin Heidelberg 2007
130
J. Chen et al.
whose core is syndrome, or ‘Zheng’ in Chinese, is on her way to modernization, aiming to be accepted, like western medicine, as sciences [2],[3]. The kernel of TCM is syndrome. Every herbal is prescribed in accord with syndromes. However, till now, the relation between syndrome and physical and chemical specifications of western medicine is rarely explored. Furthermore, during animal experiments in laboratories, disliking human, animals can not be felt pulse, so determination of syndrome in animals is significantly difficult. However, the bloods of human and animals are more easily to obtained, therefore, we can explore the relation between syndrome and some blood specifications. Here, we choose Neuro-Endocrine-Immune(NEI) specifications. The following is the backgroud of NEI. 1.2
NEI System
In modern Western medicine (WM), NEI system acts as a pivot in modulating host homeostasis and naturally optimising health through complex communications among chemical messengers (CMs), including hormones, cytokines and neurotransmitters [4]. If we consider CMs as the biochemical ingredients of the NEI system, then those genes that (directly or indirectly) encode these CMs can be considered as the genic ingredients of the NEI system. Here, our goal is using the information of NEI specifications to predicting whether a patient is a specific syndrome. We employ five kinds of classical data mining methods to perfom the task and we compare the methods to search the best one. Therefore, the problem is classification problem. 1.3
Data Mining Algorithms
Under the background of supervised classification problem, data mining algorithms mainly comprise of five broadly used kinds: Bayesian method, neural network, support vector machine, decision trees and logistic regression. Each kind is developed quickly and usually combines with each other to solve some hard problems [5]. Bayesian network (BN) is chosen from Bayesian method to perform classification here. Radial Basis Function Network is selected from neural networks for its higher performance in doing classification than other algorithm, such as recurrent neural network. We used a well-known support vector machine algorithm, Platt’s SMO Algorithm [6], as a representative of SVM classification since it can process both categorical and numerical variables. For decision tree kind, Quinlan’s C4.5 algorithm [7] is employed for performing tasks here. Logistic regression is a classical method and it is used here to perform the task in this paper.
2
Biological Variables and Clinical Data Collection
The 102 patients included in the survey are incoming patients of AnZhen Hosptial in Beijing from June 2005 to April 2006. Each patient is diagnosed by western
Predicting Syndrome by NEI Specifications
131
medicine experts as CHD by Coronary Artery Angiography, meanwhile, each patient is diagonosed by experts as what syndrome.Blood samples of all patients were collected after a 12-hour overnight fast before cardiovascular procedures. Totally, 9 NEI specifications are measured from the blood samples. There are Mpo1, Wbc1, Tni2, Tnf, Et, Il6, Il8, No and Hicrp. Additionally, the basic information of each patients,such as names,ages and so on are also recorded, but this part of data is not included in the process of data mining.
3
Prediction Models
New data always needs already existed algorithms to test its performance. We employed four types of classification algorithms: Bayesian model, neural networks, SVM and decision trees. These models were jigged for inclusion in this research due to their popularity in the recently published documents. The following is a brief introduction to the four classification algorithms and the parameter setting of each model. 3.1
Bayesian Network
A Bayesian network (BN) is a graphical model that encodes probabilistic relationships among attributes of interest. Several advances have been made to ameliorate Bayesian network to fit all kinds of realistic problems [8]. We select stimulated annealing as method for searching network structures. Estimator is BayesNetEstimator, which is the base class for estimating the conditional probability tables of a Bayesian network once the structure has been learned. 3.2
Radial Basis Function Network
As shown in Fig. 1, RBF network has two layers, not counting the input layer, and differs from a multilayer perceptron in the way that the hidden units perform computations.Each hidden unit essentially represents a particular point in input space, and its output, or activation, for a given instance depends on the distance between its point and the instance-which is just another point. Intuitively, the closer these two points, the stronger the activation. This is achieved by using a nonlinear transformation function to convert the distance into a similarity measure. A bell-shaped Gaussian activation function, whose width may be different for each hidden unit, is commonly used for this purpose. The hidden units are called RBFs because the points in instance space for which a given hidden unit produces the same activation form a hypersphere or hyperellipsoid. (In a multilayer perceptron, this is a hyperplane.) 3.3
Support Vector Machine
The SVM is a state-of-the-art maximum margin classification algorithm rooted in statistical learning theory [11],[12]. SVM performs classification tasks by maximizing the margin separating both classes while minimizing the classification errors. We used sequential minimal optimization algorithm to train the SVM here, as shown in As shown in Fig. 2
132
J. Chen et al.
Fig. 1. The topology of MLP network
Fig. 2. A illustration of SVM
Predicting Syndrome by NEI Specifications
3.4
133
Decision Trees C4.5
As the name implies, this algorithm recursively separates observations in branches to construct a tree for the purpose of improving the prediction accuracy. In doing so, they use mathematical algorithms information gain to identify a variable and corresponding threshold for the variable that splits the input observation into two or more subgroups. This step is repeated at each leaf node until the complete tree is constructed. This step is repeated at each leaf node until the complete tree is constructed Confidence factor is set as 0.01. The minimum number of instances per leaf is 2. 3.5
Logistic Regression
Logistic regression is a generalization of linear regression [13]. It is used primarily for predicting binary or multi-class dependent variables. Because the response variable is discrete, it cannot be modeled directly by linear regression. Therefore, rather than predicting point estimate of the event itself, it builds the model to predict the odds of its occurrence. In a two-class problem, odds greater than50% would mean that the case is assigned to the class designated as 1 and 0 otherwise. While logistic regression is a very powerful modeling tool, it assumes that the response variable (the log odds, not the event itself) is linear in the coefficients of the predictor variables.
4 4.1
Performance Evaluation and Results Performance Measures
We employed three hackneyed performance measures: accuracy, sensitivity and specificity. A distinguished confusion matrix is obtained to calculate the three measures. Confusion matrix is a matrix representation of the classification results. the upper left cell denotes the number of samples classifies as true while they were true (i.e., TP), and lower right cell denotes the number of samples classified as false while they were actually false (i.e., TF). The other two cells (lower left cell and upper right cell) denote the number of samples misclassified. Specifically, the lower left cell denoting the number of samples classified as false while they actually were true (i.e., FN), and the upper right cell denoting the number of samples classified as true while they actually were false (i.e., FP).Once the confusion matrixes were constructed, the accuracy, sensitivity and specificity are easily calculated as: sensitivity = TP/(TP + FN); specificity = TN/(TN + FP). Accuracy = (TP + TN)/(TP + FP + TN + FN);10-fold cross validation is used here to minimize the bias produced by random sampling of the training and test data samples. Extensive tests on numerous data sets, with different learning strategies, have shown that 10 is about the right number of folds to get the best estimate of error, and there is also some theoretical evidence that backs this up [9],[10].
134
4.2
J. Chen et al.
Results
Every model was evaluated based on the three measures discussed above (classification accuracy, sensitivity and specificity). The results were achieved using average value of 10 fold cross-validation for each algorithm. As shown in Figure 3, we found that the Bayesian model (BN) achieved classification accuracy of 82.2% with a sensitivity of 81.1% and a specificity of 85.5%. The neural network achieved classification accuracy of 88.9% with a sensitivity of 88.9% and a specificity of 88.8%. The decision trees (C4.5) achieved a classification accuracy of 77.9% with a sensitivity of 76.5% and a specificity of 81.9%. The logistic regression achieved a classification accuracy of 73.9% with a sensitivity of 84.6% and a specificity of 70.3%. However, SVM preformed the best of the five models evaluated. It achieved a classification accuracy of 90.5% with a sensitivity of 92% and a specificity of 90%.
Fig. 3. The performance of five data mining algorithms as classification problem
5
Conclusion
In this paper, we employ five kinds of popular data mining models to perform classification task in identifying syndrome by NEI specifications in CHD. The data was recruited from clinics with whole 102 cases. We used 10-fold cross validation to compute confusion matrix of each model and then calculate the three performance measures-sensitivity, specificity and accuracy to evaluate five kinds
Predicting Syndrome by NEI Specifications
135
of models. We found that the Bayesian model (BN) achieved classification accuracy of82.2% with a sensitivity of 81.1% and a specificity of 85.5%. The neural network achieved classification accuracy of 88.9% with a sensitivity of 88.9% and a specificity of 88.8%. The decision trees (C4.5) achieved a classification accuracy of 77.9% with a sensitivity of 76.5% and a specificity of 81.9%. The logistic regression achieved a classification accuracy of 70.3% with a sensitivity of 84.6% and a specificity of 73.9%. However, SVM preformed the best of the five models evaluated. It achieved a classification accuracy of 90.5% with a sensitivity of 92% and a specificity of 90%. We concluded that syndrome does exist strong relation with NEI specifications and our results shown that SVM will provide a better insight to predicting syndrome by NEI specifications. Acknowledgments. The work has been supported by 973 Program under grant No. (2003CB517106 and 2003CB517103) and NSFC Projects under Grant No. 60621001, China.
References 1. World Health Organization.: World Health statistics Annual. Geneva, Switzerland, World Health Organization (2006) 2. Normile, D.: The new face of Traditional Chinese Medicine. Science 299, 188–190 (2003) 3. Xue, T.H., Roy, R.: Studying Traditional Chinese Medicine. Science 300, 740–741 (2003) 4. Roth, J., LeRoith, D., et al.: The evolutionary origins of hormones, neurotransmitters, and other extracellular chemical messengers: implications for mammalian biology. The New England Journal of Medicine 306, 523–527 (2006) 5. Brudzewski, K., Osowski, S., Markiewicz, T.: Classification of milk by means of an electronic nose and SVM neural network. Sensors and Actuators B 98, 291–298 (2004) 6. Keerth, S., Shevade, K., et al.: Improvements to Platt’s SMO Algorithm for SVM classifier design. Neural Computation 13, 637–649 (2001) 7. Quinlan, R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA (1993) 8. Huang, C.L., Shih, H.C., Chao, C.Y.: Semantic Analysis of Soccer Video Using Dynamic Bayesian Network. IEEE Transactions on Multimedia 8, 749–760 (2006) 9. Witten, I.H., FrankMichalewicz, E.Z.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005) 10. Delen, D., Walker, G., Kadam, A.: Predicting breast cancer survivability. Artif. Intell. Med. 34, 113–127 (2005) 11. Vapnik, K.: Statistical learning theory. Wiley, New York (1998) 12. Graf, A., Wichmann, F., Bulthoff, H., et al.: Classification of faces in man and machine. Neural Computation 18, 143–165 (2006) 13. Hastie, T., Tibshirani, R., Friedman, J.: The elements of statistical learning. Springer, New York (2001)
Application of Image Processing and Finite Element Analysis in Bionic Scaffolds’ Design Optimizing and Fabrication Liulan Lin, Huicun Zhang, Yuan Yao, Aili Tong, Qingxi Hu, and Minglun Fang Rapid Manufacturing Engineering Center, Shanghai University, P.O. Box 113, 99 Shangda Road, Shanghai, 200444, China
[email protected]
Abstract. Design optimizing is the key step in obtaining bionic scaffolds with proper shape and inner microstructure, which are two critical parameters for bionic scaffolds in Tissue Engineering. In this paper, the application of image processing and finite element analysis in the design optimizing of bionic scaffold’s shape and inner microstructure were studied respectively. The bionic scaffold’s shape was obtained through Mimics’ image processing and 3D reconstruction technologies. Finite element analysis (FEA) was used in evaluating the mechanical properties of scaffold’s structure models with different macropores shape and distribution to obtain the optimized parameters. Three groups of bioceramic scaffolds samples were fabricated through an indirect method combining stereolithography (SLA) and slurry casting, and then mechanical experiments were tested. The change trendy of the compressive strength obtained through mechanical experiments was consistent with the FEA results basically so the significance of FEA in bionic scaffolds’ design optimizing was proved.
1 Introduction In Tissue Engineering, temporary 3D bionic scaffolds are essential to guide cell proliferation and to maintain native phenotypes in regenerating biologic tissues or organs [1]. The shape and inner microstructure are the two critical properties of bionic scaffolds for repairing defective bone. Bionic scaffolds should have the same shape as restoration for repairing the defective bone, so the scaffolds could be placed well in body and guide the neonatal bone’s growth correctly. To satisfy tissue engineering’s requirement, bionic bone scaffolds must have exact shape with the defects, polygradient porous configuration with characteristics and properties such as porosity, surface area to volume ratio, pore size, pore interconnectivity, shape (or overall geometry), structural strength and biocompatibility. These characteristics and properties are often considered to be critical factors in their designing and fabrication [2]. Design optimizing is the key step in obtaining bionic scaffolds with proper shape and inner microstructure. Traditional methods of scaffold fabrication include fiber bonding, solvent casting and particulate leaching [3], membrane lamination, melt molding, gas foaming, cryogenic induced phase separation [4],[5] and so on. However, all of these techniques are mainly based on manual work and lack of K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 136–145, 2007. © Springer-Verlag Berlin Heidelberg 2007
Application of Image Processing and Finite Element Analysis
137
corresponding designing process, so extra procedure was needed to obtain suitable shape and the microstructure wasn’t able to be controlled well. These traditional also have many disadvantages such as long fabrication periods, poor repeatability and insufficient connectivity of pores [6]. To overcome the limitations of these conventional techniques, automated computer controlled fabrication techniques, such as rapid prototyping (RP), are being explored. Based on layer by layer manufacturing process, parts with complex shape or structure could be produced through RP technologies easily and rapidly. Several kinds of RP technologies such as stereolithography (SLA) [7],[8], selective laser sintering (SLS) [9],[10], fused deposition modeling (FDM) [11],[12], three-dimensional printing (TDP or 3DP) [13],[14] and so on, have been applied widely in fabricating bionic scaffolds for tissue engineering and achieved some progress. Using RP technologies in bionic scaffolds preparation could fully performs the significance of designing and improves the bionic scaffolds’ properties. In this paper, the application of image processing and finite element analysis in the design optimizing of bionic scaffold’s shape and inner microstructure was studied respectively. The bionic scaffold’s shape was obtained through Mimics’ image processing and 3D reconstruction technologies. The inner microstructure of bionic scaffolds should be polygradient porous configuration with macro-pores and micro-pores. The macro-pores’ size and distribution was designed by CAD software and could be manufactured through RP technologies, while the micro-pores were caused by burning off of the pore-forming agent forming the spacing. So the design optimizing means finding the optimized parameters for size and distribution of macro-pores. Finite element analysis (FEA) was used in evaluating the mechanical properties of the optimized bionic scaffold’s microstructure models and models without design optimizing. Several groups of bioceramic scaffolds samples were fabricated through an indirect method combining stereolithography (SLA) and slurry casting and mechanical experiments were done to validate the FEA results.
2 Designing and Analyzing Process 2.1 Image Processing and 3D Reconstruction The patient’s CT date of defective skull were imported into Mimics 9.11 (The Materialise Group, Leuven, Belgium) and the 3D STL model of the skull was obtained through image processing and 3D reconstruction technologies. Then the restoration’s 3D STL model of defect was constructed by the symmetrically repairing operation in Mimics. The shape of the restoration was just the shape of the bionic bone scaffold to prepare. 2.2 Scaffold’s Structure Model Design and Analysis The macro-pores of bionic scaffold’s inner microstructure should be 3D connective gridding structure with proper size to assure the scaffold’s connectivity and be suitable for cell’s growth and proliferation. There were lots of scaffold models with different pore shape, size and distribution. Considering the preparing technology, four kinds of structure model with different pore shape and distribution were created in UG NX3.0 (UGS PLM Solutions, Plano, TX, USA) to make the analysis and contrast.
138
L. Lin et al.
As shown in Fig.1, model A has cylindrical macro-pores with diameter of 0.80 mm and distance between adjacent pores of 2.0 mm. Model C has square macro-pores with edge length of 0.71 mm and distance between adjacent pores of 2.0 mm to have the equal porosity with model A. The macro-pore’s distribution of model B and model D are different of model A and model C. The three coordinate axis pores were intersected in one point in model A and model C, while in model B and model D the X-axis pores and Y-axis pores were not in the same horizontal plane.
Fig. 1. The structure models of bionic scaffolds
The compress stimulation of the microstructure models were solved in finite element analysis software Ansys. The change of mechanical strength between the models before and after design optimizing was contrast and analyzed. According formulas of the Mechanics of Materials, the ratio between loads and strain is a constant to the same material. The four models were set with same element type and material attributes and the deformation of each model under the same load (compressing or bending) was contrasted. Based on the max total strain density value of each model, the compressive strength or bending strength was calculated. 2.3 Mechanical Experiment Three groups of bioceramic scaffolds of these four microstructure model were fabricated through an indirect method combining stereolithography (SLA) and slurry casting technologies. Compression tests were conducted with an INSTRON 5542 material testing system with Merlin™ software using a 50N load-cell (Norwood, MA, USA). Compression tests with real materials were done to validate the effect of design optimizing and the finite element analysis’ accuracy.
Application of Image Processing and Finite Element Analysis
139
3 Results 3.1 Result of Defective Bone Repairing As shown in Fig.2, the CT scanning images of patient’s skull were imported into Mimics 9.11. After selecting suitable threshold, the 3D model of the skull was reconstructed exported to STL model (Fig.3 A). Threshold selecting was very important for the reconstructed 3D model’s quality. In this paper, the bone model was defined through masks with threshold between 226 and 1738. The defective skull was repaired by the symmetrically repairing operation in Mimics. The shape of the restoration was just the shape of the bionic bone scaffold to prepare. Fig.3 B showed the bionic scaffold model with macro-pores, which was created through Boolean operation in Magics X (The Materialise Group, Leuven, Belgium), which is a software especially for processing STL files.
Fig. 2. The structure models of bionic scaffolds
Fig. 3. Result of repairing of the defective skull (A) and the model of restoration and bionic scaffold with macropores (B)
140
L. Lin et al.
3.2 Result of Finite Element Analysis Bionic scaffolds are full with porous microstructure, so it could be assumed that this porous microstructure is a homogeneous, isotropic material. Bio-ceramic is a brittle material and performs flexibility property before break (the max strain value reaches 0.03). The Young’s Module of scaffolds material was worked out based on previous mechanical experiments (E=36.96MPa). The most common loads of scaffolds suffered were compression and bending, especially the compressive strength is the most important mechanical property of bionic scaffolds. Selected the same element type and material attributes, the compression and bending analysis of these four models were analyzed in Ansys. The max strain value was obtained and then the compressive strength and bending strength of every model was calculated respectively according to mechanical formula. Based on the compressive strength and bending strength of every model, the influences of macro-pores shape and distribution on the mechanical properties were analyzed and discussed. Fig.4 shows the compressive strength of each model under unidirectional compressive load. The compressive strength of model C is more than twice of model A’s and the compressive strength of model D is 24.7% higher than model B’s. Compared with model A, the compressive strength of model B increases 63.6%, while the compressive strength of model D decreases 6.2% compared with model C. From Fig.4, following conclusions could be obtained. Firstly, scaffolds with square macro-pores exhibit much better compressive property than scaffolds with cylindrical macro-pores having the same porosity. Secondly, altering the macro-pores distribution could improve the compressive strength of model with cylindrical macro-pores apparently but result a little reduce of the compressive strength of model with square macro-pores. ) 0.3 a P M ( 0.25 h t g n 0.2 e r t s 0.15 e v i 0.1 s s e r p 0.05 m o c
0.2536
0.2389
0.1916
0.1171
0
A
B
C
D
model
Fig. 4. Compressive strength of the four models under unidirectional compressive load
Application of Image Processing and Finite Element Analysis
141
Fig. 5. The total strain intensity of structure models under unidirectional compressive load
Fig.5 showed the total strain intensity of four structure models under unidirectional compressive load analyzed in Ansys. All of these were under the same load situation with the bottom surface fixed and pressure of 10000N/m2 was on the top surface. The total strain intensity reached the maximum value in the stress concentration area, which was the area that was broken firstly. The stress concentration area was usually in the smallest sections. As shown in Fig.7, both the stress concentration degree of model A and B were higher than the model C and D respectively and the smallest section of model with cylinder macro-pores was smaller than the model with square macro-pores under the same pores distribution. So the scaffolds with square macropores exhibit much better compressive property than scaffolds with cylindrical macropores having the same porosity. Altering the macro-pores distribution could increase the smallest section area. To the models with cylinder macro-pores, altering the macro-pores distribution could reduce the concentration degree of stress apparently, so the compressive strength of model B increased clearly from model A. To the models with square macro-pores, altering the macro-pores distribution aggravated the concentration degree of stress, so the compressive strength of model D reduced a little from model C. 3.3 Result of Finite Element Analysis As shown in Fig.6, three groups of bioceramic scaffold samples of the four kinds of structure model were fabricated through an indirect method combining with stereolithography (SLA) and slurry casting technologies. Compression tests were conducted with an INSTRON 5542 material testing system using a 50N load-cell. The compressive tests results were shown as Fig.7. From Fig.7, it was seen that the compressive strength of scaffold samples C is 59.2% higher than scaffold samples A and the compressive strength of scaffold samples D is 5.4% more than scaffold samples B. These distinctions were not as evident
142
L. Lin et al.
Fig. 6. Bioceramic scaffold samples of the model structure )a 0.7 P 0.6 M ( h t 0.5 g n e r 0.4 t s e 0.3 v i s s 0.2 e r p m 0.1 o c
0
0.5434
0.5698
0.5724
C
D
0.3579
A
B
scaffold sample
Fig. 7. Compressive strength of the scaffold samples under unidirectional compressive load
as the FEA results, but also showed that scaffolds with square macro-pores exhibit better compressive strength than scaffolds with cylinder macro-pores. Compared with scaffold samples A, the compressive strength of scaffold samples B increases 51.8%, while the compressive strength of scaffold samples D nearly equal with scaffold samples C. This trendy also exhibited that altering the macro-pores distribution could improve the compressive strength of scaffold samples with cylindrical macro-pores apparently while made less influence on scaffold samples with square macro-pores.
4 Discussion 4.1 The Advantage of Using Mimics in Scaffolds’ Shape Designing The shape of human bone is very complex and irregular, while the bone defects caused by accidents or disease are even more. Before the appearance of the medical image processing system, the traditional method to repair the defective bone needs a surgery first, and in this operation, the shape and the size of the defective part of the bone is estimated by the naked eyes of doctors and some measure tools. And then, the model of the defective part is made by a manual operation followed by a second operation to plant the model to the defective part of the bone. This traditional method to repair the defective bone is of low efficiency, long period, low precision, and has a high cost. And the second operation usually causes hurt to the patient.
Application of Image Processing and Finite Element Analysis
143
As the appearance and the development of medical image processing system, this kind of system is used more and more in the repair of the defective bone. First, the CT images are obtained, and then the 3D CAD model of the defective bone is reconstructed by the medical image processing system. Then using the function of the system or other CAD software, the defective bone is repair and the CAD model of the repair is obtained. At last, the CAD model of the repair is fabricated. This method could have a high precision, shorten the period, and avoid the hurt to the patient in the second operation [15-16]. Mimics is a kind of such digital 3D medical image processing system. It provides the function to read the medical images, to reconstruct the images, and to repair the defective bone. The unique mask operation makes the segmentation of the images and the reconstruction of the tissue easy and convenient. Using the reconstructing function of Mimics, the related area can be calculated and the 3D model can be obtained. Usually, these operations require a high speed. However, Mimics can successfully finish on normal PC. Mimics provides a great convenience to the doctors, shortens the treating time, reduces the hurt to the patient and brings a great improvement to the clinic effect. 4.2 Mechanical Experiment The macro-pores design optimizing contains the design of the size, shape, distribution and so on. These parameters are very important to improve bionic scaffold’s properties. As the biomaterials used to prepare scaffolds were always very expensive and the fabricating process is complicated and needs long time, using finite element analysis to evaluate the mechanical properties of scaffolds as the design changed could save the cost and preparation cycle. The change trendy of the compressive strength obtained through mechanical experiments was consistent with the FEA results basically in this study validated the significance of FEA in bionic scaffolds design optimizing. Although the change trendy of the compressive strength obtained through FEA and mechanical experiments was consistent basically, the value of compressive strength of each scaffold sample was different from the FEA results of structure models. The compressive strength of all the four scaffold samples obtained through compressive tests was higher obviously than the FEA results of the four structure models. This was because the factual strain value when the scaffolds were broken was much bigger than 0.03, which was set in Ansys. The bioceramic materials properties were not exactly consistent with the material attributes set in Ansys. The fabrication methods and processing technologies could also influence the mechanical properties to a large extent.
5 Conclusions In this paper, the application of image processing and finite element analysis in the design optimizing of bionic scaffolds’ shape and inner microstructure was studied respectively. The bionic scaffold’s shape was obtained through Mimics’ image processing and 3D reconstruction technologies. Finite element analysis (FEA) was used in evaluating the mechanical properties of scaffolds’ structure models with different macro-pores shape and distribution to obtain the optimized parameters. Three groups
144
L. Lin et al.
of bioceramic scaffolds samples were fabricated through an indirect method combining stereolithography (SLA) and slurry casting and mechanical experiments were tested. The change trendy of the compressive strength obtained through mechanical experiments was consistent with the FEA results basically, so the significance of FEA in bionic scaffolds’ design optimizing was validated. The compressive strength of all the four scaffold samples obtained through compressive tests was lower obviously than the FEA results of the four structure models and the possible reasons were discussed. Acknowledgments. The authors would like to acknowledge the support of Shanghai Education Fund (No. 5A281) and Shanghai Academic Excellent Youth Instructor Special Foundation.
References 1. Tan, K.H., Chua, C.K., Leong, K.F., Cheah, C.M.: Scaffold development using selective laser sintering polyetheretherketone-hydroxyapatite biocomposite blends. Biomaterials 26, 4281–4289 (2005) 2. Yang, S.F., Leong, K.F., Du, Z.H., Chua, C.K.: The design of scaffolds for use in tissue engineering: Part 1-Traditional factors. Tissue Eng. 7(6), 679–690 (2001) 3. Linbo, W., Jiandong, D.: Compression Molding of PCL Porous Scaffolds with complicated shape for Tissue Engineering. Polymer Material Science and Engineering 25(1), 296–299 (2005) 4. Deville, S., Saiz, E., Tomsia, A.P.: Freeze casting of hydroxyapatite scaffolds for bone tissue engineering. Biomaterials 27, 5480–5489 (2006) 5. Madihally, S.V., Howard, W.T.: Matthew Porous chitosan scaffolds for tissue engineering. Biomaterials 20, 1133–1142 (1999) 6. Junmin, Q., Kai, C., Hao, A., Zhihao, J.: Progress in research of preparation technologies of porous ceramics. Ordnance Material Science and Engineering 28(5), 60–64 (2005) 7. Woesz, A., Rumpler, M., Stampfl, J., Varga, F.: Towards bone replacement materials from calcium phosphates via rapid prototyping and ceramic gelcasting. Materials Science and Engineering C 25, 181–186 (2005) 8. Chen, Z., Li, D., Lu, B.: Fabrication of osteo-structure analogous scaffolds via fused deposition modeling. Scripta Materialia 52, 157–161 (2005) 9. Williams, J.M., Adewunmi, A., Schek, R.M., Flanagan, C.L.: Bone tissue engineering using polycaprolactone scaffolds fabricated via selective laser sintering. Biomaterials 26, 4817–4827 (2005) 10. Chen, V.J., Smith, L.A., Ma, P.X.: Bone regeneration on computer-designed nano-fibrous scaffolds. Biomaterials 27, 3973–3979 (2006) 11. Kalitaa, S.J., Bosea, S., Hosickb, H.L.: Amit Bandyopadhyay, Development of controlled porosity polymer-ceramic composite scaffolds via fused deposition modeling. Materials Science and Engineering C 23, 611–620 (2003) 12. Zein, I., Hutmacher, D.W., Tan, K.C.: Fused deposition modeling of novel scaffold architectures for tissue engineering applications. Biomaterials 23, 1169–1185 (2002) 13. Leea, M., Dunna, J.C.Y., Wu, B.M.: Scaffold fabrication by indirect three-dimensional printing. Biomaterials 26, 4281–4289 (2005)
Application of Image Processing and Finite Element Analysis
145
14. Leukers, B., Gulkan, H., Irsen, S.H.: Hydroxyapatite scaffolds for bone tissue engineering made by 3D printing. Journal of Materials Science: Materials in Medicine 16, 1121–1124 (2005) 15. Huanwen, D., Yingjun, W., Qingshui, Y.: Recent development of Computer-aided tissue Engineering. Chinese Journal of Reparative and Reconstruction of Surgery 5, 574–577 (2006) 16. Xi, H., Longbiao, Z., Zhisong, Z., Jianwei, Z.: CT-image Based Reverse of Custom Made Stem. Journal of Nantong University (Natural Science) 5, 52–56 (2006)
The Mechanical Properties of Bone Tissue Engineering Scaffold Fabricating Via Selective Laser Sintering Liulan Lin, Aili Tong, Huicun Zhang, Qingxi Hu, and Minglun Fang Rapid Manufacturing Engineering Center, Shanghai University, Shanghai, China 99 Shangda Road Shanghai 200444, China
[email protected], tony_li@ shu.edu.cn
Abstract. Performance of bone tissue depends on porous scaffold microstructures with specific porosity characteristics that influence the behavior of the ingrown cells. The mechanical properties of porous tissue scaffolds are important for their biomechanical tissue engineering application. In this study, the composite materials powder was developed for the selective laser sintering process, and the parameters of selective laser sintering were optimized. With the
aim of evaluating the influence of porosity on mechanical properties, we have studied the load limits for three specimens of scaffolds which have different porosity. Young’s modulus was computed by determining the slope of the stress - strain curve along the elastic portion of the deformation. In addition, the final element analysis (FEA) module of UG NX4 was used to analyze these scaffolds. The results showed that the bone tissue engineering scaffolds were fabricated by SLS technology have good mechanical properties, which have good potential for tissue engineering applications.
1 Introduction In bone tissue engineering (BTE), 3D scaffolds are essential to guide cell proliferation and to maintain native phenotype in regenerating biologic tissues or organs [1], [2], [3]. These scaffolds give shape to regenerate tissue and temporarily fulfill the structural function of native tissue. In addition to fitting into the anatomical defect, they have possessed sufficient strength and stiffness that will bear in vivo loads so that the scaffolds can function before the growing tissue replaces the gradually degrading scaffolds matrix [4], [5], [6]. Conventional methods for making scaffolds include solvent casting, fiber meshes, phase separation, melt molding and gas foaming [7], [8]. These techniques lack precise control of pore shape, pore geometry and spatial distribution. Some methods also require the use of organic solvents that leave undesirable residues in the finished products, and thus create host reactions due to inflammation or toxicity [9]. The use of rapid prototyping (RP) allows the production of scaffolds with controlled hierarchical structures directly from computer data. Furthermore, the shape of the scaffold can be designed by taking anatomical information of the patient’s target defect (e.g. CT, MRI) to obtain a custom-tailored implant [10].One rapid prototyping method, selective laser sintering, may be advantageous for creating bone tissue engineering K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 146–152, 2007. © Springer-Verlag Berlin Heidelberg 2007
The Mechanical Properties of Bone Tissue Engineering Scaffold Fabricating
147
scaffolds because it provides a cost-effective, efficient method by which to construct scaffolds to match the complex anatomical geometry of bone defect structure. More important, this method which was different from other RP method can directly sinter biocompatible materials. Here, we report the example of β-TCP scaffolds with self-supporting feature fabricated by selective laser sintering. The feasibility of sintering such powder blends and the influence of SLS processing parameters on the sintering quality and resulting microstructure of the sintered specimens were studied. With the aim of evaluating the influence of porosity on mechanical properties, we have studied the load limits for three specimens of scaffolds which have different porosity. Young’s modulus was computed by determining the slope of the stress - strain curve along the elastic portion of the deformation. In addition, the final element analysis (FEA) module of UG NX4 was used to analyze these scaffolds.
2 Materials and Methods 2.1 Preparation of Scaffolds Cylindrical porous scaffolds (20mm diameter, 10mm height), with three-dimensional orthogonal periodic porous architectures, were designed using Unigraphics NX4 3D solid modeling software (UGS PLM Solution, Plano, TX). The design was exported to a Sinterstation machine (HPRS-IIIA, BinHu, Wuhan, China) in STL file format, then was used to construct scaffolds of β-tricalcium phosphate and binding material mixture powder by SLS processing. The sieve sizes (74μm) of mixture material were grade by using the vibratile-sizer. SLS processing of the mixture powder was conducted by 11W laser power and 2400mm/s scanning speed. Scaffolds were fabricated layer by layer using a powder layer thickness of 0.1mm (Fig.1B). After SLS processing was completed, the excess powder surrounding the scaffolds was brushed off and unsintered powder was removed from the scaffold interstices by insertion of 1mm diameter needle. Finally, the green scaffolds were calcined by the high temperature (Fig.1C).
Fig. 1. Pictures of scaffold molds (A) 3D solid modeling designed by UG NX4. (B) Before calcined bionic scaffold fabricated by SLS (Green part). (C) After calcined bionic scaffold.
148
L. Lin et al.
2.2 Compression Testing The mechanical properties of the scaffold specimens were measured using an Instron Uniaxial Testing System (Instron 5542 UK). In this experiment, three specimens were compressed at a cross head speed of 1mm/min. Load and displacement was noted and converted to stress and stain, from which the slope was used to calculate elastic modulus (E). A stress-strain curve was plotted based on the apparent stress σ (MPa) and stain ε (%) value with the initial cross-sectional area A1 (mm2) of each test specimen and the deformation values with initial specimen height H1 (mm), respectively. 2.3 Final Element Analysis (FEA) The three models which have different porosities were meshed by tetrahedral element (10 notes), respectively. We brought 100N of pressure to bear on the top face of scaffolds in this examination. And these were added the material properties which were obtained in the compressing testing. A finite element model for strength analysis of bone scaffolds mold under compression was presented. Characteristics of stress distribution and location are determined according to the model.
3 Results and Discussions 3.1 Optimization of SLS Parameters In order to establish a set of suitable processing parameters for processing thereafter the biocomposite (β-TCP/binding) powder, various specimens were tested (Table 1). Table 1. Specimen groups for β-TCP/binding biocomposite powder Laser power (W) 6 7 8 9 10 11 14 16
Scanning (mm/s)
↑ 1500 2000 2400 ↓
speed
Molding(Y/N)
Strength
Surface quality
N N N N Y Y Y Y
fragile fine fine fine
smooth smooth adust adust
According to the Andrew’s number theory the energy density received by the power in a specimen is directly proportional to the laser power and scanning speed [11]. When the two parameters were matched suitably, a set of bone scaffolds which had good mechanical properties and fine surface quality were obtained. In sintering the β-tricalcium phosphate and binding material, particles that were rapidly scanned by the laser beam would receive free surface energy. Binding material was formatted neck at local contact point occurred. Neck growth would only occur for a short period, creating
The Mechanical Properties of Bone Tissue Engineering Scaffold Fabricating
149
a porous network due to such a formation. For the biocomposite powder, three specimens were obtained using the following parameter settings: scanning speed 1500, 2000 and 2400mm/s; laser power 6, 7, 8, 9, 10, 11, 14, 16 W (see Table 1). Processing β-TCP/binding powder at 6-9W laser power did not sinter the particles, as there was few necking. So this was improved by increasing the laser power to 10W and scanning speed to 2000mm/s, the scaffold was fragile as compared to the other test specimens. When test sintering was done at a scanning speed of 2400mm/s and laser power of 11W, it can get good properties of scaffolds. Test specimens sintered with this parameter gave a more connectivity between the particles and the necking formations were more available. Test sintering were carried out above 11W laser power and 2400mm/s scanning speed, the scaffolds’ surface were adusted obviously. 3.2 Mechanical Properties Compression tests were performed to characterize the mechanical properties of the prepared scaffolds with an Instron Uniaxial Testing System. Fracture toughness, the material’s resistively to crack propagation, is an important parameter to assess the susceptibility of a scaffold to failure. Fig.2A shows the typical stress strain curve from compression testing. Three specimens of each type were tested for mechanical properties. The Fig.2B shows that the compressive strength of the porous TCP ceramics decreases linearly with increasing macropores. According to the Hook’s law, the Young’s modulus (E) was calculated in this test. The three specimens of scaffolds’ Young’s modulus were 15.38MPa, 28.57MPa,
Fig. 2. Porosity and strength behaviors of the porous scaffold (A)Stress-strain curves of different porosity in the β-TCP scaffolds(S1, S2 and S3 were the various types of scaffolds with different porosity). (B)Young’s modulus variation calculated as a function of porosity.
150
L. Lin et al.
48.7MPa, respectively. The porosity and strength behaviors of the porous β-TCP scaffold with pore volume fraction 60.7, 70.8 and 75.8 were illustrated in Fig.2B, where different symbols refer to different macro-porosity, the compressive strength of the porous β-TCP ceramic appears to be sensitive to the pore volume, and the difference in the porosity and strength behaviors became pronounce as the porosity volume decreased. The apparent stiffness of the scaffolds (calculated as effective Young’s modulus) was found to decrease linearly with the porosity. Porosity and interconnectivity were the key determinants of the porous scaffolds. It seems important to characterize the effect of porosity together with the macropore size on the compressive strength not only for a better understanding of the porosity and strength behavior but also to help in design of the porous β-TCP ceramic scaffolds with desirable mechanical property. Although there is no clearly defined criterion in mechanical properties required by bone tissue engineering, it is generally accepted that the scaffolding material could bear the force in cell implantation experiment. The presence of cells and deposited ECM can enhance the scaffold’s stability [12]. In addition, if the scaffold is implanted in vivo, the new lively bony tissue will instead of it. So the bone scaffolds do not have to own high compressive strength as true bone. The specimens are hard enough to handle in a real surgical situation. 3.3 FEA It is important that Finite Element Analysis (FEA) was used in research of the mechanical property. By analyzing the stresses and strains of the numeric models, the optimizing the processing parameters of bone scaffolds were obtained. The three models which were meshed by tetrahedral element (10 notes) were illustrated in Fig.3 (A, B and C). Model A of around 55,361 nodes could be established as a model with sufficient convergence and limited calculation time. Model B was around 54,940 nodes, and Model C was around 53,300 nodes. This corresponded to a coarsening factor of 1.4 and was used for the creation all the meshes. Then the Young’s modulus (E) was inputted into the FEA module of UGNX4. When there were defined load with 100N and added constraints, the distortion of results were showed as Fig.3 (E, F, and G). In calcinations processing, the binding materials were burn off and formed bubbles which could be destroyed scaffolds and created micropores. The micropores couldn’t design in the CAD software. But it was weaken the influence by the properties of material which got in the compression test. In the Fig.3 (D, E and F), the red areas are the large deformation region. It can be observed that the center of the scaffolds were weaker than other regions (Fig.3). Because some pores were collected in this area. According to the results of FEA models, it clearly saw the mechanical property of scaffolds was related with the porosity and the distribution of pores in scaffold. The comparison between the three pictures (D, E and F), the first scaffold which the Young’s modulus is 28.57MPa and the porosity is 70.8 had a good mechanical property. In addition, the results were used to adjust the SLS processing parameters which would obtain a better mechanical property scaffold.
The Mechanical Properties of Bone Tissue Engineering Scaffold Fabricating
151
Fig. 3. The models of scaffolds were meshed via UGNX4 FEA module (A, B and C). Stresses and strains analysis of different scaffolds (D, E and F) (the Young’s modulus (E) was 28.57MPa, 15.38MPa, 48.7MPa, respectively).
As being a mechanical property study of β-TCP scaffold for tissue engineering this study restrict in the result of the potential biological application. The interrelation between bone scaffolds and materials has not been investigated since the simulation of cell attachment onto the material has not been included. However, in this paper the deformation of the scaffolds were calculated to predict the mechanical process favorable for cell ingrowths.
4 Conclusions Selective laser sinter (SLS), a rapid prototyping technology, was investigated and successfully applied in the research to produce 3D scaffolds with enough mechanical properties. Two main parameters of SLS, namely laser power and scanning speed and sintering material were investigated to study its effect on the integrity of the test specimens, which were fabricated for the purpose of bone scaffold. Moreover, this research confirmed the decrease in compressive strength with increased with porosity of β-TCP ceramics. Examination of the mechanical deformation indicated that the porous β-TCP scaffolds stress-strain behavior highly similar to that of a typical porous material undergoing compression. Acknowledgments. The authors would like to acknowledge the support of Shanghai Education Fund (No. 5A281) and Shanghai Academic Excellent Youth Instructor Special Foundation.
152
L. Lin et al.
References 1. Kim, S.-S., et al.: Poly (lactide-co-glycolide)/hydroxyapatite composite scaffolds for bone tissue engineering. Biomaterials 27, 1399–1409 (2006) 2. Tan, K.H., Chua, C.K., Leong, K.F.: Scaffold development using selective laser sintering of polyetheretherketone-hydroxyapatite biocomposite blends. Biomaterials 24, 3115–3123 (2003) 3. Vacanti, J.P., Vacanti, C.A.: The history and scope of tissue engineering, in principles of tissue engineering, 2nd edn. Academic Press, New York (2000) 4. Ho, S.T., Hutmacher, D.W.: A comparison of micro CT with other techniques used in the characterization of scaffolds. Biomaterials 27, 1362–1376 (2000) 5. Griffith, L.G.: Polymeric biomaterials. Acta Mater 48, 263–277 (2000) 6. Buckley, C.T., O’Kelly, K.U.: Regular scaffold fabrication techniques for investigations in tissue engineering. Topics in Bio-Mechanical Engineering, 147–166 (2004) 7. Peter, X.M., Zhang, R.: Synthetic nano-scale fibrous extracellular matrix. J. Biomed. Mater Res. 46(1), 60–72 (1998) 8. Sherwood, J.K., Riley, S.L., Palazzolo, R., Brown, S.C., et al.: A three-dimensional osteochondral composite scaffold for articular cartilage repair. Biomaterials 23(24), 4739–4751 (2002) 9. Yang, S.F., Leong, K.F., Du, Z.H., Chua, C.K.: The design of scaffolds for use in tissue engineering: Part I - Traditional factors. Tissue Eng. 7, 679–690 (2001) 10. Leukers, B., Irsen, S.H., Tille, C.: Hydroxyapatite scaffolds for bone tissue engineering made by 3D printing. Journal of Materials Science: Materials in Medicine 16, 1121–1124 (2005) 11. Nelson, J.C.: Ph.D. Thesis. Selective laser sintering of calcium phosphate materials for orthopedic implants. The University of Texas at Austin. USA (1993) 12. Malda, J., et al.: The effect of PEGT/PBT scaffold architecture on the composition of tissue engineered cartilage. Biomaterials 26, 63–72 (2005)
Informational Structure of Agrobacterium Tumefaciens C58 Genome Zhihua Liu and Xiao Sun State Key Laboratory of Bioelectronics, Southeast University, Nanjing 210096, P.R .China {zhliu,xsun}@seu.edu.cn
Abstract. Base-base correlation (BBC) method, based on information theory, translates a DNA sequence into a 16-dimensional vector. It has proven quite effective in distinguishing various functional regions on one chromosome. In this study, we explore the potential use of distinguishing different chromosomes within one species, with particular emphasis on Agrobacterium tumefaciens strain C58. Our findings show that BBC method could effectively distinguish informational structure of Agrobacterium tumefaciens strain C58 genomes. In conclusion, BBC provides a new methodology in post-genome informatics and its applications could be further explored in the further.
1 Introduction The statistical properties of DNA sequences obtained a substantial amount of scientific attention in the last few years. One of the most important findings in this respect is the relation of 10-11 bp periodicities with DNA supercoiling [1]. Several global statistical properties have been developed to analyze DNA sequence and been found to be related with biological function. The variation of word-frequency within genomes has been linked to functional variation [2]. The variation of dinucleotide relative abundance reflects interspecies differences in process such as DNA modification, replication, and repair [3]. The signature of Alu repeats has been identified as peaks in the correlation function [4]. On an evolutionary scale, more closely related species have more similar word compositions [5] and the dinucleotide biases differ between species [6]. Here we developed a novel sequence feature, named as base-base correlation (BBC), which was inspired from using mutual information function (MIF) to analyze DNA sequence. Compared with MIF, BBC emphasized the information of different base pairs within the range of k. It improved the resolving power and provided a more appropriate description of sequence dissimilarity. A sequence, regardless of its length is kilobases, megabases, or even gigabases, corresponded to a unique 16-dimensional vector. Changes in the values of 16 parameters reflected difference between genome content and length. The procedure was a normalization operation to compare genomes of different scales, which are difficult to obtain a good sequence alignment. In recent study [7], BBC was applied to analyze various functional regions of the human chromosome, including exon, intron, upstream, downstream and intergenic regions. The results showed that BBC assisted in distinguishing various functional regions of genome. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 153–161, 2007. © Springer-Verlag Berlin Heidelberg 2007
154
Z. Liu and X. Sun
In this work, BBC was applied to distinguish different chromosomes of certain species, with particular emphasis on Agrobacterium tumefaciens strain C58. Agrobacterium tumefaciens is a plant pathogen capable of transferring a defined segment of DNA to a host plant, generating a gall tumor. The genome of Agrobacterium tumefaciens strain C58 has an unusual structure consisting of a circular chromosome, a linear chromosome and two plasmids. This ability to transfer and integrate is used for random mutagenesis and has been critical for the development of modern plant genetics and agricultural biotechnology. In 2001, the genome of Agrobacterium tumefaciens C58 was sequenced by two different research groups and two papers about the genome of Agrobacterium tumefaciens C58 were published in Science [8, 9]. NCBI Genome project released this two genome sequences and named Agrobacterium_tumefaciens_C58_Cereon and Agrobacterium_tumefaciens_C58_UWash, respectively.
2 Materials and Methods 2.1 Sequences Two genome projects of Agrobacterium tumefaciens strain C58 used in this study were retrieved from NCBI (http://www.ncbi.nlm.nih.gov). The name, accession number and length for Agrobacterium tumefaciens strain C58 genomes were shown in Table 1. Table 1. The name, accession number and length for Agrobacterium tumefaciens strain C58 genome Strain Agrobacterium tumefaciens C58 Cereon
Agrobacterium tumefaciens C58 UWash
Genome chromosome circular chromosome linear plasmid AT plasmid Ti chromosome circular chromosome linear plasmid AT plasmid Ti
Accession NC_003062 NC_003063 NC_003064 NC_003065 NC_003304 NC_003305 NC_003306 NC_003308
Length (nt) 2,841,581 2,074,782 542,869 214,233 2,841,490 2,075,560 542,780 214,234
2.2 Base-Base Correlation (BBC) DNA sequences can be viewed as symbolic strings composed of the four letters (B1 , B2 , B3 , B4 ) ≡ ( A, C , G , T ) . The probability of finding the base Bi is denoted
by pi (i = 1, 2, 3, 4) . Then BBC is defined as the following: k
Tij (k ) =
∑p l =1
ij (l ) ⋅ log 2 (
pij (l ) pi p j
) i, j ∈ {1, 2, 3, 4}
(1)
Here, pij (l ) means the joint probabilities of bases i and j at a distance of l. Tij (k ) represents the average relevance of the two-base combination with different gaps from 1 to k. It reflects a local feature of two bases with a range of k. Here we take
Informational Structure of Agrobacterium Tumefaciens C58 Genome
155
k=2 in BBC calculation in the present study. For each sequences m, BBC has 16 parameters and constitutes a 16-dimensional vector Vmz ( z = 1, 2, L , 16) . Statistical independence of two bases in a distance l is defined by pij (l ) = pi p j . Thus, deviations from statistical independence is defined by Dij (l ) = pij (l ) − pi p j
(2)
We expand Tij (k ) using a Taylor series in terms of equation 2 k
Tij (k ) =
∑
pij (l ) ⋅ log 2 (
l =1
pij (l ) pi p j
=∑ [D (l ) + p p ]⋅ ln ⎡⎢1 + Dp p(l )⎤⎥ k
ij
)
ij
i
j
⎣⎢
l =1
i
j
⎦⎥
=∑ [D (l ) + p p ]⋅ ⎡⎢⎢ Dp p(l ) − 2Dp (pl ) + L⎤⎥⎥ k
i
j
l =1
=∑ D (l ) + k
ij
l =1
2 ij
ij
ij
()
Dij2 l 2 pi2 p 2j
⎣
i
j
[
+ ο Dij3 (l )
i
j
(3)
⎦
]
This mathematical transformation further increases the calculation speed and solves effectively the problem of 0 ⋅ log 2 0 (i.e. pij (l ) = 0 in equation 1). 2.3 The Distance Matrix
Given two sequences m and n, the distance H mn between two sequences m and n is defined as the following: 16
H mn =
∑ (V
z m
z =1
− Vnz ) 2
m, n = 1, 2, L, N
(4)
Here, Vm and Vn represent the 16-dimensional vectors of sequences m and n. N is the total number of all sequences analyzed. According to equation 4, H mn obviously satisfies the definition of distance: (ⅰ) H mn > 0 for m ≠ n; (ⅱ) H mn = 0; (ⅲ) H mn = H nm (symmetric); (ⅳ) H mn ≤ H mq + H nq (triangle inequality). For N sequences, a real symmetric N × N distance matrix is then obtained. 2.4 Clustering
Accordingly, a real symmetric N × N matrix is used to reflect the distance between N sequences. Then, the clustering trees are constructed using original Neighbor-Joining (NJ) algorithm [10], a note on the NJ algorithm [11], BIONJ algorithm [12] and UPGMA algorithm [13], respectively. The reliability of the branches is assessed by performing 100 resamplings. Bootstrap values are shown on nodes.
156
3
Z. Liu and X. Sun
Results
3.1 GC Content of Agrobacterium Tumefaciens Strain C58 Genome
GC content of Agrobacterium tumefaciens strain C58 genome was shown in Figure 1. GC content values for the corresponding chromosome or plasmid appeared almost equal between Agrobacterium_tumefaciens_C58_Cereon and Agrobacterium_tumefaciens_C58_UWash. In addition, GC content value of chromosome was different from that of plasmid. GC content values appeared relatively large difference between plasmid AT and plasmid Ti. While, GC content values for chromosome circular and chromosome linear showed minor difference. Thereforely, it was very difficult to distinguish different chromosomes of Agrobacterium tumefaciens strain C58 genome only by difference on GC content. 0.6
Agrobacterium_tumefaciens _C58_Cereon
Agrobacterium_tumefaciens _C58_UWash
GC content
0.59
0.58
0.57
0.56
pl
as m
id
Ti
AT pl
as m
id
ea r li n os om e
ch ro m
pl
os om e ch ro m
as m
id
ci rc ul a
r
Ti
AT pl
as m
id
ea r li n os om e
ch ro m
ch ro m
os om e
ci rc ul a
r
0.55
Fig. 1. GC content of Agrobacterium tumefaciens strain C58 genome. Agrobacterium_tumefaciens_C58_Cereon and Agrobacterium_tumefaciens_C58_UWash were indicated by red and blue, respectively
3.2
BBC Curves of Agrobacterium Tumefaciens Strain C58 Genome
For each genome sequence, 16 parameters of BBC were calculated and linked to a continuous curve, which was designated as BBC curve. BBC curve was then represented as a unique feature for a given sequence, providing an intuitionistic and general description for DNA sequence. BBC curves of Agrobacterium tumefaciens strain C58 genome were displayed in Figure 2. Each curve represented a chromosome or plasmid of Agrobacterium tumefaciens strain C58 genome. It was found that BBC curve of the same type of chromosome or plasmid between Agrobacterium tumefaciens strain C58 Cereon and
Informational Structure of Agrobacterium Tumefaciens C58 Genome
157
Agrobacterium tumefaciens strain C58 UWash, tended to cluster together very closely. It was shown that the same color BBC curves bring into coincidence regarding the tendance. On the other hand, it was found that BBC curves of chromosome circular and chromosome linear tended to cluster together, and BBC curves of plasmid AT and plasmid Ti tended to cluster together. An interesting observation was the relatively large difference between plasmid AT and plasmid Ti in BBC values of A---T, C---A, G---A and G---C. To further illustrate the difference in informational structure of Agrobacterium tumefaciens strain C58 genome, the distance matrix was calculated and the clustering tree was constructed by several clustering algorithm. 0.3 chromosome circular chromosome linear plasmid AT plasmid Ti
0.2
BBC Value
0.1
0
-0.1
-0.2
-0.3
-0.4 A---A
A---C
A---G
A---T
C---A
C---C
C---G
C---T
G---A
G---C
G---G
G---T
T---A
T---C
T---G
T---T
Fig. 2. BBC curves of Agrobacterium tumefaciens strain C58 genome. Chromosome circular, chromosome linear, plasmid AT and plasmid Ti were indicated by red, green, blue and magenta, respectively.
3.3 Clustering Tree of Agrobacterium Tumefaciens Strain C58 Genomes
Comparison of four reconstruction methods, it had been found that the four phylograms had the same topology structure. Two major groups (plasmid group and chromosome group) could be seen from these four figures (Figure 3-6). In the first branch, plasmid Ti of Agrobacterium tumefaciens strain C58 UWash and that of Agrobacterium tumefaciens strain C58 Cereon tended to cluster together, with a bootstrap value of 99%. Plasmid AT of Agrobacterium tumefaciens strain C58 UWash and that of Agrobacterium tumefaciens strain C58 Cereon tended to cluster together, with a bootstrap value of 99%. This two groups clustered together and formed a bigger group (plasmid group), with a bootstrap value of 100%. In another branch, chromosome linear of Agrobacterium tumefaciens strain C58 UWash and that of Agrobacterium tumefaciens strain C58 Cereon tended to cluster together, with a bootstrap value of 97%. Chromosome circular of Agrobacterium tumefaciens strain C58 UWash and that of Agrobacterium tumefaciens strain C58 Cereon tended to cluster together, with a bootstrap value of 98%. This two groups clustered together and formed a bigger group (chromosome group), with a bootstrap value of 100%.
158
Z. Liu and X. Sun
Fig. 3. The clustering tree of Agrobacterium tumefaciens strain C58 based on original NJ algorithm. Bootstrap values were shown on nodes
Fig. 4. The clustering tree of Agrobacterium tumefaciens strain C58 based on a note on the NJ algorithm. Bootstrap values were shown on nodes.
Agrobacterium tumefaciens strain C58 has an unusual genome structure consisting of a circular chromosome, a linear chromosome, and two plasmids: the tumorinducing plasmid pTiC58 and a second plasmid pAtC58 [14, 15]. An interesting observation of the study was that the clustering-phylogram based on BBC, whether in terms of NJ algorithm or UPGMA algorithm, could not only distinguish between chromosome and plasmid, but also discriminate two chromosomes (chromosome linear, chromosome circular) and two plasmids (plasmid Ti, plasmid AT), respectively. In addition, the corresponding chromosome or plasmid of Agrobacterium tumefaciens strain C58 Cereon and Agrobacterium tumefaciens strain C58 UWash tended to cluster together.
Informational Structure of Agrobacterium Tumefaciens C58 Genome
159
Fig. 5. The clustering tree of Agrobacterium tumefaciens strain C58 based on BIONJ algorithm. Bootstrap values were shown on nodes.
Fig. 6. The clustering tree of Agrobacterium tumefaciens strain C58 based on UPGMA
algorithm. Bootstrap values were shown on nodes.
4 Discussion The biological origin of genome information being present on a large-scale statistical level is far from being understood. Short-range correlations in DNA sequences have proven informative during recent decades. Starting from the early finding that coding and noncoding sequence segments possess mutual information function with striking differences due to codon usage in the coding regions [16], an ever more detailed look at short-range correlation properties is to be related with biological function, such as the relation of 10-11 bp periodicities with DNA supercoiled structures [1]. BBC had proven quite effective in distinguishing coding and noncoding sequence segments. It could be further used to classify various functional regions on the chromosome, such as exon, intron, upstream, downstream and intergenic regions [7]. Here BBC was
160
Z. Liu and X. Sun
applied to distinguish different types of chromosomes and plasmids of Agrobacterium tumefaciens strain C58 genome, including chromosome circular, chromosome linear, plasmid AT and plasmid Ti. Our main finding supporting this view was that BBC, as a sequence feature, could distinguish not only various functional regions on one chromosome, but also different types of chromosomes and plasmids within one species. Usually, one species has more than one chromosome. It is very difficult to distinguish chromosomes or plasmids by certain property, such as GC content. Multiple sequence alignment is an alternative approach to identify different chromosomes within one species. While the procedure of alignment for whole chromosome sequences appear to be time-consuming, and even impossible. In addition, a good sequence alignment is very difficult to be obtained in the case of large sequence divergence among different chromosomes. Moreover, gaps in the sequences will be ignored in sequence alignment. This procedure will throw away the most ambiguous parts of the alignment, which may be very important to distinguish different chromosomes. In contrast to traditional alignment methods, the advantage of BBC method is low computational complexity and easy to implement. A sequence, regardless of its length is kilobases, megabases, or even gigabases, corresponds to a unique 16-dimensional vector. Changes in the values of 16 parameters reflect difference between genome content and length. Intriguingly, BBC curve provides a fast and intuitionistic tool for sequence comparison analysis. BBC was inspired from using MIF to analyze DNA sequence. Compared with MIF, BBC emphasized the information of different base pairs within the range of k. It improved the resolving power and provided a more appropriate description of sequence dissimilarity.
5 Conclusions BBC method, based on information theory, translates sequence data into a 16dimensional vector. In recent work, BBC method has proven quite effective in distinguishing various functional regions on one chromosome. In this study, we explore the potential use of distinguishing different chromosomes within one species. Our findings show that BBC method is capable of revealing the identity of different chromosomes and plasmids of Agrobacterium tumefaciens strain C58 genome. In conclusion, BBC provides a new methodology in post-genome informatics and its applications can be further explored in the further. Acknowledgments. This work is supported by the National High-Tech Research and Development Program (863 Program) of China (No. 2002AA231071), the Natural Science Foundation of China (No. 60671018; 60121101).
References 1. Schieg, P., Herzel, H.: Periodicities of 10-11bp as indicators of the supercoiled state of genomic DNA. Journal of molecular biology 343(4), 891–901 (2004) 2. Nikolaou, C., Almirantis, Y.: Word preference in the genomic text and genome evolution: different modes of n-tuplet usage in coding and noncoding sequences. Journal of molecular evolution 61(1), 23–35 (2005)
Informational Structure of Agrobacterium Tumefaciens C58 Genome
161
3. Karlin, S., Burge, C.: Dinucleotide relative abundance extremes: a genomic signature. Trends Genet. 11(7), 283–290 (1995) 4. Holste, D., Grosse, I., Beirer, S., Schieg, P., Herzel, H.: Repeats and correlations in human DNA sequences. Physical review 67(6 Pt 1), 061913 (2003) 5. Bush, E.C., Lahn, B.T.: The evolution of word composition in metazoan promoter sequence. PLoS computational biology 2(11), e150 (2006) 6. Gentles, A.J., Karlin, S.: Genome-scale compositional comparisons in eukaryotes. Genome research 11(4), 540–546 (2001) 7. Liu, Z.H., Jiao, D., Sun, X.: Classifying genomic sequences by sequence feature analysis. Genomics, proteomics & bioinformatics 3(4), 201–205 (2005) 8. Goodner, B., Hinkle, G., Gattung, S., Miller, N., Blanchard, M., Qurollo, B., Goldman, B.S., Cao, Y., Askenazi, M., Halling, C., et al.: Genome sequence of the plant pathogen and biotechnology agent Agrobacterium tumefaciens C58. Science 294(5550), 2323–2328 (2001) 9. Wood, D.W., Setubal, J.C., Kaul, R., Monks, D.E., Kitajima, J.P., Okura, V.K., Zhou, Y., Chen, L., Wood, G.E., Almeida Jr., N.F., et al.: The genome of the natural genetic engineer Agrobacterium tumefaciens C58. Science 294(5550), 2317–2323 (2001) 10. Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular biology and evolution 4(4), 406–425 (1987) 11. Studier, J.A., Keppler, K.J.: A note on the neighbor-joining algorithm of Saitou and Nei. Molecular biology and evolution 5(6), 729–731 (1988) 12. Gascuel, O.: BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Molecular biology and evolution 14(7), 685–695 (1997) 13. Highton, R.: The relationship between the number of loci and the statistical support for the topology of UPGMA trees obtained from genetic distance data. Molecular phylogenetics and evolution 2(4), 337–343 (1993) 14. Allardet-Servent, A., Michaux-Charachon, S., Jumas-Bilak, E., Karayan, L., Ramuz, M.: Presence of one linear and one circular chromosome in the Agrobacterium tumefaciens C58 genome. Journal of bacteriology 175(24), 7869–7874 (1993) 15. Goodner, B.W., Markelz, B.P., Flanagan, M.C., Crowell Jr., C.B., Racette, J.L., Schilling, B.A., Halfon, L.M., Mellors, J.S., Grabowski, G.: Combined genetic and physical map of the complex genome of Agrobacterium tumefaciens. Journal of bacteriology 181(17), 5160–5166 (1999) 16. Grosse, I., Herzel, H., Buldyrev, S.V., Stanley, H.E.: Species independence of mutual information in coding and noncoding DNA. Physical review 61(5 Pt B), 5624–5629 (2000)
Feature Extraction for Cancer Classification Using Kernel-Based Methods Shutao Li and Chen Liao College of Electrical and Information Engineering, Hunan University, 410082 Changsha, China
[email protected]
Abstract. In this paper, kernel-based feature extraction method from gene expression data is proposed for cancer classification. The performances of four kernel algorithms, namely, kernel Fisher discriminant analysis (KFDA), kernel principal component analysis (KPCA), kernel partial least squares (KPLS), and kernel independent component analysis (KICA), are compared on three benchmarked datasets: breast cancer, leukemia and colon cancer. Experimental results show that the proposed kernel-based feature extraction methods work well for three benchmark gene dataset. Overall, the KPLS and KFDA show the best performance, and KPCA and KICA follow them.
1 Introduction Gene expression studies on DNA microarray data provide unprecedented chances for disease prediction and classification. However, gene datasets usually include a huge number of genes, and many of them may be irrelevant to the analysis. This poses a great difficulty to many classifiers. By performing dimensionality reduction, feature extraction is thus often critical in improving both the accuracy and speed of the prediction systems. A good feature extraction method should extract most informative features and construct a new subset with lower dimension. In recent years, several useful kernel-based learning machines, e.g. kernel fisher discriminant analysis (KFDA) [1], kernel principal component analysis (KPCA) [2] etc., have been proposed. These methods have shown practical relevance for classification, regression problem and in unsupervised learning. Well applications of kernel-based algorithms have been applied for a number of fields, such as in the context of optical pattern and object recognition, text categorization, time-series prediction, and so on [3]. The purpose of this study is to propose the kernel-based feature extraction method for cancer classification, as well as evaluate and compare the performance of four kernel-based methods: kernel Fisher discriminant analysis (KFDA) [1], kernel principal component analysis (KPCA) [2], kernel partial least squares (KPLS) [4], and kernel independent component analysis (KICA) [5]. First, the genes are preprocessed by the method of T-Test to filter irrelevant and noisy genes. Then, these kernel-based methods are used to extract highly informative and discriminative features. Finally, the new training set, with the extracted features, is input to a support vector machine (SVM) for classification. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 162–171, 2007. © Springer-Verlag Berlin Heidelberg 2007
Feature Extraction for Cancer Classification Using Kernel-Based Methods
163
2 Kernel Methods 2.1 Kernel Fisher Discriminant Analysis (KFDA) KFDA is the method using the model defined by a linear combination of some specified kernel bases as N
y = ∑ ai K (ωi , x)
(1)
i =1
Here K is the kernel function, and ai is the coefficient vector for the ith kernel base. An
ωi − x ] is typically used as the kernel 2σ 2 2
isotropic Gaussian function K (ωi , x) = exp[−
function. The location of the kernel base ωi is fixed to one of the training samples and the number of kernel bases N equals to the number of training samples. Let k ( x) = ( K (ω1 , x),..., K (ω N , x))T be the vector corresponding to the feature vector x.
Then equation (3) can be written as y = AT k ( x ) , where AT = [a1 ,..., aN ] is the coefficient matrix. The optimal coefficient matrix A is obtained by solving the eigen-equation
∑B
(K )
T A = ∑ W AΛ ( A ∑ W A = I ) . (K )
(K )
Here, Λ is a diagonal matrix of eigenvalues, and I denotes the unit matrix. The matrics
∑W
(K )
and
∑B
(K )
are the within-class covariance matrix and the between-class
covariance matrix of the kernel bases vectors k(x). The dimension of the new feature vector y is limited to min (K-1, N). However, the setting is ill-posed as a result of estimating the N × L coefficients of the matrix A from N samples. So some regularization technique needs to be introduced. One of the simplest methods is to simply add a multiple of the identity matrix to
∑W
(K )
as ~
∑ W( K ) = ∑ W
(K)
+β I
It makes the problem numerically more stable due to the within-class covariance matrix ~
∑ W( K )
becomes positive definite as for large β . This is roughly equivalent to adding
independent noise to each of the kernel bases [1]. 2.2 Kernel Principal Component Analysis (KPCA)
PCA can be expressed as the diagonalization of an n-sample estimate of the covariance n matrix Cˆ = 1 ∑φ ( xi )φ ( xi )T , which represents a transformation of the original data to the n
i =1
new coordinates as defined by the orthogonal eigenvectors V. These eigenvectors V ˆ . This problem is (and the corresponding eigenvalue λ ) are obtained from λ V = CV
164
S. Li and C. Liao
equivalent to nλα = Kα , where α is the column vector with coefficients n
α1 ,..., α n such that V = ∑αiφ ( xi ) , and K is the kernel matrix. Normalizing the solution i =1
v k corresponding to the non-zero eigenvalue λ%k = nλ k of the matrix K translates into the condition λk (α k ⋅ α k ) = 1 . Finally, the projection of φ ( x) onto the eigenvector V k can be computed as [2]: n
β ( x ) k := (V k ⋅ φ ( x)) = ∑ α ik K ( xi , x ) . i =1
2.3 Kernel Partial Least Squares (KPLS) Let φ be the n × m ' matrix of input samples in F, where m ' is the dimensionality of F. Denote its ith row by the vector φ ( xi )T . Let φ ' be the n × m ' deflated dataset and Y ' the n × 1 deflated class label. The rule of deflation is
φ ' = φ − t (t T φ )
(2)
Y ' = Y − t (t T Y )
where t is a score vector (component) which is obtained as follows. Let w and c be the weight vectors. The process starts with random initialization of the Y-score u and then iterates the following steps until convergence: (1) w = XTu/(uTu); (2) ||w|| → 1; (3) t = Xw; (4)c = YTt/tTt;(5) u = Yc/(cTc); repeat steps 1.-5. The process is iterated Fac times. As a result, the deflated dataset can be obtained from the original dataset and the PLS component, while the deflated class labels can be obtained from the original class labels and the PLS component. Denote the obtained sequences of t’s and u’s by the n × 1 vectors t1 , t2 ,...t Fac and u1 , u2 ,...uFac , respectively. Moreover, let T = [t1 , t2 ,...tFac ] and U = [u1 , u2 ,...uFac ] . The “kernel trick” can be utilized and results in K = φφ T , where K stands for the n × n kernel matrix: K (i, j ) = k ( xi , x j ) and k is the kernel function. K can now be directly used in the deflation instead of φ , as K ' = ( I n − tt T ) K ( I n − tt T )
(3)
Here, K ' is the deflated kernel matrix and I n is the n-dimensional identity matrix. Now Eq.(2) takes the place of Eq.(1). So the deflated kernel matrix is obtained from the original kernel matrix and the PLS component. In kernel PLS, the assumption that the variables of X have zero mean in linear PLS should also be held. One can center the mapped data in the feature space F as:
1 1 K = ( I n − l n ln T ) K ( I n − l n ln T ) n n
Feature Extraction for Cancer Classification Using Kernel-Based Methods
165
Here, l n is the n × 1 vector with all elements equal to one. Given a set of test samples
{ zi }i =1 n
(where zi ∈
m
), its projection onto the feature space is D p = KtU (T T KU ) −1
where D p = [d1 , d 2 ,..., d nt ]T is a nt × p matrix, with the p KPLS components as its columns and the nt test samples in the reduced-dimensional space as its rows, K t is the nt × n kernel matrix defined on the test set such that K t (i, j ) = K ( zi , x j ) , T T KU is an upper triangular matrix and thus invertible. The centered kernel matrix K t defined on the test set can be calculated as [4]
1 1 K t = ( K t − l n lnT K )( I n − l n lnT ) n n 2.4 Kernel Independent Component Analysis (KICA)
KICA produces a set of nonlinear features of the input data by performing ICA in the kernel-induced feature space F. The input data X is first whitened in F by using the −
1
whitening matrix WPφ = (Λφ ) 2 (V φ )T , where Λφ and V φ contain the eigenvalues and 1 n eigenvectors of the covariance matrix Cˆ = ∑ i =1φ ( xi )φ ( xi )T . The whitened data is n then obtained as: X Wφ = (WPφ )T φ ( X ) = (Λφ ) −1α T K , where K is the kernel matrix, and α is the eigenvector matrix of K. After the whitening transform, we iterate the ICA learning iteration algorithm: U Iφ = WIφ X Wφ
ΔWWφ = [ I + ( I −
2 1+ e
−U Iφ
)(U Iφ )T ]WIφ
WˆIφ = WIφ + ρΔWIφ → WIφ
until WIφ converges. Here ρ is the learning rate. On testing, the new feature representation of a test pattern y can be computed as:
s = WIφ (Λφ ) −1α T K ( X , y ) where K ( X , y ) = [k ( x1 , y ), k ( x2 , y ),..., k ( xn , y )]T [5].
3 Proposed Method Denote the number of genes (features) and the number of samples (observations) in the gene expression dataset by M and N respectively. The whole data set can also be represented by the matrix:
166
S. Li and C. Liao x12 ⎡ x11 ⎢x x 21 22 X=⎢ ⎢ M M ⎢ x x ⎣ M1 M 2
L x1N ⎤ L x2 N ⎥⎥ O M ⎥ ⎥ L xMN ⎦
where xij is the measurement of the expression level of gene i in sample j. Let xj = (x1j, x2j, ..., xMj) denote the ith sample of X, and yj the corresponding class label (e.g., tumor type or clinical outcome). In the following, we assume that there are only two classes (positive class and negative class) in the sample. The proposed method is as follows: Step 1. Preprocessing using T-test: Large dimensionality increases the complexity and computation load, so the dataset is preprocessed by T-test at first. For each gene i, we compute the mean μi+ (respectively, μi− ) and standard deviation δ i+ (respectively, δ i− ) for the positive (respectively, negative) samples. Then a score T ( xi ) can be obtained as: μi+ − μi− T ( xi ) =
(δ i+ )2 (δ i− ) 2 + n+ n−
where n+ and n− are the numbers of samples in the positive and negative classes respectively. Genes are ranked according to their T, and the top p genes are selected to form a reduced dataset. Step 2. Kernel-based methods, as reviewed in section 2, are used to further extract highly informative and discriminative features to form a new training set.
Fig. 1. Schematic diagram of the whole process
Step 3. Training and classification using the SVM: The SVM is an efficient binary classification algorithm. It computes the hyperplane that maximizes the margin between the training examples and the class boundary in a high-dimensional
Feature Extraction for Cancer Classification Using Kernel-Based Methods
167
kernel-induced feature space. Due to the nonlinear mapping between the input space and the feature space, the linear discriminant function constructed by SVM in the feature space corresponds to a nonlinear function in the original input space. Step 4. Finally, the new training dataset with the extracted features is used to train a SVM, this classifier can be used for predictions on the test set. The schematic diagram of the whole process is shown in Fig.1.
4 Experimental Results 4.1 Setup In this section, we evaluate the performance of the proposed feature extraction method on three benchmark datasets: (1) Breast cancer dataset: It contains 7,129 genes and 38 samples. 18 of these samples are ER+ (estrogen receptor) while the remaining 20 are ER- [6]. (2) Leukemia dataset: It contains 7,129 genes and 72 samples. 47 of these samples are of Acute Myeloid Leukemia (AML) and the remaining 25 are of Acute Lymphoblastic Leukemia (ALL) [7]. (3) Colon cancer dataset: It contains 2,000 genes and 62 samples. 22 of these samples are of normal colon tissues and the remaining 40 are of tumor tissues [8]. The gaussian kernel
k ( x, y ) = exp(− x − y / γ ) 2
where γ is the width parameter, is used in the four kernel methods. The adjustable parameters in the T-test and kernel-based methods are listed in the following: 1. 2. 3. 4. 5.
p associated with the T-test method; Width parameter γ in the Gaussian kernel; Number of score vectors (Fac) used in KPLS; Number of principal components (K) used in KPCA; Regularization constant (mu) added to the diagonal of the within-class scatter matrix used in KFDA.
The linear kernel is used in the SVM. Values of the soft-margin parameter (C) used on the different datasets are shown in Table 1. Table 1. Values of the soft-margin parameter (C) used in the SVM
KPLS, KPCA and KFDA KICA
breast cancer 1 1
leukemia 10 1
colon cancer 100 1
Because of the small dataset size, leave-one-out (LOO) cross-validation is used to obtain the testing accuracy. Both feature extraction and classification are put together in each LOO iteration, i.e., they are performed on the training subset and then the performance is obtained on the left-out example using the extracted features.
168
S. Li and C. Liao
4.2 Results Here, we compare the performance of the four kernel-based procedures: KPLS, KPCA, KFDA and KICA. The testing accuracies on the three benchmarked datasets obtained using different parameter settings are shown in Table 2-5, respectively. Overall, KPLS and KFDA show the best classification performance on all three datasets. Both of them achieve the best accuracy of 100% on the breast cancer and leukemia datasets. On the colon cancer dataset, both attain an accuracy of 91.9%, which is the highest in our experiment. On the other hand, KPCA attains an accuracy of 100% on the breast cancer dataset and 98.6% on the leukemia dataset, but only 88.7% on the colon cancer dataset. KICA performs less well in comparison with the other three. It attains an accuracy of 100% on the breast cancer dataset, but only 97.2% on the leukemia dataset and 88.7% on the colon cancer dataset. On the breast cancer dataset, both KPLS and KPCA attain 100% testing accuracy with only 2 features, while KFDA uses 3 features and KICA uses 7 features to achieve 100%. On the leukemia dataset, KFDA attains the best accuracy with only 3 features while KPLS uses 5 features. KPCA and KICA can not obtain 100%. On colon cancer dataset, KFDA attains the best accuracy 91.9% with only 4 features while KPLS uses 10 features, and KPCA as well as KICA can not get 91.9%. In conclusion, KPLS and KFDA outperform the other two in number of features to get the best accuracy. As can be seen in the tables, the prediction accuracy is highly dependent on the choice of the parameters. Obviously, KPLS is influenced by the parameter p. Also, the effect of Fac cannot be neglected on all three datasets. In comparison, γ has a weaker effect than p and Fac. Table 2. Testing accuracies (%) using T-test and KPLS
γ 100
200
300
100
200
300
Fac 2 5 10 2 5 10 2 5 10 2 5 10 2 5 10 2 5 10
p
50
90
breast cancer 100.0 100.0 100.0 100.0 100.0 100.0 100.0 100.0 100.0 100.0 97.4 97.4 100.0 97.4 97.4 100.0 97.4 97.4
p
100
500
leukemia 97.2 98.6 93.1 97.2 98.6 93.1 95.8 98.6 93.1 97.2 100.0 100.0 98.6 100.0 98.6 98.6 100.0 97.2
p
50
90
colon cancer 88.7 85.5 82.3 87.1 85.8 79.0 87.1 85.5 79.0 90.3 88.7 91.9 90.3 90.3 91.9 90.3 90.3 90.3
Feature Extraction for Cancer Classification Using Kernel-Based Methods Table 3. Testing accuracies (%) using T-test and KPCA
γ 100
200
300
100
200
300
K 2 5 10 2 5 10 2 5 10 2 5 10 2 5 10 2 5 10
p
50
90
breast cancer 100.0 100.0 100.0 52.6 52.6 52.6 52.6 52.6 52.6 100.0 100.0 100.0 94.7 94.7 92.1 52.6 55.3 52.6
p
leukemia 94.4 94.4 95.8 73.6 100 84.7 86.1 65.3 65.3 65.3 98.6 98.6 97.2 97.2 98.6 500 98.6 95.8 98.6 97.2
p
colon cancer 88.7 88.7 87.1 88.7 50 88.7 88.7 88.7 88.7 88.7 88.7 88.7 88.7 88.7 88.7 90 88.7 88.7 88.7 88.7
Table 4. Testing accuracies (%) using T-test and KFDA (with mu=10-m)
γ 5
10
15
5
10
15
m 3 4 5 3 4 5 3 4 5 3 4 5 3 4 5 3 4 5
p
50
90
breast cancer 100.0 97.3 94.7 100.0 97.4 97.4 100.0 100.0 97.4 97.4 97.4 97.4 100.0 97.4 97.4 100.0 100.0 97.4
p
leukemia 95.8 94.4 94.4 95.8 100 95.8 94.4 97.2 95.8 94.4 100.0 100.0 98.6 98.6 500 100.0 100.0 97.2 100.0 100.0
p
colon cancer 87.1 88.7 82.3 62.9 50 72.6 88.7 64.5 62.9 87.1 90.3 91.9 91.9 62.9 90 90.3 90.3 64.5 59.7 90.3
169
170
S. Li and C. Liao Table 5. Testing accuracies (%) using T-test and KICA
p 5
6
7
8
9
10
γ 100 200 300 100 200 300 100 200 300 100 200 300 100 200 300 100 200 300
breast cancer 97.4 97.4 97.4 97.4 97.4 97.4 100.0 100.0 100.0 97.4 97.4 97.4 97.4 97.4 97.4 100.0 100.0 100.0
leukemia 97.2 97.2 97.2 95.8 95.8 95.8 97.2 97.2 97.2 95.8 95.8 95.8 95.8 95.8 95.8 95.8 95.8 95.8
colon cancer 88.7 88.7 88.7 88.7 88.7 88.7 88.7 88.7 88.7 83.9 83.9 83.9 80.7 80.7 80.7 82.3 82.3 82.3
For KPCA, γ has a strong impact on the breast cancer and leukemia datasets. For example, when γ =100, and p=50, the testing accuracy is 100% on breast cancer. However, when γ changes to 200 (with the same value of p), the accuracy drops to only 52.6%. For KFDA, p has the most obvious impact on all three datasets. mu and γ also have obvious effects on the testing accuracy result. For KICA, p also has the strongest influence, while the effect of γ is less obvious. Due to the slow speed of the iterative procedure, we have to use very small values of p so that the data do not become so large. Otherwise, the running time will be very long and the iterative procedure may also have numerical problems.
5 Conclusions In this paper, we propose kernel-based feature extraction method for cancer classification and discuss the performances of four kernel methods, KPLS, KPCA, KFDA and KICA. Experiments are performed on the breast cancer, leukemia and colon cancer datasets. We also compare them with other methods reported in the literature. The proposed method shows superior classification performance on all three datasets, and thus proves to be reliable for feature extraction.
Feature Extraction for Cancer Classification Using Kernel-Based Methods
171
Acknowledgements. This paper is supported by the Program for New Century Excellent Talents in University and the Excellent Youth Foundation of Hunan Province (06JJ1010).
References 1. Kurita, T., Taguchi, T.: A Modification of Kernel-based Fisher Discriminant Analysis for Face Detection. In: Proceedings of International Conference on Automatic Face and Gesture Recognition, Washington DC, pp. 300–305 (2002) 2. Schölkopf, B., Smola, A., Müller, K.-R.: Kernel Principal Component Analysis. In: Schölkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods - Support Vector Learning, pp. 327–352. MIT Press, Cambridge, MA (1999) 3. Müller, K., Mika, S., Rätsch, G., Tsuda, K., Schölkopf, B.: An Introduction to Kernel-Based Learning Algorithms. IEEE Trans. on Neural Networks, 180–201 (2001) 4. Rosipal, R., Trejo, L.J., Matthews, B.: Kernel PLS-SVC for Linear and Nonlinear Classification. In: Proceedings of the Twentieth International Conference on Machine Learning, Washington DC, pp. 640–647 (2003) 5. Bach, F.R., Jordan, M.I.: Kernel Independent Component Analysis. J. Machine Learning Research 3 (2002) 6. West, M., Blanchette, C., Dressman, H., Huang, E., Ishida, S., Spang, R., Zuzan, H., Marks, J.R., Nevins, J.R.: Predicting the Clinical Status of Human Breast Cancer Using Gene Expression Profiles. Proceedings of the National Academy of Science 98, 11462–11467 (2001) 7. Golub, T., Slonim, D., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J., Coller, H., Loh, M., Downing, J., Caligiuri, M., Bloomfield, C., Lander, E.: Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring. Science 28, 531–537 (1999) 8. Alon, U., Barkai, N., Notterman, D., Gish, K., Ybarra, S., Mack, D., Levine, A.: Broad Patterns of Gene Expression Revealed by Clustering Analysis of Tumor and Normal Colon Tissues Probed by Oligonucleotide Arrays. Proceedings of the National Academy of Science 96, 6745–6750 (1999)
A New Hybrid Approach to Predict Subcellular Localization by Incorporating Protein Evolutionary Conservation Information ShaoWu Zhang1, YunLong Zhang2, JunHui Li, and HuiFeng Yang1, YongMei Cheng1, and GuoPing Zhou3 1
College of Automation, Northwestern Polytechnical University, Xi’an, 710072, China
[email protected] 2 Department of Computer, First Aeronautical Institute of Air Force, Henan, 464000, China
[email protected] 3 Department of Biological Chemistry and Molecular Pharmacology, Harvard Medical School, Boston, Massachusetts 02115, USA
[email protected]
Abstract. The rapidly increasing number of sequence entering into the genome databank has created the need for fully automated methods to analyze them. Knowing the cellular location of a protein is a key step towards understanding its function. The development in statistical prediction of protein attributes generally consists of two cores: one is to construct a training dataset and the other is to formulate a predictive algorithm. The latter can be further separated into two subcores: one is how to give a mathematical expression to effectively represent a protein and the other is how to find a powerful algorithm to accurately perform the prediction. Here, an improved evolutionary conservation algorithm was proposed to calculate per residue conservation score. Then, each protein can be represented as a feature vector created with multi-scale energy (MSE). In addition, the protein can be represented as other feature vectors based on amino acid composition (AAC), weighted auto-correlation function and Moment descriptor methods. Finally, a novel hybrid approach was developed by fusing the four kinds of feature classifiers through a product rule system to predict 12 subcellular locations. Compared with existing methods, this new approach provides better predictive performance. High success accuracies were obtained in both jackknife cross-validation test and independent dataset test, suggesting that introducing protein evolutionary information and the concept of fusing multifeatures classifiers are quite promising, and might also hold a great potential as a useful vehicle for the other areas of molecular biology.
1 Introduction One of the fundamental goals in cell biology and proteomics is to identify the functions of proteins in the cellular environment. Determination of protein subcellular location purely using experimental approaches is both time-consuming and expensive. Particularly, the number of new protein sequences yielded by the high-throughput K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 172–179, 2007. © Springer-Verlag Berlin Heidelberg 2007
A New Hybrid Approach to Predict Subcellular Localization
173
sequencing technology in the postgenomic era has increased explosively. Facing such an avalanche of new protein sequences, it is both challenging and indispensable to develop an automated method for fast and accurately annotating the subcellular attributes of uncharacterized proteins. The knowledge thus obtained can help us timely utilize these newly found protein sequences for both basic research and drug discovery [1, 2]. During the last decade, many theoretical and computational methods were developed in an attempt to predict subcellular localization of protein [3-13]. However, all these prediction methods were established basically based on a single classifier, or based on the statistical approach and amino acid physical-chemical character to represent protein sequences. Obviously, the prediction quality would be considerably limited by using only one single classifier, statistical feature and physical-chemical feature information to deal with piled-up complicated protein sequences with extreme variation in both sequence order and length. To further improve the predictive quality, a logical and key step would be to find an effective way to represent protein information and a powerful classifier. Here, by proposing an improved method to calculate protein evolutionary conservation information, the samples of proteins were formulated by hybridizing the multisource information derived from evolutionary conservation scores, weighted auto-correlation functions [14], moment descriptors [12] and multi-scale energy [13]. Based on the hybridization representation, a novel ensemble classifier was formed by fusing many individual classifiers through a product rule system [15]. The success rates obtained by hybridizing the multi-source information of proteins and the fusion classifier in predicting protein subcellular location were significantly improved.
2 Methods 2.1 Residue Conservation The residue ranking function assigns a score to each residue, and according to which they can be sorted in the order of the presumably decreasing evolutionary pressure they experience. Out of many methods proposed in the literature [16-18], Lichtarge research group’s hybrid methods [19](real-valued evolutionary trace method and zoom method) are the two robust methods, that rank the evolutionary importance of residues in a protein family which is based on the column variation in multiple sequence alignments (MSAs) and evolutionary information extracted from the underlying phylogenetic trees. However, the hybrid methods treat the gaps in the multisequences alignment as the 21st amino acid. So, we propose an improved algorithm to estimate the residue evolutionary conservation. The processes of calculation are as follows. Firstly, the initial similarity sequences were created by using three iterations of PsiBlast[20], with the 0.001 E-value cutoff, on the UniProt [21] database of proteins. The PsiBlast resulting sets were aligned by a standard alignment method such as ClustalW 1.8 [22]. So, the multiple sequence alignments (MSA) were obtained. Secondly, an MSA is divided into sub-alignments (that is, n groups) that correspond to nodes in the tree [19]. This subdivision of an MSA into smaller alignments
174
S. Zhang et al.
reflects the tree topology, and therefore the evolutionary variation information within it. Then, the evolutionary score for a residue belong to column i in an MSA is given by the following equation. Ri = 1 +
N−1
∑w n=1
20
n
∑w
f α log ∑ α
group(g)[−
node(n)
g=1
g
i
g 20 f iα
+ fi,ggap]
=1
(1)
where wnode (n) , wgroup (g ) are weights assigned to a node n and a group g, respectively. ⎧1 wnode (n) = ⎨ ⎩0
⎧1 wgroup ( g ) = ⎨ ⎩0
if n on the path to the query protein otherwise
if g on the path to the query protein otherwise
(2)
(3)
f iαg is the frequency of amino acid of type α ( α represents one of the 20 standard amino acids, that is, A, C, D, E, F, G, H, I, K, L, M, N, P, Q, R, S, T, V, W, Y) within a sub-alignment corresponding to group g at the level in which the sequence similarity tree is divided into n groups. Namely, the nodes (labeled by n) are assumed to be numbered in the order of increasing distance from the root, and each one of them has associated with it a division of the tree into n groups (subtrees). N is the number of alignment sequences.
f i ,ggap is the number of non-standard amino acids (such as“−”,
“X”, “Z”, “B”) of g group in the alignment position i, divided by the number of g group alignment sequences. Further details about division of tree nodes and groups can be found in literature [19]. 2.2 Multi-scale Energy [13] Through residue conservation scores calculating, the protein sequence of English letters can be translated into a numerical sequence. The numerical sequence can be considered as digital signal. Projecting the signal onto a set of wavelet basis functions with various scales, the fine-scale and large-scale conservation information of a protein can be simultaneously investigated. Here, the wavelet basis function used is symlet wavelet [23]. Consequently, the protein can be characterized as the following multi-scale energy (MSE) feature vector. MSE = [d1 ,L, d j ,L d m , am ]
(4)
Here, m is the coarsest scale of decomposition, dj is the root mean square energy of the wavelet detail coefficients in the corresponding j-th scale, and am is the root mean square energy of the wavelet approximation coefficients in the scale m. The energy factors dj and am are defined as: N j −1
dj =
1 Nj
∑[u (n)]
2
j
n =0
am =
N m −1 1 Nm
∑[v n =0
2 m (n)]
j = 1,2, L , m
(5)
A New Hybrid Approach to Predict Subcellular Localization
175
Here, Nj is the number of the wavelet detail coefficients, Nm is the number of the wavelet approximation coefficients, uj(n) is the n-th detail coefficient in the corresponding j-th scale, and vm(n) is the n-th approximation coefficient in the scale m. For the protein sequence with length L, m equals INT(log 2L). Combing with amino acid composition (AAC)which is consisted the 20-D components of the amino acid frequencies, the protein can be represented by the following (20+m+1)-D vector.
[
x = f1 , f 2 , L , fα , L , f 20 , d1 , d 2 , L , d j , L , d m , am
]T
(6)
Here fα ( α = 1,2, L ,20 ) is the occurrence frequencies of 20 amino acid in the protein concerned, arranged alphabetically according to their signal letter codes. Conveniently, the feature set based on the residue evolutionary conservation and MSE approach can be wrote as EMSE. 2.3 Weighted Auto-correlation Functions [14]
In order to calculate the weighted auto-correlation functions, we replace each residue in the primary sequence by its amino acid index PARJ860101, which can be downloaded from http://www.genome.ad.jp/dbget. Consequently, the replacement results in a numerical sequence h1 , h2 ,L, hl ,L, hL . The weighted auto-correlation functions rj are defined as: rj =
w L− j ∑ hl hl + j , L − j l =1
j = 1,2,L, λ
(7)
Here hl is the amino acid index for the l-th residue, w is weighted factor and L is the length of protein sequence. Combing with amino acid composition which is consisted the 20-D components of the amino acid frequencies, the protein can be represented by the following (20+ λ )D vector.
[
x = f1 , f 2 , L , fα , L , f 20 , r1 , r2 , L , r j , L , rλ
]T
(8)
Conveniently, the feature set based on the weighted auto-correlation functions approach can be wrote as PARJ. 2.4 Moment Descriptor [12] According to the literature [12], the protein can be represented by the following vector: X = [ f1 , f 2 , L , f α , L f 20 , μ1 , μ 2 , L μ i , L μ 20 , ν1 , ν 2 , L , ν i L , ν 20 ]
(9)
Here,
μi =
1 L ∑ xij • j L j =1
νi =
1 L ( xij • j − μi )2 ∑ L j =1
(10)
176
S. Zhang et al.
if amino acid α i appears at position j in the sequence ⎧1 xij = ⎨ ⎩0 if amino acid α i does not appear at position j in the sequence
(11)
Conveniently, the feature set based on the Moment descriptors approach can be wrote as MD.
3 Result and Discusion 3.1 Results with Different Feature Extraction Methods The training dataset and independent dataset taken from Chou [4] were used to validate the current method. The prediction quality was examined by the standard testing procedure in statistics, which are the jackknife (JACK) and independent dataset tests (INDE). Of these two, the jackknife test is regarded as the most objective and effective [24-25]. The results of four feature extraction methods based on support vector machine (SVM) [26] and “one-versus-one” classifying policy [14] are shown in table 1. Table 1. Results (in percentage) of four feature extraction methods with SVM and “one-versusone” classification strategy
Chloroplast Cytoplasm Cytoskeleton Endoplasmic reticulum Extracellular Golgi apparat Lysosome Mitochondrial Nuclear Peroxisomal Plasma membrane Vacuoles Overall accuracy
AAC JACK IND 59.1 60.6 85.9 83.9 41.2 94.7 32.7 70.8 69.6 84.2 16 0.50 56.8 87.1 26.5 12.9 80.8 76.4 22.2 43.5 92.7 96.3 33.3 77.1 80
EMSE JACK IND 67.9 59.6 88.4 87.6 44.1 100 38.8 84.9 67.9 83.1 20 25 51.4 96.8 43.4 20.9 87.1 80.4 14.8 39.1 92.7 96.5 25 79.5 82.8
PARJ JACK IND 59.1 65.1 89 88.8 47.1 100 36.7 70.8 73.2 88.4 24 25 54.1 96.8 41 17.8 84.1 77.5 22.2 47.8 96 99 33.3 80.5 83.3
MD JACK IND 66.4 77.1 90.5 89.1 50 94.7 34.7 69.8 67.9 87.4 16 50 51.4 87.1 38.6 14.1 81.9 83.1 7.4 30.4 94.3 97.1 20.8 79.4 83.5
Table 1 shows that protein evolutionary conservation information can be used to predict subcellular location. The overall accuracies of EMSE, PARJ and MD are almost equal, but they are all higher than that of AAC in jackknife and independent tests. For EMSE, the predictive accuracy is critically dependent on the input selection of sequences and also on the breadth and the depth of the associated sequence similarity tree. That is, how many initial similarity sequences were selected, and how to prune these sequences to form multiple alignment sequences? If the optimal two parameters were selected, we can obtain better results. Considering the computer power, the cutoff of initial similarity sequences was defined as 250, and we did not prune the initial similarity sequences. These results indicate the performance of predictive system can be improved by using different feature extraction methods. EMSE, PARJ and
A New Hybrid Approach to Predict Subcellular Localization
177
MD are effective to represent protein sequence and good robust for predictiing subcellular localization.
3.2
Comparison with Other Prediction Methods
The performance of the hybrid method developed in this study was compared with existing methods such as Pan’s [6], Gao’s [9] and Xia’s [10,11], which were also developed from the same dataset. The results demonstrated that overall prediction accuracies of our hybrid method are higher than that of other four methods both in the Jackknife and independent tests. For example, the overall accuracy of the hybrid method is 8.1%, 4.7% greater than that of Xia’s method [10] in the Jackknife and independent tests respectively. Table 2. Overall accuracy (in percentage) obtained by different methods Method
Jackknife test
Independent test
Pan et al [6] Gao et al [9] Xia et al [10] Xia et al [11] Hybrid (AAC+ EMSE+PARJ+MD)
67.7 69.6 73.6 72.6 81.7
73.9 79.8 74.8 85.1
4 Conclusions A new kind of protein evolutionary feature extraction method and a hybrid approach to fuse the four feature classifiers were proposed in this study. The results show that using residue evolutionary conservation and multi-scale energy to represent protein can better reflect protein evolutionary information and predict the subcellular locations. Weighted auto-correlation function and Moment descriptor methods can optimally reflect the sequence order effect. It is demonstrated that the novel hybrid approach by fusing four feature classifiers is a very intriguing and promising avenue.
Acknowledgements. This paper was supported in part by the National Natural Science Foundation of China (No. 60372085 and 60634030), the Technological Innovation Foundation of Northwestern Polytechnical University (No. KC02), the Science Technology Research and Development Program of Shaanxi Province (No. 2006k04-G14).
References 1. Chou, K.C.: Review: Structural bioinformatics and its impact to biomedical science. Curr. Med. Chem. 11, 2105–2134 (2004) 2. Lubec, G., Afjehi-Sadat, L., Yang, J.W., John, J.P.: Searching for hypothetical proteins: theory and practice based upon original data and literature. Prog. Neurobiol. 77, 90–127 (2005)
178
S. Zhang et al.
3. Chou, K.C., Elrod, D.W.: Protein subcellular location prediction. Protein Engineering 12, 107–118 (1999) 4. Chou, K.C.: Prediction of protein subcellular locations by incorporating quasi-sequenceorder effect. Biochem. Biophys. Research Commun. 278, 477–483 (2000) 5. Chou, K.C.: Prediction of protein cellular attributes using pseudo-amino acid composition. Proteins: Structure, Function, and Genetics 43, 246–255 (2001) 6. Pan, Y.X., Zhang, Z.Z., Guo, Z.M., Feng, G.Y., Huang, Z.D., He, L.: Application of pseudo amino acid composition for predicting protein subcellular location: stochastic signal processing approach. J. Protein Chem. 22, 395–402 (2003) 7. Zhou, G.P., Doctor, K.: Subcellular location prediction of apoptosis proteins. PROTEINS: Struct. Funct. Genet. 50, 44–48 (2003) 8. Park, K.J., Kanehisa, M.: Prediction of protein subcellular locations by support vector machines using compositions of amino acid and amino acid pairs. Bioinformatics 19, 1656– 1663 (2003) 9. Gao, Y., Shao, S., Xiao, X., Ding, Y., Huang, Y., Huang, Z., Chou, K.C.: Using pseudo amino acid composition to predict protein subcellular location: Approached with Lyapunov index, Bessel function, and Chebyshev filter. Amino Acid 28, 373–376 (2005) 10. Xia, X., Shao, S., Ding, Y., Huang, Z., Huang, Y., Chou, K.C.: Using complexity measure factor to predict protein subcellular location. Amino Acid 28, 57–81 (2005) 11. Xia, X., Shao, S., Ding, Y., Huang, Z., Huang, Y., Chou, K.C.: Using cellular automata images and pseudo amino acid composition to predict protein subcellular location. Amino Acid 30, 49–54 (2006) 12. Shi, J.Y., Zhang, S.W., Liang, Y., Pan, Q.: Prediction of Protein Subcellular Localizations Using Moment Descriptors and Support Vector Machine. In: PRIB: 2006, Hong Kong,China, pp. 105–114. Springer, Heidelberg (2006) 13. Shi, J.Y., Zhang, S.W., Pan, Q., Cheng, Y.M., Xie, J.: SVM-based Method for Subcellular Localization of Protein Using Multi-Scale Energy and Pseudo Amino Acid Composition. Amino Acid (2007) DOI 10.1007/s00726-006-0475-y 14. Zhang, S.W., Pan, Q., Zhang, H.C., Shao, Z.C., Shi, J.Y.: Prediction Protein Homooligomer Types by Pesudo Amino Acid Composition: Approached with an Improved Feature Extraction and Naive Bayes Feature Fusion. Amino Acid 30, 461–468 (2006) 15. Kittler, J., Hatef, M., Duin, R.P.W., Matas, J.: On Combining Classifiers. IEEE Trans. Pattern Analysis and Machine Intelligence 20, 226–239 (1998) 16. Lichtarge, O., Bourne, H., Cohen, F.: An evolutionary trace method defines binding surfaces common to protein families. J. Mol. Biol. 257, 342–358 (1996) 17. Valdar, W.S.: Scoring residue conservation. Proteins 48, 227–241 (2002) 18. Soyer, O.S., Goldstein, R.A.: Predicting functional sites in proteins: Site-specific evolutionary models and their application to neurotransmitter transporters. J. Mol. Biol. 339, 227–242 (2004) 19. Mihalek, I., Reš, I., Lichtarge, O.: A Family of Evolution–Entropy Hybrid Methods for Ranking Protein Residues by Importance. J. Mol. Biol. 336, 1265–1282 (2004) 20. Altschul, S., Madden, T., Schffer, A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.: Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Research 25, 3389–3402 (1997) 21. UniProt (2005), http://www.expasy.org/ 22. Thompson, J., Higgins, D., Gibson, T.: Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22, 4673–4680 (1994)
A New Hybrid Approach to Predict Subcellular Localization
179
23. Pittner, S., Kamarthi, S.V.: Feature extraction from wavelet coeffi-cients for pattern recognition tasks. IEEE Trans. Pattern Anal. Mach. Intell. 21, 83–88 (1999) 24. Zhou, G.P.: An intriguing controversy over protein structural class prediction. J. Protein Chem. 17, 729–738 (1998) 25. Zhou, G.P., Assa-Munt, N.: Some insights into protein structural class prediction. Proteins: Structure, Function, and Genetics 44, 57–59 (2001) 26. Vapnik, V.: Statistical Learning Theory. Wiley, New York (1998)
Support Vector Machine for Prediction of DNA-Binding Domains in Protein-DNA Complexes Jiansheng Wu, Hongtao Wu, Hongde Liu, Haoyan Zhou, and Xiao Sun* State Key Laboratory of Bioelectronics Southeast University, Nanjing 210096, China
[email protected],
[email protected]
Abstract. In this study, we present a classifier which takes an amino acid sequence as input and predicts potential DNA-binding domains with support vector machines (SVMs). We got amino acid sequences with known DNAbinding domains from the Protein Data Bank (PDB), and SVM models were designed integrating with four normalized sequence features(the side chain pKa value, hydrophobicity index , molecular mass of the amino acid and the number of isolated electron pairs) and a normalized feature on evolutionary information of amino acid sequences. The results show that DNA-binding domains can be predicted at 74.28% accuracy, 68.39% sensitivity and 79.76% specificity, in addition , at 0.822 ROC AUC value and 0.549 Pearson’s correlation coefficient.
1 Introduction Essential functions are performed by many proteins through interactions with nucleic acid molecules. For instance, transcription factors binding to specific cis-acting elements in the promoters result in regulation of gene expression[1]. Therefore, it is important for understanding a serial of biological processes to identification of the amino acid residues binding DNA or RNA. It is much helpful to understand the mechanisms of protein–nucleic acid interactions by analyzing structural data. The information provided from analyzing structural data has been used to predict DNAbinding residues in solved protein structures from amino acid sequence data, which have rapid increasement from many organisms [2,3,4,5,6]. In the past, artificial neural networks was been constructed coding with sequence information and residue solvent accessibility for prediction of DNA-binding residues, and got the performance which is 40.3% sensitivity and 81.8% specificity [2]. Evolutionary information, that is a position-specific scoring matrix (PSSM), was been shown to improve the predictive performance to 68.2% sensitivity and 66.0% specificity [5]. Recently, support vector machines (SVMs) combining with three simple sequence features was for the prediction of DNA and RNA-binding residues ,and the performance was at 70.31% accuracy,69.40% sensitivity,70.47% specificity and 0.7542 ROC AUC value [6]. As we known, protein–nucleic acid interactions are indeed that nucleic acid interact with some specified domains of proteins ,not just residues. It is actually more important to predict DNA-binding domains than DNA-binding residues. But till *
Corresponding author.
K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 180–187, 2007. © Springer-Verlag Berlin Heidelberg 2007
Support Vector Machine for Prediction of DNA-Binding Domains
181
now, no work have been done to predict nucleic acid -binding domains. In the present study , we developed a support vector machine based algorithm to predict the DNA-binding domains and got significantly high performance. We show that our SVM models can predict DNA-binding domains at 74.28% accuracy, 68.39% sensitivity and 79.76% specificity, in addition , at 0.822 ROC AUC value and 0.549 Pearson’s correlation coefficient.
2 Materials and Methods 2.1 Data Set PDNA-62, an amino acid sequence dataset, was utilized to construct SVM models for predicting DNA-binding domains. The PDNA-62 dataset was from 62 structure files of typical protein–DNA complexes and had less than 25% identity among the sequences [2,5,6].A segment of residues was appointed as a binding domain if it existed one or more amino acid residues in which any atoms had the distance less than a cutoff of 3.5 Å from any atoms of the DNA molecule in the complex [2, 5,6]. All the other segments of residues were designated as non-binding domains. we developed a Perl program which input a set of structure files and output a result file of amino acid sequences in which each segment of residues were labeled as a binding or non-binding domain according to the above cutoff scale. The PDNA-62 dataset contains 3667 DNA-binding domains and 3966 non-binding domains. 2.2 Feature of DNA-Binding Domains As in the previous study [6], the length of each domain was assigned as 11 in this study. The sum of (n-10) domains were extracted from an amino acid sequence with n residues. A domain that was DNA-binding was labeled with 1 (positive), or -1 (negative) was labeled if the target domain was non-binding. Each residue among every domain was coded with four biochemical features, where three were described in preference [6](the side chain pKa value, hydrophobicity index , molecular mass of the amino acid) and another new feature (the number of isolated electron pairs) was presented in this study. The three features described in preference [6] were normalized to get that the average is 0 and the standard deviation is 1 by the following standard logistic functions [7]:
Sα(i ) =
σα= P
( Pα(i ) − Pα)
σα
(1)
P
20 ⎛ 2 0 ∑ Pα ( i ) 2 − ⎜ i=1 ⎝ 400
20
∑
i=1
⎞ Pα ( i ) ⎟ ⎠
2
(2)
where S is normalized property values, α is the index of the property and i stands for the amino acid. P is the property value, and σPα are the average and the standard deviation of property α.
182
J. Wu et al. Table 1. The number of isolated electron pairs of each amino acid
Amino acid Isolated electron pairs Amino acid Isolated electron pairs
ALA
CYS
ASP
GLU
PHE
GLY
HIS
ILE
LYS
LEU
0
1
2
2
0
0
2
0
1
0
MET
ASN
PRO
GLN
ARG
SER
THR
VAL
TRP
TYR
1
2
1
2
3
1
1
0
1
1
The number of isolated electron pairs is related to the potential for hydrogen bond , which is the main force for DNA-protein binding, by residue in protein-DNA complex. The list of the sum of isolated electron pairs of each kind of amino acid are provided in table 1. In this work, PSI-BLAST program was utilized to get multiple sequence alignment profiles. We firstly downloaded the updated non-redundant (NR) protein sequence database (ftp://ftp.ncbi.nlm.nih.gov/blast/db/). Position-specific score matrices (PSSMs) were obtained using PSI-BLAST with three rounds and a cutoff E-value of 0.001 against the filtered NR database through masking out low-complexity regions and coiled coil segments. The PSSMs elements were scaled to 0–1 range by the standard logistic function [8]:
f ( x) =
1 1 + exp( x)
(3)
For a domain with 11 residues, the input vector consists of 264 values, including 44 biochemical feature values and 220 PSSMs values. 2.3 Support Vector Machine The SVM, introduced by Vapnik [9], is a learning algorithm for two- or multi-class classification problems and is known for its good performance. The basic principle of SVM is: for a given data set xi Rn (i = 1,... N) with corresponding labels yi (yi = +1 or -1, representing the two classes to be classified), SVM gives a decision function (classifier):
f(x) = sgn(
N
∑
i=1
yα i iK ( x, xi ) + b )
(4)
where αi are the coefficients to be learned and K is a kernel function. Parameters αi are trained through maximizing function : N
1 N ai − ∑ ai a j yi y j K ( xi , x j ) ∑ 2 i , j =1 i =1 N
where subject to 0≤ai≤C(i=1,…N) and
∑a i=1
i
yi = 0 .
(5)
Support Vector Machine for Prediction of DNA-Binding Domains
183
For this study, libsvm (http://www.csie.ntu.edu.tw/~cjlin/libsvm) was used for data training and classifying[10].To ensure that the parameter estimation and model generation of SVM are independent of the test data, a 5-fold cross-validation approach was used to evaluate the classifier performance. The original data set were randomly divided into five parts, then alternately use one subset for testing and the other four sets for training in each of the five iterative steps. We used different kernel functions(linear function, polynomial function and radial basis function) and different values for libsvm parameters to optimize the prediction accuracy in our experiments. The best results were obtained by using the radial basis function kernel with C = 1 and γ=0.009. 2.4 Measurement of Algorithms Performance The predictions for the test data instances are compared with the corresponding class labels (binding or non-binding) to evaluate the classifiers. The overall accuracy, sensitivity , specificity for assessment of the prediction system are defined as
TP + TN TP + TN + FP + FN
(6)
Sensitivity=
TP TP+FN
(7)
Specificity=
TN TN+FP
(8)
Accuracy =
, ,
where TP TN FP and FN are the number of true positives, true negatives, false positives and false negatives respectively. To give a better comparison and balance of sensitivity and specificity of the models , the net prediction [11]is defined as
Net Prediction=
Sensitivity +Specificity 2
(9)
The algorithms performance in this study is also evaluated by receive operating characteristic curve (ROC curve). ROC curve is a useful technique for organizing classifiers and visualizing their performance[11]. ROC graphs are two-dimensional graphs in which true positive rates (sensitivity) is plotted on the Y axis and false positive rate (1- specificity) is plotted on the X axis. Random guessing would generate identical false positive and true positive rates on average. Therefore, the diagonal (y = x) in the ROC plot is the performance of random guessing. The ROC curves move towards the upper left corner, indicating rising accuracy of performance. The area under the ROC curve (Area under curve, AUC) can be used to characterize the performance of a classifier for siRNA sequences. The AUC value ranges from 0.5 to 1, and a rising AUC value indicates higher accuracy of performance.
184
J. Wu et al.
Pearson’s correlation coefficient (r value) based on the classifiers’ output values and the labels (1 or -1) were also applied to evaluate algorithms performance. The higher r value indicates the better algorithms performance [12].
3 Results and Discussion The performance of our SVM classifiers in 5-fold cross validations were shown in the classifier named features 1 of table 2. The results showed that our classifier named features 1 for DNA-binding domains achieves 74.28% overall accuracy (SD=0.87)with 68.39% sensitivity(SD=0.39) ,70.47% specificity( SD=1.89) and 74.07% net prediction(SD=0.97)(table 2). Table 2. Performance of difference features by SVM for prediction of DNA binding residues in proteins Classifier Features 1 a Features 2 b
Accuracy±SD c (%) 74.28±0.87 64.95±1.10
Sensitivity±SD (%) 68.39±0.39 60.39±2.18
Specificity±SD (%) 79.76±1.89 69.16±1.57
Net prediction d ±SD(%) 74.07±0.97 64.77±1.14
Features 1: including the side chain pKa value, hydrophobicity index , molecular mass of the amino acid , the number of isolated electron pairs and PSSMs; Features 2: considering the same feature (the side chain pKa value, hydrophobicity index , molecular mass of the amino acids) as preference [6]; SD: Standard deviation of five iteratives’ performances in 5-fold cross-validation; Net prediction: the average of sensitivity and specificity; The ROC curve our classifier named features 1 was shown in Figure 1. The AUC value is 0.822 and the Pearson’s correlation coefficient is 0.549 of our classifier named features 1 for prediction of DNA-binding domains ,and both of them were shown in table 3. These AUC values are significantly higher than that of random guessing (0.5). The algorithm output has significant correlation with the sample labels (1 or -1) (p<0.01, table 3). Table 3. Comparison of predictive performance of SVM with difference features on ROC AUC and Correlation coefficient Classifier Features 1 a Features 2 b
ROC AUC c 0.822 0.711
Correlation coefficient 0.549** d 0.368**
Features 1: including the side chain pKa value, hydrophobicity index , molecular mass of the amino acid , the number of isolated electron pairs and PSSMs; Features 2: considering the same feature (the side chain pKa value, hydrophobicity index , molecular mass of the amino acids) in preference [6]; ROC AUC: area under curve of receive operating characteristic curve (ROC curve) ; ** : p<0.01,significant;
Support Vector Machine for Prediction of DNA-Binding Domains
185
Our SVM classifier (named Features 1)for DNA-binding domains combining with more normalized features (the side chain pKa value, hydrophobicity index , molecular mass of the amino acid , the number of isolated electron pairs and PSSMs) appears to be better than the SVM classifier (named Features 2),considering as the same features in preference [6], in the same dataset (PDNA-62). Accuracy and net prediction of our SVM classifier(named Features 1) are 74.28% and74.07%, whereas 64.95% and 64.77% for the SVM classifier (named Features 2) (Table 2). In addition, the AUC values and the Pearson correlation coefficient of our SVM classifier(named Features 1) are 0.822 and 0.549 which are obviously higher than that of the other classifier (named Features 2), 0.711 and 0.368 (Table 3). Analysis of structural data has provided valuable information about the mechanisms of protein–nucleic acid interactions. Many algorithms that predict DNA binding residues directly from amino acid sequence data have been published recently [2,3,4,5,6].BindN predicted potential DNA-binding residues relying on support vector machines with three sequence features, including the side chain pKa value, hydrophobicity index and molecular mass of an amino acid, and got the performance of 69.40% sensitivity and 70.47% specificity[6]. Meanwhile, protein–nucleic acid interactions are actually that nucleic acid interact with some specified domains of proteins ,not just residues. Therefore, it is actually more important to predict DNAbinding domains than DNA-binding residues. Thus, in this paper, we put forward that predicting the DNA-binding domains would help us to further understand the mechanisms of how protein and nucleic acid interact. We developed a support vector machine based algorithm to predict the DNA-binding domains and got significantly high performance. At the atomic level, hydrogen bonds are the main interactions between amino acid residues and nucleotide bases in the protein–nucleic acid complex [13,14]. The 1.0
Sensitivity
0.8
0.6
0.4
Source of the Curve 0.2
Features 1 Features 2 Reference Line
0.0 0.0
0.2
0.4
0.6
0.8
1.0
1 - Specificity
Fig. 1. ROC curves for prediction of DNA-binding residues by SVMs with difference features
186
J. Wu et al.
number of isolated electron pairs of a domain is much related to the potential for its ability of binding to nucleic acids. We believe that this feature, the number of isolated electron pairs of amino acids, gave great contribution to the significant performance of our classifier. Here we performed a SVM based algorithm to utilize evolutionary information of amino acid sequences in terms of their position specific scoring matrices (PSSMs) for a prediction of DNA-binding domains. When these residues among a domain are conserved, it is likely to cause by a specified purpose, for example, biological function. The prediction of nucleic acid binding residues was significantly improved by the use of PSSMs by compare with predictions based on informations of amino acid sequence and its environment cited in many studies [5]. The results also suggest that position-specific score matrices (PSSMs) had obvious contribution to the great achievement of our classifier to predict DNA-binding domains in proteins. One main problem in utilizing PSSM-derived prediction is time-consuming because of PSIBLAST iterations alignments against large sequence databases.
4 Conclusion In this study, we have presented a SVM-based approach for prediction of DNA binding domains based on amino acid sequence data and evolutionary information of amino acid sequences. The overall accuracy, net prediction reached 74.28% and 74.07% respectively. Meanwhile, the classifier’ s AUC value achieved 0.822 and the Pearson’s correlation coefficient is 0.549 for prediction of DNA –binding domains . We have believed that the prediction results would provide useful clues on how protein and nucleic acid interact. In the future, work will be performed to further improve the prediction performance by adding more features for the input encoding and exploring the contribution ratio of each feature. In addition, the current classifiers used a fixed cutoff distance (3.5 s) to discriminate binding ones from non-binding ones. Different cutoff distances and window lengths will be taken to construct a list of SVM models to predict DNA -binding domains . Acknowledgments. Foundation item: National Natural Science Foundation (No. 60671018 No. 60121101).
;
References 1. Ptashne, M.: Regulation of transcription: from lambda to eukaryotes. Trends Biochem. Sci. 30, 275–279 (2005) 2. Ahmad, S., Gromiha, M.M., Sarai, A.: Analysis and prediction of DNA-binding proteins and their binding residues based on composition, sequence and structural information. Bioinformatics 20, 477–486 (2004) 3. Jones, S., Shanahan, H.P., Berman, H.M., Thornton, J.M.: Using electrostatic potentials to predict DNA-binding sites on DNA-binding proteins. Nucleic Acids Res. 31, 7189–7198 (2003)
Support Vector Machine for Prediction of DNA-Binding Domains
187
4. Tsuchiya, Y., Kinoshita, K., Nakamura, H.: PreDs: a server for predicting dsDNA-binding site on protein molecular surfaces. Bioinformatics 21, 1721–1723 (2005) 5. Ahmad, S., Sarai, A.: PSSM-based prediction of DNA binding sites in proteins. BMC Bioinformatics 6, 33 (2005) 6. Wang, L., Brown, S.J.: BindN: a web-based tool for efficient prediction of DNA and RNA binding sites in amino acid sequences. Nucleic Acids Res. 34, 243–248 (2006) 7. Venkatarajan, M.S., Braun, W.: New quantitative descriptors of amino acids based on multidimensional scaling of a large number of physical-chemical properties. J. Mol. Modeling 7, 445–453 (2001) 8. Wang, Y., Xue, Z., Xu, J.: Better Prediction of the Location of -Turns in Proteins With Support Vector Machine. PROTEINS: Structure, Function, and Bioinformatics 65, 49–54 (2006) 9. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, Heidelberg (1995) 10. Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines (Version 2.3) (2001), http://www.csie.ntu.edu.tw/~cjlin/papers/ libsvm.pdf 11. Egan, J.P.: Signal Detection Theory and ROC Analysis. Series in Cognitition and Perception. Academic Press, New York (1975) 12. Sætrom, P., Snøve, O.J.: A comparison of siRNA efficacy predictors. Biochem. Biophys. Res. Commun. 321(1), 247–253 (2004) 13. Jones, S., Daley, D.T.A., Luscombe, N.M., Berman, H.M., Thornton, J.M.: Protein-RNA interactions: a structural analysis. Nucleic Acids Res. 29, 943–954 (2001) 14. Luscombe, N.M., Laskowski, R.A., Thornton, J.M.: Amino acid-base interactions: a threedimensional analysis of protein-DNA interactions at an atomic level. Nucleic Acids Res. 29, 2860–2874 (2001)
Feature Extraction for Mass Spectrometry Data Yihui Liu School of Computer Science and Information Technology, Shandong Institute of Light Industry, Jinan, Shandong, China, 250353
[email protected]
Abstract. Mass spectrometry is being used to generate protein profiles from human serum, and proteomic data obtained from mass spectrometry have attracted great interest for the detection of early-stage cancer. However, high dimensional mass spectrometry data cause considerable challenges. In this paper a set of wavelet detail coefficients at different levels is used to characterize the localized changes of mass spectrometry data and reduce dimensionality of mass spectra. The experiments are performed on high resolution ovarian dataset. A highly competitive accuracy compared to the best performance of other kinds of classification models is achieved.
1 Introduction Mass spectrometry is being used to generate protein profiles from human serum, and proteomic data obtained from mass spectrometry have attracted great interest for the detection of early-stage cancer. Surface enhanced laser desorption/ionization time-offlight mass spectrometry (SELDI-TOF-MS) in combination with advanced data mining algorithms, is used to detect protein patterns associated with diseases [1,2,3,4,5]. As a kind of MS-based protein Chip technology, SELDI-TOF-MS has been successfully used to detect several disease-associated proteins in complex biological specimens such as serum [6,7,8]. The researchers [9] employ principle component analysis (PCA) for dimensionality reduction and linear discriminant analysis (LDA) coupled with a nearest centroid classifier [10] for classification. In [11], the researchers compare two feature extraction algorithms together with several classification approaches on a MALDI TOF acquired data. The T-statistic was used to rank features in terms of their relevance. Support vector machines (SVM), random forests, linear/quadratic discriminant analysis (LDA/QDA), knearest neighbors, and bagged/boosted decision trees were subsequently used to classify the data. More recently, in [12], both the GA approach and the nearest shrunken centroid approach have been found inferior to the boosting based feature selection approach. The researcher [13] examines the performance of the nearest centroid classifier coupled with the following feature selection algorithms. Student-t test, Kolmogorov-Smirnov test, and the P-test are univariate statistics used for filter-based feature ranking. Sequential forward selection and a modified version of sequential backward selection are also tested. Embedded approaches included K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 188–196, 2007. © Springer-Verlag Berlin Heidelberg 2007
Feature Extraction for Mass Spectrometry Data
189
shrunken nearest centroid and a novel version of boosting based feature selection. In addition, several dimensionality reduction approaches are also tested. Yu et al. [14] develop a novel method for dimensionality reduction and test on a published ovarian high-resolution SELDI-TOF dataset. They use a four-step strategy for data preprocessing based on: (1) binning, (2) Kolmogorov–Smirnov test, (3) restriction of coefficient of variation and (4) wavelet analysis. They use approximation coefficients. They indicated that “For the high-resolution ovarian data, the vector of detail coefficients contains almost no information for the healthy, since SVMs identify all the data as cancers”. They concluded the detail coefficients do not work on high-resolution mass spectrometry data using their four-step strategy method, and instead of using approximation coefficients in their research. However it is wavelet detail coefficients that characterize the localized change of mass spectrometry data and approximation coefficients only compress mass spectra. In our research we perform multi-level wavelet analysis on high dimensional mass spectrometry data. A vector of detail coefficients in wavelet subspace is extracted to characterize the localized changes of mass spectrometry data and reduce dimensionality. Finally wavelet features are input into SVM classifier to distinguish the diagnostic classes.
2 Wavelet Analysis For one dimensional wavelet analysis, a signal can be represented as a sum of wavelets at different time shifts and scales (frequencies) using discrete wavelet analysis (DWT). The DWT is capable of extracting the features of transient signals by separating signal components in both time and frequency. According to DWT, a timevarying function (signal) f (t ) ∈ L2 ( R) can be expressed in terms of φ (t ) and ψ (t ) as follows:
f (t ) = ∑ c 0 (k )φ (t − k ) + ∑ ∑ d j k j =1
k
= ∑ c j 0 (k )2 k
− j0 2 φ (2 − j 0 t
−j (k )2 2 ψ (2 − j t
− k)
−j
− k ) + ∑ ∑ d j (k )2 2 ψ (2 − j t − k ) k j= j0
where φ (t ),ψ (t ), c 0 , and d j represent the scaling function, wavelet function, scaling coefficients at scale 0, and wavelet detailed coefficient at scale j , respectively. The variable k is the translation coefficient for the localization of a signal for time. The scales denote the different (high to low) frequency bands. The variable symbol j0 is scale number selected. The wavelet filter-banks approach was developed by Mallat [15]. The wavelet analysis involves two compounds: approximations and details. For one dimensional wavelet decomposition, starting from signal, the first step produces two sets of coefficients: approximation coefficients (scaling coefficients) c1 , and detail coefficients (wavelet coefficients) d1 . These coefficients are computed by convolving signal with the low-pass filter for approximation, and with the high-pass filter for detail. The
190
Y. Liu
convolved coefficients are downsampled by keeping the even indexed elements. Then the approximation coefficients c1 are split into two parts by using the same algorithm and are replaced by c 2 and d 2 , and so on. This decomposition process is repeated until the required level is reached. c j +1 (k ) = ∑ h(m − 2k )c j (m) m
d j +1 (k ) = ∑ h1 (m − 2k )c j (m) m
where h(m − 2k ) and h1 (m − 2k ) are the low-pass filters and high-pass filters. c j and d j are approximation and detail coefficients at j level decomposition. Fig.1 shows wavelet decomposition tree at 5 levels. The mass spectrometry data is actually composed of five separate exponentials at different time. The transient change occurs in the five derivatives. The presence of noise, which is after all a fairly common situation in mass spectrometry data processing, makes identification of transient or localized changes more complicated. If the first levels of the decomposition can be used to eliminate a large part of the noise, the localized features are more significant at deeper levels in the decomposition. In our study detail coefficients at 3rd, 4th, and 5th level are employed to characterize the localized changes of mass spectra.
3 Support Vector Machine (SVM) The SVMs originate from the idea of the structural risk minimization developed by Vapnik [16]. SVMs are an effective algorithm to find the maximal margin hyperplane to separate two classes of patterns. Most methods for training a classifier (e.g., Bayesian, neural networks, and RBF) are based on minimizing the training error, i.e., empirical risk, while SVMs aim to minimize an upper bound on the expected generalization error, called structural risk minimization. SVM is thought as a linear algorithm in a high-dimensional feature space (dot product space) nonlinearly corresponding to input space. A separating hyperplane with maximum margin is constructed in a highdimensional feature space and a nonlinear decision boundary in input space corresponds to the separating hyperplane. Using a kernel function, it is possible to compute the separating hyperplane directly in input space [17]. The maximal margin hyperplane, which is defined only by the support vectors, may give the best separation between the classes. The support vectors can be regarded as selected representatives out of the training wavelet features, and are most critical for the separation of the two classes. In this study radial basis functions (RBF) K ( xi , x j ) = e
− xi − x j
2
/ r1
is used as kernel
function, where r1 is a strictly positive constant and we set its value to 1. Apparently the linear kernel is less complex than the polynomial and the RBF kernels. The RBF kernel usually has better boundary response as it allows for extrapolation, and most high-dimensional data sets can be approximated by Gaussian-like distributions similar to those used by RBF networks [18].
Feature Extraction for Mass Spectrometry Data
191
Fig. 1. Wavelet decomposition tree of mass spectrometry data and detail at 1st level. Symbol s represents mass spectrometry data; ai , d i represent approximation coefficients and detail coef-
ficients at different levels respectively, where i = 1,2,3,4,5 . It is shown that the detail at 1st level contains “small changes” or “noise” hidden in mass spectra.
4 Experiments and Results In this study we use classification accuracy, sensitivity, specificity, Positive Predictive Value (PPV), Negative Predictive Value (NPV) and Balanced Correct Rate (BACC) TP ; Specificity is defined to evaluate the performance. Sensitivity is defined as TP + FN TP TN ; Positive Predictive Value (PPV) is defined as ; Negative Preas TP + FP TN + FP TN dictive Value (NPV) is defined as ; Accuracy is defined as TN + FN TP + TN . Where TP, TN , FP, and FN stand for the number of true posiTP + TN + FP + FN tive (cancer), true negative (control), false positive and false negative samples.
192
Y. Liu
Balanced Correct Rate (BACC) is defined as
1 TP TN ( + ) , which is the 2 TP + FN TN + FP
average of sensitivity and specificity. Experiments are performed on the raw ovarian high-resolution SELDI-TOF dataset, which compose of 95 control samples and 121 cancer samples, and the dimensionality of the original feature space is 368750. They are provided by National Cancer Institute (http://home.ccr.cancer.gov/ncifdaproteomics/ppatterns.asp). • Preprocessing mass spectrometry data Resampling mass spectrometry data homogenizes the mass/charge (M/Z) vector in order to compare different spectra under the same reference and at the same resolution. In high resolution dataset, high resolution spectrometry data contains redundant information. By resampling the signal can be decimated into a more manageable M/Z vector, preserving the information content of the spectra. Resampling mass spectrometry data select a new M/Z vector and also applies an antialias filter that prevents high frequency noise from folding into lower frequencies[19]. We resample the mass spectrometry data to 15000 M/Z points between 710 and 11900. Because mass spectra has high dimensionality and a lot of the information corresponds to the mass/charge (M/Z) vector that do not show any key changes during the experiment. Then we filter out mass spectrometry data with 60% variance over time to keep the significant mass/charge (M/Z) vector. The dimensionality reduces to 6000 after filtering.
Fig. 2. Wavelet features of high resolution ovarian mass spectrometry data. This Figure shows wavelet detail coefficients at 3rd level, 4th level and 5th level.
Feature Extraction for Mass Spectrometry Data
193
• The performance of SVM Classifier We use Daubechies wavelet of order 7 (db7) in wavelet decomposition of mass spectrometry data and the boundary values are symmetrically padded. Multilevel discrete wavelet transform (DWT) is performed on mass spectrometry data. Fig.2 shows detail coefficients at 3rd level, 4th level and 5th level. The dimensionality of wavelet features is shown in Table 1. The red color represents the cancer tissue and the blue one represents the control tissue. The purpose of detail coefficients is to detect a transient feature in one of a mass spectrometry signal's derivatives based on multilevel wavelets decomposition. Detail coefficients determine the position of the change, the type of the change (a transient change in which derivative) and the amplitude of the change, using the compactness and finite energy characteristic of wavelet function. In our study we use K fold cross validation experiments. K fold cross validation randomly generates indices, which contain equal (or approximately equal) proportions of the integers 1 through K that define a partition of the N observations into K disjoint subsets. In K fold cross validation, K-1 folds are used for training and the last fold is used for evaluation. This process is repeated K times, leaving one different fold for evaluation each time. We evaluate the classification performance based on detail coefficients at 3rd level, 4th level and 5th level decomposition respectively. For wavelet features of each level, we run K fold cross validation where K=1, 2,…, 10. We run 20 times for each K fold cross validation experiments. Table 2, 3, and 4 show the performance of detail coefficients at 3rd level, 4th level and 5th level decomposition respectively. Yu et al. [14] indicated that “For the high-resolution ovarian data, the vector of detail coefficients contains almost no information for the healthy, since SVMs identify all the data as cancers”. They use a four-step strategy for data preprocessing based on: (1) binning, (2) Kolmogorov–Smirnov test, (3) restriction of coefficient of variation and (4) wavelet approximation coefficients. Their experimental results are shown in Table 5. They achieved 95.34% BACC for 2 fold cross validation experiment and 96.12% BACC for 10 fold cross validation experiment. Our experimental results show that wavelet detail coefficients are efficient way to characterize the features contained in mass spectrometry data. For 2 fold cross validation experiment, we achieve 97.78% BACC using 761 wavelet detail coefficients at 3rd level decomposition; 99.02% BACC are obtained for 10 fold cross validation experiment. All our detail coefficients at 3rd level, 4th level and 5th level decomposition outperform their method of four-step strategy. Our results also outperform other methods, which are shown in Table 6. This Table shows the dimensionality of detail coefficients at 3rd level, 4th level and th 5 level wavelet decomposition. Table 1. Feature number of high resolution ovarian mass spectra
Feature number
Original 368750
resample 15000
filtered 6000
3rd level 761
4th level 387
5th level 200
194
Y. Liu Table 2. Performance of 761 detail coefficients at 3rd level
K fold 2 3 4 5 6 7 8 9 10
Accuracy
Sensitivity
Specificity
0.9781 0.9861 0.9877 0.9898 0.9884 0.9861 0.9830 0.9846 0.9907
0.9805 0.9894 0.9945 0.9950 0.9917 0.9890 0.9862 0.9890 0.9945
0.9751 0.9820 0.9789 0.9832 0.9842 0.9825 0.9789 0.9789 0.9860
PPV
NPV
BACC
0.9805 0.9859 0.9837 0.9869 0.9877 0.9863 0.9835 0.9836 0.9890
0.9751 0.9864 0.9929 0.9936 0.9894 0.9859 0.9824 0.9859 0.9929
0.9778 0.9857 0.9867 0.9891 0.9880 0.9857 0.9826 0.9840 0.9902
This Table shows the performance of high resolution ovarian dataset. PPV stands for Positive Predictive Value; NPV stands for Negative Predictive Value. BACC stands for Balanced Correct Rate. Table 3. Performance of 387 detail coefficients at 4th level K fold 2 3 4 5 6 7 8 9 10
Accuracy 0.9668 0.9702 0.9676 0.9741 0.9745 0.9722 0.9769 0.9738 0.9738
Sensitivity 0.9737 0.9717 0.9738 0.9752 0.9731 0.9780 0.9752 0.9752 0.9725
Specificity 0.9579 0.9684 0.9596 0.9726 0.9763 0.9649 0.9789 0.9719 0.9754
PPV 0.9672 0.9751 0.9685 0.9784 0.9812 0.9726 0.9833 0.9779 0.9806
NPV 0.9662 0.9641 0.9664 0.9686 0.9661 0.9717 0.9688 0.9685 0.9653
BACC 0.9658 0.9700 0.9667 0.9739 0.9747 0.9714 0.9771 0.9736 0.9739
This Table shows the performance of high resolution ovarian dataset. PPV stands for Positive Predictive Value; NPV stands for Negative Predictive Value. BACC stands for Balanced Correct Rate. Table 4. Performance of 200 detail coefficients at 5th level K fold 2 3 4 5 6 7 8 9 10
Accuracy 0.9621 0.9656 0.9769 0.9731 0.9803 0.9846 0.9799 0.9753 0.9753
Sensitivity 0.9715 0.9681 0.9835 0.9802 0.9855 0.9890 0.9862 0.9835 0.9807
Specificity 0.9502 0.9624 0.9684 0.9642 0.9737 0.9789 0.9719 0.9649 0.9684
PPV 0.9613 0.9704 0.9754 0.9721 0.9795 0.9836 0.9781 0.9728 0.9753
NPV 0.9631 0.9595 0.9787 0.9745 0.9814 0.9859 0.9823 0.9786 0.9753
BACC 0.9608 0.9653 0.9759 0.9722 0.9796 0.9840 0.9791 0.9742 0.9746
Feature Extraction for Mass Spectrometry Data
195
This Table shows the performance of high resolution ovarian dataset. PPV stands for Positive Predictive Value; NPV stands for Negative Predictive Value. BACC stands for Balanced Correct Rate. Table 5. Performance of a four-step strategy [14] K fold 2 3 4 5 6 7 8 9 10
Control 0.9330 0.9393 0.9409 0.9425 0.9411 0.9412 0.9414 0.9423 0.9406
SD 0.0174 0.0188 0.0200 0.0203 0.0223 0.0210 0.0222 0.0231 0.0226
Cancer 0.9738 0.9783 0.9786 0.9794 0.9806 0.9805 0.9815 0.9817 0.9819
SD 0.0125 0.0115 0.0118 0.0119 0.0118 0.0118 0.0117 0.0117 0.0113
BACC 0.9534 0.9588 0.9597 0.9609 0.9608 0.9608 0.9615 0.9620 0.9612
This Table shows performance of high-resolution ovarian dataset. SD stands for standard deviations. BACC stands for Balanced Correct Rate. Table 6. Performance of different methods [14] of high resolution ovarian dataset Methods VP QDA LDA MDA NB Bagging 1-NN 2-NN ADtree J48tree
2-fold cross validation Control (Mean) Cancer (Mean) 0.9393 0.9583 0.9202 0.9429 0.9179 0.9467 0.9392 0.9154 0.8803 0.9190 0.8835 0.9174 0.8575 0.8889 0.7260 0.9641 0.8238 0.8878 0.7818 0.8507
10-fold cross validation Control (Mean) Cancer( Mean) 0.9482 0.9691 0.9255 0.9647 0.9255 0.9522 0.9591 0.9267 0.8979 0.9249 0.8977 0.9232 0.8902 0.9018 0.8063 0.9745 0.8498 0.9025 0.8245 0.8825
5 Conclusions For transformations a new basis is normally chosen for the data. The selection of the new basis determines the properties that will be held by the transformed data. Principle component analysis (PCA) is used to extract the main components from mass spectra [9]; Linear discriminant analysis (LDA) is used to extract discriminant information from mass spectra [10]. However in these transform feature space, localized features or transient features of mass spectrometry data can not be detected. Detail coefficients can reveal the transient or localized changes of mass spectrometry data, using the compactness and finite energy characteristic of wavelet functions. Experimental results show that detail coefficients achieve good performance.
196
Y. Liu
Acknowledgements. This study is supported by research funds of Shandong Institute of Light Industry (12041653).
References 1. Petricoin, E.F., Ardekani, A.M., Hitt, B.A., Levine, P.J., Fusaro, V.A., Steinberg, S.M., Mills, G.B., Simone, C., Fishman, D.A., Kohn, E.C., Liotta, L.A.: Use of proteomic patterns in serum to identify ovarian cancer. The Lancet 359, 572–577 (2002) 2. Sorace, J.M., Zhan, M.: A data review and re-assessment of ovarian cancer serum proteomic profiling. BMC Bioinform. 4 (2003) 3. Michener, C.M., Ardekani, A.M., Petricoin, E.F., Liotta, L.A., Kohn, E.C.: Genomics and proteomics: application of novel technology to early detection and prevention of cancer. Cancer Detect Prev. 26, 249–255 (2002) 4. Petricoin, E.F., Zoon, K.C., Kohn, E.C., Barrett, J.C., Liotta, L.A.: Clinical proteomics: translating benchside promise into bedside reality. Nat. Rev. Drug. Discov. 1, 683–695 (2002) 5. Srinivas, P.R., Verma, M., Zhao, Y., Srivastava, S.: Proteomics for cancer biomarker discovery. Clin. Chem. 48, 1160–1169 (2002) 6. Herrmann, P.C., Liotta, L.A., Petricoin, E.F.: Cancer proteomics: the state of the art. Dis. Markers 17, 49–57 (2001) 7. Cazares Jr., G.W., Leung, L.H., Nasim, S.M., Adam, S., Yip, B.L., Schellhammer, T.T., Gong, P.F., Vlahou, L.: A Proteinchip surface enhanced laser desorption/ionization (SELDI) mass spectrometry: a novel protein biochip technology for detection of prostate cancer biomarkers in complex protein mixtures. Prostate Cancer Prostatic Dis. 2, 264–276 (1999) 8. Vlahou, A., Schellhammer, P.F., Mendrinos, S., Patel, K., Kondylis, F.I., Gong, L., Nasim, S., Wright Jr.: Development of a novel proteomic approach for the detection of transitional cell carcinoma of the bladder in urine. Am. J. Pathol. 158, 1491–1520 (2001) 9. Lilien, R.H., Farid, H., Donald, B.R.: Probabilistic disease classification of expressiondependent proteomic data from mass spectrometry of human serum. Computational Biology 10 (2003) 10. Park, H., Jeon, M., Rosen, J.B.: Lower dimensional representation of text data based on centroids and least squares. BIT 43, 1–22 (2003) 11. Wu, B., Abbott, T., Fishman, D., McMurray, W., Mor, G., Stone, K., Ward, D., Williams, K., Zhao, H.: Comparison of statistical methods for classifcation of ovarian cancer using mass spectrometry data. BioInformatics 19 (2003) 12. Jeffries, N.O.: Performance of a genetic algorithm for mass spectrometry proteomics. BMC Bioinformatics 5 (2004) 13. Levner, I.: Feature selection and nearest centroid classification for protein mass spectrometry. BMC Bioinformatics 6 (2005) 14. Yu, J.S., Ongarello, S., Fiedler, R., Chen, X.W., Toffolo, G., Cobelli, C., Trajanoski, Z.: Ovarian cancer identification based on dimensionality reduction for high-throughput mass spectrometry data. Bioinformatics 21, 2200–2209 (2005) 15. Mallat, S.: A theory for multiresolution signal decomposition: The wavelet representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 11, 674–693 (1989) 16. Vapnik, V.N.: Statistical learning theory. Wiley, New York (1992) 17. Hearst, M.A., Dumais, S.T., Osman, E., Platt, J., Scholkopf, B.: Support vector machines. IEEE Intelligent Systems 13, 18–28 (1998) 18. Burges, C.: A Tutorial on Support Vector Machines for Pattern Recognition. Kluwer Academic Publishers (1998) 19. IEEE: Programs for Digital Signal Processing. ch. 8. IEEE Press, John Wiley & Sons, New York (1979)
An Improved Algorithm on Detecting Transcription and Translation Motif in Archaeal Genomic Sequences Minghui Wu1,2, Xian Chen3, Fanwei Zhu1, and Jing Ying1,2 1 Computer College, Zhejiang University, Hangzhou, P.R. China Dept.of Computer, Zhejiang University City College, Hangzhou, P.R. China
[email protected] 3 Dept. of Computing Science, University of Alberta, Edmonton Alberta, Canada
[email protected] 2
Abstract. Identifying the binding sites and promoters in the genomes remains one of the most research topics in computational biology in past ten years. In the upstream region of the start codon, there exist transcription and translation motifs whose distances and patterns vary among different genomic sequences. However, the existing computational approaches for detecting them are mostly general-purpose. For archaea, binding motifs are almost undiscovered as they are more hidden than bacteria or eukaryotes. In this report, an improved algorithm based on PWM (position-weight matrix) and Gibbs Sampler was proposed for finding any number of patterns in a given range. Experiments using this algorithm were done to detect the potential binding motifs in archaeal genomic sequences, and the results were analyzed among different settings and species. The comparison with biological experiments result shows that the improved algorithm is feasible to find more significant patterns for archaea than the traditional approaches.
1 Problem Description Identifying the binding sites and promoters in the genomes remains one of the most research topics in computational biology in past ten years. Usually there exist binding sites (motifs) in the DNA sequences that tell RNA polymerase where to start transcription. Sometimes there are also translation motifs in the DNA sequences. These motifs are present separately near the start codon of genes, and might be recognized by their patterns. However, the distances between these short sequences and start codon are not same, and sometimes their mutation rate is not very low. There have been lots of algorithms addressing this problem from different viewpoints, ranging from pattern recognition to neural network: 1. CONSENSUS[5]: Use a greedy algorithm to iteratively build up motifs by adding more and more pattern instances. 2. Gibbs Sampler[6]: Start from a random initial solution, and use the Gibbs sampling approach to make a series of local moves for the best solution. 3. MEME[1]: Use the expectation maximization (E-M) algorithm. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 197–207, 2007. © Springer-Verlag Berlin Heidelberg 2007
198
M. Wu et al.
4. ANN-Spec[9]: Use the Neural Network. 5. Co-Bind[4]: Use Gibbs sampling strategy, but discover DNA target sites for cooperatively acting transcription factors. However, most of these methods are for general purpose, which might not work well in all cases. For example, in archaeal genomes, few methods were proposed since binding motifs are largely undiscovered in biological experimental level as they are usually more hidden than bacteria or eukaryotes. We need some methods and algorithms to detect motifs in such specific cases. The purpose of this project tries to propose methods finding motifs in archaeal genomes, and analyzes the feasibility and significance of detecting archaeal motifs by computational methods.
2 Materials and Methods 2.1 Genomes All genomic sequences of Archaea were downloaded from GenBank, NCBI (http://www.ncbi.nlm.nih.gov). Up to December 2004, there are totally 19 whole genomic sequences submitted in GenBank (see Table 1). They may be divided into three types: Crenarchaeota, Euryarchaeota and Nanoarchaeota. Table 1. Archaeal genomic sequences tested and analyzed Genome name Aeropyrum Pernix Kl Pyrobaculum aerophilum Sulfolobus solfataricus Sulfolobus tokodaii Archaeoglobus fulgidus Halobacterium sp. NRC-1 Methanobacterium thermoautotrophicus Methanocaldococcus jannaschii Methanococcus maripaludis S2 Methanopyrus kandleri AV19 Methanosarcina acetivorans strain C2A Methanosarcina mazei Goel Picrophilus torridus DSM 9790 Thermoplasma acidophilum Thermoplasma volcanium Pyrococcus abyssi Pyrococcus furiosus Pyrococcus horikoshii Nanoarchaeum equitans Kin4-M
Gene ber 1893 2706 3030 2874 2486 2127 1920
num-
Order of Species Crenarchaeota Crenarchaeota Crenarchaeota Crenarchaeota Euryarchaeota Euryarchaeota Euryarchaeota
GenBank Access No. NC 000854 NC 003364 NC 002754 NC 003106 NC 000917 NC 002607 NC 000916
1773 1772 1729 4662
Euryarchaeota Euryarchaeota Euryarchaeota Euryarchaeota
NC 000909 NC 005791 NC 003551 NC 003552
3438 1535 1529 1548 1895 2125 2004 552
Euryarchaeota Euryarchaeota Euryarchaeota Euryarchaeota Euryarchaeota Euryarchaeota Euryarchaeota Nanoarchaeota
NC 003901 NC 005877 NC 002578 NC 002689 NC 000868 NC 003413 NC 000961 NC 005213
An Improved Algorithm on Detecting Transcription and Translation Motif
199
2.2 Position-Weight Matrix and Information \Content The PWM (Position-weight matrix) has been widely used in sequence pattern matching. In order to define PWM, we consider a given set of sequences S = {S1, S2, S3, ..., Sn} with the same length l. The alignment matrix is described by the number of appearance of each residue in each position (For DNA sequence, it could be one of A, C, G and T). As an example, in DNA sequences with length 10, the alignment matrix could look like Table 2: Table 2. Alignment matrix Pos A C G T
1 1 2 1 4
2 3 2 2 1
3 2 3 3 0
4 0 8 0 0
5 8 0 0 0
6 0 8 0 0
7 0 0 8 0
8 0 0 0 8
9 0 0 5 3
10 0 2 4 2
From this example, we can easily find the consensus for the set of sequences, which is TAC (G) CACGTGG. However, it is hard to describe the quality of alignment by alignment matrix since the probability of appearance for each nucleotide varies among different sequence contents. Therefore we introduce the probability to calculate the weight of nucleotide in each position. The PWM entry for a base i at position j is defined as following:
W i , j = ln(
f i, j pi
)
(1)
where pi is the expected probability of the base i in the background sequence, and fi,j is the corrected frequency of base i at position j, which can be given by:
f i, j =
ni , j + p i
∑i =1 ni, j + 1 A
.
(2)
here ni,j is the correspondent value in the alignment matrix. The PWM matrix corresponding to Table 2 is given in Table 3: Table 3. Position-weight Matrix Pos A
pi 0.32
1 -0.79
2 0.13
C G T
0.18 0.18 0.32
0.32 0.29 0.39
0.32 0.32 -0.79
3 0.23 0.7 0.7 -2.2
4 -2.2
5 1.05
6 -2.2
7 -2.2
8 -2.2
9 -2.2
10 -2.2
1.65 -2.2 -2.2
-2.2 -2.2 -2.2
1.65 -2.2 -2.2
-2.2 1.65 -2.2
-2.2 -2.2 1.05
-2.2 1.19 0.13
0.32 0.97 -0.23
200
M. Wu et al.
Finally, the information content is calculated for each nucleotide in each position. It is defined as following:
I i , j = f i , j • Wi , j .
(3)
Then we may use the sum of information contents to represent the alignment quality: l
A
I matrix = ∑∑ I i , j .
(4)
j =1 i =1
The information contents corresponding to Table 2 is shown in Table 4: In this example, 7.03 is the sum of information contents, which can represent the quality of sequence alignment. Table 4. Information Content Pos A
pi 0.32
1 0.12 0.08
2 0.05
C
0.18
G
0.18
T Sum
0.08
3 0.06 0.25
4 0.08 1.5
0.32
0.04 0.19
0.08
0.25
0.12 0.09
0.08 0.36
0.04 0.08 1.29
7.03
0.11
5 0.97 0.04 0.04 0.08 0.8
6 0.08 1.5 0.04 0.08 1.29
7 0.08 0.04 1.5 0.08 1.29
8 0.08 0.04 0.04 0.97
9 0.08 0.04 0.68
10 -0.08
0.05
-0.06
0.8
0.61
0.39
0.08 0.45
2.3 Definition of Entropy Profile The weakness of information content is that its upper bound increases when pi decreases. Therefore we have to define the entropy profile, which has an upper bound of 2 in a specific position: A
S = S max − S obs = 2 − (−∑ bi log 2 bi )
(5)
i =1
where bi is the probability of appearance for base i in the position
bi =
ni
∑
A j =1
nj
(6)
here ni is the number of appearance for base i. The total entropy profile for a motif is given by:
S tot = where l is the length of sequences.
l
∑S j =1
j
(7)
An Improved Algorithm on Detecting Transcription and Translation Motif
201
2.4 Algorithm Traditional Gibbs Sampler Algorithm is a special case of Markov Chain method. It has shown good performance in some experimental cases. However, in practice, some problems exist: 1. The detected motifs in the sequences might overlap. 2. It is hard to detect some relatively weak patterns in a large range. 3. Some detected patterns might not be motifs because of the random mutation. In order to solve these problems, we improve the algorithm from two aspects: First, allow detecting multiple motifs in one iteration. Given that same motif patterns should not be too far away from each other [8], and different motifs appear in the same order in the upstream regions, we may divide a region into a number of subregions. For example, we divide a region (say -60 to -10) into 2 parts (2 equal parts in default case). Each time, we detect a pattern from -60 to -35, and another pattern from -35 to -10. So each sub-region can extend a bit into its neighbor as long as no overlapping of patterns happens. Second, we use the whole genomic sequence as the background sequence for a given genome, and count the probability of each base as value of pi. Since we use information content as the alignment score, this adjustment is expected to achieve better results. For implementation, we use an array to store the offsets of motifs for each sequence. Initially the offsets are randomly set in all sub-regions. In each iteration, we picked out one sequence S for each sub-region, and calculate PWM and information content for all possible subsequences in the sub-region; find one pattern that makes its corresponding information content highest, and update the offset of motif for S and replace PWM and information content with the new value. Since the length of the whole region is fixed, we can even find more than one patterns simultaneously in a given region. The details of results are discussed in next two sections.
3 Experiments and Results 3.1 Testing in Genomic Sequences In experiments, all the archaeal genomic sequences were classified into 12 groups according to their species (see Table 5). Potential motif patterns were detected using the new algorithm with detected motif number of 1, 2 and 3. All the detected region is set as upstream [-60, -10] to the start codon and the length of patterns is set 6. The running time never exceeded 30 seconds for any sequence (iterations range from 50000 to 120000). This report will focus on the data with motif number of 3.
202
M. Wu et al. Table 5. Groups of Archaeal Species for Testing
Group No. I II III IV V VI VII VIII IX
X
XI XII
Genome name
Species
Aeropyrum Pernix Kl Pyrobaculum aerophilum Sulfolobus solfataricus Sulfolobus tokodaii Archaeoglobus fulgidus Halobacterium sp. NRC-1 Methanobacterium thermoautotrophicus Methanocaldococcus jannaschii Methanococcus maripaludis S2 Methanopyrus kandleri AV19 Methanosarcina acetivorans strain C2A Methanosarcina mazei Goel Picrophilus torridus DSM 9790 Thermoplasma acidophilum Thermoplasma volcanium Pyrococcus abyssi Pyrococcus furiosus Pyrococcus horikoshii Nanoarchaeum equitans Kin4-M
Aeropyrum Pyrobaculum Sulfolobus Sulfolobus Archaeoglobus Halobacterium
GenBank Access No. NC-000854 NC-003364 NC 002754 NC 003106 NC 000917 NC 002607
Methanobacterium
NC 000916
Methanocaldococcus Methanococcus Methanopyrus
NC 000909 NC 005791 NC 003551
Methanosarcina
NC 003552
Methanosarcina Picrophilus Thermoplasma Thermoplasma Pyrococcus Pyrococcus Pyrococcus Nanoarchaeum
NC 003901 NC 005877 NC 002578 NC 002689 NC 000868 NC 003413 NC 000961 NC 005213
3.2 Results For each genomic sequence, the tests were run 10 times with each detected motif number. The patterns with highest entropy values were recorded (results with entropy below 4 are not shown in this table) in Table 6 and Table 7.
4 Discussion 4.1 Significance of Patterns Since the entropy profile has the upper bound of 12 for a 6-base long pattern, the higher entropy value we get, the more significant the pattern is. However, in practice, the entropy profile of most patterns never exceeds 8. Also, the entropy of a pattern is highly related to total number of genes in a genomic sequence. Therefore, we say a pattern is significant if it has an entropy profile higher than 5. In some cases, stable patterns with entropy > 4 are also considered as potential motifs.
An Improved Algorithm on Detecting Transcription and Translation Motif
203
Table 6. Results of Testing with Motif Number = 1 and 2 Group No. I
Access No. NC 000854
II
NC 003364
III
NC 002754
NC 003106
IV
NC 000917
V
NC 002607
VI
NC 000916
VII
NC 000909
NC 005791
VIII
NC 003551
IX
NC 003552
NC 003901
X
NC 002578
Motif = 1[-60,-10] Pattern Entropy GAGGCT 5.573 AGGCTT 5.515 TAGAGG 5.365 TTTAAA 6.529 TATAAA 6.505 TTAAAA 6.362 AAAAGA 6.455
Motif = 2[-60,-30],[-40,-10] Pattern Entropy Pattern CTATAG 4.259 GAGGCT TTTAGA 4.203 TAGAGG CTATAG 4.179 GGATGT TATAAA 4.291 TTTAAA TTTTAA 4.222 TATAAA TTTAAA 4.177 TTTAAA GAAAAA 5.001 TTAAAA
Entropy 4.508 4.334 4.269 5.551 5.534 5.513 5.803
AAAGAT AAAGAT AAGAAA
6.323 6.263 6.693
TAGAAA TTATAA AGAAAA
4.971 4.939 5.361
TAAATT AAGATT TTTTAA
5.452 5.276 6.212
AGAAAA TAGAAA AAAGAT TGAAAA GAAAAA TCGACG AACGCC GTCGAC GATAAA AGATAA ATGAAA ATAAAA
6.428 6.47 5.986 5.961 5.85 5.144 4.872 4.61 5.867 5.861 5.835 7.91
TAGAAA GAAAAA TGAAAA TGAAAA TGAAAA
5.303 5.276 4.919 4.919 4.76
TTTTTA AAGATT AAAGTT AAAGTT AAAGTT
6.086 5.414 4.848 4.823 4.798
CATGAA ATGAAA TTGATA TATAAA
4.707 4.683 4.678 6.486
ACATAA ACATAA ACATAA AAAAAT
4.827 4.799 4.793 6.613
AAATAA AAAAAA TTTAAA
7.602 7.484 7.844
ATATAA TAAAAA AAAAAT
6.363 6.298 6.508
ATAAAA AAATAT AAATAG
6.418 6.161 5.505
AAAATA AAAAAT CGGGGG GGGGGA GGGGGA AGAAAA
7.708 7.696 6.888 6.865 6.856 6.256
AAAATA TTTAAA CGTGGA CGTGGA CGAGGA AGAAAA
6.462 6.458 4.04 4.018 4.004 5.035
AAGGTG AAAAGG CGGGGG GGGGTG CGGGGG AAAAGA
5.079 4.914 6.139 6.013 5.977 4.975
AAAAAA AAAATA AAAAAA
6.2 6.184 6.311
AAAATA AAAAAT AAAAAT
4.97 4.896 5.162
AAAAAT ATAAAA AGAAAA
4.955 4.918 4.995
AAAAAA AAAATA ATAAAT
6.263 6.243 6.295
AAAAAT TAAAAA AGAAAA
5.071 5.036 4.902
AAAGGA AGGAAA TTAAAT
4.758 4.54 5.359
AATAAA AAATAT
6.254 6.254
TGAAAA ATGAAA
4.878 4.834
AAATAT AAATAT
5.338 5.301
204
M. Wu et al. Table 6. (continued) NC 002689
XI
NC 000868
NC 003413
NC 000961
XII
NC 005213
AAAAAT
6.697
AAGAAA
5.264
TAAATA
5.686
AAATAT AAATAT GAGGTG
6.695 6.652 6.105
ATAAAA ATAAAA TTTTAA
5.13 5.1 4.885
TAAATA ATAAAT GAGGTG
5.628 5.549 5.147
GAGGTG AGGAGG AGGAGG
6.101 5.947 5.926
TTAAAA TGAAAA TAAAAG
4.883 4.836 5.072
GAGGTG GAGGTG GAGGTG
5.133 5.106 5.104
GAGGAG GAGGTG AAGGAT
5.797 5.789 5.81
TGAAAA TGAAAA TTAAAA
5.011 5.007 4.985
GAGGTG AGGAGG TAAGGG
5.102 4.993 4.841
GAGGTG AAGGAG TTTAAA TTAAAA TTATAA
5.728 5.697 8.22 7.827 7.78
TTAAAA AAAGTT CTATAG AAAAGC AAAAGG
4.916 4.903 4.495 4.362 4.219
GGAGGT TGAGGT TTTAAA TTTAAA TTTAAA
4.713 4.679 7.535 7.521 7.474
Table 7. Results of Testing with Motif Number = 3 Group No.
Access No.
I
NC 000854
II
NC 003364
III
NC 002754
NC 003106
IV
NC 000917
V
NC 002607
Motif = 3[-60,-40],[45,-25],[-30,-10] Pattern Entropy Pattern Entrop y
Pattern GGGGTG GGGGTG GGGGTG
Entrop y 4.151 4.146 4.073
TAAAAT
4.392
TTTAAA TTTAAA TTTATA TTATAA
4.459 4.457 4.452 5.393
AAGATT
4.387
TAAAAT TAAAGT AAGATT
4.385 4.341 4.534
TTAAAA TTTATA TTTTAA
5.379 5.3 5.601
AATATA AAGATA TTTAAG
4.346 4.246 4.876
AAATAT AAAAGA AAAGTT TGAAAA
4.471 4.278 4.057 4.033
ATTTAA TAAAAA TGAAAA TGAAAA TGAAAA
5.481 5.227 4.337 4.266 4.259
AATTTA TAAATA TTAAGG AGGTGA TTTGAG
4.717 4.71 4.129 4.042 4.02
An Improved Algorithm on Detecting Transcription and Translation Motif
205
Table 7. (continued) VI
NC 000916
VII
NC 000909
NC 005791
VIII
NC 003551
IX
NC 003552
NC 003901
X
NC 002578
NC 002689
XI
NC 000868
NC 003413
NC 000961
XII
NC 005213
GATGAA ATGAAA ATGAAA TATAAA
4.115 4.104 4.107 5.681
TTGAAA ATGAAA ATGAAA TTTAAA
4.147 4.133 4.066 5.921
AGGAGA AGGAGA AGGAGA AGGTGA
4.39 4.386 4.323 4.623
ATATAA TTTAAA TTAAAT
5.634 5.632 5.951
TTTAAA ATTAAA ATTTAA
5.852 5.835 5.915
AAGGTG AGGTGA AGGTGA
4.588 4.577 5.199
TTAAAA TTAAAA CCCCGA CCCGAA CCCGAA AAAAAT
5.944 5.882 4.119 4.052 4.051 4.42
ATTTAT ATTTAA
5.873 5.808
TTGAAA
4.499
AGGTGA AGGTGA CGGGGG CGGGGG CGGGGG AGGAAA
5.197 5.197 6.025 5.993 5.948 4.069
TGAAAA GAAAA A TGAAAA
4.358 4.349
ATTTAA ATAAAA
4.39 4.386
AAAGAG AGGAAA
4.048 4.041
4.593
TTTAAA
4.545
AGGAGA
4.041
AAAAAT TGAAAA AAAAAT
4.52 4.517 4.352
ATTAAA TAAAAA ATATAA
4.522 4.49 4.644
AGGAGA AAGGAG AAATAT
4.001 4.001 4.523
AAAAAT AAAATA TAAATA
4.342 4.314 4.636
ATATAA ATTTAA TAAATA
4.625 4.504 5.197
TATAAT AATAAT TAAATG
4.474 4.393 4.459
AAATAT AAATAT AAGATT
4.576 4.552 4.315
ATTTAA AAATAT TTTTAA
5.159 5.126 4.734
ATAAAG ATATTG AGGTGA
4.226 4.217 4.729
AAGGTT AAGGTT AAAAA G TGAAAA AAAGTT TGAAAA
4.262 4.258 4.395
TTTTAA TTTTAA TTTAAA
4.721 4.715 4.739
AGGTGG AGGTGA AGGTGG
4.709 4.709 4.907
4.337 4.334 4.286
TTTAAA TTTAAA TTTTAA
4.731 4.705 4.668
AGGTGG AGGTGG AGGTGG
4.876 4.862 4.193
AAAAGT TTTAAA
4.275 4.227
TTAAAA TTTTAA TTTTAA TTTTAA TTTTAA
4.629 4.623 6.298 6.297 6.21
AGGAGG GAGGTG TTTAAA TTTAAA TTTAAA
4.186 4.123 6.802 6.518 6.234
206
M. Wu et al.
4.2 Comparison Between Different Motif Numbers From Table 6 and 7, we may find that although the entropy is usually high when motif number is 1, the consensus patterns don’t show stability. But when motif number is added to 2 or 3, some patterns that haven’t been found become stable. Most of them are weak and hidden in local region that it is hard to be found in the whole region. Hence, it is necessary to focus on the data with motif number of 2 and 3. 4.3 Homology of the Archaeal Motif Patterns When we focus on the data with motif number 3(or some with number 2), we usually find an AT-rich pattern near [-40,-30] from archaeal gene sequences. The pattern looks like TTTATA or TTTAAA, which is part of TATA-box [7]. At the upstream of TATA-box ([-60,-40]), there are few significant patterns. Although some similar patterns including TGA or AGG are found in some sequences, they are not widespread in different archaeal genomic sequences. On the contrary, at the downstream of TATA-box ([-25.-10]), there is a significant pattern with different contents in different genomic sequences. This pattern always appears around -15, which turns out to have particularly high entropy when motif number = 3. Data in the same group show the similarity of the same or close species, especially when motif number = 3. Some groups have two AT-rich patterns near both -35 and 10. As little evidence shows the number of motifs in this region, we can not tell if these two patterns are actually referred to the same motif. Many groups include at least two completely different patterns when motif number = 3.One typical example is group XI, the second and the third pattern is almost invariable. The third pattern turns out to be AGGTGG with an entropy around 4.8, which is still a relatively positive result. 4.4 Discussion on Some Specific Cases Here are two specific cases verified by other people’s work. The first case is in Pyrococcus furious (Fig.1). The third pattern in the test of motif number 3 gives a stable AGGTGG with an entropy close to 5.
Fig. 1. Patterns from Pyrococcus furiosus with Motif Number = 3(Generated by WebLogo)
An Improved Algorithm on Detecting Transcription and Translation Motif
207
This pattern exactly matches the transcription motif pattern given in [3]. Another exciting case is Pyrococcus abyssi (see [2] [8]). When motif number is 3, the second pattern shows an AT-rich pattern near -30, and the third one shows a Grich pattern near -10. These two patterns keep stable with entropy between 4.5 and 5.
5 Conclusions and Future Work The algorithm proposed in this report improves the traditional Gibbs Sampler Algorithm in the following aspects: 1. Finding non-overlapping motifs simultaneously. 2. Detecting some relatively weak patterns in a large upstream region. 3. Reducing the possibility of randomness and improving stability The experimental results for archaeal sequences show that it is feasible to find more motif patterns in this relatively unknown domain. Therefore, we may have confidence to predict some motifs (or patterns) by this improved algorithm. The future work is to implement a display tool based on this algorithm, which can view the significance clearly and visualize the comparison. More tests will be taken in a larger region to detecting more patterns. We may even apply this algorithm into other two main domains (i.e. bacteria and eukaryotes) for further study.
References 1. Bailey, T.L., Elkan, C.P.: Fitting a mixture model by expectation maximization to discover motifs in biopoly- mers. Intelligent System Mol. Biol. 2, 28–36 (1994) 2. Boyle, A.P., Boyle, J.A.: Global alignment of microbial translation initiation regions. J. MS Acad. Sci. 48, 138–150 (2003) 3. Dahlke, I., Thomm, M.: A pyrococcus homolog of the leucine-reponsive regulatory protein, lrpa, inhibits transcription by abrogating rna polymerase recruitment. Nucleic Acids Research 30(3), 701–710 (2002) 4. GuhaThakurta, D., Stormo, G.D.: Identifying target sites for cooperatively binding factors. Bioinformatics 17, 608–621 (2001) 5. Hertz, G.Z., Stormo, G.D.: Identifying dna and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15, 563–577 (1999) 6. Lawrence, C.E., Altschul, S.F., Bogusky, M.S., Liu, J.S., Neuwald, A.F., Wootton, J.C.: Detecting subtle sequence signals: Gibbs sampling strategy for multiple alignment. Science 262, 208–214 (1993) 7. Vierke, G., Engelmann, A., Hebbeln, C., Thomm, M.: A novel archaeal transcriptional regulator of heat shock response. Biological Chemistry 278(1), 18–26 (2003) 8. Wan, X., Bridges, S.M., Boyle, J.A.: Revealing gene transcription and translation initiation patterns in archaea, using an interactive clustering model. Extremophiles 8, 291–299 (2004) 9. Workman, C.T., Stormo, G.D.: Ann-spec: a method for discovering transcription factor binding sites with improved specificity. Pac. Symp. Biocomput. 5, 464–475 (2000)
Constructing Structural Alignment of RNA Sequences by Detecting and Assessing Conserved Stems Xiaoyong Fang1, Zhigang Luo1, Bo Yuan2, Zhenghua Wang1, and Fan Ding1 1
School of Computer Science, National University of Defense Technology 410073 Changsha, China {ZhigangLuo,
[email protected]} 2 Department of Biomedical Informatics, College of Medicine and Public Health, Ohio State University 43210-1239 Columbus Ohio, USA {Bo Yuan,yuan.33}@osu.edu
Abstract. The comparative methods for predicting RNA secondary structure can be facilitated by taking structural alignments of homologous sequences as input. However, it is very difficult to construct a well structural alignment of RNA sequences without knowing the secondary structures. In this paper, we present a stem-based method for constructing structural alignment of RNA sequences with unknown structures. The method can be summarized by: 1) we detect possible stems in the RNA sequence using the so-called position matrix with which some possibly paired positions are uncovered; 2) we detect conserved stems across multiple sequences by multiplying the position matrices; 3) we assess the conserved stems using the Signal-to-Noise and the new SCFG model; 4) we construct structural alignment of RNA sequences by incorporating conserved stems with Clustal W which is a popular program for multiple sequence alignment. We tested our method on data sets composed of known structural alignments which are downloaded from the Rfam database. The accuracy, measured as sensitivity and true positive rate, of our method is much greater than alignments by Clustal W.
1 Introduction Non-coding RNA genes are genes for which RNA, rather than protein, is the functional end product [1]. Recent research shows that ncRNA is far more widespread than was previously anticipated [2]. The functions of ncRNAs are strongly related to their secondary structures. The gold standard for determining RNA secondary structure is comparative sequence analysis [3], in which a large number of sequences are aligned to reveal the common base pairing pattern. So far, a number of methods based on comparative sequence analysis have been implemented to predict RNA secondary structure [4-7]. However, these approaches all require an initial multiple alignment as input and thus are very vulnerable to structural errors in the alignment. The accuracy of comparative methods can be improved by taking structural alignment of RNA sequences as input. But it is very difficult to construct a well K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 208–217, 2007. © Springer-Verlag Berlin Heidelberg 2007
Constructing Structural Alignment of RNA Sequences
209
structural alignment without knowing the secondary structures. In general, the structure of an RNA is often more conserved than its sequence. Hence, one can not use standard multiple sequence alignment techniques such as Clustal W [8] or T. Coffee [9] since they completely neglect structural information. For this reason, several methods for simultaneous sequence alignment and structure prediction have been proposed to better this problem [10-12]. But algorithms based on these methods are too computationally taxing to be practical. Recently, some heuristic stem-based methods have been proposed to construct structural alignment of RNA sequences [1316]. But all of these methods lack of explicit algorithms for assessing the stems and thus reduce the accuracy of structural alignments. In this paper, we present a new method for constructing structural alignment of RNA sequences by detecting and assessing conserved stems. We detect possible stems in an RNA sequence using the so-called position matrix which is described in Section 2.1. We detect conserved stems across multiple sequences by the multiplying of position matrices which is defined in Section 2.2. We assess conserved stems using the Signal-to-Noise and the new SCFG (Stochastic Context-Free Grammar) [17] model which are introduced in Section 2.3. Finally, we construct structural alignment of multiple sequences by incorporating selected conserved stems with the popular program Clustal W. We tested our method on data sets composed of known structural alignments taken from the Rfam database [18]. The results show that our method can construct structural alignment of RNA sequences with much greater accuracy than Clustal W.
2 Methods We present the concept of position matrix for the first time in [19]. In this paper, we apply it to constructing structural alignment of RNA sequences. 2.1 Detecting Possible Stems in RNA Sequence Using the Position Matrix Given an RNA sequence of length N (denoted by Seq), the N×N position matrix for Seq (denoted by MSeq) is built by following steps: 1)
2)
3)
We first compute the reverse complement of Seq (denoted by Seq’ ) according to following rules: • The complement of ‘G’ is not ‘C’ but the set of {C, U}. For simplicity, we denote φ = {C, U}. • The complement of ‘U’ is not ‘A’ but the set of {A, G}. For simplicity, we denote ψ = {A, G}. • If the character is a gap (denoted by ‘_’), then the complement for it should be a gap too. We build one N×N matrix (this is not the position matrix) containing Seq’ in the first row. The ith (0 ≤ i ≤ N-1) row contains the sequence generated from Seq’ by shifting i position to the left (circular left shift). The position matrix MSeq is computed by comparing Seq with the matrix generated by 2) row by row. 0 or 1 or -1 is assigned to the i, j (0 ≤ j ≤ N-1)
210
X. Fang et al.
element of MSeq by comparing the jth base of Seq with the i, j (0 ≤ j ≤ N-1) element of the matrix in 2). Here, ‘0’ means the corresponding position is unpaired and ungapped, ‘1’ means the position is paired and ungapped, and ‘1’ means the position is gapped. The following rules should be obeyed when two bases are compared with each other: • If b equals b’ and neither of them is ‘_’, then 1 is assigned. • If b or b’ is ‘_’ or both of them are ‘_’, then -1 is assigned. • If b does not equal to b’ and neither of them is ‘_’, then 0 is assigned. Here, b is a base from Seq and b’ is an element from the matrix in 2). Specially, when b’ is φ or ψ, the word “equal” means that b belongs to b’. As shown in Figure 1, One N×N matrix (the left) is firstly built from the original sequence. Then the position matrix, MSeq, is computed by comparing Seq with the left matrix row by row. 1 Seq = A A U U G A U G 2
φψUφψψUU ψUφψψUUφ UφψψUUφψ φψψUUφψU ψψUUφψUφ ψUUφψUφψ UUφψUφψψ UφψUφψψU
MSeq =
01111110 10101010 00000011 01010000 11110110 10111011 00100001 00010100
1
2
Fig. 1. The construction of the position matrix for an RNA sequence. The stem and its mapping zone are labeled by same number.
We detect possible stems in the sequence by scanning the position matrix row by row. The key is to find all zones of continuous non-zero in the matrix. There is a oneto-one mapping between the stems in the sequence and the zones of continuous nonzero in the position matrix. As shown in Figure 1, two stems in the sequence (Seq) are mapped to two zones of continuous non-zero in the position matrix (MSeq). Finally, we point that the time complexity of the approach mentioned above is O (N2). 2.2 Detecting Conserved Stems by Multiplying the Position Matrices We first define the multiplying of position matrices and then apply it to detecting conserved stems across multiple sequences. Suppose both M1 and M2 are L×L position matrices. Then the resulting matrix (denoted by M) for M1 × M2 is computed by: M [i, j] = M1 [i, j] × M2 [i, j]
(1)
Constructing Structural Alignment of RNA Sequences
211
Here, M [i, j], M1 [i, j] and M2 [i, j] are respectively the i, j element of M, M1 and M2. Specially, the multiplying of the elements must obey following rules: • • •
0×0 = 0; 0×1 = 0; 0× (-1) = 0. 1×1 = 1; 1× (-1) = 1. (-1)× (-1) = -1.
The multiplying of n position matrices is computed by:
M =
n
∏
M
i
(2)
i =1
Here, M is the resulting matrix and all original matrices for multiplying should have the same dimension. Obviously, the multiplying of position matrices satisfies the commutative law and the associative law. We detect conserved stems across n sequences by following steps: 1) 2)
3) 4)
5)
We detect all possible stems in each sequence using the approach described in Section 2.1. We select n different stems from n sequences (one stem for one sequence), and then build the position matrix for each stem using the approach described in Figure 1. We multiply these n matrices according to the equation (2). This is done by multiplying two matrices each time. We detect conserved stems by finding zones of continuous non-zero in the resulting matrix (still denoted by M) generated by 3). There is still a one-toone mapping between the conserved stems and the zones of continuous nonzero in M. We repeat the steps through 2) to 4) until all the stems detected by 1) are selected.
For the step 3), it is easy to be disposed when the length of two stems is the same one. In other cases, for simplicity, we just add some gaps into the shorter sequence at the beginning and the end. Then we construct a new matrix for the new sequence. Finally, we point that the time complexity of equation (2) is O ((n-1) L2), where L is the dimension of the matrix. Suppose m stems are selected from each sequence on the average and the average length of the stem is still L. Then the time complexity for detecting conserved stems across n sequences of length N is approximately O (mn (n1) L2). In practical application, the condition L<< N makes the time and space cost be low. 2.3 Assessing Conserved Stems Using the Signal-to-Noise and the SCFG We assess the conserved stems by computing the Signal-to-Noise. The major steps are: 1) 2)
Given a conserved stem, we record the number of base pairs in the stem as the Signal. We generate a randomized alignment from the original alignment of the conserved stem.
212
X. Fang et al.
3)
We detect possibly conserved stems in the new alignment using the method described in Section 2.2. We record the number of base pairs in the conserved stem newly detected by 3) as the Noise. The Signal-to-Noise (i.e. the ratio of the Signal to the Noise) is thus computed by Signal / Noise. Note that, we set Noise to be 1 if there are no conserved stems in the randomized alignment, and we set Noise to be the maximum if there are more than one conserved stems.
4)
To generate a randomized alignment from the original alignment, we repeatedly permute the columns of each sequence until the common difference between the probability of the new alignment and the probability of the original alignment is less than some given threshold. To compute the probability of an RNA sequence, we introduce a new SCFG model. The SCFG can be defined by the five-tuple Mol = {W, T, Al, E}, where Mol is the SCFG model, W is the set of non-terminals, T is the set of transition distributions, Al is the set of terminals, and E is the set of emission distributions. We define them as follows: i. ii. iii. iv.
W = {start, bifurcation, single, pair, end}. T = [t (w, w’)], where w and w’ belong to W, and t (w, w’) is the transition probability from w to w’. Al = {A, C, G, U, _}, where ‘_’ symbolizes the gap. E = [ew], where w belongs to W. If w is the non-terminal pair, then ew should be e (β, β’). Here, both β and β’ belong to Al, and they exactly form a base pair. If w is the non-terminal single, then ew should be e (γ). Here, γ is a single base which belongs to Al. Specially, the non-terminals, start, bifurcation and end don’t produce any terminal.
Specially, the SCFG presented here decomposes productions into two independent parts: non-terminal transitions and terminal emissions. The production rules can be categorized three classes: the pair rules, the single rules and the others. We describe them in Figure 2. We use the inside-outside [17] method to estimate the parameters of the SCFG. And we change the original inside algorithm to compute the probability of an RNA sequence. Actually, we use the following equation to compute the probability of a derivation tree [17]: l1
P (Tree | Mol) =
∏
l3
l2
ti (pair, w) e (β, β’)
∏
tj (single, w’) e (γ)
j =1
i =1
∏
tk
k =1
(3)
∈W
w, w’
Here, tk is the probability of one rule from (c) of Figure 2, and Tree is the derivation tree which uses l1 pair rules, l2 single rules and l3 others. We use following equation to compute the probability of an RNA sequence: l4
P (Seq| Mol) =
∑
P (Treei | Mol)
(4)
i =1
Here, Seq is the RNA sequence which can be parsed by l4 derivation trees in total given the SCFG, Mol.
Constructing Structural Alignment of RNA Sequences
213
We use following equation to compute the probability of an alignment of n sequences: n
P (D| Mol) =
∏
P (Seqi | Mol)
i =1
(5)
Here, D is the alignment of n sequences and Seqi is the ith sequence of D.
pair
ȕ w’ ȕ’
(probability: t (pair, w’) e (ȕ, ȕ’)) (a)
single single
Ȗ w’ w’ Ȗ
start bifurcation
(probability: t (single, w’) e (Ȗ)) (probability: t (single, w’) e (Ȗ)) (b) w (probability: t (start, w), wę{pair, single}) start start (probability: 1) (c)
Fig. 2. The production rule for Mol. (a) is for the pair rule. (b) is for the single rule. (c) is for the others.
2.4 Constructing Structural Alignment by Incorporating Conserved Stems with Clustal W The central idea for constructing structural alignment is to select some reliable and compatible conserved stems as the constraint for Clustal W. In more detail, we first remove some conserved stems with very low Signal-to-Noise. Then we remove some incompatible conserved stems. This is done by analyzing the relationship between two conserved stems. There are three cases for the relationship between two conserved stems.
1) 2) 3)
Two conserved stems are in tandem. One conserved stem is included by the other. Two conserved stems are overlapped.
It is intractable when one stem from a sequence is in the case of 1). In this case, these two conserved stems are incompatible because we do not exactly know which conserved stem should be selected to include the stem of the sequence. For simplicity, we here remove the conserved stem with lower Signal-to-Noise. As for 2) and 3), it is easily to be disposed because no stems are incompatible with any conserved stem. In these two cases, for any stem in the sequence, it either belongs to only one conserved stem, or belongs to both of them at the same time. After removing unreliable or incompatible conserved stems, we construct an initial alignment on the basis of remaining conserved stems. This is done by aligning sequences according to the alignment of the conserved stems. Then, we align other fragments of the sequences using Clustal W. As shown in Figure 3, (b) is for
214
X. Fang et al.
constructing the initial alignment, (c) is for aligning the fragments which are not included by the conserved stems, and (d) is the final alignment.
Seq1 = A A A C G C G U C C Seq1 = A A U G G G C C C G C C Seq1 = A A C U U U G G G A C C (a) AA _ AA U AA C
…
AC GCGU GGGCCC UUUGGG
(b) _CC GCC AC C
(c)
AA _ A C G C G U _ C C AA U G G G C C C G C C AA C U U U G G GA C C
(d)
Fig. 3. The construction of structural alignment. (a) is the sequence set, (b) is the conserved stems detected by our method, (c) is the alignment built by Clustal W, and (d) is the final structural alignment by incorporating (b) with (c).
3 Results 3.1 Test Data Sets and Test Approach We build the test data sets on the basis of Rfam 8.0. In more detail, we select 107 ncRNA families with sequence identity ranging from 40% to 99%. We download the corresponding alignment for each family and then respectively extract three, four and five different sequences from each alignment. For example, we can obtain 10 (i.e. C 35 ) three-sequence members, 5 (i.e. C 54 ) four-sequence members, and 1 (i.e. C 55 ) five-sequence member in total from one family of 5 sequences. In this way, we construct one three-sequence data set, one four-sequence data set and one fivesequence data set based on Rfam 8.0. To test the performance of our method and compare it with Clustal W, we evaluate the alignments generated by both methods using RNAalifold [5], which is a popular program for predicting RNA secondary structure. The reason for using RNAalifold is that we can not directly acquire the structure information from the alignment. For each sequence set for test, we first generate two different alignments respectively using our method and Clustal W. Then we use these two alignments as well as the original alignment downloaded from Rfam 8.0 as input for RNAalifold. And then we evaluate three different outputs of RNAalifold by computing the sensitivity and the true positive rate of predicted base pairs. Actually, we compute the sensitivity as the number of true positives divided by the sum of true positives + false negatives, and the true positive rate as the number of true positives divided by the sum of true positives + false positives. To compute the sensitivity and the true positive rate, we
Constructing Structural Alignment of RNA Sequences
215
also downloaded the consensus secondary structure annotated by Rfam 8.0 for each alignment. Specifically, Rfam 8.0 contains consensus secondary structures for each alignment either taken from a previously published study or predicted using some covariance-based methods. To make the test data set more reasonable, we remove some seed alignments with only predicted secondary structures. 3.2 Tests for Multiple RNA Sequences We test our method on data sets constructed in Section 3.1. The results are compared with Clustal W, using the parameters suggested by the authors of [8], and are reported in Table 1, Table 2 and Table 3. The second and third columns in the tables are the results for original alignments of Rfam and the last two columns are the results for our method. As shown in the tables Table 1-3, our method exhibits remarkable higher both sensitivity and true positive rate than Clustal W. As for the original alignments of Rfam, our method exhibits comparable accuracy for the tests with Id > 90% and a little lower average accuracy for all tests. On the whole, our method exhibits marked better performance than Clustal W especially for the alignments with Id < 80%. One interesting thing about the tests is that we can’t get any valuable results with Clustal W for all the tests with Id < 70%. We tried to change the parameters of both Clustal W and RNAalifold but still got nothing. Another important finding about the tests is that our method has nearly equivalent accuracy with Clustal W for the tests with Id > 90%. But both our method and Clustal W exhibits lower accuracy than the original alignments of Rfam. Table 1. Sensitivity and true positive rate on three-sequence data set (Id, percentage identity; Se, sensitivity; Tpr, true positive rate) Id (%) <60 60-70 70-80 80-90 90-100 Total
Se.Rfam (%) 61.78 72.11 55.99 56.28 40.08 57.25
Tpr.Rfam (%) 64.57 64.66 43.12 40.91 51.43 52.94
Se.Clustal W (%) 0 0 8.24 51.27 39.9 19.88
Tpr.Clustal W (%) 0 0 7.78 36.81 49.72 18.86
Se. (%) 50.65 56.11 54.17 54.13 39.93 51.00
Tpr. (%) 54.13 48.85 38.47 38.88 50.11 46.09
Table 2. Sensitivity and true positive rate on four-sequence data set (Id, percentage identity; Se, sensitivity; Tpr, true positive rate) Id (%) <60 60-70 70-80 80-90 90-100 Total
Se.Rfam (%) 59.04 73.99 61.39 52.95 48.82 59.24
Tpr.Rfam (%) 65.66 55.24 41.06 39.03 43.82 48.96
Se.Clustal W (%) 0 0 8.24 50.66 47.70 21.32
Tpr.Clustal W (%) 0 0 7.78 37.71 41.21 17.34
Se. (%) 49.91 58.90 57.12 51.13 47.99 53.01
Tpr. (%) 51.22 45.69 38.61 38.74 42.18 43.29
216
X. Fang et al.
Table 3. Sensitivity and true positive rate on five-sequence data set (Id, percentage identity; Se, sensitivity; Tpr, true positive rate) Id (%) <60 60-70 70-80 80-90 90-100 Total
Se.Rfam (%) 60.87 75.98 61.99 51.43 48.61 59.78
Tpr.Rfam (%) 69.10 72.78 40.01 45.68 42.26 53.97
Se.Clustal W (%) 0 0 10.10 49.38 47.93 21.74
Tpr.Clustal W (%) 0 0 9.32 44.72 39.63 19.00
Se. (%) 51.16 68.32 55.89 50.82 48.07 54.85
Tpr. (%) 49.15 59.98 38.99 44.79 41.28 46.84
4 Discussion In this paper, we present and evaluate a new method for constructing structural alignment of RNA sequences. Our method improves Clustal W by detecting and assessing conserved stems across multiple sequences. The valuable idea in our method is incorporating some useful structure information (e.g. the stem) into sequence alignment. The fact that our method takes RNA sequences with unknown structures as input makes it suitable for practical application. Furthermore, the approach for detecting possible stems using the position matrix makes our method greatly differ from other methods. Finally, the algorithm for assessing conserved stems using the Signal-to-Noise and SCFG makes our method robust. Despite the limited amount of data, we have shown in the experiments that our method can construct structural alignments with a much better performance than Clustal W. This should be the correct behavior since Clustal W does not consider any structure information when aligning the sequences. Actually, it is disadvantageous for Clustal W to align the RNA sequences with not conserved primary sequence but conserved structure. Another reason is possibly because the RNAalifold program is vulnerable to alignment errors and thus can’t detect all possible structures in the alignment. But the same issue is still in the tests for our method. In short, we conclude that our method performs much better than Clustal W when constructing structural alignment of RNA sequences. In future work, improving the performance of our method will involve four ways. One potential improvement could be changing the algorithm for generating randomized alignment. In this paper, we accomplish this by permuting the columns of each sequence. Another alterative approach for this could be directly permuting the columns of the alignment and controlling the permutation process using the profile SCFG [17]. Another way to improve our method might be computing the Signal-toNoise by incorporating the free energy with the number of base pairs. Third, the relationship of multiple conserved stems should be analyzed in more detail. In this paper, we ignored some complicated situation and thus possibly reduced the performance. Finally, more data sets and more existing alignment methods should be selected to benchmark the method. Acknowledgments. This work has been supported by the National Natural Science Foundation of China under Grant No. 60673018.
Constructing Structural Alignment of RNA Sequences
217
References 1. Eddy, S.R.: Non-coding RNA genes and modern RNA world. Nat. Rev. Genet. 2, 919–929 (2001) 2. Huttenhofer, A., Schattner, P., Polacek, N.: Non-coding RNAs: hope or hype? TRENDS in Genetics 21, 289–297 (2005) 3. Pace, N.R., Thomas, B.C., Woese, C.R.: Probing RNA structure, function, and history by comparative analysis. In: Gesteland, R.F., Cech, T.R., Atkins, J.F. (eds.) The RNA World, 2nd edn., pp. 113–141. Cold Spring Harbor Laboratory Press, NY (1999) 4. Knudsen, B., Hein, J.: Pfold: RNA secondary structure prediction using stochastic contextfree grammars. Nucleic Acids Research 31, 3423–3428 (2003) 5. Hofacker, I., Fekete, M., Stadler, P.: Secondary structure prediction for aligned RNA sequences. Journal of Molecular Biology 319, 1059–1066 (2002) 6. Ruan, J., Stormo, G., Zhang, W.: An iterated loop matching approach to the prediction of RNA secondary structures with pseudoknots. Bioinformatics 20, 58–66 (2004) 7. Knight, R., et al.: BayesFold: rational 2 degrees folds that combine thermodynamic, covariation, and chemical data for aligned RNA sequences. RNA 10, 1323–1336 (2004) 8. Thompson, J., Higgins, D., Gibson, T.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice. Nucleic Acids Research 22, 4673–4680 (1994) 9. Notredame, C., Higgins, D., Heringa, J.: T-Coffee: A novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology 302, 205–217 (2000) 10. Sankoff, D.: Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM Journal on Applied Mathematics 45, 810–825 (1985) 11. Hofacker, I., Bernhart, S., Stadler, P.: Alignment of RNA base pairing probability matrices. Bioinformatics 20, 2222–2227 (2004) 12. Mathews, D., Turner, D.: Dynalign: An algorithm for finding the secondary structure common to two RNA sequences. Journal of Molecular Biology 317(2), 191–203 (2002) 13. Perriquet, O., Touzet, H., Dauchet, M.: Finding the common structure shared by two homologous RNAs. Bioinformatics 19, 108–116 (2003) 14. Ji, Y., Xu, X., Stormo, G.: A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. Bioinformatics 20, 591–602 (2004) 15. Bafna, V., Tang, H., Zhang, S.: Consensus folding of unaligned RNA sequences revisited. Journal of computational biology 13, 283–295 (2006) 16. Tabei, Y., et al.: SCARNA: fast and accurate structural alignment of RNA sequences by matching fixed-length stem fragments. Bioinformatics 22, 1723–1729 (2006) 17. Durbin, R., et al.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University press, Cambridge (1998) 18. Sam, G.J., Alex, B., et al.: Rfam: an RNA family database. Nucleic Acids Research 31, 439–441 (2003) 19. Fang, X., et al.: The detection and assessment of possible RNA secondary structure using multiple sequence alignment. In: The 22nd Annual ACM Symposium on Applied Computing, Seoul, Korea (March 11-15, 2007)
Iris Verification Using Wavelet Moments and Neural Network Zhiqiang Ma1, Miao Qi1,2, Haifeng Kang1,2, Shuhua Wang1,2, and Jun Kong1,2 1
Computer School, Northeast Normal University, Changchun, Jilin Province, China 2 Key Laboratory for Applied Statistics of MOE, China {mazq,qim801,kongjun}@nenu.edu.cn
Abstract. In this paper, a novel and robust verification approach using iris features is presented. Contrasting with conventional approaches, only two iris subregions instead of entire iris, where are nearly not occluded by useless parts such as eyelash and eyelid, are segmented for verification. Gabor filtering and wavelet moments methods are used to extract the iris texture features. In the verification stage, the principal component analysis (PCA) technique and oneclass-one-network (Back-Propagation Neural Network (BPNN)) classification structure are employed for dimensionality reduction and classification, respectively. The experimental results show that the correct verification rate can reach 98.65% using our proposed approach.
1 Introduction Biometrics is a field of knowledge that concerned with the unique, stable and reliable personal characteristics. Many biometric verification techniques dealing with various human physiological features such as finger-print, hand-print, face and retina pattern have been widely researched and used to the security access control systems. A human iris has a unique structure given by pigmentation spots, furrows and other tiny features that are stable throughout the life and complex enough to be used as a biometric feature. Furthermore, iris is an internal organ as well as externally visible, which makes the personal verification systems non-invasive to users. There have been some methods for iris feature extraction which is a key step for verification. For example, Daugman [1] used multi-scale quadrature wavelets to extract texture phase structure information of the iris to generate a 2048-bit iris code. Boles and Boashash [2] calculated a zero-crossing representation of 1D wavelet transform at various resolution levels of a concentric circle on an iris image to extract the texture features. Gaussian-Hermite Moments are employed to characterize the iris features in literature [3]. Balaji et al. applied the ratio of the limbus diameter and the pupil diameter for first stage verification, and use LoG filter to extract hierarchical texture features for final confirmation [4]. Byungjun Son et al. presented one of the major discriminative learning methods, namely, Direct Linear Discriminant Analysis (DLDA) and applied the multi-resolution wavelet transform to extract the unique feature from the acquired iris image and to decrease the complexity of computation K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 218–226, 2007. © Springer-Verlag Berlin Heidelberg 2007
Iris Verification using Wavelet Moments and Neural Network
219
when using DLDA [5]. In our proposed approach, Gabor filter firstly is used to extract the texture of iris images. Then, the wavelet moments method is used extract the features of filtered image. Finally, PCA and BPNN techniques are employed for dimensionality reduction and verification. The rest of this paper is organized as follows. Section 2 introduces the location producer of preprocessing. Section 3 briefly describes the feature extraction methods. The verification process is illuminated in Section 4. Section 5 demonstrates the experimental results to verify the efficiency of the proposed approach. Finally, conclusions are given in Section 6.
2 Preprocessing Image preprocessing is usually the first and essential step in pattern recognition. In our proposed approach, there are mainly two aspects including iris region of interest (ROI) localization and enhancement in the preprocessing module. To increase the verification accuracy and reliability, we compare the important features extracted from the same region in different iris images. The iris of human eye (shown in Fig. 1) is the annular part between the pupil (inner boundary) and sclera (outer boundary). Both the boundaries are taken as circles and concentric. A captured iris image contains not only iris texture region, but also contains a lot of useless parts such as pupil, eyelid and eyelash. Contrasting with most conventional method, we only segment two iris sub-regions (where are nearly not occluded by eyelash and eyelid) for verification. The procedure of segmenting and preprocessing the two iris sub-regions is described as following: 1. As seen in Fig. 1, the intensity of pupil is darker than the intensity of iris and scalar. Find a region with fixed size which has least sum of grey value and crop it. The selection of size is crucial as it should be common for all iris images and encircle entire pupil. Eyelash
Iris Eyelid Fig. 1. Original iris image
2. Binarize the cropped image with an appropriate threshold value. Morphological operations are applied to remove non-pupil regions. 3. Find the basic rectangle of the pupil region. The center of basic rectangle is regard as the center of pupil and the length of longer border is regard as the diameter of pupil. 4. The radius of outer circle (labeled by white broken line in Fig. 1) is two times of inner circle (labeled by white real line in Fig. 1). Iris from different people may be
220
Z. Ma et al.
captured in different size and even from the same eye due to the environmental factors such as distance variations. Therefore, we clockwise unwrap the iris ring (starting from the bottom) to a rectangular block image with a fixed size 48 × 360 shown in Fig. 2(a). 5. Extract two iris sub-regions. We use the texture information of two sub-regions that are only between 61 to 108 and 253 to 300 column, respectively, which are regard as ROIs with the size of 48 × 48 ( shown in Fig. 2(b)). 6. The intensity values of ROIs have low contrast, which don’t reflect the texture information clearly. In order to improve the contrast of the image, intensity transformation, top-hat and bottom-hat transformation [4] are used for contrast enhancement. The enhanced images are shown in Fig. 2(c), from which we can see that the finer texture characteristics of the ROIs become clearer than those in Fig. 2(b).
(a)
(b)
(c)
Fig. 2. (a) Normalized partial iris image. (b) Two ROIs of an iris image. (c) Enhanced ROIs.
3 Features Extraction After the normalized ROIs are obtained from the preprocessing stage, we extract important features from the ROI for authentication task. Gabor filtering and wavelet moments methods are employed for feature extraction in our iris authentication system. 3.1 Gabor Filtering Gabor filter is wildly used to feature extraction [6, 7], which has been already demonstrated to be a powerful tool in texture analysis. The main advantage of traditional Gabor filters (depicted in [6] is the detection of texture direction. Generally, the direction information of iris image seems not significant. Thus, traditional Gabor filters are not suitable for the texture extraction of iris images. Therefore, the circular Gabor filter (detailed in [8] is used form used in our work, which is defined as:
G ( x, y , F ,σ ) =
1 2 πσ
2
{
⎧ x2 + y2 ⎫ exp ⎨ − ⎬ 2σ 2 ⎭ ⎩
exp 2 π iF (
}
x + y ) , 2
2
(1)
Iris Verification using Wavelet Moments and Neural Network
(a1)
(b1)
(c1)
(a2)
(b2)
(c2)[
221
Fig. 3. (a1, a2) The normalized ROIs. (b1, b2) The enhanced ROIs. (c1, c2) The binarized ROIs after using Gabor filter
where i= − 1 , F is the frequency of the sinusoidal wave and σ is the standard deviation of the Gaussian envelope. The filtered image is employed by the real part. Then an appropriate threshold value is selected to binarize the filtered image. Fig. 3(c) shows results of the binarized images. 3.2 Cubic B-Spline Wavelet Moments
The wavelet transform provides analysis functions that are obtained by dilation and translation of an image so that the image can be analyzed in multiple resolutions. The characteristic of wavelet moments method is particularly suitable for extracting local discriminative features of normalized images. Its translation, rotation and scale invariance promote itself as a widely used feature extraction approach [9]. The family of wavelet basis function is defined as:
ψ a,b (r ) =
1 a
ψ(
r −b ), a
(2)
where a is dilation and b is shifting parameters. The cubic B-spline in Gaussian approximation form is:
ψ β (r ) = n
4a n +1 2π (n + 1)
⎧⎪ (2r − 1) 2 ⎫⎪ ⎬, ⎪⎩ 2σ w2 (n + 1) ⎪⎭
σ w cos(2πf 0 (2r − 1)) exp⎨−
(3)
where n =3, a = 0.697066, f 0 = 0.409177, and σ w2 = 0.561145. Since the size r of an image is always restricted in a domain [0, 1], let both parameters be set to 0.5, and the domains for m and n can be restricted as follows: a = 0.5m , m = 0, 1, ..., M
, b = n ⋅ 0.5.0.5m , n = 0, 1, ..., 2m +1 .
(4)
Then the wavelet defined along a radial axis in any orientation can be rewritten as:
ψ mβ , n (r ) = 2m / 2ψ β (2 m r − 0.5n). n
n
(5)
222
Z. Ma et al.
And the cubic B-spline Wavelet moments (WMs) are defined as:
Wm, n, q = ∫∫ f (r ,θ )ψ mβ , n (r )e − jqθ rdrdθ . n
(6)
If N is the number of pixels along each axis of the image, then the cubic B-spline WMs for a digital image f (r , θ ) can be defined as:
W m, n, q =
∑∑ x
r =
x + y 2
f ( x , y )ψ
β
n
m ,n
( r )e − jq θ Δ x Δ y , (7)
y 2
≤ 1,
θ = arctan( y x )
The cubic B-spline wavelet is near-optimal in terms of its space-frequency localization, in the sense that its function takes advantage of the wavelet inherent property of multi-resolution analysis.
4 Verification In this paper, we study the 68 dimensions feature vector (computed by wavelet moments with m=0, 1, 2) for each ROI. Thus, total 136 (68 × 2) dimension feature values are computed from every iris image. To obtain the main information and accelerate the classification speed, popular PCA technique (detailed in literature [10]) is first used for dimensionality reduction and then BPNN is employed for classification. BPNN is one of the simplest and most general methods for supervised training of multilayer neural networks, which has been widely utilized in the field of pattern recognition. We use this well-known approach to perform the verification task. The architecture of our proposed network is designed to be a three-layer-based network which includes an input, a hidden and an output layer as depicted in Fig. 4. Theselayers are interconnected by modifiable weights, which are represented by links
Output Output layer
… … v1 v2 v3
Hidden layer Input layer
v28 v29 v30 Fig. 4. The architecture of BP neural network
Iris Verification using Wavelet Moments and Neural Network
223
between layers. In training stage of BPNN, M image samples of a specific individual X called positive samples and N image samples of other K persons called negative samples are collected to train the BPNN. In order to reduce the training computation time and the size of neural network, each neural network corresponds to only one iris owner. For practical systems, this approach offers another significant advantage: if there is a new person added to database, we only have to train a new BP neural network and needn’t to retain a very large neural network.
5 Experimental Results In our experiments, the image database is come from CASIA Iris Database, which contains 756 iris images of 108 individuals (7 images per individual). Some samples
Fig. 5. Iris samples from the CASIA Iris Database
from the CASIA Iris Database are shown in Fig. 5. The size of every image is 320 × 280 (pixels). The authentication system consists of enrollment and verification stages. In the enrollment stage, three iris images of am individual are collected as the training sample. These samples should be processed by preprocessing and feature extraction modules to generate the matching templates. In the verification stage, a query sample is also processed by preprocessing and feature extraction modules, and then is matched with the templates to decide whether it is a genuine sample or not. The feature vectors of length 136 are projected to a vector of length 30 using PCA experimentally. The results obtained in this paper are evaluated in term of verification rate which is investigated using false rejection rate (FRR) and false acceptation rate (FAR), which are variable depending on the threshold value t set in the output layer of BPNN. The results with the various threshold t and false rates are shown in Fig. 6. The lower the threshold of t, the higher is the probability of accepting the imposter persons. Similarly, the higher the threshold of t, the higher is the probability of rejecting the authentic persons. The system performance measurement is obtained from FAR and FRR which is called correct verification rate (CVR) and calculated as follow:
CVR = (1 − FAR − FRR ) × 100%
(8)
224
Z. Ma et al.
From the results in Fig. 6, the CVR can reach 98.65% obtained by our proposed method, where FAR=0.62%, FRR=0.73% and t=0.83. Comparing with the current existing techniques for iris recognition and classification, our approach employs Gabor filter to extract the texture information and wavelet moments method to extract texture features. PCA technique and BPNN are used for dimensionality reduction and classification, respectively. Table 1 summarizes the results generated by our approach and the other techniques.
Fig. 6. The distributions of FAR and FRR Table 1. Performance comparisons of several methods for iris verification Paper reference [11] [12] [13] [14] [15] [16] [17] Proposed
Accurate rate (%) 100 99.43 99.19 99.05 97.90 95.45 94.91 98.65
6 Conclusions An iris verification system is designed to authenticate the identity of an individual based on biometric iris features. In our experiments, two iris sub-regions are segmented instead of entire iris region, where are nearly not occluded by useless parts such as eyelash and eyelid, which also result in lower computational demands. Gabor filter and wavelet moments methods are employed for feature extraction. Popular PCA technology is used for dimensionality reduction. The samples are verified by the BPNN algorithms. The experimental results demonstrated that our proposed approach
Iris Verification using Wavelet Moments and Neural Network
225
is reliable and effective. Synchronously, we gave some conclusions from researching the experimental results: 1. Wavelet moments methods based on statistic is very suitable for iris authentication task. How many feature values should be computed is an important issue. 2. The CVR is effect directly by the dimension of reduced feature vector taken order with PCA. 3. Failure verification occurred in some irises. The main reason of the failure verification is the severe occlusion by eyelashes or eyelids. The computations were carried out by the software MATLAB 7.0 using the efficient algorithms mentioned in the text of this paper. Although the experimental results demonstrated that the proposed approaches are feasible, we will do more experimentation in a bigger iris database. Novel filters for extracting the texture of iris image and feature extraction methods should be proposed for better recognition performance in our future work. Acknowledgments. This work is supported by science foundation for young teachers of Northeast Normal University, No. 20061002, China.
References 1. Daugman, J.: High Confidence Visual Recognition of Persons by a Test of Statistical Independence. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 1148– 1161 (1993) 2. Boles, W., Boashansh, B.: A human Identification Technique Using Images of the Iris and Wavelet Transform. IEEE Trans. Signal Processing 46(4), 1185–1188 (1998) 3. Ma, L., Tan, T., Wang, Y., Zhang, D.: Local intensity variation analysis for iris recognition. Pattern Recognition 37, 1287–1298 (2004) 4. Ganeshan, B., Theckedath, D., Young, R., Chatwin, C.: Boimetric iris recognition system using a fast and robust iris location and alignment procedure. Optics and Lasers in Engineering 44, 1–24 (2006) 5. Son, B., Won, H., Kee, G., Lee, Y.: DISCTIMINANT IRIS FEATURE AND SUPPORT VECTOR MACHINES FOR IRIS RECOGNITION. ICIP, 865–868 (2004) 6. Kong, W.K., Zhang, D., Li, W.: Palmprint feature extraction using 2-D Gabor filters. Pattern Recognition 36, 2339–2347 (2003) 7. Sanchez-Avila, C., Sanchez-Reillo, R.: Two different approaches for iris recognition using Gabor filters and multiscale zero-crossing representation. Pattern Recognition 38, 231–240 (2005) 8. Zhang, J., Tan, T.: LiMa: Invariant Texture Segmentation Via Circular Gabor Filters 9. Pan, H., Xia, L.Z.: Exact and fast algorithm for two-dimensional image wavelet moments via the projection transform. Pattern Recognition 38, 395–402 (2005) 10. Kumar, A., Zhang, D.: Personal authentication using multiple palmprint representation. Pattern Recognition 38, 1695–1704 (2005) 11. Daugman, J.G.: Biometric Personal Identification System Based on Iris Analysis, U.S. Patent No. 5, 291, 560 (1994) 12. Ma, L., Tan, T., Wang, Y., Zhang, D.: Personal identification Based on Iris Texture Analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 1519–1533 (2003)
226
Z. Ma et al.
13. Ma, L., Wang, Y., Tan, T.: Iris recognition using circular symmetric filters. In: Proceedings of the 16th International Conference on Pattern Recognition, pp. 414–417 (2002) 14. Dobes, M., Machala, L., Tichavsky, P., Pospisil, J.: Human eye iris recognition using the mutual information. International Journal for Light and Electron Optics 9, 399–404 (2004) 15. Liam, L.W., Chekima, A., Fan, L.Ch., Dargham, J.A.: Iris recognition suing selforganizing neural network. In: Proc. Student Conference on Research and Development, Shah Alam, Malaysia, pp.169–172 (2002) 16. Sanchez-Avila, C., Sanchez-Reillo, R., Martin-Roche, D.: Iris-based biometric recognition using dyadic wavelet transform. IEEE Aerosp. and Electron. Syst. Mag. 17(10), 3–6 (2002) 17. Ma, L., Wang, Y., Tan, T.: Iris recognition based on multichannel gabor filtering. In: Proceedings of the Fifth Asian Conference on Computer Vision, pp. 279–283 (2002)
Comprehensive Fuzzy Evaluation Model for Body Physical Exercise Risk Yizhi Wu1, Yongsheng Ding1,2,*, and Hongan Xu3 1
College of Information Sciences and Technology, Donghua University, 201620 Shanghai, China {yz_wu,ysding}@dhu.edu.cn 2 Engineering Research Center of Digitized Textile & Fashion Technology, Ministry of Education, Donghua University, 201620 Shanghai, China 3 College of Information Sciences and Technology, East China Normal University, 200062 Shanghai, China
[email protected]
Abstract. It is very important and difficult to determine whether the person who is undertaking physical exercise is safe. A unique approach based on both analytic hierarchy process (AHP) and fuzzy comprehensive evaluation (FCE) is presented to evaluate exercise risk. First, a new evaluation model combining the above two methods, AHP-FCE, is established by applying the fuzzy mathematics into hierarchical assessment. Then, various physical exercises relevant factors are analyzed and represented. In addition, steps of the AHP-FCE based physical exercise evaluation are set up. Finally, an actual calculation example is used to verify the feasibility of the method.
1 Introduction Human body is a complex system. Proper exercise or sport is beneficial to people’s health [1-2], but, excessive and unsuitable exercises may induce serious results, such as fatigue, disease deterioration and even sudden death [3]. The level of health risk is different for different person and in different circumstances. Thus it is necessary to do risk evaluation to prevent harmful results when people do physical training or take up exercises. There have been some researches in studying the effect of exercise to human body and in exercise prescription to people with various diseases [3-5], but there are rare comprehensive models for health risk evaluation pertaining to sports and exercises. There are great challenges to set up comprehensive and systematic exercise risk analysis model. Firstly, the risk of exercise is influenced by so many factors that it is very difficult to synthesize them into a judgment in a common way. Secondly, it is difficult to quantify the health level of a person, the seriousness degree of diseases, the effect of sports, etc, therefore vagueness is introduced. A number of systematic models have been proposed for use in the risk evaluation process. These methods can be classified into two overall categories [6]: 1) classical K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 227–235, 2007. © Springer-Verlag Berlin Heidelberg 2007
228
Y.Wu, Y. Ding, and H. Xu
models (i.e., probabilistic analysis); and 2) conceptual models (i.e., fuzzy set analysis). Examples of classical models include Monte Carlo simulation and influence diagrams. Probabilistic models suffer from two major limitations: 1) Some of these models require detailed quantitative information which is not normally available in the real application world. 2) The applicability of such models to real risk analysis is limited. This is mainly due to the fact that many of the decision problems are imprecise, ill-defined, and vague in nature. Such characteristics are mostly subjective in nature while classical models cannot handle subjectivity. Typical example of conceptual models is the analytic hierarchy process (AHP) [7] and the fuzzy comprehensive evaluation (FCE) [8]. The AHP developed by Saaty is a hierarchical and flexible decision analysis methodology. The FCE is a fuzzy logic framework that provides an appropriate method for representing the fuzzy relationship between factors and the risk evaluation remarks. In this paper, firstly, AHP-FCE based risk evaluation model is proposed. Then, sources of risks of people doing exercises are analyzed and steps of AHP-FCE based physical exercise risk evaluation are set up. Finally, an actual calculation example is given.
2 AHP-FCE Based Comprehensive Evaluation Model In this section, AHP-FCE based model, in which FCE is mainly used at every level of AHP to get composite risk assessment considering both the priorities and fuzzy decisive role of the factors, is set up to deal with the complexity and vagueness in exercise risk analysis. 2.1 Hierarchical Structure of the Risk Evaluation Problem Formulating the risk evaluation problem in a hierarchical structure is the first and probably the most important step. In a typical hierarchy, the top level reflects the overall objective of the risk evaluation problem. The factors affecting the risk are represented in intermediate levels and grouped in cluster. The lowest level comprises the fundamental and detailed sub factors. O F1 F11
F12
F2 F13
F21
F22
F3 F23
Fig. 1. The AHP hierarchical structure
F31
F32
F33
Comprehensive Fuzzy Evaluation Model for Body Physical Exercise Risk
229
2.2 The Relative Weights of the Subfactors Once the hierarchy has been constructed, the relative weights of the elements relating to the same subject of each level must be determined. Prioritization procedure is started to determine the relative importance, namely comparison matrix, of the factors in each level of the hierarchy. Sub factors of the same factor at next high level are pairwise compared with respect to their importance in evaluating the subject under consideration. The descriptive preferences between every two factors would be translated into 9 scale indicated by absolute numbers 1 to 9, where the larger the number, the more important the first factor. The relative weights of the elements of each level with respect to a subject in the adjacent upper level, represented by A={a1,a2,…,am} (0≤ai≤1), are computed as the components of the normalized eigenvector associated with the largest eigenvalue of their comparison matrix. 2.3 Fuzzy Comprehensive Evaluations in Each Level After setting up the laying structure and computed the weights of subfactors, FCE is used to do the evaluation in each level of the structure. Since an important issue in the risk analysis is handling imprecise or incomplete human expertise and knowledge the evaluation involves, FCE is used here to deal with the vagueness of risk factor assessment better. When evaluating a subject, let U={u1,u2,…,um} the set of evaluation factors of FCE, and V={v1,v2,…,vn} is the set of evaluation remarks. Let A={a1,a2,…,am}(0≤ai≤1), acquired in AHP, is the relative weights of the elements of factor set U respect to a subject. Let B={b1,b2,…,bn}(0≤bj≤1) is a fuzzy subset on V and B is the membership degree of the remark vj. In fact B is measures of the possibilities of various remarks in the remark reference set V. FCE can be implemented by a fuzzy transformation: B=A○R.
∈
(1)
Where R is a fuzzy relation on U×V. μR(ui,vj)= rij(i=1,2,…,m;j=1,2,…,n); rij [0,1] is the membership degree of the subject to remark vj from the viewpoint of factor ui. R = (rij)m×n is a fuzzy relation matrix that is called an evaluation matrix of FCE. In order to obtain the fuzzy matrix R, suitable membership functions of different evaluation factors to risk remarks are used according to the characteristic of the factors. When the vector A and fuzzy relation matrix R are known, FCE can be fulfilled by Eq. (1) and also may be expressed as ⎛ r11 ⎜ r (b1 ,b 2 ,...,bn ) = (a1 ,a2 ,...,am ) o ⎜⎜ 21 M ⎜ ⎜r ⎝ m1
Where bj= min(1,
∑
m
i =1
(ai ⋅ rij )) (j=1,2,…,n),
r12 r22 M rm2
L r1n ⎞ ⎟ L r2n ⎟ . K M ⎟ ⎟ L rmn ⎟⎠
(2)
230
Y.Wu, Y. Ding, and H. Xu
Here, the composition ○ can be obtained depending on the mathematical model M(⋅, ⊕), in which, “⋅” is the operation of the ordinary real multiplication and “⊕” is the operation of the bounded sum. 2.4 Overall Fuzzy Evaluation at Top Level The composite evaluation of the risk remarks are then determined by aggregating the results through the hierarchy. This is done by following a path from the bottom of the hierarchy to each subject at the above level and multiplying the weights vector by the fuzzy relation matrix along each segment of the path. The outcome of this aggregation is a normalized vector of the overall weights of the risk remarks. Let V={v1, v2,…, vn} is the set of evaluation remarks, then the normalized overall evaluation value is:
O = ∑i =1 vibi / ∑i =1 bi . n
n
(3)
We will follow the nearest principle to select the risk remarks with the nearest value of O as the result of the evaluation.
3 AHP-FCE Based Physical Activity Risk Evaluation In this section, the factors of health risk when people doing physical exercises are the first concern. Main risk factors are analyzed and classified. Further, the method of quantification of these factors is discussed. Finally, exercise risks are evaluated step by step with the illustration of an example. 3.1 The Factors of Physical Activity Risk and Fuzzy Assessment There are many sources of risks when people doing exercises. The proposed classification scheme is composed of three risk categories: (1) Body medical condition Most risks evolved in physical exercises are body medical condition related. Body medical condition can be further divided into three main sub factors: basic physical information, disease condition, and current physical status. People’s basic physical information (represented as Bas-inf below), such as age, sex, occupation, is a potential factor. Disease condition (Dis-con) is obviously an important exercise risk source for a patient. For example, the American Heart Association (AHA) committee grade the exercise recommendations for patients with heart disease on a scale of 1 (no restriction) to 5 (extreme limitation) [9]. Current physiological status (Phy-sta), including heart rate, blood pressure, respiration rate, is another important indications to whether the current exercise level is safe in real time monitor. In some study the physiological status is acquired by self assessment. In our system, various body vital signs are monitored in real time by physiological sensors and transferred wirelessly to the processing module.
Comprehensive Fuzzy Evaluation Model for Body Physical Exercise Risk
231
(2) Activity load The activity load can be measured by intensity, duration, and frequency. Intensity can be defined by maximum oxygen consumption (VO2max), heart rate, heart-rate reserve, oxygen uptake, metabolic equivalents, or perceived exertion [9]. The percentage of VO2max is equivalent to that of maximum heart rate, which we can figure out from ECG sensor. Usually the suitable activity load can be gotten straightforwardly from guideline and the exercise advice prescribed by the doctor [10]. (3) Environment condition Another potential risk, which is not frequently mentioned, is the environment condition. The common risks factors under this category are those related to air temperature, humidity, wind, noise etc [11]. Actually, only when air temperature is rather high does the effect of humidity on man's heat balance become important. Strong winds can produce unfavorable effects in cold air temperature and cause dangerous effects in very cold weather when below -10 . So, we recombine the factors and considering 3 environmental factors: temperature/humidity (T/H), temperature/wind(T/W) and noise. The assessment of each factor constitutes vague estimates rather than crisp values and we use fuzzy sets in fuzzy logic to evaluate these factors. Membership functions might take on any form, and here we use a simple linear membership function. The risk degree can be expressed as:
r=
0 .5 × (cur _ val − M ) + 0.5 . H −M
(4)
where cur-val, M and H is current, medium and maximum value of the item measured respectively and the membership value of M and H are 0.5 and 1. For example, considering a 45 year old woman patient with light degree cardiac disease (AHA scale 2), whose physical state evaluated is not very well. There are such exercise guideline that the normal safe dose of jogging is in terms of intensity (40–85% VO2max), duration (20–30 mins), and frequency (generally three to five times per week). According to the safe dose range given by the guideline, 62.5% VO2max (M) is the degree of “medium safe” with a membership value 0.5. Then, the risk degree (r) can be calculated by Eq. (4) with the current value. So, the judgment of activity load sub factors for the patient doing jogging with 80% VO2max , 25 mins of duration, and five times per week, can be computed as (0.73,0.5,0.67). Using similar methods, the value of the environment factors ( T/H, T/W, Noise) is set to (0.6, 0.2, 0.5). Using medical guide lines and judgments of the medical experts, estimated risk degree values of this patient’s medical condition sub factors (Dis-con, Phy-con, Bas-inf) may be (0.6, 0.6, 0.3). 3.2 Steps of Physical Exercise Risk Evaluation In this section, the steps followed by applying the AHP-FCE to assess the risk of a man doing exercise are discussed. In addition, an experiment is conducted to testify the feasibility of the model, in which, real time exercise related information is collected and applied into the model to evaluate potential risk. Physiological data acquisition systems PowerLab 8/30 from ADInstruments (8-channel data recording unit with single-channel Bio Amp, MLS360 ECG Analysis Module, temperature sensors,
232
Y.Wu, Y. Ding, and H. Xu
Sphygmomanometer, Biopotential Accessory Kit) is used to record the various exercise physiological data such as heart rate, blood pressure, body temperature, respiration rate, etc. Furthermore, heart rate is used to measure the intensity of exercise. Meanwhile environmental data including temperature, humidity and noise is also recorded. Step I: Structure the factors of the exercise risks into a hierarchy. Fig. 2 is a proposed classification scheme that shows the different sources of risk. Risk Level of Physical Activity Medical Condition Dis-con
Phy-sta
Activity Load
Bas-inf
Intens.
Dur.
Environmental Condition Freq.
T/H
T/W
Fig. 2. The physical exercise risk evaluation hierarchical structure
Ⅱ
Step : Develop the relative weights of the various factors. The importance of the factors and subfactors is determined next. For illustration, a 3 × 3 judgment matrix and weights of sub factors of body medical condition (Dis-con, Phy-sta, Bas-inf) is formed as shown in Table 1. Table 1. Judgments matrix and weights of factors With Respect to Goal Discon Phy-sta Bas-inf
Pairwise Comparing Matrix Dis-con Phy-sta Bas-inf 1 1/2 3 2 1 4 1/2 1/3 1
Relative Importance 0.311 0.539 0.150
Ⅲ
Step : Fuzzy comprehensive evaluations in each level. Firstly fuzzy relation R should be obtained from the membership functions of various evaluation factors to the evaluation remarks. Let V={v1, v2, v3, v4, v5}={very dangerous, moderately dangerous, medium, moderately safe, very safe} is the set of evaluation remarks, and fuzzy value of V is {0.9, 0.7, 0.5, 0.3, 0.1}. For the convenience of calculation, Kth parabolic functions are used to calculate the degree of membership in Eq. (2), where K is set to 1.2: (1) v1 membership function:
⎧0, x < 0.7, ⎪ 1.2 ⎪⎛ x − 0.7 ⎞ F1 ( x) = ⎨⎜ ⎟ ,0.7 ≤ x ≤ 0.9, . ⎪⎝ 0.2 ⎠ ⎪1, x > 0.9 ⎩
(5)
Comprehensive Fuzzy Evaluation Model for Body Physical Exercise Risk
233
(2) v2, v3, v4 membership function:
⎧0, x < 0.5, ⎪ 1.2 ⎪⎛ x − 0.5 ⎞ ,0.5 ≤ x ≤ 0.675, ⎜ ⎟ ⎪⎝ 0.175 ⎠ . ⎪ F2 ( x ) = ⎨1,0.675 ≤ x ≤ 0.725, ⎪ 1.2 ⎪⎛⎜ 0.9 − x ⎞⎟ ,0.725 ≤ x ≤ 0.9 ⎪⎝ 0.175 ⎠ ⎪ ⎩0, x ≥ 0.9 ⎧0, x < 0.3, ⎪ 1.2 ⎪⎛ x − 0.3 ⎞ ,0.3 ≤ x ≤ 0.475, ⎪⎜⎝ 0.175 ⎟⎠ . ⎪ F3 ( x ) = ⎨1,0.475 ≤ x ≤ 0.525, ⎪ 1.2 ⎪⎛⎜ 0.7 − x ⎞⎟ ,0.525 ≤ x ≤ 0.7 ⎪⎝ 0.175 ⎠ ⎪ ⎩0, x ≥ 0.7
⎧0, x < 0.1, ⎪ 1. 2 ⎪⎛ x − 0.1 ⎞ ,0.1 ≤ x ≤ 0.275, ⎪⎜⎝ 0.175 ⎟⎠ . ⎪ F4 ( x) = ⎨1,0.275 ≤ x ≤ 0.325, ⎪ 1.2 ⎪⎛⎜ 0.5 − x ⎞⎟ ,0.375 ≤ x ≤ 0.5 ⎪⎝ 0.175 ⎠ ⎪ ⎩0, x ≥ 0.5
(6)
(7)
(8)
(3) v5 membership function:
⎧1, x < 0.1, ⎪ 1 .2 ⎪⎛ 0.3 − x ⎞ F 5( x) = ⎨⎜ ⎟ ,0.1 ≤ x ≤ 0.3 . ⎪⎝ 0.2 ⎠ ⎪0, x > 0.3 ⎩
(9)
Table 2 shows a calculation illustration for the example we used above. The fuzzy values of factors have been calculated. The weight matrix of various subject have been gotten in step 2. We use the membership function above to compute the evaluation matrix of FCE, R.
Ⅳ
Step : Overall physical exercise risk remark evaluation. The composite weights of the risk remarks are then determined by aggregating the weights through the
234
Y.Wu, Y. Ding, and H. Xu
hierarchy. Using the Eq. (2) from bottom level to the top, we get the overall weights of exercise risk remark, B={0.02,0.5,0.4,0.1,0.01}. Then, the normalized overall evaluation value is computed by Eq. (3) to be: 0.6. The value is between the remark values of moderately danger and that of medium danger, so this person doing current exercise condition has a slight danger. The conclusion is consistent with the evaluation from the subject’s medical expert. Table 2. Evaluation matrix of human exercise risk calculation example R
Factor
Weights
Sub factor
Weights
Factor value
v1
Medical Condition
0.569
Dis-con
0.311
0.6
0.00
Phy-sta
0.539
0.6
0.00
Bas-inf
0.150
0.3
0.00
Intens.
0.557
0.73
0.10
Dur.
0.320
0.5
0.00
Freq.
0.123
0.67
0.00
T/H
0.623
0.6
0.00
T/W
0.239
0.2
0.00
Noise
0.137
0.5
0.00
0.334 Activity load
Environmental condition
0.097
v2 0.5 1 0.5 1 0.0 0 0.9 7 0.0 0 0.9 7 0.5 1 0.0 0 0.0 0
v3 0.5 1 0.5 1 0.0 0 0.0 0 1.0 0 0.1 2 0.5 1 0.0 0 1.0 0
v4 0.0 0 0.0 0 1.0 0 0.0 0 0.0 0 0.0 0 0.0 0 0.5 1 0.0 0
v5 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.44 0.00
4 Conclusions This is the first time to combine AHP and FCE to analysis and assess the risk level to people’s health when doing exercises. It is full of significant theoretical and practical meaning in healthcare monitoring. There are great advantages using these two techniques together. AHP deals with complex problem hierarchically and give a concrete method to acquire the comparison matrices. On the other hand, FCE takes into account vague and imprecise medical expert’s knowledge, patient information, exercise load and environment condition scientifically and express them concretely in mathematical form. Compared with other study in exercise risk research [3-5], mostly by testing or by field experiment, our comprehensive model can be implemented in wearable embedded system to monitor body’s current status, to assess the risk and to sound an alarm in time when needed. Of course, the theory and methodology presented in the paper need to be further studied and verified in practice. Acknowledgements. This work was supported in part by Program for New Century Excellent Talents in University from Ministry of Education of China (No. NCET-04415), the Cultivation Fund of the Key Scientific and Technical Innovation Project
Comprehensive Fuzzy Evaluation Model for Body Physical Exercise Risk
235
from Ministry of Education of China (No. 706024), International Science Cooperation Foundation of Shanghai (No. 061307041), and Specialized Research Fund for the Doctoral Program of Higher Education from Ministry of Education of China (No. 20060255006).
References 1. Jang, S.J., Park, S.R., Jang, Y.G., et al.: Automated Individual Prescription of Exercise with an XML-based Expert System. In: IEEE-EMBS, Shanghai, China, pp. 882–885 (2005) 2. Hara, M., Mori, M., Nishizumi, M.: Differences in Lifestyle-related Risk Factors for Death by Occupational Groups: A Prospective Study. Journal of Occupational Health 41, 137– 143 (1999) 3. Jouven, X., Empana, J.P., Schwartz, P.J., et al.: Heart rate profile during exercise as a predictor of sudden death. The new England journal of medicine 352, 1951–1958 (2005) 4. Yun-jian, Z., Ji-rao, W., Song-bo, Z.: The Application of HRV in the Healthy and Sports’ Field. Sichuan Sports Science 2, 47–49 (2004) 5. Singh, M.A.F.: Exercise comes of age: rationale and recommendations for a geriatric exercise prescription. J. Gerontol. A Biol. Sci. Med. Sci. 57, 262–282 (2002) 6. Kangary, R., Riggs, L.S.: Construction risk assessment by linguistics. IEEE Trans. Eng. Manag. 36, 126–131 (1989) 7. Saaty, T.L.: The Analytic Hierarcy Process. McGraw-Hill, New York (1980) 8. Feng, S., Xu, L.D.: Fuzzy Sets and Systems. 105, 1–12 (1999) 9. Speed, C.A., Shapiro, L.M.: Exercise prescription in cardiac disease. THE LANCET 356, 1208–1209 (2000) 10. Heyward, V.H.: Advanced fitness assessment & exercise prescription. Human Kinetics, 1– 6 (2006) 11. Donatelle, R.T., et al.: Access to Health, Benjamin Cummings, pp. 20–30 (1996)
The Effect of Map Information on Brain Activation During a Driving Task Tao Shang1, Shuoyu Wang2, and Shengnan Zhang1 1 School of Information Science and Engineering, Shenyang University of Technology No.58, Xinghuanan Street, Tiexi District, Shenyang, 110023, Liaoning Province, P.R. China
[email protected] 2 Department of Intelligent Mechanical System Engineering, Kochi University of Technology, 185 Miyanokuchi, Kami, Kochi 782-8502, Japan
[email protected]
Abstract. Until now, GPRS/GPS/GIS based on vehicle navigation and monitoring systems have been popularly developed to satisfy the demand for the intelligent transportation system (ITS). Such systems provide the large traffic convenience to drivers, but at the same time attach more burdens to drivers for learning about map information. Hence it is worth further verifying the negative effect of vehicle navigation and monitoring systems on drivers. Considering that human driving behavior is strongly relevant to cognitive characteristics, this study will address to the effect of vehicle navigation systems on drivers by means of measuring and analyzing the cognitive state inside brain. In this paper, a relatively new method of multi-channel nearinfrared spectroscopy (NIRS) was used to investigate the brain activation by independently manipulating the cognitive demand in the different cases of a driving simulator. Experimental results indicated that, compared with the case of no map information available, there is no more obvious priority of activation for left brain and right brain in the case of map information available. Meanwhile, there seems to be a complete activation for the prefrontal cortex of left and right brain, suggesting that GPRS/GPS/GIS based vehicle navigation systems may exhaust drivers more easily so as to bring about more danger than traffic convenience under driving environment.
1 Introduction The Intelligent Transport System (ITS) has been comprehensively paid attention to so far. Many modern technologies and products have been popularly developed to satisfy the demand for ITS [1-2]. As a kind of typical product, GPRS/GPS/GIS based on vehicle navigation and monitoring systems now have been applied on automobile for assisting safe and comfortable driving especially within the developed countries such as USA and Japan. Such systems provide the large traffic convenience to drivers, but at the same time attach more burdens to drivers for learning about map information. Hence it is worth further verifying the negative effect of vehicle navigation and monitoring systems on drivers. Considering that human driving
,
K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 236–245, 2007. © Springer-Verlag Berlin Heidelberg 2007
The Effect of Map Information on Brain Activation During a Driving Task
237
behavior is strongly relevant to cognitive characteristics, this study will address to the effect of vehicle navigation systems on drivers from the viewpoint of human cognitive characteristics. If such characteristics could be clarified, it will contribute to the disclosure of the negative effect of vehicle navigation systems on drivers and further the development of modern traffic tools. A few attempts involving human’s driving model [3-6] have been reported so far. However, most of those researches focused on external modeling for driving behavior and remained in lower level of human cognition process [3-5]. Comparatively, the literature [6] adopted predictive method to explore cognitive process of driving from the viewpoint of vision model, but it was difficult to verify the resulting model due to the limitation of owning measure device. Now with the rapid improvement of neurophysiology and electronic technology, some advanced measure devices are developed and the access to finding the internal signal of brain becomes possible. For example, multi-channel near-infrared spectroscopy (NIRS) is a relatively new method to investigate the brain activation, based on changes in oxygenated haemoglobin (O2Hb) and deoxygenated haemoglobin (HHb). Recently, it has been shown that NIRS seems to be able to detect even small changes in O2Hb and HHb concentration due to cognitive demands[7]. With respect to higher cognitive functions, NIRS has been successfully used to assess prefrontal brain activation during various tasks[8][9]. Based on these positive results and on the fact that NIRS is relatively easy to apply, this study will adopt the changes in O2Hb and HHb concentrations of the cerebral cortex to analyze human cognitive characteristics during a driving task. In order to investigate the negative effect of vehicle navigation systems on drivers from the viewpoint of human cognitive characteristics, here, we shall not only construct a driving simulator to induce human’s adaptive driving action, but also measure the changes in O2Hb and HHb concentrations of the cerebral cortex under the different environments of no map available and map available, respectively. The remaining part of this paper is organized as follows: in the section 2, the introduction to experimental system, including a developed driving simulator and used spectrometer. In the section 3, the experimental procedure is proposed. In the section 4, the experimental result and analysis is summarized. The paper finishes with a conclusion in the section 5.
2 Experimental System During the driving process, drivers need to avoid obstacle and arrive at a goal. As a result, driving behavior usually involves huge danger for human life. Considering the minimized economic damage and maximized safe guarantee, alternatively, a driving simulator was developed by using virtual reality technology. Not only driving behavior data can be acquired for further analysis, but also the limit state of human driving can be measured, which is the most distinctive feature compared with real driving. Here, we used the driving simulator as visual stimulus source to elicit a specific cerebral activation pattern. Besides, the measure device of brain activation is also necessary. Near-infrared spectroscopy (NIRS) is a non-invasive technique to measure concentration changes of oxygenated (O2Hb) and deoxygenated hemoglobin (HHb). With respect to higher
238
T. Shang, S. Wang, and S. Zhang
cognitive functions, NIRS has been adopted in many research [7-9], however, no specific NIRS activation paradigm has been reported for the measurement of frontal regions during a driving task. 2.1 Driving Simulator A driving simulator was developed just as shown in Figure 1. Virtual driving environment is implemented on the 17-inch LCD (Resolution 1280×1024). Keyboard is mounted as interaction control device for the driving direction and speed. The specification for computing environment is described as follows: Pentium4-2.66GHz CPU, 512MB memory, windows XP Professional, and the program developed by Visual C++ 6.0 and OpenGL. Refresh time is 100ms for animation.
(a)Driving scene
(b) Keyboard control
(c) Reference route (circle point denotes starting point, arrow denotes end point) Fig. 1. Driving simulator
The Effect of Map Information on Brain Activation During a Driving Task
239
Map information was designed on the right-bottom side of the driving simulator, just as shown in Figure 1-(a). When the middle scroll bar of main window is drawn to the right margin, the driving case becomes the case of no map information available for experiment. Meanwhile considering the predictive performance for practical traffic construction, the traffic scene was designed according to the 216 Route of Shenyang Public Transportation Company of Liaoning Province. Figure 1-(c) shows the reference route. All objects are drawn according to the proportion of 1 pixel: 2 meters. The initial velocity of a virtual car is zero. According to the motion equation (1), the motion trajectory of virtual car can be calculated. ⋅⋅ ⋅ m Y + D Y = F ( force, direction )
(1)
Where m : the quality of the car, 10 kilogram; Y = ( y1 , y 2 )T : the position of the car; ⋅
⋅⋅
Y , Y : the velocity and acceleration of the car, respectively;
⎡5 0 ⎤ D : the coefficient matrix ⎢ ⎥; ⎣0 5⎦ F ( force, direction ) : the composition control based on force and direction ; force : the control value from forward key, 10N; o o direction : the control value from left and right keys, -30 and +30 .
2.2 Hitachi ETG-7100 For near-infrared optical topography, we used 66(22*3) channel spectrometer (Hitachi ETG-7100). A 3*5 array of 8 laser diodes and 7 light detectors was applied resulting in 22 channels of a probe. This was realized by the fact that the near-infrared laser diodes were coded by different wavelengths each in two ranges around 695 and
Fig. 2. ETG-7100
240
T. Shang, S. Wang, and S. Zhang
830 nm (ranges: 675–715 nm and 810–850 nm). The photodiodes (light detectors) were located 30mm from an emitter. Fibers were mounted on a plastic helmet that was held by adjustable straps on the experimenter’s head. The measurement covered an area of 6.75 cm*11.25 cm centered over the electrode position. Light emitting was time coded with 10 kHz. The ETG-7100 monitor measured changes of O2Hb and HHb from a starting baseline. Data were measured with a sampling rate of 10 Hz and further analyzed using the ETG-7100 software. The scale of the hemoglobin quantity is mmol*mm, which means that changes in the concentration of O2Hb and HHb depend on the path length of the near-infrared light in the brain.
3 Experimental Procedure As the frontal lobe and occipital lobe seemed to be relevant for desired cognitive function, three probes were localized over the left prefrontal cortex, the right prefrontal cortex and occipital visual cortex, respectively, just as shown in Figure 3. Oxygenation changes with 22 channels of each probe can be measured during the driving process.
Fig. 3. Position of three probes
Stimuli were presented with the above experimental driving simulator. The stimuli come from a computer monitor placed 60 cm in front of an experimenter. The experimenter has to respond adaptively. Then the response data was recorded and used as a result of behavioral performance. With the ETG-7100 software, the changes of the concentrations of HHb and O2Hb were calculated over the experimental session. For task repetition, we defined a 30 s “baseline”, preceding each active task period (lasting 180 s) and a 30 s “rest” time period following each active task period. For our data, the time course of the measured data was corrected by the ETG-7100 software. After this correction, the resulting data was exported by the ETG-7100 program into ASCII data format and
The Effect of Map Information on Brain Activation During a Driving Task
241
video format. The concentration changes of HHb and O2Hb in the three experimental phases are further analyzed for each channel by means of two-tailed cut. In more detail, we first compared the initial condition separately to the corresponding baseline for each channel. This is done for [O2Hb] and [HHb] to ensure that the conditions lead to signs of cortical activation, that is, to an increase of [O2Hb] and a corresponding decrease of [HHb].
4 Measure Experiments 4.1 Subject One healthy and right-handed experimenter (male, age = 30 years old) was arranged to drive the car from the starting point to end point according to the specific 216 Route twice. The experimental cases include the case of no map information and map information available. Experimenter was free of medication, with no former or actual neurological or psychiatric disorder. 4.2 NIRS Data for No Map Information Available For the prefrontal cortex, the typical tracings for the changes in concentrations of O2Hb during the driving task are displayed in Figure 4. The concentration of O2Hb Time:30s
Time:44s
Time:88s
Time:74s
Time:92s
Fig. 4. Activation change of O2Hb for left and right prefrontal cortex
242
T. Shang, S. Wang, and S. Zhang
increased in partial channels during the active phase compared to the baseline, and subsequently the concentration area of O2Hb for left prefrontal cortex expanded in a smaller scope, while the concentration area of O2Hb for right prefrontal cortex changed the position of concentration area. Finally [O2Hb] declined over the time course of the rest phase compared to the active phase. Time:120s
Time:150s
Fig. 5. Activation change of O2Hb for occipital visual cortex
For the occipital visual cortex, the typical tracings for the changes in concentrations of O2Hb during the driving task are displayed in Figure 5. The concentration of O2Hb varied in partial channels during the active phase. 4.1 NIRS Data for Map Information Available For the prefrontal cortex, the typical tracings for the changes in concentrations of O2Hb during the driving task are displayed in Figure 6. The concentration of O2Hb
Fig. 6. Activation change of O2Hb for left and right prefrontal cortex
Fig. 7. Activation change of O2Hb for occipital visual cortex
The Effect of Map Information on Brain Activation During a Driving Task
243
increased in partial channels during the active phase compared to the baseline, and subsequently the concentration area of O2Hb for left prefrontal cortex expanded in a larger scope, while the concentration area of O2Hb for right prefrontal cortex expanded to a complete scope. Finally [O2Hb] still kept active over the time course of the rest phase compared to the active phase. For the occipital visual cortex, the typical tracings for the changes in concentrations of O2Hb during the driving task are displayed in Figure 7. The concentration of O2Hb keeps high in almost all channels. 4.2 Discussion As expected, in both cases of no map information available and map information available, we found a significant increase in O2Hb over measured frontal brain areas during the active phases compared to the baseline. Most importantly, both of left and right brain were activated in the active phase, with significantly higher concentrations of O2Hb. Meanwhile, the results indicated a missing activation of the prefrontal cortex sometimes. Therefore we can conclude that the driving task of the specific route mainly activates the partial prefrontal cortex. The activation map of brain illustrates specific effects of brain areas of the prefrontal cortex. But these differences between left and right prefrontal cortex did not reach significance. One conclusion can be drawn that in spite of changing the computational load imposed by a given traffic scene, there seems to a tendency of stable and symmetrical activation for left and right brain. In order to compare different cases, more details are illustrated as below: 1)
2)
For the case of no map available, according to the activation maps of O2Hb of prefrontal cortex, the effect that we also found significantly higher [O2Hb] in several points during the active phase compared to the neighboring area was probably caused by the fact of the hemodynamic response. At least two kinds of activation pattern can be found, just as shown in Figure 4. Since the pattern suggests the functional relevance of the frontal lobe for driving tasks, one conclusion is that it is possible to analyze the process of cognitive changes according to the physical position of prefrontal cortex. According to the activation maps of O2Hb of occipital visual cortex, two kinds of activation pattern can be found. Furthermore, one conclusion can be drawn that as environment becomes complex, left brain plays an initiative pole, while right brain closely follows towards the activation degree of left brain. Left brain focuses on problem solving, while right brain promotes active level. There seems to be collaborating areas of brain which each has multiple relative specializations and engages in extensive inter-area collaborations. For the case of map information available, according to the activation maps of O2Hb of prefrontal cortex, right brain completely activates in almost same degree, whereas the left brain uses the only partial brain. Only one kind of activation pattern can be found. Meanwhile, there is no more obvious priority of activation for left brain and right brain. According to the activation maps of O2Hb of occipital visual cortex, the occipital visual cortex keeps active almost in all areas of brain with the same
244
T. Shang, S. Wang, and S. Zhang
degree. Based on the above facts, it can be concluded that the case of map information available costs more energy than that of no map information available. Consequently drivers will become tired more quickly. If the case of map information available is looked on as the case with GPRS/GPS/GIS based on vehicle navigation and monitoring systems, the case of no map information available is looked on as the case without corresponding system, the kind of system will exhaust drivers more quickly so that the driver may face more potential danger, although it helps drivers search path conveniently. One limitation of our study is the missing specific effect for the HHb concentrations. In contrast to the specific concentration changes in O2Hb, concentration of HHb decreased in both conditions during the active phase compared to the baseline. In contrast to other studies claiming that HHb is more sensitive than O2Hb, our explanation for the absence of HHb is that, given the wavelengths used by the ETG-7100 system, [O2Hb] estimations are considerably more precise than estimation of [HHb], so that weaker effects in this parameter might not become statistically significant. Of course, this proposed analysis should be considered in further studies. At the same time, this shortcoming of low spatial resolution of the ETG-7100 equipment has been verified.
5 Conclusions In this paper, based on developed driving simulator, we used the NIRS method to investigate the functional activity of the cerebral cortex during the different driving tasks and discussed the negative effect of vehicle navigation and monitoring systems on drivers. After establishing a consistency with earlier research, the study produced three conclusions: firstly, in spite of changing the computational load imposed by a given traffic scene there seems to be a stable effect in a number of collaborating areas of brain, including left brain and right brain. It suggests that driving cognitive process that operates on different levels of environment may nevertheless draw on a shared infrastructure of cortical resource. Secondly, for the case of no map information available, left brain plays an initiative pole, while right brain closely follows towards the activation degree of left brain so that there is a tendency of left and right brain for symmetrical activation, suggesting that it may contribute to the construction of an easier model for driving cognitive process. Thirdly, for the case of map information available, there is no more obvious priority of activation for left brain and right brain, but with high activation degree. Meanwhile, there is a complete activation for the prefrontal cortex of left and right brain. Since map information attaches more burdens on brain, it suggests that the GPRS/GPS/GIS based on vehicle navigation and monitoring systems may exhaust drivers more easily so as to bring about more danger than traffic convenience under driving environment. We believe such conclusions will provide guide to explore well to those issues of developing computational theories for cognitive process, but also contribute to rehabilitation of those with cognitive deficits.
The Effect of Map Information on Brain Activation During a Driving Task
245
References 1. Tsugawa, S.: Automobile Driving Support Adjustable for Drivers. AISTTODAY 4, 12 (2004) 2. Akamatsu, M.: Driving Support System Based on Driving Action Data. AISTTODAY 14, 11 (2004) 3. Nechyba, M.C., Xu, Y.: Human Control Strategy: Abstraction, Verification and Replication. IEEE Control Systems Magazine 17, 48–61 (1997) 4. Koike, Y., Doya, K.: A Driver Model Based on Reinforcement Learning with Multi-Step State Estimation. Trans. IEICE Japan D-II 84, 370–379 (2001) 5. Shihabi, A., Mourant, R.R.: A Framework For Modeling Human-Like Driving Behavior For Autonomous Vehicles in Driving Simulators. In: Proc. The Fifth International Conference on Autonomous Agents, pp. 286–291 (2001) 6. Mizutani, K., Saito, G., Omori, T., Ogawa, A.: A Feasibility study of Cognitive Computation Model for Driver’s Process Estimation from driving Behavior. The Transactions of the Institute of Electrical Engineers of Japan, 967–975 (2005) 7. Jasdzewski, G., Strangman, G., Wagner, J., Kwong, K.K., Poldrack, R.A., Boas, D.A.: Differences in the hemodynamic responseto event-related motor and visual paradigms as measured by nearinfrared spectroscopy. Neuroimage 20, 479–488 (2003) 8. Fallgatter, A.J., Strik, W.K.: Reduced frontal functional asymmetry in schizophrenia during a cued continuous performance test assessed with near-infrared spectroscopy. Schizophrenia Bulletin 26, 913–919 (2000) 9. Herrmann ∗, M.J., Ehlis, A.-C., Wagener, A., Jacob, C.P., Fallgatter, A.J.: Near-infrared optical topography to assess activation of the parietal cortex during a visuo-spatial task. Neuropsychologia 43, 1713–1720 (2005)
Worm 5: Pseudo-organics Computer and Natural Live System Yick Kuen Lee1 and Ying Ying Lee2 1
Sun Yat-sen University, Software School
[email protected] 2 University of Leeds, School of Biological Science
[email protected]
Abstract. Life began hundred million years ago; it started from simple inorganic substances to intricate multi-cellular organics. Gradually, the brains of higher animals developed emotions and intelligence. These are well illustrated by the learning abilities and social behaviors of man. Those intelligent activities, progress from simple to complicate, primitive to sophisticated processes from incarnate to abstract. Man started to create artificial intelligent to enhance their brain capabilities sixty years ago. Here we are making a comparison between the natural and artificial intelligent, and see what we can emulate more from Nature. And disclose the author’s point of view about the creation of natural lives.
1 Introduction In a repetitive environment, events will happen with a sequenced order, with some rules govern them. Organisms can remember what happen before, and use knowledge from past experiences to predict what will happen in the future, give proper reaction. This enhances the survival of those organisms. For instance, Earth rotates around the solar system and spins about its own axis just provide such cycles are the fundamental dogma of physics and astrology. Homeostasis is the basis of survival in organisms. This delicate balance is maintained by constant interaction of the environment and organism. The organism picks up information from the ambient environment, and a proper cellular response is then elicited in the system. This instinct prolongs survival. Another characteristic of life is reproduction. Organisms can produce offsprings with similar genetic material. So even with the death of the older generation, their next generation survives. This life cycle continues the proliferation and survival of a species. The two characteristics discussed above involve information amplification. These processes require energy, which is obtained from the organism’s surrounding. However, the resources from the ambient environment are finite. Moreover, it is the nature of life to end. The equation of life entails development, reproduction and, inevitably, death. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 246–253, 2007. © Springer-Verlag Berlin Heidelberg 2007
Worm 5: Pseudo-organics Computer and Natural Live
247
Mutation occurs during reproduction of organisms. In addition, influence exerted by external environment enhanced the mutation. Such mutates create a diversified gene pool, resulting differing phenotypes to manifest. Darwinism states that organisms with the most desirable phenotypes would survive and proliferate. This process of natural selection constitutes to evolution of organisms. Before the 20th century, science was divided into a multitude of different domains such as, Mathematics, Physics, Chemistry, Biology, Pathology, and Philosophy. Life sciences were more closely associated with philosophy and religion studies by many. Little did they know that genetics has a molecular basis when genetic theory basis. The study of human genome has united the different fields of studies. Men already possess the ability to create artificial intelligence. Compared to Nature, which went through millions of years of evolution, this new advancement has only a brief history of less than a century. There are more to be explored in this exciting field. The age of information revolution has already begun. Where do we begin? In the 21st century, theoretical physics developed further into String Theory1 while time began when the ‘Big Bang’ occurred. If life is defined as maintaining homeostasis and reproduction, it could encompass different energy levels in atomic structure to black holes in the galaxy, or to silicon polymer chain. Under different temperature, pressure and time frame, these seemingly ‘lifeless’ materials may display properties pertaining to life. However, to simplify matters, we shall stick to carbon chain, which constitutes all organisms.
2 Genetic Memories - Steady and Slow Mechanism Genetic information is encoded using four different types of bases. They are namely adenine (A), thymine (T), cytosine (C) and guanine (G). A series of DNA transcription and translation should code for proteins that are essential for life. From basic structure of cells to intricate cellular mechanisms, proteins are always, some way or another, involved. Due to the highly stable structure of DNA, the whole process of mutation is slow and dreary. Therefore, evolution does not happen in a split second; it takes many, many generations to occur. It takes a long time to interact with its environment.
3 Prokaryotes Versus Von-Neumann Machines Prokaryotes, like bacteria, are the simplest life forms that exist. They are made up of a single cell. Only a bi-phospholipid layer separates the internal and external environment of the organism. Like the Maxwell’s devil that can distinguish black and white particles in statistic theory, the protein channels embed in lipid wall can distinguish molecules and determine which can go pass the bilipid layer. DNA in the chromosome codes the inheritance information. During transcription, RNA polymerase use the template strand of DNA from to assembled a strand of mRNA2. Those mRNA will than translated into its corresponding polypeptide or enzyme by ribosomes and RNA
248
Y.K. Lee and Y.Y. Lee
polymerase during translation. Proteins (e.g. enzymes) initiate and regulate cellular activities. Organisms assimilate materials in the outside environment, and start the reproduction mechanism at maturity to produce more individuals to proliferate. Using the Von-Neumann machine, as a normal computer. Steady binary signals recorded in magnetic or optical media, coding the program and data information, CPU use Cluster of records as a template transcript them into high speed cache, from which program execute CPU instructions and manipulate electric signals as well as program instruction itself, and perform data input and output. Transformation of electric signals initiates intelligent activity, and control those intelligent activities themselves. Under control of human, program may be regurgitated and develop continuously. The two mechanisms mentioned above have many similarities. The core information is stored in a simple digital format in sequence and can be retrieved segment by segment. After spreading, the information transforms into a more power status, adjusting its environment, and feedback its signals, control complicate activities flow. Natural organisms maintain their lives, and reproduce offspring generation by generations. The born, growth, reproduction mutation become a complete cycle. And go through by the organism itself, no external interference will necessary except absorb energy from the environment. On the other hand, the name Von-Neumann Machine implies incompleteness, Man make computer machine hardware, software are written by man, turn on, turn off, and management all done by human. The computer development and evolution depends on human too. As a tool for extension human intelligent it cannot independently exist without interference from mankind.
4 Clustering of Lives - Eukaryotes, Multi-cell Organisms Prokaryotes exchange information through chemical reaction between molecules. The free path length and moving speed limits their sizes. So organism with simple structure is usually small. Individuals come together and form a larger body by communication. High coherence, low coupling function group usually clustered together, more often than not, the organization proves to be adaptable to the environment Eukaryotes could be treated as a cluster of lysosome, ribosome, mitochondrion, nucleus, etc. similar to prokaryotes packed together[1]. For higher animals, the structure of organization complicates to give rise to different hierarchies within the system. Cells in multi-cellular organism differentiate into different cells types to form tissues, organs and systems. Organisms can come together to form a community, like a herd of lions. In the field of artificial intelligent, single instructions usually combine into subroutines, and put together to be routine library, and high coherence, low-coupled structures will put together to form objects. Then come operating systems and application systems. Hierarchy is an important aspect in big systems. For hardware, single PC usually connected into a network, enterprises network most probably include function groups of file server, data base, mail server etc. then, linked together by internet.
Worm 5: Pseudo-organics Computer and Natural Live
249
5 Data Carrier - Nerve Network and Internet To maintain homeostasis in an ever-changing environment, one mechanism is negative feedback. For example, cells selectively synthesize lactase to break down lactose when there is no glucose present for glycolysis. Under the regulation of cAMP, dictyostelium will transform from amoebae to fruiting body[4]. Incretion, exocrine and inducer during embryo fetation are example of chemical signals. Chemical signal promulgate only in a small range, as the space enlarged, the speed of molecule diffusion limits propagation efficiency. Nervous system then developed in multi-cellular organism during evolution. Sensory receptor detects signals by inducing a change in the electric potential across cell membrane, transmitted along axons of nerve cells, to central nervous system (CNS) for interpretation and response. Electrical signal can be conducted more rapidly than chemical signals. Organism with nerve system survives better in a competitive environment. Together with the development of CNS, Man could communicate with voice or writing hundreds of years before, nations distributed in separated area depends on geographical location. Nowadays, by using electric signals, telegram, telephone, radio, shorten the nation’s distances, unifies the culture of different area. During the last ten years, optical fiber and Internet technology enhance the communication, increase efficacy and efficiency; making it more possible for globalization. Will Internet become a higher lever nervous system of human being?
6 Logical Network - Another Form of Memory Inchoate organism, like jellyfish, their nerves are divided into two types - sensory and motor, without CNS[2]. The batter like annelid, neurons cell bodies cluster in ganglion, have fixed format reaction to stimulations signals. The numbers of cells in eelworms are fixed[4] determined their genetic materials. Nerve memory is not a feature in them. For higher animals, CNS are highly developed. Sensations such as touch, smell, vision, hungry, cool, warm and pain can be detected. The sensory receptors of the peripheral nervous system transit impulse from sense organ to CNS, exciting the corresponding area. CNS processes such signals in sensory cortex of the brain, relays information to the motor cortex to transmit impulse to the appropriate effecter organs2. These reactions effect their survival. Nervous conduction includes chemical signals, such as direct acting substances like neurotransmitter (e.g. adrenaline and dopamine), neuropepties and Adenosine Triphosphate (ATP). In the early stage of the life, genetic information controls the structure and function of the nervous system. Most of the brain structure is an empty cavity4. However, as the system develops, sensory signals occur simultaneously, when the stimulation is above threshold level, or it happens frequently enough, synaptic connections form between the dendrites and axons in the brain cells. They connect and build a memory system based on the topology of the nervous network.
250
Y.K. Lee and Y.Y. Lee
There are some theories states that: Regulated by hippocampus in the brain, the excited cells would be connected by new nerves5, after that, stimulate only part of the cells that would transmit to others, thus, conditioned reflex, or memory forms. Conditioned reflex changes the physical structure of the brain, creating character of an individual. Compare nerve reaction with artificial process controller, the leaky channels, ligand channels, and voltage-gated channels in the dendrite and axon, are quire similar to the logical gate in electronic circuit where input signals, after transformation by the gate array, transmitted to control output devices. Field Programmable Gate Array (FPGA) is just like the nervous network in the brain[3]. However, programming of such device has to be performed by human at this stage, they cannot change their structure according to the input strength or frequency. Search engines in the Internet find the target address, redirect the signal, and get the necessary information from there. This type of operation, works in cooperation of Von-Neumann machine and logical gates. Pseudo-organic computer, like “WORM” (see below), however, has appropriate hardware, change communication connection between elements according to their structure instructions[7]; simulate the operation mode in the brain, making a foundation to the simulation of conditioned reflex.
7 Formation of Knowledge - Abstract Abilities Higher organisms have nervous system, connecting stimulate and reactions for body survival. Emotion expressed in pleasure, anger, sadness, and cheer, etc. That is combination a series of activities, including body movements, expression in face, sounds, incretion and secretion etc5. Comfortable feeling initiate organism’s intention; Avoiding pain is a basic instinct of most organisms. Those reactions, shows sequence or association of ordered events. Higher animals can acquire knowledge from past experiences, concludes rules that may predict what might happen in the future, making decisions earlier. As the brain developed in different stage, different species, having their means of reaction in quire a different ways, direct or indirect, sort terms and long terms, simple to complicate, incarnate and abstract. A lot of memories may have similarities and forms more abstract concepts. Abstract concepts can reduce memories element required, enlarge the range of concept, increases information process efficiency. For example, from many incarnate concepts like cow, sheep, grass, flower, tree, bird, door, window, we can distinguish the more abstract concepts of creature, plant, building structure, etc. The concept of abstract can be organized by hierarchy. The higher animals have the more abstract concept forming ability. Language is one of such abstract connecting concepts and voice. An ability to predict is intelligent or knowledge. A huge quantity of data, after cleaning, integration, selection, transformation, mining, and pattern evaluation, can be converted to useful information, concluded to rules to make predictions. Most work in developing artificial intelligent is knowledge discovery (mining) from large database6, search for frequent item sets; calculate the degree of association, degree of support, degree of confidence, finding associated relations. This way of knowledge discovery is similar to what the Natural does.
Worm 5: Pseudo-organics Computer and Natural Live
251
However, most of the artificial intelligent developed depends on human programming in a Von-Neumann machine. Some of which can keep the training data in permanent memories, but it is still relatively primary, cannot find their goal automatically, no emotion, no self-recognize, no reproduction, and cannot develop independently.
8 Formation of Characteristic, Self-cognize Genes records the information of species, reproduce similar organism, creating the innate instincts. However, the individuals of higher organism have their own characteristics. The characteristics of each individual are generated by memories during their growth. Genes stores the common traits of a species. Memories and experiences influence an individual’s characteristics. Organic clone, like identical twins, may have identical genes, but the personal experiences may not be the same when they grow up. Albeit the identical genetic constituents, twins may very well have different personality traits. Who has seen two trees that are replica of each other? Who am I? When you look into a mirror and think who is that, you may be making a soul-searching journey. Yourself, just are a sequence of memories start from your childhood, perceive of outside world, goals of tracing and evasiveness brought from your genes and experiences.
9 Man, Civilization and Abstract Lives Out of all the life forms that exist, Man stood out from the rest with advanced abstract intellect and imagination. This gift of intelligence allows people to acquire sophisticated language abilities. They were able to express emotions and distinguish themselves from others. Early civilization relied on verbal interactions to impart knowledge and history. As Man progressed, they were able to use writings to record knowledge and history. This more tangible form of documentation allowed Man to accumulate year’s experiences and pass down to the next generation. In 16th century Europe, the emergence of printing supplements the spread of knowledge and information. With that, it boosted the development of ancient science to modern technology. Drawing and writing are forms of memory of individuals, shared by a group of people. It is an improvement beyond innate memory. Most organisms’ memories disappear as they die. However, writing can impart human knowledge from generations to generations. We know the cataclysmic stories of ancient times and learn Euclid geometry because our ancestors have written down their knowledge so that we can learn. Writing creates human culture, experiences of a nation for thousands of years, can be recorded in books. Printing technology allows spread of knowledge to be easier. Schools and universities regulated education bring up more systematic sciences. Culture is an abstract form of life, Abstract life can be defined as any form of existence have memory ability, can reproduce itself. A nation, a society, an
252
Y.K. Lee and Y.Y. Lee Table 1. Comparison of Natural and Artificial Organism
Existing Years Simplest Form Hierarchy Examples
Nonneural Organism 3.8 billion
Neural Organism 400 million
Bacteria
Jellyfish
Cell fungi protist
Von-Neumann Machine
Computer Net-work
100
60
40
Electricrelay
Personalcomputer
Worm Fish Mammal human Neural gate infrastructure
TTL IC ProcessControl FPGA Electric gate network
Minicomputer Mainframe Seq-uence of binary code
Local area network Internet
Organ Function groups Neural pulses in parallel
Function groups
Files Program Objects Electric pulse words in Series 500 mb/s per bus channel
Logic Gate
Memory Format
Sequence of tetrad code
Structure Units
Organelle
Internal Data Carrier
Chemical Molecule
Propagate Speed
Molecular diffusion
100 ms/m in parallel
1 us/gate in parallel
Data Processor
Multiple ribosome
Multiple axon gate
Multiple local gate
Process Manner
Segment and parallel
Hierarchy parallel
parallel
Process Cycle Efficiency
seconds
0.05 seconds high
1 us Medium
Medium
Electric pulse in parallel
PseudoOrganic Computer --WORM
Binary code with infrastructure Hosts Nodes Servers Electric pulse packets in Series 100-1000 mb/s per line
Binary code with infrastructure Hardwaresoftware objects Optical pulse in packets of words 10-40 gb/s per optical channel Multiple CPU and routers Hierarchy parallel of sequential elements
30 ps
Multiple CPU and routers Hierarchy parallel of sequential elements 30 ps
Low
Very high
Very high
Single or multiple CPU Segment and sequential
30 ps
organization, a company or even software can be treated as an abstract life. VanNeumann Machine is a basic form of artificial life; Internet is also an abstract artificial life.
10 A Sample of Pseudo-organic Computer – “WORM” After billions of years wash out, the natural organism evolved many brilliant methods that are worth imitating, generation of artificial intelligence.
Worm 5: Pseudo-organics Computer and Natural Live
253
Base on a sequence of binary code, Von-Neumann machine has a tight structure, easy to program. However, logic gate similar to the brain has more processing efficiency. Objects oriented programming technique, save information in distributed objects, which communicate each other by passing massage. Network of hardware or network of software together with its infrastructure constituted as part of memory information. Communication efficiency becomes an important issue. A pseudo-organic computer project, named “WORM”^, clustering a lot of computing resources by photo-electric coupling data bus to form an object oriented networked task services system. Jump out of the frame restricted by the VonNeumann Machines. Beside the instruction flow control, use structure control to combine the multiple processors7. New computer will improve the internal communication system; dynamically control the common bus and other resources.
11 Conclusions As a tool of prediction, Pseudo-organic computer imitate only the brain manipulating information, and does not involved in reproduction itself. Can man create an artificial intelligent organism with reproduction ability? The possibility of imitate organic seems no doubt; however, there are practical problems in technology. Furthermore, it is a very difficult problem. To make computer, or even something simpler, just like paper, metal wire, plastic sheet, etc. needs the entire industry cooperation system. Nowadays, only a few countries can produce full set of computer. It is far from making a single machine that can replace the whole industry system. Philosophers argue whether God creates man, or Man creates God, according to their own image. However it can be sure that men create computer according to their image. Although the artificial intelligent is still simple and crude, Pandora's box has already opened. Successful breaking through and translate the genetic code in 21st century prelude the information revolution. The secret of lives and intelligent would be disclosed, gradually.
References 1. Baaquies, B.E., Kwek, L.C.: Superstrings, Gauge fields and Black holes 2. Miller, L.: Biology. Pearson Education Inc. (2006) 3. Zeidman, B.: Designing with FPGAs & CPLDS. Mei Guo CMP Gong Si Jiao Chuen Beijing Hang Kong Hang Tian Da Xue Chu Ban She Chu Ban (2002) 4. Muller, W.A.: Translated by Huang Xiu Yin. Fa Yu Shen Wu Xue. Beijing Gao Deng Jiao Yu Chu Ban She (2000) 5. William, G.J., Stanfield, C.L.: Principle of Human Physiology, 2nd edn. Pearson Benjamin Cummings (2005) 6. Han, J., Kamber, M.: Data Mining: Concept and Techniques 7. Shen, X.B., Zhang, F.C., Feng, G.C., Che, D.L., Wang, G.: The Classification Model of Computer Architectures. Chinese Journal of Computers 26 (2005) ^
For more details WORM, do refer to Y.K Lee. 2006. Worm 1: A Pseudo-organic Computer’s System Structure.
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics of Coupled Neurons Jiang Wang, Xiumin Li, and Dong Feng Tianjin University, School of Electrical Engineering and Automation, 300072 Tianjin, China
[email protected]
Abstract. We study the stochastic dynamics of three FitzHugh-Nagumo neurons with chemical coupling and electrical coupling (gap junction) respectively. For both of the coupling cases, optimal coherence resonance and weak signal propagation can be achieved with intermediate noise intensity. Through comparisons and analysis, we can make conclusions that chemical synaptic coupling is more efficient than the well known linear electrical coupling for both coherence resonance and weak signal propagation. We also find that neurons with parameters locate near the bifurcation point (canard regime) can exhibit the best response of coherence resonance and weak signal propagation.
1 Introduction Noise-induced complex dynamics in excitable neurons have attracted great interest in recent years. The random synaptic input from other neurons, random switching of ion channels and the quasi-random release of neurotransmitter by synapses contributes to the randomicity in neurons [1]. While in contrast to the destructive role of noise, such as disorder or destabilize the systems, in some cases noise play an important and constructive role for the amplification of information transfer. Particularly, in the presence of noise, special attentions have been paid to the complex behaviors of neurons that locate near the canard regime [2-7], where neurons can exhibit great sensitive to external signal. This is important and meaningful for weak signal processing which guarantees low energy consumption in biological systems. As investigated in [2;3;6], such neurons possess two internal frequencies which correspond to the standard spiking and small amplitude oscillations (Canard orbits) respectively. For the former, it is just the frequency of the most regular spiking behavior purely induced by intermediate noise intensity, which is known as Coherence Resonance (CR). For the latter, the subthreshold oscillations are critical in the famous Stochastic Resonance (SR) phenomenon, which describes the cooperative effect between a weak signal and noise in a nonlinear system, leading to an enhanced response to the periodic force [8]. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 254–263, 2007. © Springer-Verlag Berlin Heidelberg 2007
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics
255
Recently, E.Ullner gave detailed descriptions of several new noise–induced phenomenon in the FHN neuron in [1]. They showed that optimal amplitude of highfrequency driving enhances the response of an excitable system to a low-frequency signal [9]. They also investigated the Canard-enhanced SR [3], the effect of noiseinduced signal processing in systems with complex attractors [10] and a new noiseinduced phase transition from a self-sustained oscillatory regime to an excitable behavior [11]. And in [12], C. Zhou etc. have demonstrated the effect of CR in a heterogeneous array of coupled FHN neurons. They find that both the decrease of spatial correlation of the noise and the inhomogeneity in the parameters of the array can enhance the coherence. However, most of the relevant studies considered the single neuron [3;5;13] or neurons with linear electrical coupling (gap junctions) [4;12;14;15]. Only in [16], another very important case—nonlinear pulsed coupled neurons with noise were investigated. In the case of chemical (nonlinear) coupling, they observed a substantial increase in the CR of Morris-Lecar models, in comparison with the (linear) electrical coupling. Therefore, inspired by [16] and based on our previous work on canard dynamics of chemical coupled neurons [17], we study the effects of chemical synapses on CR and the enhancement of signal propagation in three coupled FHN neurons, which locate near the canard regime and are subjected to noisy environment. In particular, in order to investigate the signal propagation, only one of the neurons is subjected to external periodic signal. With the optimal noise intensity, chemical coupled neurons, due to the selective couplings between individuals, can enhance CR and exhibit much better response of external signal than the electrical coupled ones. This paper is arranged as follows: in Sec. II, we give descriptions of the neuron model and two kinds of coupling; In Sec. III and , comparisons are made between the chemical coupled neurons and electrical coupled neurons for coherence resonance and information transfer respectively; finally, we make conclusions and discussions in Sec.V.
Ⅳ
2 Neuron Model and Coupling Description We consider three bidirectional coupled Fitz Hugh-Nagumo (FHN) neurons which is described by
1 3 ⎧ app syn −I ⎪ε Vi = Vi − 3 Vi − Wi + I i ⎨ ⎪W = V + a − bW + B cos(ω t ) + Aξ (t ) i i i i ⎩ i
(1)
where i = 1,..., N index the neurons, a, b and ε are dimensionless parameters with ε 1 that makes membrane potential Vi as fast variable and recovery variable Wi as slow variable. ξ i is an independent white Gaussian noise with zero mean and intensity A for each element. Bi cos( wt ) is the forcing periodic signal. I app and I isyn is the external applied current and the synaptic current through neuron i respectively. For the linear diffusive coupling (gap junctions),
256
J. Wang, X. Li, and D. Feng
I isyn =
∑
g syn (Vi − V j )
j∈neigh ( i )
(2)
where g syn is the conductance of synaptic channel. For the nonlinear pulsed coupling (chemical synapses), we refer to [18;19] and I isyn is defined as I isyn =
∑
g syn s j (Vi − Vsyn ),
j∈neigh ( i )
(3)
where g syn is the synaptic coupling strength and Vsyn is the synaptic reversal potential which determines the type of synapse. In this paper, considering the excitatory synapse, we take Vsyn = 0 . The dynamics of synapse variable s j is governed by V j , and it is defined as ⎧ s j = α (V j )(1 − s j ) / ε − s j / τ syn ⎪ α0 ⎨ ⎪α (V j ) = 1 + exp(− V V ) j shp ⎩
(4)
where synaptic decay rate τ syn is written as τ syn = 1 δ . The synaptic recovery function α (V j ) can be taken as the Heaviside function. When the neuron is in silent state V < 0 , s is slowly decreasing, the first equation of (5) can be taken as s j = − s j / τ syn ; while in the other case, s fast jumps to 1 and thus makes action to the postsynaptic cells. The parameters used in this paper are respectively a = 0.7 , ε = 0.08 , Vsyn = 0 , α 0 = 2 , Vshp = 0.05 , I app = 0 and the rest parameters are given in each case. In this model, b is one of the critical parameters that can significantly influence the dynamics of the system. For the single neuron in the absence of noise, AndronovHopf bifurcation happens at b = 0.45 . As b > 0.45 , it is excitable and corresponding to the rest state; while as b < 0.45 , the system possesses a stable periodic solution generating a periodic sequence of spikes. Between these two states there exists an intermediate behavior, known as canard explosion [19]. In a small vicinity of b = 0.45 , there are small oscillations near the unstable fix point before the sudden growth of the oscillatory amplitude. This canard regime tends to zero as the parameter ε → 0 . Here we take ε = 0.08 as used in [20], and in this case canard regime exists for b ∈ [0.425, 0.45] . This regime is much sensitive to external perturbations and thus plays a significant role in the signal propagation which will be further discussed below. We numerically integrate the system by the explicit EulerMaruyama algorithm [21].
3 Coherence Resonance Coherence Resonance (CR) is a noise-induced effect and describes the occurrence and optimization of periodic oscillatory behavior due to noise perturbations [1]. In
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics
257
this section, we study the effect of chemical synapses on the coherence resonance of coupled neurons, where Bi = 0, i = 1, 2,3 . As is discussed in [16], for large enough coupling strength g syn , time traces of electrical coupled neurons are basically identical, while in the chemical coupling case, there exists a slight delay between spikes and the subthreshold oscillations are different form each other (see Fig.1). Therefore, we only examine the coherence of 2 nd neuron instead of the mean field. (b) Electrical Coupling
2
(a) Chemical Coupling
2
1.5 1.5
1
V1&V2&V3
V1&V2&V3
1 0.5 0
0.5 0 -0.5
-0.5
-1 -1
-1.5 -1.5
-2 -2 0
20
40
60
80
100
0
10
20
30
40
50
60
70
80
90
t
t
Fig. 1. Time series of Vi ( i = 1, 2,3. ). (a) b = 0.45 , g syn = 0.27 , A = 0.11 ; (b) b = 0.45 , g syn = 0.1 , A = 0.19 .
We take S i = Tki
Tmean = Tki
t
t
Var (Tki ) , i = 2
and the average interspike interval
as the coherence factor of the firing events, where Tki is the pulse
internal: Tki = τ ki +1 − τ ki , τ ki is the time of the k th firing of the i th cell. ⋅ t denotes average over time. S describes the timing precision of information processing in neural systems. We study CR for these two kinds of couplings when the neurons locate near the bifurcation point b = 0.45 , where all the cells are in subthreshold regime in the absence of noise. In order to investigate the influence of coupling strength we calculate the maxim of S ( Sm ) at the corresponding optimal noise intensity for different values of g syn in two coupling cases respectively (see Fig.2 (a) (b)), where g syn = 0.15 in (a) and g syn = 0.1 in (b) are the smallest value for neurons to fire synchronously. It is obvious that both too weak and too strong coupling can decrease CR in each case. Therefore, we choose the optimal coupling strength g syn = 0.27 for chemical coupling and g syn = 0.1 for electrical coupling. Fig.2 (c) (d) shows the coherence resonance for two coupling cases. In both cases, Tmean decays quickly and tends to the period of normal spiking with the increase of noise intensity. While chemical coupling exhibits a significant increase of CR and need smaller noise intensity to achieve the optimal periodic oscillatory behavior than electrical coupling. Similar as discussed in [16], the interpretation of this phenomenon is that chemical synapses only act while the presynaptic neuron is spiking, whereas electrical coupling connect the voltage of neurons at all times. This can be observed in Fig.1 which shows the optimal case for each coupling. Chemical coupling ensures that small oscillatory neurons are free from each other and give more opportunities for
258
J. Wang, X. Li, and D. Feng
the individuals to fire induced by noise, compared with the electrical coupling case. And once one spikes, it will stir the others to spike synchronously. While for electrical coupling, the strong synchronizations between subthreshold oscillatory neurons result in the decrease of the oscillatory amplitude and thus the increase of the threshold for firing. And from this phenomenon we can learn that subthreshold oscillations are very important for the firing of large spikes. As b increases, where neurons locate far from the canard regime, CR declined in both of the two coupling cases (see Fig.2 (d)). (a) Chemical Coupling
(b) Electrical Coupling
5
6.2 4.8
6 4.6
S
5.6
m
m
S
5.8 4.4
4.2
5.4 4
5.2 3.8
5 0.15
0.2
0.25
0.3
g0.35 syn
0.4
0.45
0.5
3.6 0.1
0.55
0.15
0.2
0.25
(c)
0.35
0.4
0.45
0.5
CC EC
m
6
20
S
m ean
T
CC EC
30
10 0 0
0.3
gsyn
(d)
40
5 4
0.1
0.2
A
0.3
0.4
0.5
0.44
0.46
b
0.48
0.5
0.52
8 CC EC
0.2
2 0 0
0.1
0.2
0.3
A
0.4
0.5
m
0.15
4
A
S
6
CC EC
0.1 0.05
0.44
0.46
b
0.48
0.5
0.52
Fig. 2. (a)(b) The maxim of S for different g syn in two kinds of coupled neurons respectively, where b = 0.45 ; (c) CR factor S and Tmean versus the noise intensity A for the coupled system in different cases, where b = 0.45 , CC: g syn = 0.27 , EC: g syn = 0.1 ; (d) The maxim of S and the corresponding noise intensity Am for different parameter b in two kinds of coupled neurons respectively, where CC: g syn = 0.27 , EC: g syn = 0.1
4 Stochastic Resonance As mentioned above, Stochastic Resonance (SR) describes the optimal synchronization of the neuron output with the weak external input signal due to intermediate noise intensity. In this section, we take the parameters of input periodic signal Bi = 0.05 and ω = 0.3 so that there are no spiking for all the neurons in the absence of noise. In order to investigate the information transfer in these coupled neurons, we consider the local stimulus, that is, only one element is subjected to external periodic signal. So except for particular statement, Bi is taken as: B1 =0.05, B2 = 0, B3 = 0 . As is shown in Fig.3, there exists an optimal response of the neurons to input signal with intermediate intensity of noise. To evaluate the response of output frequency to the input frequency, we calculate the Fourier coefficient Q for the input signal. The definition of Q [1] is
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics
2
(a) Chemical Coupling (CC)
2
1
1
V1&V2&V3
V1&V2&V3
(b) Electrical Coupling (EC)
1.5
1.5
0.5 0 -0.5 -1
0.5 0 -0.5 -1 -1.5
-1.5 -2 0
259
-2 20
40
60
80
100
-2.5 0
20
t
40
t
60
80
100
Fig. 3. Time series of Vi ( i = 1, 2,3. ) and the input signal with a ten times higher amplitude than in the model (black line) B1 =0.05, B2,3 = 0, (a) b = 0.45 , g syn = 0.15 , A = 0.015 ; (b)
b = 0.45 , g syn = 0.12 , A = 0.045
ω 2π n / ω 2Vi (t )sin(ωt )dt , 2π n ∫0 ω 2π n / ω = 2Vi (t ) cos(ω t )dt 2π n ∫0
Qsin = Qcos
(6)
Q = Qsin 2 + Qcos 2 . Where n is the number of periods 2π / ω covered by the integration time. Similar as in Sec. we only examine the response of 2nd neuron to external input instead of the mean field, that is Vi = V2 in Eq.(6). And in neuron systems, for information is carried through the large spikes but not the subthreshold oscillations, we are only interested in the frequency of spikes. So following [3], we set the threshold Vs = 0 in the calculation of Q. If V < Vs , we replace V by the value of the fix point V f ; if V > Vs , we use the original value of V . We consider the differences between these two kinds of couplings for the signal processing we when the neurons locate near the bifurcation point b = 0.45 . Following Sec. choose the optimal coupling strength g syn = 0.15 for chemical coupling and
Ⅲ
Ⅲ
g syn = 0.12 for electrical coupling (Fig.4 (a) (b)). For local stimulus B1 =0.05, B2 = 0, B3 = 0 , chemical coupling is much efficient than electrical coupling for signal processing (Fig.4 (c) ~ (e)). As is discussed above, chemical coupled neurons can make better explorations of the internal sensitive dynamics and need smaller noise intensity to fire and complete signal processing than electrical coupled ones. And the subthreshold oscillations are still very important in this case. As b increases the ability of information transfer declined greatly in both of the two coupling cases (Fig.4 (d) (e)).
260
J. Wang, X. Li, and D. Feng
(a) CC
(b) EC
0.12
0.15
0.115
0.14 0.11
0.13
Qm
0.105
Qm
0.12
0.1
0.11
0.095
0.1
0.09
0.09 0.08 0.15
0.2
0.25
0.3
0.35 gsyn
0.4
0.45
0.5
0.085 0.1
0.55
0.15
0.2
0.3 gsyn
0.25
0.35
0.4
0.45
0.5
(c)
0.35
CC B2,3=0 EC B2,3=0 EC B2,3=0.05 CC B2,3=0.05
0.3 0.25
Q
0.2 0.15 0.1 0.05 0 0
0.02
0.04
0.06
0.08
0.1
0.12
0.14
0.16
A
(d)
0.09 CC EC
0.18
0.08 0.07
0.14
0.06
Qm
Am
0.16
0.12
(e) CC EC
0.05 0.04
0.1
0.03 0.08
0.02 0.06 0.04
0.01 0.44
0.46
b
0.48
0.5
0.52
0.44
0.46
0.48
b
0.5
0.52
Fig. 4. (a)(b) The maxim of Q for different g syn in two kinds of coupled neurons respectively, where b = 0.45 ; (c) Signal processing at the input signal versus the noise intensity for the coupled system in different cases, where b = 0.45 , B1 = 0.05 , CC: g syn = 0.15 , EC: g syn = 0.12 ; (d) (e) The maxim of Q and the corresponding noise intensity Am for different parameter b in two kinds of coupled neurons respectively, where CC: g syn = 0.15 , EC: g syn = 0.12
Besides, we also investigate the global stimulus B1,2,3 =0.05 , where each neuron is forced by the forcing signal. Here the chemical coupled system is not as efficient as the electrical coupled one for the response to input signal (Fig.4 (c)). In this case,
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics
261
neurons are more active and can fire easily induced by the external signal and noise. The continuous connection in electrical coupled neurons lead to high synchronization and can make better control of the firing rate than the selective connection in chemical coupled neurons see (Fig.5). However, this case is not common in real systems, where input signals are always weak and added to only a small amount of neurons for the sake of low energy consumption. (b) Electrical Coupling (EC)
(a) Chemical Coupling (CC) 1.5 1.5
1
V1&V2&V3
V1&V2&V3
1 0.5 0 -0.5 -1
0.5 0 -0.5 -1 -1.5
-1.5
-2
-2 380
400
420
440
t
460
480
500
520
-2.5 380
400
420
440
t
460
480
500
520
Fig. 5. Time series of Vi ( i = 1, 2,3. ) and the input signal with a ten times higher amplitude than in the model (black line). (a) b = 0.45 , g syn = 0.15 , A = 0.025 , B1,2,3 = 0.05 ; (b) b = 0.45 , g syn = 0.12 , A = 0.045 , B1,2,3 = 0.05 .
5 Conclusions In this paper, we have made comparisons of coherence resonance and the response to weak external signal between chemical coupled and electrical coupled noisy neurons. Chemical coupled neurons are prone to stir spikes due to its selective coupling, while electrical coupling is beneficial for synchronization. Therefore, as subjected to noisy environment and weak forcing signal, chemical coupling is more flexible and can increase the mutual excitations between cells, which enhance the coherence resonance and weak signal propagation. Also, the canard regime where system dynamics are complex and sensitive to external perturbations plays significant roles for the information transmission in neural systems. Besides, it should be noted that canard dynamics, which had been detailedly discussed in [19;22], is critical for signal processing. The number of subthreshold oscillations between two closest large spikes has close relationships to the firing rate, which carries the information during signal propagation. We will further this study and extend it to larger size of networks with different topological connections. Acknowledgements. The authors gratefully thank the valuable discussions with Wuhua Hu. And this paper is supported by the NSFC (No.50537030).
262
J. Wang, X. Li, and D. Feng
References 1. Ullner, E.: Noise-induced Phenomena of Signal Transmission in Excitable Neural Models. DISSERTATION (2004) 2. Perc, M., Marhl, M.: Amplification of information transfer in excitable systems that reside in a steady state near a bifurcation point to complex oscillatory behavior. Physical Review E 71(2), 26229 (2005) 3. Volkov, E.I., Ullner, E., Zaikin, A.A., Kurths, J.: Oscillatory amplification of stochastic resonance in excitable systems. Physical Review E 68(2), 26214 (2003) 4. Zhao, G., Hou, Z., Xin, H.: Frequency-selective response of FitzHugh-Nagumo neuron networks via changing random edges. Chaos: An Interdisciplinary Journal of Nonlinear Science 16, 043107 (2006) 5. Zaks, M.A., Sailer, X., Schimansky-Geier, L., Neiman, A.B.: Noise induced complexity: From subthreshold oscillations to spiking in coupled excitable systems. Chaos: An Interdisciplinary Journal of Nonlinear Science 15, 026117 (2005) 6. Makarov, V.A., Nekorkin, V.I., Velarde, M.G.: Spiking Behavior in a Noise-Driven System Combining Oscillatory and Excitatory Properties. Physical Review Letters 86(15), 3431–3434 (2001) 7. Shishkin, A., Postnov, D.: Stochastic dynamics of FitzHugh-Nagumo model near the canard explosion, Physics and Control, 2003. In: Proceedings. 2003 International Conference, vol. 2 (2003) 8. Wellens, T., Shatokhin, V., Buchleitner, A.: Stochastic resonance. Reports on Progress in Physics 67(1), 45–105 (2004) 9. Ullner, E., Zaikin, A., García-Ojalvo, J., Báscones, R., Kurths, J.: Vibrational resonance and vibrational propagation in excitable systems. Physics Letters A 312(5-6), 348–354 (2003) 10. Volkov, E.I., Ullner, E., Zaikin, A.A., Kurths, J.: Frequency-dependent stochastic resonance in inhibitory coupled excitable systems. Physical Review E 68(6), 61112 (2003) 11. Ullner, E., Zaikin, A., García-Ojalvo, J., Kurths, J.: Noise-Induced Excitability in Oscillatory Media. Physical Review Letters 91(18), 180601 (2003) 12. Zhou, C., Kurths, J., Hu, B.: Array-Enhanced Coherence Resonance: Nontrivial Effects of Heterogeneity and Spatial Independence of Noise. Physical Review Letters 87(9), 98101 (2001) 13. Gong, P.L., Xu, J.X.: Global dynamics and stochastic resonance of the forced FitzHughNagumo neuron model. Physical Review E 63(3), 31906 (2001) 14. Toral, R., Mirasso, C.R., Gunton, J.D.: System size coherence resonance in coupled FitzHugh-Nagumo models. Europhysics Letters 61(2), 162–167 (2003) 15. Casado, J.M., Baltanás, J.P.: Phase switching in a system of two noisy Hodgkin-Huxley neurons coupled by a diffusive interaction. Physical Review E 68(6), 61917 (2003) 16. Balenzuela, P., Garcia-Ojalvo, J.: On the role of chemical synapses in coupled neurons with noise. Arxiv preprint q-bio. NC/0502025 (2005) 17. Wang, J., Li, X., Hu, W.: Canards and Bifurcations in the Chemical Synaptic Coupled FHN Neurons (2006) 18. Drover, J., Rubin, J., Su, J., Ermentrout, B.: Analysis of a canard mechanism by which excitatory synaptic coupling can synchronize neurons at low firing frequencies. SIAM J. Appl. Math. 65, 69–92 (2004) 19. Wechselberger, M.: Existence and bifurcation of canards in R3 in the case of a folded node. SIAM J. Applied Dynamical Systems 4, 101–139 (2005)
Comparisons of Chemical Synapses and Gap Junctions in the Stochastic Dynamics
263
20. Cronin, J.: Mathematical Aspects of Hodgkin-Huxley Neural Theory. Cambridge University Press, Cambridge (1987) 21. Higham, D.J.: An algorithmic introduction to numerical simulation of stochastic differential equations. SIAM REVIEW 43, 525–546 (2001) 22. Szmolyan, P., Wechselberger, M.: Canards in R3. Journal of Differential Equations 177(2), 419–453 (2001)
Distinguish Different Acupuncture Manipulations by Using Idea of ISI Jiang Wang1, Wenjie Si1, Limei Zhong2, and Feng Dong1 1
School of Electrical engineering and automation, Tianjin University, 300072, Tianjin, P.R. China
[email protected] 2 School of Information engineering, Northeast Dianli University, 132012, Jilin, P.R. China
Abstract. As well-known, the science of acupuncture and moxibustion is an important component of Traditional Chinese Medicine with a long history. Although there are a number of different acupuncture manipulations, the method for distinguishing them is rarely investigated. With the idea of the interspike interval (ISI), we study the electrical signal time series at the spinal dorsal horn produced by three different acupuncture manipulations in Zusanli point and present an effective way to distinguish them. Comparing with the traditional analysis methods, like phase space reconstruction and largest Lyapunov exponents, this new method is more efficiently and effective.
1 Introduction The neural systems have strong nonlinear characters and will display different dynamics due to different system parameters or external inputs. Usually the dynamics of these systems experience little change when the parameters are slightly modified, but in vicinity of a critical point, the situation will be totally different. The systems would be driven from chaotic pattern to periodic pattern, one periodic pattern to another periodic pattern or from periodic pattern to chaotic pattern [1] [2]. Although there is an examination of intracellular membrane potential, most of the study is aimed at an easily obtained physiological measure, in particular ISI, to facilitate comparison with experimental data. ISIs play an important role in encoding the neuronal information which is conveyed along nerve fibres in the form of series of propagating action potentials. Continuing researches focus on the ISI sequence [3-12]. According to their work, an ISI can be seen as a state variable by which the temporal dynamics of the neuron can be characterized. In analogy with the Takens theorem [13] for discrete- or continuous-time dynamical systems, later generalized in [14], it should then be possible to reconstruct the essential features of the attractor dynamics of a neuron from measurements of only one variable, using e.g. delay embeddings on ISI sequences. Acupuncture is an important part of Chinese medicine theory and it is approved to be highly effective in treatment of more than 300 diseases [15]. Since the middle period of the 20th century, the applications of acupuncture have advanced in abirritation [16], quitting drug [17] and so on. Acupuncture at the Zusanli point is not only K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 264–273, 2007. © Springer-Verlag Berlin Heidelberg 2007
Distinguish Different Acupuncture Manipulations by Using Idea of ISI
265
utilized to treat diseases of common digestive system such as duodenum ulcer, acute gastritis and gastroptosis etc, but also has auxiliary efficiency on enteritis, dysentery, constipation, hepatitis, gallstone, kidney stone, diabetes and hypertension [18]. When acupuncture is applied to the Zusanli point, electrical activity can be recorded from the spinal dorsal horn. Different kinds of acupuncture manipulations can evoke various electrical time series and achieve different curative effect. Our paper is organized as follows. Section 2 provides the transmission path of the acupuncture signals background while section3 gives the time series evoked by different acupuncture manipulations. Section 5 introduces the ISI method for distinguishing the three different acupuncture manipulations to compare with the methods mentioned in section 4. The last part of this work is conclusion.
2 Transmission Path of the Acupuncture Signals According to the previous studies, the acupuncture signals follow a certain route from the acupuncture point to the spinal dorsal horn [19]. The corresponding transmission path for acupuncture signals at the Zusanli point is shown in Fig.1. Then the electrical signal time series at the spinal dorsal horn can be recorded.
Fig. 1. The transmission path of the acupuncture signals at the Zusanli point
3 The Time Series Evoked by Acupuncture There are twelve alternative manipulations used in acupuncturing at the Zusanli point. This paper selects three of them; they are the twist manipulation, the drag-plug manipulation and the gradual manipulation [20]. The time series at the spinal dorsal horn evoked by these three methods are shown in Fig.2.
266
J. Wang et al.
(a) twist manipulation
(b) gradual manipulation
(c) drag-plug manipulation Fig. 2. The time series evoked by three acupuncture manipulations
Distinguish Different Acupuncture Manipulations by Using Idea of ISI
267
4 Time Series Analysis 4.1 Phase Space Reconstruction Theory The phase space is reconstructed according to the delay coordinate method proposed by Takens [21] and Packard [22]. Here, define a discrete time array obtained by measurement or simulation, reconstruct the m-dimension state vector Xn by the delay coordinate method: (1)
.
where T is called time delay and m is embedding dimension. T and m are two important parameters in the phase space reconstruction. Values of T, m are obtained by the mutual information method [23] and Cao’s method [24], respectively. 4.2 Largest Lyapunov Exponents Based on the reconstructed phase space, we analyze the spatio-temporal behavior of the time series. The Lyapunov exponent is an important parameter for describing the non-linear system behavior. It states the rate of exponential divergence from initial perturbed conditions. Consider a one-dimensional map .
(2)
Assume the difference of the initial value x0 is δx 0 . The n-time iteration value is (3) . is Lyapunov exponent. The magnitude of the Lyapunov exponent is a measwhere urement of the sensitivity to initial conditions. The system is chaotic and unstable when the Lyapunov exponent is positive. For an n-dimensional map, the largest Lyapunov exponent (LLE) is preferred to estimate whether the system is chaotic or not. This paper adopts the method introduced by Wolf [25] to calculate the LLE of the time series at the spinal dorsal horn.html. 4.3 Experimental Data Processing We select 80,000 data points within 20s and reconstruct the phase space for these experimental data [26-29]. As to the data of the twist method shown in Fig.3, the time delay T=3 and the embedded dimension m=3, while T=3, m=3 and T=4, m=3 are chosen for the drag-plug method shown in Fig.4 and the gradual method shown in Fig.5, respectively.
268
J. Wang et al.
Fig. 3. The embedding parameters of the twist method
Fig. 4. The embedding parameters of the drag-plug method
The attractors of the reconstructed phase space are shown in Fig.6. They are all strange attractors for all the three methods even with different shapes according to the figures. So we confirm these signals are chaotic preliminarily. In addition, the LLEs according to the Wolf’s algorithm are calculated to quantitatively describe the time series. The calculation results of the LLEs are shown in Fig.7. The LLEs of the three methods are 1.7333 , 1.7676 , 1.7635 , respectively. Obviously, the difference among these LLEs is too small to help us to distinguish them clearly. Based on the attractors of the reconstructed phase space, as the situation of the former one, we can not differentiate which is which.
±0.0018
±0.0015
±0.0010
Distinguish Different Acupuncture Manipulations by Using Idea of ISI
Fig. 5. The embedding parameters of the gradual method
(a) twist method
(b) drag-plug method
(c) gradual method Fig. 6. The reconstructed attractors of the three methods
269
270
J. Wang et al.
(a) twist method
(b) drag-plug method
(c) gradual method Fig. 7. The LLEs of the three methods
5 Time Series Analysis Using the Idea of ISI As Seen from Fig.2, we could find that the amplitude in the time series almost ranges from -20mV to 20mV except for some points. In this work, we consider the point whose amplitude is larger than 30mV or smaller than -30mV as a quasi-spike point. All of the successive quasi-spike points with the same sign together make a quasispike, and it is apparent that a quasi-spike has one quasi-spike point at least. Then the authors take the analysis method of ISIs to study the three time series in Fig.2 to distinguish them. For the sake of convenience, we classify the quasi-spikes into two kinds: one with positive quasi-spike points as Pquasi-spike and the other with negative ones as Nquasi-spike. Using Kn denoting the number of the nth quasi-spike, the interquasi-spike intervals (quasi-ISIs) are given by
Distinguish Different Acupuncture Manipulations by Using Idea of ISI
271
(4)
.
For convenience, Pquasi-ISI is taken to denote the quasi-ISI of Pquasi-spikes while Nquasi-ISI for that of Nquasi-spikes. The graphs of quasi-ISIs are shown in Fig.3. Because the interval of two adjacent points in Fig.2 is a constant, the quasi-ISIs can also be measured by the time.
(a) Pquasi-ISI according to n
(b) Nquasi-ISI according to n
Fig. 8. quasi-ISI according to n
From Fig.8, we could easily distinguish the twist manipulation and the drag-plug manipulation from the third one, but can’t tell the differences between the former two correctly. So the means of Pquasi-ISIs and Nquasi-ISIs are evaluated respectively and the results are shown in Table 1. Table 1. Means of Pquasi-ISIs and Nquasi-ISIs Twist Mean of Pquasi-ISIs 2091.5 Mean of Nquasi-ISIs 2091.5
Drag-plug 2019.3 2503.4
Gradual 737.58 737.58
From Table 1, it is easy to differentiate the former two methods, because the means of Pquasi-ISI and Nquasi-ISI are different in the drag-plug method but the situation is reverse in the twist manipulation and the gradual manipulation. Thus this analysis method is an effective way to distinguish the different acupuncture manipulations.
6 Conclusions In this work, the authors developed a new method basing the idea of ISI to differentiate the different acupuncture manipulations. Compared with the traditional methods like the phase space reconstruction and the largest lyapunov exponent method, this
272
J. Wang et al.
method can distinguish the signals at the spinal dorsal horn evoked by the three acupuncture manipulations clearly. Through using it, the different manipulations produced by different doctors can be quantized, for example, a specialist finishes acupuncture for a sufferer, and the mean of Pquasi-ISIs and Nquasi-ISIs is measured as 2030 and 2400, respectively, then we can conclude that this specialist has used the twist and drag-plug manipulations and used the drag-plug manipulation more frequently. Ulteriorly, these data can be used to instruct doctors to acupuncture. Some common grounds have been discovered between the entrainment patterns under the external voltage situation and the signal time series produced by the acupuncture manipulations, even thought their models are different. For example, spikes or quasi-spikes can be found in both of them. There may be some relation between them, so our future work will focus on the problem of whether the acupuncture manipulations can be quantized into the external electric stimulus. And that will definitely lead the acupuncture theory to a more advanced level. Acknowledgments. The authors gratefully acknowledge the support of the NSFC (No.50537030).
References 1. Jianxue, X., Yunfan, G., Wei, R., Sanjue, H., Fuzhou, W.: Propagation of periodic and chaotic action potential trains along nerve fibers. Physica D: Nonlinear Phenomena 100(12), 212–224 (1997) 2. Eugene, M.: Izhikevich, Resonate-and-fire neurons. Neural Networks 14(6-7), 883–894 (2001) 3. Masuda, N., Aihara, K.: Filtered interspike interval encoding by class. Neurons Physics Letters A 311, 485–490 (2003) 4. Gedeon, T., Holzer, M., Pernarowski, M.: Attractor reconstruction from interspike intervals is incomplete. Physica D: Nonlinear Phenomena 178(3-4), 149–172 (2003) 5. Racicot, D.M., Longtin, A.: Interspike interval attractors from chaotically driven neuron models. Physica D: Nonlinear Phenomena 104(2), 184–204 (1997) 6. Jin, W.-y., Xu, J.-x., Wu, Y., Hong, L., Wei, Y.-b.: Crisis of interspike intervals in Hodgkin-Huxley model. Chaos, Solitons & Fractals 27(4), 952–958 (2006) 7. Tuckwell Henry, C.: Spike trains in a stochastic Hodgkin-Huxley system. Biosystems 80(1), 25–36 (2005) 8. Horikawa, Y.: A spike train with a step change in the interspike intervals in the FitzHughNagumo model. Physica D: Nonlinear Phenomena 82(4), 365–370 (1995) 9. Rasouli, G., Rasouli, M., Lenz, F.A., Verhagen, L., Borrett, D.S., Kwan, H.C.: Fractal characteristics of human parkinsonian neuronal spike trains. Neuroscience 139(3), 1153– 1158 (2006) 10. Canavier, C.C., Perla, S.R., Shepard, P.D.: Scaling of prediction error does not confirm chaotic dynamics underlying irregular firing using interspike intervals from midbrain dopamine neurons. Neuroscience 129(2), 491–502 (2004) 11. Gu, H., Ren, W., Lu, Q., Wu, S., Yang, M., Chen, W.: Integer multiple spiking in neuronal pacemakers without external periodic stimulation. Physics Letters A 285(1-2), 63–68 (2001) 12. Yang, Z., Lu, Q., Gu, H., Ren, W.: Integer multiple spiking in the stochastic Chay model and its dynamical generation mechanism. Physics Letters A 299(5-6), 499–506 (2002)
Distinguish Different Acupuncture Manipulations by Using Idea of ISI
273
13. Takens, F.: Detecting strange attractors in turbulence. Lecture Notes in Mathematicsb, vol. 898, pp. 336–381 (1981) 14. Sauer, T., Yorke, J.A., Casdagli, M.: Embedology. Journal of Statistical Physics 65, 579– 616 (1991) 15. Xuemin, S.: Acupuncture. China Press of Traditional Chinese Medicine, Beijing (2004) 16. Ke, Q., Wang, Y., Zhao, Y.: Acupuncture abirritation and its mechanism. Sichuan Journal of Anatomy 10(4), 224–230 (2003) 17. Yin, L., Jun, H., Qizhong, M.: Advance in Research on Abstinence from Narcotin Drugs by Acupuncture. Shanghai J. Acu-mox. 18(3), 43–45 (1999) 18. Zhang, J., Jin, Z., Lu, B., Chen, S., Cai, H., Jing, X.: Responses of Spinal Dorsal-horn Neurons to Gastric Distention and Electroacupuncture of ”Zusanli” Point. Acupuncture Research 26(4), 268–273 (2001) 19. Wan, Y.-H., Jian, Z., Wen, Z.-H., Wang, Y.-Y., Han, S., Duan, Y.-B., Xing, J.-L., Zhu, J.L., Hu, S.-J.: Synaptic transmission of chaotic spike trains between primary afferent fiber and spinal dorsal horn neuron in the rat. Neuroscience 125(4), 1051–1060 (2004) 20. Cheng, S.: Chinese Acupuncture 1998. People’s Medical Publishing House 21. Takens, F.: Detecting Strange Attractors in Turbulence. Lecture Notes in Mathematics, vol. 898, pp. 366–381 (1981) 22. Packard, N.H., Crutchfield, J.P., Farmer, J.D., Shaw, R.S.: Geometry from a Time Series. Phys. Rev. Lett. 45, 712–716 (1980) 23. Fraser, A.M., Swinney, H.L.: Independent coordinates for strange attractors from mutual information. Phys. Rev. A 33, 1134–1140 (1986) 24. Liangyue, C.: Practical method for determining the minimum embedding dimension of a scalar time series. Physica 110D, 43–50 (1997) 25. Wolf, A., Swift, J.B., Swinney, H.L., Vastano, J.A.: Determining Lyapunov exponents from a time series. Physica 16D, 285–317 (1985) 26. Yong, X., Jian-Xue, X.: Phase-space reconstruction of ECoG time sequences and extraction of nonlinear characteristic quantities. Acta Phys Sinica 51(2), 205–214 (2002) 27. Wang, Z.S., Zhenya, H., Chen, J.D.Z.: Chaotic behavior of gastric migrating myoelectrical complex. IEEE Trans. on Biome. Eng. 51(8), 1401–1406 (2004) 28. Matjaz, P.: Nonlinear time series analysis of the human electrocardiogram. Eur. J. Phys. 26, 757–768 (2005) 29. Small, M., Yu, D.J., Simonotto, J., Harrison, R.G., et al.: Uncovering non-linear structure in human ECG recordings. Chaos, Solitons & Fractals 13(8), 1755–1762 (2002)
The Study on Internet-Based Face Recognition System Using PCA and MMD Jong-Min Kim Computer Science and Statistic Graduate School, Chosun University, Korea
[email protected]
Abstract. The purpose of this study was to propose the real time face recognition system using multiple image sequences for network users. The algorithm used in this study aimed to optimize the overall time required for recognition process by reducing transmission delay and image processing by image compression and minification. At the same time, this study proposed a method that can improve recognition performance of the system by exploring the correlation between image compression and size and recognition capability of the face recognition system. The performance of the system and algorithm proposed in this study were evaluated through testing.
1 Introduction The rapidly growing information technology has fueled the development in multimedia technique. However, demand for techniques involving searching multimedia data in alarge scale database efficiently and promptly is still high. Among physical characteristics, face image is used as one of the reliable means of identifying individuals. Face recognition system has a wide range of applications such as face-based access control system, security system and system automation based on computer vision. Face recognition system can be applied to a large number of databases but requires a large amount of calculations. There are three different methods used for face recognition: template matching approach, statistical classification approach and neural network approach[1].Elastic template matching, LDA and PCA based on statistical classification approach are widely used for face recognition[2, 3]. Among these methods, statistical classification-based methods that require a small amount of calculations are most commonly used for face recognition. The PCA-based face recognition method identifies feature vectors using a Kahunen-Loeve transform. Given the proven feasibility of PCA as face recognition method, this study used PCA along with Kenelbased PCA[4, 5] and 2D-PCA[6]. The real-time face recognition system proposed in this study will be available in a network environment such as Network. Each client is able to detect face images and forward detected images to remote server by compressing the images to reduce file size. However, the compression of facial images poses a critical risk because of the possibility of undermining image quality. This study investigated the effects of image K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 274–283, 2007. © Springer-Verlag Berlin Heidelberg 2007
The Study on Internet-Based Face Recognition System Using PCA and MMD
275
compression and image size on recognition accuracy of the face recognition systems based on PCA, KPCA, 2D_PCA algorithms and came up with the most effective realtime face recognition system that can be accessed across the Network.
2 Network-Based Face Recognition System Based on the assumption that multiple variations of the face improves recognition accuracy of face recognition system, multiple image sequences were used. To reduce transmission delay, the images were compressed and minimized in the proposed system Fig. 1.
Fig. 1. Composition of the Proposed Face Recognition System
3 Face Recognition Algorithms The real-time recognition accuracy was evaluated using PCA, KPCA and 2DPCAbased algorithms. 3.1 PCA(Principal Component Analysis) The PCA-based face recognition algorithm calculates basis vectors of covariance matrix ( C ) of images in the following equation.
C=
1 M
M
∑ (X i =1
i
− m)( X i − m)T
(1)
Where xi represents 1D vector converted from the i th image in a sequence of images in the size of m × n . m indicates average of total M images of training face.
276
J.-M. Kim
Maximum number of eigenvectors ( m × n ) of covariance matrix ( C ) of images are also calculated. Top K number of eigenvectors are selected according to descending eigenvalues and defined as basisvector ( U )[7]. Feature vectors( w ) of input image( x ) are distributed as basis vectors in the vector space according to the following equation (2):
w = U T ( x − m)
(2)
3.2 2DPCA While covariance matrix is computed from 1D images converted from input images for PCA, covariance matrix ( G ) is computed from 2D images and the average image for 2DPCA in the following equation (3) [6].
C=
1 M
M
∑ ( A − E ( A))( A − E ( A)) i =1
i
i
T
(3)
Eigenvalues/eigenvectors of covariance matrix of images are calculated. Top k number of eigenvectors according to descending values are defined as basis vectors ( U ). Feature vector ( wi ) of the i th image in the image sequence of face ( A ) are extracted in the equation (4). Characteristics of the face B = [ wi ,......, wk ] can be extracted from wi .
wi = Aui ,
i = 1,2,..., K
(4)
Compared with covariance matrix used for PCA analysis, the covariance matrix derived from input images for 2DPCA analysis is smaller. This means that 2DPCA has the advantage of requiring less learning time [6]. 3.3 KPCA(Kernel Principal Component Analysis) KPCA face recognition algorithm involves converting input data on a face image into an image using nonlinear functions Φ . The converted images are reproduced as eigenvectors of the covariance matrix calculated for a set of nonlinear functions Φ and coefficients obtained during this process are used for face recognition in KPCA analysis. For PCA, the covariance matrix can be efficiently computed by using kernel internal functions as the elements of the matrix [8,9]. In the equation (5), nonlinear function Φ (x) is substituted for input image x , and F was substituted for the feature space R N .
Φ : R N → F , xk → Φ ( xk )
(5)
The training matrix and covariance matrix of images in the nonlinear space are pre~ sented in the equations (6) and (7). The nonlinear function Φ in the equation (6) must be mean zero by meeting the requirements for normalization.
The Study on Internet-Based Face Recognition System Using PCA and MMD
C
Φ
=
1 l l
∑
l
∑
k =1
k =1
~ ~ Φ ( x k )Φ ( x k ) T
277
(6)
~ Φ (xk ) = 0
(7)
4 Face Recognition Rate 4.1 Changes in Recognition Rates with Image Compression Image compression is essential to shorten transmission time through the Network. However, compression approach also has a downside as it may hinder image quality. As presented in Fig. 2, data file size was reduced but subjective image quality deteriorated as quantization parameters of compressed images increased. As a result, the recognition performance of the system is expected to decline. It is however found that recognition rate was not varied by the value of quantization parameters at the original
(a)Original image
(b)QP=10
(c)QP=20
(d)QP=30
Fig. 2. Changes in visual image with QP value
(a) Changes in data size with QP value (b) Changes in recognition rate with QP value Fig. 3. Effects of image compression on data size and recognition performance
278
J.-M. Kim
(a)QP value of 5
(b) QP value of 15
(c) QP value of 30
Fig. 4. Changes to the distance between the original image and compressed image with QP value. (Triangle in an image with the minimum distance, rectangular indicates the closest image to other class, green represents the original image and blue represents an compressed image.)
image size of 92*122 pixels, as shown in Fig. 4 (b). Such a phenomenon was also confirmed by the distance between the original image and compressed image. Changes to the distance between the original image and compressed image with the value of quantization parameters are presented in Fig. 4. There was a positive correlation between the distance and QP value. In other words, the distance between the original image and compressed image ( d 3 ) increased to 59, 305 and 689 as the value of QP reached 5, 15 and 30, respectively. However, changes to the distance is meager, so the effects of compression can be eliminated, meaning almost no changes in recognition performance but a significant reduction in data file size to be forwarded. In conclusion, transmission time can be reduced without affecting recognition performance of the system. 4.2 Changes in Recognition Rates with Image Size The size of image has an impact on transmission time and computational complexity during the recognition process. Images were passed through a filtering stage to get the low-low band using wavelet transform. Image size ( S R ) is defined in the following equation:
SR =
S origin 4( R )
(8)
For instance, the original image is reduced to 25% of its actual size when R equals to 1. Effects of image filtering are presented in Fig. 5. Effects of image size on time required for learning and recognizing images and recognition performance are presented in Fig 6. As shown in Fig 6 (a) and (b), the time required for learning and recognizing images drastically fell as the size of the image was reduced. The recognition rate also dropped when R was less than 4 but stopped its decline and remained almost unchanged when R was 4 or above. In fact, it
The Study on Internet-Based Face Recognition System Using PCA and MMD
(a)original
(b)R=1
(c)R=2
279
(d)R=3 (e)R=4
Fig. 5. Effects of image filtering
(a) Learning time
(b) recognition time
(c) recognition rate
Fig. 6. Effects of image size on time required for learning and recognizing images and recognition rate
is difficult to recognize features of the image with eyes when the image size became smaller. This is due to the fact that image size reduction involves reducing the number of faces in original images and the size of coefficient vectors.
5 Majority-Making-Decision Rule The present study found that recognition rates remained almost unchanged in response to certain degrees of compression and minification of images. Based on these findings, the study proposes a face recognition algorithm capable of improving recognition performance of the system. The algorithm is designed to calculate a recognition rate based on the majority, composition and decision-make rules when multiple input images are used. A theoretical estimation of recognition rate ( Pm ) can be calculated in the following equation on the condition that more than half of transmitted images were matched with image models.
280
J.-M. Kim
Pm =
⎛n⎞ k ⎜⎜ ⎟⎟ p s (1 − p s ) n−k k = ⎣n / 2 ⎦ ⎝ k ⎠ n
∑
(9)
Where n is the number of images forwarded, Ps is the average probability of face
⎛n⎞
recognition ⎜ ⎟ is possible number when k number of features are recognized among ⎜k ⎟
⎝ ⎠
n number of features. ⎣x ⎦ is a fixed number that is smaller than x but the largest value. For instance, when Ps is 0.94 and three images are forwarded, the value of Pm is 0.99 based on the majority, composition and decision-making rules. The proposed algorithm was tested with 3, 5 and 7 images in PCA-, KPCA- and 2DPCA-based real-time face recognition systems. According to the equation (9), the saturation estimation was achieved when Ps was roughly larger than 0.7 and n equaled to 5. Five images were therefore used for the test of the proposed system. Test results are presented in Fig 7.
6 Experimental Results The composition of the proposed system is presented in Fig 1. For the test, ChosunDB (50 class, 12 images in the size of 60*1 20) and Yaile DB were used. The test was performed in a network environment, and the optimized value of quantization parameters was applied. Experimental results are presented in Table 1. The performance of real-time face recognition system is measured by the length of time required for learning and recognizing face images, total amount of data transmitted and recognition rate. The KPCA-based proposed system increased recognition rate by 14% and reduced the time required for recognizing images by 86%. The time required for learning images was reduced when smaller sizes of images were used. The 2DPCA-based proposed system showed the recognition rate of 96.4%, compared with 90.3% of the existing 2DPCA-based system. Besides, a 78% decrease was observed in learning time and a 24% decrease in recognition time in the same system. The amount of data transmitted was reduced to 3610 bytes from 19200 bytes, leading to a 81 reduction in transmission delay. Table 1. Comparison of performance between proposed and existing systems Algorithm PCA Proposed system(PCA) 2D PCA Proposed system(2D PCA ) KPCA Proposed system(KPCA)
Recognition Rate(%) 88.7 92.0 91.3 96.4 79.0 93.5
Training Time(min) 28 16 27 6 2.4(hour) 0.33(hour)
Recognition Time(sec) 1.5 1.0 0.5 0.38 36 5
The Study on Internet-Based Face Recognition System Using PCA and MMD
281
(a) Recognition Rate
(b) Training Time Fig. 7. Effects of image compression and minification on recognition rate and time required for the recognition process of five images
282
J.-M. Kim
(c) Recognition Time Fig. 7. (continued)
7 Conclusions This study proposed a real-time face recognition system that can be accessed across the network. The test of the proposed system demonstrated that image filtering and image compression algorithms reduced transmission delay and the time required for learning and recognizing images without hindering recognition accuracy of the system. This study used multiple input images in order to improve the recognition performance of the system, and the proposed real-time face recognition system proved robust on the network. Although the system was based on PCA algorithms, it can be integrated with other face recognition algorithms for real-time detection and recognition of face images.
References 1. Jain, A.K., Duin, R.W., Mao, J.: Statistical pattern recognition: a review. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(1), 4–37 (2000) 2. Yambor, W.: Analysis of PCA based and Fisher Discriminant-based Image Recognition Algorithms. Technical Report CS-00-103, Computer Science Department Colorado State University (2000) 3. Murase, H., Shree K.N.: Visual Learning and Recogntion 3-Dobject from appearance. International journal of Computer Vision 14 (1995)
The Study on Internet-Based Face Recognition System Using PCA and MMD
283
4. Zhang, Y., Liu, C.: Face recognition using kernel principal component analysis and genetic algorithms. In: Proceedings of the, 12th IEEE Workshop on Neural Networks for Signal Processing, pp. 337–343 (2002) 5. Yang, J., Zhang, D., Frangi, A.F., Yang, J.Y.: Two-Dimensional PCA: A New Approach to Appearance-Based Face Representation and Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 26(1) (January 2004) 6. Bourel, F., Chibelushi, C.C., Low, A.A.:Robust facial expression recognition using a statebased model of spatially localised facial dynamics. In: Proceedings of Fifth IEEE International Conference on Automatic Face andGesture Recognition, pp.106–111 (2002) 7. Georghiades, A.S., Belhumeur, P.N., Kriegman, D.J.: From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose. IEEE Trans. Pattern Analysis and Machine Intelligence 23(6), 643–660 (2001) 8. Viola, P., Jones, M.: Rapid Object Detection using a Boosted Cascade of Simple Features. Computer Vision and Pattern Recognition 1, 511–518 (2001) 9. Yang, H.-S., Kim, J.-M., Park, S.-K.: Three Dimensional Gesture Recognition Using Modified Matching Algorithm. In: Wang, L., Chen, K., Ong, Y.S. (eds.) ICNC 2005. LNCS, vol. 3611, pp. 224–233. Springer, Heidelberg (2005) 10. Belhumeur, P.N., Hepanha, J.P., Kriegman, D.J.: Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection. IEEE Trans. Pattern Analysis and Machine Intelligence 19(7), 711–720 (1997) 11. Georghiades, A.S., Belhumeur, P.N., Kriegman, D.J.: From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose. IEEE Trans. Pattern Analysis and Machine Intelligence 23(6), 643–660 (2001) 12. Kim, J.-M., Yang, H.-S.: A Study on Object Recognition Technology using PCA in Variable Illumination. In: Li, X., Zaïane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 911–918. Springer, Heidelberg (2006)
Simulation of Virtual Human's Mental State in Behavior Animation Zhen Liu Faculty of Information Science and Technology, Ningbo University, 315211, China
[email protected]
Abstract. Human mental state is related to outer stimuli and inner cognitive appraisal, and it mainly includes emotion, motivation, personality and social norm. Modeling mental state of virtual humans is very important in many fields. Simulating virtual humans with mental state is a challenging branch of computer animation, where virtual humans are regarded as agents with sense, perception, emotion, personality, motivation, behavior and action. 3D virtual humans are constructed with sensors for perceiving external stimuli and are able to express emotions autonomously. Mental state-based animation is demonstrated in a prototype system.
1 Introduction Life simulation is the dream that people have been pursuing all the time. The development of artificial intelligence has promoted the advancement of traditional computer animation. The combination of computer animation and artificial intelligence is closer in recent years, and modeling 3D virtual humans have already caused extensive concerns from many fields. Artificial life is the research field that tries to describe and simulate life by setting up virtual artificial systems with the properties of life. Artificial life becomes a new method in computer animation [1][2], entertainment industry need cleverer virtual human with built-in artificial life model. Computer animation and artificial life are blended each other, intelligent virtual life, a new research field is born in the intersection between artificial life and computer animation. We can get more understanding from the developing history of computer animation. Early computer animation only includes shape and movement of geometry model, it is very difficult to draw complex natural landscape, and artificial life can help to solve these problems. In general, artificial life model is based on bottom-up strategy. Emergence is the key concept of artificial life. It means complex system is from the simple location interactions of individuals. Another key concept of artificial life is adaptation, which means evolution. In 80 years of the 20th century, many models of computer animation were presented, such as particle model, L-system, kinematics and dynamics, facial animation, etc. In 90 years of the 20th century, artificial life influenced the development of the computer animation greatly, many intelligent animation characters with perception were realized on computer systems, and behavior animation and cognitive model were the milestones of development of computer animation. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 284–291, 2007. © Springer-Verlag Berlin Heidelberg 2007
Simulation of Virtual Human's Mental State in Behavior Animation
285
Behavior animation of virtual humans is becoming more and more important in computer graphics. People want to find a flexible and parameterized method to control locomotion of virtual human. Badler developed Jack software for virtual human animation [3]. Jack software is designed for simulating human factors in industrial engineering, they also built a system called Emote to parameterized virtual human and to add personality model for virtual humans [4]. N.M.Thalmann suggested that virtual human should not only look visual, they must have behavior, perception, memory and some reasoning intelligence [5], they also presented a personality model for avatars [6]. Gratch et al. presented a domain-independent framework for modeling emotion, they thought that people have beliefs about past events, emotions about those events and can alter those emotions by altering the beliefs [7]. Cassell et.al realized a behavior animation toolkit [8], and Pelachaud et.al presented a method to create facial expression for avatars [9]. A model of virtual human's mental state is presented in this paper, a believable 3D virtual human should be provided with the mechanism of mental variables that include emotion, personality, motivation and social norm (see Fig.1). Social norm includes status, interaction information and interaction rules, it controls the process of a nonverbal social interaction, it provides the social knowledge for virtual human. Based on Freud theory [10], ID is the inborn, unconscious portion of the personality where instincts reside, and it operates on the pleasure principle. Libiduo is a source of psychic energy. Ego is responsible for organizing ways in the real world, and it operates on the reality principle. Superego is the rulers that control what a virtual human should do or not. The research is mainly based on behavior animation, and the goal is setting up a mental state-based animation model for 3D virtual humans.
Fig. 1. Structure of a virtual human
2 Perception of Virtual Human In this paper, we only discuss the visual perception. Synthetic vision is an important method for visual perception [5], which can accurately simulate the vision from view of a virtual human, the method synthesis vision on PC. When a virtual human needs to observe the virtual environment, the demo system can render the scene in invisible
286
Z. Liu
windows with no texture, and get a synthesis vision image. The virtual human can decide what he (she) could see from the values in color buffer and depth buffer. The purpose of using color buffer is to distinguish objects with different color code. The purpose of using depth buffer is to get the space position of a pixel in the window, if the coordinate of a pixel is ( inv_x, inv_y), and zscreen is depth value. Let VTM is view transformation matrix, PTM is projection transformation matrix, and VM is viewport matrix. Let PW is the world coordinate corresponding to the pixel, and IPW ={ inv_x, inv_y, zscreen}, PW is calculated by formula(1). PW= IPW × (VTM × PTM × VM)-1.
(1)
In order to simulate perception for space, we use static partition of scene octree that is a hierarchical variant of spatial-occupancy enumeration [5]. We partition the static part of the scene in advance and record octree in data base module. We can use octree to solve path searching problem, as scene octree and the edges among them compose a graph, and so the path searching problem can be transformed to the problem of searching for a shortest path from one empty node to another in the graph.(See Fig.1).
Fig. 2. A* path searching (the left is no obstacle and the right is near a house)
In a complex virtual environment in which there are a lot of virtual human, synthetic vision will be costly. Furthermore, this method cannot get the detail semantic information of objects. Therefore, another efficient method for simulation of visual perception is presented. The visual perception of virtual human is limited to a sphere [1], with a radius of R and angle scope of θ max. The vision sensor is at point Oeyes (the midpoint between the two eyes), and sets up local left-handed coordinate system. Oeyes is the origin and X axis is along front orientation (See Fig.2). To determine whether the object Pob is visible, the first step is to judge whether Pob is in the vision scope. If || Pob - Oeyes ||< R and the angle between the ray and X axis is less than θ max/2, the object Pob is in the vision scope. The second step is to detect whether other obstacle occlude Pob. We can shoot a ray OP from the Oeyes to Pob, cylinders can serve as the bounding boxes of obstacles. In order to check the intersection of OP with an obstacle’s bounding box, we can check whether OP intersects with a circle that is a projection of the obstacle’s bounding box, and
Simulation of Virtual Human's Mental State in Behavior Animation
287
further to check whether OP intersects with the obstacle’s bounding box. In a 3D virtual environment, there are a lot of dynamic objects, on which we set up feature points (such as geometric center). If one feature point is visible, the object is regarded as visible. In the demo system, all obstacles are building. Based on the Gibson’s theory of affordances [11], affordances are relations among space, time and action. A virtual human can perceive these affordances directly. An affordance is invariance for environment. In this paper, we use the Gibson’s theory to guide navigation, affordances of objects hints navigation information. We set up some navigation information in database for special area or objects in the 3D virtual environment. For example, when a virtual human wants to walk across a road, we set navigation information of the zebra crossing is accessible, so that the virtual human will select zebra crossing. We use scene octree to simulate the virtual human’s perception for static object in 3D virtual environment. The locations of all dynamic objects are recorded in memory module in animation time step. If an object is visible, we suppose that a virtual human moves on a 2D plane, let Dovc is detection radius, dmin is avoiding distance for the virtual human, if Dovc
288
Z. Liu
Fig. 3. Visible detection and detection of object’s affordance
free area and detect buildings by octree. When the emergent behavior is over, he will return to road, go to Step 5. Step 5: the virtual human will move to the next navigation area, go to Step 2.
3 Mental Model of Virtual Human For a certain virtual human, BE is a basic emotion set, BE={be1, … ,beN}, i ∈ [1, N], bei is a basic emotion (such as happiness). N is the number of basic emotion. EIi(t) is the intensity of bei. EIi(t) ∈ [0, 1], t is time variable. bei is the unit vector of bei.. For example, be1={1,…,0}, beN={0,…,1}. Let ES is emotion state, E is represented emotion vector of ES, the projection length of E on bei is EIi(t). E can be represented as formula (2): N
E=
∑
EIi(t) bei .
(2)
i =1
Let E1 and E2 are two emotion vectors, the synthesis of E1 and E2 is represented as E1 + E2 in formula (3). N
E1 + E2 =
∑
[EIi1(t) bei1 + EIi2(t) bei2].
(3)
i =1
Let EP is the set of all emotion vectors, if any element of EP satisfies to formula (1)(2), EP is called emotion vector space, bei is called the basic emotion vector. Let Oj(t) is an external stimuli, no is the number of stimuli(j=1,…, no). Θ [Oji(t)] is the stimuli intensity function of Oj(t) for emotion bei , and 0 ≤ Θ [Oji(t)] ≤ 1. Any virtual human has the ability of resisting external stimuli, let Ci(t) is the resistive intensity of emotion bei . The weaker Ci(t) of a virtual human is, the more emotional the virtual human becomes to be with emotion bei , and 0 ≤ Ci(t) ≤ 1.
Simulation of Virtual Human's Mental State in Behavior Animation
289
Let PS is a personality set, PSk (t) is the personality variable of PS, PS={PSk (t)},
Θ [PSk(t)] is the intensity of PSk (t), nps is the number of personality(k=1,…, nps), and 0 ≤ Θ [PSk(t)] ≤ 1.
MV is a motivation variable set, MVm(t) is the motivation variable of MV, MV ={MVm(t)}, w is the number of motivation variable(m=1,…,w). Θ [MVm(t)] is the intensity of MVm(t), 0 ≤ Θ [MVm(t)] ≤ 1. Let LBD is a libido set, lbds(t) is libido variable of LBD, LBD ={lbds(t)}, nl is the number of libido variable(s=1,…,nl). Θ [lbds(t)] is the intensity of lbds(t), 0 ≤ Θ [lbds(t)] ≤ 1. A status is a social degree or position. In general, a virtual human may own many status (such as father or son), let ST(CA) is a status set for virtual human CA, ST(CA)=(st1,…,stNM), NM is the number of ST(CA), sti is a status(i=1,…, NM). In general, status can control personality and motivation, we can construct a knowledge base for simulating relation among libido, status, personality, motivation, and resistive intensity of emotion, let TCi(t) is the updating Ci(t), if Θ [Oji(t)]TCi(t)>0, the emotion bei is active. When an emotion is active, emotion expression include three phases as follows: (1) Growth phase: the intensity of an emotion grows from its minimum value [EIji(t)]min to its maximum value [EIji(t)]max, [DTji]growth is the duration time. (2) Delay phase: the intensity of an emotion is equal to its maximum value [EIji(t)]max, [DTji]delay is the duration time. (3) Decay phase: the intensity of an emotion decrease to its minimum value [EIji(t)]min, [DTji]decay is duration time. In order to simplify the three phases, for a given virtual human and an emotion bei., we can give a default duration time for a certain external stimuli Oji(t), let Θ [Oji(t)]max=1. The corresponding default duration time of the three phases are indicated by DT[Oji(t)]s-growth, DT[Oji(t)]s-delay and DT[Oji(t)]s-decay. We suppose the intensity of an emotion changes with linear rule in growth phase or decay phase. The three phases are described as formula (4)-(8): [EIji(t)]min = [ Θ [Oji(t)- TCi(t)]/(1- TCi(t)).
(4)
[EIji(t)]max = Θ [Oji(t)].
(5)
[DTji]growth =[EIji(t)]max.DT[Oji(t)]s-growth
(6)
[DTji]delay =[EIji(t)]max.DT[Oji(t)] s-delay
(7)
[DTji]decay =[EIji(t)]max.DT[Oji(t)]s-decay
(8)
A snapshot of the demo system is shown in Fig.4.
290
Z. Liu
Fig. 4. A virtual human in a virtual environment
4 Conclusion and Future Work This paper discusses some basic problems on constructing virtual human's mental model. A visual perception model is presented, and we can add some semantic information in database for special area to guide navigating of virtual human. Mental states for virtual human include emotion, personality, motivation and social norm. A computer model of mental process is presented. This model integrates emotion, outer stimuli, personality, motivation, emotion, and resistive intensity of emotion together. Acknowledgements. The work described in this paper was co-supported by science and technology project of Zhejiang Province Science Department (grant no: 2006C33046), the National Grand Fundamental Forepart Professional Research (grant no: 2005cca04400), the National High-Tech Research and Development Plan of China (grant no:2006AA01Z303), the Natural Science Foundation of NingBo City(grant no:2007A610038), and the National Natural Science Foundation of China (Grant no: 60672071).
References 1. Tu, X., Terzopoulos, D.: Artificial fishes: Physics, locomotion, perception, behavior. In: Proceedings of SIGGRAPH’94, pp. 43–50 (1994) 2. Funge, J., Tu, X., Terzopoulos, D.: Cognitive Modeling: Knowledge, Reasoning and Planning for Intelligent Agents. In: Proceedings of SIGGRAPH’99, pp. 29–38 (1999)
Simulation of Virtual Human's Mental State in Behavior Animation
291
3. Badler, N., Phillips, C., Webber, B.: Simulating Humans: Computer Graphics Animation and Control, pp. 154–159. Oxford University Press, New York (1993) 4. Chi, D., Costa, M., Zhao, L., Badler, N.: The EMOTE model for effort and shape. In: Proceedings of SIGGRAPH’00, pp. 173–182 (2000) 5. Thalmann, N.M., Thalmann, D.: Artifical Life and Virtual Reality, pp. 1–10. John Wiley Press, chichester (1994) 6. Egges, A., Kshirsagar, S., Thalmann, N.M.: Generic personality and emotion simulation for conversational agents. Computer Animation and Virtual Worlds 15, 1–13 (2004) 7. Gratch, J., Marsella, S.: A Domain-independent framework for modeling emotion. Journal of Cognitive Systems Research 5(4), 269–306 (2004) 8. Cassell, J., Vilhjalmsson, H.H., Bickmore, T.: BEAT: the behavior expression Animation toolkit. In: ACM SIGGRAPH, pp. 477–486 (2001) 9. Pelachaud, C., Poggi, I.: Subtleties of facial expressions in embodied agents. Journal of Visualization and Computer Animation 13, 287–300 (2002) 10. Bernstein, D.A., Stewart, A.C., Roy, E.J., Wickens, C.D.: Psychology, 4th edn., pp. 360– 361. Houghton Miffin Company, New York (1997) 11. Gibson, J.J.: The ecological approach to visual perception, pp. 1–50. Lawrence Erlbaum Associates Inc., Hillsdale, NJ (1986)
Hemodynamic Analysis of Cerebral Aneurysm and Stenosed Carotid Bifurcation Using Computational Fluid Dynamics Technique Yi Qian1, Tetsuji Harada2, Koichi Fukui2, Mitsuo Umezu2, Hiroyuki Takao3, and Yuichi Murayama3
#58-322, 3-4-1 Okubo, Shinjuku-ku, Tokyo, 169-8555, Japan 1
Institute of Biomedical Engineering, Waseda University, 2
#
Integrative Bioscience and Biomedical Engineering, Waseda University Graduate School 58-322, 3-4-1 Okubo, Shinjuku-ku, Tokyo, 169-8555, Japan 3 The Jikei University School of Medicine 3-25-8 Shinbashi, Minato-ku, Tokyo, 105-8461, Japan
Abstract. Cerebrovascular diseases are one of the three major mortalities in Japan, such as the rupture of cerebral aneurysm and cerebral infarction caused by carotid stenosis. The growth mechanism of the cerebral aneurysm and carotid stenosis has not been clearly understood. In this research, we are introducing a numerical simulation tool; Computational Fluid Dynamics (CFD) technique, to simulate and predict the hemodynamics of blood passing through the cerebral aneurysms and stenosed carotid arteries. The results of a ruptured and an unruptured cerebral aneurysm were compared. Energy losses were calculated in ruptured and unruptured cerebral aneurysms, the results were 167 Pa and 6.3 Pa respectively. The results also indicated that the blood flows took longer residence inside of bleb of the ruptured aneurysm. The maximum wall shear stress was observed at 70% stenosis from the simulation results of stenosed carotid bifurcation. The result qualitatively agrees with classical treatments in carotid bifurcation therapy.
1 Introduction Cerebral aneurysms are pathological dilations of the arterial wall that frequently occur near arterial bifurcations. The most serious consequence is their rupture and intracranial bleeding into the subarachnoid space, with an associate high mortality and morbidity rate [1-3]. In Japan, cerebrovascular diseases are one of the three major high mortalities. The percentage of cerebral arterial diseases are shown in Figure 1. However, currently the prognosis methods for subarachnoid hemorrhages (SAHs) are still not developed enough. The mechanism of cerebral aneurysm’s genesis, growing, and rupture are not competitively understood. Although the evolution of cerebral aneurysms are affected by variety reasons; such as pathological, hemodynamic and other factors, a better understanding of the blood patterns pass through the aneurysm and K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 292–299, 2007. © Springer-Verlag Berlin Heidelberg 2007
Hemodynamic Analysis of Cerebral Aneurysm and Stenosed Carotid Bifurcation
293
physically analysis the progression of aneurysms vessel wall will provide to aneurysm surgery a lot of valuable references to understand relationship between the pathophysiological aspects and aneurysms progression depending on its geometry and local hemodynamics. It will be critically support aneurysm surgery to understanding aneurysm growth, preparing treatment, and predicting the risk of its regrowth after treatment. Blood flows in an aneurysm generally depend on its geometric configuration and relation to the parent vessel, the size of the orifice and the volume of the aneurysm. The classical treatments of aneurysms are direct surgical clipping or endovascular coil insertion which decided by the size of aneurysm. However certain intracranial aneurysms are not easy to be carried out at some special complex structure (Figure 2); fusiform, wide-neck, giant size and involvement branch vessels etc. Hence, hemodynamic factors, such blood velocities, wall shear stress (WSS), and blood pressure, play important roles in the pathogenesis of aneurysms and thrombosis.
other 14% Basilar artery6%
Middle cerebral artery 34%
Anterior communicating artery 14%
Internal carotid artery 32%
Fig. 1. The percentage of cerebral diseases
ICA
MCA
Fig. 2. Anterior cerebral circulations
The hemodynamic anaysis of cerebral aneurysms have been developed using numerical and experimental methods[4-6]. The relationship between flow patterns and diseases development, particularly the WSS, have been motivated in several of the researches in recent years. However, most of the studies have focused on employing some commercial software or directly introduced industrial numerical tools into the blood flow simulation of the aneurysms. Most of these approaches have significantly imitation in the connection with in-vivo hemodynamic factors. Therefore, the challenge for aneurysm’s hemodynamic analysis using the computational numerical methods are; validation with large numbers and specific geometries of aneurysms from clinical records, specification the blood flow boundary conditions at performing vessel domain, and availability to create a predicting criterion to recognize the risk of cerebral aneurysm before rupture. Our studies are to develop an efficient transfer system to convent the clinical image data (MRI and CT angiography) into computational available vessel shape geometries, to computationally validate blood flow patterns between a rupture aneurysm and an unrupture aneurysm, and as well to analyse flow characteristics in a series of the stenosed carotid arteries.
294
Y. Qian et al.
2 Pre-processing: Image Angiography Transfer Methods The pre-processing of numerical simulation geometry creation process is shown in Figure 3. The original clinical images are selected from the clinical database in the Jikei University School of Medicine (JUSM). In last three years, there were over 650 unrupture patients were diagnosed at JUSM, and over 75% of the patients were performed CT scan, and they are continuously taking half-yearly examination regularly. The geometries of cerebral aneurysms which were used in this study were selected from two specific patients. One example was chosen from 40 years old female who was diagnosed as no risk patient at this stage in JUSM; the case is named unruptured case in this study (Figure 4b). The another angiography was selected from a dilation consequence and finally bled (ruptured); the latter case is named ruptured case in this study (Figure 4a). The angiography of ruptured case was recorded just before the aneurysm ruptured. The geometry of aneurysm and their parent vessels in both cases are similar. Their flow conditions at internal carotid artery (ICA) were used same boundary conditions (Figure 5).
Clinical
3-D angiography
Numerical model
Mesh generation
Fig. 3. A data transfer system for aneurysm geometry generation
A medical angiography visualization software RealINTAGE® is introduced to transfer and extract DICOM format clinical image angiography into threedimensional vessel angiography, and export a STL format of numerical model. Finally the STL format geometry was meshed using ICEM (ANSYS®).
f
500
Flow Rate [mL/min]
400
a. ruptured case
b. unruptured case
300 200 100 0 0
0.2
0.4
0.6
0.8
Time [s]
Fig. 4. Ruptured and unruptured aneurysm
Fig. 5. Inlet flow condition at ICA
1
Hemodynamic Analysis of Cerebral Aneurysm and Stenosed Carotid Bifurcation
295
3 Numerical Modeling and Simulation Methods The flows in this study was assumed as an incompressibility, Newtonian (considering minimum WSS>10 Pa), and laminar flows (Reynolds number<1000). The vessels were modeled as rigid and omission roughness inside of vessel surface. CFX (ANSYS®), Navier-Stocks governing equations solved basing on Finite Volume Method (FVM), was introduced as a main solver. All simulations were performed under a personal computer; 3.2 GHz process, 4 Gbit RAM memory.
4 Post-processing and Results Analysis 4.1 Basic Modeling Study and Validation We focused on the aspect ratio (AR=depth/neck width) and curvature of parent vessel (CV) which have been considered to be a critical factor of aneurysm rupture. We simulated basic aneurysm models with some different combinations of AR and CV, and analyzed their flows in the aneurysms. As a result, wall shear stress (WSS) on the aneurysm surfaces was observed to increase against AR reducing or CV increasing. The results are shown in Figure 6. The flow rate inside of aneurysm rises with the increasing of CV, and reversely decreases against AR (1, 1.5, and 2). The results good agree with the standard in current clinical treatment. Moreover, in order to confirm the CFD results, a serial of validation tests were performed using same size of silicone model. The detail of validation tests will be published in other reports. The simulation results were validated using PIV measurement (figure 7 and 8). Figure 7 is velocity vectors on the section (section A) of the centre of the aneurysm. In the figure 7, blue colour is CFD results and red colour shows PIV results. To confirm the results shown in Figure 7, x direction velocities (vx) and y 0.0008
]
Section A
2
1
m
0.0007
m
blue: CFD red: PIV
1.5
/
0.0006
n i
2
m /
0.0005
L [ e r
0.0004
a
u
0.0003
q s r
0.0002
e p
w
0.0001
o l f n i
0 0
30
60
90
120
150
180
curvature
Fig. 6. Flow rate against CV and AR
Fig. 7. Validation results
direction (vy) velocities on the section A are compared in the figure 8. Although the velocity inside of the aneurysm is very small, the results in figure 8 give a good agreement flow patterns between CFD and experiment results. The simulation results good agree with the experimental results.
296
Y. Qian et al.
0.4 0.35 0.3 0.25
s] / m [
0.2
ty i c o l e v
0.15
vx (CFD) vx (PIV) vy (CFD) vy (PIV)
0.1 0.05
-6
-4
0 -2 0 -0.05
2
4
6
8
10
12
y [mm]
Fig. 8. Velocity at centre line (section A)
a. ruptured case
b. unruptured case
Fig. 9. Stream lines
4.2 Cerebral Aneurysm Study We performed the unsteady (pulsatile as shown in figure 5) flow analyses of a ruptured cerebral aneurysm (AR=1.8) and an unruptured cerebral aneurysm (AR=1.5). As a result, the unsteady recirculation flows were observed in the vicinity of bleb in the ruptured case (Figure 9b), and the results of the unruptured case is shown in Figure 9a. The blood flows in a ruptured aneurysm are clearly observed more complex than the flow patterns inside of unruptured case. The flows in the ruptured aneurysm are not only separation, but also exists a strong swirl created in the centre of aneurysm. The results indicate that more energy was loosed at the ruptured case when blood flows pass through the aneurysm. Furthermore, a bleb is found at ruptured case in figure 9a. A high speed recirculation and flow attachment on the bleb can be also observed around the bleb edge in figure 12. In generally, the bleb on aneurysm is judged as one of highest risk at cerebral aneurysm clinical diagnose [7]. aneurysm
with aneurysm
non-aneurysm
Fig. 10a. Pressure distributions (unruptured)
aneurysm
with aneurysm
non-aneurysm
Fig. 10b. Pressure distributions (ruptured)
Figure 10 shows blood stream lines which started at the section of ICA. Observation at the inside of aneurysms, there are more flows passing through the aneurysm of the ruptured case. In order to validate the energy loss at the aneurysms, the aneurysms were taken off on screen. The simulations of non-aneurysm were carried at same flow conditions as ruptured and unreptured cases. The total pressure losses in the aneurysm
Hemodynamic Analysis of Cerebral Aneurysm and Stenosed Carotid Bifurcation
297
Table 1. Energy lose in ruptured, unptured aneurysms and their non-aneurysm (Pa) ruptured unruptured
aneurysm 636.9 464.5
non-aneurysm 469.9 458.2
energy lose in the aneurysm 167 6.3
were 167 Pa and 6.3 Pa in the ruptured case and the unruptured case, respectively (Table 1). The energy losses under both non-aneurysm situations are very close (469.9 Pa and 458.2 Pa), it is considered except aneurysm two geometries are very similar. Hence, it was suggested that a total pressure losses may have an effect on rupture. In addition, the results indicated that at the ruptured case blood takes longer time to passes into the aneurysm, then go out from the aneurysm, and the energy loss are also higher to compare with unruptured case. The energy losses may be transferred to the energy of pressure and stress to load on the pathological aneurysm surfaces. The aneurysm surfaces will be drawn and shrunk frequently.
Fig. 11. Blood in aneurysm (unruptured)
bleb bleb
Fig. 12. Blood in aneurysm (ruptured)
Figure 11 shows flow patterns at the section of unruptured aneurysm. One vortex is observed at the top of aneurysm, and main flows from parent vessel are resisted at near aneurysm neck area. On the other hand, three strong vortexes can be observed in Figure 12(a ruptured case). The main flows pass through the aneurysm neck and directly move into the aneurysm top, and stagnation creates at the top of the aneurysm. The flows are separated around the stagnation points or lines, then turn into the bleb. A vortex is visualized inside of the bleb. According to some clinical reports, many of ruptured aneurysm was ruptured at the top of the bleb.
298
Y. Qian et al.
4.3 Carotid Stenosis Study Introduction the CFD technology we developed in the simulation of cerebral aneurysm, We also simulated basic carotid bifurcation models with a different stenosis rate (0, 25, 50, 70, 90)% as shown in Figure 13. In 50% and 70% models, flow separation was observed on the downstream of stenosis. Wall Shear Stress (WSS) was observed to increase against the stenosis rate. The maximum WSS; 25 Pa, was observed in the case of 70% stenosis rate (Figure 14, 15). It is 3.9 times higher than the normal carotid bifurcation (0% model). The results qualitatively agree with the current standards using in carotid bifurcation treatment.
0% stenosed
25% stenosed
50% stenosed
70% stenosed
90% stenosed
Fig. 13. Wall Shear Stress under stenosed carotid bifurcation model
0.8 0.7 MAX
W all S h ear S tress P a
Velocity m/s
30
Average
0.6 0.5 0.4 0.3 0.2 0.1 0 0
20
60 % Stenosis
40
25 20 15 10 5 0
80
Fig. 14. Velocity against stenosis
100
0
20
40
60
% Stenosis
80
100
Fig. 15. WSS against stenosis
5 Discussion This study has initially developed an efficient process to modeling the blood flow around cerebral aneurysms and carotid bifurcation. Using this system, it is possible to transfer medical 3-D angiography image data (DICOM format) to geometry formats. The results are possible to be used for mesh generation and also available for model manufacture for the experiment.
Hemodynamic Analysis of Cerebral Aneurysm and Stenosed Carotid Bifurcation
299
We found there are different flow patterns in a ruptured aneurysm and an unruptured aneurysm. The blood lose in a ruptured case is about 30 times higher than an unruptured case. The flow inside of ruptured case appeared more complex than in an unruptured case. Furthermore, a small bleb was observed at the top of the ruptured aneurysm, and a separation and reattachment was found near the bleb. Although, above simulations are not enough to make a conclusion a role in prediction the aneurysm rupture, it may give us an instruction for our further study. In general, the size of aspect ratio (AR) becomes a standard for critical rupture decision in medical treatment. It has been previously reported that near 80% of AR> 1.6 cerebral aneurysms was ruptured, and about 90% of unruptured aneurysm are AR<1.6. Although the ruptured vase (AR=1.8) and the unnruptured cases (AR=1.5) which we simulated in this study are just agreed with statistic results, actually there are many clinical examples that aneurysm exploded, and even a small size aneurysm (or small AR)[6]. The simulation system we developed was also applied in the simulation of carotid bifurcation. The maximum WSS= 25 Pa, was observed at 70% stenosis rate which just agree with current standards using in carotid bifurcation treatment. Our study in cerebral artery hemodynamic analysis and visualization are working very closing between clinical outcomes and engineering laboratory. Even though there are some theoretical and computational tool limitation, by using our long-term experience in cardiovascular support system and our experienced neurosurgeries, the CFD techniques constructed in this study will be available to provide valuable hemodynamic parameters to estimate a clinically prediction for aneurysm rupture. Acknowledgements. The authors express gratitude to Mr. Takanobu Yagi and other member of PIV measurement team in Umeze’s laboratory, Waseda University for generously providing available PIV measurement results for the validation.
References 1. Foutrakis, G.N., et al.: Saccular aneurysm formation in curved and bifurcation arteries. AJNR Am. J. Neuroadiol. 20, 1309–1317 (1999) 2. Linn, F.H., et al.: Incidence of subarachnoid hemorrhage: role of region, year, and rate of computed tomography: a meta-analysis. Stroke 27, 625–629 (1996) 3. Winn, H.R., et al.: Prevalence of asymptomatic incidental aneurysms: review of 4568 arteriograms. J. Neurosurg. 96, 43–49 (2002) 4. Valencia, A.: Flow dynamics in models of intracranial terminal aneurysms. MCM 1(3), 221–231 (2004) 5. Todaka, T., et al.: Analysis of mean transit time of contrast medium in ruptured and unruptured arteriovenous malformations: A digital subtraction angiographic study. Stroke 34, 2410–2414 (2003) 6. Ujie, H., et al.: Effects of size and shape (aspect ratio) on the hemodynamics of saccular aneurysms: a possible index for surgical treatment of intracranial aneurysms. J. Neurosurg. 45(1), 119–130 (1999) 7. Tateshima, S., Murayama, Y., Villablanca, J.P., Morino, T., Nomura, K., Tanishita, K., Vinuela, F.: In vitro measurement of fluid-induced wall shear stress in unruptured cerebral aneurysms harboring blebs. Stroke 34(1), 187–192 (2003)
Active/Inactive Emotional Switching for Thinking Chain Extraction by Type Matching from RAS JeongYon Shim Division of General Studies, Computer Science, Kangnam University San 6-2, Kugal-ri, Kihung-up,YongIn Si, KyeongKi Do, Korea, Tel.: +82 31 2803 736
[email protected] Abstract. During the memorizing process, knowledge is memorized closely related to the emotional state. The emotional factor also effects on the decision making process as well as memorization. Accordingly in this paper Reticular Activating System was designed and the knowledge management strategy considering the emotional switching was proposed. We applied this system to the virtual memory and tested the results.
1
Introduction
According to the studies of brain,it is known that memorizing nervous system is closely correlated to the emotional nervous system and effects on each other. The reason why we can easily memorize the favorite things is related to this fact.In the time point of moving from machine oriented technology to human oriented one, it is very important to consider the emotional factors in designing the intelligent system. On the other hand, everything in the world has own property and has a tendency to select the information matching to the self type. Selective function of a living is a essential part for surviving because any living thing cannot process all the information of the externals. Because the encircled environment has dynamic, complex and unpredictable characteristics, a living thing should select the necessary information and reconstruct the virtual world appropriate for a small living thing to survive. As the information world is getting more and more complex and dynamic, the requirement of smarter intelligent system is getting high. Smarter intelligent system means the human friendly system familiar to the person. For building this system, it is essential to adopt the human properties and intelligent processing and many studies for human intelligent system have been developed for these several decades. As one of these studies, the author designed Reticular Activating System considering the selecting measure in the previous paper and Selective functional strategy was introduced [1]. Developing the previous system, in this system we design the intelligent knowledge based system including the emotional factor. The emotional concept is inserted to the selecting, memory structuring and knowledge retrieving step. Especially Active/Inactive emotional K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 300–306, 2007. c Springer-Verlag Berlin Heidelberg 2007
Active/Inactive Emotional Switching for Thinking Chain Extraction
301
switching was designed the various extracting ways based on this knowledge network frame,Type matching and the emotional switching. We developed advanced model and applied this system to the virtual memory and tested with the sample data.
2 2.1
Advanced Reticular Activating System The Structure of Advanced Reticular Activating System
As described in the previous paper, Reticular Activating System consists of three parts, i.e., Knowledge Acquisition part, Selection part and Memory part. The different things compared to the previous model are Emotional factor and Type matching concept.
Fig. 1. Advanced Reticular Activating System
First,Knowledge acquisition part has multi modular NN(neural Network)s and perform the learning process with the training data according to the categories. It uses BP(Back Propagation) algorithm. The output nodes of Modular NN are connected to nodes in Associative layer which has logical network connected by associative relations. Its learning mechanism is described in the paper [1] in detail. Second, Reticular Activating layer has a knowledge net which consists of nodes and their associative relations. The nodes in knowledge net are connected to the nodes of Associative layer vertically. The importance value is assigned to the connection weight of this vertical relation. Selection module performs selecting process with these values of associative relations and vertical relations using the criteria given by Meta Knowledge. Third, Storing to Memory consists of two part of Knowledge Reconfiguration and storing the values for NN. In Reconfiguration, the selected nodes and relations are reconfigured and stored in memory. The knowledge net is performed by attaching nodes centering around common node. After reconfiguration the
302
J. Shim
centering node is connected to index which is used in searching process. In the case of polysemy, the common node is connected by Active/Inactive Emotional switching to multiple knowledge net. The another part of memory is storing the values for NN. After finishing the learning process of modular NN, this system stores the values of category, parameters and weight matrix. These stored values are used for perception, inference and knowledge retrieval.
3 3.1
The structure of Knowledge Cell in Knowledge Network Knowledge Cell
Knowledge cell is an atomic element composing the knowledge network in memory. It consists of Knowledge ID, Self Type, Emotional factor and Entropy of the cell as shown in the following figure.
Fig. 2. Knowledge cells and relations in knowledge network
3.2
Type Matching Relation
We defined self type as a particular property of the object. An object has one of five types, i.e. M,F,E,K and S. There exists Attracting relation or Rejecting relation between two types. If one type meets Attracting relation, two types are associated and their relational strength increases. On the contrary, if it meets Rejecting relation,expelling strength works on two types and their strength decreases as shown in table 1 and table 2. 3.3
Type Matching Selection Mechanism
Type Matching Selection System was designed as following Figure 2. If ACTIVE/INACTIVE EMOTIONAL SWITCHING switch turns on, the activating degree of selecting type is set. According to ACTIVE/INACTIVE EMOTIONAL SWITCHING signal, Type Selection Module selects matching knowledge with
Active/Inactive Emotional Switching for Thinking Chain Extraction
303
Table 1. Type Matching Rule : Attracting Relation Attracting Relation M⊕F F⊕E E⊕K K⊕S S⊕M Table 2. Type Matching Rule: Rejecting Relation Rejecting Relation ME ES SF FK KM
Fig. 3. Basic structure of Knowledge net
that type from Master Knowledge net in Reticular layer. Then Knowledge Reconfiguration module reconstructs new knowledge net with selected knowledge in the previous step. Active/Inactive switching controls the signal for activating status. ACTIVE/ INACTIVE EMOTIONAL SWITCHING switching has two status of P and N. P signal represents ’Active’ status and N signal represents ’Inactive’ status. If ACTIVE/INACTIVE EMOTIONAL SWITCHING switching is set on the status of ’P’, ’Affecting relation’ works stronger than ’Being affected relation’. Conversely, if it is ’N’ status, ’Being affected relation’ is stronger than ’Affecting relation’. For example, Suppose that the type of one object is B and type B is related to two Type Matching Rules ,i.e. A ⊕ B, B ⊕ C. In this rule A is ’affecting relation’ to B and C is ’being affected relation’ by B. That is,on the signal of ’P’ a B- type-object accepts C type knowledge stronger than A type knowledge. On the signal of ’N’,a B-type-object accepts stronger A type knowledge than C type knowledge.
304
3.4
J. Shim
Thinking Chain Extraction
The graphic representation of knowledge net is translated to associative knowledge list of table 3. In thinking chain extracting mechanism, starting from keyword node all the related knowledge chains are extracted according to the associative strength and emotional factor. Table 3. Associative knowledge list K − node T ype M E Relation − S K − node Ki
Ti
Mi Ei
Sij
Kj
Kj
Tj
Mj Ei
Sjk
Kk
:
:
:
:
:
:
Algorithm 1 : Thinking chain extraction STEP 1: Search the keyword. STEP 2: Look up Attracting Rule Table Search Affecting Type,Hp Search Being affected Type, HN STEP 3 : Look up Rejecting Rule table Search Affecting Type,Rp Search Being affected Type, RN STEP 4 : Extract the related node one by one from the knowledge list Put the extracted knowledge cell to the thinking chain list. STEP 5 : If Active emotional switching; then activate the emotional Factor; STEP 6 : If Inactive Emotional Switching; then ignore the Emotional factor STEP 7 : Output thinking chain list STEP 8: Stop.
4
Experiments
ACTIVE/INACTIVE Switching selection mechanism is applied to virtual memory. Table 4 shows translated Associative Knowledge List that represents master knowledge Net. Suppose that the type of object is F, the extracted thinking chain is as following Figure 6. New net was configured by extracted Type Matching Rules which are M ⊕ F and F ⊕ E. Figure 6 described the testing result of ACTIVE/INACTIVE Masking. It shows Associative knowledge list of reconfigured knowledge net according to
Active/Inactive Emotional Switching for Thinking Chain Extraction
305
ACTIVE/INACTIVE switching signal. For the type of object, F, a piece of type matching knowledge was selected and new knowledge net was reconfigured. As a result,it was found that New knowledge net controlled by ACTIVE/INACTIVE Type matching selection was successfully made. This new knowledge net containing type information can be used for efficient data retrieving. Table 4. Associative Knowledge List of Master Knowledge Net Ki T M E Rij Kj K1 F 0.0 0.2 1.0 K2 K1 F 0.0 0.2 0.0 K8 K2 M 0.0 0.7 0.9 K3 K2 M 0.0 0.7 0.5 K6 K3 M 0.0 -0.1 0.7 K4 K3 M 0.0 -0.1 1.0 K5 K4 E 0.0 0.7 0.0 N ull K5 E 0.0 -0.3 0.3 K7 K6 S 0.0 0.9 0.4 K7 K7 M 0.0 0.1 0.6 N ull K8 K 0.0 0.5 0.1 K9 K8 K 0.0 0.5 0.1 K10 K8 K 0.0 0.5 1.0 K11 K9 S 0.0 0.1 0.7 N ull K10 K 0.0 0.3 0.7 K12 K11 E 0.0 0.5 0.4 K12 K12 M 0.0 0.1 0.4 N ull
Fig. 4. Thinking chain extraction
5
Conclusions
In this paper, we propose Reticular Activating system which has functions of selective reaction, learning and inference. This system consists of Knowledge acquisition, selection , storing and retrieving part. Reticular Activating layer is connected to Meta knowledge in the high level of this system and takes part
306
J. Shim
in Data Selection. Type definition and ACTIVE/INACTIVE Type matching selection mechanism in Reticular Activating System were specially designed.We applied this system to the virtual memory and tested ACTIVE/INACTIVE Type Matching selection mechanism. As a result of testing, we could find that new knowledge net was successfully made by ACTIVE/INACTIVE Type matching selection. It is expected that Reticular Activating system , the concept of its ACTIVE/INACTIVE Type matching selection can contribute to implement flexible associative memory and efficient retrieval mechanism.
References 1. Shim, J.-Y.: Knowledge Retrieval Using Bayesian Associative Relation in the Three Dimensional ModularSystem. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds.) APWeb 2004. LNCS, vol. 3007, pp. 630–635. Springer, Heidelberg (2004) 2. Goldstein, E.B.: Sensation and Perception, BROOKS/COLE 3. Pearl, J.: Probabilistic reasoning in intelligent systems, networks plausible inference. Morgan kaufman Publishers, San Francisco (1988) 4. Fausett, L.: Fundamentals of Neural Networks. Prentice Hall, Englewood Cliffs (1994) 5. Haykin, S.: Neural Networks. Prentice Hall, Englewood Cliffs 6. Shim, J.-Y., Hwang, C.-S.: Data Extraction from Associative Matrix based on Selective learning system. In: IJCNN’99, Washongton D.C, vol. 4, pp. 2550–2553 (1999) 7. Anderson, J.R.: Learning and Memory. Prentice Hall, Englewood Cliffs 8. Shim, J.-Y.: Automatic Knowledge Configuration by Reticular Activating System. LNCS (LNAI). Springer, Heidelberg (2005)
Pattern Recognition for Brain-Computer Interfaces by Combining Support Vector Machine with Adaptive Genetic Algorithm Banghua Yang, Shiwei Ma, and Zhihua Li Shanghai Key Laboratory of Power Station Automation Technology, Department of Automation, Shanghai University, Shanghai 200072, China
[email protected],
[email protected],
[email protected]
Abstract. Aiming at the recognition problem of EEG signals in brain-computer interfaces (BCIs), we present a pattern recognition method. The method combines an adaptive genetic algorithm (GA) with the support vector machine (SVM). It integrates the following three key techniques: (1) the feature selection and model parameters of the SVM are optimized synchronously, which constitutes a hybrid optimization; (2) the aim of the hybrid optimization is to improve the classification performance of the SVM; and (3) the hybrid optimization is solved by using the adaptive GA. The method is used to classify three types of EEG signals produced during motor imaginations. It yields 72% classification accuracy, which is higher 8% than the one obtained with the individual optimization of the feature selection and SVM parameters.
1 Introduction A brain-computer interface (BCI) is an alternative communication and control channel that does not depend on the brain’s normal output pathway of peripheral nerves and muscles [1]. A BCI system can help severely disabled people to communicate with computers or control electronic devices through their thoughts. Most BCIs utilize EEG signals to detect distinguishable brain states. These distinguishable brain states are then transformed into external actions through the recognition of EEG signals. Over the past years many evidences have evaluated the possibility to recognize a few mental tasks from EEG signals [2-4]. However, how to improve the recognition performance of EEG signals is still a key problem [5]. The recognition procedure of EEG signals includes three steps: the feature extraction, the feature selection and the classification. This paper mainly concerns the feature selection and the classification. The feature selection is to select an optimal feature subset from all candidate features, which is an optimization problem. The feature selection can improve the generalization performance of the classifier, reduce its complexity and speed up its training process. In the classification, parameters of a classifier affect its classification performance. The selection of parameters of the classifier is also an optimization problem. In previous methods used in BCIs, none of these two optimization problems are considered or they are performed independently K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 307–316, 2007. © Springer-Verlag Berlin Heidelberg 2007
308
B. Yang, S. Ma, and Z. Li
[6-10]. However, the feature selection and the classification are dependent on each other. No optimization or optimizing only one of them is difficult to ensure that these two problems obtain optimal solutions simultaneously. We will explore a novel method that optimizes the feature selection and classifier parameters simultaneously. The support vector machine (SVM) is a relatively new classification technique that has shown to perform strongly in a number of real-world problems, including BCIs [5]. We will use the SVM as the classifier. At the same time, the genetic algorithm (GA) is a global and probabilistic search algorithm that is based on the mechanics of natural selection and population genetics. It can maintain a good balance between searching width and searching deepness [11]. So, we will use an adaptive GA to optimize the Feature Selection and SVM parameters simultaneously, so the method is called GA-FS-SVM.
2 Data Six healthy subjects (sub1-sub6) participated the experiment. They seated in a shielded room with dim lighting. Sounds around the surroundings were not controlled painstakingly considering for further application. A 32-channel elastic electrode cap was used to record EEG. The data were recorded at the sampling rate 100Hz with ESI-128. Each subject repeated the experiment for two sessions. Each session comprised 150 trials. The subjects were asked to imagine performing one of three motor imagery tasks (playing basketball with left hand, playing basketball with right hand, and braking with right foot) in a self-paced mode during each trial. Each trial lasted 5.75s~6.25s (mean 6s) and consisted of three phases: 1) a 0.75s~1.25s (random) resting phase; 2) a 1s preparation phase; and 3) a 4s of motor imagery task phase during which subjects were performing the corresponding motor imagery task according to the direction of the arrow (a left arrow and a right arrow indicate to imagine left hand and right hand movement respectively, a down arrow means right foot). The data during the last 4s of each trial were used to perform analysis. The module of the data acquisition can be seen in Fig.1.
3 Method 3.1 The Feature Extraction Fig.2 depicts the diagram of a simple BCI system. The proposed GA-FS-SVM concerns the feature selection and the classification. As for the feature extraction, we adopt the spectral power as the feature, which is commonly used in BCIs. The most related frequency information during motor imagery is the Mu (8-12Hz) and Beta (18-26Hz) rhythms on the scalp just above the motor cortex [12]. Mean powers within these two bands are calculated as features. So, two dimensional features can be obtained for each EEG channel. Considering the practicality of BCIs system, we use six electrodes (C3, C4, P3, P4, CZ, and PZ, see Fig.3.) which are considered important EEG channels. Then we can obtain a 12-dimensional feature vector F = { f1 , f 2 ,..., f12 } , in which f 1 ~ f 6 are mean powers within the band 8-12Hz
Pattern Recognition for BCIs by Combining SVM with Adaptive GA.
309
Fig. 1. The module of the data acquisition
Fig. 2. The diagram of a simple BCI system
c3
cz
c4
p3
pz
p4
Fig. 3. The used six electrodes
of six channels respectively according to the above channel order and
f 7 ~ f 12 are
mean powers within the band 18-26Hz. 3.2 The Adaptive GA Theory The GA is a global and probabilistic search algorithm that is based on the mechanics of natural selection and population genetics. It can maintain a good balance between searching width and searching deepness. The GA starts to search from a set of initial solutions in a population. An individual (al-so called a chromosome) implies a possible solution to the problem and it consists of many genes. Each gene represents a feature or a parameter. In the feature selection, a binary gene represents a feature in
310
B. Yang, S. Ma, and Z. Li
which a gene bit “1” denotes the corresponding feature is selected and a gene bit “0” denotes the feature is eliminated. The method of optimizing parameters is similar to the feature selection and the only difference between them is that a floating-point gene represents a parameter. The GA consists of many parameters, such as selection operator, crossover operator, mutation operator, etc. The crossover operator is crossed by probability Pc and the mutation operator is mutated by probability Pm . Fixed crossover probability Pc and mutation probability Pm may result in premature and local convergence. So, we adopt an adaptive GA. The adaptive GA can be defined by the following formulas:
Pc = k1 ( f max − f ′) /( f max − f )
(1)
Pm = k 2 ( f max − f ′′) /( f max − f )
(2)
Where k1 , k 2 are constants, k1 , k 2 ≤ 1.0 , the two parameters should be adjusted ac-
cording to a given problem, f max and f are the maximum fitness and the average fitness of a population respectively; f ′ is the larger one of fitness values of the two individuals used to cross; f ′′ is the fitness of the individual used to mutate. The detailed description of the adaptive GA can be seen in [13]. 3.3 The Basic SVM Theory
The SVM is a powerful and relatively new classification method based on statistical learning theory. The SVM has many remarkable characteristics such as good generalization performance, the absence of local minima and sparse representation of the solution. The problem of pattern recognition may be stated as follows: given a data set L , with xi input features, yi classification output and m the number of samples, then
L = {( x1 , y1 ), ( x2 , y2 ),..., ( xm , ym )}
(3)
The SVM finds an optimal separating hyperplane by maximizing the margin between classes. The algorithm consists of solving the following optimization problem: l 1 ( w ⋅ w ) + C ( ξi ) ∑ min 2 w,ξ i =1
(4)
ξ i ≥ 0 , y i ( wφ ( x i ) + b ) ≥ 1 − ξ i . The parameter ξ i is called a slack variable and ensure that the problem has a solu-
where
tion in case the data are not linear separable. The parameter C is a tradeoff variable, w is an adjustable weight vector, ϕ ( x) is a nonlinear function for feature mapping. The decision function is
Pattern Recognition for BCIs by Combining SVM with Adaptive GA.
311
m
f ( x) = ∑ wφ ( xi ) + b
(5)
i =1
It can be described further by the dot product, m
f ( x) = ∑ α i yi (φ ( xi ) ⋅ φ ( x)) + b
(6)
i =1
The dot product can be performed by a Kernel function K ( x, y ) . So, the decision function can be described as follows: l
f ( x ) = ∑ α i y i K ( xi , x ) + b
(7)
i =1
During solving the SVM, finding good Kernel function parameters and a parameter C is an important part of the model selection. The classification performance of the SVM is strongly dependent on values of parameters. 3.4 The GA-FS-SVM Method
The feature vector is F = { f 1 , f 2 , L , f 12 } . We can encode a chromosome with S = {s1 , s2 , L , s12 } , si ∈ {0,1}, i = 1,2,L,12 . Before classification with the
SVM, some SVM parameters need to be given. The most common Kernel functions are polynomial function and radial basis function. We select the polynomial func-
(Gamma * u ⋅ v + Coeff ) Degree , where u , v are input vectors, Gamma, Coeff , Degree are parameters of the kernel function. So the training model of the SVM can be constructed as M = {Gamma, Coeff , Degree, C} , where Gamma, Coeff , Degree, C ≥ 0 . We can encode a chromosome with C = {c1 , c2 , c3 , c4 } , where ci ∈ R , i=1,2,3,4. tion
The GA-FS-SVM method optimizes the feature selection and SVM parameters simultaneously and its structural diagram is shown in Fig.4. The hybrid optimization can be regarded as optimizing H = { F , M } . The chromosome H is encoded with G = {s1 , s2 , L s12 , c1 , c2 , c3 , c4 } . A specified chromosome leads to a feature subset and a SVM model simultaneously. We evaluate the performance (fitness) of a chromosome using the average classification accuracy of the SVM. The calculation of the fitness can be outlined as follows: (1) to a specified chromosome, we randomly select half of all trials as training samples; (2) the selection procedure of training samples is performed ten times and so we can obtain ten values of the classification accuracy; (3) the fitness is obtained by averaging the ten values. When the adaptive GA attains convergence, the optimal chromosome is obtained, i.e. the optimal feature subset and SVM parameters are obtained. The optimized results are used to classify unknown samples.
312
B. Yang, S. Ma, and Z. Li
Feature Subset
F H M Optimized Feature subset and SVM Parameters
G SVM Parameters
SVM
Fig. 4. The structural diagram of the GA-FS-SVM
3.5 Parameters of the Adaptive GA
(1) Parameters initialization: We select the evolution generation t=100, population size p=100. The selected ranges of Gamma, Coeff , Degree, C are [0,2], [0,5], [0,1], [0,500] respectively according to our experience. (2) Selection: we adopt the selection mechanism of proportional fitness and elitism strategy. The chance of reproduction for an individual of the parent generation to the next generation is proportional to its fitness value. Meanwhile, the fittest individual is taken over directly into the next generation. (3) Crossover: we select a single-point crossover mechanism with a probability of pc =0.8 to create new chromosomes in each pair. The crossover probability pc is obtained according to formula (1). (4) Mutation: we adopt a multi-uniform mutation operator combining with a multiGaussian mutation operator, in which the mutation probability of each operator is 0.05. The mutation probability of each operator pm is obtained according to formula (2). In formula (1) and (2), k1 =0.8; 6) k 2 =0.4. k1 and k 2 .are obtained by the experience and adjustments. The other parameters are selected according to common suggestions in [11].
4 Results and Analysis 4.1 Results
In order to verify the performance of the GA-FS-SVM, we perform the following three strategies: (1) GA-FS-SVM: it is described in section 3; (2) GA-FS: the adaptive GA only optimizes the feature selection. As for the classification, we randomly select five groups of SVM parameters: C1{0.1, 1, 0.1, 300}, C2{0.2, 0.1, 0.1, 200}, C3{1, 0.1, 0.1 300}, C4{1.5, 0.1, 0.1, 250}, C5{1.2, 3, 0.1, 400}. (3) GA-SVM: the adaptive GA only optimizes SVM parameters. As for the feature subset, we randomly select five groups: F1 {f1, f2, f5}, F2 {f2, f5, f8, f9, f11}, F3 {f3, f5, f7, f9}, F4 {f5, f6, f7, f9, f10}, F5 {f1 ~ f12}.
Pattern Recognition for BCIs by Combining SVM with Adaptive GA.
313
It should be noted that initial features, GA parameters and the calculation of the fitness used in all above methods are the same. As an example, Fig.5 shows the classification accuracy of training samples of subject 1 (sub1) versus generation t with different strategies. Classification results of testing samples of different subjects with different strategies are shown in Tab.1. It also should be noted that results of the GAFS-SVM are obtained by running the program ten times and then averaging the ten values. We calculate the mean value and the standard deviation of classification accuracies. It should be noted that these values are obtained by calculating C1~C5 in the GA-FS, F1~F5 in the GA-SVM. In addition, we perform the one sample t test to the GA-FS-SVM with other strategies. The mean value, the standard deviation, and the t value are shown in Tab.2. The comparison of mean values of the classification accuracy among different strategies is plotted in Fig.6. 4.2 Analysis
Classification accuracy
From Tab.1 we can see that different strategies can result in different results for any one subject. In addition, different parameters in one strategy can also result in different classification accuracies, which show that the feature selection and SVM parameters all affect the classification performance. The Fig.6 shows that the GA-FS-SVM obtains the best result among all strategies because it optimizes the feature selection and the classification synchronously and so it obtains the optimal feature subset and SVM parameters synchronously. Results of t test in Tab.2 show that the classification accuracy obtained by the GA-FS-SVM is significantly higher than other methods. The GA-FS only optimizes the feature selection and the GA-SVM only optimizes SVM parameters, which means that they lack optimal SVM parameters or the optimal feature subset. So obtained results by them are inferior to the one obtained by the GA-FS-SVM. The GA-FS-SVM obtains an average classification accuracy (mean value of six subjects) 72.0%, which is higher about 8% than the one (64.2%, by averaging six subjects and the GA-FS, the GASVM) obtained by the GA-FS and the GA-SVM. 0.75 0.72 0.69 0.66 0.63
GA-FS-SVM GA-FS (C2) GA-SVM (F2)
0.60 0.57 0
20
40
60
80
100
Generation t Fig. 5. The classification accuracy versus generation t
314
B. Yang, S. Ma, and Z. Li Table 1. Classification results of different subjects with different strategies
GA-FS
name
-SVM
Classification accuracy (%)
Method
GA-FS C1
C2
C3
GA-SVM C4
C5
F1
F2
F3
F4
F5
sub1
70.6
67.2 65.4 67.5 68.6 66.5 64.7 62.9 63.6 62.8 61.7
sub2
72.4
65.6 63.8 64.2 67.5 64.8 66.1 64.8 65.1 64.1 62.8
sub3
68.5
61.8 59.7 60.1 61.6 59.8 62.9 64.1 63.1 63.7 65.1
sub4
74.1
64.3 62.9 61.7 63.6 60.5 68.5 69.1 66.8 65.7 66.2
sub5
68.9
63.5 60.7 61.5 59.8 60.5 63.7 65.8 61.9 62.7 65.3
sub6
75.8
65.8 64.7 62.9 63.1 64.8 69.1 68.7 66.8 67.4 69.1
Table 2. The mean value, the standard deviation and t value
subjects
Sub2
Sub3
Sub4
Sub5
Sub6
GA-FS
67.0
65.2
60.6
62.6
61.2
64.3
GA-SVM
63.1
64.6
63.8
67.3
63.9
68.2
Standard GA-FS deviation GA-SVM (%) t (9) p<0.01
1.19
1.46
1.02
1.52
1.42
1.23
1.11 -7.501
1.23 -18.12
0.88 -10.50
1.47 -10.24
1.66 -9.91
1.06 -12.86
Mean value (%)
classification accuracy (%)
sub1
78 76 74 72 70 68 66 64 62 60
GA-FS-SVM GA-FS GA-SVM
1
2
3 4 5 subject number
6
Fig. 6. The comparison of different strategies
Pattern Recognition for BCIs by Combining SVM with Adaptive GA.
315
5 Conclusions (1) Both the feature selection and SVM parameters play an important role in the classification. Different feature subset and different SVM parameters can result in different classification results. (2) In BCIs, the GA-FS-SVM optimizes the feature selection and the SVM parameters synchronously, which can pick the most promising feature subset and excellent training model to classification. It avoids the disadvantage of optimizing only one of them. Duo to the limited amount of data and subjects, the classification accuracy needs to be further investigated. Based on the very promising results we obtained here, we are investigating the possibility of developing the GA-FS-SVM further. In this paper, we want to show the potential of the hybrid optimization method. Acknowledgements. The research is partly supported by Shanghai Leading Academic Discipline Project (T0103).
References 1. Wolpaw, J.R., Birbaumer, N., Heetderks, W.J.: Brain computer interface technology: a review of the first international meeting. IEEE Trans. Rehab. Eng. 8, 64–73 (2000) 2. Millán, J.d.R., Mouriño, J., Franzé, M., Cincotti, F.: A local neural classifier for the recognition of EEG patterns associated to mental tasks. IEEE Trans. Neural Networks 13, 678– 686 (2002) 3. Millán, J.d.R.: Adaptive brain interfaces. Commun. ACM 46, 74–80 (2003) 4. Wolpaw, J.R., McFarland, D.J., Neat, G.W., Forneris, C.A.: An EEG-based braincomputer interface for cursor control. Electroenceph. Clin. Neurophysiol. 78, 252–259 (1991) 5. schroder, M., Bogdan, M., Rosenstiel, W., Hinterberger, T. (ed.): Automated EEG Feature Selection for Brain Computer Interfaces. In: Proc. 1st Int. IEEE EMBS Conf. Neural Engineering, Capri Island, Italy, pp. 626–629 (2003) 6. Garrett, D., Peterson, D.A., Anderson, C.W., Thaut, M.H.: Comparison of Linear, Nonlinear, and Feature Selection Methods for EEG Signal Classification. IEEE Trans. Neural Syst. Rehab. Eng. 11, 141–144 (2003) 7. Graimann, B., Huggins, J.E., Levine, S.P., Pfurtscheller, G.: Detection of ERP and ERD/ERS patterns in single ECoG channels. In: Proc. 1st Int. IEEE EMBS Conf. Neural Engineering, Capri Island, Italy, pp. 614–617 (2003) 8. Yom-Tov, E., Inbar, G.F.: Feature selection for the classification of movements from single movement-related potentials. IEEE Trans. Neural Syst. Rehab. Eng. 10, 170–177 (2002) 9. Kaper, M., Meinicke, P., Grossekathoefer, U., Lingner, T., Ritter, H.: BCI Competition 2003—Data Set IIb: Support Vector Machines for the P300 Speller Paradigm. IEEE Trans. Biomed. Eng. 51, 1073–1076 (2004) 10. Lal, T.N., Schröder, M., Hinterberger, T., Weston, J., Bogdan, M., Birbaumer, N., Schölkopf, B.: Support vector channel selection in BCI. IEEE Trans. Biomed. Eng. 51, 1003–1010 (2004)
316
B. Yang, S. Ma, and Z. Li
11. Guangnan, X., Ruiwei, C.: Genetic Algorithm and Engineering Optimization. Tsinghua, Beijing, China (2004) 12. Brett, D.M., Justin, W., Sebastian Seung, H.: BCI competition 2003-Data Set Ia: combining gamma-band power with slow cortical potentials to improve single-trial classification of electroencephalographic signals. IEEE Trans. Biomed. Eng. 51, 1052–1056 (2004) 13. Guozheng, Y., Ting, W., Banghua, Y.: Automated feature selection based on an adaptive genetic algorithm for brain-computer interfaces. LNCS, pp. 575–582 (2006)
Improved Locally Linear Embedding by Cognitive Geometry Guihua Wen1 , Lijun Jiang1 , and Jun Wen2 1
South China University of Technology, Guangzhou 510641, China
[email protected] 2 Hubei Insitute for NationalitiesEnsi 445000, China
Abstract. Locally linear embedding heavily depends on whether the neighborhood graph represents the underlying geometry structure of the data manifolds. Inspired from the cognitive relativity, this paper proposes a relative transformation that can be applied to build the relative space from the original space of data. In relative space, the noise and outliers will become further away from the normal points, while the near points will become relative closer. Accordingly we determine the neighborhood in the relative space for Hessian locally linear embedding, while the embedding is still performed in the original space. The conducted experiments on both synthetic and real data sets validate the approach.
1
Introduction
As classic linear approaches can be reliably applied only when the data manifolds are linear, two new approaches have recently been developed to deal with the nonlinear data manifold. One is ISOMAP that preserves the manifold geometry at all scales and has better ability to deal with nonlinear manifolds [2]. It has many variants such as incremental extension of ISOMAP [8] . However they will not be investigated here. The other is locally linear embedding (LLE) that is based on local approximation of the geometry of the manifold[1]. LLE has many variants, such as Laplacian eigenmaps [4]and Hessian eigenmaps(HLLE) [5], incremental LLE [7], supervised LLE [10,14], robust locally linear embedding[11], integrated LLE with classic PCA or LDA, integrated LLE with SOM etc. HLLE bears substantial resemblance to the LLE and LE, but shows better excellent performance on highly twisted data. In the asymptotic limit of infinite sampling, similar to ISOMAP, HLLE can recover manifolds that are locally isometric to subsets of a lower dimensional Euclidean space. Particularly for ISOMAP, these subsets must be open and convex, whereas for HLLE, they need only be open and connected[5]. Furthermore it is also more computationally efficient. However, the performance of HLLE heavily depends on how well the constructed neighborhood graph represents the underlying data manifold. Currently approaches to determining the neighborhood for HLLE are easily threatened by noise and outliers, as where the determined neighborhood may be critically distorted. This can in turn lead to drastically incorrect low-dimensional embedding. Currently four kinds of work focus on optimizing the neighborhood. One focuses K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 317–325, 2007. c Springer-Verlag Berlin Heidelberg 2007
318
G. Wen, L. Jiang, and J. Wen
on building the connected neighborhood graph to guarantee that the information on relative positions of the connected components would not be lost[12,13]. The second focuses on discovering the neighborhood with any shape using all kinds of measures such as the geodesic distance and path algebra [21] and special distances for handwriting recognition[2] as well as for labeled data in supervised manifold learning [10,20]. Thirdly, the optimal neighborhood size is expected to be determined automatically by the residual variance and reconstruction error [15,9]. For the unevenly distributed manifolds, the adaptive neighborhood size can be also determined[19]. Finally, the neighborhood is optimized by deleting the noises or outliers from the input data set[17], however sometimes the outliers are useful to data analysis such as outlier mining so that they can not be removed simply. This paper exploits an new way to optimize the neighborhood by simulating cognitive laws. Inspired from the cognitive relativity, it proposes a relative transformation to build the relative space from the original space of data, and then determine the neighborhood relationships for HLLE in relative space, while the embedding is still performed in the original space. The improved HLLE has better stability to deal with the sparsely sampled or noise contaminated data sets. This approach is simple, general and easy to be implemented. It also has clear physical meaning and does not add any parameter.
y x
Fig. 1. Human perception on images is relative
2
Computational Cognitive Geometry
It is experienced that the perception is relative. This can be illustrated as Fig.1. When we observe the circle x, it looks bigger than its original size as it is compared with its around smaller circles. In contrast, when the circle y is observed, it becomes smaller than its original size by comparing with its around circles. Consequently, when we observe x and y simultaneously, generally x is regarded as bigger than y. As a matter of fact, they are the same size. This cognitive characteristic is very beneficial for us to distinguish the object from its around objects. It can be modelizd using geometry model to process the data more efficiently. We call this approach as computational cognitive geometry. For example, we can define a transformation on the original space to build the new space whose dimensions are composed of all points in the original space.
Improved Locally Linear Embedding by Cognitive Geometry
319
The newly created space is called relative space and generated through relative transformation: ΓX : X → Y ⊂ R|X| yi = ΓX (xi ) = (di1 , di2 , · · · , di|X| ) ∈ Y, dij = ||xi − xj ||, j = 1 · · · |X|, where |X| is the number of elements in data set X, the point xi in the original space is mapped to the point yi ∈ R|X| in the relative space, and · is the distance norm. yi is also denoted as xri . Theorem 1: ∀xi ,xj ∈X d(xi , xj ) ≤ d(xri , xrj ) Let xr = (d(xi , x1 ), d(xi , x2 ), · · · , d(xi , xn )), then d(xri , xrj )2 n i = k=1 (d(xi , xk ) − d(xj , xk ))2 = nk=1,k=j (d(xi , xk ) − d(xj , xk ))2 + (d(xi , xj ) − d(xj , xj ))2 = nk=1,k=j (d(xi , xk ) − d(xj , xk ))2 + d(xi , xj )2 ≥ d(xi , xj )2 This theorem indicates that the relative transformation is a kind of distance enlarging transformation. This is much beneficial for us to observe the more detailed topological structure of data. Theorem 2: ∃X∧xi ,xj ,xk ∈X (d(xi , xj ) = d(xi , xk ) ∧ d(xri , xrj ) = d(xri , xrk )) This can be illustrated by an example. It can be observed from 2 that d(x3 , x1 ) = d(x3 , x4 ) in the original space while d(y3 , y1 ) < d(y3 , y4 ) in the relative space. Accordingly the relative transformation is nonlinear. The data can be distinguished in the relative space that can not be identified in the original space. y4 x4 10.4403
6 11.0905
7
9 6
x1
13.4164
x3
y3
8.6023
3 y1
4
x2
5.5677 6.7082 y2
(a)
(b)
Fig. 2. Noises and outliers are refrained in the relative space, where (a) is the original space and (b) is the relative space
The relative transformation is simple but efficient to deal with the outliers and noises, as shown as Fig.2. In the original space the point x4 can be regarded as the noise or the outlier as it is far away from the rest three points. However d(x3 , x1 ) = d(x3 , x4 ) in the original space. This means that the point x4 has the same possibility with the point x1 to be taken as a neighbor of point x3. This is not consistent with our intuition. In the relative space, d(y3 , y1 ) < d(y3 , y4 ), the outlier or noise becomes further away from the normal points. This makes it easy to refrain the influence of noises and sparsity of data on dimensionality reduction. Furthermore, in the relative space, the distances among points vary
320
G. Wen, L. Jiang, and J. Wen
nonlinearly. Possibly it makes closer the points belonging to the same surface of the manifold while it makes the further away the points located at the different surfaces. This is specially useful to sparse data set. It is also concluded that, for a small scale of d-dimensional data set X ⊂ Rd , when |X| < d, it implements the natural dimensionality reduction by building the relative space Y ⊂ R|X| . This is very useful for the small-scale but high-dimensional data sets. Finally, this approach has a simple mathematical basis and it allows a compact mathematical description of arbitrarily shaped neighborhood in the original space.
3
Improved Hessian Locally Linear Embedding
HLLE assumes that the neighborhood for each point is linear. This is not easily satisfied when confronted with noise and outliers. Some critical outliers on noisy data manifold result in short-circuit edges, connecting two submanifolds directly, which often cause a topological instability. For example, a single data point which (a)k=5
(b)k=10
10
(c)k=15
10
10
0
0
0
−10
−10
−10
20 10 0 −10
0
10
20 10 0 −10
(d)k=5
0
10
20 10 0 −10
(e)k=10
10
10
0
0
0
−10
−10
−10
20 10 0 −10
0
10
0
10
(f)k=15
10
20 10 0 −10
0
10
20 10 0 −10
0
10
Fig. 3. Neighborhood graphs on the top line constructed in the original space and neighborhood graphs on the bottom line constructed in the relative space
lies between closely apart surfaces, can connect these two surfaces if the size of neighborhood is relatively large in constructing a neighborhood graph. In such a case, the manifold structure is totally collapsed by an outlier[17], therefore to reduce the number of short circuiting edges is very significant for embedding. This can be reached in the relative space, as where the arbitrary shape of neighborhood in the original space can be discovered. The formed neighborhood graph is obviously better than that in the original space, as shown as Fig.3, where the manifold with 400 points is sampled from Swiss-roll surface[2], but contaminated by adding random Gaussian noise where the mean of the noise is 0 and the variance is 0.4. Obviously in Fig. 3, the neighborhood graphs on the top line constructed in the original space have more short circuit edges than those on the bottom line formed in the relative space for the same neighborhood size. It also can be observed that the larger the k takes, the more short circuit edges occur. It seems that we can take the smaller value for k to reduce the number of short circuit edges, however, it will produce the more reconstruction errors which in turn leads to drastically incorrect embeddings. Therefore k should take
Improved Locally Linear Embedding by Cognitive Geometry
321
the value as large as possible when short circuit edges do not occur. Obviously to determine the neighborhood relationship in the relative space, k can take the larger value. We apply it to determine the neighborhood for HLLE. The improved HLLE is denoted as R-HLLE, which is given as follows for integrity. Algorithm: R-HLLE(X, k, d) /* X = {xi } ⊂ Rn be the high dimensional data set, k be the neighborhood size, d be the dimension of the embedding space,min(k, n) > d. The output is Y = {yi } that is a collection of |X| points in Rd .*/ 1. Transform X into the relative space denoted as X r by yi = ΓX (xi ∈ X) ∈ X r , in which we determine the neighbors for each point yi ∈ X r using k-NN approach. The neighbors index is denoted as Nir (yi ) = {j|yj is the neighbor of yi } 2. For any point xi ∈ X, its k nearest neighbors are determined as Ni = {xj |j ∈ Nir (yi )}, which forms a k×n matrix M i whose rows consist of the re-centered points xj − x¯i , where x¯i = average{xk : xk ∈ Ni }. 3. Obtain Tangent Coordinates. Perform a singular value decomposition of M i , getting matrices U , D, and V . V is k by min(k, n). The first d columns of V give the tangent coordinates of points in Ni . 4. Develop Hessian Estimator. Develop the infrastructure for least-squares estimation of the Hessian. In essence, this is a matrix H i with the property that if f is a smooth function f : M → R, and fi = (f (xi )) , then the vector v i whose entries are obtained from f by extracting those entries corresponding to points in the neighborhood H i , then, the matrix vector product H i v i gives a d(d+1)/2 vector whose entries approximate the entries of the Hessian matrix, ∂f /∂Vi ∂Vj . 5. Develop Quadratic Form. Build a symmetric Hi,j having, in coor matrix i l dinate pair i and j, the entryHi,j = ((H ) (H )l,j ). Here by H i , r,i l r the d(d + 1)/2 by k matrix is associated with estimating the Hessian over neighborhood Ni , where rows r correspond to specific entries in the Hessian matrix and columns i correspond to specific points in the neighborhood. 6. Find Approximate Null Space. Perform an eigenanalysis of H, and identify the (d + 1)-dimensional subspace corresponding to the (d + 1) smallest eigenvalues. There will be an eigenvalue 0 associated with the subspace of constant functions; and the next d eigenvalues will correspond to eigenvecˆ d in which the embedding coordinates tors spanning a d-dimensional space v are to be found. ˆ d which has the property 7. Find Basis for Null Space. Select a basis for v that its restriction to a specific fixed neighborhood N0 (the neighborhood may be chosen arbitrarily from those used in the algorithm) provides an orthonormal basis. The given basis has basis vectors {yi } which are the embedding coordinates. Let V be the N ×d matrix of eigenvectors built from the nonconstant eigenvectors associated to the (d + 1) smallest eigenvalues, and let Vl,r denote the l-th entry in the r-th eigenvector of H. Define the matrix (R)r,s = j∈Nl Vj,r Vj,s . The desired N by d matrix of embedding coordinates is obtained from: Y = V · R−1/2 .
322
G. Wen, L. Jiang, and J. Wen
R-HLLE determines the neighborhood for each point in the relative space in the first step and modifies the second step, where the time complexity increases O(|X|2 ). The rest steps remaind the same as that of HLLE, still performed in the original space. It only requires the solution of N separate k × k eigenproblems, so that it can solve much large-scale data analysis problems.
4
Experimental Results
Several experiments are conducted to directly compare the results of R-HLLE with that of HLLE,LLE and ISOMAP by the performance. In experiments, LLE (k=12), HLLE(k=12) and ISOMAP(k=7) take the same values for parameters as that HLLE used in its experiments. To avoid taking the parameters beneficial to only our approach, R-HLLE also takes 12 for the parameter k, the same as that of HLLE and LLE. 4.1
Swiss Roll Surface
Swiss Roll surface is widely applied to compare non-linear dimensionality reduction approaches[2,1,3,5,8,12]etc. It is like a rolled-up sheet of paper and thus is exactly isometric to Euclidean space. Here we take the sampling procedure that HLLE applied[5]. Instead of sampling parameters in a full rectangle, it samples from a rectangle with a missing rectangular strip punched out of the center. The resulting Swiss roll is then missing the corresponding strip and thus is not convex. Using this model, we take many random samples from the Swiss Roll surface and do experiments on (1)well sampled data without noise (2) well sampled data with noise (3)sparsely sampled data Experiment 1. On well sampled data sets without noise. We take many random sample of 800 points from Swiss Roll surface[5], and then apply LLE, HLLE, ISOMAP and R-HLLE to perform embedding for each sample. It can be observed from these experiments that nonconvexity can have dramatic effect on the resulting embeddings. Although the data manifold is still locally isometric to Euclidean space, in most cases, the effect of the missing sampling region is, in the case of LLE, to make the resulting embedding functions asymmetric and nonlinear with respect to the original parametrization. In the case of ISOMAP, the nonconvexity causes a strong dilation of the missing region, warping the rest of the embedding. On most samples, similar to R-HLLE, HLLE can perform embedding correctly. However, as shown as Fig.4, HLLE fails to embed the results completely on some other samples where R-HLLE can embed the result into the two-dimensional space correctly. Experiment 2. To compare the topologically stability of four approaches on data sets with noise, we take some random samples of 800 points from Swiss Roll surface, but add random Gaussian noise where the mean of the noise is 0 and the variance is 0.4. From these experiments, it can be observed that nonconvexity and noise can have dramatic effect on the resulting embeddings. In most
Improved Locally Linear Embedding by Cognitive Geometry Original Data
323
ISOMAP
500
10 0
0
−10 20 15 10
−500 5 10 −50
5
−500
Regular LLE
0
500
HLLE
R−HLLE 0.05
1
0.05
0 −1
0
−2
−0.05
0
−0.05
−3 −1
0
1
2
−0.1 −0.1 −0.05
0
0.05
−0.05
0
0.05
Fig. 4. Embedding results of four approaches on data sets without noise
cases, The results of LLE and HLLE are completely confused, whereas in the case of ISOMAP, the nonconvexity causes a strong dilation of the missing region, warping the rest of the embedding. But R-HLLE often achieve the good embedding results. One of examples is illustrated as Fig.5 where R-HLLE performs best. Original Data
ISOMAP 500
10 0
0
−10
−500 5 10 −50 −500
20 10 0
Regular LLE
0
500
HLLE
R−HLLE
2 0.05
1 0
0.05
0 0
−1 −0.05
−2 −3 −2
−0.1 0
2
−0.05
0
−0.05 −0.05 0.05
0
0.05
Fig. 5. Embedding results of four approaches on noisy data sets
Experiment 3. Generally, in sparsely sampled data sets, the Euclidean distance between points in neighborhood becomes larger as compared to the distance between different folds of the manifold. This easily makes four approaches face the short circuit problem. To make comparison between four approaches about robust to samples with sparse sampling density, we take some random samples of 400 points from Swiss Roll surface and do experiments. It can be observed that nonconvexity and sparsity of data set can have dramatic effect on the resulting embeddings. In some cases, four approaches can not get the ideal results. But by comparison, R-HLLE behaves best. One of examples can be shown as Fig.6, where LLE and HLLE achieve the completely confused embeddings, while RHLLE performs better.
324
G. Wen, L. Jiang, and J. Wen Original Data
ISOMAP 500
10 0
0
−10 20 15 10
−50
5
5 10−500 −200 0 200 400
Regular LLE
R−HLLE
HLLE
2
0.1
0.1
1
0.05
0.05
0
0
0
−0.05
−0.05
−1 −2
−0.1 −3 −2 −1
0
1
−0.05 0 0.05 0.1
−0.1−0.05 0 0.05
Fig. 6. Embedding results of four approaches on sparse data sets
4.2
Iris Data Set
We take Iris data as a real world example, which consists of 150 records[13,12]. This data set has two main clusters: The class Iris Setosa is separate from the other two classes that are not much separate from each other. As ISOMAP fails to build a connected neighborhood graph in the original space on this data set when k < 25, in this experiments k takes 45. It can be observed from Fig.7 that R-HLLE outperforms HLLE and LLE, as it has less inter-classes and intra-classes overlapping. It performs almost as the same as ISOMAP. HLLE
RHLLE
0.2
0.1 0
0 −0.2 −0.2
0
0.2
Setosa−0.1 Versicolour Virginica −0.2
−0.1
Regular LLE 2
2
0
0
−2 −4
0 0.1 ISOMAP
0.2
−2 −2
0
2
−2
0
2
Fig. 7. Embedding results of four approaches on Iris data
5
Conclusion and Future Work
We have presented an approach to build the relative space from the original space by simulating the cognitive laws, and then determine the neighborhood in the relative space for Hessian locally linear embedding. The improved HLLE can more nicely deal with sparsely sampled or noisy data sets, by comparison with HLLE, LLE and ISOMAP. This approach is simple, general and easy to be implemented. It also has clear physical meaning and does not add any parameter. The proposed idea and approach are likely to be even more useful in combination with other methods in data analysis and statistical learning. In the future, we will investigate it furthermore and find widespread use in these areas.
Improved Locally Linear Embedding by Cognitive Geometry
325
References 1. Roweis, S.T., Saul, L.K.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science 290, 2323–2326 (2000) 2. Tenenbaum, J.B., de Silva, V., Langford, J.C.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290, 2319–2323 (2000) 3. Balasubramanian, M., Schwartz, E.L.: The ISOMAP Algorithm and Topological Stability. Science 295, 7 (2002) 4. Belkin, M., Niyogi, P.: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Computing 15, 1373–1396 (2003) 5. Donoho, D.L., Grimes, C.: Hessian eigenmaps: Locally linear embedding, techniques for high-dimensional data. Proc. Natl. Acad. Sci. 100, 5591–5596 (2003) 6. Silva, V.D., Tenenbaum, J.B.: Global versus local methods in nonlinear dimensionality reduction. Neural Information Processing Systems 15, 705–712 (2003) 7. Kouropteva, O., Okun, O., Pietikainen, M.: Incremental locally linear embedding. Pattern Recognition 38, 1764–1767 (2005) 8. Law, M.H.C., Jain, A.K.: Incremental nonlinear dimensionality reduction by manifold learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 28, 377–391 (2006) 9. Samko, O., Marshall, A.D., Rosin, P.L.: Selection of the optimal parameter value for the Isomap algorithm. Pattern Recognition Letters 27(9), 968–979 (2006) 10. de Ridder, D., Kouropteva, O., Okun, O., et al.: Supervised locally linear embedding. In: Kaynak, O., Alpaydın, E., Oja, E., Xu, L. (eds.) ICANN 2003 and ICONIP 2003. LNCS, vol. 2714, pp. 333–341. Springer, Heidelberg (2003) 11. Chang, H., Yeung, D.-Y.: Robust locally linear embedding. Pattern Recognition 39, 1053–1065 (2006) 12. Yang, L.: Building k-Connected Neighborhood Graphs for Isometric Data Embedding. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(5), 827–831 (2006) 13. Yang, L.: Building Connected Neighborhood Graphs for Locally Linear Embedding. In: The 18th International Conference on Pattern Recognition, pp. 1680–1683 (2006) 14. de Ridder, D., Loog, M., Reinders, M.J.T.: Local Fisher embedding. In: Proceedings of the 17th International Conference on Pattern Recognition, pp. 295–298 (2004) 15. Saxena, A., Gupta, A., Mukerjee, A.: Non-linear dimensionality reduction by locally linear ISOMAPs. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 1038–1043. Springer, Heidelberg (2004) 16. Sung, H.S., Lee, D.D.: The Manifold Ways of Perception. Science 290, 2268–2268 (2000) 17. Choi, H., Choi, S.: Robust kernel ISOMAP. Pattern Recognition 40, 853–862 (2007) 18. Li, D., Liu, C., Du, Y., Han, X.: Artificial Intelligence with Uncertainty. Journal of Software 15, 1583–1594 (2004) 19. Wen, G., Jiang, L., Wen, J., Shadbolt, N.R.: Performing Locally Linear Embedding with Adaptive Neighborhood Size on Manifold. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 985–989. Springer, Heidelberg (2006) 20. Wen, G., Jiang, L., Wen, J., Shadbolt, N.R.: Clustering-based Nonlinear Dimensionality Reduction on Manifold. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 444–453. Springer, Heidelberg (2006) 21. Wen, G., Jiang, L., Shadbolt, N.R.: Using Graph Algebra to Optimize Neighborhood for Isometric Mapping. In: 20th International Joint Conference on Artificial Intelligence(IJCAI-07), India, pp. 2398–2403 (2007)
Predicting the Free Calcium Oxide Content on the Basis of Rough Sets, Neural Networks and Data Fusion Yunxing Shu1,2, Shiwei Yun2, and Bo Ge1,2 1
School of Mechatronic Engineering Wuhan University of Technology Hubei, Wuhan, 430070, China 2 Luoyang Institute of Science and Technology Henan, Luoyan, 471003, China
[email protected]
Abstract. This study first created a model to predict the content of free calcium oxide (fCaO) of the calcined clinker in the rotary kiln by adopting the technologies of rough sets, neural networks and data fusion. And then it was used to predict the quality of the calcined clinker in the rotary kiln and pleasant simulation results were obtained, indicating that the model is valid and has attained the goal of increasing the training speed and precision. Besides, it has solved many problems in the course of cement production, such as big inertia, lagging, time variation, serious nonlinearity, multiple parameters, serious coupling, and difficulty in creating systematic models.
1 Introduction At present, the new dry-process manufacturing technique featuring off-kiln decomposition technology (predecomposition kiln) is representing the state of art in the field of cement manufacturing techniques and technologies and will take the lead in the development direction of cement techniques for a considerably long period of time in the future. Cement quality is mainly determined by clinker quality. To control the quality of cement is to control the quality of clinker. The parameters of describing clinker quality mainly include the content of free calcium oxide, the weight of a cubic liter of clinker, the time of setting, the density of the cement at its various phases, etc., among which the content of free calcium oxide (fCaO) is one of the most important parameters to influence the clinker quality. Cement production is a kind of complex hot working reaction process, which is featured with big inertia, lagging, time variation and serious nonlinearity, and besides, there are many complex parameters and serious couplings between them, and it is hard to build systematic models. Research on artificial neural networks (ANN)[1] has been underway for over 40 years. Applying neural networks to process monitoring systems has become a very active research field. However, neural networks have the following limitations [2]: they pose high requirements to the quantity and quality of the learning sample; the the structures and parameters of the models are poor in their generalizability; models are hard to optimize. In order to overcome the shortcomings of neural
③
K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 326–334, 2007. © Springer-Verlag Berlin Heidelberg 2007
②
①
Predicting the Free Calcium Oxide Content on the Basis of Rough Sets
327
networks, we can manipulate different data so that they can be processed by their own neural networks, and thus high dimensional data spaces can be decomposed into lower dimensional data spaces and complex networks can be changed into simple networks. In this way, the structure of the neural network is simplified and the speed of network training is increased. The output results of the various subnetworks will then undergo further information fusion processing by resorting to the evidence theory [3-5], and finally the processing results are obtained. As a kind of brand-new mathematical tool for processing imprecise and incomplete data, the rough set theory [6] has been widely applied in such fields as machine learning and data mining. Rough sets can effectively simplify samples, eliminate redundant information, and reduce the knowledge base space. As the preprocessing link of the neural networks, rough sets are used to conduct reduced preprocessing of the data to eliminate the noise and redundancy in the samples, thus not only enhancing the prediction precision of the neural networks, but also reducing the learning load at the same time. Therefore, the combination of the two will substantially reduce the learning time of the neural networks. On the basis of the rough set theory and the integration of neural networks, reference [1] proposed a method to intelligently diagnose engine failures. The two are used in combination can obtain better diagnosis results than those obtained by using either one at a time. Reference [7] used rough sets to conduct preprocessing of classified bank data, compressing the data in the aspects of attribute quantities and their values, eliminating the noise and redundancy, and increasing the predication precision of the model from 84% to 96%. References [8-9] combined rough sets with neural networks and eliminated the redundant data on the condition of retaining important information so as to increasing the training speed. In this study we built a rough neural network. First, we used rough sets to realize attribute reduction and extract relevant rules, and then, according to the size of the content of free calcium oxide (fCaO), we identified possible output subspaces and conducted quantitative approximation in these subspaces through the neural network, and finally, we fused the data from the various subspaces, thus attaining our goal of increasing the training speed and the prediction precision.
2 Rough Set Data Analysis The main thrust of the rough set theory is to export resolutions of problems or rules of classification through attribute reduction on the condition of keeping invariant the classifying ability of the information system. However, rough set modeling is a kind of structured non-numerical informationized processing method, which is suitable to processing discrete and qualitative data and is limited in its ability to process continuous data. 2.1 Basic Concepts of Rough Sets
K = (U , A, V , f ) , in which U = {x1 , x2 ,L , xn } is the universe(a finite set of objects), A is the set of attributes
Suppose we have an information system
328
Y. Shu, S. Yun, and B. Ge
(features, variables), V is the domain of all attributes, and f : U × A → V is an information function. If the attribute set A = C ∪ D, C ∩ D = φ , then C is called
the conditional attribute, and D is called the decision attribute. The knowledge representation system which has the conditional attribute and the decision attribute is called the decision table. Definition 1. suppose K = (U , A,V , f ) is an information system,
∀P ⊆ A , define
the equivalence relation on P IND( P ) = {( x, y ) ∈U × U | ∀p ∈ P, f ( x, p) = f ( y, p )}
(1)
Under the circumstances when confusion is not possible, the equivalence relation IND ( P ) can also be designated as P [6]. Definition 2. suppose P, Q ⊆ A , if IND (Q ) ⊆ IND ( P ) , then we say P is dependent on Q , designated as Q ⇒ P [6]. The dependence relation expresses the following rule:
Suppose Q = {q1 , q2 ,L , qn }, P = { p1 , p2 ,L , pk } , for every t = {t1 , t2 ,L , tn } , in which
ti ∈Vqi , uniquely determines the attribute value set s = {s1 , s2 ,L , sk } , in which si ∈V pi , namely: ( ∀ x ∈ U )[( f ( x , q1 ) = t1 , L , f ( x , qn ) = tn ) ⇒ f ( x , p1 ) = s1 , L , f ( x , pk ) = sk )]
(2)
2.2 The Rule’s Degree of Matching and Relevance Grade
Suppose we extract a rule Q ⇒ P , with the quantity of m, from the original data, in which the i th rule R i can be represented as:
R i : if ( f ( x , q1 ) = t1i ,L , f ( x , qn ) = tni then f ( x , p1 ) = s1i ,L , f ( x , pk ) = ski )
(3)
In which t ij ∈Vq j , s ij ∈V p j . For a group of input input = {I1 , I 2 ,L , I n } , define the function i ⎪⎧1, I k = tk , k = 1,2,L , n, i = 1,2,L , m gi (k ) = ⎨ i ⎪⎩0, I k ≠ tk
(4)
Define the degree of matching between the input and the i th rule as n
Ci =
∑ g (k ) i −1
i
n
, i = 1, 2,L, m
(5)
It demonstrates the degree of matching between the input pattern and the i th rule. Because rules are extracted from the training samples, which may contain noises,
Predicting the Free Calcium Oxide Content on the Basis of Rough Sets
329
therefore usually a large quantity of rules will be generated. In order to eliminate such influence, we define the support of the rule. The support of the i th rule is defined as si =
Si U
(6)
In which Si = {x | f ( x, q1 ) = t1i ,L , f ( x, qn ) = tni } means the set which is composed of the samples that have met the conditions of the i th rule. The support of the rule indicates the proportion of the quantity of the samples that have met the conditions of the rule to the total quantity of samples. Consequently, a threshold value for the support can be set so as to delete those rules generated from individual noisy sample instances or those rules whose supports are very low. We adopt the arithmetic product between the support of the rule and the degree of matching of the rule to define the relevance grade μi of the input input in relation to the i th rule, namely
μi = Ci ⋅ si
(7)
3 Modeling Method 3.1 Modeling Process of the Rough Neural Network
The modeling process was divided into three steps: (1) The discretization treatment of the data The discretization treatment of the data refers to the process of discretizing the attribute values of continuous attributes into a finite set of discrete values. The input and output data of any actual system are mostly of the continuous type. The continuous sampling of data attributes is generally limited within a certain range, but theoretically the possible attribute values within this range are limitless, thus rendering the statistics of their supports to lose its original meaning. Therefore, before conducting rough set data analysis, we have to give the data a treatment of discretization. (2) Rough set data analysis This step includes: (A) Attribute reduction: that is to say, eliminate the redundant attributes; After attribution reduction, some of the unnecessary attributes in the decision table can be eliminated. The decision table still meets the requirements of congruity and the compatibility of the rules. In relation to the initial decision table, the adaptability of the rules in the table at this moment has been increased substantially. (B) Value reduction and rule extraction: namely, eliminate the unnecessary attribute values from the rules and obtain the simplest rule; Although the adaptability of the rules in the decision table has been increased substantially after attribute reduction, there still remains a lot of redundant information in
330
Y. Shu, S. Yun, and B. Ge
each rule. Value reduction is to further eliminate the redundant conditional attributes of each sample from the decision table on the basis of attribute reduction. After such treatment, the rules remaining in the decision table no longer have any redundant conditional attributes; that is to say, the quantity of the conditional attributes of each rule has been reduced as possible as we can. (C) Calculation of the support of each rule: set the threshold values, delete some rules whose supports are lower, and eliminate the influence brought about by noises. (3) Training of the artificial neural subnetworks In line with the discretization results obtained from step 1, classify the training samples into k categories according to the decision attributes, namely, {D1 , D2 ,L , Dk } . Suppose X i ⊆ U are objects contained in the i th category. These objects constitute the input and output of the subnetworks with a quantity of k . We use these data to conduct training of the subnetworks, and the subnetworks with a quantity of k are obtained from the training, in which the input-output relation of the i th subnetwork is as follows:
outi = fi (input ) , i = 1,2,L, k In which subnetwork.
(8)
input represents the input data, and outi represents the output of the i th
3.2 Use Rough Neural Networks and Data Fusion to Make Predictions and Decisions
Just now we created a neural network model based on rough sets. The process of using this model to make predictions nad decisions can be divided into steps: (1) Discretize the prediction samples according to the discretized intervals obtained from the modeling process; (2) Judge the input by using the rules extracted from the rough data analysis, and respectively calculate their relevance grades {μ1 , μ2 ,L , μm } ; (3) Fuse the data and work out the output values. m
out =
∑μ i =1
i
⋅ f i ( input )
(9)
m
∑μ i =1
i
4 Simulation Study In order to verify the validity of the model proposed in this study, we selected 7 predicting parameters from the new-type dry-process cement production technique parameters[10] as the input and output, i.e., the system’s raw feed amount A1, the coal feed amount of the rotary kiln A2, the coal feed amount of the decomposing furnace A3, the kiln’s rotational speed A4, the saturation coefficient A5 of the lime in the raw feed, the silicon percentage A6 of the raw feed, the aluminum percentage A7 of the raw feed, and the actually measured content of fCaO in the clinker. All these input technique parameters are
Predicting the Free Calcium Oxide Content on the Basis of Rough Sets
331
main factors that may cause the fluctuation of the calcination quality of the clinker in the rotary kiln. It should be pointed out that other parameters, such as the combustion heat value of the burning coal in the rotary kiln, the excess coefficient of the air in the rotary kiln, the temperature of the gases and materials at the rear of the rotary kiln, the temperature of the clinker coming out of the rotary kiln, and the temperature of the secondary air, also play important roles in the process of cement clinker calcination. Considering the conditions of the data collection, the total quantity of the data and other influencing factors, we just selected the above-mentioned 7 technological parameters. (1) Discretization treatment of the data In actual production, if the content of fCaO is lower than 1.5%, then the cement is qualified, but if it is higher than 1.5%, the cement is not qualified. From our datasheet we can see that the decision table has 7 conditional attributes and 1 decision attribute. First, we discretized the decision attribute, and then we used the software Rosetta provided jointly by the Norwegian University of Science and Technology and the Institute of Mathematics, Warsaw University, Poland to discretize the conditional attributes, and the results are shown in Table 1. From Table 1 we can see that the two attributes of the saturation coefficient A5 of the lime in the raw feed and the silicon percentage A6 of the raw feed can be reduced, and thus the quantity of the attributes is reduced to 5 from 7. Table 1. Discretized intervals of the various continuous attributes Attributes A1 A2 A3 A4 A5 A6 A7 d
Discretized Intervals [∗,179.2), [179.2,185.8), [185.8, ∗) [∗, 5.5), [5.5, ∗) [∗, 9.1), [9.1, ∗) [∗, 3.0), [3.0, 3.1), [3.1, ∗)
[∗,1.44), [1.44, ∗) [∗,1.5), [1.5, ∗)
(2) Reduction of attributes and extraction of rules We used the software Rosetta to analyze the data and obtained the minimal relative reduction after the attribute reduction was completed, and then 28 rules were extracted, and finally according to equation (6), we worked out the supports of these rules respectively. (3) Training of subnetworks In step (1), according to the contents of fCaO, we classified the decisions into two categories so that the system could carry out training in two separate subnetworks, with either subnetwork using one BP network (with 5 input nodes, 5 hidden layer nodes and 1 output node) to carry out training. For the output results of either subnetwork, we used the relevance grades of the input samples to the various rules as
332
Y. Shu, S. Yun, and B. Ge
weight values to fuse the subnetwork output. Besides, we used the 50 testing data presented in reference [10] to conduct testing and comparison, and the comparison of the simulation results is shown in Table 2. Table 3 provides the results of the comparison between main performance indexes. Table 2. Comparison of the simulation results Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error Sample No. Neural network error Rough neural network error
1 0.0071 -0.0306 6 0.1434 0.5261 11 0.9041 -0.2920 16 0.5115 -0.2163 21 0.2037 0.7198 26 -0.3504 0.3744 31 -0.2535 -0.1081 36 0.2362 0.0155 41 -0.1006 0.0281 46 0.6564 0.2083
2 0.5172 -0.1201 7 -0.0723 0.0763 12 0.6184 -0.6615 17 0.4760 -0.4727 22 0.6665 -0.7882 27 0.0953 -0.1108 32 0.7998 -0.4366 37 0.0725 -0.0036 42 0.0213 -0.2102 47 -0.0899 -0.0481
3 0.1935 -0.5228 8 -0.7871 -0.2704 13 -0.7420 -0.0233 18 -0.4471 0.4373 23 -0.1368 -0.3934 28 -0.2979 0.2375 33 -0.4425 0.4778 38 1.0172 -0.4792 43 -0.0387 0.1944 48 0.5898 -0.5547
4 0.6207 -0.7962 9 0.1143 0.5290 14 -0.0363 0.6100 19 0.8740 -1.0229 24 0.1118 0.4936 29 -0.0339 -0.4499 34 0.4838 0.2013 39 0.1359 0.2489 44 -0.7384 0.3091 49 0.4435 -0.0475
5 -0.2145 0.5688 10 0.8595 0.3636 15 -0.6670 0.2215 20 -0.8895 0.5981 25 -1.2990 0.5765 30 -0.2050 -0.3893 35 0.4538 1.1072 40 0.1706 0.4994 45 -0.5625 -0.6132 50 0.4613 -0.2388
Table 3. Comparison between main performance indexes Max. absolute error
Mean absolute error
Mean square error
Neural network
1.2990
0.4172
0.5213
Rough neural network
1.1072
0.3785
0.4574
Frequency of training The total frequency of the network training was 198 times. The total frequency of the training of the two subnetworks was less than 20 times.
Predicting the Free Calcium Oxide Content on the Basis of Rough Sets
333
From the data in Table 2 we can see that as far as training time and errors are concerned, the results obtained from our proposed model on the basis of rough neural networks and data fusion are superior to those obtained from the model using only neural networks as evidenced in reference [10].
5 Conclusions In this study, we first used the model proposed by us on the basis of neural networks and data fusion to predict the content of fCaO of the calcined clinker in the predecomposition kiln used in the new-type dry-process cement production with a daily production size of 2,500 tons of clinker, and then compared our prediction with the actual data, and then carried out a simulated prediction of fCaO of the clinker, thus attaining the goal of guiding cement production and predicting clinker quality. This study built a rough neural networked model, which integrates the advantages of rough sets in knowledge acquisition and those of neural networks in value approximation. Meanwhile, we built a model on the basis of neural networks and data fusion to predict the content of free calcium oxide (fCaO) of the calcined clinker in the rotary kiln. It can be claimed that we have solved a series of problems caused by vast neural network structures and slow training speed due to the increase of technological parameters. We take the recognition results of the neural networks as evidence independent to each other, thus making the training speed and prediction precision increased. Acknowledgments. The authors acknowledge the support from the National Science Foundation of Henan Province of China(No. 0511053100).
References 1. Chen, T., Sun, J.: Aeroengine Gas Path Fault Diagnosis Using Rough Sets and Neural Networks. Journal of Aerospace Power 1, 207–211 (2006) 2. Wang, H., Zhang, X., Yu, J.: Fault Diagnosis Based on Support Vector Machine. Journal of East China University of Science and Technology 2, 179–182 (2004) 3. Liao, R., Liao, Y., Yang, L., et al.: Study on Synthetic Diagnosis Method of Transformer Fault Using Multi-neural Network and Evidence Theory. Proceedings of the CSEE 3, 119– 124 (2006) 4. Li, Y., Jiang, J., Yang, F.: NN-Based D-S Evidence Theory Applied to Multisensor Target Identification. Chinese Journal of Scientific Instrument 6, 652–655 (2001) 5. Chen, T., Sun, J., Hao, Y.: Neural Network and Dempster-Shafter Theory Based Fault Diagnosis for Aeroengine Gas Path. Acta Aeronautica et Astronautica Sinica 6, 1014– 1017 (2006) 6. Pawlak, Z.: Rough Set-Theoretical Aspects of Reasoning about Data, pp. 9–30. Kluwer Academic Publishers, Dordrecht (1991) 7. Hashemi, R.R., Le Blanc, L.A., Rucks, C.T., et al.: A hybrid intelligent system for predicting bank holding structures. European Journal of Operational Research, 390–402 (1998)
334
Y. Shu, S. Yun, and B. Ge
8. Li, M., Zhang, H.: Reserch on the method of neural network modeling based on rough sets theory. ACTA Automatica Sinica 1, 27–33 (2002) 9. He, M., Feng, B., Ma, Z., et al.: Approach to Construct a Rough Neural Networks Based on Rough Set. Journal of Xi’An Jiaotong University 12, 1240–1242 (2004) 10. Yang, L.: Computer Simulation for Calcinations Process of the Precalciner. Wuhan University of Technology (2004)
Classification of Single Trial EEG Based on Cloud Model for Brain-Computer Interfaces Shaobin Li and Chenxi Shao Department of Computer Science, USTC, Hefei, 230027, China
[email protected],
[email protected]
Abstract. A novel feature extraction method based on cloud model for EEG classification is proposed in the paper. The cloud model can transform numerical data to qualitative concept described by a group of characteristics. It provides a new way for concept induction in machine learning. Classification of single trial EEG recorded in a ‘self-paced key typing’ experiment is made through feature extraction based on cloud model and linear regression method for the classification of feature vectors. Results of up to 90% classification accuracy on test data set were obtained. The results show that compared with other methods, the feature extraction and translation method for EEG classification in this paper is simple and effective.
1
Introduction
The creation of an interface between brain and machine is not the new concept, has received a resurgence of concern in these years. Some like ‘brain-machine interface’, ‘brain-computer interface’, ‘brain control’, ‘neural prosthetics’ and so on appear widely in the literature. While, ‘brain-computer interface’ is the generally accepted term. A brain-computer interface (BCI) is a communication system that does not depend on the brain’s normal output pathways of peripheral nerves and muscles [1]. It enable human subjects to control a computer or other devices by means of their brain wave signals. Although still at an exploratory stage, the implications of recent research results are phenomenally exciting. Various experiments have demonstrated the feasibility of control computer or external devices using brain wave signals. Electroencephalogram (EEG) signals can be easily obtained with comparatively inexpensive equipment. Furthermore, using EEG signals recorded from the scalp for BCIs is non-invasive (There is no need for surgery, no invasion to the subject almost). Due to these facts, EEG-based BCI is the best choice for the majority of the BCI research community. Like any communication and control system, an EEG-based BCI has an input, and an output, and a translation algorithm that converts the former to the latter. The central element in each BCI is a translation algorithm that converts electrophysiological input from the user into output that controls external devices [1]. A translation algorithm is a series of computation sequences that extracts features K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 335–343, 2007. c Springer-Verlag Berlin Heidelberg 2007
336
S. Li and C. Shao
from EEG signals, assigns different classes to EEG patterns and generates actual device control commands. Whereas, the classification of EEG signals (especially the single trial EEG) is a challenge for signal processing and machine learning. A large number of cognitive tasks in BCI systems have features that can be observed by EEG, but only after averaging over multiple events. Generally, single trial classification (i.e. discrimination of a single such event, opposed to the activity obtained after averaging over multiple results of the same task) is desired in many BCIs. Therefore, one must be able to detect cognitive activity from a single event of a task, without the benefit of averaging. Here, we present a feature extraction method base on cloud model for EEG classification. The cloud model is a model of transition between qualitative concept and its quantitative description. It can transform numerical data to qualitative concept described by a group of characteristics. The model provides a new way for concept induction in machine learning. We applied cloud model to an EEG data set recorded in the ’self-paced key typing’ experiment for the extraction of task-related features, achieving high classification accuracy with simple linear classification method. The rest of this paper is organized as follows. First, the present state of the art of feature extraction and translation methods in BCI technology is summarized; and the cloud model theory involved in the paper are explained. Then, the experimental procedure and results are given. At the end of the paper, the conclusion is drawn and some discussion on further work is made.
2
State of the Art
Common features extracted in EEG-based BCIs are time domain features (such as slow cortical potentials, P300 potentials)and frequency domain features(such as μ, θ, β rhythms occurring in specific areas of cortex). The methods include the spatial and temporal filters, the scalp electrode type and locations, geometric subspaces, and other signal processing methods used to detect and measure the features. Translation methods involves k-nearest neighbors, linear, quadratic and nonlinear discriminant functions, various models such as logistic regression, Kalman filters, hidden Markov models, etc [2]. The EEG data set acquired by Blankertz et al [3] in the Berlin BCI group that is used in the study consists of a self-paced key typing sessions with no feedback, producing the ERP of a motor stimulus. They have worked on this data set using Fast Fourier Transform (FFT) techniques for their preprocessing and feature selection and used a variety of techniques for the classification, obtaining very high results of up to 96.9%. Other groups have also used this data for their classification work. The Kelly at al [4] has applied an autogressive method approach to the classification problem, achieving accuracies of up to 70.7%, while Garrett et al [5]used genetic algorithms on this data to determine the subset of features of the data that are useful towards the classification process, obtaining 76% accuracy. Yong et al [6] used wavelet decomposition for feature extraction and support vector machines for classification method, achieving 91% accuracy.
Classification of Single Trial EEG Based on Cloud Model
337
At present, most of features extraction and translation methods in BCI technology are concerned with typical signal processing and machine learning techniques. The improvements in BCI technology needs exploration for unconventional methods, such as nonlinear systems analysis and uncertain reasoning, etc.
3
Cloud Model Theory
The cloud model presented in [7] is a model of the uncertainty transition between qualitative concept and its quantitative description (numerical representation). It can transform numerical data to qualitative concept described by a group of characteristics. The cloud model theory provides a new way for concept induction in machine learning. 3.1
Cloud Model
Definition 1. Suppose that U is a quantitative universe of discourse represented by accurate numerical value, and C is a qualitative concept valued on U . If a quantitative value x ∈ U , and x is a random sample of the qualitative concept C. The certainty degree μ(x)(μ(x) ∈ [0, 1]) of x to C is a random number with stable tendency. The μ satisfies that if U → [0, 1], then ∀x ∈ U , there exists x → μ(x). Then the distribution of x on the universe discourse U is called a cloud model. Each x is called a cloud drop [8]. The model describe numerical characters of a certain qualitative concept through three digital characteristics: expected value Ex, entropy En and hyper-entropy He. It combines fuzziness and randomness during qualitative transform together. Ex is the expected value of cloud drops in the universe of discourse, that is, the most representative value for qualitative concept in the universe of discourse. It is the most typical sample of this concept. En is the uncertainty measurement of the qualitative concept. It not only represents fuzziness of the concept but also randomness and their relations. On the one hand, the entropy En reflects discrete degree of cloud drops which can stand for this concept. On the other hand, it reflects the range of value of cloud drops that can be accepted in the universe of discourse. That is, En represents the granularity of the concept. Generally, the larger En is, the higher abstraction the concept is. He is the uncertain degree of entropy En, that is, the entropy of En. Definition 2. The mapping process from quantitative representation to qualitative concept, i.e. a specified realization from three digital characteristics of cloud (Ex, En, He) to a set of cloud drops, is called Forward Cloud Generator (CG) (See Fig.1(a)). While, the Backward Cloud Generator (CG−1 ) is a transition model from quantitative representation to qualitative concept. It can transform numerical data to qualitative concept described by characteristics (Ex, En, He) (See Fig.1(b)).
338
S. Li and C. Shao
Ex
Ex En
CG
drop(x) drop(x)
CG−1
En He
He
(a) Forward Cloud Generator
(b) Backward Cloud Generator
Fig. 1. Forward and Backward Cloud Model Generator
3.2
Backward Cloud Generator
The backward cloud model provides a concept induction method by means of transforming numerical data to characteristics (Ex, En, He) describing qualitative concept. For a set of sample points xi (i = 1, 2, · · · , n) , the CG−1 algorithm can be described as follows: Input: a set of sample points xi , where i = 1, 2, · · · , n. Output: digital characteristics (Ex, En, He) representing qualitative concept. Steps: ¯ = 1 n xi (1) Ex = X i=1 π n 1 ¯ (2) En = 2 × n ni=1 |xi − X| n 1 ¯ 2 (3) S 2 = n−1 i=1 (xi − X) 2 2 (4) He = S − En
4 4.1
Method Data Acquisition
The EEG data set (from [3]) was recorded from a normal subject during a nofeedback session. The subject sat in a normal chair, relaxed arms resting on the table, fingers in the standard typing position at the computer keyboard. The task was to press with the index and little fingers (index fingers at ‘f’, ‘j’ and little fingers at ‘a’, ‘;’) the corresponding keys in a self-chosen order and timing (‘self-paced key typing’). The execution of the typing is voluntary and without explicit external sensory input. The experiment consisted of 3 sessions of 6 minutes each, preceded and postceded by 60 seconds relaxing phase. All sessions were conducted on the same day with some minutes break in-between. A total of 516 keystrokes was done at an average speed of 1 key every 2.1 seconds. 3 events have been rejected due to heavy measurement artifacts. Brain activity was measured with 27 Ag/AgCl electrodes at positions of the extended international 10-20 system, 21 mounted over motor and somatosensory cortex, 5 frontal and one occipital, referenced to nasion, sampled at 1000 Hz using a band-pass filter from 0.05 to 200 Hz.
Classification of Single Trial EEG Based on Cloud Model
339
The supplied data consists of 27 EEG channels in 516 single trials. Windows 1500 ms long were cut out of the continuous raw signals each ending at 120 ms before the respective keystroke, as from that point on there is EMG activity in an significant number of trials, which produce serious artifacts in the data. The signals were down-sampled to 100Hz by picking every 10th data point. 100 trials equally spaced over the whole experiment were defined to be the test set, leaving 413 labeled trials for training. The 3 rejected trials were labeled ‘nan’ (not a number). 4.2
Background
Physiologically meaningful signal features can be extracted from various frequency bands of recorded EEG. The self-paced key typing experiment is based on Laterized Readiness Potential(LRP), also called Bereitschaftspotential(BP). LRP is a special case of Slow Cortical Potentials(SCP) and appears during movement preparation. They are slow negative EEG shifts that develop over the activated motor cortex prior to the actual movement onset for the duration of approximately one second. It is assumed to reflect mainly the growing neuronal activation in a large ensemble of pyramidal cells. Previous studies [9,10] have shown that in most subjects the spatial scalp distribution of the averaged BP correlated consistently with the moving hand, where the focus of brain activity is located contra-laterally to the performing hand [11]. LRP is a time-locked response to the movement event, the θ (0.5-3.5Hz) frequency band is associated with the movement preparation [12]. 4.3
Feature Extraction Based on Cloud Model
The signals used in the experiment are of 100Hz frequency(having been subsampled by simply taking every 10th data point from initially acquired data with a sampling frequency 1000Hz). Only two channels C3 and C4 out of full available set of 27 are used, as they were found to be the most representative positions in the topology of cortex for the left and right hemispherical primary motor cortex, consistently correlating with the performing (right and left) hand. Windows of 1280 time points(from -1400ms to -120ms) are cut from the EEG samples. This provides us with epochs of 128 data points; a sample window is shown in Fig.2(a). To emphasize the late signal content, the data points of the sample window are multiplied by a one-sided cosine function (shown in Fig.2(b)) i·π ))(i = 0, 1, · · · , 127). w[i] = 12 (1 − cos( 128 According to [11], a Fast Fourier Transform (FFT) filtering technique is then applied to the windowed signal, and we discard the baseline DC and all coefficients above 4Hz, such that only the θ rhythm carrying the slow wave potential remains in the signal spectrum. Transforming the low-pass frequency spectrum back into the time domain generates the smoothed signal with inverse FFT(IFFT). The the last 200ms of the smoothed signal (See Fig.3) are subsampled again at 20Hz, then features (Ex, En, He) are extracted according to the CG−1 algorithm described in the subsection 3.2.
340
S. Li and C. Shao
raw signal
windowed signal
30
30
20
20
10
10 potential [μV]
potential [μV]
windowed signal window function
0
0
−10
−10
−20
−20
−30 −1400
−1200
−1000
−800 time [ms]
−600
−400
−30 −1400
−200
−1200
(a) Raw Signal
−1000
−800 time [ms]
−600
−400
−200
(b) Windowed Signal
Fig. 2. Raw and Windowed Signal smoothed signal
smoothed signal
20
20
10
10 potential [μV]
30
potential [μV]
30
0
0
−10
−10
−20
−20
−30 −1400
−1200
−1000
−800 time [ms]
−600
−400
−200
−30 −1400
−1200
(a)
−1000
−800 time [ms]
−600
−400
−200
(b) Fig. 3. Smoothed Signal
The features (Ex, En, He) for C3 and C4 channels (totally six features, each channel has three features Ex, En and He) extracted based on cloud model are well-suited for classification; the Fig.4 shows that features Ex, En and He of EEG signals for C3 and C4 channels could be linearly discriminated on the whole. 4.4
Classification Via Linear Regression
As shown above, the left and right finger movements can be discriminated in principle with the features extracted based on cloud model. Here, least squared error linear regression is employed for the classification of EEG signals. The problem of classification can be described as follows. To predict the labels of the test data set, we used a simple linear classifier, a parameterized mapping f (x; w) from input vectors Rd to labels{−1, 1} to solve the binary classification problem y = f (x; w) = sign(w0 + w1 x1 + · · · + wd xd )
Classification of Single Trial EEG Based on Cloud Model Ex 30 C (left samples) 3
C3(right samples) C4(left samples)
25
C4(right samples)
20
15
10
5
0
−5
−10
0
50
100
150
200
250
(a) Ex En 9 C (left samples) 3
C3(right samples) C4(left samples)
8
C4(right samples)
7
6
5
4
3
2
1
0
0
50
100
150
200
250
(b) En He 3 C (left samples) 3
C3(right samples) C4(left samples) C4(right samples) 2.5
2
1.5
1
0.5
0
0
50
100
150
200
(c) He
Fig. 4. Features (Ex, En, He) for Channels C3 and C4
250
341
342
S. Li and C. Shao
where x (x∈Rd ) is a input vector and y ∈ {−1, 1}, w = [w0 , w1 , · · · , wd ] are parameters we need to set. Given a training set of instance-label pairs (xi , yi )(i = 1, · · · , n), where xi ∈ Rd and yi ∈ {−1, 1}. There is no prior knowledge on the probability distribution of the data available, then a typical objective is to minimize the empirical risk function 1 n Jn (w) = (yi − f (xi ; w))2 i=1 n in terms of squared error on n training samples. The solution for parameters w expressed in matrix notation is W = (X T X)−1 X T Y For classification into left and right hand movement, the training set size used to train linear regression function is 413, and the classifier is tested on a set of 100 trials. 4.5
Results
In the experiment, we apply the method presented above section to EEG data set and obtain accuracy up to 90% on the test data set. Compared with other methods [3,4,5,6], features extraction and translation method for single trial EEG classification given here is simple and novel, and the classification accuracy on the test trials is in the high rank. The corresponding results show that the feature extraction method based on cloud model for EEG classification is effective.
5
Conclusions and Future Work
In this paper, we propose a new feature extraction based on cloud model for EEG classification. The cloud model is a model of transition between qualitative concept and its quantitative description. It can transform numerical data to qualitative concept described by a group of characteristics. This model provides a new way for concept induction in machine learning. Hence, it is well-suited for feature extraction in some applications. Classification of single trial EEG recorded in a self-paced key typing experiment is made through this method for features extraction and simple linear regression method for the classification of feature vectors. The results show that compared with other methods, the feature extraction and translation method in this paper is simple and effective. Further work is underway to refine the method, using more data set and exploring some features selection methods to refine the feature extraction process in order to enable the feature extraction and translation methods are fit for online EEG analysis.
Classification of Single Trial EEG Based on Cloud Model
343
References 1. Wolpaw, J.R., Birbaumer, N., Heetderks, W.J., McFarland, D.J., Peckham, P.H., Schalk, G., Donchin, E., Quatrano, L.A., Robinson, C.J., Vaughan, T.M.: BrainComputer Interface Technology: A Review of the First International Meeting. IEEE Transactions on Rehabilitation Engineering 8(2), 164–173 (2000) 2. Taxonomy of Feature Extraction and Translation Methods for BCI (2005), http://www.cs.colostate.edu/egg/taxonomy.html 3. Blankertz, B., Curio, G., M¨ uller, K.-R.: Classifying Single Trial EEG: Towards Brain Computer Interfacing. In: Advances in Neural Information Processing System (NIPS 01), pp. 157–164. MIT Press, Cambridge, MA (2002) 4. Kelly, S., Burke, D., de Chazal, P., Reilly, R.: Parametric Models and Spectral analysis for Classification in Brain-Computer Interfaces. In: Proceedings of 14th International Conference on Digital Signal Processing, pp. 307–310 (2002) 5. Garrett, D., Peterson, D.A., Anderson, C.W., Thautt, M.H.: Comparison of Linear, Nonlinear, and Feature Selection Methods for EEG Signal Classification. IEEE Transactions on Neural Systems and Rehabilitation Engineering 11(2), 141–144 (2003) 6. Yong, A., Silvestre, G.C.M., Hurley, N.J.: Single-trial EEG Classification for BrainComputer Interface using Wavelet Decomposition. In: Proceeding of 13th European Signal Processing Conference (to appear) 7. Deyi, L., Haijun, M., Xuemei, S.: Membership Clouds and Membership Cloud Generators. Journal of Computer Research and Development 42(8), 32–41 (1995) 8. Deyi, L., Yi, D.: Artificial Intelligence with Uncertainty. National Defense Industry Press, Beijing (2005) 9. Land, W., Zilch, O., Koska, C., Lindinger, G., Deecke, L.: Negative Cortical DC Shifts preceding and accompanying simple and complex sequential movements. Experiments in Brain Research 74, 99–104 (1989) 10. Cui, R.Q., Hutier, D., Land, W., Deecke, L.: Neuroimage of voluntary movement: topography of the Nereitschaftspotential, a 64-channel DC current source density study. NuroImage 9, 124–134 (1999) 11. Kepki, R., Curio, G., Blankertz, B., M¨ uller, K.-R.: Berlin Brain-Computer Interface-The HCI communication channel for discovery. International Journal of Human-Computer Studies 65, 460–477 (2007) 12. Krepki, R.: Brain-Computer Interfaces: Design and Implementation of an Online BCI System of the Control in Gaming Applications and Virtual Limbs. PhD thesis, Technische Universit¨ at Berlin, Fakult¨ at IV – Elektrotechnik und Informatik (thesis) (2004)
The Modified Self-organizing Fuzzy Neural Network Model for Adaptability Evaluation Zuohua Miao1, Hong Xu1, and Xianhua Wang2 1
School of Resource & Environment Engineering, Wuhan University of Science and Technology, 430081 Wuhan, China {Zuohua Miao,Hong Xu,whmzh}@hotmail.com 2 Faculty of Engineering , China University of Geosciences, 430062 Wuhan, China
Abstract. The author proposed a novel approach for evolving the architecture of a multi-layer neural network based on neural network and fuzzy logic technologies. The model is front-network which comprised with five layers architecture which composed of dynamic inference of fuzzy rules where the consequent sub-models are implemented by recurrent neural networks with internal feedback paths and dynamic neuron synapses. An optimal learning scheme with the evaluation guide line which error data embed is applied for training of LFDFNN models. The results of experiment demonstrate that new model have superior performance.
1 Introduction Experiential exponential method and fuzzy synthesize evaluation are traditional adaptability evaluation models with symbolic logic reasoning based on knowledge. Artificial neural networks model is stylebook learning mechanism method based on self-learning. At the present time, these two type models have been widely used in various fields while faced problems including the first type models deeply affected by the reflection of human being but lack self-learning capability and the second models consequence process much more complex and not embed the knowledge of expert. In this paper, the author presented a modify approach based on neural network and fuzzy logic theory for adaptability evaluation. The new model allows the incorporation of heuristics and deep knowledge to exploit the best characteristics of each.
2 Model and Algorithm of FNN The model is front-network and with five layer consists of a number of simple processing units shown in Fig.1. Layer 1 is the input layer and Layer 2 implements fuzzy membership functions. Units in Layer 2 may be compound units so as to implement a desired membership function. The network structure of fuzzy membership function is shown in Fig 2. K. Li et al. (Eds.): LSMS 2007, LNBI 4689, pp. 344–353, 2007. © Springer-Verlag Berlin Heidelberg 2007
The Modified Self-organizing Fuzzy Neural Network Model
345
Fig. 1. Modified fuzzy neural network
Fig. 2. Fuzzy membership function structure
The fuzzy membership function in model is such as the following equation:
S ij(1) = −
( xi − mij ) 2
δ ij2
(1)
y ij(1) = exp( S ij(1) ) Where:
Sij(1) describe the nerve cell membership function input data of the ith factor
and jth level, function and
yij(1) is the output data of nerve cell, mij is the center of membership
δ ij2
is Square Error. In order to update membership function, we need to
find the change in parameters i.e. mean values and standard deviations that define membership functions. Again using gradient descent we made the following:
Δmij = − β Where
∂E ∂mij