100 search results - page 10 / 20 » Planar Visibility Counting |
101
click to vote
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
COMPGEOM
2007
ACM
15 years 2 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
125
click to vote
ICCV
2009
IEEE
16 years 3 months ago
2009
IEEE
We present a novel multi-view stereo method designed
for image-based rendering that generates piecewise planar
depth maps from an unordered collection of photographs.
First a di...
ECCV
2006
Springer
15 years 12 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...