4432 search results - page 633 / 887 » Solving Demodulation as an Optimization Problem |
128
Voted
ICIAP
2005
ACM
16 years 1 months ago
2005
ACM
Abstract. We present a technique that achieves local contrast enhancement by representing it as an optimization problem. For this, we first introduce a scalar objective function th...
91
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
128
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
88
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
104
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...