2003
DOI: 10.1111/1467-8659.00675
|View full text |Cite
|
Sign up to set email alerts
|

Multi‐scale Feature Extraction on Point‐Sampled Surfaces

Abstract: We present a new technique for extracting line‐type features on point‐sampled geometry. Given an unstructuredpoint cloud as input, our method first applies principal component analysis on local neighborhoods toclassify points according to the likelihood that they belong to a feature. Using hysteresis thresholding, we thencompute a minimum spanning graph as an initial approximation of the feature lines. To smooth out the featureswhile maintaining a close connection to the underlying surface, we use an adaptatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
308
0
3

Year Published

2005
2005
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 459 publications
(335 citation statements)
references
References 22 publications
2
308
0
3
Order By: Relevance
“…Since the point cloud is obtained from a few consecutive frames (or a single frame) we can consider it to be from a single-view. We convert it into a curvature map, where each pixel stores the ratio r. Using hysteresis thresholding [18] we detect connected regions of high r. We perform non-maximal suppression on these regions to get the internal edges. Contours or external edges are regions where depth discontinuities are large.…”
Section: Edgelet Detectionmentioning
confidence: 99%
“…Since the point cloud is obtained from a few consecutive frames (or a single frame) we can consider it to be from a single-view. We convert it into a curvature map, where each pixel stores the ratio r. Using hysteresis thresholding [18] we detect connected regions of high r. We perform non-maximal suppression on these regions to get the internal edges. Contours or external edges are regions where depth discontinuities are large.…”
Section: Edgelet Detectionmentioning
confidence: 99%
“…Finally, we note that PCA on mesh vertices is equivalent to least square fitting of a plane, and thus, the method of choice for the local tangent plane estimation required in applications ranging from surface reconstruction (Hoppe et al, 1992) to feature detection (Pauly et al, 2003).…”
Section: Related Workmentioning
confidence: 99%
“…The structural features are detected and extracted following the idea of [8], [29] and [25] of identifying initial seed nodes and performing an edge-growing approach to connect related nodes. The seed nodes for a graph are represented by all points having a minimal type probability.…”
Section: Generating the Feature Graphmentioning
confidence: 99%
“…1(c) and 2c). Rather than using a minimal spanning graph as proposed by Pauly et al [29], this approach provides greater consistency between edges and feature directions.…”
Section: Edge Propagationmentioning
confidence: 99%