• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.85-96
• /
• 1999

In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.143-150
• /
• 2003

Error concealment plays an important role in combating transmission errors. Methods of error concealment which produce better quality are generally of higher complexity, thus making some of the more sophisticated algorithms is not suitable for real-time applications. In this paper, we develop temporal and spatial error resilient video encoding and data hiding approach to facilitate the error concealment at the decoder. Block interleaving scheme is introduced to isolate erroneous blocks caused by packet losses for spatial area of error resilience. For temporal area of error resilience, data hiding is applied to the transmission of parity bits to protect motion vectors. To do error concealment quickly, a set of edge features extracted from a block is embedded imperceptibly using data hiding into the host media and transmitted to decoder. If some part of the media data is damaged during transmission, the embedded features are used for concealment of lost data at decoder. This method decreases a complexity of error concealment by reducing the estimation process of lost data from neighbor blocks. The proposed data hiding method of parity bits and block features is not influence much to the complexity of standard encoder. Experimental results show that proposed method conceals properly and effectively burst errors occurred on transmission channel like Internet.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.425-436
• /
• 2009

In recent years, the user demands have increased for multimedia service of high quality over the broadband convergence network. These rising demands for high quality multimedia service led the popularization of various user terminals and large scale display equipments, which needs a variety type of QoS (Quality of Service). In order to support demands for QoS, numerous research projects are in progress both from the perspective of network as well as end system; For example, at the network perspective, QoS guaranteeing by improving of internet performance such as Active Queue Management, while at the end system perspective, SVC (Scalable Video Coding) encoding scheme to guarantee media quality. However, existing AQM algorithms have problems which do not guarantee QoS, because they did not consider the essential characteristics of video encoding schemes. In this paper, it is proposed to solve this problem by deploying the TS- AQM (Temporal Scalability Active Queue Management) which employs the differentiated packet dropping for dependency of the temporal level among the frames, based on SVC encoding characteristics by exploiting the TID (Temporal ID) field of the SVC NAL unit header. The proposed TS-AQM guarantees multimedia service quality through video decoding reliability for SVC streaming service, by differentiated packet dropping when congestion exists.

• Journal of Broadcast Engineering
• /
• v.24 no.2
• /
• pp.306-314
• /
• 2019

Since the resolutions of videos increase rapidly, there are continuing needs for effective video compression methods despite an increase in the transmission bandwidth. In order to satisfy such a demand, a reconstructive video coding (RVC) method by using a super resolution has been proposed. Since RVC reduces the resolution of the input video, when frames are compressed to the same size, the number of bits per pixel increases, thereby reducing coding artifacts caused by video coding. However, RVC method using super resolution is not effective in all target bitrates. Comparing the size of the loss generated while downsizing the resolution and the size of the loss caused by the video compression, only when the size of loss generated in the video compression is larger, RVC method can perform the improved compression performance compared to direct video coding. In particular, since HEVC has considerably higher compression performance than the previous standard video codec, it can be experimentally confirmed that the compression distortions become larger than the distortions of downsizing the resolution only in the very low-bitrate conditions. In this paper, we applied RVC based HEVC in various video types and measured the target bitrates that RVC method can be effectively applied.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.118-124
• /
• 2008

For forward error correction, DVB-S2, which is the digital video broadcasting forward error coding and modulation standard for satellite television, uses a system based the concatenation of BCH with LDPC inner coding. In DVB-S2 the LDPC codes are defined for 11 different code rates, which means that a DVB-S2 LDPC decoder should support multiple code rates. Seven of the 11 code rates, 3/5, 2/3, 3/4, 4/5, 5/6, 8/9, and 9/10, are regular and the rest four code rates, 1/4, 1/3, 2/5, and 1/2, are irregular. In this paper we propose a flexible decoder for the regular LDPC codes. We combined the partially parallel decoding architecture that has the advantages in the chip size, the memory efficiency, and the processing rate with Benes network to implement a DVB-S2 LDPC decoder that can support multiple code rates with a block size of 64,800 and can configure the interconnection between the variable nodes and the check nodes according to the parity-check matrix. The proposed decoder runs correctly at the frequency of 200MHz enabling 193.2Mbps decoding throughput. The area of the proposed decoder is $16.261m^2$ and the power dissipation is 198mW at a power supply voltage of 1.5V.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.75-78
• /
• 2003

