• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.337-340
• /
• 2001

본 논문에서는 MPEG가 비디오 스트림의 형상 정보를 클러스터링 하여 VO(Visual Object)의 동작을 요약하는 새로운 방법을 제안한다. 제안하는 방법은 MPEG-4 비트 스트림의 디코딩 없이 형상 정보를 근사화 한다. 그리고 사용자가 입력한 질의 VOP(Video Object Plane)와 VO의 각 VOP와의 NMHD(Normalized Mean Hausdorff Distance)를 구한 후 클러스터링을 수행하여 키 영역을 분리해낸다. 클러스터링에 의해 시간적으로 분리된 영역의 지속성을 고려하여 Rank를 매김으로써 사용자가 원하는 수의 키 VOP를 선택할 수 있게 한다. 제안하는 방법은 클러스터링을 사용함으로써 키 VOP를 선정하였으며, Rank와 질의 VOP를 사용하여 사용자와의 상호작용이 가능하다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.377-382
• /
• 1997

멀티미디어가 발달함에 딸 이를 위한 다양한 검색 기법들이 제안되고 있다. 본 논문에서는 WeCAM 시스템에서 비디오 검색을 하기 위한 텍스처 성분과 영상의 윤곽선 특징을 동시에 이용한 검색 기법을 제안한다. 텍스처 특성 추출에는 8$\times$8 블록 DCT를 기반으로한 DCT-par와 DCT-energy 기법을 적용하고 윤곽선 추출에는 DCT의 대각선 계수를 이용하는 기법을 이용한다. WebCAM으로 생성된 비디오는 MPEG표준을 따르는 것으로 가정하고 있으며, 압축된 데이터에 디코딩 과정없이 직접 검색 기법을 적용함으로써 처리 시간을 단축할수 있다는 장점이 있다.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.401-410
• /
• 2008

Multiview Video Coding contains a macroblock-based illumination compensation tool which can compensate the variations of illuminations according to view or temporal directions. Thanks to illumination compensation tool, the coding efficiency of Multiview Video Coding has been enhanced. However illumination compensation tool also generates additional subjective drawbacks of the blocking artifacts due to macroblock-based compensations of mean values. A deblocking filtering method for Multiview Video Coding which is the same as in H.264/AVC does not consider illumination difference between the illumination compensated blocks, thus it can not effectively eliminate the blocking artifacts. Therefore, this paper analyzes the phenomena of blocking artifacts caused by illumination compensation and proposes a method which can effectively eliminate the blocking artifacts with the minimum changes of the H.264 deblockding filtering method. In the simulation results, it can be easily found the blocking artifacts are clearly eliminated in the subjective comparisons, and the average bit-rate reduction is up to 1.44%.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.775-781
• /
• 2015

EBS started 2HD MMS experimental broadcasting for the first time in Korea on Feb. 11, 2015. It uses the picture compression technique based on MPEG-2 CODEC, and applies the result of the experiment about variable bit rates and changes according to the scanning types, 1080i and 720p. But when changing channels, the delay in displaying picture occurs because of the operation of the variable GOP on MMS broadcasting, which optimizes image quality by application variable bit rates. In this study, verified the relationship between the decoding time of I frames and the GOP set in the encoding step by experimenting and analyzing ON-AIR TS. By using the verification data and adjusts the Encoder GOP parameters, improved the different video display time delays according to the scanning mode 1080i and 720p.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.637-646
• /
• 2005

Most of the multimedia contents for DBM services art provided as MPEG-2 bit streams. However, they have to be transcoded to H.264 bit streams for practical services because the standard video codec for DMB is H.264. The existing transcoder architecture is Cascaded Pixel-Domain Transcoding Architecture, which consists of the MPEG-2 dacoding phase and the H.264 encoding phase. This architecture can be easily implemented using MPEG-2 decoder and H.264 encoder without source modifying. However. It has disadvantages in transcoding time and DCT-mismatch problem. In this paper, we propose two kinds of transcoder architecture, DCT-OPEN and DCT-CLOSED, to complement the CPDT architecture. Although DCT-OPEN has lower PSNR than CPDT due to drift problem, it is efficient for real-time transcoding. On the contrary, the DCT-CLOSED architecture has the advantage of PSNR over CPDT at the cost of transcoding time.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.5
• /
• pp.231-242
• /
• 2016

