• Composites Research
• /
• v.24 no.6
• /
• pp.31-36
• /
• 2011

According to the evaluation on GMT-sheet by molding conditions, fiber projection on the moldings surface was investigated. Fiber projection is one of the major defects on moldings surface due to matrix shrinkage. That is, fiber projection happens from different shrinkage of matrix and glass fiber. Height of fiber projection from moldings surface becomes smaller when molding pressure is higher during holding pressure and cooling process. Height of fiber projection is dominantly affected by molding pressure. With consideration of molding pressure, the formation of surface unevenness and change in fiber projection height was elucidated. In addition, coating layer is effective to suppress surface defects, and there is no fiber projection or crack in case that coating is applied. Coating layer improves surface roughness up to the level of the polypropylene which is a single material.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.82-91
• /
• 2005

This paper introduces an efficient affine projection algorithm(APA) using iterative hyperplane projection. Among various fast converging adaptation algorithms, APA has been preferred to be employed for various applications due to its inherent effectiveness against the rank deficient problem. However, the amount of complexity of the conventional APA could not be negligible because of the accomplishment of sample matrix inversion(SMI). Moreover, the 'shifting invariance property' usually exploited in single channel case does not hold for the application of space-time decision-directed equalizer(STDE) deployed in single-input-multi-output(SIMO) systems. Thus, it is impossible to utilize the fast adaptation schemes such as fast transversal filter(FlF) having low-complexity. To accomplish such tasks, this paper introduces the low-complexity APA by employing hyperplane projection algorithm, which shows the excellent tracking capability as well as the fast convergence. In order to confirm th validity of the proposed method, its performance is evaluated under wireless SIMO channel in respect to bit error rate(BER) behavior and computational complexity.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.737-741
• /
• 2009

This paper addresses the factorization method to estimate the projective structure of a scene from feature (points) correspondences over images with occlusions. We propose both a column and a row space approaches to estimate the depth parameter using the subspace constraints. The projective depth parameters are estimated by maximizing projection onto the subspace based either on the Joint Projection matrix (JPM) or on the the Joint Structure matrix (JSM). We perform the maximization over significant observation and employ Tardif's Camera Basis Constraints (CBC) method for the matrix factorization, thus the missing data problem can be overcome. The depth estimation and the matrix factorization alternate until convergence is reached. Result of Experiments on both real and synthetic image sequences has confirmed the effectiveness of our proposed method.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.1
• /
• pp.154-161
• /
• 1997

This paper presents the method to eliminate the constraint reaction in the Lagrange multiplier form equation of motion by using a generalized coordinate driveder from the velocity constraint equation. This method introduces a matrix method by considering the m dimensional space spanned by the rows of the constraint jacobian matrix. The orthogonal vectors defining the constraint manifold are projected to null vectors by the tangential vectors defined on the constraint manifold. Therefore the orthogonal projection matrix is defined by the tangential vectors. For correcting the generalized position coordinate, the optimization problem is formulated. And this correction process is analyzed by the quasi Newton method. Finally this method is verified through 3 dimensional vehicle model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1785-1794
• /
• 1999

The affine projection algorithm has known t require less computational complexity than RLS but have much faster convergence than NLMS for speech-like input signals. But the affine projection algorithm is still much more computationally demanding than the LMS algorithm because it requires the matrix inversion. In this paper, we show that the affine projection algorithm can be realized with the Gram-Schmidt orthogonalizaion of input vectors. Using the derived relation, we propose an approximate but much more efficient implementation of the affine projection algorithm. Simulation results show that the proposed algorithm has the convergence speed that is comparable to the affine projection algorithm with only a slight extra calculation complexity beyond that of NLMS.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.1
• /
• pp.89-97
• /
• 2011

We analyze the performance of various techniques to overcome degradation of performance of STAP caused by nonhomogeneous clutter. The performance of NHD that used to eliminate outliers from nonhomogeneous clutter is improved by using the projection statistics(PS) that is robust to multiple outliers. The method of clutter covariance matrix estimation using a median value and the conventional method are also investigated and then compared. From the simulation results of STAP, the method of clutter covariance matrix estimation using a median value shows better performance than the conventional method for the calculation of the SINR loss, and MSMI for the single target and the multiple targets regardless of the NHD methods.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.11 no.1
• /
• pp.82-87
• /
• 2012

For different ferrite-pearlite matrix structure, contain more than 90% spheroidal ratio of graphite, GCD 45-3, GCD 50, GCD 60 series and 70%, 80%, 90% spheroidal ratio of graphite, GCD 40, GCD 45-1, GCD 45-2 series, this paper has carried out rotary bending fatigue test, estimated maximum and mean size of spheroidal graphite, investigated correlation. It was concluded as follows. (1) Fatigue limit in $10^7$cycles and numbers of spheroidal graphite per 1$mm^2$ was linear relation. (2) projection area of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of projection area of defects may be used as a guideline for the control of inclusion size in the steelmaking processes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.3
• /
• pp.238-243
• /
• 2010

A new implementation method for MPDSAP(Maximally Polyphase Decomposed Subband Affine Projection) adaptive filter is proposed. The affine projection(AP) adaptive filter achieves fast convergence speed, however, its implementation is so expensive because of the matrix inversion for a weight-updating of adaptive filter. The maximally polyphase decomposed subband filtering allows the AP adaptive filter to avoid the matrix inversion, moreover, by using a pipelining technique, the simple subband structured AP is suitable for VLSI implementations concerning throughput, power dissipation and area. Computer simulations are presented to verify the performance of the proposed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1785-1791
• /
• 2003

This paper presents the mosaic method that the video sequence with shift and rotation information after Mellin Transform. The results are used to compute the projection matrix for each image registration. So before registration, we process camera calibration in order to reduce the image warp by camera and then compute the global projection matrix for image registration for reducing errors from rut image to last image. This paper describes the mosaic method that compute duplication and movement information quickly and robust noise using projection matrix on Mellin Transform.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1E
• /
• pp.25-29
• /
• 2008

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimatesthe signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. In this paper, we propose a new algorithm to improve the subspace estimation accuracy using a normally ordered input vector and a reversely ordered input vector simultaneously.