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

6th IASTED International Conference on Visualization, Imaging, and Image Processing, VIIP 2006

作者： Španel, Michal Kršek, Premysl Department of Computer Graphics and Multimedia Faculty of Information Technology Brno University of Technology Czech Republic

ISBN: (纸本)0889865981

The image segmentation plays an important role in medical image processing. Many segmentation algorithms exist. Most of them produce raster data which is not suitable for further 3D geometrical modeling of tissues. In this paper, a vector segmentation algorithm based on an adaptive Delaunay triangulation is proposed. Triangular meshes are used to divide an image into several non-overlapping regions whose characteristics are similar. Novel methods for improving quality of the mesh and its adaptation to the image structure are also presented.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Exact crossing minimization

Exact crossing minimization

引用

13th International Symposium on Graph Drawing, GD 2005

作者： Buchheim, Christoph Ebner, Dietmar Jünger, Michael Klau, Gunnar W. Mutzel, Petra Weiskircher, René Department of Computer Science University of Cologne Institute of Computer Graphics and Algorithms Vienna University of Technology Department of Mathematics and Computer Science FU Berlin Department of Computer Science University of Dortmund CSIRO Mathematical and Information Sciences

ISBN: (纸本)3540314253

The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph into the plane. This very basic property has been studied extensively in the literature from a theoretic point of view and many bounds exist for a variety of graph classes. In this paper, we present the first algorithm able to compute the crossing number of general sparse graphs of moderate size and present computational results on a popular benchmark set of graphs. The approach uses a new integer linear programming formulation of the problem combined with strong heuristics and problem reduction techniques. This enables us to compute the crossing number for 91 percent of all graphs on up to 40 nodes in the benchmark set within a time limit of five minutes per graph. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Optimized NURBS ship hull fitting using simulated annealing

Optimized NURBS ship hull fitting using simulated annealing

引用

International Conference on computer graphics, Imaging and Visualisation, CGIV'06

作者： Wen, Ang Swee Shamsuddin, Siti Mariyam Hj. Samian, Yahya Department of Graphics and Multimedia Faculty of Computer Science and Information System Universiti Teknologi Malaysia Department of Marine Technology Faculty of Mechanical Engineering Universiti Teknologi Malaysia

ISBN: (纸本)0769526063

The shape of a NURBS curve or surface is defined by the location of its control points, the control points' weights, and the knot vectors. Most of the curve and surface design tried to modify the control points. However, it is still impossible to obtained accurate control points for a reconstructed NURBS curve or surface. The fitness of these surfaces is generally considered a subjective notion depending on the judgment of the designers (eg. visually pleasing, devoid of unnecessary bumps or wiggles, satisfying certain continuity requirements). One of the restriction in ship hull design is that the existing details of a ship design on paper or a ship that already been constructed physically couldn't be reconstructed accurately and concisely in a ship hull design software. This research strives to solve this problem by creating fair ship hull surface using NURBS. An optimized NURBS ship hull fitting approach using simulated annealing is developed. Evaluation and analysis (accuracy, fairness and speed of processing) on the proposed approach is done.

关键词： Ships

来源：评论

学校读者我要写书评

暂无评论

Anycast algorithms supporting optical burst switched grid networks

Anycast algorithms supporting optical burst switched grid ne...

引用

International Conference on Networking and Services 2006, ICNS'06

作者： De Leenheer, Marc Farahmand, Farid Lu, Kejie Zhang, Tao Thysebaert, Pieter Volckaert, Bruno De Turck, Filip Dhoedt, Bart Demeester, Piet Jue, Jason P. Department of Information Technology Ghent University IMEC Department of Computer Electronics and Graphics Technology Central Connecticut State University Department of Electrical and Computer Engineering University of Puerto Rico Mayagüez Puerto Rico Department of Computer Science New York Institute of Technology Old Westbury Department of Electrical Engineering and Computer Science University of Texas Dallas United States

ISBN: (纸本)0769526225

