Class agnostic moving target detection by color and location prediction of moving area

• URL: http://arxiv.org/abs/2106.12966v1
• Date: Thu, 24 Jun 2021 12:34:58 GMT
• Title: Class agnostic moving target detection by color and location prediction of moving area
• Authors: Zhuang He, Qi Li, Huajun Feng, Zhihai Xu
• Abstract summary: Moving target detection plays an important role in computer vision. Recent algorithms such as deep learning-based convolutional neural networks have achieved high accuracy and real-time performance. We propose a model free moving target detection algorithm.
• Score: 11.326363150470204
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Moving target detection plays an important role in computer vision. However, traditional algorithms such as frame difference and optical flow usually suffer from low accuracy or heavy computation. Recent algorithms such as deep learning-based convolutional neural networks have achieved high accuracy and real-time performance, but they usually need to know the classes of targets in advance, which limits the practical applications. Therefore, we proposed a model free moving target detection algorithm. This algorithm extracts the moving area through the difference of image features. Then, the color and location probability map of the moving area will be calculated through maximum a posteriori probability. And the target probability map can be obtained through the dot multiply between the two maps. Finally, the optimal moving target area can be solved by stochastic gradient descent on the target probability map. Results show that the proposed algorithm achieves the highest accuracy compared with state-of-the-art algorithms, without needing to know the classes of targets. Furthermore, as the existing datasets are not suitable for moving target detection, we proposed a method for producing evaluation dataset. Besides, we also proved the proposed algorithm can be used to assist target tracking.

Related papers

• SpirDet: Towards Efficient, Accurate and Lightweight Infrared Small Target Detector [60.42293239557962]
  We propose SpirDet, a novel approach for efficient detection of infrared small targets. We employ a new dual-branch sparse decoder to restore the feature map. Extensive experiments show that the proposed SpirDet significantly outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2024-02-08T05:06:14Z)
• Real-time AdaBoost cascade face tracker based on likelihood map and optical flow [59.17685450892182]
  The authors present a novel face tracking approach where optical flow information is incorporated into a modified version of the Viola Jones detection algorithm. In the original algorithm, detection is static, as information from previous frames is not considered. The proposed tracker preserves information about the number of classification stages passed by each window.
  arXiv  Detail & Related papers  (2022-10-25T10:15:07Z)
• Improving Fuzzy-Logic based Map-Matching Method with Trajectory Stay-Point Detection [3.093890460224435]
  Most GPS trajectory datasets include stay-points irregularity, which makes map-matching algorithms mismatch trajectories to irrelevant streets. We cluster stay-points in a trajectory dataset with DBSCAN and eliminate redundant data to improve the efficiency of the map-matching algorithm. Our approach yields 27.39% data size reduction and 8.9% processing time reduction with the same accurate results as the previous fuzzy-logic based map-matching approach.
  arXiv  Detail & Related papers  (2022-08-04T20:41:13Z)
• Towards Real-Time Visual Tracking with Graded Color-names Features [10.475679500780574]
  MeanShift algorithm has been widely used in tracking tasks because of its simplicity and efficiency. Traditional MeanShift algorithm needs to label the initial region of the target, which reduces the applicability of the algorithm. We develop a tracking method that combines the background models and the graded features of color-names under the MeanShift framework.
  arXiv  Detail & Related papers  (2022-06-17T11:38:37Z)
• Learn Fine-grained Adaptive Loss for Multiple Anatomical Landmark Detection in Medical Images [15.7026400415269]
  We propose a novel learning-to-learn framework for landmark detection. Our proposed framework is general and shows the potential to improve the efficiency of anatomical landmark detection.
  arXiv  Detail & Related papers  (2021-05-19T13:39:18Z)
• AmphibianDetector: adaptive computation for moving objects detection [0.913755431537592]
  We propose an approach to object detection which makes it possible to reduce the number of false-positive detections. The proposed approach is a modification of CNN already trained for object detection task. The efficiency of the proposed approach was demonstrated on the open dataset "CDNet2014 pedestrian"
  arXiv  Detail & Related papers  (2020-11-15T12:37:44Z)
• Bayesian Optimization with Machine Learning Algorithms Towards Anomaly Detection [66.05992706105224]
  In this paper, an effective anomaly detection framework is proposed utilizing Bayesian Optimization technique. The performance of the considered algorithms is evaluated using the ISCX 2012 dataset. Experimental results show the effectiveness of the proposed framework in term of accuracy rate, precision, low-false alarm rate, and recall.
  arXiv  Detail & Related papers  (2020-08-05T19:29:35Z)
• UC-Net: Uncertainty Inspired RGB-D Saliency Detection via Conditional Variational Autoencoders [81.5490760424213]
  We propose the first framework (UCNet) to employ uncertainty for RGB-D saliency detection by learning from the data labeling process. Inspired by the saliency data labeling process, we propose probabilistic RGB-D saliency detection network.
  arXiv  Detail & Related papers  (2020-04-13T04:12:59Z)
• Refined Plane Segmentation for Cuboid-Shaped Objects by Leveraging Edge Detection [63.942632088208505]
  We propose a post-processing algorithm to align the segmented plane masks with edges detected in the image. This allows us to increase the accuracy of state-of-the-art approaches, while limiting ourselves to cuboid-shaped objects.
  arXiv  Detail & Related papers  (2020-03-28T18:51:43Z)
• Scalable Approximate Inference and Some Applications [2.6541211006790983]
  In this thesis, we propose a new framework for approximate inference. Our proposed four algorithms are motivated by the recent computational progress of Stein's method. Results on simulated and real datasets indicate the statistical efficiency and wide applicability of our algorithm.
  arXiv  Detail & Related papers  (2020-03-07T04:33:27Z)
• Depthwise Non-local Module for Fast Salient Object Detection Using a Single Thread [136.2224792151324]
  We propose a new deep learning algorithm for fast salient object detection. The proposed algorithm achieves competitive accuracy and high inference efficiency simultaneously with a single CPU thread.
  arXiv  Detail & Related papers  (2020-01-22T15:23:48Z)

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.