• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.12
• /
• pp.3159-3174
• /
• 1994

A simple octree encoding algorithm based on a tetrahedron root has been developed to be used for fully automatic generation of three dimensional finite element meshes. This algorithm starts octree decomposition from a tetrahedron root node instead of a hexahedron root node so that the terminal mode has the same topology as the final tetrahedral mesh. As a result, the terminal octant can be used as a tetrahedral finite element without transforming its topology. In this part(I) of the thesis, an efficient algorithm for the tetrahedron-based octree is proposed. For this development, the following problems have been solved, : (1) an efficient data structure for storing the octree and finite elements, (2) an encoding scheme of a tetrahedral octree, (3) a neighbor finding technique for the tetrahedron-based octree.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.5
• /
• pp.327-329
• /
• 2005

Conventional CDDA(Compact Disc Digital Audio) system has limitation which means that bandwidth and resolution of the sign릴 are determined by the sampling frequency and quantization bit, 44.1kHz and 16 bit respectively. Though, new medium such as DVD-audio is developed for high-resolution audio recording, it has high complexity and difficulty in manufacturing process. So, CDDA is a widely used medium for high fidelity audio yet. In this paper, we design a new encoding system for high-resolution audio signal which has backward compatible with conventional CDDA. By evaluating for the encoding and decoding process. we verify the availability of our proposed system.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.373-374
• /
• 2006

JPEG2000 achieves a target bit rate by selecting the bitstream for adequate coding passes after encoding full passes in Tier-1 coder. Tier-1 encoding is complicated and time-consuming process. In this paper, we propose a new rate control technique that chooses the necessary passes without the full passes coding of Tier-1 by using previous image information for volumetric image. The simulation result shows that the proposed technique reduces encoding time of coding passes up to 81.5%.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.262-268
• /
• 2002

Octree representation has the advantage of being able to represent complex shapes approximately through the repetition of simple primitive shapes. Due to this reason, octree representation together with VRML(Virtual Reality Modelling Language) is usually used for approximating 3D shapes. Since the data size of octree representation increases rapidly as 3D shape to be represented is more and more complicated, its transmission time also increase. In this paper, provided is the new octree representation and encoding/decoding scheme for real-time transmission through the internet in order to visualize 3D geometric data of large size approximately.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.536-537
• /
• 2018

A goal of this paper is doing fine grained recognition of breed of animal from pet images. Research about fine grained recognition from images is continuously developing, but it is not for animal object recognition because they have polymorphism. This paper proposes method of higher animal object recognition using Grab-cut algorithm for object segmentation and Fisher Vector for image encoding.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.641-644
• /
• 2011

In this letter, we propose a novel bitrate control, using both Kalman and FIR filters, based on a Hamiltonian analysis with respect to the amount of bits from each macroblock, in an encoding of a general video codec such as H.264/AVC. Since the proposed bitrate control is based on the simple computation of an optimal control method based on the Hamiltonian analysis, it is not necessary to use additional computation, such as a DCT or quantization, to estimate the bits for bitrate control. As a result, the proposed algorithm can be applied to single-pass encoding and can provide sufficient encoding speed with respect to various applications, even those requiring real-time control.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.822-825
• /
• 2011

Level-encoded dual-rail (LEDR) has been widely used in onchip asynchronous interconnects supporting a 2-phase handshake protocol. However, it inevitably requires 2N wires for N-bit data transfers. Encoder and decoder circuits that perform an asynchronous 2-phase handshake protocol with only N wires for N-bit data transfers are presented for on-chip global interconnects. Their fundamentals are based on a ternary encoding scheme using current-mode multiple valued logics. Using 0.25 ${\mu}m$ CMOS technologies, the maximum reduction ratio of the proposed circuits, compared with LEDR in terms of power-delay product, was measured as 39.5% at a wire length of 10 mm and data rate of 100 MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.124-130
• /
• 2008

We present in this paper a method of digital watermarking for video data based on the discrete wavelet transform. In the proposed method, a watermark signal is inserted into the decompressed bitstream while detection is performed using the uncompressed video. This method allows detection if video has been manipulated or its format changed. We embed the watermark in the lowest frequency components of each frame in the un-coded video by using wavelet transform. The watermark can be extracted directly from the decoded video without access to the original video. Experimental results show that the proposed method gives the watermarked video of better quality and is robust against MPEG coding, down sampling and re-encoding to other type of video format such as MPEG4, H.264

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.117-124
• /
• 2012

In this paper, we propose a simple H parity check matrix from the CPM(circulant permutation matrix), which can easily avoid the cycle-4, and approach to flexible code rates and lengths. As a result, the operations of the submatrices will become the multiplications between several CPMs, the calculations of the LDPC(low density parity check) encoding could be simplest. Also we consider the fast encoding problem for LDPC codes. The proposed constructions could lead to fast encoding based on the simplest matrices operations for both regular and irregular LDPC codes.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2133-2142
• /
• 1997

Compared with previous compression methods, fractal image compression drastically increases compression rate by using block-based encoding. Although decompression can be done in real time even with softwares, the most serious problem in utilizing the fractal method is the time required for the encoding. In this paper, we propose and verify i) an algorithm that reduces the encoding time by reducing the number of similarity searching on the basis of dimensional informations, and ii) an algorithm that enhances the quality of the restored image on the basis of brightness and contrast information. Finally, a method that enables fast compression with little quality degradation is proposed.