This paper gives proof of convergence for a learning algorithm that describes how anoles (lizards found in the Caribbean) learn foraging threshold distance. An anole will pursue a prey if and only if it is within this threshold of the anole's perch. The learning algorithm was proposed by Roughgarden
An Analysis of Histogram-Based Thresholding Algorithms
β Scribed by C.A. Glasbey
- Publisher
- Elsevier Science
- Year
- 1993
- Weight
- 363 KB
- Volume
- 55
- Category
- Article
- ISSN
- 1049-9652
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Many fMRI experiments have a common objective of identifying active voxels in a neuroimaging dataset. This is done in single subject experiments, for example, by performing individual voxelβwise tests of the null hypothesis that the observed time course is not significantly related to a
## Abstract The proposed method is based on color histogram. A new set of features are proposed for contentβbased image retrieval (CBIR) in this article. The selection of the features is based on histogram analysis. Standard histograms, because of their efficiency and insensitivity to small changes
Alagraet--An output error-based algorithm proposed by Landau and recently analysed by Dugard and Landau is shown to have a certain robustness property. Specifically it is proved that the parameters of the system transfer function can be estimated consistently with that algorithm even if the noise is
the particle velocity data is generated from a numerical simulation; therefore, the velocity data is only available at Several techniques for the numerical integration of particle paths in steady and unsteady vector (velocity) fields are analyzed. Most some set of discrete times, t n , for n Ο 0, 1,