• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.113-121
• /
• 2012

In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2690-2695
• /
• 2007

This work presents numerical optimization for design of a blade stacking line of a low speed axial flow fan with a fast and elitist Non-Dominated Sorting of Genetic Algorithm (NSGA-II) of multi-objective optimization using three-dimensional Navier-Stokes analysis. Reynolds-averaged Navier-Stokes (RANS) equations with ${\kappa}-{\varepsilon}$ turbulence model are discretized with finite volume approximations and solved on unstructured grids. Regression analysis is performed to get second order polynomial response which is used to generate Pareto optimal front with help of NSGA-II and local search strategy with weighted sum approach to refine the result obtained by NSGA-II to get better Pareto optimal front. Four geometric variables related to spanwise distributions of sweep and lean of blade stacking line are chosen as design variables to find higher performed fan blade. The performance is measured in terms of the objectives; total efficiency, total pressure and torque. Hence the motive of the optimization is to enhance total efficiency and total pressure and to reduce torque.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.807-817
• /
• 2008

We present a low-density parity-check (LDPC)-based, threaded layered space-time-frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean-squared-error iterative-tree-search (U-MMSE-ITS) detector, which is known to be one of the most efficient multi-input multi-output (MIMO) detectors available, is improved by augmentation of the partial-length paths and by the addition of one-bit complement sequences. Compared with the U-MMSE-ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low-complexity belief-propagation (BP) decoding algorithm for LDPC-codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low-complexity BP decoder, the proposed system is a promising solution to high-data-rate transmission over selective-fading channels.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.67-70
• /
• 2009

H.264/AVC 동영상 표준은 기존의 동영상 표준과 비교했을 때 뛰어난 압축률을 보인다. 특히 세밀한 움직임 예측을 통해 영상을 효율적으로 압축하지만 움직임 예측은 H.264/AVC 동영상 표준의 높은 복잡도의 원인 중 하나이다. 따라서 H.264/AVC의 부호화 시간을 단축하기 위해서는 고속 움직임 추정 기법이 필수적이다. 일반적으로 영상 신호는 인접한 화면과 매크로블록 사이에서 상관관계가 높고 부호화하고자 하는 매크로블록의 움직임벡터는 인접한 매크로블록에서 결정된 최적의 움직임 벡터와 유사한 방향성을 가진다. 그러므로 고정된 탐색 영역의 크기를 이용하면 불필요한 영역까지 움직임 예측 과정이 수행되어 계산량이 증가한다. 본 논문에서는 영상의 공간적, 시간적 상관도를 이용하여 탐색 영역의 크기를 결정하는 방법을 제안한다. 인접하는 블록들의 움직임 벡터의 표준편차를 이용하여 움직임이 작은 영역에서는 작은 탐색 영역을 이용하여 움직임 예측을 수행하고 반대로 움직임이 큰 영역에서는 큰 탐색 영역을 이용하여 움직임 예측을 수행한다. 또한 현재 화면과 참조 화면의 거리차가 클수록 참조 화면으로 선택되는 확률이 낮다는 사실을 이용하여 적응적으로 탐색 영역의 크기를 조절한다. 제안한 방법은 기존의 전 영역 탐색 방법과 유사한 부호화 성능을 보이면서 움직임 예측 시간이 평균 약 58.93% 감소하는 것을 확인할 수 있다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.77-88
• /
• 1995

It is assumed in the block matching algorithm(BMA) that all the pels in a block have a same motion vector. Then, the motion vector of a block in the BMA is matched to only one or none of the objects in the worst case if objects in a block have different motion vectors. This is apparent in the motion estimation using the fast BMA which has the effect of reducing the computation time and hardware complexity, compared to the full search BMA. Although the motion vector in the motion estimation using small block size is accurate, the increased number of bits is required to represent motion vectors. In this paper, new motion vector segmentation with less additional information and hardware complexity than the conventional method is proposed. In the proposed method, a motion vector is derived from the block for motion vector segmentation and another motion vector is extracted from four neighboring blocks to consiture a motion vector pair. For the accurate motion vector of each subblock, the motion vector is assigned to each subblock by mean squared error measure. And the overlapped motion compensation using window is also applied to reduce displaced frame difference.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.649-651
• /
• 2000

