2003
DOI: 10.1016/s0031-3203(02)00050-x
|View full text |Cite
|
Sign up to set email alerts
|

An estimation-based approach for range image segmentation: on the reliability of primitive extraction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(10 citation statements)
references
References 20 publications
0
10
0
Order By: Relevance
“…A distinction is made between segmentation based on normal vectors, 39,40 curvatures, [41][42][43][44][45] and fitting polynomials. [46][47][48] Existing techniques using low-degree polynomial fitting for surface segmentation consider planar patches 48 and quadratic patches, [49][50][51] such as circular cylinders 52 and ellipsoidal surfaces. 53 These techniques are often not suited to segment intensity images.…”
Section: Related Workmentioning
confidence: 99%
“…A distinction is made between segmentation based on normal vectors, 39,40 curvatures, [41][42][43][44][45] and fitting polynomials. [46][47][48] Existing techniques using low-degree polynomial fitting for surface segmentation consider planar patches 48 and quadratic patches, [49][50][51] such as circular cylinders 52 and ellipsoidal surfaces. 53 These techniques are often not suited to segment intensity images.…”
Section: Related Workmentioning
confidence: 99%
“…In [5], Dai et al describe recovery of paraboloid geometric parameters 1 by linear least squares, without considering uncertainty. In [17] Wang et al studied quadric extraction in the context of range image segmentation, including quantified uncertainty in the algebraic (not geometric) patch parameters, but not on the input points. Our fitting algorithm quantifies both input and output uncertainty and recovers geometric parameters of bounded patches.…”
Section: A Related Workmentioning
confidence: 99%
“…The latter holds for circular boundaries, which we use for circular paraboloids. Let κ be the surface curvature and d c the bounding circle radius; circular paraboloids are then defined by (12)(13)(14)(15)(16)(17) …”
Section: A Paraboloidsmentioning
confidence: 99%
“…The bottom-up approach expands the cluster starting from an initial seed point by measuring the similarity criteria [8,9] of unallocated neighboring points. Chang and Park [8] combined the Bayesian theory and Markov random field (MRF) approach to access the prior regional shape, which extracts parametric surfaces by representing the scanned objects by a series of local planar surfaces.…”
Section: B Region-based Segmentationmentioning
confidence: 99%
“…Chang and Park [8] combined the Bayesian theory and Markov random field (MRF) approach to access the prior regional shape, which extracts parametric surfaces by representing the scanned objects by a series of local planar surfaces. Wang et al [9] developed a reliable region-growing and merging algorithm based on the uncertainty of the segmented data and demonstrated on simple geometries.…”
Section: B Region-based Segmentationmentioning
confidence: 99%