READING NOTE: Semantic Object Parsing with Graph LSTM

原创 2016年05月30日 20:34:59

TITLE: Semantic Object Parsing with Graph LSTM

AUTHER: Xiaodan Liang, Xiaohui Shen, Jiashi Feng, Liang Lin, Shuicheng Yan

ASSOCIATION: National University of Singapore, Sun Yat-sen University, Adobe Research

FROM: arXiv:1603.07063


  1. A novel Graph LSTM structure is proposed handle general graph-structured data, which effectively exploits global context by superpixels extracted by over-segmentation.
  2. A confidence-driven scheme is proposed to select the starting node and the order of updating sequences.
  3. In each Graph LSTM unit, different forget gates for the neighboring nodes are learned to dynamically incorporate the local contextual interactions in accordance with their semantic relations.


The main steps of the method is shown in the following figure.

  1. The input image first passes through a stack of convolutional layers to generate the convolutional feature maps.
  2. The convolutional feature maps are further used to generate an initial semantic confidence map for each pixel.
  3. The input image is over-segmented to multiple superpixels. For each superpixel, a feature vector is extracted from the upsampled convolutional feature maps.
  4. The first Graph LSTM takes the feature vector of every superpixel as input to compute a better state.
  5. The second Graph LSTM takes the feature vector of every superpixel and the output of first Graph LSTM as input.
  6. The update sequence of the superpixel is according to the initial confidence of the superpiexels.
  7. several 1×1 convolution filters are employed to produce the final parsing results.

some details

A graph structure is built based on the superpixels. The nodes are the superpixels and the nodes are linked when they are adjacent. The history information used by the G-LSTM for one superpixel come from the adjacent superpixels.


  1. Constructed on superpixels generated by oversegmentation, the Graph LSTM is more naturally aligned with the visual patterns in the image.
  2. Adaptively learning the forget gates with respect to different neighboring nodes when updating the hidden states of a certain node is beneficial to model various neighbor connections.


  • yaoxingfu72
  • yaoxingfu72
  • 2016年07月03日 09:54
  • 5474


对抗网络专题文献集 第一篇论文 [Generative Adversarial Nets](the first paper about it) [Pa...
  • AMDS123
  • AMDS123
  • 2017年04月10日 14:16
  • 9244


Machine Learning 1 Spotlight 1-1A Exclusivity-Consistency Regularized Multi-View Subspace Clusteri...
  • LK274857347
  • LK274857347
  • 2017年08月08日 11:30
  • 6156

READING NOTE: FastMask: Segment Multi-scale Object Candidates in One Shot

TITLE: FastMask: Segment Multi-scale Object Candidates in One Shot
  • joshua_1988
  • joshua_1988
  • 2017年04月18日 21:11
  • 369

Latent semantic analysis note

  • 2011年05月16日 21:45
  • 721KB
  • 下载

Latent semantic analysis note(LSA)

1 LSA Introduction LSA(latent semantic analysis)潜在语义分析,也被称为LSI(latent semantic index),是Scott ...
  • wangran51
  • wangran51
  • 2012年03月29日 18:58
  • 19821

潜在语义分析Latent semantic analysis note(LSA)原理及代码实现

Latent Semantic Analysis (LSA)也被叫做Latent Semantic Indexing(LSI),从字面上的意思理解就是通过分析文档去发现这些文档中潜在的意思和概念。假设...
  • bob007
  • bob007
  • 2014年06月13日 16:40
  • 11541

[Paper note] RefineNet: Multi-Path Refinement Networks for High-Resolution Semantic Segmentation

paper not for RefineNet
  • chn13
  • chn13
  • 2016年12月23日 13:24
  • 1312

Parsing with compositional vector grammars 实现

Parsing with compositional vector grammars 实现本文主要就《parsing with compositional vector grammars》关于这篇论文...
  • u014422406
  • u014422406
  • 2016年09月07日 14:07
  • 179

Parsing JSON With SBJSON

转自: So the previous post focussed on retrieving data from a ...
  • workhardupc100
  • workhardupc100
  • 2011年09月19日 09:05
  • 714
您举报文章:READING NOTE: Semantic Object Parsing with Graph LSTM