• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.375-388
• /
• 2004

For solving symmetric systems of linear equations, it is shown that a new Krylov subspace method can be obtained. The new approach is one of the projection methods, and we call it the projection method for convenience in this paper. The projection method maintains the residual vector like simpler GMRES, symmetric QMR, SYMMLQ, and MINRES. By studying the quasiminimal residual method, we show that an extended projection method and the scaled symmetric QMR method are equivalent.

• Communications for Statistical Applications and Methods
• /
• v.26 no.4
• /
• pp.337-346
• /
• 2019

This paper discusses a method for obtaining nonnegative estimates for variance components in a random effects model. A variance component should be positive by definition. Nevertheless, estimates of variance components are sometimes given as negative values, which is not desirable. The proposed method is based on two basic ideas. One is the identification of the orthogonal vector subspaces according to factors and the other is to ascertain the projection in each orthogonal vector subspace. Hence, an observation vector can be denoted by the sum of projections. The method suggested here always produces nonnegative estimates using projections. Hartley's synthesis is used for the calculation of expected values of quadratic forms. It also discusses how to set up a residual model for each projection.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.224-231
• /
• 2009

Unsharp masking is a popular image enhancement technique used to sharpen an image appearance in gray images. However, the conventional unsharp making techniques amplify the noise and easily cause overshoot artifacts. Moreover, the unsharp masking tends to introduce color distortion when it is applied to the each color component independently. To solve these problems, we propose a novel unsharp masking technique based on human visual system and vector projection. The proposed algorithm consists of two steps. First, the proposed algorithm controls the level of sharpening by exploiting the characteristics of the human visual system and contrast region. Then the vector projection is applied to remove the color distortion. Experiment results show that our proposed algorithm successfully produces sharpened images that are free of noise and color distortion commonly found in the conventional unsharp masking algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2533-2540
• /
• 2009

Performance of processing protocols is one most important goal in a network or systems constituting the network. Measurement of performance, thus, is an essential element to not only establish the network but also develop systems. A projection in vector mathematics is the transformation of points and lines in one plane onto another plane by connecting corresponding points on the two planes with parallel lines. This is a method, as an application of vector mathematics, which is widely used in engineering as well to consider elements dedicated to the measurement object. This paper proposes a sound methodology for measuring the performance of the SIP protocol, which is based on the projection. The SIP protocol is a typical standard protocol for call-processing in the internet telephony of Next Generation Convergence Network. Owing to use the projected protocol which excludes unnecessary operation paths, the methodology can be effective in implementation and resource utilization. This paper also presents a process based on the proposed methodology to measure the performance of a SIP proxy server.

• The Korean Journal of Applied Statistics
• /
• v.25 no.2
• /
• pp.239-249
• /
• 2012

We estimate nonlinear impulse responses of stock indices by asset class by the Local Projection method as suggested by Jorda (2005) to compute impulse responses. The method estimates impulse responses without the specification and estimation of the underlying multivariate dynamic system unlike the usual way of vector autoregression(VAR). It estimates Local Projections at each period of interest rather than extrapolating into increasingly distant horizons with the advantages of easy estimation and non-linear flexible specification. The Local Projection method adequately captures the nonlinearity and asymmetry of the impulse responses of the stock indices compared to those from VARs.

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

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.10a
• /
• pp.76-78
• /
• 1986

In this paper a fst block matching algorithm using integral projection is peoposed to fing the motion vector. In this case we can reduce the computation time greatly. Especially when we apply the integral projection to the OTS method, the averagr ratio of the computational savings is about 4.

• Korean Journal of Computational Design and Engineering
• /
• v.18 no.1
• /
• pp.49-57
• /
• 2013

In this paper, orthogonal projection of a point onto a 2D planar curve is discussed. The problem is formulated as finding a point on a curve where the tangent of the curve is perpendicular to the vector connecting the point on the curve and a point in the space. Existing methods are compared and novel approaches to solve the problem are presented. The proposed methods are tested with examples.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.187-190
• /
• 2001

The application of one-dimensional projection to each image enables to obtain shape or spatial information of image. This paper proposes a method that uses relative distances between peaks and their maximum value in the projection vector. In order to verify retrieval performance, the experimental results between the histogram intersection method, the projection only method. and the proposed one are compared and analyzed.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.80-87
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on wavelet transform domain of image signal. Wavelet decomposed image is encoded by the result of projection along one direction out of eight which approximates the coefficients most closely to the originally transformed coefficients. These projectrion data are vector quantized using separate codebooks depending on the decomposition level and orientation of decomposed of image. Experimental results reveals that proposed scheme shows excellent performance in PSNR manner and also shows good subjective quality.