1 / 31

COLOR TEXTURE SEGMENTATION USING FEATURE DISTRIBUTIONS

COLOR TEXTURE SEGMENTATION USING FEATURE DISTRIBUTIONS. Hexagonal-HSV. Cellular decomposition . ( S,H)={ (0.665, 49.1), (0.665, 169.1), (0.665, 229.1), (0.665,289.1), and (0.665, 349.1) }. Cellular decomposition . V component is divided into 3 parts

cassandra-wooten
Download Presentation

COLOR TEXTURE SEGMENTATION USING FEATURE DISTRIBUTIONS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. COLOR TEXTURE SEGMENTATION USINGFEATURE DISTRIBUTIONS

  2. Hexagonal-HSV

  3. Cellular decomposition (S,H)={ (0.665, 49.1), (0.665, 169.1), (0.665, 229.1), (0.665,289.1), and (0.665, 349.1) }

  4. Cellular decomposition V component is divided into 3 parts with three interval s (0, 0.45), (0.45, 0.75) and (0.75, 1). Thus, the 7 (S, H) pairs and the 3 V values can be combined into 21 initial colors.

  5. Cluster ＊ The Euclidean distances between each pixel and the 21 respective initial color centers are then computed. ＊ Each pixel can then be assigned to one of the 21 initial color clusters whose center has the smallest color distance to the pixel. ＊ The cluster with the largest error is then chosen to perform further splitting

  6. ? This process can be iterated level by level. The repetitive splitting will be stopped when the splitting level reaches 4 or the number of used colors is more than 192. Quantized image

  7. Cluster *the nearest pair of color clusters will be merged until the distance between any two colors are greater than 26. *PSNR value of the quantizatzed image is larger than 30 峰值訊號雜訊比(peak signal to noise ratio: PSNR) *merged until the number of used colors reaches 50

  8. DEFINITION FEATURE Color histogram： distribution of color in a texture Local_edge_pattern histogram ：distribution fo local edge patterns in a texture region

  9. Color histogram hc the color histogram hc for a texture region R using the following equation. where n is the number of pixels with color label i, N is the total number of pixels of the texture region.

  10. Local edge pattern descriptors

  11. Local edge pattern (LEP) he for a texture region R can be derived using the following equation where n is the number of pixels with LEP value i, N is the total number of pixels ofthe texture region.

  12. Homogeneity Measure(color) the more the Hc value approaches to 1 the more alike the color histograms hc and hc ¢

  13. Homogeneity Measure(texture) the more the He value approaches to 1 the more alike the color histograms he and h e ¢

  14. Homogeneity Measure

  15. Segmentation method

  16. Hierarchical splitting a block is split to four subblocks,six pairwise H distance as specified in Eq. (6) between color and LEP histograms of the four subblocks. choose a small value The threshold X was experimentally set to value 1.1.

  17. Agglomerative merging p is the number of pixels in the smaller of the two regions and H is the histogram distance measure as specified in Eq.(7) respective color and LEP histograms are summed to the new image region

  18. Agglomerative merging MImin is the smallest merger importance value of all preceding mergers, MImax is the largest merger importance value of all preceding mergers MIcur is the merger importance for the current best merge.

  19. Pixelwise classification discrete disk with radius r and compute the corresponding color and LEP histograms over the disc v is the number of pixels belonging to the ith region and in the 4-neighboors of the examined point.

  20. Thank you~!!

More Related