Question: Figure 2 . The weighted undirected graph for Q 2 . 1 ) Partition the graph into two sub - graphs so that the cut

Figure 2. The weighted undirected graph for Q2.
1) Partition the graph into two sub-graphs so that the cut cost is minimum. Determine the sets of nodes belonging to the two subgraphs, respectively.
(4 marks)
2) Determine the Laplacian matrix for the graph.
(4 marks)
3) If the normalized graph cut (Ncut) method is used to partition this graph into two subgraphs, determine the sets of nodes belonging to the two subgraphs, respectively. (Hint: You may use the Matlab function "eig" to solve the generalized eigenvalue decomposition problem after you determine the matrices "\(\boldsymbol{L}\)" and "\(\boldsymbol{D}\)" as specified in the lecture notes).
(4 marks)
4) With the partition in Q2-3), obtain the cut cost and the normalized cut value.
(4 marks) Q2: Graph Cut (16 marks)
Figure 2 shows a weighted undirected graph \( G(V, E)\) with the set of vertices denoted as \( V \) and the set of edges denoted as \( E \). The weights of the edges are marked in the figure. Q2: Graph Cut (16 marks)
Figure 2 shows a weighted undirected graph \( G(V, E)\) with the set of vertices denoted as \( V \) and the set of edges denoted as \( E \). The weights of the edges are marked in the figure. Figure 2. The weighted undirected graph for Q2.
1) Partition the graph into two sub-graphs so that the cut cost is minimum. Determine the sets of nodes belonging to the two subgraphs, respectively.
(4 marks)
2) Determine the Laplacian matrix for the graph.
(4 marks)
3) If the normalized graph cut (Ncut) method is used to partition this graph into two subgraphs, determine the sets of nodes belonging to the two subgraphs, respectively. (Hint: You may use the Matlab function "eig" to solve the generalized eigenvalue decomposition problem after you determine the matrices "\(\boldsymbol{L}\)" and "\(\boldsymbol{D}\)" as specified in the lecture notes).
(4 marks)
4) With the partition in Q2-3), obtain the cut cost and the normalized cut value.
(4 marks)
Figure 2 . The weighted undirected graph for Q 2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!