Detecting curved edges in noisy images in sublinear time
From MaRDI portal
Publication:1703998
DOI10.1007/s10851-016-0689-xzbMath1391.94106OpenAlexW2556682805MaRDI QIDQ1703998
Boaz Nadler, Alain Trouvé, Yali Amit, Yi-Qing Wang
Publication date: 8 March 2018
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-016-0689-x
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Unnamed Item
- Regularized Laplacian zero crossings as optimal edge integrators
- Adaptive estimation of a quadratic functional by model selection.
- Fast-Match: fast affine template matching
- Networks of polynomial pieces with application to the analysis of point clouds and images
- Randomized or probabilistic Hough transform: unified performance evaluation
- Secrets of image denoising cuisine
- Sublinear Time Algorithms
- Fast Calculation of Multiple Line Integrals
- Alternatives to the Median Absolute Deviation
- A new curve detection method: Randomized Hough transform (RHT)
- Detection of Long Edges on a Computational Budget: A Sublinear Approach
- Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Edge detection by Helmholtz principle
This page was built for publication: Detecting curved edges in noisy images in sublinear time
