• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.335-338
• /
• 2005

In this paper, we proposed a new MCTF (Motion Compensated Temporal Filtering) technique and its hardware (H/W) architecture for SVC (Scalable Video Coding). Since the proposed MCTF Kernel has a extensible architecture, it executes temporal filtering using (5,3) and (3,1) lifting operation. Also it has the same output data rate as the input, and it can continuously produce filtered frames after some latency time. Since the proposed architecture has simpler architecture than previous ones, it is easily mapped into H/W and has optimized memory usage rate and low cost.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.63-65
• /
• 2017

This paper proposes a detection algorithm of video tampering by investigating the change of HEVC coding pattern. When a part of video is deleted and re-compressed, the characteristic patterns are generated by forgery. The proposed algorithm uses these patterns to classify whether video is forged. Experimental results show that the proposed method detects video forgery effectively.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1956-1963
• /
• 2000

In this paper, a wavelet image coding scheme exploiting the correlation of neighboring VQ indices in eh wavelet domain is proposed. the codewords in each sub-codebook are re-ordered in terms of their energies in order to increase the correlation of he indices. Then, the generated indices after VQ can be further encoded by non-adaptive DPCM/Huffman method. LBG algorithm and a fast-PNN algorithm using k-d trees are used for generating a multiresolution codebook. Experimental results show that or scheme outperforms the ordinary wavelet VQ and JPEG at low bit rates.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.167-173
• /
• 2003

We treat the problem of channel estimation and interference cancellation in multiuser ultra-wide-band (UWB) communication systems over multipath fading channels. The UWB system under consideration employs a random time-hopping impulse radio format. We develop a channel estimation method based on linear weighted algorithm. An iterative channel estimation and interference cancellation scheme is proposed to successively improve the receiver performance. We also consider systems employing multiple transmit and/or receive antennas. For systems with multiple receive antennas, we develop a diversity receiver for the wellseparated antennas. For systems with multiple transmit antennas, we propose to make use of Alamouti’s space-time transmission scheme, and develop the corresponding channel estimation and interference cancellation receiver techniques. Simulation results are provided to demonstrate the performance of various UWB receiver techniques developed in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.261-266
• /
• 2007

UMTS release 5 에서 소개된 HSDPA 를 위해 도입된 새로운 기술 Adaptive Modulation and Coding, Hybrid Automatic Repeal reQuest, Fast Packet Scheduling 에 대해 알아보고 여기서 key role 이 되는 Fast Packet Scheduling 알고리즘 가운데 대표적인 세 가지 Round Robin(RR), Promotional Fairness(PF), Maximum Channel Quality Index(Max CQI) 알고리즘의 성능을 시스템 수율과 공평성의 관점에서 분석해보았다. 시스템 수율에서는 Max CQI, PF. RR 알고리즘 순이었으며 공평성 측면에서는 RR, PF Max CQI 알고리즘 순으로 나타났다. 같은 시스템, 같은 망 구조 내에서라면 알고리즘을 최적화하여 QoS와 성능을 극대화할 수 있도록 지속적인 연구가 필요하다.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.41-44
• /
• 2008

Digital visual information(image and video) plays an important role in our society, and everyday, more and more visual information is available from many sources around the world. And there is an increasing number of cases where the these visual informations are created, stored, retrieved, and re-used by computational systems. But information modification, distortion and compilation occurred through trans-coding or legal/illegal information processing often make these operations difficult. Subordinately, advanced technology or commercialized software for retrieving and identifying the desired information among these massive and diverse ones is strongly required. In the paper, some recent activities and technical content of MPEG-7 Visual Group are described, especially with regarding to Visual Identifier.

• Journal of Mechanical Science and Technology
• /
• v.15 no.12
• /
• pp.1853-1859
• /
• 2001

An experimental study is presented for a flow field in a two dimensional wavy channels by PIV. This flow has two major applications such as a blood flow simulation and the enhancement of heat transfer in a heat exchanger. While the numerical flow visualization results have been limited to the fully developed cases, existing experimental results of this flow were simple qualitative ones by smoke or dye streak test. Therefore, the main purpose of this study is to produce quantitative flow data for fully developed and developing flow regimes by the Correlation Based Correction PIV (CBC PIV) and to conjecture the analogy between flow characteristics and heat transfer enhancement with low pumping power. Another purpose of this paper is to examine the onset position of the transition and the global mixing, which results in transfer enhancement. PIV results on the Fully developed and developing flow in a wavy channel at Re=500, 1000 and 2000 are obtained. for the case Reynolds Number equals 500, the PIV results are compared with the finite difference numerical solution.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.19-38
• /
• 2007

Graph theory is becoming increasingly significant as it is applied of mathematics, science and technology. It is being actively used in fields as varied as biochemistry(genomics), electrical engineering(communication networks and coding theory), computer science(algorithms and computation) and operations research(scheduling). The powerful results in other areas of pure mathematics. Rhis paper, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.

• Mycobiology
• /
• v.51 no.3
• /
• pp.122-138
• /
• 2023

Elsinoë are plant pathogenic fungi that cause scabs, spotted anthracnose, and some morphological distortions on various plants, including woody plants, economically important crops, and ornamental plants. Taxonomical reexamination of Elsinoë species in Japan has not yet been conducted based on the modern species criteria. In this study, several Japanese isolates were reexamine based on the morphological and molecular-phylogenetic analysis of the internal transcribed spacer region (ITS), large subunit gene (LSU)m and protein-coding gene such as RNA polymerase II subunit (rpb2) and Translation elongation factor 1-alpha (tef). Japanese isolates were divided into four clades and three new species, Elsinoë hydrangeae, E. sumire, and E. tanashiensis were proposed. One species, Sphaceloma akebiae, was transferred to the genus Elsinoë.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.