• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.2
• /
• pp.42-60
• /
• 1992

An adaptive fuzzy system can efficiently classify subimages into four categories according to image activity level for image data compression. The system estimates fuzzy rules by clustering input-output data generated from a given adaptive transform image coding process. The system encodes different images without modification and reduces side information when encoding multiple images. In the second part, a fuzzy system estimates optimal bit maps for the four subimage classes in noisy channels assuming a Gauss-Markov image model. The fuzzy systems respectively estimate the sampled subimage classification and the bit-allocation processes without a mathematical model of how outputs depend on inputs and without rules articulated by experts.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.04a
• /
• pp.18-21
• /
• 1984

In this paper, the tree coding using the (M, L) multi-path search algorithm has teen investigated. A hybrid adaptation scheme which employs a block adaptation as well as a sequential dadptation is described for application in quantization and compression of speech signals. Simulation results with the gybrid adaptation scheme indicate that a relatively good speech quality can be obtained at rate about 8Kbps. All necessary parameters such as MlL and filter-order were found from simulation and these parameters turned out to be a good compromise between the complexity and overall performance.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.378-381
• /
• 2003

The Channel Coding Unit (CCU) is an integral component of Payload Data Transmission System (PDTS) for the Multi-Spectral Camera (MSC) data. The main function of the CCU is channel coding and encryption. CCU has two channels (I ＆ Q) for data processing. The input of CCU is the output of DCSU (Data Compression ＆ Storage Unit). The output of CCU is the input of QTX which modulate data for RF communication. In this paper, there are the overview, short H/W description and operation concept of CCU.

• 전기의세계
• /
• v.29 no.6
• /
• pp.389-392
• /
• 1980

For Markov graphic source, it is well known that the conditional runlength coding for the runs of correct prediction is optimum for data compression. However, because of the simplicity in counting and the stronger concentration in distrubution, the incremental run is possibly a better parameter for coding than the run itself for some cases. It is shown that the incremental-runlength is also geometrically distributed as the runlength itself. The distribution is explicitly described with the basic parameters defined for a Markov model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1313-1316
• /
• 1993

This paper presents a fuzzy system that estimates the optimal bit allocation matrices for the spatially active subimage classes of adaptive transform image coding in noisy channels. Transform image coding is good for image data compression but it requires a transmission error protection scheme to maintain the performance since the channel noise degrades its performance. The fuzzy system provides a simple way of estimating the bit allocation matrices from the optimal bit map computed by the method of minimizing the mean square error between the transform coefficients of the original and the reconstructed images.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.7
• /
• pp.61-68
• /
• 2008

In this paper, we propose an efficient hardware architecture and algorithm to increase an encoding process rate and implement a hardware for CABAC (Context Adaptive Binary Arithmetic Coding) which is used with one of the entropy coding ways for the latest video compression technique, H.264/AVC (Advanced Video Coding). CABAC typically provides a better high compression performance maximum 15% compared with CAVLC. However, the complexity of operation of CABAC is significantly higher than the CAVLC. Because of complicated data dependency during the encoding process, the complexity of operation is higher. Therefore, various architectures were proposed to reduce an amount of operation. However, they have still latency on account of complicated data dependency. The proposed architecture has two techniques to implement efficient pipeline architecture. The one is quick calculation of 7, 8th bits used to calculate a probability is the first step in Binary arithmetic coding. The other is one step reduced pipeline arcbitecture when the type of the encoded symbols is MPS. By adopting these two techniques, the required processing time was reduced about 27-29% compared with previous architectures. It is designed in a hardware description language and total logic gate count is 19K using 0.18um standard cell library.

• Journal of Broadcast Engineering
• /
• v.28 no.3
• /
• pp.314-328
• /
• 2023

In this paper, we propose a texture map compression method based on the hierarchical coding method of SHVC to support the scalability function of dynamic mesh compression. The proposed method effectively eliminates the redundancy of multiple-resolution texture maps by downsampling a high-resolution texture map to generate multiple-resolution texture maps and encoding them with SHVC. The dynamic mesh decoder supports the scalability of mesh data by decoding a texture map having an appropriate resolution according to receiver performance and network environment. To evaluate the performance of the proposed method, the proposed method is applied to V-DMC (Video-based Dynamic Mesh Coding) reference software, TMMv1.0, and the performance of the scalable encoder/decoder proposed in this paper and TMMv1.0-based simulcast method is compared. As a result of experiments, the proposed method effectively improves in performance the average of -7.7% and -5.7% in terms of point cloud-based BD-rate (Luma PSNR) in AI and LD conditions compared to the simulcast method, confirming that it is possible to effectively support the texture map scalability of dynamic mesh data through the proposed method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.89-96
• /
• 1989

An improved method on texture coding, which is a part of the region growing based image coding, is presented in this paper. An image is segmented into stochastic regions which can be described as a stochastic random field, and non-stochastic ones in order to efficiently represent texture. In the texture coding and reconstruction, an autoregressive model is used for the stochastic regions, while a two-dimensional polynomial approximation is used for the non-stochastic ones. This proposed method leads to a better subjective quality, relatively higher compression ratio and shorter processing time for coding and reconstructing than the conventional method which uses only two-dimensional polynomial approximation.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.921-927
• /
• 2015

In this paper, we propose a novel design scheme for the operation of Decoded Picture Buffer (DPB) including reference picture re-ordering, marking process, and reference picture list construction to perform an efficient scalable multi-view video coding. Extensive simulations show that the proposed method can provide improved compression efficiency and improved video quality measured in terms of BD-Rate and BD-PSNR for the scalable multi-view video coding.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.41-46
• /
• 2005

A new multiple description selective coding is proposed to overcome noisy channels. Our algorithm adopts an embedded coding scheme, in which subband coefficients are encoded one bit plane at a time using a non-adaptive arithmetic encoder. According to the importance ratio for each region, we code interest regions with more passes than background in order to reconstruct interest regions with higher quality. To overcome channel errors, we adopt multiple description scheme which adds controlled amounts of redundancy to the original data during the compression process. Proposed algorithm achieves better qualify compared with other algorithms especially in the circumstances where very low bit rate coding is required and some regions are more important than other regions.