Combining Background Subtraction Algorithms with Convolutional Neural Network

Accurate and fast extraction of foreground object is a key prerequisite for a wide range of computer vision applications such as object tracking and recognition. Thus, enormous background subtraction methods for foreground object detection have been proposed in recent decades. However, it is still regarded as a tough problem due to a variety of challenges such as illumination variations, camera jitter, dynamic backgrounds, shadows, and so on. Currently, there is no single method that can handle all the challenges in a robust way. In this letter, we try to solve this problem from a new perspective by combining different state-of-the-art background subtraction algorithms to create a more robust and more advanced foreground detection algorithm. More specifically, an encoder-decoder fully convolutional neural network architecture is trained to automatically learn how to leverage the characteristics of different algorithms to fuse the results produced by different background subtraction algorithms and output a more precise result. Comprehensive experiments evaluated on the CDnet 2014 dataset demonstrate that the proposed method outperforms all the considered single background subtraction algorithm. And we show that our solution is more efficient than other combination strategies

Challenges in video based object detection in maritime scenario using computer vision

This paper discusses the technical challenges in maritime image processing and machine vision problems for video streams generated by cameras. Even well documented problems of horizon detection and registration of frames in a video are very challenging in maritime scenarios. More advanced problems of background subtraction and object detection in video streams are very challenging. Challenges arising from the dynamic nature of the background, unavailability of static cues, presence of small objects at distant backgrounds, illumination effects, all contribute to the challenges as discussed here

Mesh-based 3D Textured Urban Mapping

In the era of autonomous driving, urban mapping represents a core step to let vehicles interact with the urban context. Successful mapping algorithms have been proposed in the last decade building the map leveraging on data from a single sensor. The focus of the system presented in this paper is twofold: the joint estimation of a 3D map from lidar data and images, based on a 3D mesh, and its texturing. Indeed, even if most surveying vehicles for mapping are endowed by cameras and lidar, existing mapping algorithms usually rely on either images or lidar data; moreover both image-based and lidar-based systems often represent the map as a point cloud, while a continuous textured mesh representation would be useful for visualization and navigation purposes. In the proposed framework, we join the accuracy of the 3D lidar data, and the dense information and appearance carried by the images, in estimating a visibility consistent map upon the lidar measurements, and refining it photometrically through the acquired images. We evaluate the proposed framework against the KITTI dataset and we show the performance improvement with respect to two state of the art urban mapping algorithms, and two widely used surface reconstruction algorithms in Computer Graphics.Comment: accepted at iros 201

Finding the optimal background subtraction algorithm for EuroHockey 2015 video

Background subtraction is a classic step in a vision-based localization and tracking workflow. Previous studies have compared background subtraction algorithms on publicly available datasets; however comparisons were made only with manually optimized parameters. The aim of this research was to identify the optimal background subtraction algorithm for a set of field hockey videos captured at EuroHockey 2015. Particle Swarm Optimization was applied to find the optimal background subtraction algorithm. The objective function was the F-score, i.e. the harmonic mean of precision and recall. The precision and recall were calculated using the output of the background subtraction algorithm and gold standard labeled images. The training dataset consisted of 15 x 13 second field hockey video segments. The test data consisted of 5 x 13 second field hockey video segments. The video segments were chosen to be representative of the teams present at the tournament, the times of day the matches were played and the weather conditions experienced. Each segment was 960 pixels x 540 pixels and had 10 ground truth labeled frames. Eight commonly used background subtraction algorithms were considered. Results suggest that a background subtraction algorithm must use optimized parameters for a valid comparison of performance. Particle Swarm Optimization is an appropriate method to undertake this optimization. The optimal algorithm, Temporal Median, achieved an F-score of 0.791 on the test dataset, suggesting it generalizes to the rest of the video footage captured at EuroHockey 2015

A Nonconvex Projection Method for Robust PCA

Robust principal component analysis (RPCA) is a well-studied problem with the goal of decomposing a matrix into the sum of low-rank and sparse components. In this paper, we propose a nonconvex feasibility reformulation of RPCA problem and apply an alternating projection method to solve it. To the best of our knowledge, we are the first to propose a method that solves RPCA problem without considering any objective function, convex relaxation, or surrogate convex constraints. We demonstrate through extensive numerical experiments on a variety of applications, including shadow removal, background estimation, face detection, and galaxy evolution, that our approach matches and often significantly outperforms current state-of-the-art in various ways.Comment: In the proceedings of Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19