Sciweavers

2527 search results - page 14 / 506
» Discrete optimization in computer vision
Sort
View
FOCS
2007
IEEE
14 years 4 months ago
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log
Jeong Han Kim, Ravi Montenegro, Prasad Tetali
ICPR
2008
IEEE
14 years 4 months ago
Linear representation of discrete surfaces in 3D
A method to compute a linear medial representation of a complex surface in the 3D discrete space is presented. The method involves voxel classification, surface labeling, anchor p...
Carlo Arcelli, Gabriella Sanniti di Baja, Luca Ser...
ECCV
1994
Springer
14 years 1 months ago
Markov Random Field Models in Computer Vision
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
Stan Z. Li
ICCV
2005
IEEE
14 years 3 months ago
Non-Orthogonal Binary Subspace and Its Applications in Computer Vision
This paper presents a novel approach that represents an image or a set of images using a nonorthogonal binary subspace (NBS) spanned by boxlike base vectors. These base vectors po...
Hai Tao, Ryan Crabb, Feng Tang
PRL
2007
158views more  PRL 2007»
13 years 9 months ago
Stability and convergence of the level set method in computer vision
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
Kunal N. Chaudhury, K. R. Ramakrishnan