Dense Clutter Research Articles

Improving Non-Line-of-Sight Identification in Cellular Positioning Systems Using a Deep Autoencoding and Generative Adversarial Network Model

Positioning service is a critical technology that bridges the physical world with digital information, significantly enhancing efficiency and convenience in life and work. The evolution of 5G technology has proven that positioning services are integral components of current and future cellular networks. However, positioning accuracy is hindered by non-line-of-sight (NLoS) propagation, which severely affects the measurements of angles and delays. In this study, we introduced a deep autoencoding channel transform-generative adversarial network model that utilizes line-of-sight (LoS) samples as a singular category training set to fully extract the latent features of LoS, ultimately employing a discriminator as an NLoS identifier. We validated the proposed model in 5G indoor and indoor factory (dense clutter, low base station) scenarios by assessing its generalization capability across different scenarios. The results indicate that, compared to the state-of-the-art method, the proposed model markedly diminished the utilization of device resources and achieved a 2.15% higher area under the curve while reducing computing time by 12.6%. This approach holds promise for deployment in future positioning terminals to achieve superior localization precision, catering to commercial and industrial Internet of Things applications.

Detection Based on Semantics and a Detail Infusion Feature Pyramid Network and a Coordinate Adaptive Spatial Feature Fusion Mechanism Remote Sensing Small Object Detector

In response to the challenges of remote sensing imagery, such as unmanned aerial vehicle (UAV) aerial imagery, including differences in target dimensions, the dominance of small targets, and dense clutter and occlusion in complex environments, this paper optimizes the YOLOv8n model and proposes an innovative small-object-detection model called DDSC-YOLO. First, a DualC2f structure is introduced to improve the feature-extraction capabilities of the model. This structure uses dual-convolutions and group convolution techniques to effectively address the issues of cross-channel communication and preserving information in the original input feature mappings. Next, a new attention mechanism, DCNv3LKA, was developed. This mechanism uses adaptive and fine-grained information-extraction methods to simulate receptive fields similar to self-attention, allowing adaptation to a wide range of target size variations. To address the problem of false and missed detection of small targets in aerial photography, we designed a Semantics and Detail Infusion Feature Pyramid Network (SDI-FPN) and added a dedicated detection scale specifically for small targets, effectively mitigating the loss of contextual information in the model. In addition, the coordinate adaptive spatial feature fusion (CASFF) mechanism is used to optimize the original detection head, effectively overcoming multi-scale information conflicts while significantly improving small target localization accuracy and long-range dependency perception. Testing on the VisDrone2019 dataset shows that the DDSC-YOLO model improves the mAP0.5 by 9.3% over YOLOv8n, and its performance on the SSDD and RSOD datasets also confirms its superior generalization capabilities. These results confirm the effectiveness and significant progress of our novel approach to small target detection.

Improved Gaussian processes linear JPDA filter for multiple extended targets tracking in dense clutter

To track multiple extended targets in dense clutter, an improved Gaussian processes linear joint probabilistic data association (IGP-LJPDA) method is proposed. This method consists of two stages. In the first stage, measurements are associated with targets, and pseudo-measurements are constructed. By integrating linear JPDA with Gaussian processes, probabilities for each measurement's assignment to each target are determined. Following this, a novel pseudo-measurement model is devised by combining the marginal probability of each target with measurements belonging to their respective basic point neighborhood, enabling more efficient state updates. In the second stage, pseudo-measurements are associated with the contour, and states of extended targets are updated accordingly. By associating pseudo-measurements with Gaussian processes basic points of each target, the algorithm achieves globally optimal association. The proposed algorithm demonstrates a notable improvement in Intersection over Union (IOU) metrics in environments with significantly higher clutter rates compared to existing methods.

ITS Efficiency Analysis for Multi-Target Tracking in a Clutter Environment

