• Journal of Digital Contents Society
• /
• v.16 no.4
• /
• pp.575-581
• /
• 2015

This paper presents the development of certain highly efficient and accurate method for computing tangent curves for three-dimensional vector fields. Unlike conventional methods, such as Runge-Kutta method, for computing tangent curves which produce only approximations, the method developed herein produces exact values on the tangent curves based upon piecewise linear variation over a tetrahedral domain in 3D. This new method assumes that the vector field is piecewise linearly defined over a tetrahedron in 3D domain. It is also required to decompose the hexahedral cell into five or six tetrahedral cells for three-dimensional vector fields. The critical points can be easily found by solving a simple linear system for each tetrahedron. This method is to find exit points by producing a sequence of points on the curve with the computation of each subsequent point based on the previous. Because points on the tangent curves are calculated by the explicit solution for each tetrahedron, this new method provides correct topology in visualizing 3D vector fields.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1623-1628
• /
• 2009

This paper presents the development of certain highly efficient and accurate method for computing tangent curves for two-dimensional vector fields. Unlike convention methods, such as Runge-Kutta, for computing tangent curves which produce only approximations, the method developed herein produces exact values on the tangent curves based on piecewise linear variation over a triangle in 2D. This new method assumes that the vector field is piecewise linearly defined over a triangle in 2D. It is also required to decompose the rectangular cell into two triangular cells. The critical points can be easily found by solving a simple linear system for each triangle. This method is to find exit points by producing a sequence of points on the curve with the computation of each subsequent point based on the previous. Because points on the tangent curves are calculated by the explicit solution for each triangle, this new method provides correct topologies in visualizing 2D vector fields.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.21-27
• /
• 2018

FRN (Full range Naphtha) is distilled from crude oil in a Naphtha Splitter Unit and is separated into the Light Straight Naphtha, Heavy Naphtha, and kerosene according to the boiling point in sequence. This separation is conducted using a series of binary-like columns. In this separation method, the energy consumed in the reboiler is used to separate the heaviest components and most of this energy is discarded as vapor condensation in the overhead cooler. In this study, the first two columns of the separation process are replaced with the Petlyuk column. A structural design was exercised by a stage to stage computation with an ideal tray efficiency in the equilibrium condition. Compared to the performance of a conventional system of 3-column model, the design outcome indicates that the procedure is simple and efficient because the composition of the liquid component in the column tray was designed to be similar to the equilibrium distillation curve. An analysis of the performance of the new process indicated an energy saving of 12.3% under same total number of trays and with a saving of the initial investment cost.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.1-7
• /
• 2002

The fast extraction of the silhouettes of a model is very useful for many applications in computer graphics and animation. In this paper, we present an efficient algorithm to compute a sequence of perspective silhouettes for a polyhedral model from a moving viewpoint. The viewpoint is assumed to move along a trajectory q(t), which is a space curve of a time parameter t. Then, we can compute the time-intervals for each edge of the model to be contained in the silhouette by two major computations: (i) intersecting q(t) with two planes and (ii) a number of dot products. If q(t) is a curve of degree n, then there are at most of n + 1 time-intervals for an edge to be in a silhouette. For each time point $t_i$ we can extract silhouette edges by searching the intervals containing $t_i$ among the computed intervals. For the efficient search, we propose two kinds of data structures for storing the intervals: an interval tree and an array. Our algorithm can be easily extended to compute the parallel silhouettes with minor modifications.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.45-54
• /
• 2002

This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.

• Journal of the Korean Institute of Gas
• /
• v.24 no.1
• /
• pp.17-22
• /
• 2020

Light Naphtha is distillated from crude oil unit and separated into the methane, ethylene and propylene by boiling point difference in sequence. This separation is conducted using a series of binary-like columns. This separation method is known that the energy consumed in the reboiler is used to separate the heaviest components and most of this energy is discarded as vapor condensation in the overhead cooler. In this study, the first two columns of the separation process are replaced with the Petlyuk column. A structural design was exercised by the stage computation with ideal tray efficiency in equilibrium condition. Compared with the performance of a conventional system of 3-column model, The design outcome shows that the procedure is simple and efficient because the composition of the liquid component in the column tray was designed to be similar to the equilibrium distillation curve. The performance of the new process indicates that an energy saving of 12.1% is obtained and the cost savings of 44 million won per day based on gross domestic product is reduced under same total number of trays and the initial investment cost is saved.