Scene Segmentation with Low-Dimensional Semantic Representations and Conditional Random Fields

被引:0
作者
Yang, Wen [1 ]
Triggs, Bill [2 ]
Dai, Dengxin [1 ]
Xia, Gui-Song [3 ]
机构
[1] Wuhan Univ, Sch Elect Informat, Wuhan 430079, Peoples R China
[2] Lab Jean Kuntzmann, AI Team, F-38402 Grenoble, France
[3] TELECOM ParisTech, CNRS LTCI, F-75013 Paris, France
来源
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING | 2010年
关键词
MARKOV RANDOM-FIELDS; ENERGY MINIMIZATION; FEATURE SPACE;
D O I
10.1155/2010/196036
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a fast, precise, and highly scalable semantic segmentation algorithm that incorporates several kinds of local appearance features, example-based spatial layout priors, and neighborhood-level and global contextual information. The method works at the level of image patches. In the first stage, codebook-based local appearance features are regularized and reduced in dimension using latent topic models, combined with spatial pyramid matching based spatial layout features, and fed into logistic regression classifiers to produce an initial patch level labeling. In the second stage, these labels are combined with patch-neighborhood and global aggregate features using either a second layer of Logistic Regression or a Conditional Random Field. Finally, the patch-level results are refined to pixel level using MRF or over-segmentation based methods. The CRF is trained using a fast Maximum Margin approach. Comparative experiments on four multi-class segmentation datasets show that each of the above elements improves the results, leading to a scalable algorithm that is both faster and more accurate than existing patch-level approaches.
引用
收藏
页数:14
相关论文
共 50 条