The Integrated Track Splitting (ITS) is a multi-scan algorithm for target tracking in a cluttered environment. The ITS filter models each track as a set of mutually exclusive components, usually in the form of a Gaussian Mixture. The purpose of this research is to determine the limits of the ‘endurance’ of target tracking of the known ITS algorithm by analyzing the impact of target detection probability. The state estimate and the a-posteriori probability of component existence are computed recursively from the target existence probability, which may be used as a track quality measure for false track discrimination (FTD). The target existence probability is also calculated and used for track maintenance and track output. This article investigates the limits of the effectiveness of ITS multi-target tracking using the method of theoretical determination of the dependence of the measurements likelihood ratio on reliable detection and then practical experimental testing. Numerical simulations of the practical application of the proposed model were performed in various probabilities of target detection and dense clutter environments. Additionally, the effectiveness of the proposed algorithm in combination with filters for various types of maneuvers using Interacting Multiple Model ITS (IMMITS) algorithms was comparatively analyzed. The extensive numerical simulation (which assumes both straight and maneuvering targets) has shown which target tracking limits can be performed within different target detection probabilities and clutter densities. The simulations confirmed the derived theoretical limits of the tracking efficiency of the ITS algorithm up to a detection probability of 0.6, and compared to the IMMITS algorithm up to 0.4 in the case of target maneuvers and dense clutter environments.

Intersecting and dense restrictions of clutters in polynomial time

A clutter is a family of sets, called members, such that no member contains another. It is called intersecting if every two members intersect, but not all members have a common element. Dense clutters additionally do not have a fractional packing of value 2. We are looking at certain substructures of clutters, namely minors and restrictions. For a family of clutters we introduce a general sufficient condition such that for every clutter we can decide whether the clutter has a restriction in that set in polynomial time. It is known that the sets of intersecting and dense clutters satisfy this condition. For intersecting clutters we generalize the statement to k-wise intersecting clutters using a much simpler proof. We also give a simplified proof that a dense clutter with no proper dense minor is either a delta or the blocker of an extended odd hole. This simplification reduces the running time of the algorithm for finding a delta or the blocker of an extended odd hole minor from previously O(n4)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathscr {O}}(n^4)$$\\end{document} to O(n3)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathscr {O}}(n^3)$$\\end{document} filter oracle calls.

A closed-loop bin picking system for entangled wire harnesses using bimanual and dynamic manipulation

This paper addresses the challenge of industrial bin picking using entangled wire harnesses. Wire harnesses are essential in manufacturing but pose challenges in automation due to their complex geometries and propensity for entanglement. Our previous work tackled this issue by proposing a quasi-static pulling motion to separate the entangled wire harnesses. However, it still lacks sufficiency and generalization to various shapes and structures. In this paper, we deploy a dual-arm robot that can grasp, extract and disentangle wire harnesses from dense clutter using dynamic manipulation. The robot can swing to dynamically discard the entangled objects and regrasp to adjust the undesirable grasp pose. To improve the robustness and accuracy of the system, we leverage a closed-loop framework that uses haptic feedback to detect entanglement in real-time and flexibly adjust system parameters. Our bin picking system achieves an overall success rate of 91.2% in the real-world experiments using two different types of long wire harnesses. It demonstrates the effectiveness of our system in handling various wire harnesses for industrial bin picking. Supplementary videos and illustrations can be found at https://xinyiz0931.github.io/dynamic.

Detection of a target hidden in dense cloud clutter using an echo pattern of pulsed laser radar systems

The performance of pulsed laser radar systems has been known to be drastically reduced in dense clutter media, detecting false signals instead of the target. Therefore, high-performance laser radars have become demanding for detection applications. Here, using a multi-scattering Monte Carlo simulation, the pulsed laser radar performance is studied in dense cloud clutter (DCC), involving the role of the clutter extinction coefficient in the cloud return signal waveform of the target. After generating a large number of return signals from the clutter and the target, a unique and prominent feature is found to efficiently distinguish the two signals from each other with a resolution of 0.80 and a minimum signal to clutter ratio of 5.04 dB. A high-pass trapezoidal filter is also designed based on the characteristic feature in order to eliminate the clutter return signal. This proposed filtering method is justified by applying Fourier transform to the return power from the target and cloud, eliminating the clutter frequency response in a low frequency region. Accordingly, it is possible to detect a target hidden in DCC at short distances through receiving an echo pulse pattern.

Measurement based dimension descent association algorithm for OTHR multi-detection multi-target tracking

