• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• 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
• /
• v.31 no.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%.

• Journal of Korean Society for Quality Management
• /
• v.44 no.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
• /
• v.7 no.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
• /
• v.35 no.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.

• Journal of the Korea Safety Management & Science
• /
• v.23 no.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
• /
• v.15 no.1
• /
• pp.1-11
• /
• 2008

For a large data set the high computational cost of estimating the parameters of normal mixtures with the conventional EM algorithm is crucially impedimental in applying the algorithm to the areas requiring high speed computation such as real-time speech recognition. Simulations show that the binned EM algorithm, being compared to the standard one, significantly reduces the cost of computation without loss in accuracy of the final estimates.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.1025-1030
• /
• 2004

In multimedia database systems, the k nearest neighbor query occurs frerluently and requires the processing cost higher than other spatial queries do. The numberof searched nodes and the computation time in an index can be minimized for optimizing the cost of processing the k nearest neighbor query. In this paper, we propose the search distance which can reduce the computation time of the optimal search distance.

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

With respect to the exponential increment of web documents on the internet, it is important how to improve performance of clustering method for web documents. Web document clustering techniques can offer accurate information and fast information retrieval by clustering web documents through semantic relationship. The clustering method based on mesh-graph provides high recall by calculating similarity for documents, but it requires high computation cost. This paper proposes a clustering method using hyperlinks which is structural feature of web documents in order to keep effectiveness and reduce computation cost.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.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.