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

Segmentation, Skeletonization, and Branchpoint matching – A fully automated quantitative evaluation of Human Intrathoracic Airway Trees 5th

引用

5th International Conference on Medical Image Computing and computer-Assisted Intervention, MICCAI 2002

作者： Tschirren, J. Palágyi, K. Reinhardt, J.M. Hoffman, E.A. Sonka, M. Department of Electrical and Computer Engineering The University of Iowa Iowa CityIA52242 United States Department of Biomedical Engineering The University of Iowa Iowa CityIA52242 United States Department of Radiology The University of Iowa Iowa CityIA52242 United States Department of Applied Informatics University of Szeged Hungary

ISBN: (纸本)3540442251

Modern multislice X-ray CT scanners provide high-resolution volumetric image data containing a wealth of structural and functional information. The size of the volumes makes it more and more difficult for human observers to visually evaluate their contents. Similar to other areas of medical image analysis, highly automated extraction and quantitative assessment of volumetric data is increasingly important in pulmonary physiology, diagnosis, and treatment. We present a method for a fully automated segmentation of a human airway tree, its skeletonization, identification of airway branches and branchpoints, as well as a method for matching the airway trees, branches, and branchpoints for the same subject over time and across subjects. The validation of our method shows a high correlation between the automatically obtained results and reference data provided by human observers. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

STATION LAYOUTS IN THE PRESENCE OF LOCATION CONSTRAINTS

引用

Journal of Interconnection Networks 2002年第1N02期3卷 1-17页

作者： PROSENJIT BOSE EVANGELOS KRANAKIS CHRISTOS KAKLAMANIS LEFTERIS M. KIROUSIS DANNY KRIZANC DAVID PELEG Carleton University School of Computer Science Ottawa Ontario K1S 5B6 Canada University of Patras Department of Computer Engineering and Informatics GR-26504 Patras Greece Wesleyan University Department of Mathematics Middletown CT 06459 USA Weizmann Institute of Science Department of Computer Science and Applied Mathematics Rehovot 76100 Israel

In wireless communication, the signal of a typical broadcast station is transmitted from a broadcast center p and reaches objects at a distance, say, r from it. In addition there is a radius r 0 , r 0 < r, such that the signal originating from the center of the station is so strong that human habitation within distance r 0 from the center p should be avoided. In other words, points within distance r 0 from the station comprise a hazardous zone. We consider the following station layout proble: Cover a given planar region that includes a collection of buildings with a minimum number of stations so that every point in the region is within the reach of a station, while at the same time no interior point of any building is within the hazardous zone of a station. We give algorithms for computing such station layouts in both the one- and two-dimensional cases.

关键词： Approximation algorithm Broadcast station Health hazards Optimal layout Wireless communication

来源：评论

学校读者我要写书评

暂无评论

A rough set approach to measuring information granules

A rough set approach to measuring information granules

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： J.F. Peters Z. Pawlak A. Skowron Department of Electrical and Computer Engineering University of Manitoba Winnipeg MAN Canada Institute of Theoretical and Applied Informatics Polish Academy of Sciences Gliwice Poland Institute of Mathematics Warsaw University of Technology Warsaw Poland

This article introduces an approach to measures of information granules based on rough set theory. Informally, an information granule is a representation of a multiset (or bag) of real-world objects that are somehow indistinguishable, or similar, or which cause the same functionality. Examples of measures of information granules based on the rough set theory are inclusion, closeness, size, and enclosure. All of these measures are based on rough inclusion. This paper is limited to a consideration of measures of inclusion based on a straightforward extension of classical rough membership functions and closeness based on measurement of separation of equivalence classes in a partition of the universe containing information granules. Measurement of sensor-based information granules has been motivated by recent studies of sensor signals. A sensor signal is a non-empty, finite set of sample sensor signal values temporally ordered. Classification of sensor signals requires measurements of sample signal values over subintervals of time. This article introduces a rough set approach to measuring information granule inclusion and closeness.

关键词： Set theory Size measurement Intelligent sensors informatics Mathematics Electric variables measurement Water resources Helicopters Robots Time measurement

来源：评论

学校读者我要写书评

暂无评论

Information dissemination in multihop inter-vehicle networks

