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

<div>The coefficient matrix <svg height="8.85534pt" id="M281" style="vertical-align:-0.04981041pt" version="1.1" viewbox="-0.0498162 -8.80553 9.18156 8.85534" width="9.18156pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M701 633L695 650H264C230 650 223 653 209 675H184C176 622 160 547 140 473L173 471C198 528 219 557 232 573C254 600 272 612 384 612H566L24 18L33 0H597C617 34 651 142 661 179L629 194C598 133 574 92 545 69C510 41 440 40 342 40C274 40 209 42 163 46L701 633Z" id="g50-91"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="725" vert-adv-y="725"></glyph.data></g></svg> of RMR for Extended Yale Face Database B.</div>

Mathematical Problems in Engineering

fig6

Figure 6

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