• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.286-289
• /
• 2009

This paper presents an effective approach to minimize recursive computations for balancing stereo pairs by using disparity vector errors and its directional histogram. A stereo balancing function is computed from the correspondent pixels between two images, and a simple approach is to find the matching blocks of two images. However, this procedure requires recursive operation, and its computation cost is very high. Therefore, in this paper, we propose an efficient balance method using structural similarity index and a partial re-searching scheme to reduce the computation cost considerably. For this purpose, we determine if re-searching for each block is necessary or not by using the errors and the directional histogram of disparity vectors. Experiment results show that the performance of the proposed approach can save the computations significantly with ignorable image quality degradation compared with full re-search approach.

• ETRI Journal
• /
• 제31권2호
• /
• pp.129-139
• /
• 2009

This paper provides an efficient algorithm for computing the ${\eta}_T$ pairing on supersingular elliptic curves over fields of characteristic two. In the proposed algorithm, we deploy a modified multiplication in $F_{2^{4n}}$ using the Vandermonde matrix. For F, G ${\in}$ $F_{2^{4n}}$ the proposed multiplication method computes ${\beta}{\cdot}F{\cdot}G$ instead of $F{\cdot}G$ with some ${\beta}$ ${\in}$ $F^*_{2n}$ because ${\beta}$ is eliminated by the final exponentiation of the ${\eta}_T$ pairing computation. The proposed multiplication method asymptotically requires only 7 multiplications in $F_{2^n}$ as n ${\rightarrow}$ ${\infty}$, while the cost of the previously fastest Karatsuba method is 9 multiplications in $F_{2^n}$. Consequently, the cost of the ${\eta}_T$ pairing computation is reduced by 14.3%.

• 품질경영학회지
• /
• 제44권4호
• /
• pp.713-733
• /
• 2016

Purpose: The primary objective of this case study is to establish a COQ(Cost of Quality) management system for power generation industries. Key topics of this study include collecting COQ elements, their classifications, COQ computation formula, and determining COQ improvement projects. Results: A comprehensive set of COQ elements have been isolated for electric power generation companies. The COQ elements were classified in such a way that they could be managed according to the PAF model as well as the SIPOC diagram. This study showed that a systematic approach could be established for monitoring the COQ elements and using them in the process of improving quality competitiveness. Methods: The PAF(Prevention-Appraisal-Failure) model has been employed in the process of collecting COQ elements for a power generation company. All the cost of quality elements were first examined through an extensive review of articles and books in the field of quality. The cost elements were then refined and augmented by conducting a comparative study with international standards. The COQ elements have been verified by a group of quality managers and classified according to both the PAF model and the SIPOC diagram for better understanding in the entire organization. An improvement strategy has been also proposed by using a typical COQ level of power generation companies. Conclusion: The conventional PAF model was used in establishing a COQ management system for power generation industries. This case study illustrates the procedure about identification, classification and computation of quality costs, including selection of improvement projects. The system can be used not only for observing the current state of cost elements related to quality, but also for planning an improvement strategy using the ratio of cost classification.

• Journal of information and communication convergence engineering
• /
• 제7권1호
• /
• pp.19-23
• /
• 2009

In this paper, we propose a general idea about an RFID system which provides lighted weight algorithm. We discuss how RFID could be applied for this kind of system, especially, compact protocol. We evaluate a few protocols that have been suggested for use in passive RFID tagged systems. We can reduce security computation without losing security features by message integration and pre-computation in this paper. And the proposed protocol can be used in low-cost RFID systems that require a small computational load for both the back-end database and the tags.

• East Asian mathematical journal
• /
• 제35권5호
• /
• pp.597-612
• /
• 2019

In this study, we propose a new logarithmic barrier approach to solve linear programming problem using the projective method of Karmarkar. We are interested in computation of the direction by Newton's method and of the step-size using minorant functions instead of line search methods in order to reduce the computation cost. Our new approach is even more beneficial than classical line search methods. We reinforce our purpose by many interesting numerical simulations proved the effectiveness of the algorithm developed in this work.

• 대한안전경영과학회지
• /
• 제23권1호
• /
• pp.65-70
• /
• 2021

Domestic as well as global automobile manufacturers are making greater efforts in cost reduction to strengthen the competitiveness. In this study, we developed a program to effectively manage standard time of automobile assembly line, and confirm based on A-automobile factory data. For the purpose, we develop the system which is possible to manage standard time as well as calculate man-hour for automobile assembly line.

• Communications for Statistical Applications and Methods
• /
• 제15권1호
• /
• pp.1-11
• /
• 2008

혼합정규분포로부터 얻은 자료의 크기가 크면 EM 알고리즘으로 모수를 추정하는 경우 추정에 많은 시간이 걸리며 이는 실시간 음성인식 분야등에서는 적용이 어렵게 되는 문제가 발생한다. 대용량 자료를 구간도수로 요약하여 구간도수 EM 알고리즘을 적용하면 표준 EM 알고리즘에 비해 실행속도가 획기적으로 개선되며 더욱이 구간도수 EM 알고리즘에서의 추정치의 효율성이 표준 EM 알고리즘에 근접함을 시뮬레이션 실험을 통하여 보였다.

• 한국컴퓨터산업학회논문지
• /
• 제5권9호
• /
• pp.1025-1030
• /
• 2004

멀티미디어 데이타베이스 시스템에서 k-최대근접질의는 매우 빈번히 발생하며, 다른유형의 공간질의에 비하여 처리비용이 많이 요구된다. K-최대근접질의의 처리비용을 최적화하기 위해서는 색인에서 검색되는 노드의 수와 연산시간을 최소화할 수 있어야한다. 본 논문에서는 최적검색거리[1]의 연산시간을 줄일 수 있는 새로운 검색거리를 제안하고 그 특성을 보인다.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.590-595
• /
• 2009

인터넷 상의 웹 문서의 수가 기하급수적으로 늘어남에 따라서, 정보검색에서의 웹 문서 클러스터링은 성능과 속도가 매우 중요하게 되었다. 웹 문서 클러스터링은 의미적으로 관계가 있는 웹 문서들을 같은 클러스터로 군집함으로써 정보 검색을 보다 빠르고, 정보를 정확하게 제공할 수 있다. 그물망 그래프 형태의 클러스터링은 모든 문서간의 유사도를 측정함으로써 재현율을 높일 수 있지만, 높은 계산 비용을 갖는다. 본 논문에서는 그물망 형태의 클러스터링의 재현율과 정확율을 유지하며 계산 비용을 줄이기 위하여, 웹 문서의 구조적 특징인 하이퍼링크(Hyperlinks)를 이용한 클러스터링 방법을 제안한다.

• 대한전기학회논문지
• /
• 제40권9호
• /
• pp.937-944
• /
• 1991

In digital controller design, the delays in the controller should be taken into consideration when the computation time of the processor is not negligibale compared with sampling time. Recently, Mita has proposed a digital optimal servosystem taking account of the delays in the controller. In this paper, robust stability and diturbance rejection properties of this optimal servosystej are analyzed in the frequency-domain. The well-known asymptotic properties of the optimal regulators with respect to the weighting matrices of the cost functions are successfully utilized to show that the influence of the delays in the controller are drastic for certain choice of the cost function Illustrative numerical examples are presented.