[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3120895.3120907acmotherconferencesArticle/Chapter ViewAbstractPublication PagesheartConference Proceedingsconference-collections
research-article

FPGA Implementation of A Graph Cut Algorithm For Stereo Vision

Published: 07 June 2017 Publication History
First page of PDF

References

[1]
B. M. Smith, L. Zhang, and H. Jin, "Stereo matching with nonparametric smoothness priors in feature space," in Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 485--492, 2009.
[2]
O. Woodford, P. Torr, I. Reid, and A. Fitzgibbon, "Global stereo reconstruction under second-order smoothness priors," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2115--2128, 2009.
[3]
Paper information is eliminated for double-blind reviewing.
[4]
V. Vineet and P. Narayanan, "CUDA cuts: Fast graph cuts on the GPU," in Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CUPRW), pp. 1--8, 2008.
[5]
D. Kobori and T. Maruyama, "An acceleration of a graph cut segmentation with FPGA," in Proc. International Conference on Field Programmable Logic and Applications (FPL), pp. 407--413, 2012.
[6]
T. H. Cormen, Introduction to algorithms. MIT press, 2009.
[7]
E. Dinits, "Algorithm of solution to problem of maximum flow in network with power estimates," Doklady Akademii Nauk SSSR, vol. 194, no. 4, p. 754, 1970.
[8]
J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," Journal of the ACM (JACM), vol. 19, no. 2, pp. 248--264, 1972.
[9]
A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem," journal of the ACM (JACM), vol. 35, no. 4, pp. 921--940, 1988.
[10]
U. Derigs and W. Meier, "Implementing Goldberg's max-flow-algorithm---A computational investigation," Zeitschrift für Operations Research, vol. 33, no. 6, pp. 383--403, 1989.
[11]
V. Kolmogorov and R. Zabin, "What energy functions can be minimized via graph cuts?" IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147--159, 2004.

Cited By

View all
  • (2021)Efficient global stereo-matching method of general images under a long baseline based on baseline estimationApplied Optics10.1364/AO.43323160:27(8248)Online publication date: 13-Sep-2021
  • (2019)Pipelined FPGA Implementation of a Wave-Front-Fetch Graph Cut SystemComplex, Intelligent, and Software Intensive Systems10.1007/978-3-030-22354-0_38(430-441)Online publication date: 21-Jun-2019
  • (2018)An FPGA-oriented Graph Cut Algorithm for Accelerating Stereo Vision2018 International Conference on ReConFigurable Computing and FPGAs (ReConFig)10.1109/RECONFIG.2018.8641737(1-6)Online publication date: Dec-2018

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
HEART '17: Proceedings of the 8th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies
June 2017
172 pages
ISBN:9781450353168
DOI:10.1145/3120895
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

In-Cooperation

  • Ruhr-Universität Bochum: Ruhr-Universität Bochum

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2017

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

HEART2017

Acceptance Rates

Overall Acceptance Rate 22 of 50 submissions, 44%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Efficient global stereo-matching method of general images under a long baseline based on baseline estimationApplied Optics10.1364/AO.43323160:27(8248)Online publication date: 13-Sep-2021
  • (2019)Pipelined FPGA Implementation of a Wave-Front-Fetch Graph Cut SystemComplex, Intelligent, and Software Intensive Systems10.1007/978-3-030-22354-0_38(430-441)Online publication date: 21-Jun-2019
  • (2018)An FPGA-oriented Graph Cut Algorithm for Accelerating Stereo Vision2018 International Conference on ReConFigurable Computing and FPGAs (ReConFig)10.1109/RECONFIG.2018.8641737(1-6)Online publication date: Dec-2018

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media