Segmentation-based object categorization

The image segmentation problem is concerned with partitioning an image into multiple regions according to some homogeneity criterion. This article is primarily concerned with graph theoretic approaches to image segmentation. Segmentation-based object categorization can be viewed as a specific case of spectral clustering applied to image segmentation. The image segmentation problem is concerned with partitioning an image into multiple regions according to some homogeneity criterion. This article is primarily concerned with graph theoretic approaches to image segmentation. Segmentation-based object categorization can be viewed as a specific case of spectral clustering applied to image segmentation. The set of points in an arbitrary feature space can be represented as a weighted undirected complete graph G = (V, E), where the nodes of the graph are the points in the feature space. The weight w i j {displaystyle w_{ij}} of an edge ( i , j ) ∈ E {displaystyle (i,j)in E} is a function of the similarity between the nodes i {displaystyle i} and j {displaystyle j} . In this context, we can formulate the image segmentation problem as a graph partitioning problem that asks for a partition V 1 , ⋯ , V k {displaystyle V_{1},cdots ,V_{k}} of the vertex set V {displaystyle V} , where, according to some measure, the vertices in any set V i {displaystyle V_{i}} have high similarity, and the vertices in two different sets V i , V j {displaystyle V_{i},V_{j}} have low similarity. Let G = (V, E, w) be a weighted graph. Let A {displaystyle A} and B {displaystyle B} be two subsets of vertices.