Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICCV.2013.423
DC Field | Value | |
---|---|---|
dc.title | A deformable mixture parsing model with parselets | |
dc.contributor.author | Dong, J. | |
dc.contributor.author | Chen, Q. | |
dc.contributor.author | Xia, W. | |
dc.contributor.author | Huang, Z. | |
dc.contributor.author | Yan, S. | |
dc.date.accessioned | 2014-10-07T04:40:12Z | |
dc.date.available | 2014-10-07T04:40:12Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Dong, J., Chen, Q., Xia, W., Huang, Z., Yan, S. (2013). A deformable mixture parsing model with parselets. Proceedings of the IEEE International Conference on Computer Vision : 3408-3415. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCV.2013.423 | |
dc.identifier.isbn | 9781479928392 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/83345 | |
dc.description.abstract | In this work, we address the problem of human parsing, namely partitioning the human body into semantic regions, by using the novel Parse let representation. Previous works often consider solving the problem of human pose estimation as the prerequisite of human parsing. We argue that these approaches cannot obtain optimal pixel level parsing due to the inconsistent targets between these tasks. In this paper, we propose to use Parse lets as the building blocks of our parsing model. Parse lets are a group of parsable segments which can generally be obtained by low-level over-segmentation algorithms and bear strong semantic meaning. We then build a Deformable Mixture Parsing Model~(DMPM) for human parsing to simultaneously handle the deformation and multi-modalities of Parse lets. The proposed model has two unique characteristics: (1) the possible numerous modalities of Parse let ensembles are exhibited as the "And-Or' structure of sub-trees, (2) to further solve the practical problem of Parse let occlusion or absence, we directly model the visibility property at some leaf nodes. The DMPM thus directly solves the problem of human parsing by searching for the best graph configuration from a pool of Parse let hypotheses without intermediate tasks. Comprehensive evaluations demonstrate the encouraging performance of the proposed approach. © 2013 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICCV.2013.423 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/ICCV.2013.423 | |
dc.description.sourcetitle | Proceedings of the IEEE International Conference on Computer Vision | |
dc.description.page | 3408-3415 | |
dc.description.coden | PICVE | |
dc.identifier.isiut | 000351830500426 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
SCOPUSTM
Citations
67
checked on Mar 24, 2023
WEB OF SCIENCETM
Citations
37
checked on Mar 16, 2023
Page view(s)
210
checked on Mar 16, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.