Fast depth estimation using semi-global matching and adaptive stripe-based optimization

Depth estimation is one of the essential components in many computer vision applications such as 3D scene reconstruction and stereo-based object detection. In such applications, the overall quality of the system highly depends on the quality of depth maps. Recently, several depth estimation methods...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of supercomputing 2018-08, Vol.74 (8), p.3666-3684
Hauptverfasser: Loghman, Maziar, Kim, Joohee, Choi, Kyuwon
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 3684
container_issue 8
container_start_page 3666
container_title The Journal of supercomputing
container_volume 74
creator Loghman, Maziar
Kim, Joohee
Choi, Kyuwon
description Depth estimation is one of the essential components in many computer vision applications such as 3D scene reconstruction and stereo-based object detection. In such applications, the overall quality of the system highly depends on the quality of depth maps. Recently, several depth estimation methods based on semi-global matching (SGM) have been proposed because SGM provides a good trade-off between runtime and accuracy in depth estimation. In addition, non-parametric matching costs have drawn a lot of attention because they tolerate all radiometric distortions. In this paper, a depth estimation method based on the Census transform with adaptive window patterns and stripe-based optimization has been proposed. For finding the most accurate depth value, adaptive length optimization paths via multiple stripes are used. A modified cross-based cost aggregation technique is proposed which adaptively creates the shape of the cross for each pixel distinctly. In addition, a depth refinement algorithm is proposed which fills the holes of the estimated depth map using the surrounding background depth pixels and sharpens the object boundaries by applying a trilateral filter to the generated depth map. The trilateral filter uses the curvature of pixels as well as texture and depth information to sharpen the edges. Simulation results indicate that the proposed methods enhance the quality of depth maps while reducing the computational complexity compared to the existing SGM-based depth estimation methods.
doi_str_mv 10.1007/s11227-016-1884-7
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2088796032</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2088796032</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-d264ed48e2b48606ac7cab78bc3d78e01884cc1661def64d51cf0940e0ac506c3</originalsourceid><addsrcrecordid>eNp1UMtKAzEUDaJgrX6Au4Dr6M1jknQpxRcU3CguQybJtFPamTFJBf16M47gytWFc8-DcxC6pHBNAdRNopQxRYBKQrUWRB2hGa0UJyC0OEYzWDAguhLsFJ2ltAUAwRWfobd7mzL2YcgbHFJu9za3fYcPqe3WOIV9S9a7vrY7XB5uM4K289h6O-T2I-CUYzsEUtsUPO4Ltm-_fhzO0Uljdylc_N45er2_e1k-ktXzw9PydkUcpzITz6QIXujAaqElSOuUs7XSteNe6QBjF-eolNSHRgpfUdfAQkAA6yqQjs_R1eQ7xP79UBqYbX-IXYk0DLRWCwmcFRadWC72KcXQmCGWqvHTUDDjfmbaz5T9zJhpVNGwSZMKt1uH-Of8v-gbeQlz6w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2088796032</pqid></control><display><type>article</type><title>Fast depth estimation using semi-global matching and adaptive stripe-based optimization</title><source>SpringerLink Journals - AutoHoldings</source><creator>Loghman, Maziar ; Kim, Joohee ; Choi, Kyuwon</creator><creatorcontrib>Loghman, Maziar ; Kim, Joohee ; Choi, Kyuwon</creatorcontrib><description>Depth estimation is one of the essential components in many computer vision applications such as 3D scene reconstruction and stereo-based object detection. In such applications, the overall quality of the system highly depends on the quality of depth maps. Recently, several depth estimation methods based on semi-global matching (SGM) have been proposed because SGM provides a good trade-off between runtime and accuracy in depth estimation. In addition, non-parametric matching costs have drawn a lot of attention because they tolerate all radiometric distortions. In this paper, a depth estimation method based on the Census transform with adaptive window patterns and stripe-based optimization has been proposed. For finding the most accurate depth value, adaptive length optimization paths via multiple stripes are used. A modified cross-based cost aggregation technique is proposed which adaptively creates the shape of the cross for each pixel distinctly. In addition, a depth refinement algorithm is proposed which fills the holes of the estimated depth map using the surrounding background depth pixels and sharpens the object boundaries by applying a trilateral filter to the generated depth map. The trilateral filter uses the curvature of pixels as well as texture and depth information to sharpen the edges. Simulation results indicate that the proposed methods enhance the quality of depth maps while reducing the computational complexity compared to the existing SGM-based depth estimation methods.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-016-1884-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Compilers ; Computer Science ; Computer simulation ; Computer vision ; Curvature ; Image reconstruction ; Interpreters ; Matching ; Object recognition ; Optimization ; Pixels ; Processor Architectures ; Programming Languages</subject><ispartof>The Journal of supercomputing, 2018-08, Vol.74 (8), p.3666-3684</ispartof><rights>Springer Science+Business Media New York 2016</rights><rights>Copyright Springer Science &amp; Business Media 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-d264ed48e2b48606ac7cab78bc3d78e01884cc1661def64d51cf0940e0ac506c3</citedby><cites>FETCH-LOGICAL-c316t-d264ed48e2b48606ac7cab78bc3d78e01884cc1661def64d51cf0940e0ac506c3</cites><orcidid>0000-0001-8833-0319</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11227-016-1884-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11227-016-1884-7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Loghman, Maziar</creatorcontrib><creatorcontrib>Kim, Joohee</creatorcontrib><creatorcontrib>Choi, Kyuwon</creatorcontrib><title>Fast depth estimation using semi-global matching and adaptive stripe-based optimization</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>Depth estimation is one of the essential components in many computer vision applications such as 3D scene reconstruction and stereo-based object detection. In such applications, the overall quality of the system highly depends on the quality of depth maps. Recently, several depth estimation methods based on semi-global matching (SGM) have been proposed because SGM provides a good trade-off between runtime and accuracy in depth estimation. In addition, non-parametric matching costs have drawn a lot of attention because they tolerate all radiometric distortions. In this paper, a depth estimation method based on the Census transform with adaptive window patterns and stripe-based optimization has been proposed. For finding the most accurate depth value, adaptive length optimization paths via multiple stripes are used. A modified cross-based cost aggregation technique is proposed which adaptively creates the shape of the cross for each pixel distinctly. In addition, a depth refinement algorithm is proposed which fills the holes of the estimated depth map using the surrounding background depth pixels and sharpens the object boundaries by applying a trilateral filter to the generated depth map. The trilateral filter uses the curvature of pixels as well as texture and depth information to sharpen the edges. Simulation results indicate that the proposed methods enhance the quality of depth maps while reducing the computational complexity compared to the existing SGM-based depth estimation methods.</description><subject>Compilers</subject><subject>Computer Science</subject><subject>Computer simulation</subject><subject>Computer vision</subject><subject>Curvature</subject><subject>Image reconstruction</subject><subject>Interpreters</subject><subject>Matching</subject><subject>Object recognition</subject><subject>Optimization</subject><subject>Pixels</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp1UMtKAzEUDaJgrX6Au4Dr6M1jknQpxRcU3CguQybJtFPamTFJBf16M47gytWFc8-DcxC6pHBNAdRNopQxRYBKQrUWRB2hGa0UJyC0OEYzWDAguhLsFJ2ltAUAwRWfobd7mzL2YcgbHFJu9za3fYcPqe3WOIV9S9a7vrY7XB5uM4K289h6O-T2I-CUYzsEUtsUPO4Ltm-_fhzO0Uljdylc_N45er2_e1k-ktXzw9PydkUcpzITz6QIXujAaqElSOuUs7XSteNe6QBjF-eolNSHRgpfUdfAQkAA6yqQjs_R1eQ7xP79UBqYbX-IXYk0DLRWCwmcFRadWC72KcXQmCGWqvHTUDDjfmbaz5T9zJhpVNGwSZMKt1uH-Of8v-gbeQlz6w</recordid><startdate>20180801</startdate><enddate>20180801</enddate><creator>Loghman, Maziar</creator><creator>Kim, Joohee</creator><creator>Choi, Kyuwon</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-8833-0319</orcidid></search><sort><creationdate>20180801</creationdate><title>Fast depth estimation using semi-global matching and adaptive stripe-based optimization</title><author>Loghman, Maziar ; Kim, Joohee ; Choi, Kyuwon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-d264ed48e2b48606ac7cab78bc3d78e01884cc1661def64d51cf0940e0ac506c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Compilers</topic><topic>Computer Science</topic><topic>Computer simulation</topic><topic>Computer vision</topic><topic>Curvature</topic><topic>Image reconstruction</topic><topic>Interpreters</topic><topic>Matching</topic><topic>Object recognition</topic><topic>Optimization</topic><topic>Pixels</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Loghman, Maziar</creatorcontrib><creatorcontrib>Kim, Joohee</creatorcontrib><creatorcontrib>Choi, Kyuwon</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Loghman, Maziar</au><au>Kim, Joohee</au><au>Choi, Kyuwon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast depth estimation using semi-global matching and adaptive stripe-based optimization</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2018-08-01</date><risdate>2018</risdate><volume>74</volume><issue>8</issue><spage>3666</spage><epage>3684</epage><pages>3666-3684</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>Depth estimation is one of the essential components in many computer vision applications such as 3D scene reconstruction and stereo-based object detection. In such applications, the overall quality of the system highly depends on the quality of depth maps. Recently, several depth estimation methods based on semi-global matching (SGM) have been proposed because SGM provides a good trade-off between runtime and accuracy in depth estimation. In addition, non-parametric matching costs have drawn a lot of attention because they tolerate all radiometric distortions. In this paper, a depth estimation method based on the Census transform with adaptive window patterns and stripe-based optimization has been proposed. For finding the most accurate depth value, adaptive length optimization paths via multiple stripes are used. A modified cross-based cost aggregation technique is proposed which adaptively creates the shape of the cross for each pixel distinctly. In addition, a depth refinement algorithm is proposed which fills the holes of the estimated depth map using the surrounding background depth pixels and sharpens the object boundaries by applying a trilateral filter to the generated depth map. The trilateral filter uses the curvature of pixels as well as texture and depth information to sharpen the edges. Simulation results indicate that the proposed methods enhance the quality of depth maps while reducing the computational complexity compared to the existing SGM-based depth estimation methods.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-016-1884-7</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0001-8833-0319</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0920-8542
ispartof The Journal of supercomputing, 2018-08, Vol.74 (8), p.3666-3684
issn 0920-8542
1573-0484
language eng
recordid cdi_proquest_journals_2088796032
source SpringerLink Journals - AutoHoldings
subjects Compilers
Computer Science
Computer simulation
Computer vision
Curvature
Image reconstruction
Interpreters
Matching
Object recognition
Optimization
Pixels
Processor Architectures
Programming Languages
title Fast depth estimation using semi-global matching and adaptive stripe-based optimization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T17%3A01%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast%20depth%20estimation%20using%20semi-global%20matching%20and%20adaptive%20stripe-based%20optimization&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Loghman,%20Maziar&rft.date=2018-08-01&rft.volume=74&rft.issue=8&rft.spage=3666&rft.epage=3684&rft.pages=3666-3684&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-016-1884-7&rft_dat=%3Cproquest_cross%3E2088796032%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2088796032&rft_id=info:pmid/&rfr_iscdi=true