Improved Moves for Truncated Convex Models (2009)
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex model. For this...
An Analysis of Convex Relaxations for MAP Estimation (2008)
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known to be NP-hard. However,...
An Analysis of Convex Relaxations for MAP Estimation (2008)
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known to be NP-hard. However,...
recognition, which can be further extended to a Facial Gesture recognition system. Face recognition is an important problem of computer vision with important commercial applications in biometric...
An Analysis of Convex Relaxations for MAP Estimation (2008)
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known to be NP-hard. However,...
Building Blocks For Autonomous Navigation Using Contour (2008)
Correspondences Pawan Kumar, M. Pawan, P. J. Narayanan
We address a few problems in navigation of automated vehicles using images captured by a mounted camera. Specifically, we look at the recognition of sign boards, rectification of planar objects...
Polygonal Approximation of Closed Curves across Multiple Views (2007)
M. Pawan, Kumar Saurabh, P. J. Narayanan
Polygon approximation is an important step in the recognition of planar shapes. Traditional polygonal approximation algorithms handle only images that are related by a similarity transformation. The...
P 3 & beyond: Solving energies with higher order cliques (2007)
Pushmeet Kohli, M. Pawan, Kumar Philip, H. S. Torr
In this paper we extend the class of energy functions for which the optimal α-expansion and αβ-swap moves can be computed in polynomial time. Specifically, we introduce a class of higher order...