Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
We present an online learning algorithm for training parsers which allows for the inclusion of multiple objective functions. The primary example is the extension of a standard sup...
Keith Hall, Ryan T. McDonald, Jason Katz-Brown, Mi...
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
State-of-the-art person re-identication methods seek robust person matching through combining various feature types. Often, these features are implicitly assigned with a single ve...