Reduce false positives for object detection by a priori probability in videos

2016 ◽  
Vol 208 ◽  
pp. 325-332 ◽  
Author(s):  
Lei Wang ◽  
Xu Zhao ◽  
Yuncai Liu
Keyword(s):  
Object Detection ◽  
A Priori ◽  
False Positives ◽  
A Priori Probability

scholarly journals Operating characteristics and a priori probability of the signal

1970 ◽  
Vol 8 (5) ◽  
pp. 317-320 ◽  
Author(s):  
Arthur I. Schulman ◽  
Gordon Z. Greenberg
Keyword(s):  
A Priori ◽  
Operating Characteristics ◽  
A Priori Probability

Continuous Feedback in Recognition Memory

1973 ◽  
Vol 37 (3) ◽  
pp. 771-776 ◽  
Author(s):  
Thomas G. Titus
Keyword(s):  
Recognition Memory ◽  
Signal Detection ◽  
False Alarm ◽  
Present Experiment ◽  
Recognition Performance ◽  
A Priori ◽  
Continuous Feedback ◽  
Recognition Testing ◽  
A Priori Probability

Signal-detection models of recognition memory assume that S's decision as to whether or not he recognizes a stimulus is a function of a criterion value. In selecting his criterion, S takes into consideration the a priori probability of an old item and the costs and rewards of a hit or false alarm. In the present experiment, Ss were given feedback during recognition testing in an effort to determine whether it would aid S in selecting his criterion. The results showed that the feedback improved recognition performance by significantly reducing the number of false alarm errors. Evidence was presented to support the claim that S's criterion was affected by this manipulation.

scholarly journals Challenging a bioinformatic tool’s ability to detect microbial contaminants usingin silicowhole genome sequencing data

PeerJ ◽  
2017 ◽  
Vol 5 ◽  
pp. e3729 ◽  
Author(s):  
Nathan D. Olson ◽  
Justin M. Zook ◽  
Jayne B. Morrow ◽  
Nancy J. Lin
Keyword(s):  
Binary Mixtures ◽  
Genome Sequencing ◽  
Pathogen Detection ◽  
A Priori ◽  
High Sensitivity ◽  
False Positives ◽  
Sequencing Data ◽  
Materials Used ◽  
The Individual ◽  
Genome Assemblies

High sensitivity methods such as next generation sequencing and polymerase chain reaction (PCR) are adversely impacted by organismal and DNA contaminants. Current methods for detecting contaminants in microbial materials (genomic DNA and cultures) are not sensitive enough and require either a known or culturable contaminant. Whole genome sequencing (WGS) is a promising approach for detecting contaminants due to its sensitivity and lack of need fora prioriassumptions about the contaminant. Prior to applying WGS, we must first understand its limitations for detecting contaminants and potential for false positives. Herein we demonstrate and characterize a WGS-based approach to detect organismal contaminants using an existing metagenomic taxonomic classification algorithm. Simulated WGS datasets from ten genera as individuals and binary mixtures of eight organisms at varying ratios were analyzed to evaluate the role of contaminant concentration and taxonomy on detection. For the individual genomes the false positive contaminants reported depended on the genus, withStaphylococcus,Escherichia, andShigellahaving the highest proportion of false positives. For nearly all binary mixtures the contaminant was detected in thein-silicodatasets at the equivalent of 1 in 1,000 cells, thoughF. tularensiswas not detected in any of the simulated contaminant mixtures andY. pestiswas only detected at the equivalent of one in 10 cells. Once a WGS method for detecting contaminants is characterized, it can be applied to evaluate microbial material purity, in efforts to ensure that contaminants are characterized in microbial materials used to validate pathogen detection assays, generate genome assemblies for database submission, and benchmark sequencing methods.

Causation in Statistical Mechanics

2010 ◽  
Author(s):  
Lawrence Sklar
Keyword(s):  
Wave Function ◽  
Statistical Mechanics ◽  
Initial Conditions ◽  
A Priori ◽  
Equilibrium Theory ◽  
Dynamical State ◽  
Full State ◽  
The Future ◽  
Micro Level ◽  
A Priori Probability

In statistical mechanics causation appears at the micro-level as the postulation that the full state of a system at one time can be specified by the dynamical state of all its micro-constituents (the positions and momenta of the molecules in a gas or, alternatively the wave function of these at one time), and that this state at one time generates, following the laws of dynamics (classical or quantum) the future dynamical state of the system characterized in these micro-constituent terms. So what is ‘non-causal’ in nature in explanations in statistical mechanics? This article explores two issues: The peculiar ‘transcendental’ nature of explanation in equilibrium theory in statistical mechanics; The need for introducing some a priori probability posit over initial conditions of systems in non-equilibrium theory.

BEING LOW ALONG A SEQUENCE AND ELSEWHERE

2019 ◽  
Vol 84 (02) ◽  
pp. 497-516
Author(s):  
WOLFGANG MERKLE ◽  
LIANG YU
Keyword(s):  
A Priori ◽  
Expected Value ◽  
Infinite Subset ◽  
Additive Constant ◽  
Almost All ◽  
The Given ◽  
Infinite Set ◽  
A Priori Probability

AbstractLet an oracle be called low for prefix-free complexity on a set in case access to the oracle improves the prefix-free complexities of the members of the set at most by an additive constant. Let an oracle be called weakly low for prefix-free complexity on a set in case the oracle is low for prefix-free complexity on an infinite subset of the given set. Furthermore, let an oracle be called low and weakly for prefix-free complexity along a sequence in case the oracle is low and weakly low, respectively, for prefix-free complexity on the set of initial segments of the sequence. Our two main results are the following characterizations. An oracle is low for prefix-free complexity if and only if it is low for prefix-free complexity along some sequences if and only if it is low for prefix-free complexity along all sequences. An oracle is weakly low for prefix-free complexity if and only if it is weakly low for prefix-free complexity along some sequence if and only if it is weakly low for prefix-free complexity along almost all sequences. As a tool for proving these results, we show that prefix-free complexity differs from its expected value with respect to an oracle chosen uniformly at random at most by an additive constant, and that similar results hold for related notions such as a priori probability. Furthermore, we demonstrate that on every infinite set almost all oracles are weakly low but are not low for prefix-free complexity, while by Shoenfield absoluteness there is an infinite set on which uncountably many oracles are low for prefix-free complexity. Finally, we obtain no-gap results, introduce weakly low reducibility, or WLK-reducibility for short, and show that all its degrees except the greatest one are countable.

Sign in / Sign up

Export Citation Format

Share Document