2015
DOI: 10.1111/cgf.12730
|View full text |Cite
|
Sign up to set email alerts
|

Detection of Geometric Temporal Changes in Point Clouds

Abstract: Detecting geometric changes between two 3D captures of the same location performed at different moments is a critical operation for all systems requiring a precise segmentation between change and no‐change regions. Such application scenarios include 3D surface reconstruction, environment monitoring, natural events management and forensic science. Unfortunately, typical 3D scanning setups cannot provide any one‐to‐one mapping between measured samples in static regions: in particular, both extrinsic and intrinsi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 26 publications
0
8
0
Order By: Relevance
“…Obviously, the choice of the change detection algorithm can partially influence the effectiveness of the method, even if the principles behind it still remain valid. In the released visualization tool, we add a demo with two different versions of a Gargoyle where the change field was computed with different algorithms: the algorithm from [PCBS16] and the Hausdorff distance [CRS98] normalized with respect to the maximum distance. The relative change maps are shown in Figure .…”
Section: Discussion and Extensionsmentioning
confidence: 99%
See 4 more Smart Citations
“…Obviously, the choice of the change detection algorithm can partially influence the effectiveness of the method, even if the principles behind it still remain valid. In the released visualization tool, we add a demo with two different versions of a Gargoyle where the change field was computed with different algorithms: the algorithm from [PCBS16] and the Hausdorff distance [CRS98] normalized with respect to the maximum distance. The relative change maps are shown in Figure .…”
Section: Discussion and Extensionsmentioning
confidence: 99%
“…To overcome this problem, we interpolate the alpha parameters αC and αNC in a neighbourhood of the change threshold d . For this purpose, we require a change field with a continuous and smooth radial distribution around the real changes, like the field computed with a simple Hausdorff distance or with [PCBS16]. In particular, for all the pixels with at least one change value q0 and q1 in the range [dδ,d+δ], we interpolate the alpha blending parameters using the following function g(α1,α2,|boldq0d|+|boldq1d|) (Figure b): gfalse(α1,α2,bfalse)=leftα1+α22+false(α1α2false)2b2δleft1emb2δleftα1left1emb>2δ.The obtained result is a smoother transition near the boundary of the binary segmentation that makes less abrupt and more pleasant the final colour interpolation (Figure ).…”
Section: Algorithmmentioning
confidence: 99%
See 3 more Smart Citations