Monocular extraction of 2.1D sketch using constrained convex optimization

DOI10.1007/s11263-014-0752-2zbMath1398.68632OpenAlexW2058044859MaRDI QIDQ1799939

Siavash Yousefi, Mohamed R. Amer, Sinisa Todorovic, Raviv Raich

Publication date: 19 October 2018

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-014-0752-2

zbMATH Keywords

image segmentationconvex quadratic optimization2.1D sketchfigure-ground assignment

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10)

Related Items

Recovering relative depth from low-level features without explicit T-junction detection and interpretation, Image segmentation with depth information via simplified variational level set formulation, Shearlets as feature extractor for semantic edge detection: the model-based and data-driven realm, Monocular extraction of 2.1D sketch using constrained convex optimization

Uses Software

• BSDS
• Make3D

Cites Work

• Unnamed Item
• Unnamed Item
• Recovering occlusion boundaries from an image
• Segmentation with depth but without detecting junctions
• Monocular extraction of 2.1D sketch using constrained convex optimization
• On learning conditional random fields for stereo
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• Sparse Reconstruction by Separable Approximation
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Ranking Tournaments