• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.567-569
• /
• 2011

최근 비디오를 즐기는 방법에 있어서 다양한 형식 및 기기가 사용되고 있으며, 이러한 실질적 요구를 충족시키기 위한 방법으로 빠른 비디오 변환 기술이 필요하다. 비디오 변환 기술 중 해상도 축소를 위한 새로운 움직임 벡터 재예측 방법을 제안한다. 줄어든 영상 내 블록의 움직임 벡터를 결정하기 위해 원본 영상 내 대응 되는 위치의 2개 이상의 움직임 벡터들을 K-means clustering 방법 기반으로 다중 후보 움직임 벡터를 결정하고, 결정된 움직임 벡터 중에서 차이의 절대값 합이 최소가 되는 움직임 벡터를 줄어든 영상 내 블록을 위한 움직임 벡터로 결정한다,. 실험 결과 비디오 변환 없이 압축을 수행한 연산시간에 비해 9% 정도의 연산시간이 필요하였으며, 압축 효율은 BR-RATE가 약 17정도 증가하여 기존의 방식의 증가량에 비해 60%로 줄어든 결과를 보여주었다.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.11-16
• /
• 2003

In this paper, a Fast Block Sum Pyramid Algorithm (FBSPA) is presented for motion estimation in video coding. PBSPA is based on Block Sum Pyramid Algorithm(BSPA), Efficient Multilevel Successive Elimination Algorithms for Block Matching Motion Estimation, and Fast Algorithms for the Estimation of Motion Vectors. FBSPA reduces the computations for motion estimation of BSPA 29％ maximally using partial distortion elimination(PDE) scheme.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.3
• /
• pp.303-308
• /
• 2006

To solve the rule explosion problem in multi input fuzzy logic system, a method of converting a given fuzzy system to 2 layered hierarchical fuzzy system is presented where the collection of the THEN-parts of the fuzzy rules of given fuzzy system is considered as vectors of fuzzy rule. At the 1 st layer, linearly independent fuzzy rule vectors generated from the given fuzzy logic system are used and, at the 2nd layer, linear combinations of these independent fuzzy rule vectors are used for fuzzy logic units at each layer. The resultant 2 layered hierarchical fuzzy system has not only equivalent approximation capability, but less number of fuzzy rules compared with the conventional fuzzy logic system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.96-97
• /
• 2020

랜덤워크 기반 노드 랭킹 방식 중 하나인 RWR(Random Walk with Restart) 기법은 희소행렬 벡터 곱셈 연산과 벡터 간의 합 연산을 반복적으로 수행하며, RWR 의 수행 시간은 희소행렬 벡터 곱셈 연산 방법에 큰 영향을 받는다. 본 논문에서는 CSR5(Compressed Sparse Row 5) 기반 희소행렬 벡터 곱셈 방식과 CSR-vector 기반 희소행렬 곱셈 방식을 채택한 GPU 기반 RWR 기법 간의 비교 실험을 수행한다. 실험을 통해 데이터 셋의 특징에 따른 RWR 의 성능 차이를 분석하고, 적합한 희소행렬 벡터 곱셈 방안 선택에 관한 가이드라인을 제안한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.513-515
• /
• 2023

본 논문에서는 그리드 탐색과 트랜스포머를 사용한 그룹 행동 인식 모델을 제안한다. 추출된 여러 사람의 스켈레톤 정보를 차분 벡터, 변위 벡터, 관계 벡터로 변환하고 사람별로 묶어 이를 TimeDistributed 함수에 넣고 풀링을 한다. 이를 트랜스포머 모델의 입력으로 넣고 그룹 행동 인식 분류를 출력하였다. 논문에서 3가지 벡터를 입력으로 하여 합치고 트랜스포머 계층을 거친 모델과 3가지 벡터를 입력으로 하고 계층적으로 트랜스포머 모델을 거쳐 행동 인식 분류를 출력하는 두 가지 모델을 제안한다. 3가지 벡터를 합친 모델에서 클래스 분류 정확도는 CAD 데이터 세트 96.6%, Volleyball 데이터 세트 91.4%, 계층적 트랜스포머 모델은 CAD 데이터 세트 96.8%, Volleyball 데이터 세트 91.1%를 얻었다

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.32-37
• /
• 2008

