Image segmentation
- spatial space
- region growing
- watershed
- feature space
- kmeans
- graph based
Min Cuts
NP-complete -> eigen problem to approximate
recursively two-way Ncut
- when eigen value still small
- when inter-group pixels are not very similar (still can be segmented)
simultaneous K-way cut
- iterative merge
- spatial space
- region growing
- watershed
- feature space
- kmeans
- graph based
recursively two-way Ncut
- when eigen value still small
- when inter-group pixels are not very similar (still can be segmented)
simultaneous K-way cut
- iterative merge
訂閱：
文章 (Atom)