• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.101-102
• /
• 2008

얼굴인식 분야에서 PCA(Principal Component Analysis) 기반 알고리즘은 비교적 간단한 구조와 높은 인식률로 인해 많이 사용되고 있지만 조명이나 얼굴 포즈 변화에 민감하다는 단점이 있다[1]. 이런 단점을 해결하기 위한 노력으로 PCA를 다른 얼굴인식 알고리즘과 결합함으로서 조명과 포즈 변화에 강인한 얼굴인식을 위만 연구가 현재 활발히 진행되고 있다. 본 논문은 PCA기반 얼굴인식에서 조명이 다양하게 변할 때 이에 따른 인식률의 변화와, 인식이 실패했을 경우에 인식 대상이 유사도 상위후보군에 들어가는지를 조사함으로서 PCA기반 알고리즘의 신뢰도를 확인하고자 한다. 이를 위해 Yale Face Database H와 Extended Yale Face Database B를 이용하여 실험한 결과 약 93%의 인식 성공률을 확인했으며, 7%의 인식 실패한 영상의 경우 그 인식하고자 했던 얼굴이 유사도를 기준으로 정렬된 학습 영상에서 상위 후보군에 속한다는 실험 결과를 얻음으로서 PCA기반 얼굴 인식 알고리즘의 신뢰성을 확인할 수 있었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.9-11
• /
• 2014

본 논문에서는 오디오 신호의 특성 표현에 유용한 nonnegative matrix factorization(NMF)에 대해 설명하였으며, expectation maximization (EM)을 이용한 NMF 파라미터 추출 및 EM-NMF 기반한 오디오 소스 분리 기술에 대해서 설명했다. 또한, 다중 단계 NMF-EM 구조의 객체 분리를 통해서 객체 분리 성능을 향상시키기 위한 알고리즘을 제안하며, 제안된 알고리즘은 K-pop 음원과 SDR(source distortion ratio)를 통해서 객체 분리 성능을 평가한다. 성능 평가 결과 제안된 알고리즘은 다중 단계를 통해 약 3dB 의 보컬 분리 성능이 향상되며, 상업적 음원 제작에서 사용되는 가상 오디오 효과가 많이 적용된 음원에서 약 5dB 의 분리 성능을 향상시켰다. 그러므로 제안된 방식은 오디오 객체 분리에 유용한 방법이 될 것으로 생각된다.

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.271-282
• /
• 1999

In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

• Journal of the Korean Society for information Management
• /
• v.18 no.3
• /
• pp.29-40
• /
• 2001

In this paper, we suggest a query optimization algorithm to select the optimal processing method of an extended boolean query on inverted files. There can be a lot of methods for processing an extended boolean query according to the processing sequence oh the keywords con tamed in the query, In this sense, the problem of optimizing an extended boolean query it essentially that of optimizing the keyword sequence in the query. In this paper, we show that the problem is basically analogous to the problem of finding the optimal join order in database query optimization, and apply the ideas in the area to the problem solving. We establish the cost model for processing an extended boolean query and develop an algorithm to filled the optimal keyword-processing sequence based on the concept of keyword rank using the keyword selectivity and the access costs of inverted file. We prove that the method selected by the optimization algorithm is really optimum, and show, through experiments, that the optimal method is superior to the others in performance We believe that the suggested optimization algorithm will contribute to the significant enhancement of the information retrieval performance.

• Journal of Korean Society of Steel Construction
• /
• v.22 no.1
• /
• pp.33-42
• /
• 2010

Patterning with a geodesic line is essential for economical or efficient usage of membrane materialsin fabric tension membrane structural engineering and analysis. The numerical algorithm to determine the geodesic line for membrane structures is generally classified into two. The first algorithm finds a non-linear shape using a fictitious geodesic element with an initial pre-stress, and the other algorithm is the geodesic line cutting or searching algorithm for arbitrarily curved 3D surface shapes. These two algorithms are still being used only for the three-node plane stress membrane element, and not for the four-node element. The lack of a numerical algorithm for geodesic lines with four-node membrane elements is the main reason for the infrequent use of the four-node membrane element in membrane structural engineering and design. In this paper, a modified numerical algorithm is proposed for the generation of a geodesic line that can be applied to three- or four-node elements at the same time. The explicit non-linear static Dynamic Relaxation Method (DRM) was applied to the non-linear geodesic shape-finding analysis by introducing the fictitiously tensioned 'strings' along the desired seams with the three- or four-node membrane element. The proposed algorithm was used for the numerical example for the non-linear geodesic shape-finding and patterning analysis to demonstrate the accuracy and efficiency, and thus, the potential, of the algorithm. The proposed geodesic shape-finding algorithm may improve the applicability of the four-node membrane element for membrane structural engineering and design analysis simultaneously in terms of the shape-finding analysis, the stress analysis, and the patterning analysis.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.279-284
• /
• 2003

