Monocular extraction of 2.1D sketch using constrained convex optimization (Q1799939): Difference between revisions

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