Results 1  10
of
802
On the time course of perceptual choice: the leaky competing accumulator model
 PSYCHOLOGICAL REVIEW
, 2001
"... The time course of perceptual choice is discussed in a model based on gradual and stochastic accumulation of information in nonlinear decision units with leakage (or decay of activation) and competition through lateral inhibition. In special cases, the model becomes equivalent to a classical diffus ..."
Abstract

Cited by 457 (20 self)
 Add to MetaCart
The time course of perceptual choice is discussed in a model based on gradual and stochastic accumulation of information in nonlinear decision units with leakage (or decay of activation) and competition through lateral inhibition. In special cases, the model becomes equivalent to a classical diffusion process, but leakage and mutual inhibition work together to address several challenges to existing diffusion, randomwalk, and accumulator models. The model provides a good account of data from choice tasks using both timecontrolled (e.g., deadline or response signal) and standard reaction time paradigms and its overall adequacy compares favorably with that of other approaches. An experimental paradigm that explicitly controls the timing of information supporting different choice alternatives provides further support. The model captures flexible choice behavior regardless of the number of alternatives, accounting for the linear slowing of reaction time as a function of the log of the number of alternatives (Hick’s law) and explains a complex pattern of visual and contextual priming effects in visual word identification. Perceptual Choice 2 When an experience presents itself to the senses, the need often arises to determine its identity or to make some other judgment about it. In experimental paradigms, the time course of this judgment process is
Estimation of relative camera positions for uncalibrated cameras
, 1992
"... Abstract. This paper considers, the determination of internal camera parameters from two views of a point set in three dimensions. A noniterative algorithm is given for determining the focal lengths of the two cameras, as well as their relative placement, assuming all other internal camera paramete ..."
Abstract

Cited by 325 (24 self)
 Add to MetaCart
(Show Context)
Abstract. This paper considers, the determination of internal camera parameters from two views of a point set in three dimensions. A noniterative algorithm is given for determining the focal lengths of the two cameras, as well as their relative placement, assuming all other internal camera parameters to be known. It is shown that this is all the information that may be deduced from a set of image correspondences. 1
Functional Phonology  Formalizing the interactions between articulatory and perceptual drives
, 1998
"... ..."
On the Origins of Power Laws in Internet Topologies
 39th Annual Allerton Conference on Communication, Control, and Computing, 2001 www.merit.edu/~mrt
"... Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (i ..."
Abstract

Cited by 220 (4 self)
 Add to MetaCart
(Show Context)
Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node to existing nodes; (F2) incremental growth of the network; (F3) distribution of nodes in space; and (F4) locality of edge connections. In synthetically generated network topologies, we study the relevance of each factor in causing the aforementioned power laws as well as other properties, namely
Surface Modeling with Oriented Particle Systems
 COMPUTER GRAPHICS
, 1991
"... Splines and deformable surface models are widely used in computer graphics to describe freeform surfaces. These methods require manual preprocessing to discretize the surface into patches and to specify their connectivity. We present a new model of elastic surfaces based on interacting particle sys ..."
Abstract

Cited by 214 (6 self)
 Add to MetaCart
Splines and deformable surface models are widely used in computer graphics to describe freeform surfaces. These methods require manual preprocessing to discretize the surface into patches and to specify their connectivity. We present a new model of elastic surfaces based on interacting particle systems, which, unlike previous techniques, can be used to split, join, or extend surfaces without the need for manual intervention. The particles we use have longrange attraction forces and shortrange repulsion forces and follow Newtonian dynamics, much like recent computational models of fluids and solids. To enable our particles to model surface elements instead of point masses or volume elements, we add an orientation to each particle's state. We devise new interaction potentials for our oriented particles which favor locally planar or spherical arrangements. We also develop techniques for adding new particles automatically, which enables our surfaces to stretch and grow. We demonstrate t...
Linear Pushbroom Cameras
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1994
"... Modelling th# push broom sensors commonly used in satellite imagery is quite di#cult and computationally intensive due to th# complicated motion ofth# orbiting satellite with respect to th# rotating earth# In addition, th# math#46 tical model is quite complex, involving orbital dynamics, andh#(0k is ..."
Abstract

Cited by 172 (6 self)
 Add to MetaCart
(Show Context)
Modelling th# push broom sensors commonly used in satellite imagery is quite di#cult and computationally intensive due to th# complicated motion ofth# orbiting satellite with respect to th# rotating earth# In addition, th# math#46 tical model is quite complex, involving orbital dynamics, andh#(0k is di#cult to analyze. Inth#A paper, a simplified model of apush broom sensor(th# linear push broom model) is introduced. Ith as th e advantage of computational simplicity wh#A9 atth# same time giving very accurate results compared with th# full orbitingpush broom model. Meth# ds are given for solving th# major standardph# togrammetric problems for th e linear push broom sensor. Simple noniterative solutions are given for th# following problems : computation of th# model parameters from groundcontrol points; determination of relative model parameters from image correspondences between two images; scene reconstruction given image correspondences and groundcontrol points. In addition, th# linearpush broom model leads toth#0 retical insigh ts th# t will be approximately valid for th# full model as well.Th# epipolar geometry of linear push broom cameras in investigated and sh own to be totally di#erent from th at of a perspective camera. Neverth eless, a matrix analogous to th e essential matrix of perspective cameras issh own to exist for linear push broom sensors. Fromth#0 it is sh# wn th# t a scene is determined up to an a#ne transformation from two viewswith linearpush broom cameras. Keywords :push broom sensor, satellite image, essential matrixph# togrammetry, camera model The research describ ed in this paper hasb een supportedb y DARPA Contract #MDA97291 C0053 1 Real Push broom sensors are commonly used in satellite cameras, notably th# SPOT satellite forth# generatio...
An efficient implementation of the PattersonHoldsworth auditory filter bank
 Perception Group  Advanced Technology Group, Apple Computer Inc., Technical TR35
, 1993
"... ..."
Mechanical Integrators Derived from a Discrete Variational Principle
"... Many numerical integrators for mechanical system simulation are created by using discrete algorithms to approximate the continuous equations of motion. In this paper, we present a procedure to construct timestepping algorithms that approximate the flow of continuous ODE's for mechanical system ..."
Abstract

Cited by 86 (12 self)
 Add to MetaCart
Many numerical integrators for mechanical system simulation are created by using discrete algorithms to approximate the continuous equations of motion. In this paper, we present a procedure to construct timestepping algorithms that approximate the flow of continuous ODE's for mechanical systems by discretizing Hamilton's principle rather than the equations of motion. The discrete equations share similarities to the continuous equations by preserving invariants, including the symplectic form and the momentum map. We girst present a formulation of discrete mechanics along with a discrete variational principle. We then show that the resulting equations of motion preserve the symplectic form and that this formulation of mechanics leads to conservation laws from a discrete version of Noether's theorem. We then use the discrete mechanics formulation to develop a procedure for constructing mechanical integrators for continuous Lagrangian systems. We apply the construction procedure to the rigid body and the double spherical pendulum to demonstrate numerical properties of the integrators.