196 search results - page 22 / 40 » Globally optimal bilinear programming for computer vision ap... |
ISCAS
1994
IEEE
15 years 3 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
126
click to vote
PPOPP
2009
ACM
16 years 8 days ago
2009
ACM
GPGPUs have recently emerged as powerful vehicles for generalpurpose high-performance computing. Although a new Compute Unified Device Architecture (CUDA) programming model from N...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
111
Voted
ICCV
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...