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

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： Dongming Han Haiyang Zhu Wei Chen Jiacheng Pan Ran Chen Xumeng Wang Zhen Wen Luoxuan Weng Minfeng Zhu Yingcai Wu Rüdiger Westermann State Key Lab of CAD&CG Zhejiang University China Hithink RoyalFlush Information Network Co. Ltd. China Wuchan Zhongda Digital Technology Co. Ltd. China Laboratory of Art and Archaeology Image (Zhejiang University) Ministry of Education China College of Computer Science Nankai University China Zhejiang University China Computer Graphics and Visualization Technical University of Munich Germany

ISBN: (数字)9798350393804

ISBN: (纸本)9798350393811

Authoring graph visualization requires advanced programming skills, expert domain knowledge, and significant workload. Existing authoring tools either support limited templates of graph visualization, or suffer from a high learning cost. We analyze the design requirements on a tool for graph visualizations, and contribute Nuwa, a user-friendly declarative authoring tool for the interactive specification of graph visualizations in terms of data, entity, change, and encoding. Our implementation empowers users to conveniently create, compare, and modulate comprehensive graph visualizations with a wide range of styles. We showcase various examples to verify the expressiveness of Nuwa. Via an expert interview and the analysis on cognitive dimensions we evaluate the usability of Nuwa.

关键词： Analytical models Authoring systems Costs Semantics Data visualization Prototypes Programming

来源：评论

学校读者我要写书评

暂无评论

Discovery of Novel Androgen Receptor Ligands by Structure-based Virtual Screening and Bioassays

引用

Genomics, Proteomics & Bioinformatics 2018年第6期16卷 416-427页

作者： Wenfang Zhou Mojie Duan Weitao Fu Jinping Pang Qin Tang Huiyong Sun Lei Xu Shan Chang Dan Li Tingjun Hou College of Pharmaceutical Sciences Zhejiang University State Key Laboratory of Computer Aided Design and Computer Graphics (CAD&GC) Zhejiang University State Key Laboratory of Magnetic Resonance and Atomic and Molecular Physics National Center for Magnetic Resonance in WuhanWuhan Institute of Physics and MathematicsChinese Academy of Sciences Institute of Bioinformatics and Medical Engineering School of Electrical and Information EngineeringJiangsu University of Technology

Androgen receptor(AR) is a ligand-activated transcription factor that plays a pivotal role in the development and progression of many severe diseases such as prostate cancer, muscle atrophy, and osteoporosis. Binding of ligands to AR triggers the conformational changes in AR that may affect the recruitment of coactivators and downstream response of AR signaling ***, AR ligands have great potential to treat these diseases. In this study, we searched for novel AR ligands by performing a docking-based virtual screening(VS) on the basis of the crystal structure of the AR ligand binding domain(LBD) in complex with its agonist. A total of 58 structurally diverse compounds were selected and subjected to LBD affinity assay, with five of them(HBP1-3, HBP1-17, HBP1-38, HBP1-51, and HBP1-58) exhibiting strong binding to AR-LBD. The IC50 values of HBP1-51 and HBP1-58 are 3.96 m M and 4.92 m M, respectively, which are even lower than that of enzalutamide(Enz, IC50= 13.87 m M), a marketed second-generation AR antagonist. Further bioactivity assays suggest that HBP1-51 is an AR agonist, whereas HBP1-58 is an AR antagonist. In addition, molecular dynamics(MD) simulations and principal components analysis(PCA) were carried out to reveal the binding principle of the newlyidentified AR ligands toward AR. Our modeling results indicate that the conformational changes of helix 12 induced by the bindings of antagonist and agonist are visibly different. In summary,the current study provides a highly efficient way to discover novel AR ligands, which could serve as the starting point for development of new therapeutics for AR-related diseases.

关键词： Androgen receptor AR ligand Virtual screening AR agonist AR antagonist

来源：评论

学校读者我要写书评

暂无评论

Feature-Adaptive Rendering of Loop Subdivision Surfaces on Modern GPUs

引用

Journal of computer Science & Technology 2014年第6期29卷 1014-1025页