The problem of multi-detection multi-target tracking (MDMTT) using over-the-horizon radar in dense clutter environment is studied in this paper. The biggest challenge of MDMTT is the 3-dimensional multipath data association among measurements, detection models and targets. In particular, a lot of clutter measurements are generated in dense clutter environment, which increase the computational burden of 3-dimensional multipath data association greatly. A measurement based dimension descent association (DDA) algorithm is proposed to solve the 3-dimensional multipath data association, which decomposes the 3-dimensional multipath data association into two 2-dimensional data associations. The proposed algorithm can reduce the computational burden compared with the optimal 3-dimensional multipath data association and the computational complexity is analyzed. Besides, a time extension method is designed to detect the new-born targets that appear in the tracking scene, which is based on the sequential measurements. The convergence of the proposed measurement based DDA algorithm is analyzed. The estimation error can convergence to 0 as the number of Gaussian mixtures tends to infinity. The effectiveness and rapidity of the measurement based DDA algorithm are demonstrated by the comparative simulation with the previously proposed algorithms.

A Sector-Matching Probability Hypothesis Density Filter for Radar Multiple Target Tracking

The development of high-tech, dim, small targets, such as drones and cruise missiles, brings great challenges to radar multi-target tracking (MTT), making it necessary to extend the beam dwell time to obtain a high signal-to-noise ratio (SNR). In order to solve the problem of radar sampling time variation exacerbated by extending the beam dwell time when detecting weak targets, a sector-matching (SM) PHD filter is proposed, which combines the actual radar system with a PHD filter and quantifies the relationship between the beam dwell time, the false alarm rate and the detection probability. The proposed filter divides the scanning area into small sectors to obtain actual multi-target measurement times and rederives the prediction and update steps based on the actual sampling time. Furthermore, a state correction step is added before state extraction. Applying the SM structure to the basic Gaussian mixture PHD (GM-PHD) filter and labeled GM-PHD filter, the simulation results demonstrate that the proposed structure can improve the accuracy of multi-weak-target state estimation in the dense clutter and can continuously generate explicit trajectories. The overall real-time performance of the proposed filter is similar to that of the PHD filter.

Learning to Track Multiple Radar Targets with Long Short-Term Memory Networks

Radar multitarget tracking in a dense clutter environment remains a complex problem to be solved. Most existing solutions still rely on complex motion models and prior distribution knowledge. In this paper, a new online tracking method based on a long short-term memory (LSTM) network is proposed. It combines state prediction, measurement association, and trajectory management functions in an end-to-end manner. We employ LSTM networks to model target motion and trajectory associations, relying on their strong learning ability to learn target motion properties and long-term dependence of trajectory associations from noisy data. Moreover, to address the problem of missing appearance information of radar targets, we propose an architecture based on the LSTM network to calculate similarity function by extracting long-term motion features. And the similarity is applied to trajectory associations to improve their robustness. Our proposed method is validated in simulation scenarios and achieves good results.

Radar Target Localization with Multipath Exploitation in Dense Clutter Environments

The performance of classic radar geometry based on the line-of-sight (LOS) signal transmitted from radar to the target in the free space is affected by multipath echoes in urban areas, where non-line-of-sight (NLOS) signals reflected by obstacles are received by the radar. Based on prior information of the urban situation, this article proposes a novel two-stage localization algorithm with multipath exploitation in a dense clutter environment. In the offline stage, multipath propagation parameters of uniformly distributed samples in the radar field of view are predicted by the ray-tracing technique. In the online stage, a rough location of the target is estimated by the maximum similarity between measurements and the predicted parameters of reference samples at different locations. The similarity is described by the likelihood between measurements and the predicted multipath parameters with respect to all possible associated hypotheses. A gating threshold is derived to exclude less likely hypotheses and reduce the computational burden. The accurate target location is acquired by a non-linear least squares (NLS) optimization of the associated multipath components. Simulation results in various noise conditions show that the proposed method provides robust and accurate target localization results under dense clutter conditions, and the offline pre-calculation of ray-tracing ensures the real-time performance of the proposed localization algorithm. The root mean square error (RMSE) of simulation results shows the advantage of the proposed method over the existing method. The presented results suggest that the proposed method can be applied to NLOS target localization applications in complex environments.

An Improved IMM-GPDA Tracking Algorithm

To improve the accuracy and efficiency of multi-maneuvering target tracking in dense clutter environments, an improved interactive multi-model generalized probabilistic data association (IMM-GPDA) algorithm is proposed in this paper. The algorithm introduces Doppler information into the measurement data. Firstly, the measurement data is pre-processed by double-threshold regional density clutter elimination, and then the pre-processed data is put into the improved IMM-GPDA algorithm with square-root cubature Kalman filter (SRCKF) and model transition probability adaptation for interaction, association, and filtering. Simulation results show that the algorithm has advanced accuracy, instantaneity, and robustness in tracking environments with multi-maneuvering targets and dense clutters.

