Sciweavers

118 search results - page 13 / 24
» On a Geometric Approach to the Segment Sum Problem and Its G...
Sort
View
CVPR
2009
IEEE
14 years 4 months ago
Motion pattern interpretation and detection for tracking moving vehicles in airborne video
Detection and tracking of moving vehicles in airborne videos is a challenging problem. Many approaches have been proposed to improve motion segmentation on frameby-frame and pixel...
Gérard G. Medioni, Qian Yu
ICIP
1999
IEEE
13 years 11 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
CGF
2008
87views more  CGF 2008»
13 years 6 months ago
Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections
This paper deals with the reconstruction of 2-dimensional geometric shapes from unorganized 1-dimensional cross-sections. We study the problem in its full generality following the...
Pooran Memari, Jean-Daniel Boissonnat
COMPGEOM
2010
ACM
14 years 14 days ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 2 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...