MPEG-4 표준은 저작자가 정지영상, 텍스트, 2D/3D 그래픽스, 오디오, 심지어 임의형의 비디오 등과 같이 다양한 형태의 객체들을 개별적으로 구성하고 이들을 시/공간자적으로 다루기 용이하게 해 준다. 이와 같은 객체 기반 코딩 특성에 의해서 대화형 방송 콘텐츠를 제작하는데 가장 유용한 방식으로 고려할 수 있다. 피러나, 콘텐츠의 제작, 전송, 소비 관전에서 고려해 달 때, 콘텐츠 제작자 또는 저작권자의 보호 및 관리가 필요하게 되었다. 이에 따라 최근에는 OPIMA (Open Platform Initiative for Multimedia Access), SDMI (Secure Digital Music Initiative) and MPEG(Moving Picture Expert Group) OPIMATfMr(Intellectual Property Management & Protection)와 같은 국제 표준 단체들이 콘텐츠 보호 및 관리에 대한 관심을 가지게 되었다. 특히, MPEG의 경우에 MPEG-4 IPMP를 표준화하여 디지털 콘텐츠와 저작권에 대한 보호를 체계적이고 효과적으로 다루는 연구를 가장 활발히 해오고 있다. 이 논문에서 우리는 MPEG-4 콘텐츠 저작자가 MPEG-4 규격에 맞게 보호화 된 객체 기반 방송용 콘텐츠를 쉽고 편리하게 제작학 수 있도록 하기 위한 MPEG씨 콘텐츠 및 저자권 보호를 위한 MPEG-4 IPMP 저작 도구를 제안하고자 한다. 제안한 MPEG-4 콘텐츠 및 저작권 보호 저작 도구는 저작자에게 친근한 사용자 인터페이스를 제공하여 편집 및 수정이 용이한 텍스트 포맷인 IPMP회된 XMT(extensible Mpeg-4 Textual format) 파일을 생성한다. 또한, 콘텐츠 전송 및 저장의 효율성을 위해 이진 포멧인 IPMP화된 MP4 파일을 생성할 수 있다.으로써, 에러 이미지가 가지고 있는 엔트로피에 좀 근접하게 코딩을 할 수 있게 되었다. 이 방법은 실제로 Arithmetic Coder를 이용하는 다른 압축 방법에 그리고 적용할 수 있다. 실험 결과 압축효율은 JPEG-LS보다 약 $5\%$의 압축 성능 개선이 있었으며, CALIC과는 대등한 압축률을 보이며, 부호화/복호화 속도는 CALIC보다 우수한 것으로 나타났다.우 $23.87\%$($18.00\~30.91\%$), 갑폭 $23.99\%$($17.82\~30.48\%$), 체중 $91.51\%$($58.86\~129.14\%$)이였으며 성장율은 사육 온도구간별 차는 없었다.20 km 까지의 지점들(지점 2에서 지점 6)에서 매우 높은 값을 보이며 이는 조석작용으로 해수와 담수가 강제혼합되면서 표층퇴적물이 재부유하기 때문이라고 판단된다. 영양염류는 월별로 다소의 차이는 있으나, 대체적으로 지점 1과 2에서 가장 낮고, 상류로 갈수록 점차 증가하며 지점 7 상류역이 하류역에 비해 높은 농도이다. 월별로는 7월에 규산염, 용존무기태질소 및 암모니아의 농도가 가장 높은 반면에 용존산소포화도는 가장 낮다. 그러나 지점 14 상류역에서는 5월에 측정한 용존무기태질소, 암모니아, 인산염 및 COD 값이 7월보다 다소 높거나 비슷하다. 한편 영양염류와 COD값은 대체적으로 8월에 가장 낮으나 용존산소포화도는 가장 높다.출조건은 $100^{\circ}C$에서 1분간의 고온단시간 추출이 적합하였다. 증가를 나타내었는데, 저장기간에 따른 물성의 변화는 숭어에 비하여 붕장어가 적었다.양식산은 aspartic acid 및 proline이 많았다. 또한 잉어는 천연산이

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.68-74
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm can obtain around 1.7% BD-bitrate gain and 0.03dB BD-PSNR gain, compared with the conventional fixed-bit min-max algorithm with 37.5% memory saving.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.140-148
• /
• 2009

