TY - GEN
T1 - Modeling appearances with low-rank SVM
AU - Wolf, Lior
AU - Jhuang, Hueihan
AU - Hazan, Tamir
PY - 2007
Y1 - 2007
N2 - Several authors have noticed that the common representation of images as vectors is sub-optimal The process of vectorization eliminates spatial relations between some of the nearby image measurements and produces a vector of a dimension which is the product of the measurements' dimensions. It seems that images may be better represented when taking into account their structure as a 2D (or multi-D) array. Our work bears similarities to recent work such as 2DPCA or Coupled Subspace Analysis in that we treat images as 2D arrays. The main difference, however, is that unlike previous work which separated representation from the discriminative learning stage, we achieve both by the same method. Our framework, "Low-Rank separators", studies the use of a separating hyperplane which are constrained to have the structure of low-rank matrices. We first prove that the low-rank constraint provides preferable generalization properties. We then define two "Low-rank SVMproblems" and propose algorithms to solve these. Finally, we provide supporting experimental evidence for the framework.
AB - Several authors have noticed that the common representation of images as vectors is sub-optimal The process of vectorization eliminates spatial relations between some of the nearby image measurements and produces a vector of a dimension which is the product of the measurements' dimensions. It seems that images may be better represented when taking into account their structure as a 2D (or multi-D) array. Our work bears similarities to recent work such as 2DPCA or Coupled Subspace Analysis in that we treat images as 2D arrays. The main difference, however, is that unlike previous work which separated representation from the discriminative learning stage, we achieve both by the same method. Our framework, "Low-Rank separators", studies the use of a separating hyperplane which are constrained to have the structure of low-rank matrices. We first prove that the low-rank constraint provides preferable generalization properties. We then define two "Low-rank SVMproblems" and propose algorithms to solve these. Finally, we provide supporting experimental evidence for the framework.
UR - http://www.scopus.com/inward/record.url?scp=34948900880&partnerID=8YFLogxK
U2 - 10.1109/CVPR.2007.383099
DO - 10.1109/CVPR.2007.383099
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:34948900880
SN - 1424411807
SN - 9781424411801
T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
BT - 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07
PB - IEEE Computer Society
T2 - 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR'07
Y2 - 17 June 2007 through 22 June 2007
ER -