In this paper gazeshifts are considered as a realization of a stochastic process with non-local transition probabilities in a saliency field that represents a landscape upon which aconstrainedrandomwalk is performed. The search is driven by a Langevin equation whose random term is generated by a Levy distribution, and by a Metropolis algorithm. Results of the simulations are compared with experimental data, and a notion of complexity is introduced to quantify the behavior of the system in different conditions.
Modelling gaze shift as a constrained random walk
FERRARO, Mario
2004-01-01
Abstract
In this paper gazeshifts are considered as a realization of a stochastic process with non-local transition probabilities in a saliency field that represents a landscape upon which aconstrainedrandomwalk is performed. The search is driven by a Langevin equation whose random term is generated by a Levy distribution, and by a Metropolis algorithm. Results of the simulations are compared with experimental data, and a notion of complexity is introduced to quantify the behavior of the system in different conditions.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
gazeshift.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
519.56 kB
Formato
Adobe PDF
|
519.56 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