Learning Efficient Policies for Picking Entangled Wire Harnesses: An Approach to Industrial Bin Picking

Wire harnesses are essential connecting components in manufacturing industry but are challenging to be automated in industrial tasks such as bin picking. They are long, flexible and tend to get entangled when randomly placed in a bin. This makes it difficult for the robot to grasp a single one in dense clutter. Besides, training or collecting data in simulation is challenging due to the difficulties in modeling the combination of deformable and rigid components for wire harnesses. In this work, instead of directly lifting wire harnesses, we propose to grasp and extract the target following a circle-like trajectory until it is untangled. We learn a policy from real-world data that can infer grasps and separation actions from visual observation. Our policy enables the robot to efficiently pick and separate entangled wire harnesses by maximizing success rates and reducing execution time. To evaluate our policy, we present a set of real-world experiments on picking wire harnesses. Our policy achieves an overall 84.6% success rate compared with 49.2% in baseline. We also evaluate the effectiveness of our policy under different clutter scenarios using unseen types of wire harnesses. Results suggest that our approach is feasible for handling wire harnesses in industrial bin picking.

Plot Quality Aided Plot-to-Track Association in Dense Clutter for Compact High-Frequency Surface Wave Radar

Due to high false alarm rate and low positioning accuracy of compact high-frequency surface wave radar in moving vessel detection, false plot-to-track association often occurs during moving vessel tracking, thus leading to track fragmentation and false tracking. In order to address this problem, a plot quality evaluation method is proposed and applied to plot-to-track association. Firstly, the differences in spatial correlation of echo spectrum amplitudes and position among moving vessels, clutters, and noise on a range-Doppler map are analyzed, and a plot quality index integrating multi-directional gradient, local variance, and plot position probability is developed. Then, the plots labeled as low quality are removed to reduce both the negative impact of false alarms on plot-to-track association and the computational burden. Eventually, both plot quality index and kinematic parameters are used to calculate the association cost and determine the plot-track pairs during the plot-to-track association procedure. Experimental results with field data demonstrate that the proposed plot quality index can effectively distinguish moving vessel and other plots. Compared with both the nearest neighbor data association method and the joint probability data association method, the association accuracy of the proposed method is greatly improved and, thus, the tracking continuity is enhanced in dense clutter scenarios.

Review of Learning-Based Robotic Manipulation in Cluttered Environments.

Robotic manipulation refers to how robots intelligently interact with the objects in their surroundings, such as grasping and carrying an object from one place to another. Dexterous manipulating skills enable robots to assist humans in accomplishing various tasks that might be too dangerous or difficult to do. This requires robots to intelligently plan and control the actions of their hands and arms. Object manipulation is a vital skill in several robotic tasks. However, it poses a challenge to robotics. The motivation behind this review paper is to review and analyze the most relevant studies on learning-based object manipulation in clutter. Unlike other reviews, this review paper provides valuable insights into the manipulation of objects using deep reinforcement learning (deep RL) in dense clutter. Various studies are examined by surveying existing literature and investigating various aspects, namely, the intended applications, the techniques applied, the challenges faced by researchers, and the recommendations adopted to overcome these obstacles. In this review, we divide deep RL-based robotic manipulation tasks in cluttered environments into three categories, namely, object removal, assembly and rearrangement, and object retrieval and singulation tasks. We then discuss the challenges and potential prospects of object manipulation in clutter. The findings of this review are intended to assist in establishing important guidelines and directions for academics and researchers in the future.

Learning Push-Grasping in Dense Clutter

Robotic grasping in highly cluttered environments remains a challenging task due to the lack of collision free grasp affordances. In such conditions, non-prehensile actions could help to increase such affordances. We propose a multi-fingered push-grasping policy that creates enough space for the fingers to wrap around an object to perform a stable power grasp, using a single primitive action. Our approach learns a direct mapping from visual observations to actions and is trained in a fully end-to-end manner. To achieve a more efficient learning, we decouple the action space by learning separately the robot hand pose and finger configuration. Experiments in simulation demonstrate that the proposed push-grasping policy achieves higher grasp success rate over baselines and it can generalize to unseen objects. Furthermore, although training is performed in simulation, the learned policy is robustly transferred to a real environment without a significant drop in success rate.

