• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.29-36
• /
• 1999

It is shown that a new Krylov subspace method for solving symmetric indefinite systems of linear equations can be obtained. We call the method as the projection method in this paper. The residual vector of the projection method is maintained at each iteration, which may be useful in some applications.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.9
• /
• pp.935-944
• /
• 2006

EMG pattern recognition is essential for the control of a multifunction myoelectric hand. The main goal of this study is to develop an efficient feature projection method for EMC pattern recognition. To this end, we propose a linear supervised feature projection that utilizes linear discriminant analysis (LDA). We first perform wavelet packet transform (WPT) to extract the feature vector from four channel EMC signals. For dimensionality reduction and clustering of the WPT features, the LDA incorporates class information into the learning procedure, and finds a linear matrix to maximize the class separability for the projected features. Finally, the multilayer perceptron classifies the LDA-reduced features into nine hand motions. To evaluate the performance of LDA for the WPT features, we compare LDA with three other feature projection methods. From a visualization and quantitative comparison, we show that LDA has better performance for the class separability, and the LDA-projected features improve the classification accuracy with a short processing time. We implemented a real-time pattern recognition system for a multifunction myoelectric hand. In experiment, we show that the proposed method achieves 97.2% recognition accuracy, and that all processes, including the generation of control commands for myoelectric hand, are completed within 97 msec. These results confirm that our method is applicable to real-time EMG pattern recognition far myoelectric hand control.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.57-65
• /
• 2008

The approximate solvability of a generalized system for non-linear variational inequality in Hilbert spaces was studied, based on the convergence of projection methods. But little research was done in Banach space. The primary reason was that projection mapping lacked preferably property in Banach space. In this paper, we introduced the generalized projection methods. By using these methods, the results presented in this paper extended the main results of S. S. Chang [3] from Hilbert spaces to Banach space.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.2
• /
• pp.25-34
• /
• 1981

In this paper, we propose a non-edge following method for linear programs. Unlike alledged poor performance of algorithms of this type, this method performs well at least with 25 randomly generated problems. This method is comparable to Rosen's gradient projection method as applied to the dual formulation. The latter is of general purpose, and no implementation rules are available for linear program applications. This paper suggests ways of finding improving dual feasible directions, and of allowing to move across the extreme faces of a higher dimension polyhedron. Rather simple computational rules are provided for projection operations needed at each iteration.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.715-717
• /
• 2004

This paper proposes a new reconstruction method of high-resolution facial image from a low-resolution facial image based on a recursive error back-projection of top-down machine learning. A face is represented by a linear combination of prototypes of shape and texture. With the shape and texture information about the pixels in a given low-resolution facial image, we can estimate optimal coefficients for a linear combination of prototypes of shape and those of texture by solving least square minimization. Then high-resolution facial image can be obtained by using the optimal coefficients for linear combination of the high-resolution prototypes, In addition to, a recursive error back-projection is applied to improve the accuracy of synthesized high-resolution facial image. The encouraging results of the proposed method show that our method can be used to improve the performance of the face recognition by applying our method to reconstruct high-resolution facial images from low-resolution one captured at a distance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.191-198
• /
• 2001

As a method to compensate the deterioration of the picture quality which was caused by beam profile characteristic in the CRT and the projection screen of HD projection TV, a linear scan velocity modulation(SVM) method has been employed, whose modulation velocity is linearly proportional to the variation in the video signal amplitude. However, the effect of picture quality improvement is not uniform with video signal amplitude in the linear SVM. In this paper, for the optimum SVM effect, we analyze the beam profile characteristic on the HD projection screen and we analyze the SVM effect as function of the differentiated pulse width, the differentiated pulse amplitude and the input signal amplitude. Finally we confirm that the nonlinear SVM method is necessary to get uniform image compensation in the HD projection TV, and we implement the nonlinear SVM circuit. The performance of the realized SVM circuit with nonlinear amplitude transfer characteristic is confirmed as uniform improvements in picture quality.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.8
• /
• pp.1468-1484
• /
• 1992

In the present paper forward projection is proposed as a new approach to determine the preform shape in rib-web type forging. In the forward projection technique an optimal billet is determined by applying some mathematical relationship between geometrical trials in the initial billet shape and the final products. In forward projection a volume difference between the desired product shape and the final computed shape obtained by the rigid-plastic finite element method is used as a measure of incomplete filling of working material in the die. At first linear inter-/extrapolation is employed to find a proper trial shape for the initial billet and the method is successfully applied to some cases of different aspect ratios of the initial billet. However, when the initial guesses are not sufficiently near the optimal value linear inter-/extrapolation does not render complete die filling. For more general application, a fuzzy system is used in the forward projection technique in order to determine the initial billet shape for rib-web type forging. It has been thus shown that the fuzzy system is more reliable for the preform design in the rib-web type forging process.

• Journal of the Korean Chemical Society
• /
• v.21 no.5
• /
• pp.362-371
• /
• 1977

In this paper application of the projection operator technique to the study of NMR absorption line shape and free induction decay curve is explored. It is found that the projection operator technique can provide a convenient means for deriving a set of hierarchy equations which may serve as a good starting point for theoretical calculation of the absorption line and free induction decay function by successive approximation or by an appropriate decoupling approximation. A brief review of linear response theory of NMR line shape and the relation between the absorption line shape and free induction decay function are also described.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.617-635
• /
• 2021

Let X be a smooth hypersurface X of degree d ≥ 4 in a projective space ℙⁿ⁺¹. We consider a projection of X from p ∈ ℙⁿ⁺¹ to a plane H ≅ ℙⁿ. This projection induces an extension of function fields ℂ(X)/ℂ(ℙⁿ). The point p is called a Galois point if the extension is Galois. In this paper, we will give necessary and sufficient conditions for X to have Galois points by using linear automorphisms.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.823-832
• /
• 2013

We present a new algorithm for solving a system of nonlinear equations with convex constraints which combines proximal point and projection methodologies. Compared with the existing projection methods for solving the problem, we use a different system of linear equations to obtain the proximal point; and moreover, at the step of getting next iterate, our projection way and projection region are also different. Based on the Armijo-type line search procedure, a new hyperplane is introduced. Using the separate property of hyperplane, the new algorithm is proved to be globally convergent under much weaker assumptions than monotone or more generally pseudomonotone. We study the convergence rate of the iterative sequence under very mild error bound conditions.