Local spectral method to seeded image cosegmentation

Qinghua Liang; Zhenjiang Miao

doi:10.1117/1.JEI.23.2.023018

Abstract

The cosegmentation problem is referred to as segmenting the same or similar objects simultaneously from a group of images. However, designing a robust and efficient cosegmentation algorithm is a challenging work because of the variety and complexity of the object and the background. We proposed a new seeded image cosegmentation method based on a local spectral method, which combines bottom-up information and seeds’ knowledge effectively for segmentation. Multiple images are connected into a weighted undirected graph so the cosegmentation problem is converted into a graph partitioning problem that is solved by biased normalized cuts. The results of the cosegmentation experiment reveal that the proposed method performs well even in the presence of some noise images (images not containing a common object) or in the condition of the image set containing more than one object.

Citation Download Citation

Qinghua Liang, Qinghua Liang, Zhenjiang Miao, Zhenjiang Miao, } "Local spectral method to seeded image cosegmentation," Journal of Electronic Imaging 23(2), 023018 (9 April 2014). https://doi.org/10.1117/1.JEI.23.2.023018 . Submission:

ACCESS THE FULL ARTICLE

PERSONAL SIGN IN
Full access may be available with your subscription

Email or Username Forgot your username?

Password Forgot your password?

Show

Remember Email/Username on this computer

Remember Password

No SPIE account? Create an account
or Institutional Sign In via Shibboleth

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $20.00

Non-members: $25.00 ADD TO CART

Show All Keywords

Keywords/Phrases

Search In:

Publication Years