An Improved Kalman Filter Based on Long Short-Memory Recurrent Neural Network for Nonlinear Radar Target Tracking

The target tracking of nonlinear maneuvering radar in dense clutter environments is still an important but difficult problem to be solved effectively. Traditional solutions often rely on motion models and prior distributions. This paper presents a novel improved architecture of Kalman filter based on a recursive neural network, which combines the sequence learning of recurrent neural networks with the precise prediction of Kalman filter in an end-to-end manner. We employ three LSTM networks to model nonlinear motion equation, motion noise, and measurement noise, respectively, and learn their long-term dependence from a large amount of training data. They are then applied to the prediction and update process of Kalman filter to calculate the estimated target state. Our approach is able to address the tracking problem of nonlinear maneuvering radar target online end-to-end and does not require the motion models and prior distributions. Experimental results show that our method is more effective and faster than the traditional methods and more accurate than the method with LSTM network alone.

Multi-Feature Matching GM-PHD Filter for Radar Multi-Target Tracking.

Multi-target tracking (MTT) is one of the most important functions of radar systems. Traditional multi-target tracking methods based on data association convert multi-target tracking problems into single-target tracking problems. When the number of targets is large, the amount of computation increases exponentially. The Gaussian mixture probability hypothesis density (GM-PHD) filtering based on a random finite set (RFS) provides an effective method to solve multi-target tracking problems without the requirement of explicit data association. However, it is difficult to track targets accurately in real-time with dense clutter and low detection probability. To solve this problem, this paper proposes a multi-feature matching GM-PHD (MFGM-PHD) filter for radar multi-target tracking. Using Doppler and amplitude information contained in radar echo to modify the weights of Gaussian components, the weight of the clutter can be greatly reduced and the target can be distinguished from clutter. Simulations show that the proposed MFGM-PHD filter can improve the accuracy of multi-target tracking as well as the real-time performance with high clutter density and low detection probability.

Picking out the Impurities: Attention-based Push-Grasping in Dense Clutter

Abstract“Picking out the impurities” is a typical scenario in production line which is both time consuming and laborious. In this article, we propose a target-oriented robotic push-grasping system which is able to actively discover and pick the impurities in dense environments with the synergies between pushing and grasping actions. First, we propose an attention module, which includes target saliency detection and density-based occluded-region inference. Without the necessity of expensive labeling of semantic segmentation, our attention module can quickly locate the targets in the view or predict the candidate regions where the targets are most likely to be occluded. Second, we propose a push–grasp synergy framework to sequentially select proper actions in different situations until all targets are picked out. Moreover, we introduce an active pushing mechanism based on a novel metric, namely Target-Centric Dispersion Degree (TCDD) for better grasping. TCDD describes whether the targets are isolated from the surrounding objects. With this metric, the robot becomes more focused on the actions around the targets and push irrelevant objects away. Experimental results on both simulated environment and real-world environment show that our proposed system outperforms several baseline approaches,which also has the capability to be generalized to new scenarios.

Visual Foresight Trees for Object Retrieval From Clutter With Nonprehensile Rearrangement

This paper considers the problem of retrieving an object from many tightly packed objects using a combination of robotic pushing and grasping actions. Object retrieval in dense clutter is an important skill for robots to operate in households and everyday environments effectively. The proposed solution, Visual Foresight Trees (VFT), intelligently rearranges the clutter surrounding a target object so that it can be grasped easily. Rearrangement with nested nonprehensile actions is challenging as it requires predicting complex object interactions in a combinatorially large configuration space of multiple objects. We first show that a deep neural network can be trained to accurately predict the poses of the packed objects when the robot pushes one of them. The predictive network provides visual foresight and is used in a tree search as a state transition function in the space of scene images. The tree search returns a sequence of consecutive push actions yielding the best arrangement of the clutter for grasping the target object. Experiments in simulation and using a real robot and objects show that the proposed approach outperforms model-free techniques as well as model-based myopic methods both in terms of success rates and the number of executed actions, on several challenging tasks. A video introducing VFT, with robot experiments, is accessible at https://youtu.be/7cL-hmgvyec. The full source code is available at https://github.com/arc-l/vft.