In this paper, we reconsider the clustering problem for image over-segmentation from a new perspective. We propose a novel search algorithm called"active search" which explicitly considers neighbor continuit...In this paper, we reconsider the clustering problem for image over-segmentation from a new perspective. We propose a novel search algorithm called"active search" which explicitly considers neighbor continuity. Based on this search method, we design a back-and-forth traversal strategy and a joint assignment and update step to speed up the algorithm. Compared to earlier methods, such as simple linear iterative clustering(SLIC) and its variants, which use fixed search regions and perform the assignment and the update steps separately, our novel scheme reduces the number of iterations required for convergence,and also provides better boundaries in the oversegmentation results. Extensive evaluation using the Berkeley segmentation benchmark verifies that our method outperforms competing methods under various evaluation metrics. In particular, our method is fastest,achieving approximately 30 fps for a 481 × 321 image on a single CPU core. To facilitate further research, our code is made publicly available.展开更多
To understand the physical meaning of phase time further more, we discuss the reflection phase time of quantum-particles passing though a potential well It is shown that the reflection phase time is equal to the trans...To understand the physical meaning of phase time further more, we discuss the reflection phase time of quantum-particles passing though a potential well It is shown that the reflection phase time is equal to the transmission phase time in value and negative under certain conditions for a square potential well by analyzing While quantum-particles passing through the potential well, we think that this course can be described only with the velocity of energy of quantum mechanics whether or not they are reflected or transmitted eventually展开更多
With the increasing complexity of distribution network structures originating from the high penetration of renewable energy and responsive loads,fast and accurate fault location technology for distribution networks is...With the increasing complexity of distribution network structures originating from the high penetration of renewable energy and responsive loads,fast and accurate fault location technology for distribution networks is a prerequisite for rapid isolation of faults and restoration of the power supply.In this paper,a fault location method based on community graph depth-first traversal is proposed for fast location of single-phase ground faults in distribution networks.First,this paper defines the fault graph weight of the vertices in the distribution network graph model,which can be used to reflect the topology of the vertices and fault points as well as the fluctuation of the vertices’currents.Then,the vertices on the graph model are clustered by using an improved parallel louvain method(IPLM).Finally,the community formed by IPLM is used as the smallest unit for depth-first traversal to achieve fast and accurate location of the fault section.The paper develops a distribution network graph model of IEEE 33-bus system on the graph database for testing.And three other methods are selected for comparison with IPLMDF.The test results show that IPLMDF can achieve fast and accurate fault location when half of the nodes in the distribution network are equipped with D-PMUs.When some of the D-PMUs lose time synchronization,it is still possible to locate the fault section,and at the same time,the locating results can be avoided by falling into local optimal solutions.展开更多
基金sponsored by National Natural Science Foundation of China (Nos. 61620106008 and 61572264)Huawei Innovation Research Program (HIRP)
文摘In this paper, we reconsider the clustering problem for image over-segmentation from a new perspective. We propose a novel search algorithm called"active search" which explicitly considers neighbor continuity. Based on this search method, we design a back-and-forth traversal strategy and a joint assignment and update step to speed up the algorithm. Compared to earlier methods, such as simple linear iterative clustering(SLIC) and its variants, which use fixed search regions and perform the assignment and the update steps separately, our novel scheme reduces the number of iterations required for convergence,and also provides better boundaries in the oversegmentation results. Extensive evaluation using the Berkeley segmentation benchmark verifies that our method outperforms competing methods under various evaluation metrics. In particular, our method is fastest,achieving approximately 30 fps for a 481 × 321 image on a single CPU core. To facilitate further research, our code is made publicly available.
文摘To understand the physical meaning of phase time further more, we discuss the reflection phase time of quantum-particles passing though a potential well It is shown that the reflection phase time is equal to the transmission phase time in value and negative under certain conditions for a square potential well by analyzing While quantum-particles passing through the potential well, we think that this course can be described only with the velocity of energy of quantum mechanics whether or not they are reflected or transmitted eventually
基金supported by the National Natural Science Foundation of China (Grant Nos.52009106,51779206)the National Key R&D Program of China (No.2018YFB1500800)the Natural Science Fund Youth Project of Shaanxi Province (2019J-130).
文摘With the increasing complexity of distribution network structures originating from the high penetration of renewable energy and responsive loads,fast and accurate fault location technology for distribution networks is a prerequisite for rapid isolation of faults and restoration of the power supply.In this paper,a fault location method based on community graph depth-first traversal is proposed for fast location of single-phase ground faults in distribution networks.First,this paper defines the fault graph weight of the vertices in the distribution network graph model,which can be used to reflect the topology of the vertices and fault points as well as the fluctuation of the vertices’currents.Then,the vertices on the graph model are clustered by using an improved parallel louvain method(IPLM).Finally,the community formed by IPLM is used as the smallest unit for depth-first traversal to achieve fast and accurate location of the fault section.The paper develops a distribution network graph model of IEEE 33-bus system on the graph database for testing.And three other methods are selected for comparison with IPLMDF.The test results show that IPLMDF can achieve fast and accurate fault location when half of the nodes in the distribution network are equipped with D-PMUs.When some of the D-PMUs lose time synchronization,it is still possible to locate the fault section,and at the same time,the locating results can be avoided by falling into local optimal solutions.
