An Enhanced QRS Detection Algorithm in the Multiple Leads Environments
- 주제(키워드) E-Health
- 발행기관 포항공과대학교 일반대학원
- 지도교수 박부견
- 발행년도 2012
- 학위수여년월 2012. 2
- 학위명 석사
- 학과 및 전공 일반대학원 정보전자융합공학부
- 세부전공 제어 및 신호처리
- 실제URI http://www.dcollection.net/handler/postech/000001218021
- 본문언어 영어
- 저작권 포항공과대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
There have been many algorithms to remove noise and detect QRS complexes of Electrocardiograph (ECG) signal. However all process of these works are done at just one lead. Through the influence of medical necessity, ECG analysis uses 10 lead sensor to observe 12 leads which show different angles of heart. Thus, we make an enhanced QRS detection algorithm in the multiple leads environment. In this environment, when some leads show noisy result, there could be a fine lead to detect QRS complexes. From this fact, we split signals with few seconds and discriminate the cleanest lead in each interval. After that working, we use the information about R positions from the finest lead at noisy signals to find accurate QRS complexes. This algorithm could gather information that each lead gives.
more목차
Contents
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v
1 Introduction 1
1.1 The Electrocariogram (ECG) . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Algorithms for QRS Complexes Detection . . . . . . . . . . . . . . . . . . . . 2
2 Algorithm Overview 4
3 Methodology 7
3.1 Partitioning the ECG signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3.2 Filtering the noisy components . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.2.1 Three Linear Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
3.2.2 DC Removing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
3.3 Finding R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
3.3.1 Making R Candidates . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
3.3.2 Discriminating Cleaner Lead . . . . . . . . . . . . . . . . . . . . . . . 17
3.3.3 Catching Exact R At Each Lead . . . . . . . . . . . . . . . . . . . . . 18
3.4 Finding Q and S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
4 Experiments 20
5 Conclusion 24
Summary (in Korean) 25
References 26