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

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

来源：评论

学校读者我要写书评

暂无评论

A SCALABLE PARALLEL HARDWARE ARCHITECTURE FOR CONNECTED COMPONENT labeling

A SCALABLE PARALLEL HARDWARE ARCHITECTURE FOR CONNECTED COMP...

引用

IEEE International Conference on Image Processing

作者： Lin, Chung-Yuan Li, Sz-Yan Tsai, Tsung-Han Natl Cent Univ Dept Elect Engn Taipei Taiwan

ISBN: (纸本)9781424479948

The parallel connected component labeling used in binary image analysis is reconsidered in this paper for the high throughput and intermediate memory requirements problem on high dimensional image sequence. It is based on a proposed dual-parallel connected component labeling method. The main idea is to break the sequentiality of the labeling procedure by separating image into slices and to correctly delimit the extent of all connected components locally, on each slice, simultaneously. According to the proposed method, a scalable architecture which can be adaptive to different throughput requirement is derived. The proposed architecture consists of local label assignment, local label fusion, and global process unit. The forest structure is introduced to cope with both global and local label equivalent. Based on the forest structure, find and union operations are implemented to complete the entire connected components labeling during two raster scans. Performance of the proposed architecture estimated in terms of the number of clocks and memory requirement are brought forward to justify the superiority of the novel design compared against previous implementation.

关键词： Connected component labeling algorithm scalable architecture real-time

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

labeling algorithm and its fairness analysis for autonomous system

引用

Journal of Systems Engineering and Electronics 2005年第4期16卷 806-810页

作者： Han Guodong Wang Hui Wu Jiangxing National Digital Switching System Engineering & Technological Research Center Information Engineering Univ. Zhengzhou 450002 P. R. China Managment Coll. Tianjin Univ. Tianjin 300072 P. R. China

A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integrated-services is analyzed. It is shown that the rate of each stream in the integrated-services would converge to a stable value if the transmittfing or forwarding rates converge to that of the receiving exponentially.

关键词： autonomous system labeling algorithm traffic stream fairness analysis.

来源：评论

学校读者我要写书评

暂无评论

An attribute-decision model for cross-border drayage problem

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2008年第2期44卷 217-234页

作者： Cheung, Raymond K. Shi, Ning Powell, Warren B. Simao, Hugo P. Hong Kong Univ Sci & Technol Dept Ind Engn & Logist Management Kowloon Hong Kong Peoples R China IBM China Res Lab Beijing 100094 Peoples R China Princeton Univ Dept Operat Res & Financial Engn Princeton NJ 08544 USA

The drayage services between a container terminal and the origin (or destination) of a shipment account for a significant portion of the total transportation cost. They are the key sources of shipment delays, road congestions, and disruptions in the international logistics network. Such a situation is even worse when the drayage services involve cross-border issues. Using Hong Kong, the busiest port in the world, as an example, we illustrate the challenges and issues in managing drayage activities in hub cities. We show that managing cross-border drayage container transportation is a very challenging problem because not only individual resources (e.g., driver, tractor, and chassis) but also the composites of them (e.g., the driver-tractor-chassis triplets) need to be managed simultaneously. The problem is further complicated by the regulatory policies which govern the cross-border activities. We use an attribute-decision model for this problem and implement an adaptive labeling algorithm to solve it. We conduct numerical experiments to evaluate the system performances under various regulatory policies. The results show that the benefit gained by relaxing the regulatory policies is significant. (c) 2007 Elsevier Ltd. All rights reserved.

关键词： drayage problem labeling algorithm composite resource scheduling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Content-based retrieval system using Artificial Hippocampus algorithm

Content-based retrieval system using Artificial Hippocampus ...

引用

11th World Multi-Conference on Systemics, Cybernetics and Informatics/13th International Conference on Information Systems Analysis and Synthesis

作者： Chu, Jung-Ho Kim, Young Ho Kang, Dae-Seong Dong A Univ Dept Elect Engn Pusan 604714 South Korea

ISBN: (纸本)9781934272169

