• Journal of information and communication convergence engineering
• /
• 제8권2호
• /
• pp.155-158
• /
• 2010

In this article, we proposed a new interference canceller using the adaptive algorithm. We designed constant modulus algorithm-correlation normailized least mean square (CMA-CNLMS) for wireless system. This structure is normalized LMS algorithm using correlation between the desired and input signal for cancelling the interference signals in the wideband code division multiple access (WCDMA) system. We showed that the proposed algorithm could improve the Mean Square Error (MSE) performance of LMS algorithm. MATLAB (Matrix Laboratory) is employed to analyze the proposed algorithm and to compare it with the experimental results. The MSE value of the LMS with mu=0.0001 was measured as - 12.5 dB, and that of the proposed algorithm was -19.5 dB which showed an improvement of 7dB.

• 한국컴퓨터정보학회논문지
• /
• 제24권7호
• /
• pp.79-85
• /
• 2019

We investigate the D2D utility maximization in the cellular system. We focus on the non cooperative game theoretic approach to maximize the individual utility. Cellular system's perspective, interference from the D2D links must be limited to protect the cellular users. To accommodate this interference issue, utility function is first defined to control the individual D2D user's transmit power. More specifically, utility function includes the pricing which limits the individual D2D user's transmit power. Then, non cooperative power game is formulated to maximize the individual utility. Distributed algorithm is proposed to maximize the individual utility, while limiting the interference. Convergence of the proposed distributed algorithm is verified through computer simulation. Also the effect of pricing factor to SIR and interference is provided to show the performance of the proposed distributed algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1457-1460
• /
• 1987

2-D shape matching algorithm is proposed which uses pivot vector and componentwise adaptive convergence factor. It is proved that proposed algorithm has better result than any other algorithm. It is to be expected that this algorithm will work effectively in 3-D shape matching.

• 대한전자공학회논문지TC
• /
• 제39권10호
• /
• pp.38-45
• /
• 2002

본 논문에서는 기존의 Compact 2D FDTD(Finite-Difference Time-Domain)에 대한 고속 알고리즘으로써 시간간격 △t가 안정조건(Stability Condition)에 의해 제한받지 않는 Compact 2D ADI(Alternating Direction Implicit)-FDTD 차분식을 제안하였다. 또한 구현된 알고리즘의 정확성 및 효율성을 검증하기 위하여 내부가 공기로 채워져 있는 구형(Rectangular) 도파관과 차폐된 전송선로를 해석하였다. 본 논문의 결과는 기존의 Compact 2D FDTD의 결과 및 해석적인 해와 매우 잘 일치하며, 계산 소요시간도 기존의 Compact 2D FDTD에 비해 상당히 절약되었음을 확인하였다. 제안된 알고리즘은 도파관 구조의 분산 특성 연구에 있어 효율적인 고속화 기술로서 의미가 있다고 할 수 있다.

• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.343-359
• /
• 2020

In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.

• 자연과학논문집
• /
• 제7권
• /
• pp.27-35
• /
• 1995

정지영상이나 동영상 코딩에 적용되는 2-D DCT의 효율적인 VLSI 구현을 위한 방법을 제시하였다. 2차원 상태공간식에 근거한 알고리즘 및 데이타 분할기법을 활용하여 다중프로세서 구조에서 문제가 되는 프로세서간의 통신량을 크게 감축시켰으며, 모든 통신을 국부적(local)이 되도록 하였다. 순차 주사 방식의 영상데이타를 입력할 수 있도록 설계하여 입력장치에 소요되는 하드웨어를 최소화하였으며, 계산의 순서를 조정함으로써 일반적인 행.열 분할 방법을 사용하는 2-D DCT에서 필요로 하는 Transposition RAM을 제거하였다. 제안된 VLSI 구조는 실시간 one-chip 2-D DCT 및 보다 큰 2-D DCT로 확장될 수 있다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 춘계학술대회 논문집
• /
• pp.462-465
• /
• 2002

This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

• 전자공학회논문지CI
• /
• 제40권6호
• /
• pp.127-140
• /
• 2003

본 논문은 2차원 Discrete Cosine Transform (2D-DCT)의 계산을 새로운 Polynomial 변환을 통하여 1차원 DCT의 합으로 변환하여 계산하는 알고리즘을 개발한다. 기존의 2차원 계산방법인 row-column 으로는 N×M 크기의 2D-DCT에서 3/2NMlog₂(NM)-2NM＋N＋M의 합과 1/2NMlog₂(NM)의 곱셈이 필요한데 비하여 본 논문에서 제시한 알고리즘은 3/2NMlog₂M＋NMlog₂N-M-N/2＋2의 합과 1/2NMlog₂M의 곱셈 수를 필요로 한다. 또한 기존의 polynomial 변환에 의한 2D DCT는 Euler 공식을 적용하였기 때문에 복소 연산이 필요하지만 본 논문에서 제시한 polynomial 변환은 DCT의 modular 규칙을 이용하여 2D DCT를 ID DCT의 합으로 직접 변환하므로 복소 연산이 필요하지 않다.

• 한국산학기술학회논문지
• /
• 제9권5호
• /
• pp.1225-1233
• /
• 2008

본 논문은 2D/3D 변환 알고리즘을 제안하였다. 제안된 알고리즘은 2차원 영상의 단일 프레임을 이용한 것으로 실시간 처리가 가능한 알고리즘이다. 제안된 알고리즘은 하나의 프레임에서 객체의 수직 위치 정보를 이용하여 깊이 지도를 생성한다. 실시간 처리와 하드웨어 복잡도를 개선하기 위해 영상 샘플링, 표준 휘도화를 이용한 객체 분할, 그리고 경계 스캔을 이용한 깊이지도 생성 등을 수행하였다. 동영상, 정지영상 모두 적용이 가능하며, 수직 위치 정보를 이용하므로 원거리 영상 혹은 풍경, 파노라마 사진과 같은 영상도 효과적인 입체 효과를 보여줄 수 있다. 제안된 알고리즘은 객체의 움직임 방향 혹은 속도 또는 장면 전환 등에 제약 없이 입체 효과가 가능하다. 제안 알고리즘 검증은 시각적인 방법과 APD(Absolute Parallax Difference)를 이용하여 MTD (Modified Time Difference)방식과의 비교를 수행하였다.

• Journal of Computational Design and Engineering
• /
• 제2권1호
• /
• pp.67-72
• /
• 2015

Recently, along with the improvements of geometry modeling methods using sketch-based interface, there have been a lot of developments in research about generating surface model from 3D curves. However, surfacing a 3D curve network remains an ambiguous problem due to the lack of geometric information. In this paper, we propose a new algorithm for estimating the normal vectors of the 3D curves which accord closely with user intent. Bending energy is defined by utilizing RMF(Rotation-Minimizing Frame) of 3D curve, and we estimated this minimal energy frame as the one that accords design intent. The proposed algorithm is demonstrated with surface model creation of various curve networks. The algorithm of estimating geometric information in 3D curves which is proposed in this paper can be utilized to extract new information in the sketch-based modeling process. Also, a new framework of 3D modeling can be expected through the fusion between curve network and surface creating algorithm.