m |
|||
| (3 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
Here is an example of a clustering method used for image segmentation. Here the distance criterion used is the absolute value of the distance between the pixel values. Pixels and their neighbors are chosen from a four point neighborhood and then evaluated for their distances. By adjusting the threshold used to connect pixels, different levels of segmentation are achieved. Here are some results for this algorithm using a simple image. | Here is an example of a clustering method used for image segmentation. Here the distance criterion used is the absolute value of the distance between the pixel values. Pixels and their neighbors are chosen from a four point neighborhood and then evaluated for their distances. By adjusting the threshold used to connect pixels, different levels of segmentation are achieved. Here are some results for this algorithm using a simple image. | ||
| − | Original Image: | + | <gallery widths="388px" heights="259px" perrow="2"> |
| + | Image:original.png|Original Image | ||
| + | Image:low.png|Low distance threshold: 27,654 connected sets, 36 shown | ||
| + | Image:med.png|Medium distance threshold: 16,747 connected sets, 41 shown | ||
| + | Image:high.png|High distance threshold: 11,192 connected sets, 23 shown | ||
| + | </gallery> | ||
| − | + | Here we notice that as the threshold is increased, the criteria for merging regions becomes looser and the amount of regions starts to shrink. | |
| − | + | The following link provides a precise definition for this algorithm. [http://cobweb.ecn.purdue.edu/~bouman/grad-labs/lab3/pdf/lab.pdf| Image Segmentation Lab] | |
| − | + | ||
| − | [ | + | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | Image | + | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
Latest revision as of 09:50, 19 April 2008
Here is an example of a clustering method used for image segmentation. Here the distance criterion used is the absolute value of the distance between the pixel values. Pixels and their neighbors are chosen from a four point neighborhood and then evaluated for their distances. By adjusting the threshold used to connect pixels, different levels of segmentation are achieved. Here are some results for this algorithm using a simple image.
- Original.png
Original Image
- Low.png
Low distance threshold: 27,654 connected sets, 36 shown
- Med.png
Medium distance threshold: 16,747 connected sets, 41 shown
- High.png
High distance threshold: 11,192 connected sets, 23 shown
Here we notice that as the threshold is increased, the criteria for merging regions becomes looser and the amount of regions starts to shrink.
The following link provides a precise definition for this algorithm. Image Segmentation Lab
