This repository is contains the code for our course project for Digital Image Procesing (CS663) at IIT Bombay. The project aims to extimate depth maps from stereo images. We further used the depth estimates to interactively refocus and generate depth blurring. We have implemented the paper "Efficient Hybrid Tree-Based Stereo Matching With Applications to Postcapture Image Refocusing"
- [16D100012] Sarthak Consul (@SConsul)
- [16D070001] Parthasarathi Khirwadkar (@kparth98)
- [16D170005] Bhishma Dedhia (@glitchinthematrix)
- [1] D. T. Vu, B. Chidester, H. Yang, M. N. Do, and J. Lu. Efficient hybrid tree-based stereo matching with applications to postcapture image refocusing. IEEE Transactions on Image Processing, 23(8):3428–3442, Aug 2014
- [2] Q. Yang. A non-local cost aggregation method for stereo matching. In 2012 IEEE Conference on Computer Vision and Pattern Recognition , pages 1402–1409, June 2012.
- [3] J. Lu, K. Shi, D. Min, L. Lin, and M. N. Do, “Cross-based local multipoint filtering,” in Proc. IEEE Int. Conf. Computer Vision and Pattern Recognition (CVPR), Providence, Rhode Island, Jun. 2012
- [4] R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Susstrunk, “SLIC superpixels compared to state-of-the-art superpixel methods,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 11, pp. 2274–2282, Nov. 2012
- [5] J. B. Kruskal, “On the shortest spanning subtree of a graph and the traveling salesman problem,” Proc. Amer. Math. Soc., vol. 7, no. 1, pp. 48–50, Feb. 1956
- [6] J. Canny, “A computational approach to edge detection,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 8, no. 6, pp. 679–698, Jun. 1986