Odometry-driven inference to link multiple exemplars of a location

A major challenge for robot localization and mapping systems is maintaining reliable operation in a changing environment. Vision-based systems in particular are susceptible to changes in illumination and weather, and the same location at another time of day may appear radically different to a system using a feature-based visual localization system. One approach for mapping changing environments is to create and maintain maps that contain multiple representations of each physical location in a topological framework or manifold. However, this requires the system to be able to correctly link two or more appearance representations to the same spatial location, even though the representations may appear quite dissimilar. This paper proposes a method of linking visual representations from the same location without requiring a visual match, thereby allowing vision-based localization systems to create multiple appearance representations of physical locations. The most likely position on the robot path is determined using particle filter methods based on dead reckoning data and recent visual loop closures. In order to avoid erroneous loop closures, the odometry-based inferences are only accepted when the inferred path's end point is confirmed as correct by the visual matching system. Algorithm performance is demonstrated using an indoor robot dataset and a large outdoor camera dataset.

A comparison of two business cycle dating methods

We study the suggestion that Markov switching (MS) models should be used to determine cyclical turning points. A Kalman filter approximation is used to derive the dating rules implicit in such models. We compare these with dating rules in an algorithm that provides a good approximation to the chronology determined by the NBER. We find that there is very little that is attractive in the MS approach when compared with this algorithm. The most important difference relates to robustness. The MS approach depends on the validity of that statistical model. Our approach is valid in a wider range of circumstances.

A yellow filter improves response times to low-contrast targets and traffic hazards

Purpose Anecdotal evidence suggests that some sunglass users prefer yellow tints for outdoor activities, such as driving, and research has suggested that such tints improve the apparent contrast and brightness of real-world objects. The aim of this study was to establish whether yellow filters resulted in objective improvements in performance for visual tasks relevant to driving. Methods Response times of nine young (age [mean ± SD], 31.4 ± 6.7 years) and nine older (age, [mean ± SD], 74.6 ± 4.8) adults were measured using video presentations of traffic hazards (driving hazard perception task) and a simple low-contrast grating appeared at random peripheral locations on a computer screen. Response times were compared when participants wore a yellow filter (with and without a linear polarizer) versus a neutral density filter (with and without a linear polarizer). All lens combinations were matched to have similar luminance transmittances (˜27%). Results In the driving hazard perception task, the young but not the older participants responded significantly more rapidly to hazards when wearing a yellow filter than with a luminance-matched neutral density filter (mean difference, 450 milliseconds). In the low-contrast grating task, younger participants also responded more quickly for the yellow filter condition but only when combined with a polarizer. Although response times increased with increasing stimulus eccentricity for the low-contrast grating task, for the younger participants, this slowing of response times with increased eccentricity was reduced in the presence of a yellow filter, indicating that perception of more peripheral objects may be improved by this filter combination. Conclusions Yellow filters improve response times for younger adults for visual tasks relevant to driving.

Bitboard methods for games

Bitboards allow the efficient encoding of games for computer play and the application of fast bitwiseparallel algorithms for common game-related operations. This article describes: (1) a selection of bitboard techniques including an introduction to bitboards and bitwise operations; (2) a classification scheme that distinguishes filter, query and update methods, and; (3) a sampling of bitboard algorithms for a range of games other than chess, with notes on their performance and practical application.