In this paper, we propose an efficient architecture for radix-4 modular multiplication in systolic array structure based on the Montgomery's algorithm. We propose a radix-4 modular multiplication algorithm to reduce the number of iterations, so that it takes (3/2)n+2 clock cycles to complete an n-bit modular multiplication. Since we can interleave two consecutive modular multiplications for 100% hardware utilization and can start the next multiplication at the earliest possible moment, it takes about only n/2 clock cycles to complete one modular multiplication in the average. The proposed architecture is quite regular and scalable due to the systolic array structure so that it fits in a VLSI implementation. Compared to conventional approaches, the proposed architecture shows shorter period to complete a modular multiplication while requiring relatively less hardware resources.

• Journal of Korean Society of Steel Construction
• /
• v.19 no.1
• /
• pp.29-41
• /
• 2007

Structural design, like other complex decision problems, involves many trade-offs among competing criteria. Although mathematical programming models are becoming increasingly realistic, they often have design limitations, that is, there are often relevant issues that cannot be easily captured. From the understanding of these limitations, a decision-support system is developed that can generate some useful alternatives as well as a single optimum value in the optimization of steel frame structures. The alternatives produced using this system are "good" with respect to modeled objectives, and yet are "different," and are often better, with respect to interesting objectives not present in the model. In this study, we created a decision-support system for designing the most cost-effective moment-resisting steel frame structures for resisting lateral loads without compromising overall stability. The proposed approach considers the cost of steel products and the cost of connections within the design process. This system makes use of an optimization formulation, which was modified to generate alternatives of optimum value, which is the result of the trade-off between the number of moment connections and total cost. This trade-off was achieved by reducing the number of moment connections and rearranging them, using the combination of analysis based on the LRFD code and optimization scheme based on genetic algorithms. To evaluate the usefulness of this system, the alternatives were examined with respect to various design aspects.

• Journal of the Society of Naval Architects of Korea
• /
• v.32 no.4
• /
• pp.105-113
• /
• 1995

A mechanical actuator to generate adjustable force ants its active control algorithm to minimize ship structural vibration are developed. The algorithms comprise initial algorithm which determines optimal phase and force magnitude of the actuator using the variation of vibration response according to the phase difference between the main engine and the actuator, and regulating algorithm which performs continuous optimal control to track the change of the engine speed. This control system can be applied without any prior identification for the dynamic characteristics of the controlled structure. In the control experiments for the deckhouse structural vibration of a 300,000 DWT crude oil carrier and a 2,270 TEU container carrier, the developed system showed good performance to reduce the vibration levels to $1/2{\sim}1/6$ of the uncontrolled levels.

• Annual Conference on Human and Language Technology
• /
• 2014.10a
• /
• pp.81-86
• /
• 2014

한국어 의존 파싱은 문장 내 단어의 지배소를 찾음으로써 문장의 구조적 중의성을 해소하는 작업이다. 지배소 후위 원칙은 단어의 지배소는 자기 자신보다 뒤에 위치한다는 원리로, 한국어 구문분석을 위하여 널리 사용되는 원리이다. 본 연구에서는 한국어 지배소 후위 원리를 의존 파싱을 위한 트랜지션 시스템의 제약 조건으로 적용하여 2가지 트랜지션 시스템을 제안한다. 제안 모델은 기존 트랜지션 시스템 중 널리 사용되는 arc-standard와 arc-eager 알고리즘에 지배소 후위 제약을 적용한 포워드(forward) 기반 트랜지션 시스템과, 트랜지션 시스템의 단점인 에러 전파(error propagation)를 완화시키기 위하여 arc-eager 알고리즘의 lazy-reduce 방식을 적용한 백워드(backward) 기반 트랜지션 시스템이다. 실험은 세종 구구조 말뭉치를 의존구조로 변환하여 실험하였고, 실험 결과 백워드 기반 트랜지션 시스템이 포워드 방식보다 우수한 성능을 보였다. 기존 연구와의 비교를 위하여 기존 연구를 조사하였지만 세부 실험 환경이 서로 달라서 직접적인 비교는 어려웠다. 제안하는 시스템의 최고 성능은 UAS 92.85%, LAS 90.82% 이다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.3 no.2
• /
• pp.31-44
• /
• 1983

This paper applies an optimization algorithm for the elastic truss structures. The acceleration technique utilized in this study is the geometric programming method developed by the Operation Research or the applied methematics. The applicability and the efficiency of the algorithm applied in this study are tested for four different trusses. Test results show that the optimum solutions are obtained after only one or seven iterations which is very small compared with other techniques and no oscillation is needed for the convergency. Test rusults also show that the Geometric Programming Method is also effective algorithm for the convergency of the Optimum Solution in case of only being compared with the number of iteration.