Traditional feature matching methods such as scale-invariant feature transform (SIFT) usually use image intensity or gradient information to detect and describe feature points; however, both intensity and gradient are sensitive to nonlinear radiation distortions (NRD). To solve the problem, this paper proposes a novel feature matching algorithm that is robust to large NRD. The proposed method is called radiation-invariant feature transform (RIFT). There are three main contributions in RIFT: first, RIFT uses phase congruency (PC) instead of image intensity for feature point detection. RIFT considers both the number and repeatability of feature points, and detects both corner points and edge points on the PC map. Second, RIFT originally proposes a maximum index map (MIM) for feature description. MIM is constructed from the log-Gabor convolution sequence and is much more robust to NRD than traditional gradient map. Thus, RIFT not only largely improves the stability of feature detection, but also overcomes the limitation of gradient information for feature description. Third, RIFT analyzes the inherent influence of rotations on the values of MIM, and realizes rotation invariance. We use six different types of multi-model image datasets to evaluate RIFT, including optical-optical, infrared-optical, synthetic aperture radar (SAR)-optical, depth-optical, map-optical, and day-night datasets. Experimental results show that RIFT is much more superior to SIFT and SAR-SIFT. To the best of our knowledge, RIFT is the first feature matching algorithm that can achieve good performance on all the above-mentioned types of multi-model images. The source code of RIFT and multi-modal remote sensing image datasets are made public 1 .Index Terms-multi-modal image matching, nonlinear radiation distortions (NRD), feature matching, maximum index map (MIM), phase congruency (PC).
Scan matching, an approach to recover the relative position and orientation of two laser scans, is a very important technique for indoor positioning and indoor modeling. The iterative closest point (ICP) algorithm and its variants are the most well-known techniques for such a problem. However, ICP algorithms rely highly on the initial guess of the relative transformation, which will reduce its power for practical applications. In this paper, an initial-free 2D laser scan matching method based on point and line features is proposed. We carefully design a framework for the detection of point and line feature correspondences. First, distinct feature points are detected based on an extended 1D SIFT, and line features are extracted via a modified Split-and-Merge algorithm. In this stage, we also give an effective strategy for discarding unreliable features. The point and line features are then described by a distance histogram; the pairs achieving best matching scores are accepted as potential correct correspondences. The histogram cluster technique is adapted to filter outliers and provide an accurate initial value of the rigid transformation. We also proposed a new relative pose estimation method that is robust to outliers. We use the lq-norm (0 < q < 1) metric in this approach, in contrast to classic optimization methods whose cost function is based on the l2-norm of residuals. Extensive experiments on real data demonstrate that the proposed method is almost as accurate as ICPs and is initial free. We also show that our scan matching method can be integrated into a simultaneous localization and mapping (SLAM) system for indoor mapping.
Street trees are an important part of urban facilities, and they can provide both aesthetic benefits and ecological benefits for urban environments. Ecological benefits of street trees now are attracting more attention because of environmental deterioration in cities. Conventional methods of evaluating ecological benefits require a lot of labor and time, and establishing an efficient and effective evaluating method is challenging. In this study, we investigated the feasibility to use mobile laser scanning (MLS) data to evaluate carbon sequestration and fine particulate matter (PM 2.5 ) removal of street trees. We explored the approach to extract individual street trees from MLS data, and street trees of three streets in Nantong City were extracted. The correctness rates and completeness rates of extraction results were both over 92%. Morphological parameters, including tree height, crown width, and diameter at breast height (DBH), were measured for extracted street trees, and parameters derived from MLS data were in a good agreement with field-measured parameters. Necessary information about street trees, including tree height, DBH, and tree species, meteorological data and PM 2.5 deposition velocities were imported into i-Tree Eco model to estimate carbon sequestration and PM 2.5 removal. The estimation results indicated that ecological benefits generated by different tree species were considerably varied and the differences for trees of the same species were mainly caused by the differences in morphological parameters (tree height and DBH). This study succeeds in estimating the amount of carbon sequestration and PM 2.5 removal of individual street trees with MLS data, and provides researchers with a novel and efficient way to investigate ecological benefits of urban street trees or urban forests.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.