--- title: 'FAST-Calib: LiDAR–Camera Calibration' url: https://www.emergentmind.com/topics/fast-calib type: topic --- # FAST-Calib: LiDAR–Camera Calibration Searching arXiv for FAST-Calib and closely related calibration work to ground the article in current papers. FAST-Calib is a target-based method for LiDAR–camera extrinsic calibration that estimates the rigid-body transformation \(T_{CL}\in SE(3)\) mapping points from the LiDAR frame into the camera frame. It is presented as a fast and user-friendly tool built around a custom-made 3D target, a pattern-agnostic LiDAR edge extraction procedure, ellipse-based compensation for LiDAR spot spread, and joint optimization across multiple scenes. The reported system supports both mechanical and solid-state LiDARs, operates in under \(0.7\) s on CPU, and achieves point-to-point registration residuals consistently below \(6.5\) mm on the tested platforms [2507.17210]. ## 1. Problem definition and estimation objective FAST-Calib addresses LiDAR–camera extrinsic calibration by estimating the rigid-body transform \(T_{CL}\) that maps a LiDAR point \(p_L\) into the camera frame as $$ p_C = R_{CL}\,p_L + t_{CL}, $$ where \(R_{CL}\in SO(3)\) and \(t_{CL}\in \mathbb{R}^3\). Given two sets of 3D correspondences \(\{p_i^C\}_{i=1}^M\) from the camera and \(\{p_i^L\}_{i=1}^M\) from the LiDAR, the extrinsic parameters minimize the least-squares objective $$ J(R_{CL},t_{CL})=\sum_{i=1}^M \left\|p_i^C-\left(R_{CL}\,p_i^L+t_{CL}\right)\right\|^2. $$ For a single capture, FAST-Calib produces four exact correspondences; for \(N\) captures, the correspondence count is \(M=4N\). The multi-scene registration problem is written as $$ \min_{R,t}\ \frac{1}{M}\sum_{i=1}^M \left\|p_i^C-\left(R\,p_i^L+t\right)\right\|^2. $$ This formulation places FAST-Calib in the class of 3D–3D rigid registration methods. Its distinctive contribution lies not in altering the registration criterion itself, but in constructing cross-modal correspondences quickly and in a way that is stated to be agnostic to LiDAR scan patterns [2507.17210]. ## 2. Custom 3D target and cross-modal correspondence construction The physical target is a flat board with four circular holes of known radius \(r\) and known center locations in the board frame \(B\), together with four ArUco markers at the board corners. The camera-side processing begins by detecting the four ArUco markers; with camera intrinsics \(K\) and lens distortion, a PnP solver recovers the board-to-camera pose \(T_{CB}\). The known offsets of the hole centers in the board frame then yield their 3D coordinates in the camera frame according to $$ p_i^C = T_{CB}\,p_i^B,\qquad i=1,\dots,4. $$ On the LiDAR side, the observed structure consists of the board’s planar surface and the circular-hole edges. After plane fitting, FAST-Calib extracts the hole-edge contours and recovers their centers, producing the corresponding points \(p_i^L\). The target design is central to the method’s geometry. Four hole centers define a compact set of correspondences per capture, while the ArUco markers provide a direct image-based route to the board pose. A plausible implication is that FAST-Calib reduces the calibration problem to repeated recovery of a small, fixed correspondence set rather than dependence on scene texture, environmental semantics, or LiDAR-specific scan topology [2507.17210]. ## 3. Pattern-agnostic LiDAR processing and ellipse-based hole recovery The LiDAR pipeline begins by merging \(N\) sequential scans into a dense point cloud. For very sparse mechanical LiDARs, a small “wobble” motion is used to aggregate additional beams. FAST-Calib then applies axis-aligned pass-through filters in \(X\), \(Y\), and \(Z\) to isolate the board region, fits the largest plane with RANSAC using a distance threshold of \(0.01\) m, and retains the inliers. Voxel-grid downsampling at \(8\) mm resolution reduces the point count, after which the dominant plane is rotated to coincide with \(z=0\) via its normal [2507.17210]. Edge extraction is performed in the aligned plane. FAST-Calib builds a 2D KD-tree of the aligned points and, for each point \(p_i=(x_i,y_i)\), finds all neighbors \(\{p_j\}\) within radius \(R_n\approx 0.03\) m. For each neighbor, it computes the polar angle $$ \theta_j=\operatorname{atan2}(y_j-y_i,\ x_j-x_i). $$ After sorting the angles in ascending order, the method forms circular angular gaps $$ \Delta\theta_k = \theta_{k+1}-\theta_k,\qquad k=1,\dots,N-1, $$ and $$ \Delta\theta_N = \theta_1+2\pi-\theta_N. $$ If \(\max_k \Delta\theta_k > \Delta\theta_{\text{thresh}}\) with \(\Delta\theta_{\text{thresh}}=25^\circ\), the point is classified as an edge point because it has a “wedge” in empty space. The paper states that this test depends only on local neighbor geometry and therefore works for any LiDAR scan pattern. The extracted edge points are clustered by Euclidean distance, with an example threshold of \(15\) mm, yielding up to four clusters per capture. Each cluster \(C_l=\{(x_j,y_j)\}\) is then fitted with a general conic $$ A x^2 + Bxy + C y^2 + D x + E y + F = 0 $$ via the direct least-squares method of Fitzgibbon et al. (1996), under the ellipse constraint \(B^2-4AC<0\). From the fitted parameters \(a=(A,B,\dots,F)\), the center is recovered as $$ x_c=\frac{2CD-BE}{B^2-4AC},\qquad y_c=\frac{2AE-BD}{B^2-4AC}. $$ Ellipse validity is checked by requiring \(|\text{semi-major}-r|<4\) cm and eccentricity \(e10\) cm errors on Avia. For the Ouster, the two methods are described as on-par, with FAST-Calib at \(2\)–\(3\) mm and Velo2Cam at \(2\)–\(3\) mm. The CPU-only runtime measurements on an Intel i7-10700K are as follows: | Sensor | LiDAR processing | Total | |---|---:|---:| | Avia | 0.633 s | 0.66 s | | Mid360 | 0.675 s | 0.69 s | | Ouster | 0.647 s | 0.68 s | The same evaluation reports camera processing times of \(0.031\) s for Avia, \(0.018\) s for Mid360, and \(0.028\) s for Ouster, while registration costs approximately \(2\ \mu\)s per capture and is described as negligible. The implementation guidance is specific. The recommended voxel size is \(8\) mm for general use, the target should be kept \(1\)–\(3\) m away for best edge resolution, and ambient lighting should permit clear ArUco detection. For sparse scanners, a gentle handheld pitch oscillation is recommended to ensure sufficient edge coverage. These operating conditions delimit the method’s practical envelope: the reported accuracy and timing are tied to a target-based acquisition procedure in which the board is visible to both modalities and LiDAR observations contain enough edge structure for valid ellipse fitting [2507.17210]. ## 6. Practical scope, assumptions, and common misconceptions FAST-Calib is explicitly a target-based automatic calibration pipeline. Its automation concerns correspondence extraction, registration, and runtime behavior after the target has been placed and the captures collected; it does not eliminate the need for a custom 3D target or for controlled views of that target [2507.17210]. A second common misconception is that support for different LiDAR types must rely on scan-pattern-specific logic. The paper states the opposite: FAST-Calib supports both multi-line mechanical and non-repetitive solid-state LiDARs without any change in parameters because its edge extraction relies purely on local neighbor geometry rather than scan “rings.” This is a central design claim, and the Avia and Mid360 experiments are used to substantiate it. A third point concerns what the method returns. FAST-Calib estimates the LiDAR–camera extrinsic \(T_{CL}\) through 3D point correspondences derived from the target geometry; it is not posed as an online self-calibration system that continually updates extrinsics during operation, nor as a targetless scene-structure method. The fact that the pipeline completes in under \(0.7\) s does not change this methodological scope. A plausible implication is that FAST-Calib is most naturally suited to fast setup, re-calibration, and validation cycles rather than continuous background adaptation [2507.17210]. ## 7. Related calibration methods and terminological ambiguity FAST-Calib occupies a distinct position within a broader calibration literature. FastCal, for example, is an online sensor-extrinsic self-calibration method that uses information-theoretic segment selection, observability-aware updates through a rank-revealing decomposition of the Fisher information matrix, and time-decay of segments. It is framed as loosely coupled self-calibration from independent sensor odometry streams and reports constant-time updates with average runtime \(1.5\) ms per key-frame on a single core [1902.10585]. That problem setting differs from FAST-Calib’s target-based LiDAR–camera correspondence construction. LiMo-Calib addresses a different extrinsic problem again: on-site calibration of the LiDAR–motor transformation for a quadruped robot-based panoramic 3D sensing system. It estimates only roll \(\phi\), pitch \(\psi\), and horizontal translations \(t_x,t_y\), uses point-to-plane residuals on planar features, applies normal homogenization for feature selection, and solves the resulting optimization in Ceres with a Huber loss [2502.12655]. In contrast, FAST-Calib calibrates a LiDAR with respect to a camera through a board target with circular holes and ArUco markers. The name “FAST-Calib” is also ambiguous outside robotics geometry. “Fast Calibrated Explanations” introduces FAST-Calib, also referred to in that paper as FCE, as a local, post-hoc explanation method for machine learning models that produces calibrated predictions and feature-wise importance weights with uncertainty intervals, using Venn-Abers for classification and Conformal Predictive Systems for regression [2410.21129]. That usage is unrelated to LiDAR–camera extrinsic estimation. Taken together, these papers indicate that FAST-Calib, in the strict robotics sense of [2507.17210], denotes a one-second, target-based LiDAR–camera extrinsic calibration pipeline built on pattern-agnostic edge extraction, ellipse-based hole-center recovery, and multi-scene SVD registration, rather than a targetless calibration method, an online self-calibrator, or an explainability framework. Source: https://www.emergentmind.com/topics/fast-calib