Sciweavers

180 search results - page 11 / 36
» Measure on P: Robustness of the Notion
Sort
View
COMPGEOM
2004
ACM
14 years 27 days ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
ICASSP
2008
IEEE
14 years 1 months ago
Stable sparse approximations via nonconvex optimization
We present theoretical results pertaining to the ability of ℓp minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we ...
Rayan Saab, Rick Chartrand, Özgür Yilmaz
CVIU
2006
142views more  CVIU 2006»
13 years 7 months ago
Robust target detection and tracking through integration of motion, color, and geometry
Vision-based tracking is a basic elementary task in many computer vision-based applications such as video surveillance and monitoring, sensing and navigation in robotics, video co...
Harini Veeraraghavan, Paul R. Schrater, Nikolaos P...
HYBRID
2010
Springer
14 years 2 months ago
On integration of event-based estimation and robust MPC in a feedback loop
The main purpose of event-based control, if compared to periodic control, is to minimize data transfer or processing power in networked control systems. Current methods have an (i...
Joris Sijs, Mircea Lazar, W. P. M. H. Heemels
IPSN
2005
Springer
14 years 29 days ago
A scheme for robust distributed sensor fusion based on average consensus
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
Lin Xiao, Stephen P. Boyd, Sanjay Lall