Expedited Multi-Target Search with Guaranteed Performance via Multi-fidelity Gaussian Processes

• URL: http://arxiv.org/abs/2005.08434v1
• Date: Mon, 18 May 2020 02:53:52 GMT
• Title: Expedited Multi-Target Search with Guaranteed Performance via Multi-fidelity Gaussian Processes
• Authors: Lai Wei, Xiaobo Tan, and Vaibhav Srivastava
• Abstract summary: We consider a scenario in which an autonomous vehicle operates in a 3D environment and is tasked with searching for an unknown number of stationary targets on the 2D floor of the environment. We model the sensing field using a multi-fidelity Gaussian process that systematically describes the sensing information available at different altitudes from the floor. Based on the sensing model, we design a novel algorithm called Multi-Target Search (EMTS) that addresses the coverage-accuracy trade-off.
• Score: 9.434133337939496
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider a scenario in which an autonomous vehicle equipped with a downward facing camera operates in a 3D environment and is tasked with searching for an unknown number of stationary targets on the 2D floor of the environment. The key challenge is to minimize the search time while ensuring a high detection accuracy. We model the sensing field using a multi-fidelity Gaussian process that systematically describes the sensing information available at different altitudes from the floor. Based on the sensing model, we design a novel algorithm called Expedited Multi-Target Search (EMTS) that (i) addresses the coverage-accuracy trade-off: sampling at locations farther from the floor provides wider field of view but less accurate measurements, (ii) computes an occupancy map of the floor within a prescribed accuracy and quickly eliminates unoccupied regions from the search space, and (iii) travels efficiently to collect the required samples for target detection. We rigorously analyze the algorithm and establish formal guarantees on the target detection accuracy and the expected detection time. We illustrate the algorithm using a simulated multi-target search scenario.

Related papers

• MVSDet: Multi-View Indoor 3D Object Detection via Efficient Plane Sweeps [51.44887282336391]
  Key challenge of multi-view indoor 3D object detection is to infer accurate geometry information from images for precise 3D detection. Previous method relies on NeRF for geometry reasoning. We propose MVSDet which utilizes plane sweep for geometry-aware 3D object detection.
  arXiv  Detail & Related papers  (2024-10-28T21:58:41Z)
• KECOR: Kernel Coding Rate Maximization for Active 3D Object Detection [48.66703222700795]
  We resort to a novel kernel strategy to identify the most informative point clouds to acquire labels. To accommodate both one-stage (i.e., SECOND) and two-stage detectors, we incorporate the classification entropy tangent and well trade-off between detection performance and the total number of bounding boxes selected for annotation. Our results show that approximately 44% box-level annotation costs and 26% computational time are reduced compared to the state-of-the-art method.
  arXiv  Detail & Related papers  (2023-07-16T04:27:03Z)
• ICET Online Accuracy Characterization for Geometry-Based Laser Scan Matching [0.0]
  Iterative Closest Ellipsoidal Transform (ICET) is a novel 3D LIDAR scan-matching algorithm. We show that ICET consistently performs scan matching with sub-centimeter accuracy. This level of accuracy, combined with the fact that the algorithm is fully interpretable, make it well suited for safety-critical transportation applications.
  arXiv  Detail & Related papers  (2023-06-14T18:21:45Z)
• Multi-Agent Active Search using Detection and Location Uncertainty [6.587280549237275]
  Active search algorithms must contend with two types of uncertainty: detection uncertainty and location uncertainty. We first propose an inference method to jointly handle both target detection and location uncertainty. We then build a decision making algorithm that uses Thompson sampling to enable decentralized multi-agent active search.
  arXiv  Detail & Related papers  (2022-03-09T04:53:37Z)
• A Fast Location Algorithm for Very Sparse Point Clouds Based on Object Detection [0.0]
  We propose an algorithm which can quickly locate the target object through image object detection in the circumstances of having very sparse feature points. We conduct the experiment in a manually designed scene by holding a smartphone and the results represent high positioning speed and accuracy of our method.
  arXiv  Detail & Related papers  (2021-10-21T05:17:48Z)
• Sample and Computation Redistribution for Efficient Face Detection [137.19388513633484]
  Training data sampling and computation distribution strategies are the keys to efficient and accurate face detection. scrfdf34 outperforms the best competitor, TinaFace, by $3.86%$ (AP at hard set) while being more than emph3$times$ faster on GPUs with VGA-resolution images.
  arXiv  Detail & Related papers  (2021-05-10T23:51:14Z)
• Soft Expectation and Deep Maximization for Image Feature Detection [68.8204255655161]
  We propose SEDM, an iterative semi-supervised learning process that flips the question and first looks for repeatable 3D points, then trains a detector to localize them in image space. Our results show that this new model trained using SEDM is able to better localize the underlying 3D points in a scene.
  arXiv  Detail & Related papers  (2021-04-21T00:35:32Z)
• PLUME: Efficient 3D Object Detection from Stereo Images [95.31278688164646]
  Existing methods tackle the problem in two steps: first depth estimation is performed, a pseudo LiDAR point cloud representation is computed from the depth estimates, and then object detection is performed in 3D space. We propose a model that unifies these two tasks in the same metric space. Our approach achieves state-of-the-art performance on the challenging KITTI benchmark, with significantly reduced inference time compared with existing methods.
  arXiv  Detail & Related papers  (2021-01-17T05:11:38Z)
• AutoOD: Automated Outlier Detection via Curiosity-guided Search and Self-imitation Learning [72.99415402575886]
  Outlier detection is an important data mining task with numerous practical applications. We propose AutoOD, an automated outlier detection framework, which aims to search for an optimal neural network model. Experimental results on various real-world benchmark datasets demonstrate that the deep model identified by AutoOD achieves the best performance.
  arXiv  Detail & Related papers  (2020-06-19T18:57:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.