Dr. Zheng Han Profile

Dr. Zheng Han

Professor at Chifeng Univ

SPIE Involvement:

Author

Publications (2)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 9 August 2018 Paper

Weakly supervised semantic segmentation using constrained multi-image model and saliency prior

Mingjun Yu, Zheng Han, Pingquan Wang, Xiaoyan Jia

Proc. SPIE. 10806, Tenth International Conference on Digital Image Processing (ICDIP 2018)

KEYWORDS: Image processing algorithms and systems, Data modeling, Image segmentation, Image restoration, Computer science, Data acquisition, Integration, Machine learning, Electronics engineering

Read Abstract +

Building a graph model use the whole training set and solved by graph cut based algorithm is a common method in weak supervision semantic segmentation task, such as Multi-Image Model (MIM). It has two disadvantages: one is the parameter number of model increased rapidly with the scale growth of training set, which limited applied to large-scale data. Another is lack of use structure information in image internal. To solve above problems, we proposed a Constrained Multi-Image Model (CMIM) that training model with a part of the training data which acquired by our entropy based algorithm. It's made up of some components and each is a smaller graph. So, The CMIM can parallel or serial training and weaken the memory limit. To utilize the context information, we bring the saliency of image to unary potential in energy function. At first, we segment images to superpixels and extract the semantic texton forest (STF) feature. Then construct a conditional random fields (CRF) in the superpixel set from selected images. The data potential learned from STF featrue and saliency of superpixels. Finally, the labeling of superpixels converted to CRF optimization problem which can efficiency solved by alpha expansion algorithm. Experiments on the MSRC21 dataset show that the CMIM algorithm achieves accuracy comparable with some previous influential weakly-supervised segmentation algorithms.

Proceedings Article | 21 July 2017 Paper

Weakly supervised semantic segmentation using fore-background priors

Zheng Han, Zhitao Xiao, Mingjun Yu

Proc. SPIE. 10420, Ninth International Conference on Digital Image Processing (ICDIP 2017)

Read Abstract +

Weakly-supervised semantic segmentation is a challenge in the field of computer vision. Most previous works utilize the labels of the whole training set and thereby need the construction of a relationship graph about image labels, thus result in expensive computation. In this study, we tackle this problem from a different perspective. We proposed a novel semantic segmentation algorithm based on background priors, which avoids the construction of a huge graph in whole training dataset. Specifically, a random forest classifier is obtained using weakly supervised training data .Then semantic texton forest (STF) feature is extracted from image superpixels. Finally, a CRF based optimization algorithm is proposed. The unary potential of CRF derived from the outputting probability of random forest classifier and the robust saliency map as background prior. Experiments on the MSRC21 dataset show that the new algorithm outperforms some previous influential weakly-supervised segmentation algorithms. Furthermore, the use of efficient decision forests classifier and parallel computing of saliency map significantly accelerates the implementation.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print format on SPIE.org.

PERSONAL SIGN IN
Full access may be available with your subscription

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Institutional Access:

PURCHASE THIS CONTENT

INTERESTED IN A FREE CORPORATE TRIAL?

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:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years