KiMPA: A Kinematics-Based Method for Polygon Approximation

PurposeSurgical simulation is expected to be an effective way for physicians and medical students to learn surgical skills. To achieve real-time deformation of soft tissues with high visual quality, multiple resolution and adaptive mesh refinement models have been introduced. However, those models require additional processing time to map the deformation results of the deformed lattice to a polygon model. In this study, we propose a method to accelerate this process using vertex shaders on GPU and investigate its performance.MethodsA hierarchical octree cube structure is generated from a high-resolution organ polygon model. The entire organ model is divided into pieces according to the cube structure. In a simulation, vertex coordinates of the organ model pieces are obtained by trilinear interpolation of the cube’s 8 vertex coordinates. This process is described in a shader program, and organ model vertices are processed in the rendering pipeline for acceleration.ResultsFor a constant number of processing cubes, the CPU-based processing time increased linearly with the total number of organ model vertices, and the GPU-based time was nearly constant. On the other hand, for a constant number of model vertices, the GPU-based time increased linearly with the number of surface cubes. These linearities determine a condition that the GPU-based implementation is faster in the same frame time.ConclusionWe implemented octree cube deformation mapping using vertex shaders and confirmed its performance. The experimental results showed that the GPU can accelerate the mapping process in high-resolution organ models with a large number of vertices.

We present an O(nrG) time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction \(\theta \), while \(\theta \) varies in \([0,180^{\circ })\), obtaining the directions for the tour to be the shortest one over all tours, where n is the number of vertices, r is the number of reflex vertices, and \(G\le r\) is the maximum number of gates of the polygon used at any time in the algorithm.

The paper describes experiments that investigated the use of auditory stimuli (speech and non-speech sound) to communicate data in two information systems. These experiments were performed under a multimedia stock control system and a multimedia e-mail tool. Experiments using the multimedia stock control information system investigated rhythms and timbre to communicate windows and their associated functions as well as the simultaneous rise of speech and sound to communicate a large amount of information to users. Experiments using the multimedia e-mail tool investigated the use of tunes and short pitch sequences with visual stimuli to communicate information in browsing e-mail data. The paper also integrates experimental results front both systems and discusses the incorporation of auditory stimuli in interactive audio-visual or multimedia information systems. Auditory stimuli helped to communicate, complement or reinforce information that users received via the visual channel. These auditory technologies could also benefit visually impaired users of such systems. Results also indicated that the simultaneous use of sound and speech can be useful in the design of interactive multimedia information systems. The inclusion of auditory stimuli (including speech) in the design of information systems has the potential to maximise the volume of information communicated to users.

With the gradual maturity of geographical multimedia information system, applying geographical multimedia information system to urban intelligent traffic management information system and urban traffic sharing information platform can realize unified management and real-time update of traffic information. Through the urban traffic sharing information platform, it can increase the value of information. The multimedia information of the entire intelligent traffic management system can be stored, organized and processed by the shared multimedia information platform. It can more effectively ensure the correctness, comprehensibility and avoid redundancy of data relationships. Then it improves the utilization and transmission speed of multimedia information in the system. The urban traffic multimedia information management system has improved the use efficiency of urban road construction in China. And it also made the traffic multimedia information system more scientific and intelligent. It can also improve its management level and play an important role in urban traffic management. This paper first briefly analyzes the current traffic situation and the development of intelligent traffic multimedia information system in China. The basic concepts of GIS and urban intelligent transportation system based on GIS are introduced secondly. At last, the possibility about GIS as urban intelligent traffic management system sharing multimedia information platform is analyzed. The system framework and the basic function of GIS platform are put forward, and the application of GIS in urban traffic common information platform using the key technical support was discussed. It expounds the application of GIS in urban traffic common multimedia information platform.

Multimedia information and its databases are becoming an essential element for computer and telecommunication consideration in today’s world. Application areas in which attribute-based storage and retrieval is becoming a principal activity are among others, TV productions, video on demand, home entertainment, art galleries and museum management, architectural and engineering design, geographic information systems, finger print and image matching, find out citizenship by election card detail and so on. Other applications are related to the development of information superhighways. When the bandwidth needed for interactive multimedia will be available at home, each user could access a remote server containing very large image and video databases. In this scenario attribute-based storage and retrieval assumes a fundamental role. Also Multimedia Information Systems [7] can benefit of attribute-based retrieval technology; although they will mainly provide techniques to manage and distribute large amounts of multi-source multimedia information, automatic storage by attributes of images and data.

The guard zone computation problem is of utmost importance in the domain of VLSI physical design automation as one of the major purposes is to find an optimized way to place a set of two-dimensional blocks on a chip floor. Beyond this, it has huge significance in the field of robotic motion planning, Geographical information system, automatic monitoring of metal cutting tools and design of any embedded systems. In VLSI layout design, the circuit components (or the functional units / modules or groups / blocks of different sub-circuits) that may be viewed as a set of polygonal regions on a two-dimensional plane, are not supposed to be placed much closer to each other in order to avoid electrical (parasitic) effects among them. Each (group of) circuit component(s) C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> is associated with a parameter δ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> such that a minimum clearance zone of width δ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> is to be maintained around C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> . If the guard zonal regions overlap, we have to remove the overlapped regions in order to compute the resultant outer guard zone (sometimes inner guard zones are also an issue to be considered). The location of guard zone (of specified width) for a simple polygon is a very important problem for resizing a (group of) circuit component. In this paper, we have developed an algorithm to compute the guard zone of a simple polygon as well as to exclude the overlapped regions among the guard zonal segments (if any) in O(nlogn) time, where n is the number of vertices of the given simple polygon.

Non-convex contour reconstruction

