Optimum cuts in graphs by general fuzzy connectedness with local band constraints (Q2203345): Difference between revisions

@@ Property / DOI @@
-.1007/s10851-020-00953-w
@@ Property / DOI: 10.1007/s10851-020-00953-w / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10851-020-00953-w
+Normal rank
@@ Property / OpenAlex ID @@
+W3013985656
@@ Property / OpenAlex ID: W3013985656 / rank @@
+Normal rank
@@ Property / cites work @@
+The Transitive Reduction of a Directed Graph
@@ Property / cites work: The Transitive Reduction of a Directed Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
+Normal rank
@@ Property / cites work @@
+Path-value functions for which Dijkstra's algorithm returns optimal mapping
+Normal rank
@@ Property / cites work @@
+General theory of fuzzy connectedness segmentations
+Normal rank
@@ Property / cites work @@
+Graph-Based Segmentation with Local Band Constraints
+Normal rank
@@ Property / cites work @@
+Q2902048
@@ Property / cites work: Q2902048 / rank @@
+Normal rank
@@ Property / cites work @@
+Oriented Image Foresting Transform Segmentation by Seed Competition
+Normal rank
@@ Property / cites work @@
+A fast marching level set method for monotonically advancing fronts.
+Normal rank
@@ Property / DOI @@
+.1007/S10851-020-00953-W
@@ Property / DOI: 10.1007/S10851-020-00953-W / rank @@
+Normal rank