As information-oriented society at the beginning 21 centuries, many kinds of multimedia data are used variously and requirements for effective use by user are increasing. In order to transfer information fast and precisely what user wants, retrieval method is required. Recently there have been many efforts to support searching and browsing based on the visual content of image and multimedia data. In this paper, we propose a user friendly object-based image retrieval system using labeling algorithm and Artificial Hippocampus algorithm (AHA). Most existing ways of queries in content-based image retrieval rely on query by example or query by sketch. But these methods of queries are not adequate to needs of people's various queries because they are not easy for people to use and restrict. We propose a method of automatic color object extraction using CSB tree map (Color and Spatial based Binary tree map). Extracted objects were transformed to bit stream representing information such as color, size and location by region labeling representing information such as color, size and location by region labeling algorithm and they are learned by the hippocampus neural network using the interplay between cortex and hippocampus. Various phenomena generated in the brain are hidden in the veil of mystery. In the engineering put, neural network grounded on learning and memory of the brain is applied to many parts. In neural network., learning is considered transferring and processing of the information by each neuron connected synapse. When a stimulus is given, the material of the molecule unit which contains information in the pre-synapse is activated and progressed to the postsynapse. While it is processing, a molecule or the dynamics of stromata is continuous and is generated parallel. The existing neural network generated by learning method of Hebb is different from a model of a real brain. Network present database of all features of images such as color histogram of the image,

关键词： Artificial Hippocampus algorithm (AHA) content-based image retrieval CSB tree map (Color and Spatial based Binary tree map) Single Colorizing labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

Compact labeling scheme for ancestor queries

引用

SIAM JOURNAL ON COMPUTING 2006年第6期35卷 1295-1309页

作者： Abiteboul, S Alstrup, S Kaplan, H Milo, T Rauhe, T INRIA Rocquencourt F-78153 Le Chesnay France IT Univ Copenhagen DK-2400 Copenhagen NV Denmark Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel

We consider the following problem. Given a rooted tree T, label the nodes of T in the most compact way such that, given the labels of two nodes u and v, one can determine in constant time, by looking only at the labels, whether u is ancestor of v. The best known labeling scheme is rather straightforward and uses labels of length at most 2 log(2) n bits each, where n is the number of nodes in the tree. Our main result in this paper is a labeling scheme with maximum label length log2 n+ O(root log n). Our motivation for studying this problem is enhancing the performance of web search engines. In the context of this application each indexed document is a tree, and the labels of all trees are maintained in main memory. Therefore even small improvements in the maximum label length are important.

关键词： ancestor queries rooted tree labeling algorithm alphabetic codes

来源：评论

学校读者我要写书评

暂无评论

The fastest itinerary in time-dependent decentralized travel information systems

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2006年第3期12卷 167-185页

作者： Wang, Jinchang Kaempke, Thomas Richard Stockton Coll New Jersey Pomona NJ 08232 USA Res Inst Appl Knowledge Proc N D-89081 Ulm Germany

A travel information system (TIS) provides customers with information about transportation, transfers, and routings. A decentralized TIS is composed of autonomous subsystems and a central computer, where local subsystems have full control of their data and there is not a complete database in the central computer about the entire TIS. The transportation vehicles are scheduled. A travel itinerary from one spot to another contains the travel path and the schedule of transportations. The approach presented in this paper is for the central computer to identify the fastest itinerary across autonomous subsystems, based on the incomplete local information provided by the independent subsystems.

关键词： distributed computing shortest path problem fastest path problem labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

Shortest route computation in distributed systems

引用

COMPUTERS & OPERATIONS RESEARCH 2004年第10期31卷 1621-1633页

作者： Wang, JC Kaempke, T Missouri Western State Coll Dept Business St Joseph MO 64507 USA FAW Res Inst Artificial Intelligence D-89081 Ulm Germany

This paper presents a polynomial time algorithm for computing the shortest route in distributed systems. A distributed system is composed of autonomous subsystems and a central computing server. A subsystem stores and maintains its own data, and is obligated to provide the central computing server with the information about its intersections with other subsystems. The approach presented in this paper is for the central computing server to compute the shortest route that crosses subsystems based on the partial local information provided by the subsystems. It is the first efficient algorithm that guarantees to find the shortest route in such a distributed system. (C) 2003 Elsevier Ltd. All rights reserved.

关键词： distributed computing shortest path problem labeling algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：