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

14th International Conference on Vision, Modeling, and Visualization, VMV 2009

作者： Sellent, Anita Eisemann, Martin Goldlücke, Bastian Pock, Thomas Cremers, Daniel Magnor, Marcus Institut für Computergraphik TU Braunschweig Germany Department of Computer Science University of Bonn Germany Institute for Computer Graphics and Vision Graz University of Technology Austria

ISBN: (纸本)9783980487481

Traditional optic flow algorithms rely on consecutive short-exposure images. In contrast, longexposed images contain integrated motion information directly in form of motion blur. In this paper, we show how the additional information provided by a long exposure image can be used to improve robustness and accuracy of motion field estimation. Recently, an image formation model was introduced [23] that relates a long-exposure image to preceding and succeeding short-exposure images in terms of dense 2D motion and occlusion. We formulate the original two-step problem for motion and occlusion timings as a joint minimization problem and derive a global TV-L1 energy functional that can be minimized efficiently and accurately. The approach is able to calculate highly accurate motion fields, assigning motion to occluded and disoccluded image regions in one joint optimization procedure.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Image analysis applications of morphological operators based on uninorms

Image analysis applications of morphological operators based...

引用

Joint 2009 International Fuzzy Systems Association World Congress, IFSA 2009 and 2009 European Society of Fuzzy Logic and Technology Conference, EUSFLAT 2009

作者： Hidalgo, Manuel González Torres, Arnau Mir Aguilera, Daniel Ruiz Sastre, Joan Torrens Computer Vision Graphics and Artificial Intelligence Group Maths. and Computer Science Department Spain Fuzzy Logic and Information Fusion Group Maths. and Computer Science Department Universitat de les Illes Balears Palma de Mallorca Spain

ISBN: (纸本)9789899507968

This paper presents a continuation of the study on a mathematical morphology based on left-continuous conjunctive uninorms given in [1]. Experimental results are displayed using the morphological Top-Hat transformation, used to highlight certain components of the image, and on the reduction and elimination of noise using alternate filters that are generated with the operators of opening and closing associated with these morphological operators.

关键词： Mathematical morphology

来源：评论

学校读者我要写书评

暂无评论

Advanced perceptual user interfaces: Applications for disabled and elderly people

引用

12th IFIP TC 13 International Conference on Human-computer Interaction, INTERACT 2009

作者： López, Francisco J. Perales Computer Graphics Vision and Antificial Inteligence Group Mathematics and Computer Science Department UIB Crta. Valldemossa Km 7.5 Palma de Mallorca 07122 Spain

ISBN: (纸本)3642036570

The research of new human-computer interfaces has become a growing field in computer science, which aims to attain the development of more natural, intuitive, unobtrusive and efficient interfaces. This objective has come up with the concept of Perceptual User Interfaces (PUIs) that are turning out to be very popular as they seek to make the user interface more natural and compelling by taking advantage of the ways in which people naturally interact with each other and with the world. PUIs can use speech and sound recognition and generation, computer vision, graphical animation and visualization, language understanding, touch-based sensing and feedback (haptics), learning, user modeling and dialog management. © 2009 Springer Berlin Heidelberg.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Experimental analysis and 3D-visualization of oscillating hollow-conical liquid sheets in quiescent air 11

Experimental analysis and 3D-visualization of oscillating ho...

引用

11th International Annual Conference on Liquid Atomization and Spray Systems, ICLASS 2009

作者： Musemic, E. Rojek, A. Gaspar, M. Weichert, F. Müller, H. Walzel, P. Department of Biochemical and Chemical Engineering Technical University of Dortmund DortmundD-44227 Germany Department of Computer Science VII Computer Graphics Technical University of Dortmund DortmundD-44227 Germany

ISBN: (纸本)9781617826535

This work deals with the investigation on propagating hollow-conical liquid sheets formed by a pressure swirl atomizer during the process of sheet disintegration in quiescent air. In difference to the non-invasive image based spray analysis shown by several authors, we applied an invasive experimental approach based on polymer optical waveguides. This setup allows for measurement of sheet characteristics in 2D, interpolating the data in the area between the eight sensors. The distance of these eight sensors from the nozzle orifice was graduated in small steps in order to collect sheet characteristics of the whole hyperbolical sheet. Combining the experimental results of the 2D measurements, by means of 3D reconstruction, enables visualization of the sheet behavior in 3D. Linear instability models for thinning, viscous and inviscid liquid sheets, as available from the literature, are the basis for a comparison of experimental data and predicted sheet behavior. The coexistence of longitudinal and lateral waves at lower We-numbers was confirmed, leading to the conclusion that the presence of lateral waves has to be considered. Copyright © ICLASS *** right reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Practicing what we preach: IEEE VR 2009 virtual program committee meeting

Practicing what we preach: IEEE VR 2009 virtual program comm...

引用

作者： Lindeman, Robert W. Reiners, Dirk Steed, Anthony Human Interaction in Virtual Environments Lab Department of Computer Science Worcester Polytechnic Institute Worcester MA United States Center for Advanced Computer Studies University of Louisiana Lafayette LA United States Virtual Environments and Computer Graphics Group Department of Computer Science University College London London United Kingdom

This article reports on the experience of conducting the program committee (PC) meeting for the IEEE VR 2009 conference in Second Life. More than 50 PC members from around the globe met virtually over a two-day period to decide which papers to accept for presentation at the conference. Survey responses from 42 of the PC members indicate generally positive feelings toward this meeting format, although several alterations will help improve interaction between attendees in future meetings. © 2009 IEEE.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Image retrieval: Techniques, challenge, and trend

