A Rank-Constrained Matrix Representation for Hypergraph-Based Subspace Clustering

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/572753/figures/572753.fig.0011a.svgz" name="572753.fig.0011a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Decomposition examples of the third classes</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/572753/figures/572753.fig.0011b.svgz" name="572753.fig.0011b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Decomposition examples of the fourth classes</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/572753/figures/572753.fig.0011c.svgz" name="572753.fig.0011c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Decomposition examples of the ninth classes</td></tr></table>

<div>The decomposed components of some samples taken from AR. The first rows in (a), (b), and (c) display the decomposition of our RMR method and the second row corresponds to the results of LRR method.</div>

Mathematical Problems in Engineering

fig11

Figure 11

Figure 11: A Rank-Constrained Matrix Representation for Hypergraph-Based Subspace Clustering 