For the performance of geographic information systems, it has been widely recognized that efficient data structures and algorithms supporting proximity based access to spatial data are a crucial ingredient. Because of that, in the last years, a lot of data structures for storage of multidimensional non-point objects have been proposed in the literature (for an overview see our tutorial introduction in this volume). Almost all of these approaches are made to support queries based on spatial neighborhood of objects, so-called proximity queries. Common examples of such proximity queries are range queries, returning all objects intersecting a given (rectangular) region, or nearest neighbor queries, determining the object nearest to a given point. But a geographic or cartographic information system should also support queries that do not exclusively refer to the spatial neighborhood of objects. For example, different versions of spatial data must be organized such that proximity queries to any version of the data can be answered efficiently. Or, given a set of object classes, a spatial query that involves an arbitrary combination of these classes should also be supported. Because of the growing size of data sets to be handled in geographic information systems, an appropriate data organisation to support such and several other application-specific queries becomes more and more important. In this paper, we will present two approaches for access structures supporting the two types of queries mentioned above. Handling of versioned, spatial data is the topic of Section 2, while Section 3 discusses queries on some classes selected from the set of object classes stored in a geographic information system.

Multimedia data and information systems manage, communicate, and present multimedia data including text, images, audio and video. We need to ensure that the data is protected from unauthorized access as well as malicious corruption. Digital watermarking techniques that insert hidden copyright messages into the multimedia data are needed. Furthermore, since multimedia data is being used for security applications such as surveillance and monitoring, protecting privacy of the individual is crucial.This presentation will discuss the developments and directions for securing multimedia systems. First we will first issues on incorporating security into multimedia data and information systems. We will review various security mechanisms and access control policies and discuss the applicability of these mechanisms and policies for multimedia data. Second, we will examine the developments of digital libraries, which can be considered to be special kinds of multimedia data and information systems, and discuss various developments on secure digital libraries. Access control models such as role-based access control and copyright protection methods for digital libraries will be discussed. Third, we will discuss the developments in securing multimedia communication systems including VoIP security. Emerging novel techniques in digital watermarking as well as the use of multimedia data for computer forensics analysis will also be discussed. Finally, the applications of multimedia data for surveillance and monitoring as well as video data analysis for national security applications will be discussed. Privacy violations that could occur through multimedia data mining as well as directions for privacy preserving surveillance and privacy preserving multimedia data mining will be discussed.

Geographic information systems (GIS) are becoming more usual due to the improved performance of computer systems. GIS applications are being developed using the three-tier software architecture traditionally used for general-purpose information systems. Even though this architecture is suitable for GIS applications, the special nature and exclusive characteristics of geographic information pose special functional requirements on the architecture in terms of conceptual and logical models, data structures, access methods, analysis techniques, or visualization procedures. In this paper, we propose a generic architecture for GIS that provides support for the special nature of geographic information and conforms with the specifications proposed by the ISO/TC 211 and the OGC. Our strategy to achieve this goal consists of two steps: (i) we analyze the special characteristics of GIS with respect to traditional information systems, (ii) and we adapt the traditional three-tier architecture for information systems to take into account the special characteristics of GIS. Finally, we have tried to apply the architecture that we propose in the development of a complete and complex real-life GIS application using commercial tools in the analysis, design and implementation. We describe this application, and we use it to describe the limitations of current commercial GIS development tools by analyzing the differences in the architecture of the resulting system with respect to our proposal.

Assigning mountain-valley fold lines of flat-foldable origami patterns based on graph theory and mixed-integer linear programming

Making the right management decisions in the logging industry is a complex multi-factorial task. The multivariance of solutions consists of various options for the application of technological chains of logging operations and timber transportation. Indeed, today the market offers a lot of options for systems of forestry machines, with or without forest storage with timber transportation at different seasons. Previous studies propose mathematical dependencies, an algorithm, and methods to solve all these problems. It makes it possible to search for the maximum flow of minimum cost in the dynamic structure of the technological process of performing work at the enterprise. They determine the conditions for solving the problem by the graph method. However, the proposed calculations for graphs with a large number of vertices and arcs connecting them are very laborious and require a lot of time. To solve this problem, the article presents the development of a computer application that performs basic calculations and calculates the optimal technological sequence of operations. The algorithms of the application, its description and principle of operation have been presented. The developed program enables to automate the process of finding the optimal sequence of technological operations in the logging enterprise operating procedure. Upon receipt of the results, it is possible to compare and analyze various process options for decision making.

A computer code based on the Givens–Householder matrix diagonalization method is used to calculate the spectra of graphs containing a large number of vertices. The code is most general in that it can handle graphs containing 200 or more vertices. Further, the code can be used to generate the spectra of weighted graphs. The program requires as input only the neighborhood table of the graph. The spectra of many graphs are generated for the first time in less than a few minutes of computer time. Applications to a number of chemical systems including two forms (foot and hand) of the recently synthesized C60 cluster and the effect of bond alternation on these systems are discussed. In addition, the spectra of square and honeycomb lattices and the characteristic polynomials of the foot and hand forms of the C60 cluster are obtained.

Chapter 13 - Robust and Scalable Shape Prior Modeling via Sparse Representation and Dictionary Learning

We propose the efficient and accurate hierarchical ICIA fitting method for 3D Morphable Models (3DMMs). The conventional ICIA fitting method for 3DMMs requires a long computation time because the 3D face model contains a large number of vertices and it also requires to compute the Hessian matrix using the visible vertices every iteration. For the efficient fitting, we use the hierarchical fitting that use a set of multi-resolution 3D face model and the Gaussian image pyramid. For more accurate fitting, we use a two-stage parameter update that only update the rigid and the texture parameters and then update all parameters after the initial convergence. We present several experiment results to prove that our proposed method shows better performance than previous works.