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

26th IEEE Conference on computer Vision and Pattern Recognition (CVPR 2008), vol.8

作者： Jie Chen Shiguang Shan Guoying Zhao Xilin Chen Wen Gao Matti Pietikainen School of Computer Science and Technology Harbin Institute of Technology Harbin China Machine Vision Group Department of Electrical and Information Engineering University of Oulu Finland Languages Informatics Systems and Software Engineering Department Faculty of Computer Science Chinese Academy and Sciences Beijing China

Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human perception of a pattern depends on not only the change of a stimulus (such as sound, lighting, et al.) but also the original intensity of the stimulus. Specifically, WLD consists of two components: its differential excitation and orientation. A differential excitation is a function of the ratio between two terms: One is the relative intensity differences of its neighbors against a current pixel;the other is the intensity of the current pixel. An orientation is the gradient orientation of the current pixel. For a given image, we use the differential excitation and the orientation components to construct a concatenated WLD histogram feature. Experimental results on Brodatz textures show that WLD impressively outperforms the other classical descriptors (e.g., Gabor). Especially, experimental results on face detection show a promising performance. Although we train only one classifier based on WLD features, the classifier obtains a comparable performance to state-of-the-art methods on MIT+CMU frontal face test set, AR face dataset and CMU profile test set.

关键词： Robustness Face detection Humans Content addressable storage Testing Psychology Laboratories Machine intelligence Information processing computers

来源：评论

学校读者我要写书评

暂无评论

Supporting end-to-end resource virtualization for web 2.0 applications using service oriented architecture

Supporting end-to-end resource virtualization for web 2.0 ap...

引用

2008 IEEE Globecom Workshops, GLOBECOM 2008

作者： Papagianni, C. Karagiannis, G. Tselikas, N.D. Sfakianakis, E. Chochliouros, I.P. Kabilafkas, D. Cinkler, T. Westberg, L. SjÖdin, P. Hidell, M. De Groot, S. Heemstra Kontos, T. Katsigiannis, C. Pappas, C. Antonakopoulou, A. Venieris, I.S. School of Electrical and Computer Engineering National Technical University of Athens Greece CTIT and Department of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Netherlands Department of Telecommunications Science and Technology University of Peloponnese Greece Research Programs Section Labs and New Technologies Division ellenic Telecommunications Organization S.A. Switching and Services Laboratory Labs and New Technologies Division Hellenic Telecommunications Organization S.A. Greece Department of Telecommunications and Media Informatics Budapest University of Technology and Economics Hungary Ericsson Research Stockholm Sweden School of Information and Communication Technology Royal Institute of Technology Stockholm Sweden Twente Institute for Wireless and Mobile Communication Enschede Netherlands Siemens IT Solutions and Services Athens Greece

ISBN: (纸本)9781424430628

In recent years, technologies have been introduced offering a large amount of computing and networking resources. New applications such as Google AdSense and BitTorrent can profit from the use of these resources. An efficient way of discovering and reserving these resources is by using the Service Oriented Architecture (SOA) concept. SOA can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. This paper presents an architecture that can be used to support end-to-end resource virtualization for Web 2.0 applications and in particular for peer-to-peer applications by using the Service Oriented Architecture concept. © 2008 IEEE.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Estimation and representation of accumulated motion characteristics for semantic event detection

Estimation and representation of accumulated motion characte...

引用

IEEE International Conference on Image Processing

作者： Georgios Th. Papadopoulos Vasileios Mezaris Ioannis Kompatsiaris Michael G. Strintzis Informatics and Telematics Institute Centre for Research and Technology Hellas Greece Information Processing Laboratory Electrical & Computer Eng. Department Aristotle University of Thessaloniki Greece

In this paper, a motion-based approach for detecting high-level semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be directly applied to any possible domain of concern without the need for domain-specific algorithmic modifications or adaptations. For realizing event detection, the examined video sequence is initially segmented into shots and for every resulting shot appropriate motion features are extracted. Then, Hidden Markov Models (HMMs) are employed for performing the association of each shot with one of the high-level semantic events that are of interest in any given domain. Regarding the motion feature extraction procedure, a new representation for providing local-level motion information to HMMs is presented, while motion characteristics from previous frames are also exploited. Experimental results as well as comparative evaluation from the application of the proposed approach in the domain of news broadcast video are presented.

关键词： Motion estimation Event detection Hidden Markov models Video sequences Video sharing Feature extraction Multimedia communication Broadcasting Motion analysis Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic segmentation of the lung fields in portable chest radiographs based on Bézier interpolation of salient control points

Automatic segmentation of the lung fields in portable chest ...

引用

IEEE International Workshop on Imaging Systems and Techniques (IST)

作者： Dimitris K. Iakovidis George Papamichalis Department of Informatics and Computer Technology Technological Educational Institute of Lamia Lamia Greece 1st Department of Thoracic Surgery Chest Hospital Athens Sotiria Athens Greece

