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.007a.svgz" name="572753.fig.007a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Decomposition examples of the first classes</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/572753/figures/572753.fig.007b.svgz" name="572753.fig.007b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Decomposition examples of the second classes</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/572753/figures/572753.fig.007c.svgz" name="572753.fig.007c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Decomposition examples of the fifth classes</td></tr></table>

<div>The decomposed components of some samples taken from Extended Yale Face Database B. 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

fig7

Figure 7

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