Split and merge segmentation
Split and merge segmentation is an image processing technique used to segment an image.
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Split and merge segmentation is an image processing technique used to segment an image. The image is successively split into quadrants based on a homogeneity criterion and similar regions are merged to create the segmented result. The technique incorporates a quadtree data structure, meaning that there is a parent-child node relationship.
The total region is a parent, and each of the four splits is a child. \sigma^2 = (1/(N-1))\sum_{(r,c)\epsilon R}[I(r,c)-\bar{I}] ^2 where r and c are row and column, N is the number of pixels in the region and \bar{I}=(1/N)\sum_{(r,c)\epsilon Region}I(r,c) An example incorporation would be that the variance of a region be less than a specified value in order to be considered homogeneous.
Remarks
Split-and-merge segmentation is based on a quadtree partition of an image. It is sometimes called quadtree segmentation. This method was formally described by S.L. Horowitz and T. Pavlidis in 1974 . When a special data structure is involved in the implementation of the algorithm of the method, its time complexity can reach O(n\log n) , an optimal algorithm of the method.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1373078487 under CC BY-SA 4.0; modifications have been made.