degree constraint
Recently Published Documents


TOTAL DOCUMENTS

59
(FIVE YEARS 0)

H-INDEX

10
(FIVE YEARS 0)

Author(s):  
Lei Zhang ◽  
Minhui Chang

Abstract In the inpainting method for object removal, SSD (Sum of Squared Differences) is commonly used to measure the degree of similarity between the exemplar patch and the target patch, which has a very important impact on the restoration results. Although the matching rule is relatively simple, it is likely to lead to the occurrence of mismatch error. Even worse, the error may be accumulated along with the process continues. Finally some unexpected objects may be introduced into the target region, making the result unable to meet the requirements of visual consistency. In view of these problems, we propose an inpainting method for object removal based on difference degree constraint. Firstly, we define the MSD (Mean of Squared Differences) and use it to measure the degree of differences between corresponding pixels at known positions in the target patch and the exemplar patch. Secondly, we define the SMD (Square of Mean Differences) and use it to measure the degree of differences between the pixels at known positions in the target patch and the pixels at unknown positions in the exemplar patch. Thirdly, based on MSD and SMD, we define a new matching rule and use it to find the most similar exemplar patch in the source region. Finally, we use the exemplar patch to restore the target patch. Experimental results show that the proposed method can effectively prevent the occurrence of mismatch error and improve the restoration effect.



2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Danping Ren ◽  
Wei Wang ◽  
Jinhua Hu ◽  
Jijun Zhao

AbstractSurvivable virtual optical network (VON) mapping is researched to overcome the ossification of current network architectures. In this paper, we study the survivable VON mapping problem in elastic optical network (EON) with the objective of minimizing the average resource consumption of VON request. We propose a protective algorithm, namely, coordinated mapping algorithm based on minimum spanning tree (CMST), to provide the dedicated protection against the single physical link failure. In CMST, for virtual node mapping, we not only consider the resources constraint but also the node degree constraint. For virtual link mapping, we adopt the coordinated mapping method for part of the virtual nodes and virtual links. And we provide the backup path for the minimum spanning tree link of virtual topology to reduce the resource consumption. Simulation results showed that CMST can reduce the VON request blocking probability and average network resource consumption. And it can increase the revenue of physical network.



2017 ◽  
Vol 220 ◽  
pp. 91-117 ◽  
Author(s):  
Richard B. Tan ◽  
Erik Jan van Leeuwen ◽  
Jan van Leeuwen
Keyword(s):  




2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Chao Lu ◽  
Lei-shan Zhou ◽  
Yi-xiang Yue ◽  
Ran Chen

This paper is concerned with the scheduling of Electrical Multiple Units (EMUs) under the condition of their utilization on one sector or within several interacting sectors. Based on the introduction of the train connection graph which describes the possible connection relationship between trains, the integer programming model of EMU circulation planning is constructed. In order to analyzing the resolution of the model, a heuristic which shares the characteristics with the existing methods is introduced first. This method consists of two stages: one is a greedy strategy to construct a feasible circulation plan fragment, and another is to apply a stochastic disturbance to it to generate a whole feasible solution or get a new feasible solution. Then, an exact branch and bound method which is based on graph designing is proposed. Due to the complexity, the lower bound is computed through a polynomial approximation algorithm which is a modification from the one solving the degree constraint minimum 1-tree problem. Then, a branching strategy is designed to cope with the maintenance constraints. Finally, we report extensive computational results on a railway corridor in which the sectors possess the basic feature of railway networks.



2013 ◽  
Vol 846-847 ◽  
pp. 1330-1333
Author(s):  
Shu Juan Dong ◽  
Ai Ping Ding

The degree-constrained Euclidean Steiner minimal tree problem was discussed based on the Euclidean Steiner minimal tree with each original point being added with a degree constraint. The property of the problem was analyzed and the implementation process of solving the problem by using the ant algorithm was presented.The algorithms is coded in Delphi and run on the Windows XP environment.



Sign in / Sign up

Export Citation Format

Share Document