Académique Documents
Professionnel Documents
Culture Documents
clustering
Liangli Zhen, Zhang Yi, Xi Peng and Dezhong Peng
The construction of similarity graph plays an essential role in the spectral
clustering algorithm. There exist two popular schemes to construct
a similarity graph, i.e., the pairwise distance-based scheme and the
linear representation-based scheme. It is notable that the above schemes
suffered from some limitations and drawbacks, respectively. Specifically,
the pairwise distance-based scheme is sensitive to noises and outliers,
while the linear representation-based scheme may incorrectly select
inter-subspaces points to represent the objective point. These drawbacks
degrade the performance of the spectral clustering algorithms greatly. To
overcome these problems, the present letter proposes a novel scheme to
construct the similarity graph, where the similarity computation among
different data points depends on both their pairwise distances and the
linear representation relationships. This proposed scheme, called Locally
Linear Representation (LLR), encodes each data point using a collection
of data points that not only produce the minimal reconstruction error but
also are close to the objective point, which makes it robust to noises
and outliers, and avoid selecting inter-subspaces points to represent the
objective point to a large extent.
ELECTRONICS LETTERS
Vol. 00
No. 00
(a) PDS
(b) LRS
s.t. 1T ci = 1,
(1)
ci
M1
i 1
.
T
1 M1
i 1
(2)
T
T
T
where Mi = ST
i Si + (1 )(xi 1 Di ) (xi 1 Di ).
Note that the above solution is not sparse. It contains many trivial
coefficients. This will increase the time cost of spectral clustering. By
following [6], we get a sparse similarity graph by keeping k largest entries
in ci and setting the rests to zeros.
Once the similarity graph is built, we could apply the graph to image
clustering problem under the framework of spectral clustering [1, 7, 8].
Algorithm 1 summarizes the whole procedure of our algorithm.
s.t. 1T ci = 1,
ci
Yale database B. t1 denotes the CPU elapse time (second) for building
similarity graph and t2 is the whole time cost.
Metric
AC
NMI
t1
t2
LLR
0.883
0.922
14.628
102.256
LRR [5]
0.713
0.772
38.095
90.8268
SSC [3]
0.613
0.684
159.665
231.235
LLEC [4]
0.461
0.540
0.678
74.309
SC [8]
0.426
0.539
0.264
64.606
k-means
0.098
0.115
4.543
LLR
0.837
0.929
8.696
111.618
LRR [5]
0.771
0.910
30.495
128.343
SSC [3]
0.767
0.886
164.327
286.978
LLEC [4]
0.396
0.682
0.318
107.779
SC [8]
0.361
0.652
0.147
113.918
k-means
0.311
0.611
4.460
Acknowledgment: This