1 / 11

September 24–27, 2012, Algarve, Portugal

12 th International Scientific and Technical Conference From Imagery to Map: Digital Photogrammetric Technologies. Modern DSM creation algorithms in DPW’s Andrey Sechin Scientific Director, Racurs. September 24–27, 2012, Algarve, Portugal. DEM, DTM, DSM, nDSM.

helene
Download Presentation

September 24–27, 2012, Algarve, Portugal

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 12th International Scientific and Technical Conference From Imagery to Map: Digital Photogrammetric Technologies Modern DSM creation algorithms in DPW’s Andrey Sechin Scientific Director, Racurs September 24–27, 2012, Algarve, Portugal

  2. DEM, DTM, DSM, nDSM DEM, DTM have different definitions in different countries. In Russian (по-русски) ЦМР, ЦМП DEM & DTM - bare earth terrain. DSM include tree canopy & buildings.nDSM = DSM - DTM

  3. Local methods

  4. Local methods: advantages & problems • Pros: • no special memory requirements • fast • subpixel accuracy in “smooth” regions. • Cons: • problems in untexturedregions, with horizontal patterns, with repetitive patterns • discontinuities – the main problem.

  5. Local methods: example GeoEye-1 (0.5m) stereo satellite imagery

  6. Global methods Two epipolar images are considered E = E(data) + E(smooth) E(data)- measures photo consistency E(smooth)- measures smoothness. Penalties for small and large disparity changes NP hard problem

  7. Global methods: dynamic programming We cut energy function into scan lines. This gives very fast computing speed. The result is horizontal streaks in the disparity map.

  8. Global methods: graph-cuts & belief propagation We minimize energy approximately. Graph-cuts are not computationally efficient. Belief propagation generally does not converge but can computationally be very efficient.

  9. Global methods: SGM & simple tree We approximate energy and find the best solution strictly. Memory requirements for SGM = w*h*dmax. Filtering and smoothing is required. Special algorithms and modifications for multiple images, or for pushbroom sensors.

  10. Global methods: PHOTOMOD approach • All images are taken into account simultaneously • Memory efficient • Image pyramid hierarchy is used for speed and reliability • Image resection is used to calculate occlusions • Still requires filtering and smoothing on the final step

  11. Thank you for attention

More Related