Sciweavers

164 search results - page 13 / 33
» Adaptive Algorithms for Planar Convex Hull Problems
Sort
View
ICPR
2000
IEEE
14 years 8 months ago
A Concurrent Region Growing Algorithm Guided by Circumscribed Contours
Image segmentation of natural scenes constitutes a major problem in Machine Vision. This paper presents a new proposal for the image segmentation problem which has been based on t...
Xavier Cufí, Xavier Muñoz, Jordi Fre...
CISS
2008
IEEE
14 years 2 months ago
Partial side information problem: Equivalence of two inner bounds
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
Soumya Jana, Richard E. Blahut
ENDM
2008
142views more  ENDM 2008»
13 years 7 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
MP
2011
13 years 2 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
IJIG
2008
222views more  IJIG 2008»
13 years 7 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars