Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
Gustavo Carneiro, Antoni B. Chan, Pedro J. Moreno,...
In active learning, a machine learning algorithm is given an unlabeled set of examples U, and is allowed to request labels for a relatively small subset of U to use for training. ...
We propose an information-theoretic method for multi-phase image segmentation, in an active contour-based framework. Our approach is based on nonparametric density estimates, and ...
Alan S. Willsky, Anthony J. Yezzi, John W. Fisher ...