Académique Documents
Professionnel Documents
Culture Documents
Leon F. Palafox
Hashimoto Laboratory
M2
37-086946
Outline
• Introduction
– Intelligent Space
– Compressive Sensing
– Swarm Intelligence
• Particle Swarm Optimization
• Motivation
• Algorithm Description
• Hardware Description
• Results
• Conclusions
• Future Work
05/11/09 2
Introduction
Intelligent Space
• It can be regarded as a
system that is able to
support humans, i.e.
users of the space, in
various ways.
05/11/09 3
Introduction
Compressive Sensing
05/11/09 4
Introduction
Compressive Sensing
Straightforward
ORTHO-
PICTURE SORTING CODING decoding
GONALIZITION
Signal Reconstruction
(1) Underdetermined system
PICTURE CODING M<N
(2) Reconstructed signal
must have N components
05/11/09 (3) L1 norm is used to find 5
sparse representation
Introduction
Compressive Sensing
05/11/09 6
Introduction
Compressive Sensing
y Φ Ψ S y Θ S
= =
x N
(a) K-sparse (b)
05/11/09 7
Introduction
Compressive Sensing
• Since M<N there are infinitely many solutions. Since Θ(s+r)= Θ(s)=y
for any vector r in the null space N(Θ). But we have a restriction that
the solution is sparse.
05/11/09 8
Introduction
Swarm Intelligence
05/11/09 9
Introduction
Particle Swarm Optimization
05/11/09 10
Introduction
Particle Swarm Optimization
05/11/09 11
Motivation
05/11/09 14
Hardware Description
05/11/09 15
Algorithm Description
WHERE
PSO
Sparse
Manifold
Conversion
WHO
WHAT
Random MASTER
Sampler MATRIX
Acceleromete SET
r WHEN
Sampler
HOW
Identification Algorithm
05/11/09 16
Algorithm Description
data.
– It is one of the objectives to create
a Matrix that can handle all kind of Random
Sampler
data. Acceleromete
r
income matrices.
05/11/09 17
Algorithm Description
MASTER
MATRIX
05/11/09 18
Preliminary Results
05/11/09 20
Preliminary Results
80 60
60
50
40
20
40
0
20 30
40
20
60
80
10
100
120 0
0 500 1000 1500 2000 2500 3000 3500 4000 4500 0 500 1000 1500 2000 2500 3000 3500 4000 4500
05/11/09 21
80
300
60
40 200
20
100
0
20
0
40
60 100
80
200
100
120
0 500 1000 1500 2000 2500 3000 3500 4000 4500 300
0 500 1000 1500 2000 2500 3000 3500 4000 4500
05/11/09 22
Conclusions
05/11/09 23
Future Work