Lec 1&2
Lec 1&2
B i Boim
om e eddi icc aa ll
S i g nS ai gl n a l
Processing
Processing
Course description
●
The course introduces techniques and procedures for analysis of
biomedical signals and images like:
- Cardiology signals
* electrocardiogram - ECG
- Neurophysiology signals
* electromyogram – EMG (electrohysterogram - EHG)
* (electroencephalogram – EEG; See course: Human-Computer
Interaction)
- Medical images
* computed tomography images – CT images
●
We will recognize how we can, using some non-linear signal processing techniques, analyze
electromyograms recorded from the abdomen of a pregnant women early during pregnancy (23 week),
estimate, or try to predict, danger of pre-term birth.
●
We will also recognize techniques of analysis of 2- and 3-dimensional tomographic images with the aim of
extraction and visualization of anatomic structures of human body organs.
●
Spectral Analysis
●
Electromyogram (EMG) and Predicting Pre-Term
Delivery
●
Non-Linear Signal Processing Techniques
●
Performance Measures and Evaluation
●
(Semi-Automatic Graphic Editing Tools to Annotate Ambulatory ECG
Records)
●
(Selected topics)
- Metrics, techniques and protocols for performance and robustness evaluation of biomedical
computer systems
●
PhysioNet site, http://www.physionet.org
(source of resources in the field of biomedical signal and image
processing)
- Databases: MIT/BIH DB, LTST DB, TPEHG DB,
TPEHGT
- Software:DS ATM tools, wfdb library, lightWAVE,
gnuplot
●
Home pages of Laboratory for Biomedical Computer Systems and Imaging
(LBCSI),
http://lbcsi.fri.uni-lj.si
- Databases: LTST DB, TPEHG DB, TPEHGT DS, CTIMG DB
●
Ubuntu 18.04 (LTS),
Linux
●
C,
(C++)
●
Matlab
●
Quiz during the semester (by your choice) → Max: 20 points
●
Exam at the end of semester: → Obligatory: 50 points; Max: 100 points
●
How the preliminary grade (5 – 10) will be composed?
●
Oral exam is obligatory.
Course: 63514 Biomedical Signal and Image Processing
Physionet / Computing in Cardiology Challenges
●
Physionet / 2014 Computing in Cardiology
Challenge
- Robust Detection of Heart Beats in Multimodal Data
- Urška Pangerc (student at this course) obtained the 2nd, 3rd, 6th, and the final 1st place during
the phases I, II, III, and the follow-up phase (end of February 2015) of the competition of
the actual challenge (which was not student competition) among 47 international teams
( http://physionet.org/challenge/2014 )
Source: Silva I, Moody B, Behar J, JohnsonA, Oster J, Clifford GD, Moody Editorial: Robust Detection
GB, of Heart Beats in Multimodal Data, Physiological Measurement, 36:1629–1644,
2015.
( http://iopscience.iop.org/0967-3334/36/8/1629 )
Course: 63514 Biomedical Signal and Image Processing
Physionet / Computing in Cardiology Challenges
●
Physionet / 2020 Computing in Cardiology
Challenge
- The topic has not been decided yet
●
Participating at the topics from the past challenges is possible
(see: http://physionet.org/challenge/ )
●
Data acquisition
●
Continuous-time sinusoidal signals
●
Sampling a continuous-time signal
●
Quantization
●
Analog to Digital (A/D) and Digital to Analog (D/A)
conversion
●
Sampling a sinusoid – aliasing
●
The Nyquist sampling theorem
●
Relations among frequency variables
●
(Reconstructing continuous-time signals)
.A/D CONVERTER
.x(I') I .x[.1r:1 I I ,- '
I I
]1 G::;i(n
'TRANSOUC:
I. CONDITIONE Sli.MPL.ER - QUANTIZER
Efl
R I
I
●
Ts is the sampling interval or sampling period in seconds [sec], [s]
● Fs is the sampling frequency or sampling rate in samples per second [smp/s]
or in [Hz], [1/s]
x[0]
x[-1] x[1]
x[2]
●
A quantizer takes x[n] and produces a signal xq[n] that can only take a finite
number of values
● The quantizer output xq[n] is usually equal to the closest integer
● The number of quantization steps is a power of two
● The quantizer encodes signals whose values lie in the range:
●
Where Vmax is related to the number of quantization steps by:
B−1
●
and B is the number of bits of the quantizer V max = 2
9
8
7
6
5
-c
J 4
z 3
(!)
V)
2
1
~ 0
N-1
~-2
~-3
0-4
-5
-6
-7
-8
-9
-12-\,- .!e ..!7 .!e ..!a..:...:., ..!2 ..!, b i II I
a e
I I I
10 11
I
INPUT SIGNALI .J 4 12
\0.!e >( [n "]
I I
-, I
/ Quantization
Level
.-1-0riginal -, Analog
/ Signal/
xa(nT) → x[n] 4.1
/
-+---+--'---t---;;r-i
Discrete signal 16 .:
1---+- _ ,,,.. .....~
~,
. xa(t)
)
/
26 1-- ) ~'~ '~- - \
I
Unquantized Samples / , ·
xa(nt ) J...--L.---if---/ ,,t-t·-- Quantizatio. n
·E- I
"O
.:.: Quantized~ "\ Output of Zero-Order /
Digital signal .. 0
:: Samples --1--\--t--::7"",-~HoldDIA Converter •,,---1
xq(nt) \ »> xqCt) ) 1
<,
-
\
-tl Range of the
0. Quantizer
L-i-
L-i---+-+--+-Pri"'r--t--~J(-r-11
I
-2.1
- ~
[Proakis, Manolakis] ~D,.L---l~--i-~-+~-+~-+-~-t-
36
~'t'"--t---"1'---r-
0 I 21 4I 57 6 7 87 9T
t
Course: 63514 Biomedical Signal and ImagTeimPreocessing 7 7
Sampling a sinusoid - aliasing
●
Sampling a continuous-time sinusoid:
F
FS = f
x[n] a oos(27rnF / F; + ¢)
●
x[n] hides a difficulty arising from the ambiguity of frequency for discrete-time
sinusoids:
* It is not possible to know if the frequency of the original continuous-time signal x(t) was
F, or F + Fs, or F + 2Fs, etc; or, Fs – F or 2Fs – F, etc
●
This phenomenon is known as aliasing because frequencies may not be what they appear to be
once a continuous-time signal x(t) is sampled
●
Aliasing – the error in a signal arising from limitations in the system that generates or
processes the signal (Collins English Dictionary)
●
F – continuous-timefrequency in cycles per second [cyc/s], [Hz]
●
f - discrete-timefrequency in cycles per sample [cycles/sample], [cyc/smp]
●
How to avoid aliasing?
●
Regarding the previous example, what is the minimum number of samples
per sinusoid, N, that would still approximate a sinusoid? N = ?
●
Regarding the previous example, what is the highest frequency F (expressed
with Fs) of a sinusoid that would still be approximated, if using sampling
frequency Fs?
●
If Fs = 2.F, the Fs is said to be Nyquist frequency
●
Sampled analog signal x(t) should not contain frequencies higher than
Fs / 2;
●
Sampling frequency Fs should be higher than twice the highest frequency
F present in the analog signal, Fs ≥ 2. F
1
=> Principal value of discrete-time frequency 0 ≤f ≤
2
,.
F, - ∞ < F < ∞,
-3 - 0 1 3 4 6 7 Fre
the frequency in cycles per sec or Hertz [Hz] 2 q
(kHz)
f , - 1/2 ≤ f ≤ 1/2,
the frequency in cycles per sample [cyc/smp] −F S / 2 0 F S/ FS F
ω, - π ≤ ω ≤ π, ω = 2 π f, −1/ 2 0 2 1 f
●
The basic function Φ(t)t):
●
This function verifies the property:
1 ifn=O
¢,(nT.~) - { O otherwise
1
●
This property implies that x(t) = x[n] for t = nTs
● The signal is said to be sampled at Nyquist frequency if Fs = 2F