作者：黄韵岑冯结青 Matthias Nie?ner 崔元敏杨宝光 CCF State Key Laboratory of CAD&CG Zhejiang University ACM Computer Graphics Laboratory Stanford UniversityStanfordCA 94305U.S.A. Qualcomm Technologies Incorporation San DiegoCA 92121U.S.A.

We present a novel approach for real-time rendering Loop subdivision surfaces on modern graphics hardware. Our algorithm evaluates both positions and normals accurately, thus providing the true Loop subdivision surface. The core idea is to recursively refine irregular patches using a GPU compute kernel. All generated regular patches are then directly evaluated and rendered using tile hardware tessellation unit. Our approach handles triangular control meshes of arbitrary topologies and incorporates common subdivision surface features such as semi-sharp creases and hierarchical edits. While surface rendering is accurate up to machine precision, we also enforce a consistent bitwise evaluation of positions and normals at patch boundaries. This is particularly useful in the context of displacement mapping which strictly requires inatching surface normals. Furthermore, we incorporate efficient level-of-detail rendering where subdivision depth and tessellation density can be adjusted on-the-fly. Overall, our algorithm provides high-quality results at real-time frame rates, thus being ideally suited to interactive rendering applications such as video games or authoring tools.

关键词： real-time rendering Loop subdivision surface hardware tessellation

来源：评论

学校读者我要写书评

暂无评论

Optimal constrained explicit multi-degree reduction approximation of DP curves

引用

Journal of Information and Computational Science 2011年第6期8卷 869-876页

作者： Liu, Gang Wang, Guojin Institute of Computer Images and Graphics Zhejiang University Hangzhou 310027 China State Key Laboratory of CAD and CG Zhejiang University Hangzhou 310027 China

DP curves, which possess the shape-preserving property and linear complexity evaluation algorithm, occupy a significantly important place in computer aided geometric design. Thus to do the research on the DP curves algorithms has a positive meaning. Aphirukmatakun et al. presented a degree elevation algorithm of DP curves based on the transformation between the DP basis and power basis. At the same time, Itsariyawanich et al. put forward a degree reduction algorithm. However, up to now, there has been no optimal algorithm for explicit multi-degree reduction of DP curves with endpoints constraints. In this paper, based on the orthogonality of Jacobi basis, we give out an effective algorithm of constrained multi-degree reduction approximation of DP curve. We prove that the approximation is optimal in the L2 norm. In the end of this paper, we demonstrate the validity and efficiency of our algorithm. © 2011 Binary Information Press.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A new approach to design rational harmonic surface over rectangular or triangular domain

引用

Journal of Information and Computational Science 2011年第1期8卷 71-83页

作者： Zhang, Juzheng Cai, Panpan Wang, Guojin Institute of Computer Images and Graphics Zhejiang University Hangzhou 310027 China State Key Laboratory of CAD and CG Zhejiang University Hangzhou 310027 China

By the degree elevation-based method of approximating rational curves and surfaces using polynomial curves and surfaces, a new effective approach to construct rational Bézier harmonic surfaces over rectangular or triangular domain is presented. First, rational Bézier curves, given as the boundaries, are transferred into some approximate polynomial curves, according to which a polynomial harmonic surface T then can be generated by using Monterde's method. On the other hand, the unknown rational Bézier harmonic surface R with the given rational boundary curves is transferred into an approximate polynomial surface N, whose degree is the same as that of T, so that the control points of N can be expressed as a function of both the weights and control points of R. Comparing T with N, by solving a minimizing problem with nonlinear object function, the rational harmonic surface R can finally be obtained. Several pragmatic illustrations are presented to testify validity of this algorithm. © 2011 Binary Information Press.

关键词： Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Opacity Volume Based Halo Generation for Enhancing Depth Perception

Opacity Volume Based Halo Generation for Enhancing Depth Per...

引用

IEEE International Conference on computer-Aided Design and computer graphics

作者： Yubo Tao Hai Lin Feng Dong Gordon Clapworthy Centre for Computer Graphics & Visualisation University of Bedfordshire UK State Key Laboratory of CAD&CG Zhejiang University China

