Sciweavers

2527 search results - page 149 / 506
» Discrete optimization in computer vision
Sort
View
ATAL
2007
Springer
15 years 10 months ago
On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values
In a dynamic market, being able to update one’s value based on information available to other bidders currently in the market can be critical to having profitable transactions. ...
Florin Constantin, David C. Parkes
123
Voted
ACCV
2007
Springer
15 years 10 months ago
Conic Fitting Using the Geometric Distance
We consider the problem of fitting a conic to a set of 2D points. It is commonly agreed that minimizing geometrical error, i.e. the sum of squared distances between the points and...
Peter F. Sturm, Pau Gargallo
CVPR
2010
IEEE
15 years 9 months ago
Optimal Coded Sampling for Temporal Super-Resolution
Conventional low frame rate cameras result in blur and/or aliasing in images while capturing fast dynamic events. Multiple low speed cameras have been used previously with stagger...
Amit Agrawal, Mohit Gupta, Ashok Veeraraghavan, Sr...

Publication
700views
17 years 9 days ago
Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
David Mumford and Jayant Shah
102
Voted
CVPR
2009
IEEE
16 years 11 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)