Loading…

Modeling and inferring 2.1D sketch with mixed Markov random field

This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework.Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic r...

Full description

Saved in:
Bibliographic Details
Published in:Journal of systems engineering and electronics 2017-04, Vol.28 (2), p.361-373
Main Authors: Anlong Ming, Yu Zhou, Tianfu Wu
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 373
container_issue 2
container_start_page 361
container_title Journal of systems engineering and electronics
container_volume 28
creator Anlong Ming
Yu Zhou
Tianfu Wu
description This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework.Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic regions and 3-degree junctions (such as T or arrow junctions), and the 2.1D sketch layer. There are two types of vertices in the graphical representation of the 2D entities: (i) regions, which act as the vertices found in traditional MRF, and (ii) address variables assigned to the terminators decomposed from the 3-degree junctions, which are a new type of vertices for the mixed MRF. We formulate the inference problem as computing the 2.1D sketch from the 2D graphical representation under the Bayesian framework, which consists of two components: (i) region layering/coloring based on the Swendsen-Wang cuts algorithm, which infers partial occluding order of regions, and (ii) address variable assignments based on Gibbs sampling, which completes the open bonds of the terminators of the 3-degree junctions. The proposed method is tested on the D-Order dataset, the Berkeley segmentation dataset and the Stanford 3D dataset. The experimental results show the efficiency and robustness of our approach.
doi_str_mv 10.21629/JSEE.2017.02.17
format article
fullrecord <record><control><sourceid>wanfang_jour_cross</sourceid><recordid>TN_cdi_wanfang_journals_xtgcydzjs_e201702017</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>7000178561</cqvip_id><wanfj_id>xtgcydzjs_e201702017</wanfj_id><sourcerecordid>xtgcydzjs_e201702017</sourcerecordid><originalsourceid>FETCH-LOGICAL-c261t-90607f2d5ce5dbd4904425bb93b7e42c8ab327635834186cb8d84eeaed6fbb453</originalsourceid><addsrcrecordid>eNo9kD1PwzAQhj2ARFW6M1piJeHsOHEyVqVQUCsGYLb8maYfCdiBtvx6krbCw1knPc-d7kXohkBMSUaL-5e36TSmQHgMNCb8Ag0IAIsYSegVGoWwgv5xoBQGaLxojN1UdYllbXBVO-t933XmAw5r2-ol3lXtEm-rvTV4If26-cG-g5stdpXdmGt06eQm2NH5H6KPx-n7ZBbNX5-eJ-N5pGlG2qiADLijJtU2NcqwAhijqVJForhlVOdSJZRnSZonjOSZVrnJmbXSmswpxdJkiO5Oc3eydrIuxar59nW3UezbUh_M7yoI258NfelwOOHaNyF468Snr7bSHwQBcQxK9EGJHhZAxVG5PSvLpi6_uhj-Hd4lRnieZiT5A5dQZ_M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Modeling and inferring 2.1D sketch with mixed Markov random field</title><source>IEEE Xplore All Journals</source><creator>Anlong Ming;Yu Zhou;Tianfu Wu</creator><creatorcontrib>Anlong Ming;Yu Zhou;Tianfu Wu</creatorcontrib><description>This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework.Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic regions and 3-degree junctions (such as T or arrow junctions), and the 2.1D sketch layer. There are two types of vertices in the graphical representation of the 2D entities: (i) regions, which act as the vertices found in traditional MRF, and (ii) address variables assigned to the terminators decomposed from the 3-degree junctions, which are a new type of vertices for the mixed MRF. We formulate the inference problem as computing the 2.1D sketch from the 2D graphical representation under the Bayesian framework, which consists of two components: (i) region layering/coloring based on the Swendsen-Wang cuts algorithm, which infers partial occluding order of regions, and (ii) address variable assignments based on Gibbs sampling, which completes the open bonds of the terminators of the 3-degree junctions. The proposed method is tested on the D-Order dataset, the Berkeley segmentation dataset and the Stanford 3D dataset. The experimental results show the efficiency and robustness of our approach.</description><identifier>ISSN: 1004-4132</identifier><identifier>DOI: 10.21629/JSEE.2017.02.17</identifier><language>eng</language><publisher>School of Computer, Beijing University of Posts&amp;Telecommunications, Beijing 100876, China</publisher><subject>2.1D ; completion;mixed ; contour ; cuts;Gibbs ; field ; layered ; Markov ; MRF ; random ; representation ; sampling ; sketch ; Swendsen-Wang</subject><ispartof>Journal of systems engineering and electronics, 2017-04, Vol.28 (2), p.361-373</ispartof><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/85918X/85918X.jpg</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Anlong Ming;Yu Zhou;Tianfu Wu</creatorcontrib><title>Modeling and inferring 2.1D sketch with mixed Markov random field</title><title>Journal of systems engineering and electronics</title><addtitle>Journal of Systems Engineering and Electronics</addtitle><description>This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework.Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic regions and 3-degree junctions (such as T or arrow junctions), and the 2.1D sketch layer. There are two types of vertices in the graphical representation of the 2D entities: (i) regions, which act as the vertices found in traditional MRF, and (ii) address variables assigned to the terminators decomposed from the 3-degree junctions, which are a new type of vertices for the mixed MRF. We formulate the inference problem as computing the 2.1D sketch from the 2D graphical representation under the Bayesian framework, which consists of two components: (i) region layering/coloring based on the Swendsen-Wang cuts algorithm, which infers partial occluding order of regions, and (ii) address variable assignments based on Gibbs sampling, which completes the open bonds of the terminators of the 3-degree junctions. The proposed method is tested on the D-Order dataset, the Berkeley segmentation dataset and the Stanford 3D dataset. The experimental results show the efficiency and robustness of our approach.</description><subject>2.1D</subject><subject>completion;mixed</subject><subject>contour</subject><subject>cuts;Gibbs</subject><subject>field</subject><subject>layered</subject><subject>Markov</subject><subject>MRF</subject><subject>random</subject><subject>representation</subject><subject>sampling</subject><subject>sketch</subject><subject>Swendsen-Wang</subject><issn>1004-4132</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNo9kD1PwzAQhj2ARFW6M1piJeHsOHEyVqVQUCsGYLb8maYfCdiBtvx6krbCw1knPc-d7kXohkBMSUaL-5e36TSmQHgMNCb8Ag0IAIsYSegVGoWwgv5xoBQGaLxojN1UdYllbXBVO-t933XmAw5r2-ol3lXtEm-rvTV4If26-cG-g5stdpXdmGt06eQm2NH5H6KPx-n7ZBbNX5-eJ-N5pGlG2qiADLijJtU2NcqwAhijqVJForhlVOdSJZRnSZonjOSZVrnJmbXSmswpxdJkiO5Oc3eydrIuxar59nW3UezbUh_M7yoI258NfelwOOHaNyF468Snr7bSHwQBcQxK9EGJHhZAxVG5PSvLpi6_uhj-Hd4lRnieZiT5A5dQZ_M</recordid><startdate>20170401</startdate><enddate>20170401</enddate><creator>Anlong Ming;Yu Zhou;Tianfu Wu</creator><general>School of Computer, Beijing University of Posts&amp;Telecommunications, Beijing 100876, China</general><general>Institute of Sensing Technology and Business (Wuxi), Beijing University of Posts&amp;Telecommunications, Beijing 100876, China%Department of Statistics, University of California, Los Angeles 90095, USA</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>20170401</creationdate><title>Modeling and inferring 2.1D sketch with mixed Markov random field</title><author>Anlong Ming;Yu Zhou;Tianfu Wu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c261t-90607f2d5ce5dbd4904425bb93b7e42c8ab327635834186cb8d84eeaed6fbb453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>2.1D</topic><topic>completion;mixed</topic><topic>contour</topic><topic>cuts;Gibbs</topic><topic>field</topic><topic>layered</topic><topic>Markov</topic><topic>MRF</topic><topic>random</topic><topic>representation</topic><topic>sampling</topic><topic>sketch</topic><topic>Swendsen-Wang</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Anlong Ming;Yu Zhou;Tianfu Wu</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of systems engineering and electronics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Anlong Ming;Yu Zhou;Tianfu Wu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Modeling and inferring 2.1D sketch with mixed Markov random field</atitle><jtitle>Journal of systems engineering and electronics</jtitle><addtitle>Journal of Systems Engineering and Electronics</addtitle><date>2017-04-01</date><risdate>2017</risdate><volume>28</volume><issue>2</issue><spage>361</spage><epage>373</epage><pages>361-373</pages><issn>1004-4132</issn><abstract>This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework.Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic regions and 3-degree junctions (such as T or arrow junctions), and the 2.1D sketch layer. There are two types of vertices in the graphical representation of the 2D entities: (i) regions, which act as the vertices found in traditional MRF, and (ii) address variables assigned to the terminators decomposed from the 3-degree junctions, which are a new type of vertices for the mixed MRF. We formulate the inference problem as computing the 2.1D sketch from the 2D graphical representation under the Bayesian framework, which consists of two components: (i) region layering/coloring based on the Swendsen-Wang cuts algorithm, which infers partial occluding order of regions, and (ii) address variable assignments based on Gibbs sampling, which completes the open bonds of the terminators of the 3-degree junctions. The proposed method is tested on the D-Order dataset, the Berkeley segmentation dataset and the Stanford 3D dataset. The experimental results show the efficiency and robustness of our approach.</abstract><pub>School of Computer, Beijing University of Posts&amp;Telecommunications, Beijing 100876, China</pub><doi>10.21629/JSEE.2017.02.17</doi><tpages>13</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1004-4132
ispartof Journal of systems engineering and electronics, 2017-04, Vol.28 (2), p.361-373
issn 1004-4132
language eng
recordid cdi_wanfang_journals_xtgcydzjs_e201702017
source IEEE Xplore All Journals
subjects 2.1D
completion
mixed
contour
cuts
Gibbs
field
layered
Markov
MRF
random
representation
sampling
sketch
Swendsen-Wang
title Modeling and inferring 2.1D sketch with mixed Markov random field
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T20%3A51%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Modeling%20and%20inferring%202.1D%20sketch%20with%20mixed%20Markov%20random%20field&rft.jtitle=Journal%20of%20systems%20engineering%20and%20electronics&rft.au=Anlong%20Ming;Yu%20Zhou;Tianfu%20Wu&rft.date=2017-04-01&rft.volume=28&rft.issue=2&rft.spage=361&rft.epage=373&rft.pages=361-373&rft.issn=1004-4132&rft_id=info:doi/10.21629/JSEE.2017.02.17&rft_dat=%3Cwanfang_jour_cross%3Extgcydzjs_e201702017%3C/wanfang_jour_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c261t-90607f2d5ce5dbd4904425bb93b7e42c8ab327635834186cb8d84eeaed6fbb453%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=7000178561&rft_wanfj_id=xtgcydzjs_e201702017&rfr_iscdi=true