A New Tree Structure for Weighted Dynamic Programming Based Stereo Algorithm

Hu, T. C.; Wu, Tao; Song, Jingze; Liu, Qixu; Zhang, Bo

doi:10.1109/icig.2011.26

Cited by 4 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(10) and (11). The optimal solution of the Bellman's recursive equation for all time steps is used to construct the optimal solution of the overall problem [24], [25].…”

Section: Application Of the Dynamic Programmingmentioning

confidence: 99%

Emission Reduction and Economical Optimization of an Urban Microgrid Operation Including Dispatched PV-Based Active Generators

Kanchev

Colas

Lazarov

et al. 2014

IEEE Trans. Sustain. Energy

167

104

View full text Add to dashboard Cite

In order to take full advantage of distributed generators, an evolution of the classical power system organization and management is also necessary. An aggregator of a residential urban electrical network can be considered by the Distribution System Operator as a stakeholder, which is able to control a cluster of local generators and loads with technical constraints for the connection with the remaining distribution grid and commercial contracts with outer electrical producers. This paper is focused on the design of the Microgrid Central Energy Management System which relies on a day ahead operational planning and an online adjustment procedure during the operation. A dynamic programming based algorithm is derived to solve the Unit Commitment Problem with a multiobjective function in order to reduce the economic cost and CO 2 equivalent emissions. The proposed energy management system is implemented into a SCADA and tested by using a hardware-in-the-loop simulation of the urban network. Economic and environmental gains are evaluated.

show abstract

“…(10) and (11). The optimal solution of the Bellman's recursive equation for all time steps is used to construct the optimal solution of the overall problem [24], [25].…”

Section: Application Of the Dynamic Programmingmentioning

confidence: 99%

Emission Reduction and Economical Optimization of an Urban Microgrid Operation Including Dispatched PV-Based Active Generators

Kanchev

Colas

Lazarov

et al. 2014

IEEE Trans. Sustain. Energy

167

104

View full text Add to dashboard Cite

show abstract

“…Hu proposed to construct a single‐direction four‐connected tree according to an image. Then the horizontal tree structure and vertical tree structure were used to perform dynamic‐programming cost aggregation (Hu et al, 2011, 2012). The above methods can keep the disparity map smooth by penalising the disparity difference, and also have a good effect on the edge preservation of the disparity map.…”

Section: Introductionmentioning

confidence: 99%

Minimum spanning tree dynamic programming stereo‐matching method based on superpixels

Wang

2023

The Photogrammetric Record

View full text Add to dashboard Cite

The minimum spanning tree (MST) stereo-matching method is an information-infiltration process. The difference in edge attributes of an MST can cause the edge-expansion phenomenon, which affects the matching accuracy. To accurately recover image-depth information, a dynamicprogramming stereo-matching method based on the MST was proposed. First, the colour Birchfield Tomasi costcalculation method based on image adaptive colour information was proposed to obtain stable initial cost values.Second, the image was segmented into superpixel regions using the simple linear iterative clustering algorithm. The pixel-and region-level MSTs were then constructed. Next, combined with the idea of dynamic programming, the MST cost-aggregation process was re-deduced. On this basis, the aggregate cost values of the two MSTs were obtained. Finally, the aggregate cost values were combined adaptively to acquire the high-precision smooth disparity map. The Middlebury 2014 dataset was used for the experiments. The experimental results indicate that the proposed method can effectively improve the accuracy of stereo-matching.

show abstract

Stereo matching using weighted dynamic programming on a single-direction four-connected tree

et al. 2012

Computer Vision and Image Understanding

View full text Add to dashboard Cite

A New Tree Structure for Weighted Dynamic Programming Based Stereo Algorithm

Cited by 4 publications

References 6 publications

Emission Reduction and Economical Optimization of an Urban Microgrid Operation Including Dispatched PV-Based Active Generators

Emission Reduction and Economical Optimization of an Urban Microgrid Operation Including Dispatched PV-Based Active Generators

Minimum spanning tree dynamic programming stereo‐matching method based on superpixels

Stereo matching using weighted dynamic programming on a single-direction four-connected tree

Contact Info

Product

Resources

About