paper-with-me

Papers

Matching-CNN Meets KNN: Quasi-Parametric Human Parsing

2015-04-06 · CVPR 2015 6 · Si Liu, Xiaodan Liang, Luoqi Liu, Xiaohui Shen, Jianchao Yang, Changsheng Xu, Liang Lin, Xiaochun Cao, Shuicheng Yan

Both parametric and non-parametric approaches have demonstrated encouraging performances in the human parsing task, namely segmenting a human image into several semantic regions (e.g., hat, bag, left arm, face). In this work, we aim to develop a new solution with the advantages of both methodologies, namely supervision from annotated data and the flexibility to use newly annotated (possibly uncommon) images, and present a quasi-parametric human parsing model. Under the classic K Nearest Neighbor (KNN)-based nonparametric framework, the parametric Matching Convolutional Neural Network (M-CNN) is proposed to predict the matching confidence and displacements of the best matched region in the testing image for a particular semantic region in one KNN image. Given a testing image, we first retrieve its KNN images from the annotated/manually-parsed human image corpus. Then each semantic region in each KNN image is matched with confidence to the testing image using M-CNN, and the matched regions from all KNN images are further fused, followed by a superpixel smoothing procedure to obtain the ultimate human parsing result. The M-CNN differs from the classic CNN in that the tailored cross image matching filters are introduced to characterize the matching between the testing image and the semantic region of a KNN image. The cross image matching filters are defined at different convolutional layers, each aiming to capture a particular range of displacements. Comprehensive evaluations over a large dataset with 7,700 annotated human images well demonstrate the significant performance gain from the quasi-parametric model over the state-of-the-arts, for the human parsing task.

📄 PDF Abstract BibTeX arXiv:1504.01220

Code (0)

등록된 구현이 없습니다.

Tasks

Human Parsing

Similar Papers 제목 키워드 기반

Quasi-Bayes meets Vines

2024-06-18 · David Huk, Yuanhe Zhang, Mark Steel, Ritabrata Dutta

Recently proposed quasi-Bayesian (QB) methods initiated a new era in Bayesian computation by directly constructing the Bayesian predictive distribution through recursion, removing the need for expensive computations invo…

Density Estimation

Quasi-random sampling for multivariate distributions via generative neural networks

2018-11-01 · Marius Hofert, Avinash Prasad, Mu Zhu

Generative moment matching networks (GMMNs) are introduced for generating quasi-random samples from multivariate models with any underlying copula in order to compute estimates under variance reduction. So far, quasi-ran…

Management

Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs

2017-09-01 · EMNLP 2017 9 · Junjie Cao, Sheng Huang, Weiwei Sun, Xiaojun Wan

We propose a new Maximum Subgraph algorithm for first-order parsing to 1-endpoint-crossing, pagenumber-2 graphs. Our algorithm has two characteristics: (1) it separates the construction for noncrossing edges and crossing…

ARCDependency Parsing

Applications of multivariate quasi-random sampling with neural networks

2020-12-15 · Marius Hofert, Avinash Prasad, Mu Zhu

Generative moment matching networks (GMMNs) are suggested for modeling the cross-sectional dependence between stochastic processes. The stochastic processes considered are geometric Brownian motions and ARMA-GARCH models…

Adaptive Nonparametric Image Parsing

2015-05-07 · Tam V. Nguyen, Can-Yi Lu, Jose Sepulveda, Shuicheng Yan

In this paper, we present an adaptive nonparametric solution to the image parsing task, namely annotating each image pixel with its corresponding category label. For a given test image, first, a locality-aware retrieval …

Retrieval