The features of measurement and process noise are directly related to the optimal performance of the cubature Kalman filter. The maneuvering target model’s high level of uncertainty and non-Gaussian mean noise are typical issues that the radar tracking system must deal with, making it impossible to obtain the appropriate estimation. How to strike a compromise between high robustness and estimation accuracy while designing filters has always been challenging. The H-infinity filter is a widely used robust algorithm. Based on the H-infinity cubature Kalman filter (HCKF), a novel adaptive robust cubature Kalman filter (ARCKF) is suggested in this paper. There are two adaptable components in the algorithm. First, an adaptive fading factor addresses the model uncertainty issue brought on by the target’s maneuvering turn. Second, an improved Sage–Husa estimation based on the Mahalanobis distance (MD) is suggested to estimate the measurement noise covariance matrix adaptively. The new approach significantly increases the robustness and estimation precision of the HCKF. According to the simulation results, the suggested algorithm is more effective than the conventional HCKF at handling system model errors and abnormal observations.

The maximum correntropy criterion (MCC), as an effective method for dealing with anomalous measurement noise, is widely applied in the design of filters. However, its performance largely depends on the proper setting of the kernel bandwidth, and currently, there is no efficient adaptive kernel adjustment mechanism. To deal with this issue, a new adaptive Cauchy-kernel maximum correntropy cubature Kalman filter (ACKMC-CKF) is proposed. This algorithm constructs adaptive factors for each dimension of the measurement system and establishes an entropy matrix with adaptive kernel sizes, enabling targeted handling of specific anomalies. Through simulation experiments in target tracking, the performance of the proposed algorithm was comprehensively validated. The results show that the ACKMC-CKF, through its flexible kernel adaptive mechanism, can effectively handle various types of anomalies. Not only does the algorithm demonstrate excellent reliability, but it also has low sensitivity to parameter settings, making it more broadly applicable in a variety of practical application scenarios.

During imaging, each infrared focal plane linear array scan detector detection unit determines a row of pixels in the image output. This sensor’s nonuniformity appears as horizontal stripes. Correcting nonuniformity in high-resolution images without destroying delicate details is challenging. In this paper, a single-frame-based nonuniformity correction algorithm is proposed. A portion of a single-frame picture is intercepted initially. The 1D column guided filter is applied to smooth the captured image in the vertical direction. Then, the smooth image and high-frequency component with horizontal stripes and texture information are obtained. The subsequent step is to use the smooth portion of the image as the guided image and the high-frequency portion of the image as the input, so that the estimated nonuniformity noise of the image may be extracted using a 1D row guided filter. The segment of the corrected image is then obtained by subtracting the estimated nonuniformity noise from the segment of the raw image. The correction coefficients could be obtained by performing a linear regression fit on the pre- and post-guided filtering image segments. With the correction coefficients, the entire image could be corrected. Based on qualitative and quantitative analysis, the proposed algorithm outperforms other current advanced algorithms in terms of nonuniformity correction and real-time performance.

Traditional JPEG series image compression algorithms have limitations in speed. To improve the storage and transmission of 14-bit/pixel images acquired by infrared line-scan detectors, a novel method is introduced for achieving high-speed and highly efficient compression of line-scan infrared images. The proposed method utilizes the features of infrared images to reduce image redundancy and employs improved Huffman coding for entropy coding. The improved Huffman coding addresses the low-probability long coding of 14-bit images by truncating long codes, which results in low complexity and minimal loss in the compression ratio. Additionally, a method is proposed to obtain a Huffman code table that bypasses the pixel counting process required for entropy coding, thereby improving the compression speed. The final implementation is a low-complexity lossless image compression algorithm that achieves fast encoding through simple table lookup rules. The proposed method results in only a 10% loss in compression performance compared to JPEG 2000, while achieving a 20-fold speed improvement. Compared to dictionary-based methods, the proposed method can achieve high-speed compression while maintaining high compression efficiency, making it particularly suitable for the high-speed, high-efficiency lossless compression of line-scan panoramic infrared images. The code table compression effect is 5% lower than the theoretical value. The algorithm can also be applied to analyze images with more bits.

Multi-Object Tracking (MOT) remains a fundamental challenge in computer vision, with significant applications in autonomous systems, surveillance, and intelligent transportation. The Tracking-By-Detection (TBD) paradigm has achieved notable tracking accuracy; however, its performance is highly sensitive to low-confidence detections (e.g., partial occlusions or blurred objects). Existing methods, such as ByteTrack, utilize a dual-threshold strategy for the filtering of detections, but determining the optimal high-confidence threshold is computationally expensive and lacks robustness across different scenarios. In this study, we analyze the sensitivity of state-of-the-art (SOTA) TBD-based trackers to variations in the high-confidence threshold and introduce SolidTrack, an enhanced tracking algorithm integrating SOLIDER-ReID, a transformer-based re-identification model. Our approach mitigates the impact of threshold variations by improving feature extraction, particularly under challenging conditions such as low-confidence detections and occlusions. Experimental evaluations demonstrate that SolidTrack exhibits superior robustness across varying threshold settings. Additionally, SolidTrack achieves SOTA performance on the test sets of the MOT17 and MOT20 benchmarks, achieving an MOTA of 80.6, IDF1 of 80.0, and HOTA of 65.0 on MOT17 and an MOTA of 77.9, IDF1 of 77.5, and HOTA of 63.4 on MOT20.

Gain and bias non-uniformities in infrared line-scanning detectors often result in horizontal streak noise, degrading image quality. This paper introduces a novel non-uniformity correction algorithm combining residual guidance and adaptive weighting, which achieves superior denoising and detail preservation compared to existing methods. The method combines residual and original images in a dual-guidance mechanism and significantly enhances denoising performance and detail preservation through iterative compensation strategies and locally weighted linear regression. Additionally, the algorithm employs local variance to adjust weights dynamically, achieving efficient correction in complex scenes while reducing computational complexity to meet real-time application requirements. Experimental results on both simulated and real infrared datasets demonstrate that the proposed method outperforms mainstream algorithms regarding peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) metrics, achieving an optimal balance between detail preservation and noise suppression. The algorithm demonstrates robust performance in complex scenes, making it suitable for real-time applications in high-resolution infrared imaging systems.