In order to meet rapid changes of Web information, it is necessary to extend the current Web technologies to represent both the valid time and location of each fact and knowledge, and reason their relationships. Until recently, many researches on qualitative temporal reasoning have been conducted in laboratory-scale, dealing with small knowledge bases. However, in this paper, we propose the design and implementation of a parallel qualitative temporal reasoner, MRQUTER, which can make reasoning over Web-scale large knowledge bases. This parallel temporal reasoner was built on a Hadoop cluster system using the MapReduce parallel programming framework. It decomposes the entire qualitative temporal reasoning process into several MapReduce jobs such as the encoding and decoding job, the inverse and equal reasoning job, the transitive reasoning job, the refining job, and applies some optimization techniques into each component reasoning job implemented with a pair of Map and Reduce functions. Through experiments using large benchmarking temporal knowledge bases, MRQUTER shows high reasoning performance and scalability.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.137-145
• /
• 2014

In this paper, we focus on end-to-end transfer delay improvement by using erasure coding when delivering expediting message consisting of M packets in networks with high coefficient of variation of transfer time. In the scheme, M packets are divided into b groups with each having g packets. Each group is erasure coded with additional r packets and transmitted. Since the first arrived g packets among g+r packets completes the delivery of the group, the delivery time of the expediting message is reduced. For the scheme, we investigate the optimum group size and number of redundancy packets considering delivery delay reduction and additional transmission cost caused by using erasure coding. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1311-1319
• /
• 2007

This paper presents the VHDL implementation procedure of the passive RFID tag operating in Ultra High Frequency. The operation of the tag compatible with the EPCglobal Class1 Generation2(GEN2) protocol is verified by timing simulation after synthesis and implementation. Due to the reading range with relatively large distance, a passive tag needs digital processor which facilitates faster decoding, encoding and state transition for enhancement of an interrogation rate. In order to satisfy linking time, the pipe-line structure is used, which can minimize latency to serial input data stream. We also propose the sampling strategy to decode the Preamble, the Frame-sync and PIE symbols in reader commands. The simulation results with the fastest data rate and multi tags environment scenario show that the VHDL implemented tag performs faster operation than GEN2 proposed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.68-69
• /
• 2016

ISO/IEC 13818-1 MPEG2 시스템의 타이밍 모델은 인코더에 들어간 비디오와 오디오 샘플들이 일정한 딜레이가 지난 후 디코더에서 정확히 한 번씩 나타나는 식으로 구현된다. 해당되는 디코더는 타이밍 모델에 부합하여 대응되는 비트스트림을 전달받는다. 이를 통해서 적절하게 동기화가 이루어진 고품질 오디오와 비디오를 위한 디코더 구현을 쉽게 할 수 있다. 반면에, RTP 타이밍 모델은 실제 프리젠테이션 시간에 관한 타이밍 정보를 가지고 있지 않다. 데이터 패킷의 타임스탬프는 상대적 타이밍을 제공하고, RTCP 송신자는 스트림 간 동기화에 대한 정보를 제공하지만 RTP 수신기에서는 버퍼링의 량이나 패킷의 디코딩 시간에 대한 정보를 주지 않는다. 따라서 RTP는 유동적인 전송 지향적인 타이밍 모델을 가지고 있다. 반면에 MPEG-2 시스템은 정확한 타이밍 모델을 수신측을 위해 제공하고 있다. 본 논문에서는 MPEG-2 시스템과 RTP의 타이밍 모델의 이점을 가져와 MMT 시스템을 위한 타이밍 모델을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.3
• /
• pp.147-152
• /
• 1985

The error-trapping decoder is constructed for the (7, 3) Reed-Solomon code. The syndrome resister is constructed with the encoder and the substanial test logic circuits. The element of GF(8) is represented by the triple D-flip-floops. The hardware is constructed. And it is controlled by the micro computer(Apple II). The time for the encoding and the decoding were $350\musecs and 910u secs respectively. The experimental results show that the two symbol errors were corrected and 4-bit-binary-burst errors were also corrected.