• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.706-715
• /
• 2005

In this paper, we present a transcoding algorithm for converting an MPEG-2 video bitstream to an H.264 bitstream. The proposed transcoder consists of two parts. One is MPEG2 decoding part and the other is H.264 encoding part Because our algorithm is for transcoding in the spatial domain, MPEG2 decoding part carries out full decoding of MPEG2 bitstream. While, because macroblock type and coded block pattern in MPEG2 are significantly related to macroblock mode in H.264, macroblock mode is selected adaptively according to macroblock type and coded block pattern in H.264 decoding part. Furthermore, motion vector is also used as side-information for 16$\ctimes$16 macroblock mode. Simulation results show that the proposed transcoder yields high reduction of total transcoding time at comparable PSNR.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1034-1044
• /
• 2017

Although traversal strategies are important for the performance of model checking, many studies have ignored the impact of traversal strategies in model checking with a block-encoded abstract reachability graph. Studies have considered traversal strategies only for an abstract reachability graph without block-encoding. Block encoding plays a crucial role in the model checking performance. This paper therefore describes Dual-traversal strategy, a simple and novel technique to control traversal strategies in a block-encoded abstract reachability graph. This method uses two traversal strategies for a model checking, one for effective block-encoding, and the other for traversal in an encoded abstract reachability graph. Dual-traversal strategy is very simple and can be implemented without overhead compared to the existing single-traversal strategy. We implemented the Dual-traversal strategy in an open source model checking tool and compare the performances of different traversal strategies. The results show that the model checking performance varies from the traversal strategies for the encoded abstract reachability graph.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1163-1167
• /
• 2018

The selective encryption scheme for canonical Huffman codes using the inversion of bit values is proposed. The symbols are divided into blocks of a certain size, and each symbol in the block is compressed by canonical Huffman coding. Blocks are determined to be sent in the original code or encrypted form. The encryption block inverts the values of the whole bits, and bits of block that do not encrypt are not inverted. Those compressed data are transmitted with the encryption information. It is possible to decrypt the compressed data on the receiving side using the encryption information and compressed data.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.321-328
• /
• 2007

In this paper, we propose a fast and dynamic Region-of-Interest coding method using the adaptive code-block discrimination algorithm in JPEG2000 images which complements the implicit ROI coding method and the modified implicit ROI coding method. For reducing the time of discriminating the code block, the proposed method estimates the characteristics of the shape of ROI and makes the shape of boundaries, and classifies the patterns of each code block. The method improves the preferred processing and loss of wavelet coefficients of background within the ROI code blocks by adaptively classifying the code blocks with the percentage of content of the wavelet coefficients using the thresholds of ROI and background. Also, the priority control of wavelet coefficients of background within ROI code block supports the rapid ROI coding by processing in batch based on patterns unlike the existing methods that process with unit of wavelet coefficients. To show the usefulness of this method, we compared this to the existing methods. There is no difference in performance, but we confirmed very speedy in processing time.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.96-100
• /
• 1998

Due to expected wide spread use of DCT based image/video coding standard, it is advantageous to process data directly in the DCT domain rather than decoding the source back to the spatial domain. The block processing algorithm provides a parallel processing method since multiple input data are processed in the block filter structure. Hence a fast implementation of the algorithm is well suited. In this paper, we propose the JPEG browse by Block Transform Domain Filtering(BTDF) using subband filter banks. Instead of decompressing the entire image to retrieve at full resolution from compressed format, a user can select the level of expansion required$(2^N{\times}2^N)$. Also this approach reduces the computer cpu time by reducing the number of multiplication through BTDF in the filter banks.

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.303-310
• /
• 2007

Compressed video bitstreams are intended for real-time transmission over communication networks. Because video compression algorithms eliminate the temporal, spatial, and statistical redundancies, the coded video bitstreams are very sensitive to transmission errors. We propose an error resilient video coding technique to limit the effect of error propagation in low bit-rate video coding. The success of error resilient coding techniques relies on how accurately the transmission errors can be detected. To detect the transmission error, we propose a very simple error detection technique based on data hiding Next, we conceal the corrupted MB data using intra MB refresh and motion compensation with the estimated motion vector and compare the simulation results. This method will be useful in video communication in error Prone environment such as WCDMA networks.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.348-356
• /
• 2005

In this paper, we propose a fast bitrate reduction transcoding method to convert a bitstream coded by H.264 into a lower bitrate H.264 bitstream. Block mode informations and motion vectors generated by H.264 decoder are used for probability-based block mode determination in the proposed transcoding method. And the motion vector reuse and motion vector refinement process are applied in the proposed transcoding. In the experiment results, the proposed methods achieves approximately 40 times improvement in computation complexity compared with the cascaded pixel domain transcoding, while the PSNR(Peak Signal to Noise Ratio) is degraded with only $0.1\~0.3$ dB.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.303-304
• /
• 2018

본 논문에서는 Unity게임엔진을 이용하여 만든 유아용 코딩게임의 사례와 결과물을 보인다. 대학에서 초, 중학교로 낮아져 가는 소프트웨어 교육의 연령대의 흐름에 맞춰 유아용 게임을 제작했다. 아이들에게 친근한 자동차게임의 모양으로 문제를 논리적으로 푸는 방법을 찾는 컴퓨팅적 사고를 하게끔 도와 스스로 문제를 해결하게 하고, 성취감을 얻게 해준다. 또 문제에 대한 정해진 답이 없고 자신만의 의견을 낼 수 있기 때문에 호기심과, 창의력의 증폭을 기대할 수 있다. 기본적으로 맵을 이용해 스토리 진행이 이루어지는 코딩게임의 알고리즘을 사용했으며, Unity2D 엔진을 이용해 유아용 블록코딩게임과 키보드게임을 제작했다. 자동차 모양의 객체를 목적지에 도달하게 할 방법을 아이들 스스로 생각하는 컴퓨팅적 사고를 돕는다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.611-613
• /
• 2003

비디오 트랜스코딩을 수행할 때 트랜스코더에서 움직임 벡터를 새로 추출하는 과정은 많은 계산 처리량이 요구된다. 그러므로 실시간으로 비디오스트림을 트랜스코딩하기에는 문제점이 발생한다. 비디오 트랜스코더는 계산복잡도를 감소시키기 위해서 트랜스코더의 인코더부분에서 추출된 움직임 벡터를 트랜스코더의 디로더 부분으로 바로 전송하는 기법을 이용하고 있다. 이러한 기법은 비디오 화질저하를 발생시키므로, 해결책으로 기존의 움직임 벡터를 트랜스코더에서 탐색영역을 작게 하여 정재하는 기법에 관한 연구가 있었다. 본 논문에서는 프레임을 감소시키기 위한 트랜스코딩을 수행할 때 움직임벡터를 구성하는 방법에 대해서 기존의 연구들과 비교하여 개선된 알고리즘을 제안한다. 제안한 알고리즘은 매크로블록이 차지하고 있는 각각의 블록에 대해서 가중치를 적용한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.331-332
• /
• 2019

코딩교육의 의무화로 인해 조기 교육을 위한 코딩교육 프로그램이 성행한다. 하지만 이는 시각 중심적이라 실제 프로그래밍 언어를 접할 때 어려움이 많다. 이를 최소화하기 위해 만든 Python 블록 코딩 웹은 JavaScript, Arduino, Python, Web을 이용하여 시각중심의 블록을 드래그하여 실제 쓰이는 프로그래밍 언어로 바꿔주는 시스템을 개발하였다.