引用

World Academy of science, Engineering and Technology 2009年 36卷 718-720页

作者： Wang, Hui Hui Mohamad, Dzulkifli Ismail, N.A. Department of Computer Graphics and Multimedia Faculty of computer science and information Technology UTM Skudai Malaysia

This paper attempts to discuss the evolution of the retrieval techniques focusing on development, challenges and trends of the image retrieval. It highlights both the already addressed and outstanding issues. The explosive growth of image data leads to the need of research and development of Image Retrieval. However, Image retrieval researches are moving from keyword, to low level features and to semantic features. Drive towards semantic features is due to the problem of the keywords which can be very subjective and time consuming while low level features cannot always describe high level concepts in the users' mind.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

On Faster Bounding Volume Hierarchy Construction for Avatar Collision Detection

On Faster Bounding Volume Hierarchy Construction for Avatar ...

引用

International Conference on computer Technology and Development (ICCTD)

作者： Norhaida Mohd Suaib Abdullah Bade Dzulkifli Mohamad Hamzah Asyrani Sulaiman Department of Computer Graphics & Multimedia Faculty of Computer Science & Information System Universiti Teknologi Malaysia Johor Malaysia Department of Computer Graphics & Multimedia Faculty of Computer Science & Information System Department of Computer Graphics & Multimedia Faculty of Computer Science & Information System Universiti Teknologi Malaysia Johor Malaysia

In many interactive computer graphics applications, users are represented as virtual characters called avatars. Collision detection is a pre-requisite in interactive computer graphics application so that appropriate response and realistic behaviour can be generated. However, it will not be easy to anticipate collisions since objects' motion are dependant on user interaction and avatar manipulation. Ideally, collision detection needs to be done efficiently, with accurate result in the shortest time possible. However, due to its computationally intensive nature, collision detection could cause a bottleneck to the system. A variety of techniques, data structures and algorithms were proposed to accelerate the collision detection process. Acceleration data structures are widely used not only to promote faster collision detection, but also in the field of ray tracing and deformable objects simulation. This paper discusses the use of bounding volume hierarchy as an acceleration data structure in collision detection for avatar in virtual environment, as well as similar methods used in interactive ray tracing and deformable objects simulation. Based on these findings, method for fast bounding volume hierarchy construction is proposed as a first step towards efficient avatar collision detection.

关键词： Avatars computer graphics Application software Data structures Virtual reality Multimedia systems computer science Information systems Turing machines Virtual environment

来源：评论

学校读者我要写书评

暂无评论

Texture Synthesis with Prioritized Pixel Re-synthesis

引用

Journal of Information science and Engineering 2009年第2期25卷 389-402页

作者：嚴崇仁李同益 Computer Graphics Group/Visual System Laboratory Department of Computer Science and Information Engineering National Cheng Kung University

In this paper, we propose a new patch-based texture synthesis method. The core of the proposed method consists of two main components: (1) a feature-weighted similarity measurement to search for the best match and (2) a dynamically prioritized-based pixel re-synthesis to reduce discontinuity at the boundary of adjacent patches. Examples and experimental comparisons with other previous methods are demonstrated to verify the usefulness of our proposed method. In addition, we enhance the proposed method with a view warping technique to better synthesize non-frontal-parallel textures (NFPTs) that can not be synthesized well by traditional texture synthesis methods.

关键词： patch-based texture synthesis, prioritized-based pixel re-synthesis, feature- weighted, best match, discontinuity, frontal-parallel (FP) and non-frontal-parallel (NFP), view-warping

来源：评论

学校读者我要写书评

暂无评论

Estimating and Exploiting the Degree of Independent Information in Distributed Data Fusion

Estimating and Exploiting the Degree of Independent Informat...

引用

International Conference on Information Fusion

作者： Simon J. Julier Virtual Environments and Computer Graphics Group Department of Computer Science University College London

ISBN: (纸本)9780982443804

Double counting is a major problem in distributed data fusion systems. To maintain flexibility and scalability, distributed data fusion algorithms should just use local information. However globally optimal solutions only exist in highly restricted circumstances. Suboptimal algorithms can be applied in a far wider range of cases, but can be very conservative. In this paper we present preliminary work to develop distributed data fusion algorithms that can estimate and exploit the correlations between the estimates stored in different nodes in a distributed data fusion network. We show that partial information can be modelled as kind of "overweighted" Covariance Intersection algorithm. We motivate the need for an adaptive scheme by analysing the correlation behaviour of a simple distributed data fusion network and show that it is complicated and counterintuitive. Two simple approaches to estimate the correlation structure are presented and their results analysed. We show that significant advantages can be obtained.

关键词： Tracking Filtering Estimation Distributed data fusion Covariance intersection Bounded covariance inflation Unmanned aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

G-hash: Towards fast kernel-based similarity search in large graph databases 09

G-hash: Towards fast kernel-based similarity search in large...

引用

12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

作者： Wang, Xiaohong Smalter, Aaron Huan, Jun Lushington, Gerald H. Department of Electrical Engineering and Computer Science University of Kansas Lawrence KS United States Molecular Graphics and Modeling Laboratory University of Kansas Lawrence KS United States

ISBN: (纸本)9781605584225

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others. Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database. Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the inde

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：