Search results for "Pursuit"
showing 10 items of 47 documents
On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata
2013
Published version of an article in the journal: Applied Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/s10489-013-0424-x There are currently two fundamental paradigms that have been used to enhance the convergence speed of Learning Automata (LA). The first involves the concept of utilizing the estimates of the reward probabilities, while the second involves discretizing the probability space in which the LA operates. This paper demonstrates how both of these can be simultaneously utilized, and in particular, by using the family of Bayesian estimates that have been proven to have distinct advantages over their maximum likelihood counterparts. The success of LA-…
Deconvolution by Regularized Matching Pursuit
2014
In this chapter, an efficient method that restores signals from strongly noised blurred discrete data is presented. The method can be characterized as a Regularized Matching Pursuit (RMP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis and greedy algorithms. The main distinction from the conventional matching pursuit is that different dictionaries are used to test the data and to approximate the solution. In addition, oblique projections of data onto dictionary elements are used instead of orthogonal projections, which are used in the conventional Matching Pursuit (MP). The slopes of the projections and the stopping rule for the …
The Differential Relations between Perceived Social Support and Rumination-Associated Goals
2013
In this study with N = 93 student participants, we employed a daily process approach to investigate sadness-associated rumination in daily life. Specifically, we examined whether the attainment of coping-related goals that people intend to achieve with their sadness-associated rumination were associated with changes in perceived social support. Moreover, we investigated the relations between sadness-related cognitive appraisals, goal pursuit and attainment, and ruminative process variables. Perceived social support was positively related to the attainment of resolution-focused goals, but not to understanding-focused goals, suggesting that social support is particularly associated with a fun…
EP 34. Functional hierarchy within the neural network for optokinetic ‘look’ nystagmus
2016
Item does not contain fulltext Key nodes of neural networks for ocular motor control and visual motion processing have been localized using saccades, smooth pursuit, and optokinetic nystagmus (OKN). Within the context of an independent fMRI study using OKN, 9 bilateral network nodes were localized comprising cortical eye fields in frontal (FEF), supplementary motor (SEF), cingulate (CEF) and parietal cortex (PEF), visual motion centers MT+ and V6, the superior colliculus (SC), the lateral geniculate nucleus (LGN) and the globus pallidus (GP). Here, we examined the network's functional hierarchy as present in the structural co-variation (SCoV) and resting-state (RS) fMRI, and the effect of R…
Hidden Pursuits: Evaluating Gaze-selection via Pursuits when the Stimuli's Trajectory is Partially Hidden
2018
The idea behind gaze interaction using Pursuits is to leverage the human's smooth pursuit eye movements performed when following moving targets. However, humans can also anticipate where a moving target would reappear if it temporarily hides from their view. In this work, we investigate how well users can select targets using Pursuits in cases where the target's trajectory is partially invisible (HiddenPursuits): e.g., can users select a moving target that temporarily hides behind another object? Although HiddenPursuits was not studied in the context of interaction before, understanding how well users can perform HiddenPursuits presents numerous opportunities, particularly for small interfa…
Projection Clustering Unfolding: A New Algorithm for Clustering Individuals or Items in a Preference Matrix
2020
In the framework of preference rankings, the interest can lie in clustering individuals or items in order to reduce the complexity of the preference space for an easier interpretation of collected data. The last years have seen a remarkable flowering of works about the use of decision tree for clustering preference vectors. As a matter of fact, decision trees are useful and intuitive, but they are very unstable: small perturbations bring big changes. This is the reason why it could be necessary to use more stable procedures in order to clustering ranking data. In this work, a Projection Clustering Unfolding (PCU) algorithm for preference data will be proposed in order to extract useful info…
Using the Theory of Regular Functions to Formally Prove the ε-Optimality of Discretized Pursuit Learning Algorithms
2014
Learning Automata LA can be reckoned to be the founding algorithms on which the field of Reinforcement Learning has been built. Among the families of LA, Estimator Algorithms EAs are certainly the fastest, and of these, the family of Pursuit Algorithms PAs are the pioneering work. It has recently been reported that the previous proofs for e-optimality for all the reported algorithms in the family of PAs have been flawed. We applaud the researchers who discovered this flaw, and who further proceeded to rectify the proof for the Continuous Pursuit Algorithm CPA. The latter proof, though requires the learning parameter to be continuously changing, is, to the best of our knowledge, the current …
PCA Gaussianization for image processing
2009
The estimation of high-dimensional probability density functions (PDFs) is not an easy task for many image processing applications. The linear models assumed by widely used transforms are often quite restrictive to describe the PDF of natural images. In fact, additional non-linear processing is needed to overcome the limitations of the model. On the contrary, the class of techniques collectively known as projection pursuit, which solve the high-dimensional problem by sequential univariate solutions, may be applied to very general PDFs (e.g. iterative Gaussianization procedures). However, the associated computational cost has prevented their extensive use in image processing. In this work, w…
A systematic comparison of kinetic modelling methods generating parametric maps for [11C]-(R)-PK11195
2006
[(11)C]-(R)-PK11195 is presently the most widely used radiotracer for the monitoring of microglia activity in the central nervous system (CNS). Microglia, the resident immune cells of the brain, play a critical role in acute and chronic diseases of the central nervous system and in host defence against neoplasia. The purpose of this investigation was to evaluate the reliability and sensitivity of five kinetic modelling methods for the formation of parametric maps from dynamic [(11)C]-(R)-PK11195 studies. The methods we tested were the simplified reference tissue model (SRTM), basis pursuit, a simple target-to-reference ratio, the Logan plot and a wavelet based Logan plot. For the reliabilit…
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
2014
Published version of an article from the journal: Applied Intelligence. Also available on Springerlink: http://dx.doi.org/10.1007/s10489-014-0541-1 The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, Variable Structure, Discretized etc.) are quite distinct. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. Informally, if the environment is stationary, their ε-optimality is defined as their abili…