Learning CRFs for Image Parsing with Adaptive Subgradient Descent
Abstract
We propose an adaptive subgradient descent method to efficiently learn the parameters of CRF models for image parsing. To balance the learning efficiency and performance of the learned CRF models, the parameter learning is iteratively carried out by solving a convex optimization problem in each iteration, which integrates a proximal term to preserve the previously learned information and the large margin preference to distinguish bad labeling and the ground truth labeling. A solution of subgradient descent updating form is derived for the convex optimization problem, with an adaptively determined updating step-size. Besides, to deal with partially labeled training data, we propose a new objective constraint modeling both the labeled and unlabeled parts in the partially labeled training data for the parameter learning of CRF models. The superior learning efficiency of the proposed method is verified by the experiment results on two public datasets. We also demonstrate the powerfulness of our method for handling partially labeled training data.
Cite
Text
Zhang et al. "Learning CRFs for Image Parsing with Adaptive Subgradient Descent." International Conference on Computer Vision, 2013. doi:10.1109/ICCV.2013.382Markdown
[Zhang et al. "Learning CRFs for Image Parsing with Adaptive Subgradient Descent." International Conference on Computer Vision, 2013.](https://mlanthology.org/iccv/2013/zhang2013iccv-learning/) doi:10.1109/ICCV.2013.382BibTeX
@inproceedings{zhang2013iccv-learning,
title = {{Learning CRFs for Image Parsing with Adaptive Subgradient Descent}},
author = {Zhang, Honghui and Wang, Jingdong and Tan, Ping and Wang, Jinglu and Quan, Long},
booktitle = {International Conference on Computer Vision},
year = {2013},
doi = {10.1109/ICCV.2013.382},
url = {https://mlanthology.org/iccv/2013/zhang2013iccv-learning/}
}