Abstract
This paper proposes an algorithm for interactive image segmentation. The task is formulated as a problem of graph-based transductive classification. Specifically, given an image window, the color of each pixel in it will be reconstructed linearly with those of the remaining pixels in this window. The optimal reconstruction weights will be kept unchanged to linearly reconstruct their class labels. The label reconstruction errors are estimated in each window. These errors are further collected together to develop a learning model. Then, the class information about the user specified foreground and background pixels are integrated into a regularization framework. Under this framework, a globally optimal labeling is finally obtained. The computational complexity is analyzed, and an approach for speeding up the algorithm is presented. Comparative experimental results illustrate the validity of our algorithm.
| Original language | English |
|---|---|
| Article number | 5680971 |
| Pages (from-to) | 342-352 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Multimedia |
| Volume | 13 |
| Issue number | 2 |
| DOIs | |
| State | Published - Apr 2011 |
| Externally published | Yes |
Keywords
- Comparative study
- interactive image segmentation
- multiple linear reconstructions in windows
Fingerprint
Dive into the research topics of 'Interactive image segmentation with multiple linear reconstructions in windows'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver