STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Computer Vision
Quality Control of Ready-Made Food
Mustererkennung 1995, 17. DAGM-Symposium
Who says you have to look at the input?: the brave new world of sublinear computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Digital Image Processing (3rd Edition)
Digital Image Processing (3rd Edition)
Vision: A Computational Investigation into the Human Representation and Processing of Visual Information
Sublinear Geometric Algorithms
SIAM Journal on Computing
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Emergent algorithms for centroid and orientation detection in high-performance embedded cameras
Proceedings of the 5th conference on Computing frontiers
Geometric computation with smart pixels
Proceedings of the twenty-seventh annual symposium on Computational geometry
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
We study a problem related to computer vision: How can a field of sensors compute higher-level properties of observed objects deterministically in sublinear time, without accessing a central authority? This issue is not only important for real-time processing of images, but lies at the very heart of understanding how a brain may be able to function. In particular, we consider a quadratic field of n "smart pixels" on a video chip that observe a B/W image. Each pixel can exchange low-level information with its immediate neighbors. We show that it is possible to compute the centers of gravity along with a principal component analysis of all connected components of the black grid graph in time O(sqrt(n)), by developing appropriate distributed protocols that are modeled after sweepline methods. Our method is not only interesting from a philosophical and theoretical point of view, it is also useful for actual applications for controling a robot arm that has to seize objects on a moving belt. We describe details of an implementation on an FPGA; the code has also been turned into a hardware design for an application-specific integrated circuit (ASIC).