Information dissemination in multihop inter-vehicle networks

引用

International Conference on Intelligent Transportation

作者： T. Kosch C. Schwingenschlogl Li Ai BMW Research Department Munich Germany Department of Computer Science applied Informatics Cooperative Systems Group Munich University of Technology Germany Department of Electrical Engineering and Information Technology Institute of Communication Networks Munich University of Technology Germany Department of Electrical Engineering and Information Technology Munich University of Technology Germany

In addition to the integration of vehicles into traditional networks (e.g. access to the Internet via cellular) the Ad-hoc connection of vehicles within a limited area is a technology that promises a lot of innovative and exciting services. This paper starts with the description of some services to motivate Ad-hoc networking in the vehicular environment. It then gives an overview of the current challenges (especially routing protocols) in this field. If the geographic position of the network nodes is known, better performance can be achieved with the utilization of so called geocast routing-algorithms. An overview of geocast-routing is given and shortcomings of the existing protocols for the usage in inter-vehicle Ad-hoc networks are explained. Finally we make a proposal for a vehicle-optimized geocast routing, protocol that is based on AODV and present our prototype implementation.

关键词： Intelligent networks Spread spectrum communication Routing protocols Vehicles Mobile communication Testing IP networks Data communication Wireless LAN Broadcasting

来源：评论

学校读者我要写书评

暂无评论

An efficient approximate algorithm for delay-cost-constrained QoS routing

An efficient approximate algorithm for delay-cost-constraine...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Gang Feng K. Makki N. Pissinou C. Douligeris Department of Electrical and Computer Engineering University of Miami Coral Gables FL USA Center for Engineering and Applied science Telecommunication Information technology Florida International University Miami FL USA Florida International University Miami FL USA Department of Informatics University of Piraeus Piraeus Greece

The problem of finding a path with two additive constraints is called a multi-constrained path (MCP) problem in the literature. In this paper, we explore the MCP problem based on the idea of single mixed weight. Given two infeasible paths, it can be theoretically proved that a better path can possibly be found if we choose an appropriate parameter to construct the mixed weight. An approximate algorithm is thus proposed to solve the MCP problem. A large number of experiments on networks of different sizes demonstrate that this algorithm can make a correct judgment whether there is a feasible path or not with a very high probability. On the other hand, the time complexity of this algorithm is very small since it only needs to execute Dijkstra's algorithm a limited number of times even for a network of relatively large size.

关键词： Delay Routing

来源：评论

学校读者我要写书评

暂无评论

Low power design of a multi-mode transceiver

Low power design of a multi-mode transceiver

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： D. Soudris M. Perakis X. Mizas V. Mardiris K. Katis C. Dre A.E. Tzimas E.G. Metaxakis G. Kalivas N. Zervas S. Theoharis G. Theodoridis A. Thanailakis C. Goutis VLSI Design and Testing Center Department of Elec & Computer Engineering Democritus University of Thrace Xanthi Greece Department of Computer Engineering and Informatics University of Patras Greece INTRACOM S.A. Paiania Greece Applied Electronics Lab Department of Elec & Computer Engineering University of Patras Greece VLSI Design Lab Department of Elec & Computer Engineering University of Patras Greece

Recent advances in electronic technology integration coupled with increasing needs for more services in portable communications favors the development of high performance dual-mode terminals. We present the complete architecture implementation of the GMSK/GFSK modulator/demodulator including the FIR filters design. The main features of the modulator/demodulator and the architectural implementation of FIR filters are described. The interface with ASPIS processor and A/D & D/A converters is also described in detail manner. The whole architecture of the modulator/demodulator was described by VHDL hardware language, synthesised and implemented in Xilinx environment.

关键词： Transceivers Digital modulation Demodulation Finite impulse response filter GSM Very large scale integration Signal processing Digital-analog conversion Clocks Testing

来源：评论

学校读者我要写书评

暂无评论

A novel rigid object segmentation method based on multiresolution 3-D motion and luminance analysis

A novel rigid object segmentation method based on multiresol...

引用

IEEE International Conference on Image Processing

