Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees
In this article we present an algorithm for the fusion of depth images derived by dense image matching (DIM). One key idea of our algorithm is to generate a 2D triangulation for each available depth map in the image sequence using a restricted quadtrees (RQT). On the one hand this guarantees <i&g...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Copernicus Publications
2014-08-01
|
| Series: | The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| Online Access: | http://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XL-3/281/2014/isprsarchives-XL-3-281-2014.pdf |
| _version_ | 1818177936298082304 |
|---|---|
| author | M. Rothermel N. Haala D. Fritsch |
| author_facet | M. Rothermel N. Haala D. Fritsch |
| author_sort | M. Rothermel |
| collection | DOAJ |
| description | In this article we present an algorithm for the fusion of depth images derived by dense image matching (DIM). One key idea of our
algorithm is to generate a 2D triangulation for each available depth map in the image sequence using a restricted quadtrees (RQT). On
the one hand this guarantees <i>matching triangulations</i>, on the other hand this creates the possibility to reduce points in the noise range
not contributing to the geometry in a controlled manner. By vertex decimation computational efforts in subsequent processing steps
are eased. In order to reduce IO overhead, the algorithm is designed in an iterative way: an initial triangulation is lifted to 3D space
and, if pixel footprints are comparable, updated using depths of the subsequent map in the sequence. Previously not observed surface
regions or surface patches observed only with adverse precision are removed from the existing model and updated by more appropriate
triangulations. Thereby differences in scale across depth maps are handled which is particularly important to preserve details and
obtain surfaces with the best reconstruction geometry. To remove outliers visibility constraints are forced. The input is overlapping
depth images and their poses in space, the output are point coordinates representing the surface, their respective normals and to some
degree spatial neighbourhood information of points represented as a non-watertight mesh. The performance of the algorithm will be
evaluated on a close range and a oblique aerial dataset. |
| first_indexed | 2024-12-11T20:40:00Z |
| format | Article |
| id | doaj.art-7418e98d3baa4de8a0c02207e9e866e5 |
| institution | Directory Open Access Journal |
| issn | 1682-1750 2194-9034 |
| language | English |
| last_indexed | 2024-12-11T20:40:00Z |
| publishDate | 2014-08-01 |
| publisher | Copernicus Publications |
| record_format | Article |
| series | The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| spelling | doaj.art-7418e98d3baa4de8a0c02207e9e866e52022-12-22T00:51:33ZengCopernicus PublicationsThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences1682-17502194-90342014-08-01XL-328128710.5194/isprsarchives-XL-3-281-2014Generating Oriented Pointsets From Redundant Depth Maps Using Restricted QuadtreesM. Rothermel0N. Haala1D. Fritsch2Institute for Photogrammetry, University Stuttgart, Stuttgart, GermanyInstitute for Photogrammetry, University Stuttgart, Stuttgart, GermanyInstitute for Photogrammetry, University Stuttgart, Stuttgart, GermanyIn this article we present an algorithm for the fusion of depth images derived by dense image matching (DIM). One key idea of our algorithm is to generate a 2D triangulation for each available depth map in the image sequence using a restricted quadtrees (RQT). On the one hand this guarantees <i>matching triangulations</i>, on the other hand this creates the possibility to reduce points in the noise range not contributing to the geometry in a controlled manner. By vertex decimation computational efforts in subsequent processing steps are eased. In order to reduce IO overhead, the algorithm is designed in an iterative way: an initial triangulation is lifted to 3D space and, if pixel footprints are comparable, updated using depths of the subsequent map in the sequence. Previously not observed surface regions or surface patches observed only with adverse precision are removed from the existing model and updated by more appropriate triangulations. Thereby differences in scale across depth maps are handled which is particularly important to preserve details and obtain surfaces with the best reconstruction geometry. To remove outliers visibility constraints are forced. The input is overlapping depth images and their poses in space, the output are point coordinates representing the surface, their respective normals and to some degree spatial neighbourhood information of points represented as a non-watertight mesh. The performance of the algorithm will be evaluated on a close range and a oblique aerial dataset.http://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XL-3/281/2014/isprsarchives-XL-3-281-2014.pdf |
| spellingShingle | M. Rothermel N. Haala D. Fritsch Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| title | Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees |
| title_full | Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees |
| title_fullStr | Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees |
| title_full_unstemmed | Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees |
| title_short | Generating Oriented Pointsets From Redundant Depth Maps Using Restricted Quadtrees |
| title_sort | generating oriented pointsets from redundant depth maps using restricted quadtrees |
| url | http://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XL-3/281/2014/isprsarchives-XL-3-281-2014.pdf |
| work_keys_str_mv | AT mrothermel generatingorientedpointsetsfromredundantdepthmapsusingrestrictedquadtrees AT nhaala generatingorientedpointsetsfromredundantdepthmapsusingrestrictedquadtrees AT dfritsch generatingorientedpointsetsfromredundantdepthmapsusingrestrictedquadtrees |