Portable chest radiographs are performed on the most critically-ill patients, who need highly skilled patient care and the best diagnostic tools. However, such radiographs are usually of low quality, mainly due to misaligned body positioning during their acquisition, and subject to a higher misinterpretation rate than the ones obtained with a non-portable X-ray device. This paper presents a pioneering computational approach that copes with the segmentation of the lung fields in portable chest radiographs. The proposed methodology involves detection of salient points on the anatomic structures around the lung fields by subsequent application of simple intensity and edge feature extraction techniques. The salient points detected are interpolated using Bezier curves intuitively approximating the boundaries of the lung fields. Unlike current methodologies, the proposed one does not exclude the overlapping region of the heart from the lung fields, where abnormalities can also be present. The results illustrate the robustness of the proposed methodology on a set of real portable radiographs of patients with bacterial pulmonary infections. A qualitative comparison with a state of the art approach based on graph cuts validates its effectiveness.

关键词： Lungs Diagnostic radiography Image segmentation Radiography Image edge detection Pixel Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Trust Management Framework for Efficient Service Provisioning in Dynamic Distributed Computing Environments

Trust Management Framework for Efficient Service Provisionin...

引用

International Conference on Internet and Web Applications and Services (ICIW)

作者： Malamati Louta Angelos Michalas Department of Information and Communication Technologies Engineering University of Western Macedonia Koza-gun Greece Department of Informatics and Computer Technology Technological Educational Institute of Western Macedonia Kastoria Greece

In dynamic distributed computing environments, system entities may be classified into two main categories that are, in principle, in conflict. These are the Service Resource Requestors (SRRs) wishing to use services and/or exploit resources offered by the other system entities and the Service Resource Providers (SRPs) that offer the services/resources requested. Seeking for the maximisation of their welfare, while achieving their own goals and aims, entities may misbehave (intentionally or unintentionally), thus, leading to a significant deterioration of system's performance. In this study, a reputation mechanism is proposed which helps estimating SRPs trustworthiness and predicting their future behaviour, taking into account their past performance in consistently satisfying SRRs' expectations. The reputation mechanism is distributed, considers both first-hand information (acquired from the SRR's direct past experiences with the SRPs) and second-hand information (disseminated from other SRRs' past experiences with the SRPs), while it exhibits a robust behaviour against inaccurate reputation ratings.

关键词： Environmental management Distributed computing Educational technology System performance Collaboration Intelligent sensors Web and internet services Conference management Authentication Authorization

来源：评论

学校读者我要写书评

暂无评论

Project management stage mutations within agile methodological framework process transformations

引用

WSEAS Transactions on Information Science and Applications 2008年第5期5卷 776-785页

作者： Markopoulos, Evangelos Bilbao, Javier Bravo, Eugenio Stoilov, Todor Vos, Tanjia E.J. Talamanca, Carlo Figa Reschwamm, Katrin Department of Informatics University of Piraeus 80 Karaoli and Dimitriou Str. Piraeus Greece Applied Mathematics Dept. University of the Basque Country Alda. Urkijo s/n. Bilbao Spain Dept. Hierarchical Systems Institute of Computer and Communication Systems Bulgarian Academy of Sciences Acad. Bonchev str. Sofia Bulgaria Information Technology Institute University of Valencia Camino de Vera s/n Valencia Spain Technology Division - ICT Area Via Giacomo Peroni 386 Roma Italy The Fraunhofer Institute for Factory Operation and Automation Fraunhofer IFF ICCL Sandtorstrasse 22 Magdeburg Germany

Projects are living entities. They are born with the project idea and end with the project termination. The time in between can last for many years, in most of the cases, requiring continuous implementation and management effort. Over the time project changes on requirements change the implementation process and in turn the management process, the maintenance process and so on. In order to maintain qualitative and quantitative project results both the project implementation and management processes need to be adjusted in the overall project changes and environment. This adjustment can be made by using agile project management methodologies, defining processes based on the identification of the project goals, constraints and expatiations. Unfortunately that is not enough, and projects, especially software projects are still in implementation and management crisis. This paper presents the concept of process mutation on project management methodological frameworks as a supplementary method to the agile models and agility the concept.

关键词： Project Management Agility Process Mutation Process Framework

来源：评论

学校读者我要写书评

暂无评论

Fast Power-Up Active Link Protection in Autonomous Distributed Transmitter Power Control

Fast Power-Up Active Link Protection in Autonomous Distribut...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Savvas Gitzenis Nicholas Bambos The Center of Research and Technology Informatics and Telematics Institute Greece Department of Computer & Communication Engineering University of Thessally Greece Electrical Engineering Department and Management Science and Engineering Department University of Stanford USA

ISBN: (纸本)9781424422012

