检索结果-内蒙古大学图书馆

6th International Conference on Image Analysis and Recognition

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Itoh, Hidenori Shannxi Univ Sci & Technol Fac Elect & Informat Engn Shaanxi 710021 Peoples R China Shannxi Univ Sci & Technol Fac Mech & Elect Engn Shaanxi 710021 Peoples R China Univ Chicago Dept Radiol Div Biol Sci Chicago IL 60637 USA Nagoya Inst Technol Dept Informat Engn Nagoya Aichi 4668666 Japan

ISBN: (纸本)9783642026102

This paper presents a run-based one-scan algorithm for labeling connected components in a binary image. Our algorithm is different with conventional raster-scan label-equivalence-based algorithms in two ways: (1) to complete connected component labeling, all conventional label-equivalence-based algorithms scan a whole image two or more times, our algorithm scans a whole image only once;(2) all conventional label-equivalence-based algorithms assign each object pixel a provisional label in the first scan and rewrite it in later scans, our algorithm does not assign object pixels but runs provisional labels. In the scan, our algorithm records all run data in an image in a one-dimensional array and assigns a provisional label to each run. Any label equivalence between runs is resolved whenever it is found in the scan, where the smallest label is used as their representative label. After the scan finished, all runs that belong to a connected component will hold the same representative label. Then, using the recorded run data, each object pixel of a run is assigned the representative label corresponding to the run without rewriting the values (i.e., provisional labels) of object pixels and scanning any background pixel again. Experimental results demonstrate that our algorithm is extremely efficient oil images with long runs or small number of object pixels.

关键词： labeling algorithm connected component label equivalence run-length encoding raster scan

来源：评论

学校读者我要写书评

暂无评论

A run-based two-scan labeling algorithm

引用

4th International Conference on Image Analysis and Recognition

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Aichi Prefectural Univ Grad Sch Informat Sci & Technol Aichi 4801198 Japan Nagoya Sangyo Univ Graduate Sch Environ Management Aichi 4801198 Japan Univ Chicago Div Biol Sci Dept Radiol Chicago IL 60637 USA Shannxi Univ Sci & Technol Xian Shannxi Peoples R China

ISBN: (纸本)9783540742586

Unlike conventional raster-scan based connected-component labeling algorithms which detect the connectivity of object pixels by processing pixels in an image one by one, this paper presents an efficient run-based two-scan labeling algorithm: the run data obtained during the scan are recorded in a queue, and are used for detecting the connectivity later. Moreover, unlike conventional label-equivalence-based algorithms which resolve label equivalences between provisional labels that are assigned during the first scan, our algorithm resolve label equivalences between the representative labels of equivalent provisional label sets. In our algorithm, at any time, all provisional labels that are assigned to a connected component are combined in a set, and the smallest label is used as the representative label. The corresponding relation of a provisional label to its representative label is recorded in a table. Whenever different connected components are found to be connected, all provisional label sets concerned with these connected components are merged together, and the smallest provisional label is taken as the representative label. When the first scan is finished, all provisional labels that were assigned to each connected component in the given image will have a unique representative label. During the second scan, we need only to replace each provisional label with its representative label. Experimental results on various types of images demonstrate that our algorithm is the fastest of all conventional labeling algorithms.

关键词： labeling algorithm connected components label equivalence run data linear-time algorithm pattern recognition

来源：评论

学校读者我要写书评

暂无评论

THE INNER-SYSTEM labeling algorithm AND ITS FAIRNESS ANALYSIS

引用

Journal of Electronics(China) 2005年第6期22卷 612-618页

作者： Han Guodong Li Yinhai Wu Jiangxing National Digital Switching System Engineering ＆ Technological Research Center Information Engineering University Zhengzhou 450002 China

On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand,and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integratedservices would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.

关键词： Integrated Access System （IAS） Inner-system labeling labeling algorithm Fairness

来源：评论

学校读者我要写书评

暂无评论

An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2025年第6期76卷 1125-1139页

作者： Karimi, Mohammad Camiat, Fanny Desaulniers, Guy Gendreau, Michel Polytech Montreal Montreal PQ Canada CIRRELT Montreal PQ Canada GIRO Inc Montreal PQ Canada GERAD Montreal PQ Canada

