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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Shengyin Gu Olivier Poch Bernd Hamann Patrice Koehl Institute for Data Analysis and Visualization Department of Computer Science University of California Davis CA USA Laboratoire de Biologie Structurale IGBMC Strasbourg France Institute for Data Analysis and Visualization Department of Computer Science University of California Davis CA USA Genome Center University of California Davis CA USA

The amino acid sequence of a protein is the key to understanding its structure and ultimately its function in the cell. This paper addresses the fundamental issue of encoding amino acids in ways that the visualization of protein sequences facilitates the decoding of its information content. We show that a feature-based representation in a three-dimensional (3D) space derived from substitution matrices provides an adequate representation from which the domain content of a protein can be predicted. In addition, we show that each dimension of the feature space can be related to a physical property of the amino acids.

关键词： Amino acids Protein sequence Bioinformatics data visualization USA Councils Genomics Encoding data analysis Computer science Biological information theory

来源：评论

学校读者我要写书评

暂无评论

High-quality visualization for geographically distributed 3-D teleimmersive applications

High-quality visualization for geographically distributed 3-...

引用

作者： Vasudevan, Ramanarayan Kurillo, Gregorij Lobaton, Edgar Bernardin, Tony Kreylos, Oliver Bajcsy, Ruzena Nahrstedt, Klara Department of Electrical Engineering and Computer Sciences University of California Berkeley CA 94720 United States Department of Computer Science University of North Carolina at Chapel Hill Chapel Hill NC 27599 United States Institute for Data Analysis and Visualization University of California Davis Davis CA 95616 United States Department of Computer Science University of Illinois at Urbana Champaign Urbana IL 61801 United States

The growing popularity of 3-D movies has led to the rapid development of numerous affordable consumer 3-D displays. In contrast, the development of technology to generate 3-D content has lagged behind considerably. In spite of significant improvements to the quality of imaging devices, the accuracy of the algorithms that generate 3-D data, and the hardware available to render such data, the algorithms available to calibrate, reconstruct, and then visualize such data remain difficult to use, extremely noise sensitive, and unreasonably slow. In this paper, we present a multi-camera system that creates a highly accurate (on the order of a centimeter), 3-D reconstruction of an environment in real-time (under 30 ms) that allows for remote interaction between users. This paper focuses on addressing the aforementioned deficiencies by describing algorithms to calibrate, reconstruct, and render objects in the system. We demonstrate the accuracy and speed of our results on a variety of benchmarks and data collected from our own system. © 2011 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

The effect of a perceptual syntax on the learnability of novel concepts

The effect of a perceptual syntax on the learnability of nov...

引用

International Conference on Information Visualisation (IV)

作者： P. Irani C. Ware Department of Computer Science University of Manitoba Winnipeg NB Canada Data Visualization Research Laboratory University of New Hampshire Durham NH USA

Language theorists argue that the reason why spoken language is acquired so rapidly is that we have an innate predisposition for understanding linguistic structures. Theories of perception also hold that there may be deeply seated mechanisms for decomposing visual objects and analyzing them into both component parts and the structural interrelationships of those parts. We propose the theory that diagrams that activate the mechanisms for structural object perception should be similarly easy to learn. This builds on previous work in which we have developed diagramming principles based on the theory of structural object perception. We call these geon diagrams. We have previously shown that such diagrams are easy to remember and to analyze. To evaluate our hypothesis that geon diagrams should also be easy to understand we carried out an empirical study to evaluate the learnability of geon diagram semantics in comparison with the well-established UML convention. The results support our theory of learnability. Both "novices" and "experts" found the geon diagram syntax easier to apply in a diagram-to-textual description matching task than the equivalent UML syntax.

关键词： Unified modeling language Software engineering Natural languages Pediatrics Computer science data visualization Object recognition LAN interconnection Software systems Programming profession

来源：评论

学校读者我要写书评

暂无评论

Topology-based visualization of transformation pathways in complex chemical systems

Topology-based visualization of transformation pathways in c...

引用

13th Eurographics / IEEE Symposium on visualization, EuroVis 2011

作者： Beketayev, K. Weber, G.H. Haranczyk, M. Bremer, P.-T. Hlawitschka, M. Hamann, B. Computational Research Division Lawrence Berkeley National Laboratory United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Institute for Data Analysis and Visualization Department of Computer Science University of California Davis CA United States

