scispace - formally typeset
Search or ask a question

Showing papers by "Gary Bradski published in 2007"


Proceedings ArticleDOI
C. Ranger1, R. Raghuraman1, A. Penmetsa1, Gary Bradski1, Christos Kozyrakis1 
10 Feb 2007
TL;DR: It is established that, given a careful implementation, MapReduce is a promising model for scalable performance on shared-memory systems with simple parallel code.
Abstract: This paper evaluates the suitability of the MapReduce model for multi-core and multi-processor systems. MapReduce was created by Google for application development on data-centers with thousands of servers. It allows programmers to write functional-style code that is automatically parallelized and scheduled in a distributed system. We describe Phoenix, an implementation of MapReduce for shared-memory systems that includes a programming API and an efficient runtime system. The Phoenix runtime automatically manages thread creation, dynamic task scheduling, data partitioning, and fault tolerance across processor nodes. We study Phoenix with multi-core and symmetric multiprocessor systems and evaluate its performance potential and error recovery features. We also compare MapReduce code to code written in lower-level APIs such as P-threads. Overall, we establish that, given a careful implementation, MapReduce is a promising model for scalable performance on shared-memory systems with simple parallel code

1,058 citations


Proceedings Article
06 Jan 2007
TL;DR: This paper presents a novel method for identifying and tracking objects in multiresolution digital video of partially cluttered environments and uses a learned "attentive" interest map on a low resolution data stream to direct a high resolution "fovea".
Abstract: Human object recognition in a physical 3-d environment is still far superior to that of any robotic vision system. We believe that one reason (out of many) for this--one that has not heretofore been significantly exploited in the artificial vision literature--is that humans use a fovea to fixate on, or near an object, thus obtaining a very high resolution image of the object and rendering it easy to recognize. In this paper, we present a novel method for identifying and tracking objects in multiresolution digital video of partially cluttered environments. Our method is motivated by biological vision systems and uses a learned "attentive" interest map on a low resolution data stream to direct a high resolution "fovea." Objects that are recognized in the fovea can then be tracked using peripheral vision. Because object recognition is run only on a small foveal image, our system achieves performance in real-time object recognition and tracking that is well beyond simpler systems.

87 citations


Book ChapterDOI
Qian Diao1, Jianye Lu1, Wei Hu1, Yimin Zhang1, Gary Bradski1 
01 Jan 2007
TL;DR: This chapter describes some DBN models for tracking in nonlinear, nonGaussian and multimodal situations, and presents a prediction method to assist feature extraction part by making a hypothesis for the new observations.
Abstract: In a visual tracking task, the object may exhibit rich dynamic behavior in complex environments that can corrupt target observations via background clutter and occlusion. Such dynamics and background induce nonlinear, nonGaussian and multimodal observation densities. These densities are difficult to model with traditional methods such as Kalman filter models (KFMs) due to their Gaussian assumptions. Dynamic Bayesian networks (DBNs) provide a more general framework in which to solve these problems. DBNs generalize KFMs by allowing arbitrary probability distributions, not just (unimodal) linear-Gaussian. Under the DBN umbrella, a broad class of learning and inference algorithms for time-series models can be used in visual tracking. Furthermore, DBNs provide a natural way to combine multiple vision cues. In this chapter, we describe some DBN models for tracking in nonlinear, nonGaussian and multimodal situations, and present a prediction method to assist feature extraction part by making a hypothesis for the new observations. IGI PUBLISHING This paper appears in the publication, Bayesian Network Technologies: Applications and Graphical Models edited by A. Mittal and A. Kassim © 2007, IGI Global 701 E. Chocolate Avenue, Suite 200, Hershey PA 17033-1240, USA Tel: 717/533-8845; Fax 717/533-8661; URL-http://www.igi-pub.com ITB14285

1 citations


Patent
Gary Bradski1
28 Feb 2007
TL;DR: In this paper, a method is introduced comprising providing random regions of a feature space to parallel cores, testing each random region for enrichment in parallel, and calculating an overall average coverage for each data point among the enriched random regions.
Abstract: In some embodiments, multi-core stochastic discrimination is generally presented. In this regard, a method is introduced comprising providing random regions of a feature space to parallel cores, testing each random region for enrichment in parallel, recording coverage for each data point in each enriched random region in parallel, and calculating an overall average coverage for each data point among the enriched random regions. Other embodiments are also disclosed and claimed.