In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referred to as Grid-over-OBS (GoOBS). First, we briefly describe the proposed layered Grid architecture and show how OBS can be positioned within the Grid architecture. Then, we present a generic framework for anycast routing in the context of GoOBS when requests don't have an explicit destination address and they can be serviced by any appropriate Grid resource. We also develop several algorithms to support anycasting when only a single copy of a request is transmitted. Through simulation analysis, we show the performance of our anycast algorithms and compare them with traditional shortest-path unicast routing in which all jobs have specific addresses. Our performance analysis focuses on blocking probability of requests and average end-to-end delay. © 2006 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Monte Carlo go has a way to go

Monte Carlo go has a way to go

引用

21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06

作者： Yoshimoto, Haruhiro Yoshizoe, Kazuki Kaneko, Tomoyuki Kishimoto, Akihiro Taura, Kenjiro Department of Information and Communication Engineering University of Tokyo Japan Graduate School of Information Science and Technology University of Tokyo Japan Department of Graphics and Computer Sciences University of Tokyo Japan Department of Media Architecture Future University Hakodate Japan

ISBN: (纸本)1577352815

Monte Carlo Go is a promising method to improve the performance of computer Go programs. This approach determines the next move to play based on many Monte Carlo samples. This paper examines the relative advantages of additional samples and enhancements for Monte Carlo Go. By parallelizing Monte Carlo Go, we could increase sample sizes by two orders of magnitude. Experimental results obtained in 9 × 9 Go show strong evidence that there are trade-offs among these advantages and performance, indicating a way for Monte Carlo Go to go. Copyright © 2006, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Visual culling techniques for geometric processing in walkthrough application

引用

Journal of Computational information Systems 2006年第1期2卷 421-427页

作者： Sunar, Mohd Shahrizal Sembok, Tengku Mohd Tengku Zin, Abdullah Mohd Department of Computer Graphics and Multimedia Faculty of Computer Science and Information System University Teknology Malaysia 81310 Skudai Johor Malaysia Faculty of Information Science and Technology University Kebangsaan Malaysia 43600 Bangi Selangor Malaysia

Virtual reality is a modern approach for problem solving and strategy planning. It saves cost and time for production. Virtual walkthrough application allows users to navigate and absorb in the generated 3D environment with computer graphics assistance. Virtual reality engine is the most important component in virtual reality system. The basic element in virtual reality engine is graphics display. Nevertheless, on the system development where 3D graphics is necessary, there is a conflict between realistic and real time. This paper illustrates the implementation of visual culling techniques such as view frustum culling, back face culling and occlusion culling in the virtual walkthrough application. With the visual culling techniques implemented in the proposed virtual walkthrough system works in real time mode without scarifying realism factor.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Range Detection Approach in Interactive Virtual Heritage Walkthrough

Range Detection Approach in Interactive Virtual Heritage Wal...

引用

International Conference on Artificial Reality and Telexistence (ICAT)

作者： M.S. Sunar A.M. Zin T.M.T. Sembok Department of Computer Graphics and Multimedia Faculty of Computer Science and Information System Universiti Teknologi Malaysia Skudai Johor Malaysia Faculty of Information Science and Technology Universiti Kebangsaan Malaysia Bangi Selangor Darul Ehsan Malaysia

Exploring virtual world will give a memorable experience to the users. Generally, they are expecting smooth navigation with high quality image drawn into their eyes. Nevertheless, when the virtual world is growing simultaneously with the number of objects, the navigation will be detained. Yet, the frame rates can become unacceptable. In this paper, we present and examine range detection approach for view frustum culling to effectively speed-up the interactive virtual heritage project namely Ancient Malacca Virtual Walkthrough. Normal six plane view frustum culling approach use the plane equation to test whether objects is within the visible region. However, range detection approach is different with normal six plane view frustum. It is based on camera referential point and tests the objects if they are in the viewing range. The results show that this approach is able to increase the rendering performance of the virtual walkthrough without sacrificing the visual quality.

关键词： computer graphics Application software Navigation Rendering (computer graphics) Visualization Testing Cameras Virtual environment Multimedia systems computer science

来源：评论

学校读者我要写书评

暂无评论

Accelerating virtual walkthrough with visual culling techniques

Accelerating virtual walkthrough with visual culling techniq...

引用

International Conference on Computing & Informatics (ICOCI)