Halos are usually used to enhance depth perception and display spatial relationships in illustrative visualization. In this paper, we present a simple and effective method to create volumetric halo illustration. In the pre-processing stage, we generate a view-independent halo intensity volume, which contains all potential halos around the boundaries of features, based on the opacity volume on graphic hardware. During halo rendering, the halo intensity volume is used to extract halos only around the contours of structures for the current viewpoint. The performance of our approach is significantly faster than previous halo illustration methods, which perform both halo generation and rendering during volume rendering. Experimental results demonstrate volumetric halo effects and the efficiency of the proposed approach.

关键词： Rendering (computer graphics) Transfer functions Three dimensional displays Feature extraction Hardware Image color analysis

来源：评论

学校读者我要写书评

暂无评论

CCVis: A Software Plugin for Unified Visualisation in ContraCancrum Based on VTK Extensions

CCVis: A Software Plugin for Unified Visualisation in Contra...

引用

International Conference on Information Visualisation (IV)

作者： Youbing Zhao Gordon J. Clapworthy Yubo Tao Feng Dong Hui Wei Tao Wang Centre of Computer Graphics & Visualisation University of Bedfordshire UK State Key Laboratory of CAD&CG University of Zhejiang China

Medical visualisation is an indispensable means for doctors and researchers to better explore and analyse medical images. The EC-funded ContraCancrum project, which aims at more predictable tumour simulation and treatment, uses visualisation as an important tool to interactively display tumour development and tumour simulation. This paper presents CCVis - the visualisation tool in ContraCancrum - which is a Qt-based plug in of the DrEye platform. CCVis uses a unified architecture for visualisation of the patient image data and tumour simulation data. It provides axis-aligned and arbitrary slice views, is surface rendering and volume ray casting as well as time-varying visualisation of patient image series and simulation data. Statistics in tumour simulation are plotted as 2D graphs. Major extensions of the Visualization Toolkit (VTK) are made to meet the demands for label highlighting and multi-dimensional transfer function.

关键词： Tumors Rendering (computer graphics) Transfer functions Data models Isosurfaces DICOM

来源：评论

学校读者我要写书评

暂无评论

Image annotation refinement using dynamic weighted voting based on mutual information

Journal of Software

引用

Journal of Software 2011年第11 SPEC. ISSUE期6卷 2239-2246页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations. © 2011 AcadEMY PUBLISHER.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Extraction of human body skeleton based on silhouette images

Extraction of human body skeleton based on silhouette images

引用

2nd International Workshop on Education Technology and computer Science, ETCS 2010

作者： Ding, Jianhao Wang, Yigang Yu, Lingyun State Key Laboratory of CAD and CG Zhejiang University Hangzhou China Institute of Computer Graphics and Image Processing Hangzhou Dianzi University Hangzhou China Department of Mathematics and Computing Science University of Groningen Netherlands

ISBN: (纸本)9780769539874

Skeleton extraction is essential for general shape representation. A typical skeletonization algorithm should obtain the ability to preserve original object's topological and hierarchical properties. However, most of current methods are high memory cost, computationally intensive, and also require complex data structures. In this paper, we propose an efficient and accurate skeletonization method for the skeleton feature points extracted from human body based on silhouette images. First, the gradient of distance transform is used to detect critical points inside the foreground. Then, we converge and simplify critical points in order to generate the most important and elegant skeleton feature points. Finally, we present an algorithm which connects the skeleton feature points and estimates the position of skeleton joints. © 2010 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Block-based normalized-cut algorithm for image segmentation

Block-based normalized-cut algorithm for image segmentation

引用

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Chen, Jingrun Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9783642051722

Automatic image segmentation remains a challenging problem in the fields of computer vision, image analysis and understanding. A lot of algorithms and technologies have been proposed and developed for image segmentation, among which the N-cut has been a promising method and active research area due to better quality. But the N-cut can't process medium and large image dataset online due to incredible memory and time complexity. Moreover, the N-cut algorithm can't utilize texture information since its basic unit of clustering algorithm is pixel. To overcome the drawback and improve the description power, the paper proposes a block-based N-cut algorithm for image segmentation, whose basic unit of clustering is image block instead of individual pixel. Block-based algorithm not only decreases the time and storage complexity, but also improves the discrimination power of visual feature vector. The experiments demonstrate that proposed algorithm outperform the original N-cut algorithm in efficiency. Experiments show that the proposed block-based N-cut algorithm is more suitable for online processing large-scale data. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：