A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation

<div>Decomposition of <svg height="8.98583pt" id="M367" style="vertical-align:-0.3499308pt" version="1.1" viewbox="-0.0498162 -8.6359 30.116 8.98583" width="30.116pt" 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="M640 650H413L406 622L438 617C475 611 483 605 463 571C422 503 346 400 296 333C264 403 215 529 199 575C189 604 191 614 228 618L262 622L271 650H30L23 622C90 615 97 609 119 553L212 321C222 295 223 285 218 259L193 127C176 39 167 33 82 28L76 0H350L356 28C266 36 257 40 275 127L303 266C308 290 314 302 328 322C396 418 454 493 498 546C551 610 565 616 631 622L640 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,11.387,0)"><path d="M535 230V280H323V490H265V280H52V230H265V-3H323V230H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.923,0)"><path d="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z"></path></g></svg> in Wallflower.</div>

Mathematical Problems in Engineering

fig3

Figure 3

Figure 3: A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation 