Efficient Disparity Estimation Using Hierarchical Bilateral Disparity Structure Based Graph Cut Algorithm With a Foreground Boundary Refinement Mechanism

@article{Wang2013EfficientDE,
  title={Efficient Disparity Estimation Using Hierarchical Bilateral Disparity Structure Based Graph Cut Algorithm With a Foreground Boundary Refinement Mechanism},
  author={Yu-Chih Wang and Cheng-Ping Tung and Pau-Choo Chung},
  journal={IEEE Transactions on Circuits and Systems for Video Technology},
  year={2013},
  volume={23},
  pages={784-801}
}
The disparity estimation problem is commonly solved using graph cut (GC) methods, in which the disparity assignment problem is transformed to one of minimizing global energy function. Although such an approach yields an accurate disparity map, the computational cost is relatively high. Accordingly, this paper proposes a hierarchical bilateral disparity structure (HBDS) algorithm in which the efficiency of the GC method is improved without any loss in the disparity estimation performance by… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Similar Papers

Loading similar papers…