Image Processing Reference
In-Depth Information
Input
P
(
m
)
(
j
ω)
…
Feasible sets
Q
i
,
k
Feasible sets
Q
i
,
k
Feasible sets
Q
i
,
k
(
m
+1)
P
Speech
source
x
(
n
)
(
m
)
P
i
FIGURE .
Star Algorithm. Again, only three feasible sets
Q
i
,
k
are shown in the inside picture. In practice, each
sensor node has to repeat the sequence of projections and averaging many times before it can successfully project the
input
P
(
m
)
e
j
ω
(
)
suppliedbythecentralnodeintotheintersectionofitsfeasiblesets.heprojectionresult,whichis
called
P
(
m
)
is sent back to the central node. he central node then averages all the
P
(
m
)
e
j
ω
e
j
ω
(
)
(
)
it has received and
i
i
averages them to produce
P
(
m
+
)
e
j
ω
(
)
. his is sent back to the individual nodes and the process repeats.
m
=1
m
=0
1.4
1.4
1.2
1.2
1
1
0.8
0.8
0.6
0.6
0.4
0.4
0.2
0.2
0
0
0
0.5
1
1.5
2
2.5
3
3.5
0
0.5
1
1.5
2
2.5
3
3.5
(a)
(b)
Radian frequency (ω)
Radian frequency (ω)
FIGURE .
Star algorithm results.
(
continued
)