In this work, we propose an enhancement to the DPC/ALP (distributed power control with active link protection) algorithm that allows fast power ramp-up without compromising the ALP guarantee. The original DPC algorithm was first augmented with ALP to provide absolute performance guarantees. The basis of active link protection lies on constraining the rate of the new links' transmission power increase during the admission process, inducing a trade-off between the duration of the admission process and the network capacity reserved for absorbing the SINR fluctuations. Thus, to minimize the capacity loss, power-up should be slow, prolonging admission delay. In the new scheme, the power-up is accelerated when congestion is low, via test transmissions. Specifically, pairs of mini slots are interleaved between payload-carrying slots. In the first mini- slot, a link has the opportunity to carry out a test transmission in the wireless channel at an arbitrarily high power level, greater than what DPC/ALP allows. The purpose of this test transmission is to communicate the desired transmission power to the other links in the network neighborhood. The latter respond in the second mini-slot, indicating their distress if the first mini-slot transmissions generated excessive interference to their receivers. The absence of transmission at the second mini-slot signifies that no link has opposed, thus the link is free to use the first mini-slot's high power level in their subsequent slots, realizing the fast power ramp up. In contrast, if a transmission is sensed in the second mini-slot (emanating from one or more links in distress - typical under network congestion, when links are closely packed), the power ramp up will revert to the standard increase of DPC/ALP.

关键词： Interference Signal to noise ratio Receivers Noise Gain Wireless sensor networks Transmitters

来源：评论

学校读者我要写书评

暂无评论

Expression-Compensated 3D Face Recognition with Geodesically Aligned Bilinear Models

Expression-Compensated 3D Face Recognition with Geodesically...

引用

IEEE International Conference on Biometrics: Theory, Applications, and Systems (BTAS)

作者： Iordanis Mpiperis Sotiris Malassiotis Michael G. Strintzis Informatics and Telematics Institute Centre for Research and Technology Hellas Thessaloniki Greece Information Processing Laboratory Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki Greece

In this paper, we present a technique for addressing 3-dimensional face recognition in presence of facial expressions using a bilinear model. The bilinear model allows decoupling the impact of identity and expression on face appearance and encoding their contribution in separate control parameters. This is achieved by first representing faces as parametric surface models described by a fixed length parameter vector. A generic face model is fitted to each face based on a novel technique that relies on geodesic distances to find implicitly corresponding facial landmarks between the model and the face in hand. Model parameters are then used for bilinear decomposition. The experimental results on the publicly available BU-3DFE face database demonstrate the effectiveness of our technique.

关键词： Face recognition Deformable models Face detection Databases Iterative closest point algorithm Surface fitting Encoding Wavelet coefficients Nose Skin

来源：评论

学校读者我要写书评

暂无评论

Design space exploration for a coarse grain accelerator

Design space exploration for a coarse grain accelerator

引用

Asia and South Pacific Design Automation Conference

作者： Farhad Mehdipour Hamid Noori Morteza Saheb Zamani Koji Inoue Kazuaki Murakami Research Institute for Information Technology Computing and Communication Center Kyushu University Fukuoka Japan Department of Informatics Graduate Kyushu University Fukuoka Japan Department of IT and Computer Engineering Amirkabir University of Technology슠 Tehran Iran

ISBN: (纸本)9781424419210;1424419212

In the design process of a reconfigurable accelerator employing in an embedded system, multitude parameters may result in remarkable complexity and a large design space. Design space exploration as an alternative to the quantitative approach can be employed to find a right balance between the different design parameters. In this paper, a hybrid approach is introduced to analytically explore the design space for a coarse grain accelerator and determine a wise design point exploiting data extracted from applications, quantitatively. It also provides flexibility for taking into account new design constraints as well as new characteristics of applications. Furthermore, this approach is a methodological approach which reduces the design time and results in a point which satisfies the design goals.

关键词： Space exploration Acceleration Hardware computer architecture Embedded computing Space technology Process design System-on-a-chip Reconfigurable architectures Design methodology

来源：评论

学校读者我要写书评

暂无评论

Access point assignment algorithms in WLANs based on throughput objectives

Access point assignment algorithms in WLANs based on through...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Ioannis Koukoutsidis Vasilios A. Siris Department Informatics and Telecommunications National and Kapodistrian University of Athens Athens Greece Foundation for Research and Technology-Hellas Institute of Computer Science (FORTH-ICS) University of Crete Crete Greece

In this article we present branch-and-bound algorithms for the access point assignment problem in WLANs, when the objective function is based on the throughput of stations in the network. We consider: a) maximizing the aggregate throughput, b) achieving lexicographically max-min fair throughputs, c) achieving proportionally fair throughputs. The performance of all branch-and-bound algorithms is examined for various degrees of approximation. Thus we show trade-offs between the increased cost of exploration and improvement in the objective value. We further compare their performance to that of greedy algorithms, embedded as a depth-first-search in the branch-and-bound methods. An omnipresent result is the near-optimal performance of the greedy algorithms, which is particularly important when considering their practical application. In all cases, the performance of the algorithms improves as the distribution of wireless stations becomes more concentrated in areas of the network, as in hotspot topologies.

关键词： Throughput Aggregates Greedy algorithms informatics computer science Wireless LAN Approximation algorithms Costs Network topology Interference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：