Sciweavers

1477 search results - page 56 / 296
» Random Convex Programs
Sort
View
PAMI
2007
125views more  PAMI 2007»
13 years 8 months ago
Matching by Linear Programming and Successive Convexification
—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...
Hao Jiang, Mark S. Drew, Ze-Nian Li
CVPR
2008
IEEE
14 years 10 months ago
Globally optimal bilinear programming for computer vision applications
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...
Manmohan Krishna Chandraker, David J. Kriegman
DCC
2003
IEEE
14 years 8 months ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
ICDAR
2009
IEEE
14 years 3 months ago
Multi-Oriented and Multi-Sized Touching Character Segmentation Using Dynamic Programming
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...
Partha Pratim Roy, Umapada Pal, Josep Lladó...
COR
2002
90views more  COR 2002»
13 years 8 months ago
Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming prob
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...
Behnam Malakooti, Jumah E. Al-alwani