BSUV-Net: a fully-convolutional neural network for background subtraction of unseen videos

Background subtraction is a basic task in computer vision and video processing often applied as a pre-processing step for object tracking, people recognition, etc. Recently, a number of successful background-subtraction algorithms have been proposed, however nearly all of the top-performing ones are supervised. Crucially, their success relies upon the availability of some annotated frames of the test video during training. Consequently, their performance on completely “unseen” videos is undocumented in the literature. In this work, we propose a new, supervised, background subtraction algorithm for unseen videos (BSUV-Net) based on a fully-convolutional neural network. The input to our network consists of the current frame and two background frames captured at different time scales along with their semantic segmentation maps. In order to reduce the chance of overfitting, we also introduce a new data-augmentation technique which mitigates the impact of illumination difference between the background frames and the current frame. On the CDNet-2014 dataset, BSUV-Net outperforms stateof-the-art algorithms evaluated on unseen videos in terms of several metrics including F-measure, recall and precision.Accepted manuscrip

Visual Feature Attribution using Wasserstein GANs

Attributing the pixels of an input image to a certain category is an important and well-studied problem in computer vision, with applications ranging from weakly supervised localisation to understanding hidden effects in the data. In recent years, approaches based on interpreting a previously trained neural network classifier have become the de facto state-of-the-art and are commonly used on medical as well as natural image datasets. In this paper, we discuss a limitation of these approaches which may lead to only a subset of the category specific features being detected. To address this problem we develop a novel feature attribution technique based on Wasserstein Generative Adversarial Networks (WGAN), which does not suffer from this limitation. We show that our proposed method performs substantially better than the state-of-the-art for visual attribution on a synthetic dataset and on real 3D neuroimaging data from patients with mild cognitive impairment (MCI) and Alzheimer's disease (AD). For AD patients the method produces compellingly realistic disease effect maps which are very close to the observed effects.Comment: Accepted to CVPR 201

Deep learning algorithms for background subtraction and people detection

Video cameras are commonly used today in surveillance and security, autonomous driving and flying, manufacturing and healthcare. While different applications seek different types of information from the video streams, detecting changes and finding people are two key enablers for many of them. This dissertation focuses on both of these tasks: change detection, also known as background subtraction, and people detection from overhead fisheye cameras, an emerging research topic. Background subtraction has been thoroughly researched to date and the top-performing algorithms are data-driven and supervised. Crucially, during training these algorithms rely on the availability of some annotated frames from the video being tested. Instead, we propose a novel, supervised background-subtraction algorithm for unseen videos based on a fully-convolutional neural network. The input to our network consists of the current frame and two background frames captured at different time scales along with their semantic segmentation maps. In order to reduce the chance of overfitting, we introduce novel temporal and spatio-temporal data-augmentation methods. We also propose a cross-validation training/evaluation strategy for the largest change-detection dataset, CDNet-2014, that allows a fair and video-agnostic performance comparison of supervised algorithms. Overall, our algorithm achieves significant performance gains over state of the art in terms of F-measure, recall and precision. Furthermore, we develop a real-time variant of our algorithm with performance close to that of the state of the art. Owing to their large field of view, fisheye cameras mounted overhead are becoming a surveillance modality of choice for large indoor spaces. However, due to their top-down viewpoint and unique optics, standing people appear radially oriented and radially distorted in fisheye images. Therefore, traditional people detection, tracking and recognition algorithms developed for standard cameras do not perform well on fisheye images. To address this, we introduce several novel people-detection algorithms for overhead fisheye cameras. Our first two algorithms address the issue of radial body orientation by applying a rotating-window approach. This approach leverages a state-of-the-art object-detection algorithm trained on standard images and applies additional pre- and post-processing to detect radially-oriented people. Our third algorithm addresses both the radial body orientation and distortion by applying an end-to-end neural network with a novel angle-aware loss function and training on fisheye images. This algorithm outperforms the first two approaches and is two orders of magnitude faster. Finally, we introduce three spatio-temporal extensions of the end-to-end approach to deal with intermittent misses and false detections. In order to evaluate the performance of our algorithms, we collected, annotated and made publicly available four datasets composed of overhead fisheye videos. We provide a detailed analysis of our algorithms on these datasets and show that they significantly outperform the current state of the art

Transit timing variation analysis of the low-mass brown dwarf KELT-1 b

We investigate whether there is a variation in the orbital period of the short-period brown dwarf-mass KELT-1 b, which is one of the best candidates to observe orbital decay. We obtain 19 high-precision transit light curves of the target using six different telescopes. We add all precise and complete transit light curves from open databases and the literature, as well as the available Transiting Exoplanet Survey Satellite (TESS) observations from sectors 17 and 57, to form a transit timing variation (TTV) diagram spanning more than 10 yr of observations. The analysis of the TTV diagram, however, is inconclusive in terms of a secular or periodic variation, hinting that the system might have synchronized. We update the transit ephemeris and determine an informative lower limit for the reduced tidal quality parameter of its host star of Q ′⋆>(8.5±3.9)×106 assuming that the stellar rotation is not yet synchronized. Using our new photometric observations, published light curves, the TESS data, archival radial velocities, and broadband magnitudes, we also update the measured parameters of the system. Our results are in good agreement with those found in previous analyses

Locating bugs without looking back

Bug localisation is a core program comprehension task in software maintenance: given the observation of a bug, e.g. via a bug report, where is it located in the source code? Information retrieval (IR) approaches see the bug report as the query, and the source code files as the documents to be retrieved, ranked by relevance. Such approaches have the advantage of not requiring expensive static or dynamic analysis of the code. However, current state-of-the-art IR approaches rely on project history, in particular previously fixed bugs or previous versions of the source code. We present a novel approach that directly scores each current file against the given report, thus not requiring past code and reports. The scoring method is based on heuristics identified through manual inspection of a small sample of bug reports. We compare our approach to eight others, using their own five metrics on their own six open source projects. Out of 30 performance indicators, we improve 27 and equal 2. Over the projects analysed, on average we find one or more affected files in the top 10 ranked files for 76% of the bug reports. These results show the applicability of our approach to software projects without history

VACCINATION PRACTICES OF ADULT FAMILIAL MEDITERRANEAN FEVER PATIENTS IN TURKEY.

[Abstract Not Available

When to Use Provider Triage in Emergency Departments

We study triage decisions in emergency departments (EDs) and provide a general procedure for determining when to apply provider triage (PT) based on operational and financial considerations using a steady-state many-server fluid approximation. We then apply the proposed method in the setting of a teaching hospital's ED and obtain closed-form expressions for the range of arrival rates for which PT outperforms the traditional nurse triage economically. We show that the proposed solution methodology based on this approximation procedure is asymptotically optimal under a many-server asymptotic regime. We also demonstrate via simulation experiments that the proposed policy performs within 0.82% of the best solution obtained via a computationally intensive total enumeration method

Exponential Type Complex and non-Hermitian Potentials in PT-Symmetric Quantum Mechanics

Using the NU method [A.F.Nikiforov, V.B.Uvarov, Special Functions of Mathematical Physics, Birkhauser,Basel,1988], we investigated the real eigenvalues of the complex and/or $PT$- symmetric, non-Hermitian and the exponential type systems, such as Poschl-Teller and Morse potentials.Comment: 14 pages, Late