• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1085-1093
• /
• 2000

An efficient bit rate distribution technique that distributes available bits for multiple objects based on motion vector magnitude, size of object shape, and coding distortion is presented. This coding concept using the three parameters was exploited in MPEG-4 multiple object coding. But the scheme is likely to produce poor results such as allocating more bits to less important objects and degrading picture quality, due to the lack of analysis and research in view of human visual aspect. In this paper importance of each object is represented by the three parameters and visually analyzed. Target bits are distributed according to coding distortion using the pre-assigned shape and motion information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.949-952
• /
• 2005

We propose the hardwired distributed arithmetic which is applied to multiple constant multiplications and the fixed data path in the inner product of fixed coefficient as a result of variable radix-2 multi-bit coding. Variable radix-2 multi-bit coding is to reduce the partial product in constant multiplication and minimize the number of addition and shifts. At results, this procedure reduces the number of partial products that the required multiplication timing is shortened, whereas the area reduced relative to the DA architecture. Also, this architecture shows the best performance for DCT/IDCT and DWT architecture in the point of area reduction up to 20% from reducing the partial products up to 40% maximally.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.364-367
• /
• 2010

분산 비디오 부호화(Distributed Video Coding: DVC)는 복호화보다 훨씬 적은 계산량으로 부호화를 가능하게 함으로써 계산 성능 및 전력이 제한된 환경을 위한 비디오 부호화 기법으로 주목 받고 있다. 그러나 DVC의 부호화 성능은 아직 기존의 비디오 압축 표준에 많이 미치지 못하고 있으며 이를 극복하기 위한 많은 연구가 진행되고 있다. 본 논문에서는 DVC의 부호화 성능 개선을 위한 율-왜곡 기반의 영역별 선택적 부호화 기법을 제안한다. 제안 기법은 복호기 측에서 보조정보를 얻는 과정에서 얻어지는 움직임 벡터가 부호기 측으로 피드백된다는 가정하에 이를 이용하여 움직임 보상 예측 신호를 구하고 율-왜곡(Rate-Distortion) 기반의 블록 단위로 선택적 부호화를 수행한다. 모의실험을 통하여 본 논문에서 제안한 움직임 정보 피드백을 이용한 율-왜곡 기반의 선택적 블록 부호화 기법이 기존의 DVC 부호화 기법보다 시퀀스에 따라 최대 약 2.25 dB 개선된 성능을 가짐을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.284-286
• /
• 2011

LDPC(low density parity check) 부호는 낮은 복잡성과 Shannon의 한계에 근접하는 오류 정정 능력을 보이기 때문에 turbo 부호와 함께 많은 응용분야에 적용되고 있다. 본 논문에서는 분산 동영상 부호화(distributed video coding: DVC) 시스템을 위한 부호율 적응적인(rate adaptive) LDPC 부호를 설계하기 위하여 패리티 점검 노드를 병합하는 방법을 제안한다. ACE(approximation cycles EMD) 알고리즘을 기반으로 효율적인 LDPC 부호를 설계하고 부호율 적응적인 특성을 갖기 위해 일정한 범위를 지정하고 지정된 범위에 따라 패리티 점검 노드를 병합한다. 그리고 ACE 알고리즘의 계수와 degree distribution을 변화시키면서 성능을 해석한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.582-584
• /
• 2011

This paper presents a Channel DiVision (CDV) scheme for transform-domain distributed video coding. In the proposed system, we employ the symmetric motion estimation to generate high quality side information for Wyner-Ziv (WZ) frames. Also, the decoder estimates the distortion of the side information, which is used to classify the transmitting channels for WZ frames. Each channel has a different expected noise. Then, the encoder allocates an appropriate number noise. Then, the encoder allocates an appropriate number present rate-distortion performance results and comparisons with existing state-of-the-art algorithms and H.264.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1024-1026
• /
• 2013

DVC (Distributed Video Coding) techniques provides a basic theory for the implementation of low-power video encoder. Conventional methods decide the parity bit request at decoder side. These are effective in controlling the bit-rate, but, are not able to control the visual quality. Thus, this paper presents an effective method of estimating visual quality improved by correcting the virtual channel noise for the reconstructed frame. Through several experiments, it is shown that the proposed method are able to estimate effectively the decoded visual quality.

• 전기의세계
• /
• 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 Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.365-366
• /
• 2022

The distributed code is a type of linear codes that can be used for coding and federated learning for privacy. In the distributed code, privacy or confidential information is not dependent to each other because the information of each code is not included with other codes. In this paper, we examine the properties of these distributed codes and present techniques for synthesizing new sets of distributed codes from previously known distributed codes. In addition, we propose several scenarios in which combined codes can be used.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.355-363
• /
• 2011

Recently, as one of several methods to improve the performance of DVC(Distributed Video Coding) system, many research works are focusing on the iterative refinement of side information. Most of the conventional techniques are mainly based on the relationship between the reconstruction level and side information, or the vector median filtering of motion vectors, but, their performance improvements are restricted. In order to overcome the performance limit of the conventional schemes, in this paper, a side information generation scheme is designed by measuring the block-cost estimation. Then, by adaptively selecting the compensation mode using the received bit-plane information, we propose a block-adaptive iterative refinement which is efficient for non-symmetric moving objects. Computer simulations show that, by using the proposed refinement method, the performance can be improved up to 0.2 dB in rate-distortion.