Normalized Cuts and Image Segmentation¶
Jianbo Shi, & Malik, J. (2000). Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888-905.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Cut
- Computer networks. Minimum cuts identify the bandwidth bottleneck between source and sink; designing for capacity is raising the small cuts, and reliability analysis locates vulnerability through min-cut variants on the connectivity graph. Image segmentation and vision. The normalized-cut algorithm partitions a pixel-similarity graph by finding a cut whose value, normalized by the sizes of the two parts, is small, placing the segmentation where the image has its real cleavage.
This sourceIntroduces the normalized-cut criterion partitioning a similarity graph by a size-normalized small cut, placing segmentation at real cleavages.
- Computer networks. Minimum cuts identify the bandwidth bottleneck between source and sink; designing for capacity is raising the small cuts, and reliability analysis locates vulnerability through min-cut variants on the connectivity graph. Image segmentation and vision. The normalized-cut algorithm partitions a pixel-similarity graph by finding a cut whose value, normalized by the sizes of the two parts, is small, placing the segmentation where the image has its real cleavage.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:b97818ea22fc · see in the full table