Satellite communication systems including the DVB-S2 (Digital Video Broadcasting - Satellite Version 2) system require operations under low signal-to-noise ratio (SNR) and large frequency offset values, and the initial frame synchronization process necessitates a robust correlation method. While a variety of conventional correlation structures exist for the initial synchronization, each method has different characteristics and performance in different channel environments. In this paper, we propose new correlation methods which exhibit enhanced performance in low SNR and large frequency offsets, and analyze their performance. The proposed methods use the magnitude sum and vector sum of extended differential correlation values, to maximize the correlation between the received signal and the synchronization sequence by using the spanned differential correlation result. The magnitude sum correlation method has better performance compared to conventional methods including the approximated ML (Maximum likelihood) method for SNR values below 4 dB with or without frequency offsets. The vector sum correlation method has improved performance over the magnitude sum method for channels with relatively small frequency offsets.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.27-36
• /
• 2007

Changeable biometrics identify a person using transformed biometric data instead of original biometric data in order to enhance privacy and security in biometrics when biometric data is compromised. In this paper, a novel scheme which generates changeable face templates for statistical appearance-based face recognition is proposed. Two different original face feature vectors are extracted from two different appearance-based approaches, respectively, each original feature vector is normalized, and its elements are re-ordered. Finally a changeable face template is generated by weighted addition between two normalized and scrambled feature vectors. Since the two feature vectors are combined into one by a two to one mapping, the original two feature vectors are not easily recovered from the changeable face template even if the combining rule is known. Also, when we need to make new changeable face template for a person, we change the re-ordering rule for the person and make a new feature vector for the person. Therefore, the security and privacy in biometric system can be enhanced by using the proposed changeable face templates. In our experiments, we analyze the proposed method with respect to performance and security using an AR-face database.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.373-381
• /
• 2011

This paper discusses how to get the sums of squares due to treatment factors when Type I Analysis is used by projections for the analysis of data under the assumption of a two-way ANOVA model. The suggested method does not need to calculate the residual sums of squares for the calculation of sums of squares. There-fore, the calculation is easier and faster than classical ANOVA methods. It also discusses how eigenvectors and eigenvalues of the projection matrices can be used to get the calculation of sums of squares. An example is given to illustrate the calculation procedure by projections for unbalanced data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.947-955
• /
• 2012

In this paper, we propose iterative algorithms to obtain the transmit and the receive vectors for interference alignment in cellular network. Although the conventional interference alignment algorithms for interference channels can be applied to cellular network, the number of iterations required to achieve a high sum rate is very large. The key idea in the proposed algorithms is to ignore intra-cell interference in updating the transmit vector for uplink and the receive vector for downlink. Numerical results show that the proposed algorithms achieve higher sum rates than the conventional algorithms for given iteration numbers when multiple antennas and a single carrier are used for interference alignment. It is also shown that the proposed algorithms outperform the conventional algorithms when a single antenna and multiple subcarriers are used for interference alignment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.598-603
• /
• 2007

To solve the rule explosion problem in multi-input fuzzy system, a method of converting a given fuzzy system to 2 layered hierarchical fuzzy system has been reported, where at the 1st layer, linearly independent fuzzy rule vectors generated from the given fuzzy system are used and, at the 2nd layer, linear combinations of these independent fuzzy rule vectors are used. In this paper, the steapest descent algorithm is presented to learn the fuzzy rule vectors and related coefficients for the equivalent 2 layered hierarchical structure. By simulation of learning of ball and beam control system, the feasibility of proposed learning scheme is shown.