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

10th pacific conference on computer graphics and applications, PG 2002

作者： Yeh, Jeng-Sheng Lien, Ting-Yu Ouhyoung, Ming Department of Computer Science and Information Engineering National Taiwan University Taiwan

ISBN: (纸本)0769517846

We develop an interactive haptic system, which can be a further aid for digital Chinese painting. When an artist is holding our force feedback device, one feels like holding a real painting brush with all the contact and bending forces, since the viscosity, friction, and the bending force of a brush touching the paper are simulated. First we derive a physical dynamics model as bending springs for bristles to construct a 3D brush. Then we simulate the ink-water transfer system for ink spreading and color blending. Our system is a real-time system and users can interact with it holding a digital brush supported by either a Phantom force feedback device or a "WACOM pressure sensing pen" on a tablet. A pilot experiment was conducted, and the results show that brush writing with haptic feedback is better than that of the same visual display but without haptic feedback. © 2002 IEEE.

关键词： Viscosity

来源：评论

学校读者我要写书评

暂无评论

Bottom-up/top-down geometric object reconstruction with CNN classification for mobile education 26

Bottom-up/top-down geometric object reconstruction with CNN ...

引用

26th pacific conference on computer graphics and applications, pacific graphics 2018

作者： Guo, T. Cui, R. Qin, X. Wang, Y. Tang, Z. Peking University Institute of computer science and technology China

ISBN: (纸本)9783038680734

Geometric objects in educational materials are often illustrated as 2D line drawings, which results in the loss of depth information. To alleviate the problem of fully understanding the 3D structure of geometric objects, we propose a novel method to reconstruct the 3D shape of a geometric object illustrated in a line drawing image. In contrast to most existing methods, ours directly take a single line drawing image as input and generate a valid sketch for reconstruction. Given a single input line drawing image, we first classify the geometric object in the image with convolution neural network (CNN). More specifically, we pre-train the model with simulated images to alleviate the problems of data collection and unbalanced distribution among different classes. Then, we generate the sketch of the geometric object with our proposed bottom-up and top-down scheme. Finally, we finish reconstruction by minimizing an objective function of reconstruction error. Extensive experimental results demonstrate that our method performs significantly better in both accuracy and efficiency compared with the existing methods. © 2018 The Author(s).

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Interactive graphical interface for an expert airload-planning system

Interactive graphical interface for an expert airload-planni...

引用

Proceedings of the Twenty-Second Annual Hawaii International conference on System Sciences: Emerging Technologies and applications Track

作者： Wong, Julie S. SRI Int Menlo Park CA USA

ISBN: (纸本)0818619147

A graphics systems is designed and implemented as an adjunct to an expert system for planning aircraft loading. This system is fully integrated with the expert system and is used to illustrate its planned airloads and to modify these loads interactively. Design considerations and key features of the graphics system are discussed. The graphics system has been deployed successfully and now widely accepted as a useful tool for airload planning and execution. Aspects of the system that could be improved are indicated.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

Automatic animation skeleton using repulsive force field 11

Automatic animation skeleton using repulsive force field

引用

11th pacific conference on computer graphics and applications, PG 2003

作者： Liu, Pin-Chou Wu, Fu-Che Ma, Wan-Chun Liang, Rung-Huei Ouhyoung, Ming Communication and Multimedia Laboratory Dept. of Computer Science and Information Engineering National Taiwan University Taiwan

ISBN: (纸本)0769520286

A method is proposed in this paper to automatically generate the animation skeleton of a model such that the model can be manipulated according to the skeleton. With our method, users can construct the skeleton in a short time, and bring a static model both dynamic and alive. The primary steps of our method are finding skeleton joints, connecting the joints to form an animation skeleton, and binding skin vertices to the skeleton. Initially, a repulsive force field is constructed inside a given model, and a set of points with local minimal force magnitude are found based on the force field. Then, a modified thinning algorithm is applied to generate an initial skeleton, which is further refined to become the final result. When the skeleton construction completes, skin vertices are anchored to the skeleton joints according to the distances between the vertices and joints. In order to build the repulsive force field, hundreds of rays are shot radially from positions inside the model, and it leads to that the force field computation takes most of the execution time. Therefore, an octree structure is used to accelerate this process. Currently, the skeleton generated from a typical 3D model with 1000 to 10000 polygons takes less than 2 minutes on a Intel Pentium 4 2.4 GHz PC. © 2003 IEEE.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

Virtual city map generation using area subdivision 19

Virtual city map generation using area subdivision

引用

19th pacific conference on computer graphics and applications, PG 2011

作者： Müller, Kerstin Heischbourg, Luc Fünfzig, Christoph Petsch, Sebastian Hagen, Hans TU Kaiserslautern Computer Graphics Group Germany

ISBN: (纸本)9783905673845

In this paper we present a new approach to build typical street networks for urban and rural areas automatically. Most street networks have a characteristic appearance which is a mixture between a kind of a regular spreading of streets and various perturbations of the regular structure, e.g., caused by the terrain. Our City Map Generation (CMG) algorithm gets as input an height field including watercourses and restricted areas such as nature protection areas or mountain areas. Furthermore, the user can specify the urbanization by the number of city centers or by a density map. The CMG algorithm produces a street map for the given landscape based on rules, which the user can also modify to obtain an individual appearance. Additionally, the regular structure is varied by a set of rules incorporating randomness. The results can be used to generate models for city areas, e.g., in movies and commercials. Depending on the demands, our flexible approach can be adjusted to produce a variety of road maps automatically. We show some examples and demonstrate that our algorithm is easy to implement and to use. © The Eurographics Association 2011.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computing distances between surfaces using line geometry 10