Vehicle routing problems are encountered in various practical transportation scenarios. One such problem is the dial-a-ride problem (DARP), which involves transporting efficiently passengers from their origin to their destination and whose objective is to design vehicle routes minimizing total costs and accommodating all pickup-and-delivery requests. The solution must also adhere to capacity limitations, time windows, and a maximum ride time for each passenger. This paper proposes an exact branch-price-and-cut algorithm to solve a practical variant of the DARP, where both the passengers and vehicle fleet are heterogeneous, and other practical constraints such as break requirements and maximum route duration are imposed. In this algorithm, column generation which alternates between solving a master problem and subproblems, is used to compute lower bounds in the search tree. We develop a labeling algorithm to efficiently handle these subproblems. The effectiveness of the algorithm is evaluated on a real-world case study involving 849 heterogeneous passengers and more than 70 available vehicles, as well as on 10 smaller instances (with 300 to 820 trips) extracted from another very large real-world dataset. To the best of our knowledge, this 849-trip instance is the largest DARP instance reported to be solved to optimality in the literature.

关键词： Practical dial-a-ride problem break requirements branch-price-and-cut labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimizing the Transport of Organs for Transplantation

引用

COMPUTERS & OPERATIONS RESEARCH 2025年 176卷

作者： Balster, Isaac Caetano, Joyce Azevedo Ribeiro, Glaydston Mattos Bahiense, Laura Fed Univ Rio Janeiro Alberto Luiz Coimbra Inst Grad Studies & Res Engn Transport Engn Program Rio De Janeiro Brazil Fed Univ Rio Janeiro Alberto Luiz Coimbra Inst Grad Studies & Res Engn Syst Engn & Comp Sci Program Transport Engn Program Rio De Janeiro Brazil

As an organ becomes available for transplantation, a recipient must be selected. Usually, donor and recipient are geographically apart. Therefore, the transport of the organ must be planned and executed within the time window imposed by the maximum preservation time of the organ, which can impact recipient selection. The Cold Ischemia Time- CIT, that is the time elapsed between the surgical removal of the organ and its transplantation, must be the minimum possible to improve the transplantation success. In this sense, the air transport becomes the best option and, sometimes, it is the only way to deliver the organ before perishing. The planning of an organ transportation means choosing, among thousands of possible sequences of flights, the option that delivers the organ faster to its destination. This problem can be modeled as a resource constrained shortest path. Given the urgency and importance of this task, which is solved manually in Brazil, we present a labeling algorithm to find the optimal sequence of flights. Computational tests performed on 25 Brazilian real cases showed a reduction, on average, of 37,46% for the CITs and 44,17% for the transport times.

关键词： Organ transplantation Organ transportation labeling algorithm Resource constrained shortest path

来源：评论

学校读者我要写书评

暂无评论

An efficient first-scan method for label-equivalence-based labeling algorithms

引用

PATTERN RECOGNITION LETTERS 2010年第1期31卷 28-35页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Aichi Prefectural Univ Grad Sch Informat Sci & Technol Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Aichi 4888711 Japan Univ Chicago Div Biol Sci Dept Radiol Chicago IL 60637 USA

Label-equivalence-based connected-component labeling algorithms complete labeling in two or more raster scans. In the first scan, each foreground pixel is assigned a provisional label, and label equivalences between provisional labels are recorded. For doing this task, all conventional algorithms use the same mask that consists of four processed neighbor pixels to process every foreground pixel. This paper presents a simple yet efficient first-scan method for label-equivalence-based labeling algorithms. In our method, foreground pixels following a background pixel and those following a foreground pixel are processed in a different way. By use of this idea, the pixel followed by the current foreground pixel can be removed from the mask. In other words, the mask used in our method consists of three processed neighbor pixels. Thus, for processing a foreground pixel, the average number of times for checking the processed neighbor pixels in the first scan is reduced from 2.25 to 1.75. Because the current foreground pixel following a background pixel or a foreground pixel can be known without any additional computing cost, our method is efficient for any image that contains at least one foreground pixel. Experimental results demonstrated that our method is effective for improving the efficiency of label-equivalence-based labeling algorithms. (C) 2009 Published by Elsevier B.V.

