Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)
DOI: 10.1109/cvpr.2000.854938
|View full text |Cite
|
Sign up to set email alerts
|

Reconstruction of scene models from sparse 3D structure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…In our final area of computer vision in consideration, surface from contour completion [32,25,40,49], we again see the requirement for additional knowledge moving us away from the generalised volume completion problem. Here, however, unlike earlier knowledge dependent completion approaches we foresee potential for using surface/contour relatability as a sub-part of generalised volume completion where the required constraining knowledge is itself derived from the other identified aspects of volume mergability, world knowledge, and pattern completion.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In our final area of computer vision in consideration, surface from contour completion [32,25,40,49], we again see the requirement for additional knowledge moving us away from the generalised volume completion problem. Here, however, unlike earlier knowledge dependent completion approaches we foresee potential for using surface/contour relatability as a sub-part of generalised volume completion where the required constraining knowledge is itself derived from the other identified aspects of volume mergability, world knowledge, and pattern completion.…”
Section: Discussionmentioning
confidence: 99%
“…Recent work in constructing 3D models from sparse 3D data [49] has utilised triangulation on sparse data sets obtained using structure-from-motion over a sequence of 2D images. In this work, sparse corner and edge features were used as primes for the construction of a triangular mesh to describe the surfaces of the scene.…”
Section: Surfaces From Sparse Datamentioning
confidence: 99%
“…These depth maps can be merged as a post process stage (Narayanan et al, 1998). The fourth class is composed by algorithms that, instead of performing dense matching for each pixel, extract and match a subset of feature points for each image and then fit a surface to the reconstructed features (Manessis et al, 2000, Taylor, 2003.…”
Section: Previous Workmentioning
confidence: 99%
“…Other, more complicated, visibility constraints are also used and found to be necessary in practice: for example, a surface patch that partially occludes another one, without occluding an actual 3D point, is rejected. Such visibility constraints were used in [7], were a surface mesh is built incrementally, starting with a mesh obtained by a Delaunay triangulation in one view, and then rejecting and adding triangles based on visibility constraints of one additional view after the other. We proceed differently, by iteratively adding new triangles to manually or automatically selected seed triangles, and thus by letting a mesh grow, directly ensuring all available visibility constraints (and other constraints, see below).…”
Section: D Registration and Mesh Generationmentioning
confidence: 99%