Content deleted Content added
←Created page with 'In the section "The Ncut algorithm" the value "D" is introduced without explanation. Also, none of the "figures" actually occur in the article.' |
Tom.Reding (talk | contribs) m Remove unknown param from WP Robotics: past-selected |
||
| (18 intermediate revisions by 11 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=Stub|
{{WikiProject Robotics|importance=low|attention=no}}
}}
==Ncut==
In the section "The Ncut algorithm" the value "D" is introduced without explanation. Also, none of the "figures" actually occur in the article.
To follow this comment, the "ncut algorithm" section should refer/link to the [[degree_matrix|degree]] and [[adjacency_matrix|adjacency]] matrix of a graph (or even the [[Laplacian_matrix|Laplacian matrix]]) when defining D and W, as well as the [[Algebraic_connectivity|algebraic connectivity]] of the graph when referencing the second smallest eigenvalue. [[Special:Contributions/70.166.151.52|70.166.151.52]] ([[User talk:70.166.151.52|talk]]) 16:42, 15 February 2017 (UTC)
Are arbitrary values allowed for the weights (similarity measures), or are they restricted to some range (non-negative, [0,1], ...)? It seems to me that negative weights can potentially invert the sign of some of the fraction denominators causing semantic havoc. [[User:Mspreitz|Mspreitz]] ([[User talk:Mspreitz|talk]]) 02:40, 11 April 2011 (UTC)
The denominators beg the question of what is on the diagonal of the w matrix. [[User:Mspreitz|Mspreitz]] ([[User talk:Mspreitz|talk]]) 03:21, 11 April 2011 (UTC)
== Rename or merge with Segmentation (image processing) ==
The distinction between this article and [[Segmentation (image processing)]] appears unclear. What about either:
* Renaming this article into "Graph-based image segmentation" (or similar), to highlight the focus on graph-based methods, or ...
* Merge this article with [[Segmentation (image processing)]], since both deals with the same overall topic?
Any comments? --[[User:Orderud|Fredrik Orderud]] ([[User talk:Orderud|talk]]) 20:47, 24 August 2008 (UTC)
== Bipartitioning a graph with the eigenvector ==
How does one "use the eigenvector with the smallest eigenvalue to bipartition the graph"? Is there another article to which we could link that would provide those details? --[[Special:Contributions/76.27.96.159|76.27.96.159]] ([[User talk:76.27.96.159|talk]]) 04:29, 10 December 2008 (UTC)
Shi and Malik, 2000 advice to use the second smallest eigenvector to bipartition the graph <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Cle003|Cle003]] ([[User talk:Cle003|talk]] • [[Special:Contributions/Cle003|contribs]]) 13:43, 4 May 2016 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
== Example ==
Hm, there is no "Figures 1-7"
[[Special:Contributions/129.27.201.116|129.27.201.116]] ([[User talk:129.27.201.116|talk]]) <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|undated]] comment added 09:59, 13 December 2010 (UTC).</span><!--Template:Undated--> <!--Autosigned by SineBot-->
Extention of NCut in 3D for object: Tonny, Z., Laurendeau, D., Giguere, P., Gagne, C., 2014. 3D-NCuts: Adapting Normalized Cuts to 3D Triangulated Surface Segmentation. Computer Graphics Theory and Applications (GRAPP), 2014 International Conference on, 1-9.
Application in transportation network partitionning: Ji, Y., Geroliminis, N., 2012. On the spatial partitioning of urban transportation networks. Transportation Research Part B : Methodological, 46 (10), 1639-1656. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Cle003|Cle003]] ([[User talk:Cle003|talk]] • [[Special:Contributions/Cle003|contribs]]) 13:47, 4 May 2016 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
| |||