Optimizing connected component labeling is currently a very active research field. Some teams claim to have design the fastest algorithm ever designed. This paper presents a review of these algorithms and a enhanced b...
详细信息
ISBN:
(纸本)9781479965885
Optimizing connected component labeling is currently a very active research field. Some teams claim to have design the fastest algorithm ever designed. This paper presents a review of these algorithms and a enhanced benchmark that improve classical random images benchmark with a varying granularity set of random images in order to become closer to natural image behavior.
A container pre-marshalling problem is to find a sequence of container movements to reach final container layout satisfying certain conditions. Two container pre-marshalling problems that are denoted as problem Type-A...
详细信息
A container pre-marshalling problem is to find a sequence of container movements to reach final container layout satisfying certain conditions. Two container pre-marshalling problems that are denoted as problem Type-A and Type-B are defined in this paper. Two labelling algorithms, which denote as Heuristic-A and Heuristic-B, are proposed to solve these two container pre-marshalling problems, respectively. Experiments retrieved from past literature and generated by computer program are used to verify the performance of the two algorithms. According to the output results, these proposed algorithms are able to yield a competitive solution in comparison with other methods. Computational results and model variations are discussed. (C) 2011 Elsevier Ltd. All rights reserved.
The implementation of a connected component labeling algorithm (CCL) for real-time operation is presented in this paper. The algorithm, which was designed and implemented following a model-based methodology centered o...
详细信息
ISBN:
(纸本)9781467312615
The implementation of a connected component labeling algorithm (CCL) for real-time operation is presented in this paper. The algorithm, which was designed and implemented following a model-based methodology centered on Matlab/Simulink and Xilinx-System Generator, uses horizontal and vertical blanking periods to improve the quality of labeling and increase the operation speed. Its performance, with a VGA 640×480 P@60 Hz video, is shown by means of its integration on a complete video processing system over a Spartan-3A DSP 3400 development board.
The static network shortest path algorithms have been developed thoroughly, whereas the studies for dynamic network shortest path algorithms are few. To satisfy the need of theoretical research and application, the dy...
详细信息
The static network shortest path algorithms have been developed thoroughly, whereas the studies for dynamic network shortest path algorithms are few. To satisfy the need of theoretical research and application, the dynamic network shortest path problems have been a hot spot in the field of geographic information science and computer science. When the weights of the network are functions with parameter, the network is called a dynamic network, in which it is difficult to resolve shortest path by the traditional algorithms. In this paper, we first propose the shortest path problem in a multi-stage weighted network with quadratic parameter. Next, we give the implicit enumerative labelling algorithm to look for the shortest path of this network based on the thought of the Dijkstra algorithm and the implicit enumerative method. Finally, we analyse the complexity of the algorithm. The theory analysis and the experiment indicate that the algorithm is not polynomial but effective for proper scale of the network.
This paper presents a direct extension of the label setting algorithm proposed by Martins in 1984 for the shortest path problem with multiple objectives. This extended version computes all the efficient paths from a g...
详细信息
A labeling algorithm for the components of a multicolored image is proposed. This image is registered in a size n x n mesh connected computer. Each pixel is associated with a processing element. The number of operatio...
详细信息
A labeling algorithm for the components of a multicolored image is proposed. This image is registered in a size n x n mesh connected computer. Each pixel is associated with a processing element. The number of operations necessary for component labeling is fixed independently of the value of n.
The solution in discrete time of the problem of maximizing the flow in a network with time-varying arc capacities and storage at the nodes is a straightforward extension of the static case. In this paper the problem i...
详细信息
The solution in discrete time of the problem of maximizing the flow in a network with time-varying arc capacities and storage at the nodes is a straightforward extension of the static case. In this paper the problem is formulated and solved in continuous time. A continuous version of the Ford-Fulkerson theorem is proved, and an analogue of the labelling algorithm developed. An example is given to clarify some of the ideas of the paper and the duality theory for this problem is discussed.
暂无评论