15496995
Real-time pencil rendering
This paper presents a real-time technique for rendering 3D meshes in the pencil drawing style. We analyze the characteristics of pencil drawing and incorporate them into the rendering process, which is fully implemented on a GPU. For object contours, we propose a multiple contour drawing technique that imitates trial-and-errors of human in contour drawing. For interior shading, we present a simple approach for mapping oriented textures onto an object surface. To improve the quality of pencil rendering, we generate and map pencil textures that reflect the properties of graphite pencils and paper. We show several rendering examples that demonstrate the high performance of the proposed technique in terms of speed and quality.
28687567
Motion retargeting and evaluation for VR-based training of free motions
Virtual reality (VR) has emerged as one of the important and effective tools for education and training. Most VR-based training systems are situation based, where the trainees are trained for discrete decision making in special situations presented by the VR environments. In contrast, this paper discusses the application of VR to a different class of training, for learning free motion, often required in sports and the arts. We propose a VR-based motion-training framework that contains an intuitive motion-guiding interface, posture-oriented motion retargeting, and an evaluation and advice scheme for corrective feedback. Applications of the proposed framework to simple fencing training and a dance imitation game are demonstrated .
8933894
Out-of-Core Remeshing of Large Polygonal Meshes
We propose an out-of-core method for creating semi-regular surface representations from large input surface meshes. Our approach is based on a streaming implementation of the MAPS remesher of Lee et al. Our remeshing procedure consists of two stages. First, a simplification process is used to obtain the base domain. During simplification, we maintain the mapping information between the input and the simplified meshes. The second stage of remeshing uses the mapping information to produce samples of the output semi-regular mesh. The out-of-core operation of our method is enabled by the synchronous streaming of a simplified mesh and the mapping information stored at the original vertices. The synchronicity of two streaming buffers is maintained using a specially designed write strategy for each buffer. Experimental results demonstrate the remeshing performance of the proposed method, as well as other applications that use the created mapping between the simplified and the original surface representations
10508365
Motif analysis of noisy regular textures
Abstract A regular texture contains a periodic arrangement of a determinable pattern. Motifs of a regular texture are the minimal parallelogrammic sub-regions that can reproduce the texture by tiling. A motif extracted from a regular texture can be used for texture reproduction, texture recognition, and texture compression. However, it is not simple to accurately capture a motif of a regular texture, as the motif may be non-rectangular or arranged in an arbitrary direction. Moreover, when the texture contains additive noises, such as are created by the scanning process, motif analysis becomes more difficult. In this paper, we present an algorithm to obtain a motif of a noisy regular texture in O( mn log mn ) time, where m × n is the size of the texture. The analysis examples demonstrate that the proposed algorithm can robustly derive motifs of noisy regular textures.
9314363
Feature sensitive mesh segmentation with mean shift
Feature sensitive mesh segmentation is important for many computer graphics and geometric modeling applications. In this paper, we develop a mesh segmentation method, which is capable of producing high-quality shape partitioning. It respects fine shape features and works well on various types of shapes, including natural shapes and mechanical parts. The method combines a procedure for clustering mesh normals with a modification of the mesh clarification technique. For clustering of mesh normals, we adopt Mean Shift, a powerful general purpose technique for clustering scattered data. We demonstrate advantages of our method by comparing it with two state-of-the-art mesh segmentation techniques.
7108445
Mesh parameterization with a virtual boundary
Parameterization of a 3D triangular mesh is a fundamental problem in various applications of meshes. The convex combination approach is widely used for parameterization because of its good properties, such as fast computation and one-to-one embedding. However, the approach has a drawback: most boundary triangles have high distortion in the embedding compared with interior ones. In this paper, we present an extension of the convex combination approach that resolves the drawback by using a virtual boundary. Since the virtual boundary is fixed onto a given convex polygon instead of the real boundary, the real boundary triangles can better reflect the shape of the corresponding 3D triangles. The proposedapproach obtains a parameterization of a 3D mesh with less d istortion than with the original convex combination approach. r 2002 Elsevier Science Ltd. All rights reserved.
14463804
Adaptive prefetching technique for shared virtual memory
Though shared virtual memory (SVM) systems promise low cost solutions for high performance computing, they suffer from long memory latencies. These latencies are usually caused by repetitive invalidation on shared data. Since shared data are accessed through synchronizations and the patterns by which threads synchronize are repetitive, a prefetching scheme based on such repetitiveness would reduce memory latencies. Based on this observation, we propose a prefetching technique which predicts future access behavior by analyzing access history per synchronization variable. Our technique was evaluated on an 8-node SVM system using the SPLASH-2 benchmark. The results show that our technique could achieve 34%-45% reduction in memory access latencies.
18035365
A Web Service Approach to Universal Accessibility in Collaboration Services
The enormous growth in wireless communications and miniaturized handheld devices in the last few years, have given rise to a vast range of new services, for heterogeneous user environments. In this paper, we investigate the nature of designing distributed services that accommodate pervasive devices. We introduce Universal Accessible Web service architecture, CAROUSEL Web service. We present our collaborative Web services model linked with an event brokering service, NaradaBrokering. We discuss how a rich synchronous and asynchronous collaboration environment can support virtual communications while being built on top of a Web service infrastructure, based on industry standard portal technologies such as XML, Apache’s Jetspeed, and WSDL. The linkage of the event brokering system with a Web service based architecture is one of the critical design issues in message-based collaborative application. We also describe the approach to universal access mechanisms in our collaborative Web service model. Also included is a discussion of the prototype collaborative SVG (Scalable Vector Graphics) browser that we developed as a Web service.
52820553
Context Adaptive Self-configuration System
This paper suggests a context adaptive self-configuration system, in which the system itself is aware of its available resources, and executes a configuration suitable for each system and the characteristics of each user. A great deal of time and effort is required to manually manage computing systems, which are becoming increasingly larger and complicated. Many studies have dealt with these problems but most unfortunately have focused on ‘automation’, which do not reflect the system specifications that differ between systems. Therefore, this paper proposes an adaptive self-configuration system that collects diverse context information for a user and its system, reflects it to an auto-response file and executes the detail parameter setting automatically. A prototype was developed to evaluate the system and compare the results with the conventional methods of manual configuration and MS-IBM systems. The results confirmed the effectiveness of the proposed system.
7311086
The case for a multi-hop wireless local area network
We propose a multi-hop wireless LAN architecture and demonstrate its benefits to wireless clients. For this architecture, we define implementation paths that allow interoperation with existing wireless LANs which can lead to an incremental deployment of this system. We quantify the performance benefits of the proposed schemes through measurements in realistic wireless LAN environments. We also examine the performance of such multi-hop wireless LANs through detailed simulation studies. Our results show that these multi-hop extensions can significantly improve the wireless access experience (in terms of data throughput, latency, etc.) for clients who enable such mechanisms. More interestingly, when multi-hop extensions are enabled by some of the clients, it also positively impacts the performance at other clients that are completely unaware of these extensions.
9536
Current practices of leading e-government countries
IT is transforming the way governments function and valuable lessons can be learned from the pioneering e-government programs that have led the charge.