作者： Mohd Shahrizal Sunar Tengku Mohd Tengku Sembok Abdullah Mohd Zin Department of Computer Graphics and Multimedia Faculty of Computer Science and Information System Universiti Teknologi Malaysia Skudai Johor Malaysia Faculty of Information Science and Technology Universiti Kebangsaan Malaysia Bangi Selangor Darul Ehsan Malaysia

Virtual walkthrough application allows users to navigate and immerse in the generated 3D environment with computer graphics assist. The 3D environment requires a large amount of geometry to make it look realistic. When the number of geometry increase, the performance of the application will become slower. Consequently, it creates a conflict between the needs of realistic and real time. In this paper, we discuss the implementation of visual culling techniques such as view frustum culling, back face culling and occlusion culling in the virtual walkthrough application. We render only what we can see during the application runtime and cull away unnecessary geometry. This will accelerate the performance of the system. Without the culling techniques implemented in virtual reality application such as virtual walkthrough, the system has to allocate a large space of memory to store the geometry data. We have tested these techniques to the Ancient Malacca data. With the visual culling techniques implemented, the virtual walkthrough system can work in real time mode without scarifying realism factor.

关键词： Acceleration Computational modeling Geometry Virtual reality computer graphics Application software Navigation Testing Real time systems Visualization

来源：评论

学校读者我要写书评

暂无评论

Anycast Algorithms Supporting Optical Burst Switched Grid Networks

Anycast Algorithms Supporting Optical Burst Switched Grid Ne...

引用

International Conference on Networking and Services (ICNS)

作者： M. De Leenheer F. Farahmand Kejie Lu Tao Zhang P. Thysebaert B. Volckaert F. De Turck B. Dhoedt P. Demeester J.P. Jue Department of Information Technology Ghent University - IBBT - IMEC Department of Computer Electronics and Graphics Technology Central Connecticut State University Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Department of Computer Science New York Institute of Technology Old Westbury Department of Electrical Engineering and Computer Science The University of Texas at Dallas

In this paper we consider implementing optical burst switching as a technology for building grids with computationally intensive requirements. This architecture has been referred to as grid-over-OBS (GoOBS). First, we briefly describe the proposed layered grid architecture and show how OBS can be positioned within the grid architecture. Then, we present a generic framework for anycast routing in the context of GoOBS when requests don't have an explicit destination address and they can be serviced by any appropriate grid resource. We also develop several algorithms to support anycasting when only a single copy of a request is transmitted. Through simulation analysis, we show the performance of our anycast algorithms and compare them with traditional shortest-path unicast routing in which all jobs have specific addresses. Our performance analysis focuses on blocking probability of requests and average end-to-end delay

关键词： Optical fiber networks computer architecture Routing Performance analysis Optical burst switching Buildings Grid computing Optical computing Context-aware services Analytical models

来源：评论

学校读者我要写书评

暂无评论

Punctuated simplification of man-made objects

Punctuated simplification of man-made objects

引用

作者： Jang, Justin Wonka, Peter Ribarsky, William Shaw, Christopher D. Georgia Institute of Technology GVU Center College of Computing Atlanta GA 30332 United States Arizona State University PRISM Dept. of Computer Science and Engineering Tempe AZ 85287 United States UNC Charlotte CS Dept. Charlotte Visualization Center Charlotte NC 28223 United States Simon Fraser University Surrey School of Interactive Arts and Technology 14-660 Central City Tower 13450 102 Ave Surrey BC V3T 5X3 Canada Graphics Visualization and Usability Center Georgia Institute of Technology PRISM Lab. ASU Department of Information Technology UNC Charlotte Charlotte Visualization Center IEEE Visualization and Graphics Technical Committee School of Interactive Arts and Technology Simon Fraser University Surrey

We present a simplification algorithm for manifold polygonal meshes of plane-dominant models. Models of this type are likely to appear in man-made environments. While traditional simplification algorithms focus on generality and smooth meshes, the approach presented here considers a specific class of man-made models. By detecting and classifying edge loops on the mesh and providing a guided series of binary mesh partitions, our approach generates a series of simplified models, each of which better respects the semantics of these kinds of models than conventional approaches do. A guiding principle is to eliminate simplifications that do not make sense in constructed environments. This, coupled with the concept of "punctuated simplification", leads to an approach that is both efficient and delivers high visual quality. Comparative results are given.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：