Quantum-soft QUBO Suppression for Accurate Object Detection

• URL: http://arxiv.org/abs/2007.13992v1
• Date: Tue, 28 Jul 2020 05:12:51 GMT
• Title: Quantum-soft QUBO Suppression for Accurate Object Detection
• Authors: Junde Li, Swaroop Ghosh
• Abstract summary: Non-maximum suppression (NMS) has been adopted by default for removing redundant object detections for decades. We propose Quantum-soft QUBO Suppression (QSQS) algorithm for fast and accurate detection by exploiting quantum computing advantages.
• Score: 8.871042314510788
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-maximum suppression (NMS) has been adopted by default for removing redundant object detections for decades. It eliminates false positives by only keeping the image M with highest detection score and images whose overlap ratio with M is less than a predefined threshold. However, this greedy algorithm may not work well for object detection under occlusion scenario where true positives with lower detection scores are possibly suppressed. In this paper, we first map the task of removing redundant detections into Quadratic Unconstrained Binary Optimization (QUBO) framework that consists of detection score from each bounding box and overlap ratio between pair of bounding boxes. Next, we solve the QUBO problem using the proposed Quantum-soft QUBO Suppression (QSQS) algorithm for fast and accurate detection by exploiting quantum computing advantages. Experiments indicate that QSQS improves mean average precision from 74.20% to 75.11% for PASCAL VOC 2007. It consistently outperforms NMS and soft-NMS for Reasonable subset of benchmark pedestrian detection CityPersons.

Related papers

• TSBP: Improving Object Detection in Histology Images via Test-time Self-guided Bounding-box Propagation [14.771640666631557]
  A global threshold (e.g., 0.5) is often applied to determine which bounding boxes should be included in the final results for an object detection task. A lower threshold can increase detection recall but may also result in more false positives. Because of this, using a preset global threshold (e.g., 0.5) applied to all the bounding box candidates may lead to suboptimal solutions.
  arXiv  Detail & Related papers  (2024-09-25T07:09:04Z)
• Value-Driven Mixed-Precision Quantization for Patch-Based Inference on Microcontrollers [35.666772630923234]
  QuantMCU is a novel patch-based inference method that utilizes value-driven mixed-precision quantization to reduce redundant computation. We show that QuantMCU can reduce computation by 2.2x on average while maintaining comparable model accuracy.
  arXiv  Detail & Related papers  (2024-01-24T04:21:41Z)
• Detection Selection Algorithm: A Likelihood based Optimization Method to Perform Post Processing for Object Detection [1.7188280334580197]
  In object detection, post-processing methods like Non-maximum Suppression (NMS) are widely used. In order to find the exact number of objects and their labels in the image, we propose a post processing method called Detection Selection Algorithm (DSA) DSA greedily selects a subset of detected bounding boxes, together with full object reconstructions that give the interpretation of the whole image with highest likelihood.
  arXiv  Detail & Related papers  (2022-12-12T05:15:18Z)
• Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination [80.53485617514707]
  This paper proposes two algorithms, a gap-based algorithm and one based on the successive elimination, for best arm identification in sub-Gaussian bandits. Specifically, for the gap-based algorithm, the sample complexity is optimal up to constant factors, while for the successive elimination, it is optimal up to logarithmic factors.
  arXiv  Detail & Related papers  (2021-11-14T21:49:58Z)
• Object Detection Made Simpler by Eliminating Heuristic NMS [70.93004137521946]
  We show a simple NMS-free, end-to-end object detection framework. We attain on par or even improved detection accuracy compared with the original one-stage detector.
  arXiv  Detail & Related papers  (2021-01-28T02:38:29Z)
• Adaptive Sampling for Best Policy Identification in Markov Decision Processes [79.4957965474334]
  We investigate the problem of best-policy identification in discounted Markov Decision (MDPs) when the learner has access to a generative model. The advantages of state-of-the-art algorithms are discussed and illustrated.
  arXiv  Detail & Related papers  (2020-09-28T15:22:24Z)
• SADet: Learning An Efficient and Accurate Pedestrian Detector [68.66857832440897]
  This paper proposes a series of systematic optimization strategies for the detection pipeline of one-stage detector. It forms a single shot anchor-based detector (SADet) for efficient and accurate pedestrian detection. Though structurally simple, it presents state-of-the-art result and real-time speed of $20$ FPS for VGA-resolution images.
  arXiv  Detail & Related papers  (2020-07-26T12:32:38Z)
• Optimally Displaced Threshold Detection for Discriminating Binary Coherent States Using Imperfect Devices [50.09039506170243]
  We analytically study the performance of the generalized Kennedy receiver having optimally displaced threshold detection (ODTD) in a realistic situation with noises and imperfect devices. We show that the proposed greedy search algorithm can obtain a lower and smoother error probability than the existing works.
  arXiv  Detail & Related papers  (2020-07-21T21:52:29Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

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.