2010
DOI: 10.1007/978-3-642-15555-0_43
|View full text |Cite
|
Sign up to set email alerts
|

Photo-Consistent Planar Patches from Unstructured Cloud of Points

Abstract: Planar patches are a very compact and stable intermediate representation of 3D scenes, as they are a good starting point for a complete automatic reconstruction of surfaces. This paper presents a novel method for extracting planar patches from an unstructured cloud of points that is produced by a typical structure and motion pipeline. The method integrates several constraints inside J-linkage, a robust algorithm for multiple models fitting. It makes use of information coming both from the 3D structure and the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 19 publications
(29 reference statements)
0
10
0
Order By: Relevance
“…After photo-adjustment the figure improves by about 4%. Figure 14: Running times of our method compared with [21]. The blue line plots the same data reported in Tab.…”
Section: Resultsmentioning
confidence: 95%
See 1 more Smart Citation
“…After photo-adjustment the figure improves by about 4%. Figure 14: Running times of our method compared with [21]. The blue line plots the same data reported in Tab.…”
Section: Resultsmentioning
confidence: 95%
“…= p 3.0 . Figure 14 compares the running time of this method (without photo-adjustment) with the sequential approach (as implemented in [21]): It clearly appears that the speed up gained by this approach is remarkable. Figure 12: Example of the e↵ect of the "opening" procedure.…”
Section: Hierarchical Processingmentioning
confidence: 99%
“…Given camera motion and 3D point cloud, early works on piecewiseplanar scene segmentation from multiple images [1,26] are based on line grouping and plane sweeping, whose complexity is prohibitive beyond a few images. More recently, [2] and [24] both combine the idea of random sampling consensus (RANSAC) with photometric consistency check to obtain piecewise planar scene models. However, the experiment results in both papers only involve simple examples with little non-planar structure.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, their computational complexity is still too high for our purpose. For example, it is reported in [24] that it takes 14 hours to process a sequence consisting of 380 frames. Finally, planes extracted from 3D point clouds or depth maps have been recently explored to improve the performance of multi-view stereo (MVS) systems [21,8,9,20].…”
Section: Related Workmentioning
confidence: 99%
“…Toldo et al proposed planar patch extraction using the J-linkage algorithm and reconstructed the scene with view clustering tree and hierarchical reconstruction [4]. 1 Google Sketchup, http://sketchup.google.com/ Some approaches have invoked the stronger Manhattan world assumption which states the world is piecewise planar and aligned to orthogonal axes.…”
Section: Introductionmentioning
confidence: 99%