Millimeter wave radar can measure distances, directions, and Doppler velocity for objects in harsh conditions such as fog. The 4D imaging radar with both vertical and horizontal data resembling an image can also measure objects' height. Previous studies have used 3D radars for ego-motion estimation. But few methods leveraged the rich data of imaging radars, and they usually omitted the mapping aspect, thus leading to inferior odometry accuracy. This paper presents a real-time imaging radar inertial odometry and mapping method, iRIOM, based on the submap concept. To deal with moving objects and multipath reflections, we use the graduated non-convexity method to robustly and efficiently estimate ego-velocity from a single scan. To measure the agreement between sparse non-repetitive radar scan points and submap points, the distribution-to-multi-distribution distance for matches is adopted. The ego-velocity, scan-to-submap matches are fused with the 6D inertial data by an iterative extended Kalman filter to get the platform's 3D position and orientation. A loop closure module is also developed to curb the odometry module's drift. To our knowledge, iRIOM based on the two modules is the first 4D radar inertial SLAM system. On our and third-party data, we show iRIOM's favorable odometry accuracy and mapping consistency against the FastLIO-SLAM and the EKFRIO. Also, the ablation study reveal the benefit of inertial data versus the constant velocity model, and scan-to-submap matching versus scan-to-scan matching.

Wide-angle cameras are widely used in photogrammetry and autonomous systems which rely on the accurate metric measurements derived from images. To find the geometric relationship between incoming rays and image pixels, geometric camera calibration (GCC) has been actively developed. Aiming to provide practical calibration guidelines, this work surveys the existing GCC tools and evaluates the representative ones for wide-angle cameras. The survey covers the camera models, calibration targets, and algorithms used in these tools, highlighting their properties and the trends in GCC development. The evaluation compares six target-based GCC tools, namely BabelCalib, Basalt, Camodocal, Kalibr, the MATLAB calibrator, and the OpenCV-based ROS calibrator, with simulated and real data for wide-angle cameras described by four parametric projection models. These tests reveal the strengths and weaknesses of these camera models, as well as the repeatability of these GCC tools. In view of the survey and evaluation, future research directions of wide-angle GCC are also discussed.

An accurate and consistent LiDAR point cloud map has a wide range of applications, such as in building information modeling, online retailing, and autonomous vehicles. However, existing methods face various drawbacks and challenges. First, odometry divergence often occurs in degraded, narrow corridors due to the lack of features. Additionally, large-scale global optimization with LiDAR point clouds remains challenging because of memory limitations and the complex derivations involved in the process. Towards removing these barriers, this paper proposes a consistent and efficient large scale LiDAR odometry and mapping method. First, we use distribution-to-multi-distribution constraints in odometry to deal with challenging scenes. Second, we propose a novel storage structure for LiDAR features, significantly reducing the excessive memory consumption of existing optimization methods. Moreover, we reformulate the error term in the optimization problem, enabling the use of generic least squares solvers and eliminating the need for complex derivative derivations. These improvements result in a substantial acceleration of LiDAR Bundle Adjustment. Third, the optimization focuses on minimizing the roughness of surfels within windows of selected adjacent LiDAR frames. By assigning frames around the loop to a window, our method naturally integrates loop closure into the optimization. This allows our method to effectively incorporate loop constraints in bundle adjustment. Finally, proposed method is validated in terms of memory efficiency, computational speed, mapping consistency, and accuracy using a public benchmark as well as our own datasets.

To address the matching challenge between the High Resolution Imaging Science Experiment (HiRISE) Digital Elevation Model (DEM) and the Mars Orbiter Laser Altimeter (MOLA) DEM, we propose a terrain matching framework based on the combination of point cloud coarse alignment and fine alignment methods. Firstly, we achieved global coarse localization of the HiRISE DEM through nearest neighbor matching of key Intrinsic Shape Signatures (ISS) points in the Fast Point Feature Histograms (FPFH) feature space. We introduced a graph matching strategy to mitigate gross errors in feature matching, employing a numerical method of non-cooperative game theory to solve the extremal optimization problem under Karush–Kuhn–Tucker (KKT) conditions. Secondly, to handle the substantial resolution disparities between the MOLA DEM and HiRISE DEM, we devised a smoothing weighting method tailored to enhance the Voxelized Generalized Iterative Closest Point (VGICP) approach for fine terrain registration. This involves leveraging the Euclidean distance between distributions to effectively weight loss and covariance, thereby reducing the results’ sensitivity to voxel radius selection. Our experiments show that the proposed algorithm improves the accuracy of terrain registration on the proposed Curiosity landing area’s, Mawrth Vallis, data by nearly 20%, with faster convergence and better algorithm robustness.