• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.1031-1032
• /
• 2006

A 3D model based face recognition system is generally inefficient in computation time because 3D face model consists of a large number of vertices. In this paper, we propose a novel 3D face representation algorithm to reduce the number of vertices and optimize its computation time.

• Journal of electromagnetic engineering and science
• /
• v.1 no.1
• /
• pp.78-82
• /
• 2001

For fast capacitance computation, a simple mesh refinement technique on MLFMA(Multi-Level Fast Multipole Algorithm) is proposed The triangular meshes are refined mainly in the area which has heavy charge density. The technique is applied to the capacitance extraction of three dimensional conductors. The results show good convergence with comparable accuracy. An adaptive technique concerned with MLFMA is useful to reduce computation time and the number of elements without additional computational efforts in large three dimensional problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.7 no.10
• /
• pp.29-33
• /
• 1984

Many methods have been developed to get a good Computation steps. I think that almost methods of them have been solved by using a theory of [Vj]. But I have thought that it Can be solved by an other method. This method is a way to get a Computations steps by using [Aj] instead of [Vj]. It requires less Computation time than [Vj]. So I think that method is an efficient Algorithm about "the Development of Algorithm method for the 0 - 1 Knapsack problem."

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1918-1925
• /
• 1989

A method for computing the capacitance and inductance matrix for 2-D multiconductor transmission lines with arbitrary cross section in dielectric medium is presented. The integral equation is obtained by using a free space Green function in conjunction with free and bound charges existing on boundary surfaces. The numerical analysis is based on the moment method using point matching and Galerkin method. And kthe scheme to reduce memory and computation time is presented for symmetric structure.

• Journal of the Korean Ceramic Society
• /
• v.31 no.4
• /
• pp.420-426
• /
• 1994

A new method is proposed for the oxide lattice energy calculation. It is consisted of (1) setting a central and a computation domains in a real lattice, (2) calculation of inter-ionic potential producted by the associated portion of each ion to the relative domain, and (3) summing up the potential energies. Even with a slight expansion of the domain, the lattice energy converges to the published data. The method is superior than any other reported due to the simple and clear concept and the reduced computing.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.269-272
• /
• 2010

In this paper, we propose the computation reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational amount in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computation amount in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.715-717
• /
• 2008

The connectivity weighted Hough transform is a useful method for detecting well-connected short lines without generating false lines yet requires extensive computation. This letter describes a method that reduces the computation of the connectivity weighted Hough transform by removing unnecessary weight calculations using the gradient angles of feature points. In simulations with synthetic images and experiments with liquid crystal display panel images, the proposed method showed significantly improved speed without compromising detectability.

• Radiation Oncology Journal
• /
• v.3 no.1
• /
• pp.59-64
• /
• 1985

Computation of three dimensional dose distribution using CT image and RT plan was applied to a case of pituitary adenoma. Algorithm was based on two dimensional Tissue Maximun Ratio model extended to the third dimension. The resulting isodose curve of transeverse, coronal and sagittal section was demonstrated. This RT plan allows computation of dose distribution in any arbitarily defined plane in addition to conventional cross sectional view.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04a
• /
• pp.615-619
• /
• 1995

The unbalance response analysis is one of the essential area in the forced vibration analysis of rotor-bearing systems. Local bearing parameters in ortor-bearing systems are the major sources which give rise to a difficulty in unbalance response computation due to the complicated dynamic properties such as rotational speed dependency and anisotropy. In the present paper, an exact condensation procedure is introduced to easily take into account bearing parameters in computation of unbalance responses for rotor bearing systems. The present method is illustrated through a numerical example and compared with the conventional method.

• 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.