A novel iterative shape from focus algorithm based on combinatorial optimization
From MaRDI portal
Publication:991937
DOI10.1016/J.PATCOG.2010.05.029zbMATH Open1213.68548OpenAlexW2001389398MaRDI QIDQ991937FDOQ991937
Authors: Seong-O Shim, Tae-Sun Choi 
Publication date: 8 September 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.05.029
Recommendations
Cites Work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of very large-scale neighborhood search techniques
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Consideration of illumination effects and optimization of window size for accurate calculation of depth map for 3D shape recovery
- Combinatorial optimization. Theory and algorithms.
- Shape from focus using multilayer feedforward neural networks
- A novel algorithm for estimation of depth map using image focus for 3D shape recovery in the presence of noise
Cited In (7)
- Microscopic shape from focus using a projected illumination pattern
- Pixel-wise parallel calculation for depth from focus with adaptive focus measure
- Analysis of focus measure operators for shape-from-focus
- A novel algorithm for estimation of depth map using image focus for 3D shape recovery in the presence of noise
- Consideration of illumination effects and optimization of window size for accurate calculation of depth map for 3D shape recovery
- Thin structures retrieval using anisotropic neighborhoods of superpixels: application to shape-from-focus
- 3D shape recovery by aggregating 3D wavelet transform-based image focus volumes through 3D weighted least squares
This page was built for publication: A novel iterative shape from focus algorithm based on combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991937)
