Sciweavers

2527 search results - page 105 / 506
» Discrete optimization in computer vision
Sort
View
98
Voted
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 10 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
100
Voted
CVPR
2006
IEEE
15 years 6 months ago
A Shape Representation for Planar Curves by Shape Signature Harmonic Embedding
This paper introduces a new representation for planar curves. From the well-known Dirichlet problem for a disk, the harmonic function embedded in a circular disk is solely depende...
Sang-Mook Lee, A. Lynn Abbott, Neil A. Clark, Phil...
110
Voted
ECCV
2010
Springer
15 years 6 months ago
Single Image Deblurring Using Motion Density Functions
Abstract. We present a novel single image deblurring method to estimate spatially non-uniform blur that results from camera shake. We use existing spatially invariant deconvolution...
118
Voted
ACCV
1998
Springer
15 years 4 months ago
Digital Geometric Methods in Image Analysis and Compression
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
Ari D. Gross, Longin Jan Latecki

Presentation
1717views
16 years 11 months ago
Global vs. Local Optimisation Algorithms
A detailed presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that shows the difference between local and ...