• ETRI Journal
• /
• v.32 no.1
• /
• pp.163-165
• /
• 2010

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.411-412
• /
• 2006

In this paper, we proposed a fast algorithm for inter prediction included the most complexity in H.264/AVC. It decide search range according to direction of predicted motion vector, and then perform adaptive candidate spiral search. Simultaneously, it perform motion estimation of variable loop with threshold for variable block size. Conclusively, it is implemented in JM FME with high complexity applying to rate-distortion optimization. Experimental results show that significant complexity reduction is achieved while the degradation in video quality is negligible.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.150-152
• /
• 2004

Conventional CDDA (Compact Disc Digital Audio) system has limitations come from sampling frequency and quantization bit, 44.1kHz and 16 bit respectively. So, new medium is developed for high-resolution audio recording, like as DVD-audio etc. But CDDA is a widely used medium for high fidelity audio yet, because new medium has complexity and difficulty in manufacturing system. In this paper, we design a new encoding system for high-resolution audio signal. The system is backward compatible with conventional CDDA. By evaluation for encoding and decoding process, we describe practicability of our proposal system.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.75-76
• /
• 2008

A low complexity encoding scheme for coarse grain scalability is proposed. The proposed method exploits the statistics of residuals between current and reference blocks using the macroblock mode predicted from the previous quality layer. To test how the mode is optimal in the current layer, the statistical hypothesis testing for the variances of the residual sub-blocks is performed. The proposed method reduces the total encoding time up to 51% when three CGS scalability layers are encoded. However, the quality degradation and bit-rate increment of the each layer are negligible.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.260-264
• /
• 2013

This paper proposes a fast enhancement layer coding method to reduce computational complexity for Scalable HEVC (SHVC) which is based on High Efficiency Video Coding (HEVC). The proposed method decreases encoding time by simplifying Rate Distortion Optimization (RDO)for enhancement layers (EL). The simplification is achieved by restricting CU depths based on the correlation of coding unit (CU) depths between adjacent layers and scalability (spatial or quality) of EL. Comparing with the performance of SHM 1.0 software encoder, the proposed method reduces the encoding time by up to 31.5%.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.719-726
• /
• 2012

Messages are generally selected with the same probability in the encoding scheme of rateless codes for equal error protection. In addition, a belief propagation (BP) decoding scheme is generally used because of the low computational complexity. However, the probability of recovering a new message by BP decoding is reduced if both the recovered and unrecovered messages are selected uniformly. Thus, more codeword symbols than expected are required for the perfect recovery of message symbols. Therefore, a new encoding scheme with a nonuniform selection of messages is proposed in this paper. In addition, a BP-Gaussian elimination hybrid decoding scheme that complements the drawback of the BP decoding scheme is proposed. The performances of the proposed schemes are analyzed and compared with those of the conventional schemes.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.103-112
• /
• 2011

Motion estimation (ME) is regarded as an important component in a video encoding process, because it consumes a large computation complexity. H.264/AVC requires additional computation overheads for fractional search and interpolation. This causes a problem that computational complexity is increased. In Motion estimation, SATD(Sum of Transform Difference) has the characteristics of a parabolic based on the minimum point. In this paper, we propose new prediction algorithm to reduce search point in motion estimation by sub-pixel interpolation characteristics. The proposed algorithm reduces the time of encoding process by decreasing computational complexity. Experimental results show that the proposed method reduces 20% of the computation complexity of motion estimation, while the degradation in video quality is negligible.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.179-188
• /
• 2017

The Internet Video Coding (IVC) standard is due to be published by Moving Picture Experts Group (MPEG) for various Internet applications such as internet broadcast streaming. IVC aims at three things fundamentally: 1) forming IVC patents under a free of charge license, 2) reaching comparable compression performance to AVC/H.264 constrained Baseline Profile (cBP), and 3) maintaining computational complexity for feasible implementation of real-time encoding and decoding. MPEG experts have worked diligently on the intellectual property rights issues for IVC, and they reported that IVC already achieved the second goal (compression performance) and even showed comparable performance to even AVC/H.264 High Profile (HP). For the complexity issue, however, there has not been thorough analysis on IVC decoder. In this paper, we analyze the IVC decoder in view of the time complexity by evaluating running time. Through the experimental results, IVC is 3.6 times and 3.1 times more complex than AVC/H.264 cBP under constrained set (CS) 1 and CS2, respectively. Compared to AVC/H.264 HP, IVC is 2.8 times and 2.9 times slower in decoding time under CS1 and CS2, respectively. The most critical tool to be improved for lightweight IVC decoder is motion compensation process containing a resolution-adaptive interpolation filtering process.

• Nuclear Engineering and Technology
• /
• v.52 no.10
• /
• pp.2339-2345
• /
• 2020

Radiation imaging systems consisting of a large number of channels greatly benefit from multiplexing methods to reduce the number of channels with minimizing the system complexity and development cost. In conventional pixelated radiation detector modules, such as anger logic, is used to reduce a large number of channels that transmit signals to a data acquisition system. However, these methods have limitations of electrical noise and distortion at the detector edge. To solve these problems, a multiplexing concept using a digital signal encoding technique based on a time delay method for signals from detectors was developed in this study. The digital encoding multiplexing (DEM) method was developed based on the time-over-threshold (ToT) method to provide more information including the activation time, position, and energy in one-bit line. This is the major advantage of the DEM method as compared with the traditional ToT method providing only energy information. The energy was measured and calibrated by the ToT method. The energy resolution and coincidence time resolution were observed as 16% and 2.4 ns, respectively, with DEM. The position was successfully distributed on each channel. This study demonstrated the feasibility that DEM was useful to reduce the number of detector channels.