作者： T. Papadimitriou K.I. Diamantaras M.G. Strintzis M. Roumeliotis Educational Technology Laboratory University of Macedonia Thessaloniki Greece Department of Informatics Technological Educational Institute of Thessaloniki Sindos Greece Information Processing Laboratory Department Electrical and Computer Engineering Aristotle University of Thessaloniki Thessaloniki Greece Department Applied Informatics University of Macedonia Thessaloniki Greece

ISBN: (纸本)0780362977

We present a new image sequence segmentation method which combines both spatial and temporal information in a multiresolution framework. A region growing technique in a multiresolution scheme outputs an over-segmented partition of the image scene. Pure temporal information is collected for each region using a feature extraction/feature tracking technique. Motion information is further processed in a pyramidal robust motion estimation scheme, in order to calculate more complex motion parameters for each region. Regions obtained from the first step are clustered according to their motion models. This ensures that rigid objects with luminance discontinuities can be segmented correctly. The method has been successfully tested in real imagery and typical examples are presented.

关键词： Object segmentation Spatial resolution Image segmentation Image resolution Feature extraction Image sequences Layout Robustness Motion estimation Testing

来源：评论

学校读者我要写书评

暂无评论

Network design and control for multipoint-to-multipoint communications

引用

Electronics and Communications in Japan (Part I: Communications) 2000年第2期84卷

作者： Kazuhiko Kinoshita Junichiro Soeda Nariyoshi Yamai Tetsuya Takine Koso Murakami Department of Information Systems Engineering Graduate School of Engineering Osaka University Osaka Japan 565-0871 System Engine Group Multimedia Development Center Matsushita Electric Industrial Co. Ltd. Osaka Japan 571-0050 Computer Center Okayama University Okayama Japan 700-8530 Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University Kyoto Japan 606-8501

This paper considers the network design and control for multipoint-to-multipoint communications. We propose a new routing control method which includes the member connection method and the route setup algorithm. The former implies that each member has its own route to send information to other members. Thus, it can avoid traffic concentration in a particular route. Further, in the route setup algorithm, all routes are generated in parallel, by adding links which have lower cost and lower load one by one, based on grouping by the number of destination nodes on the route. An interesting feature of the proposed algorithm is that every route can be established with a unified algorithm, even when newcomers join ongoing communications. In addition to the above method, we also propose a network design algorithm. It can make the proposed routing control method more effective. Simulation experiments show that the proposed framework is suitable for multipoint-to-multipoint communications. © 2000 Scripta Technica, Electron Comm Jpn Pt 1, 84(2): 18–26, 2001

关键词： multipoint-to-multipoint communications Steiner tree problem routing algorithm network design

来源：评论

学校读者我要写书评

暂无评论

Station layouts in the presence of location constraints 10th

Station layouts in the presence of location constraints

引用

10th Annual International Symposium on Algorithms and Computation, ISAAC 1999

作者： Bose, Prosenjit Kaklamanis, Christos Kirousis, Lefteris M. Kranakis, Evangelos Krizanc, Danny Peleg, David University of Patras Department of Computer Engineering and Informatics PatrasRio 26500 Greece Carleton University School of Computer Science OttawaONK1S 5B6 Canada Canada Weitzman Institute Department of Applied Mathematics and Computer Science POB 26 76100 Israel

In wireless communication, the signal of a typical broadcast station is transmited from a broadcast center p and reaches objects at a distance, say, R from it. In addition there is a radius r, r © Springer-Verlag... 详细信息

ISBN: (纸本)3540669167

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Periodic compensation for sampled-data H/sup /spl infin// repetitive control

Periodic compensation for sampled-data H/sup /spl infin// re...

引用

IEEE Conference on Decision and Control

作者： H. Ishii Y. Yamamoto Department of Electrical and Computer Engineering University of Toronto Toronto Canada Departrnent of Applied Analysis and Complex Dynamical Systems Graduate School of Informatics Kyoto University Kyoto Japan

This work presents a new approach toward digital repetitive control. This approach employs a periodically time-varying compensator for the design of repetitive control. This yields extra freedom in designing this class of systems. This freedom can be effectively used to increase robustness in the design. An example is given to illustrate the result.

关键词： Control systems Digital control Sampling methods Robustness Robot control Manipulators Hard disks Protons Synchrotrons Power supplies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：