Detection of Long Edges on a Computational Budget: A Sublinear Approach

Inbal Horev, Boaz Nadler, Ery Arias-Castro, Meirav Galun, Ronen Basri

Research output: Contribution to journalArticlepeer-review


Edge detection is a challenging, important task in image analysis. Various applications require real-time detection of long edges in large and noisy images, possibly under limited computational resources. While standard edge detection methods are computationally fast, they perform well only at low levels of noise. Modern sophisticated methods, in contrast, are robust to noise, but may be too slow for real-time processing of large images. This raises the following question, which is the focus of our paper: How well can one detect long edges in noisy images under severe computational constraints that allow only a fraction of all image pixels to be processed? We make several theoretical and practical contributions regarding this problem. We develop possibly the first sublinear algorithm to detect long straight edges in noisy images. In addition, we theoretically analyze the inevitable tradeoff between its detection performance and the allowed computational budget. Finally, we demonstrate its competitive performance on both simulated and real images.
Original languageEnglish
Pages (from-to)458-483
Number of pages26
JournalSIAM Journal on Imaging Sciences
Issue number1
Early online date26 Feb 2015
StatePublished - 2015


Dive into the research topics of 'Detection of Long Edges on a Computational Budget: A Sublinear Approach'. Together they form a unique fingerprint.

Cite this