• Structural Engineering and Mechanics
• /
• 제2권2호
• /
• pp.125-139
• /
• 1994

A vector algorithm for calculating the stiffness matrices of reinforced concrete shell elements is presented. The algorithm is based on establishing vector lengths equal to the number of elements. The computational efficiency of the proposed algorithm is assessed on a Cray Y-MP supercomputer. It is shown that the vector algorithm achieves scalar-to-vector speedup of 1.7 to 7.6 on three moderate sized inelastic problems.

• 한국공간구조학회논문집
• /
• 제8권3호
• /
• pp.75-82
• /
• 2008

본 연구에서는 방향벡터(direction vector)를 이용한 지역 탐색법과 유전자 알고리즘을 결합한 새로운 알고리즘인 D-GA를 제안한다. 새로운 개체(individual)를 찾기 위한 방향벡터로는 진화과정 중에 습득되는 정보를 활용하기 위한 학습방향벡터(Loaming direction vector)와 진화와는 무관하게 한 개체의 주변을 탐색하는 랜덤방향벡터(random direction vector) 등 두 가지를 구성하였다. 그리고, 10 부재 트러스 설계 문제에 단순 유전자 알고리즘과 D-GA를 적용하여 최적화를 수행하였고, 그 결과를 비교 검토함으로써 단순 GA에 비하여 D-GA의 정확성 및 효율성이 향상되었음을 확인하였다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1994년도 가을 학술발표회 논문집
• /
• pp.25-30
• /
• 1994

A vector algorithm for calculating the stiffness matrices of reinforced concrete shell elements is presented. The algorithm is based on establishing vector lengths equal to the number of elements. The computational efficiency of the proposed algorithm is assessed on a Cray Y-MP supercomputer. It is shown that the vector algorithm achieves scalar-to-vector speedup of 1.7 to 7.6 on three inelastic problems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.68-74
• /
• 1998

Block-based interframe interpolation algorithms cause severe block effect because the algorithm interpolates the skipped frame by using block based motion vector. Therefore, in this paper, we propose an algorithm that reduces the block effect in the interpolated frames. First, we propose an algorithm that obtains backward motion vector by using forward motion vector received from the transmitter. In order to predict well covered and uncovered region, backward motion vector is needed as well as forward motion vector. Second, we propose the algorithm which segments the motion boundary blocks into regions and obtains the motion vector of each region from candidates that consist of the motion vectors of neighbor blocks. This algorithm makes it possible that the moving object and the background, in spite of being in the same block, have different motion vectors from each other so that the block effect can be reduced. According to the results of simulation, the proposed algorithm is superior to conventional algorithm in subjective quality a swell as in objective quality.

• The Journal of the Acoustical Society of Korea
• /
• 제17권3E호
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1995년도 학술대회
• /
• pp.87-90
• /
• 1995

In this paper, we propose a new deinterlacing algorithm based on weighted wide vector correlations. This algorithm is developed mainly for the format conversion problem encountered in current HDTV system, but not limited to. By having wide vector correlations, visually annoying artifacts caused by interlacing, such as a serrate line, line crawling, a line flicker, and a large area flicker, can be remarkably reduced, since the use of wide vector correlation increases the detectability of edges in various orientations.

• 한국컴퓨터정보학회논문지
• /
• 제11권6호
• /
• pp.79-86
• /
• 2006

영상 식별 기술은 대용량의 멀티미디어 데이터베이스 환경 하에서 고속의 검색을 위해서 필수적이다. 본 논문은 이러한 고속 검색을 위하여 GA(Genetic Algorithm)과 SVM(Support Vector Machine)을 결합한 모델을 제안한다. 특징벡터로는 색상 정보와 질감 정보를 사용하였다. 이렇게 추출된 특징벡터의 집합을 제안한 모델을 통해 최적의 유효 특징벡터의 집합를 찾아 영상을 식별하여 정확도를 높였다. 성능평가는 색상, 질감. 색상과 질감의 연합 특징벡터를 각각 사용한 성능 비교. SYM과 제안된 알고리즘과의 성능을 비교하였다. 실험 결과 색상과 질감을 연합한 특징벡터를 사용한 것이 단일 특징벡터를 사용한 것 보다 좋은 결과를 보였으며 하이브리드 기법을 이용한 제안된 알고리즘이 SVM알고리즘만을 이용한 것 보다 좋은 결과를 보였다.

• 한국멀티미디어학회논문지
• /
• 제20권8호
• /
• pp.1312-1320
• /
• 2017

Recently, vector map data is developed and used in many domains widely. In the most cases, vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the production process of vector maps is considerably complex and consumes a lot of money and human resources. Therefore, the secured storage and transmission are necessary to prevent the illegal copying and distribution from hacker. This paper presents a selective encryption algorithm using geometric objects in frequency domain for vector map data. In the proposed algorithm, polyline and polygon data in vector map is the target of the selective encryption process. Experimental results verified that proposed algorithm is effectively and adaptive the requirements of security.

• 정보처리학회논문지B
• /
• 제8B권5호
• /
• pp.477-484
• /
• 2001

본 논문에서는 회귀용 support vector machine의 성능 개선을 위한 모멘텀과 kernel-adatron 기법이 조합형 학습알고리즘을 제안하였다. 제안된 학습알고리즘은 supper vector machine의 학습기법인 기술기상승법에 발생하는 최적해로의 수렴에 따란 발진을 억제하여 그수렴속도를 좀 더 개선시키는 모멘텀의 장점과 비선형 특징공간에서의 동작과 구현의 용이성을 갖는 kernel-adatorn 알고리즘의 장점을 그대로 살린 것이다. 제안된 알고리즘의 support vector machine을 1차원과 2차원 비선형 함수 회귀에 적용하여 시뮬레이션한 결과, 학습속도에 있어서 2차 프로그래밍과 기존의 kernel-adaton 알고리즘보다 더 우수하고, 회귀성능면에서도 우수한 성능이 있음을 확인하였다.