(Figure Presented) Studying transformation in a chemical system by considering its energy as a function of coordinates of the system's components provides insight and changes our understanding of this process. Currently, a lack of effective visualization techniques for high-dimensional energy functions limits chemists to plot energy with respect to one or two coordinates at a time. In some complex systems, developing a comprehensive understanding requires new visualization techniques that show relationships between all coordinates at the same time. We propose a new visualization technique that combines concepts from topological analysis, multi-dimensional scaling, and graph layout to enable the analysis of energy functions for a wide range of molecular structures. We demonstrate our technique by studying the energy function of a dimer of formic and acetic acids and a LTA zeolite structure, in which we consider diffusion of methane. © 2011 The Author(s) Journal compilation © 2011 The Eurographics Association and Blackwell Publishing Ltd. Published by Blackwell Publishing.

关键词： Dimers

来源：评论

学校读者我要写书评

暂无评论

Segmenting Point Sets

Segmenting Point Sets

引用

International Conference on Shape Modeling and Applications

作者： I. Yamazaki V. Natarajan Zhaojun Bai B. Hamann Department of Computer Science University of California Davis CA USA Institute for Data Analysis and Visualization (IDAV) University of California Davis CA USA

Extracting features from point sets is becoming increasingly important for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sampled surface into distinct features without explicit construction of a mesh or other surface representation. Our approach achieves computational efficiency through a three-phase segmentation process. The first phase of the process uses a topo-logical approach to define features and coarsens the input, resulting in a set of supernodes, each one representing a collection of input points. A graph cut is employed in the second phase to bisect the set of supernodes. Similarity between supernodes is computed as a weighted combination of geodesic distances and connectivity. Repeated application of the graph cut results in a hierarchical segmentation of the point input. In the last phase, a segmentation of the original point set is constructed by refining the segmentation of the supernodes based on their associated feature sizes. We apply our segmentation algorithm on laser-scanned models to evaluate its ability to capture geometric features in complex data sets

关键词： Shape Feature extraction Spectral analysis data analysis data visualization Computer science data mining Computational efficiency Geophysics computing Laser beam cutting

来源：评论

学校读者我要写书评

暂无评论

APT Adversarial Defence Mechanism for Industrial IoT Enabled Cyber-Physical System

引用

IEEE Access 2023年 11卷 74000-74020页

作者： Javed, Safdar Hussain Ahmad, Maaz Bin Asif, Muhammad Akram, Waseem Mahmood, Khalid Das, Ashok Kumar Shetty, Sachin College of Computing and Information Sciences Karachi75190 Pakistan Lahore Garrison University Department of Computer Science Lahore54810 Pakistan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan International Institute of Information Technology at Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India Old Dominion University Simulation and Visualization Engineering Virginia Modeling Analysis and Simulation Center Department of Modeling SuffolkVA23435 United States Old Dominion University Center for Cybersecurity Education and Research SuffolkVA23435 United States

The objective of Advanced Persistent Threat (APT) attacks is to exploit Cyber-Physical Systems (CPSs) in combination with the Industrial Internet of Things (I-IoT) by using fast attack methods. Machine learning (ML) techniques have shown potential in identifying APT attacks in autonomous and malware detection systems. However, detecting hidden APT attacks in the I-IoT-enabled CPS domain and achieving real-time accuracy in detection present significant challenges for these techniques. To overcome these issues, a new approach is suggested that is based on the Graph Attention Network (GAN), a multi-dimensional algorithm that captures behavioral features along with the relevant information that other methods do not deliver. This approach utilizes masked self-attentional layers to address the limitations of prior Deep Learning (DL) methods that rely on convolutions. Two datasets, the DAPT2020 malware, and Edge I-IoT datasets are used to evaluate the approach, and it attains the highest detection accuracy of 96.97% and 95.97%, with prediction time of 20.56 seconds and 21.65 seconds, respectively. The GAN approach is compared to conventional ML algorithms, and simulation results demonstrate a significant performance improvement over these algorithms in the I-IoT-enabled CPS realm. © 2013 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

On-Line Reconstruction of CAD Geometry

On-Line Reconstruction of CAD Geometry

引用

International Conference on 3D Imaging, Modeling, Processing, visualization and Transmission (3DIMPVT)

作者： Klaus Denker Daniel Hagel Jakob Raible Georg Umlauf Bernd Hamann Computer Graphics Laboratory Department of Computer Science Konstanz University of Applied Sciences Konstanz Germany Institute for Data Analysis and Visualization Department of Computer Science University of California Davis CA USA

