期刊名称:ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
印刷版ISSN:2194-9042
电子版ISSN:2194-9050
出版年度:2008
卷号:XXXVII Part B4
页码:1241-1246
出版社:Copernicus Publications
摘要:Multi-temporal DEM co-registration provides an efficient technique for automatic analyzing the terrestrial changes caused by the geological hazards. Because this technique does not require any ground control points (GCPs), it can bring us many benefits: 1) avoid the GCP establishment, which is a cost and labor- intensive task; 2) quick response to the natural hazards, especially to the landslides and debris-flows; 3)make full use of remote sensing data obtained before the events. It is very difficult to obtain effective GCP owing to the terrestrial changes, even impossible; 4) analyze the region could not access. Iterative closest points (ICP) is the standard algorithm for surface matching in computer vision and pattern recognition. Its computational efficiency is slower and only suit for relative small data set. It adopts an exhaustive search strategy to find the point-to-point or point-to-normal corresponding pairs. It is very time-consuming, and consumes about 95% time of the whole matching process. Although many modifications have reported to speed up the corresponding pairs searching, it still could not meet the requirement for co-registering the large gridded DEM used in geosciences. This paper proposes an efficiency correspondence criterion for gridded DEM matching, called normal correspondence criterion (NCC), which finds the corresponding points alone the reference DEM normal vector and is optimized with a focus on the gridded date set. The experimental results show that the corresponding points can be determined within no more than 6 iterations in most cases, which yields high efficiency to DEM co-registration. According to the numerous experimental results based on the simulated data sets, DEM co-registration with NCC only use 1/10 time than that used by ICP, and slight larger convergence range