Search results for "Estimation"
showing 10 items of 924 documents
Selective Change Driven Vision Sensor With Continuous-Time Logarithmic Photoreceptor and Winner-Take-All Circuit for Pixel Selection
2015
The objective of Selective Change Driven (SCD) Vision is to capture and process those scene pixels that have the greatest impact in the motion estimation task. The implemented SCD Vision sensor delivers the pixels ordered according to the illumination change undergone by each pixel, from the last time each pixel was read-out. This ordering strategy is especially interesting for motion detection algorithms, since it allows for a reduction in data bandwidth requirements without decreasing accuracy. The speed of the obtained pixel flow allows movement detection and tracking at a speed several orders of magnitude higher than conventional vision systems. To accomplish these objectives, the senso…
Meta-Tracking for Video Scene Understanding
2013
International audience; This paper presents a novel method to extract dominant motion patterns (MPs) and the main entry/exit areas from a surveillance video. The method first computes motion histograms for each pixel and then converts it into orientation distribution functions (ODFs). Given these ODFs, a novel particle meta-tracking procedure is launched which produces meta-tracks, i.e. particle trajectories. As opposed to conventional tracking which focuses on individual moving objects, meta-tracking uses particles to follow the dominant flow of the traffic. In a last step, a novel method is used to simultaneously identify the main entry/exit areas and recover the predominant MPs. The meta…
A spectral hazy image database
2020
We introduce a new database to promote visibility enhancement techniques intended for spectral image dehazing. SHIA (Spectral Hazy Image database for Assessment) is composed of two real indoor scenes M1 and M2 of 10 levels of fog each and their corresponding fog-free (ground-truth) images, taken in the visible and the near infrared ranges every 10 nm starting from 450 to 1000 nm. The number of images that form SHIA is 1540 with a size of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1312\,\times \,1082$$\end{d…
Exploring Training Options for RF Sensing Using CSI
2018
This work analyzes human behavior recognition approaches using WiFi channel state information from the perhaps less usual point of view of training and calibration needs. With the help of selected literature examples, as well as with more detailed experimental insights on our own Doppler spectrum-based approach for physical motion/presence/cardinality detection, we first classify the diverse forms of training so far employed into three main categories (trained, trained-once, and training-free). We further discuss under which conditions it is possible to move toward lighter forms of calibration or even succeed in devising fully untrained model-based solutions. Our take home messages are main…
Space-time Point Processes semi-parametric estimation with predictive measure information
2014
In this paper, we provide a method to estimate the space-time intensity of a branching-type point process by mixing nonparametric and parametric approaches. The method accounts simultaneously for the estimation of the different model components, applying a forward predictive likelihood estimation approach to semi-parametric models.
Continuous-Variable Instantaneous Quantum Computing is Hard to Sample
2017
Instantaneous quantum computing is a sub-universal quantum complexity class, whose circuits have proven to be hard to simulate classically in the Discrete-Variable (DV) realm. We extend this proof to the Continuous-Variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of post-selected circuits. In order to treat post-selection in CVs we consider finitely-resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator GKP encoding of quantum information,…
Benchmarking parameter-free AMaLGaM on functions with and without noise.
2013
We describe a parameter-free estimation-of-distribution algorithm (EDA) called the adapted maximum-likelihood Gaussian model iterated density-estimation evolutionary algorithm (AMaLGaM-ID[Formula: see text]A, or AMaLGaM for short) for numerical optimization. AMaLGaM is benchmarked within the 2009 black box optimization benchmarking (BBOB) framework and compared to a variant with incremental model building (iAMaLGaM). We study the implications of factorizing the covariance matrix in the Gaussian distribution, to use only a few or no covariances. Further, AMaLGaM and iAMaLGaM are also evaluated on the noisy BBOB problems and we assess how well multiple evaluations per solution can average ou…
A new representation of power spectral density and correlation function by means of fractional spectral moments
2009
In this paper, a new perspective for the representation of both the power spectral density and the correlation function by a unique class of function is introduced. We define the moments of order gamma (gamma being a complex number) of the one sided power spectral density and we call them Fractional Spectral Moments (FSM). These complex quantities remain finite also in the case in which the ordinary spectral moments diverge, and are able to represent the whole Power Spectral Density and the corresponding correlation function.
Quantum Query Algorithms for Conjunctions
2010
Every Boolean function can be presented as a logical formula in conjunctive normal form. Fast algorithm for conjunction plays significant role in overall algorithm for computing arbitrary Boolean function. First, we present a quantum query algorithm for conjunction of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p = 4/5, that improves the previous result. Then, we present the main result - generalization of our approach to design efficient quantum algorithms for computing conjunction of two Boolean functions. Finally, we demonstrate another kind of an algorithm for conjunction of two bits, that has a correct answer probability p = 9/10. Th…
Approaches to evaluate the virtual instrumentation measurement uncertainties
2002
This paper deals with the metrological characterization of virtual instruments. After a brief description of the features, the components and the working principle of the virtual instruments and the various uncertainty sources are analyzed. Then, two methods to evaluate the uncertainty of the measurement results are presented: a numerical method simulating the physical process of the A/D conversion, and an approximated theoretical method applying the "uncertainty propagation law" of the "guide to the expression of uncertainty in measurement." With both methods, the combined standard uncertainty of the measurement result is obtained, starting from the standard uncertainty generated by each s…