Detection of Long Edges on a Computational Budget: A Sublinear Approach
DOI10.1137/140970331zbMath1328.68272OpenAlexW2057141125MaRDI QIDQ5250002
Boaz Nadler, Ery Arias-Castro, Inbal Horev, Ronen Basri, M. Galun
Publication date: 15 May 2015
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140970331
Design of statistical experiments (62K99) Analysis of algorithms (68W40) Parametric hypothesis testing (62F03) Parametric inference under constraints (62F30) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient blind search: optimal power of detection under computational cost constraints
- Geometry-driven diffusion in computer vision
- Fast-Match: fast affine template matching
- Secrets of image denoising cuisine
- Sublinear Time Algorithms
- Gray and color image contrast enhancement by the curvelet transform
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- A New Lower Bound for Multiple Hypothesis Testing
- Fast Calculation of Multiple Line Integrals
- Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling
- Sublinear-time Algorithms
- Computational and statistical tradeoffs via convex relaxation
- Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
- On Information and Sufficiency
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Detection of Long Edges on a Computational Budget: A Sublinear Approach