Computing distances between surfaces using line geometry

引用

10th pacific conference on computer graphics and applications, PG 2002

作者： Sohn, Kyung-Ah Jüttler, Bert Kim, Myung-Soo Wang, Wenping School of Computer Science and Engineering Seoul National University Korea Republic of Institute of Analysis Dept. of Applied Geometry Johannes Kepler University of Linz Austria Dept. of Computer Science and Information Systems University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)0769517846

We present an algorithm for computing the distance between two free-form surfaces. Using line geometry, the distance computation is reformulated as a simple instance of a surface-surface intersection problem, which leads to low-dimensional root finding in a system of equations. This approach produces an efficient algorithm for computing the distance between two ellipsoids, where the problem is reduced to finding a specific solution in a system of two equations in two variables. Similar algorithms can be designed for computing the distance between an ellipsoid and a simple surface (such as cylinder cone, or torus). In an experimental implementation (on a 500 MHz Windows PC), the distance between two ellipsoids was computed in less than 0.3 msec on average;and the distance between an ellipsoid and a simple convex surface was computed in less than 0.15 msec on average. © 2002 IEEE.

关键词： Chromium

来源：评论

学校读者我要写书评

暂无评论

Determining Knots by Minimizing Energy

引用

Journal of computer Science & Technology 2006年第2期21卷 261-264页

作者：张彩明韩慧健郑复华 Department of Computer Science and Technology Shandong Economic University Jinan 250014 P.R. China School of Computer Science and Technology Shandong University Jinan 250061 P.R. China Department of Computer Science University of Kentucky Lexington KY 40506 U.S.A.

A new method for determining knots to construct polynomial curves is presented. At each data point, a quadric curve which passes three consecutive points is constructed. The knots for constructing the quadric curve are determined by minimizing the internal strain energy, which can be regarded as a function of the angle. The function of the angle is expanded as a Taylor series with two terms, then the two knot intervals between the three consecutive points are defined by linear expression. Between the two consecutive points, there are two knot intervals, and the combination of the two knot intervals is used to define the final knot interval. A comparison of the new method with several existing methods is included.

关键词： knots interpolation curve strain energy shape preserving

来源：评论

学校读者我要写书评

暂无评论

Research on the Aesthetic Features and Technology of computer graphics

Research on the Aesthetic Features and Technology of Compute...

引用

2021 Asia-pacific conference on Image Processing, Electronics and computers, IPEC 2021

作者： Song, Yanbin Liaoning Communication University Shenyang110113 China

computer graphics is a new science produced with the popularization of computers. The processing technology of graphics and images in computer graphics has attracted much attention. How to make reasonable use of them has become an important subject in the field of modern scientific applications. For this research background, this paper proposes an image recognition algorithm based on wavelet and DFB-PCA. After decomposing the recognition image with wavelet transform, DFB-PCA recognition is performed on the low frequency subband. The experimental results show that the method is beneficial to reduce the influence of factors such as illumination, posture and expression, reduce the dimensionality of noise and image recognition, and has better robustness. Compared with directly using PCA recognition on the original image, the calculation speed and recognition efficiency of the image can be improved. © Published under licence by IOP Publishing Ltd.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Novel schemes for high-throughput image rotation

Novel schemes for high-throughput image rotation

引用

conference Record of the Thirty-Eighth Asilomar conference on Signals, Systems and computers

作者： Suchitra, S. Lam, S.K. Srikanthan, T. Centre for High Performance Embedded Systems Nanyang Technological University Singapore-637553

Real-time image rotation forms a core operation in many applications such as medical image processing, computer graphics and pattern recognition. Conventional rotation engines usually comprise of compute-intensive CORDIC operations that become a severe bottleneck in high-throughput applications. In this paper, we present a novel scheme that employs hierarchical computation strategies, exploits the symmetrical characteristics of the image, and performs successive pixel computations at high-speed to achieve high-throughput image rotation at low cost. We will show that the proposed method leads to a significant performance gain of about 20 times over an existing CORDIC-based rotation engine with similar hardware cost. ©2004 IEEE.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

Discrete differential error metric for surface simplification 10

Discrete differential error metric for surface simplificatio...

引用

10th pacific conference on computer graphics and applications, PG 2002

作者： Kim, Sun-Jeong Kim, Soo-Kyun Kim, Chang-Hun Department of Computer Science and Engineering Korea University 1 5-ka Anam-dong Sungbuk-ku Seoul136-701 Korea Republic of

ISBN: (纸本)0769517846

In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far Even though such distance based error metrics give visually pleasing results with a reasonably fast speed, it is hard to measure an accurate geometric error on a highly curved and thin region since the error measured by the distance metric on such a region is usually small and causes a loss of visually important features. To overcome such a drawback, we define a new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric. The benefits of our error metric are preservation of sharp feature regions after a drastic simplification, small geometric errors, and fast computation comparable to the existing methods. © 2002 IEEE.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：