Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
In this paper, we propose a hierarchical color correction algorithm for enhancing the color of digital images obtained from low quality digital image capture devices such as cell ...
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
In recent years, large databases of natural images have
become increasingly popular in the evaluation of face and
object recognition algorithms. However, Pinto et al. previously
...