关键词： Connected component labeling algorithm First scan Mask Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Two Efficient Label-Equivalence-Based Connected-Component labeling algorithms for 3-D Binary Images

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2011年第8期20卷 2122-2134页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Shaanxi Univ Sci & Technol Coll Mech & Elect Engn Xianyang 710021 Shaanxi Peoples R China Aichi Prefectural Univ Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Aichi 4888711 Japan Univ Chicago Dept Radiol Div Biol Sci Chicago IL 60637 USA

Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.

关键词： Connected component label equivalence labeling algorithm run 3-D binary image

来源：评论

学校读者我要写书评

暂无评论

A New First-Scan Method for Two-Scan labeling algorithms

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2012年第8期E95D卷 2142-2145页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Shaanxi Univ Sci & Technol Coll Elect & Informat Engn Xianyang 710021 Shaanxi Peoples R China Aichi Prefectural Univ Grad Sch Informat Sci & Technol Nagakute Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Owariasahi 4888711 Japan Univ Chicago Div Biol Sci Dept Radiol Chicago IL 60637 USA

This paper proposes a new first-scan method for two-scan labeling algorithms. In the first scan, our proposed method first scans every fourth image line, and processes the scan line and its two neighbor lines. Then, it processes the remaining lines from top to bottom one by one. Our method decreases the average number of times that must be checked to process a foreground pixel will;thus, the efficiency of labeling can be improved.

关键词： labeling algorithm connected component first scan pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Connected components labeling based on union-find operations applied to connected branches

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2017年第5期32卷 3739-3748页

作者： Niu Lianqiang Chen Xin Peng Min Zhang Gang Shenyang Univ Technol Software Sch Shenyang Liaoning Peoples R China Shenyang Univ Technol Sch Sci Shenyang Liaoning Peoples R China

This paper presents an efficient run-based algorithm for labeling connected components in a binary image. By means of two tables called index table and equivalent information table respectively, the algorithm assign labels only to run sets which are composed of a series of runs connected to each other in adjacent scan rows, then the same index in equivalent information table can be assigned to all runs of a set in index table at one time. Further, the algorithm organizes all equivalence information in equivalent information table in a tree structure, and employee the union-find technique to merge connected components rapidly. The algorithm is very simple, and fewer operations are needed to check and to label runs of a connected branch. Furthermore, it is not necessary to calculate the minimum label while combining two runs, and is able to construct a union-find tree with smaller height. Thus the algorithm is able to provide a high speed to label connected components for general images.

关键词： Connected components union-find labeling algorithm label equivalent run length encoding

来源：评论

学校读者我要写书评

暂无评论

Fast connected-component labeling

引用

PATTERN RECOGNITION 2009年第9期42卷 1977-1987页

作者： He, Lifeng Chao, Yuyan Suzuki, Kenji Wu, Kesheng Aichi Prefectural Univ Grad Sch Informat Sci & Technol Aichi 4801198 Japan Nagoya Sangyo Univ Grad Sch Environm Management Aichi 4888711 Japan Univ Chicago Div Biol Sci Dept Radiol Chicago IL 60637 USA Univ Calif Berkeley Lawrence Berkeley Lab Berkeley CA 94720 USA ShaanXi Univ Sci & Technol Xian 710021 Shannxi Peoples R China

labeling of connected components in a binary image is one of the most fundamental operations in pattern recognition: labeling is required whenever a computer needs to recognize objects (connected components) in a binary image. This paper presents a fast two-scan algorithm for labeling of connected components in binary images. We propose an efficient procedure for assigning provisional labels to object pixels and checking label equivalence. Our algorithm is very simple in principle, easy to implement, and suitable for hardware and parallel implementation. We show the correctness of our algorithm, analyze its complexity, and compare it with other labeling algorithms. Experimental results demonstrated that our algorithm is superior to conventional labeling algorithms. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： labeling algorithm Label equivalence Connected component Linear-time algorithm Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：