In reverse engineering and computer-aided design (CAD) applications point cloud data is usually manually scanned, reconstructed, and post-processed in separated steps. When point cloud data resulting from a scanning process do not satisfy certain necessary reconstruction requirements, one must perform scanning again to enable proper reconstruction. On-line reconstruction of 3d geometry allows one to generate and update a CAD reconstruction on-line during the scanning process with an hand-held laser scanner. Thus, regions where the scanned data is insufficient for the reconstruction are detected on the fly to allow an immediate correction and improvement of the scanned data. This enables the operator to focus on critical regions in the scanned data to improve the reconstruction quality. We present an on-line segmentation and on-line reconstruction of basic geometric primitives. The presented methods allow for a real-time processing of a point stream. They utilize data structures that can be updated at any time when additional data from the stream has to be processed. This data is used to complete and improve the segmentation and reconstruction during the scanning process.

关键词： Surface reconstruction Geometry Image reconstruction Shape Lasers Design automation Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Graph-based combinations of fragment descriptors for improved 3D object retrieval 12

Graph-based combinations of fragment descriptors for improve...

引用

3rd ACM Multimedia Systems Conference, MMSys'12

作者： Schreck, Tobias Scherer, Maximilian Walter, Michael Bustos, Benjamin Yoon, Sang Min Kuijper, Arjan Data Analysis and Visualization Group University of Konstanz Germany Interactive Graphics Systems Technische Universität Darmstadt Germany KDW+PRISMA Department of Computer Science University of Chile Chile Yonsei Institute of Convergence Technology Yonsei University Korea Republic of Fraunhofer Institute for Computer Graphics Research Darmstadt Germany

ISBN: (纸本)9781450311311

3D Object Retrieval is an important field of research with many application possibilities. One of the main goals in this research is the development of discriminative methods for similarity search. The descriptor-based approach to date has seen a lot of research attention, with many different extraction algorithms proposed. In previous work, we have introduced a simple but effective scheme for 3D model retrieval based on a spatially fixed combination of 3D object fragment descriptors. In this work, we propose a novel flexible combination scheme based on finding the best matching fragment descriptors to use in the combination. By an exhaustive experimental evaluation on established benchmark data we show the capability of the new combination scheme to provide improved retrieval effectiveness. The method is proposed as a versatile and inexpensive method to enhance the effectiveness of a given global 3D descriptor approach. © 2012 ACM.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Implicit Surface Modeling Suitable for Inside/Outside Tests with Radial Basis Functions

Implicit Surface Modeling Suitable for Inside/Outside Tests ...

引用

IEEE International Conference on Computer-Aided Design and Computer Graphics

作者： Rongjiang Pan Vaclav Skala School of Computer Science and Technology Shandong University Jinan China Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plzen Czech Republic

We describe a method for computing an implicit function that represents a surface by its zero level set, given a set of points scattered over the surface and associated with surface normal vectors. This implicit function is defined as a linear combination of compactly supported radial basis functions. Our method is suitable for testing whether a given point is interior or exterior to the surface, previously only associated with globally supported or globally regularized radial basis functions. We use a two-level interpolation approach. In the coarse scale interpolation, we set basis function centers by a grid that covers the enlarged bounding box of the given point set and compute their signed distances to the underlying surface using local quadratic approximations of the nearest surface points. Then a fitting to the residual errors on the surface points and additional off-surface points is performed with fine scale basis functions. The final function is the sum of the two intermediate functions and is a good approximation of the signed distance field to the surface in the bounding box. Examples of surface reconstruction and set operations between shapes are provided.

关键词： Testing Surface fitting Surface reconstruction Computer science Interpolation Computer graphics data visualization data engineering Level set Scattering

来源：评论

学校读者我要写书评

暂无评论

Continuous global optimization in surface reconstruction from an oriented point cloud

arXiv

引用

arXiv 2017年

作者： Pan, Rongjiang Skala, Vaclav School of Computer Science and Technology Shandong University Jinan China Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plzen Czech Republic

We introduce a continuous global optimization method to the field of surface reconstruction from discrete noisy cloud of points with weak information on orientation. The proposed method uses an energy functional combining flux-based data-fit measures and a regularization term. A continuous convex relaxation scheme assures the global minima of the geometric surface functional. The reconstructed surface is implicitly represented by the binary segmentation of vertices of a 3D uniform grid and a triangulated surface can be obtained by extracting an appropriate isosurface. Unlike the discrete graph-cut solution, the continuous global optimization entails advantages like memory requirements, reduction of metrication errors for geometric quantities, allowing globally optimal surface reconstruction at higher grid resolutions. We demonstrate the performance of the proposed method on several oriented point clouds captured by laser scanners. Experimental results confirm that our approach is robust to noise, large holes and non-uniform sampling density under the condition of very coarse orientation information. Copyright © 2017, The Authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：