Terrain Following 이란 가상환경 내에서 지형의 표면을 이동할 때 지형의 모양에 따라 자연스럽게 지표위를 이동할 수 있게 하는 기술로서, 이것을 위해서는 지표면상에서 움직이는 물체가 갖는 위치와 높이 정보를 매시간 알아내야 한다. 전통적인 접근방법은 지표면의 높이(z)가 일정하다고 가정하건, 일반적인 충돌 감지 알고리즘을 이용하는 것이다. 그러나 충돌 감지 알고리즘은 복잡하게 모델링 된 물체들간의 충돌을 감지하기 위해 고안된 알고리즘으로서 비교적 단순한 Terrain Following에 적용할 경우 불필요한 연산을 많이 하게 되어 오히려 시간적인 손실을 초래할 수 있다. 또한 Quadtree를 지형의 데이터의 표현에 적합하며 지형과 같은 벡터 데이터의 표현에는 적합하지 않다. 본 연구에서는 네비게이션시 발생하는 인접성에 기반한 지역 탐색 방법을 사용하여 실시간 계산을 좀 더 빠르게 처리할 수 있는 알고리즘과 자료구조를 제시한다. 이 방법을 사용하면 탐색과정에서 발생하는 비교 횟수를 크게 줄일 수 있어 실시간 네비게이션시의 탐색 성능을 향상 시킬 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1442-1462
• /
• 2014

Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.6
• /
• pp.39-47
• /
• 2008

In this research, a web-based design support system is constructed for the design process of automotive steel pulley to gather engineering knowledge from pulley design data. In the design search module, a clustering tool for design data is proposed using K-means clustering algorithm. To obtain correlational patterns between design and FEA (Finite Element Analysis) data, a Multi-layer Back Propagation Network (MBPN) is applied. With the analyzed patterns from a number of simulation data, an estimation of minimum von mises can be provided for given design parameters of pulleys. The case study revealed fast estimation of minimum stress in the pulley within 12% error.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.2
• /
• pp.288-294
• /
• 2013

The diagnosis of motor failures using an on-line method has been the aim of many researchers and studies. Several spectral analysis techniques have been developed and are used to facilitate on-line diagnosis methods in industry. This paper discusses the first application of a motor flux spectral analysis to the identification of broken rotor bar (BRB) faults in induction motors using a multiple signal classification (MUSIC) technique as an on-line diagnosis method. The proposed method measures the leakage flux in the radial direction using a radial flux sensor which is designed as a search coil and is installed between stator slots. The MUSIC technique, which requires fewer number of data samples and has a higher detection accuracy than the traditional fast Fourier transform (FFT) method, then calculates the motor load condition and extracts any abnormal signals related to motor failures in order to identify BRB faults. Experimental results clearly demonstrate that the proposed method is a promising candidate for an on-line diagnosis method to detect motor failures.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.42-48
• /
• 2015

Generally, the current commercial cloud system is hosted by the centralization large datacenter. However, the other clouding forms existed and one of them is the P2P cloud. The P2P Cloud is a distributed systems, is freedom to join and leave and is possible to provide the IaaS. Commonly, P2P Cloud System is based on Pure-P2P System. Since a number of connection paths exist, it has a high reliability and easily scalability of the network. However, there are disadvantages of the slow rate of route because of looking up the all peers in order to search for the peer. In this paper, it proposes the P2P cloud system based on super-peer P2P. Super-peer P2P system has fast routing time, because of searching for cluster unit and it also can has high reliability and high scalability. We designs the super Peer cloud service and proposes the system model and Resource Allocation Algorithm for IaaS in Super peer P2P environment.