The properties of graphs can be studied via the algebraic characteristics of its adjacency or Laplacian matrix. The second eigenvector of the graph Laplacian is one very useful tool which provides information as to how to partition a graph. In this thesis, we study spectral clustering and how to apply it in solving the image segmentation problem in computer vision.
Tettey, M (2021). Spectral Partitioning and its Application to Image Segmentation. Afribary. Retrieved from https://tracking.afribary.com/works/spectral-partitioning-and-its-application-to-image-segmentation
Tettey, Michael "Spectral Partitioning and its Application to Image Segmentation" Afribary. Afribary, 15 Apr. 2021, https://tracking.afribary.com/works/spectral-partitioning-and-its-application-to-image-segmentation. Accessed 24 Nov. 2024.
Tettey, Michael . "Spectral Partitioning and its Application to Image Segmentation". Afribary, Afribary, 15 Apr. 2021. Web. 24 Nov. 2024. < https://tracking.afribary.com/works/spectral-partitioning-and-its-application-to-image-segmentation >.
Tettey, Michael . "Spectral Partitioning and its Application to Image Segmentation" Afribary (2021). Accessed November 24, 2024. https://tracking.afribary.com/works/spectral-partitioning-and-its-application-to-image-segmentation