—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate...
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...