Optimal algorithms for image understanding: Current status and future plans

DOI10.1016/0885-064X(85)90025-1MaRDI QIDQ1071510zbMATH OpenFDO

Authors B. George

Publication date 1985

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0885-064X(85)90025-1

zbMATH Keywords

2 1/2 D sketchcomputational geometryinformation-based complexitynumerical solutionoptical flowshape from shadingthree-dimensional reconstruction from projections

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Analysis of algorithms and problem complexity (68Q25)

Review text

We discuss four image understanding problems: 2 1/2 D sketch, three- dimensional reconstruction from projections, shape from shading, and optical flow. We point out how known general optimality results may be applied to the first three problems. We indicate some preliminary results and work in progress, concerning the numerical solution of all four problems. Algorithms which differ from those currently used in practice are proposed.

Recommendations

• scientific article; zbMATH DE number 46345
• Computer vision. Algorithms and applications
• Determining optical flow
• Group-theoretical methods in image understanding
• An algebraic approach to shape-from-image problems

Cites work

• Determining optical flow
• scientific article; zbMATH DE number 3875916 (Why is no real title available?)
• scientific article; zbMATH DE number 3827201 (Why is no real title available?)
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3720254 (Why is no real title available?)
• scientific article; zbMATH DE number 3337964 (Why is no real title available?)
• scientific article; zbMATH DE number 3378720 (Why is no real title available?)
• Numerical shape from shading and occluding boundaries
• On the Optimal Solution of Large Linear Systems
• Optimal reconstruction of a function from its projections
• The computation of visible-surface representations

Cited in

(9)

• A survey of information-based complexity
• Group-theoretical methods in image understanding
• Certifying smoothness of discrete functions and measuring legitimacy of images
• Monocular extraction of 2.1D sketch using constrained convex optimization
• Estimating the size of a hidden finite set: large-sample behavior of estimators
• Optimization and algebraic techniques for image analysis
• A parallel information-based complexity approach to visual surface reconstruction
• Fast multiplication of a recursive block Toeplitz matrix by a vector and its application
• Mathematical methods in shape-from-shading: A review of recent results

This page was built for publication: Optimal algorithms for image understanding: Current status and future plans

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071510)