Recent advances in communication and multimedia technologies make it possible to provide video-on-demand(VOD) services and people can access video servers over the Internet at any time using their electronic devices, such as PDA, mobile phone and digital TV. Each device has different processing capabilities, energy budgets, display sizes and network connectivities. To support such diverse devices, multiple versions of videos are needed to meet users' requests. In general cases, VOD servers cannot store all the versions of videos due to the storage limitation. When a device requests a stored version, the server can send the appropriate version immediately, but when the requested version is not stored, the server first converts some stored version to the requested version, and then sends it to the client. We call this conversion process transcoding. If transcoding occurs frequently in a VOD server, the CPU resource of the server becomes insufficient to response to clients. Thus, to admit as many requests as possible, we need to maximize the CPU availability. In this paper, we propose a new algorithm to select versions from those stored on disk using a branch and bound technique to maximize the CPU availability. We also explore the impact of these storage management policies on streaming to heterogeneous users.

• Journal of Broadcast Engineering
• /
• v.25 no.4
• /
• pp.609-619
• /
• 2020

In accordance with a demand for high quality video streaming, it needs high data rate in limited bandwidth and more traffic congestion occurs. In particular, when providing real time video service, packet loss rate and bit error probability increase significantly. To solve these problems, a raptor code, which is one of FEC(Forward Error Correction) techniques, is pervasively used in the application layers as a method for improving real-time service quality. In this paper, we propose a method of determining image transmission parameters based on various deep neural networks to increase transmission efficiency at a similar level of image quality by using raptor codes. The proposed neural network uses the packet loss rate, video encoding rate and data rate as inputs, and outputs raptor FEC parameters and packet sizes. The results of the proposed method present that the throughput is 1.2% higher than that of the existing multimedia transmission technique by optimizing the transmission efficiency at a PSNR(Peak Signal-to-Noise Ratio) level similar to that of the existing technique.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.732-743
• /
• 2008

In H.264/AVC, 4$\times$4 block transform is used for intra and inter prediction instead of 8$\times$8 block transform. Using small block size coding, H.264/AVC obtains high temporal prediction efficiency, however, it has limitation in utilizing spatial redundancy. Motivated on these points, we propose a multi-dimensional transform which achieves both the accuracy of temporal prediction as well as effective use of spatial redundancy. From preliminary experiments, the proposed multi-dimensional transform achieves higher energy compaction than 2-D DCT used in H.264. We designed an integer-based transform and quantization coder for multi-dimensional coder. Moreover, several additional methods for multi-dimensional coder are proposed, which are cube forming, scan order, mode decision and updating parameters. The Context-based Adaptive Variable-Length Coding (CAVLC) used in H.264 was employed for the entropy coder. Simulation results show that the performance of the multi-dimensional codec appears similar to that of H.264 in lower bit rates although the rate-distortion curves of the multi-dimensional DCT measured by entropy and the number of non-zero coefficients show remarkably higher performance than those of H.264/AVC. This implies that more efficient entropy coder optimized to the statistics of multi-dimensional DCT coefficients and rate-distortion operation are needed to take full advantage of the multi-dimensional DCT. There remains many issues and future works about multi-dimensional coder to improve coding efficiency over H.264/AVC.