• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.116-127
• /
• 2014

This paper aims to review methods for computing orthogonal projection of points onto curves and surfaces, which are given in implicit or parametric form or as point clouds. Special emphasis is place on orthogonal projection onto conics along with reviews on orthogonal projection of points onto curves and surfaces in implicit and parametric form. Except for conics, computation methods are classified into two groups based on the core approaches: iterative and subdivision based. An extension of orthogonal projection of points to orthogonal projection of curves onto surfaces is briefly explored. Next, the discussion continues toward orthogonal projection of points onto point clouds, which spawns a different branch of algorithms in the context of orthogonal projection. The paper concludes with comments on guidance for an appropriate choice of methods for various applications.

• Journal of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.471-506
• /
• 2018

In this article, some projection methods (or fractional-step methods) are proposed and analyzed for the micropolar Navier-Stokes equations (MNSE). These methods allow us to decouple the MNSE system into two sub-problems at each timestep, one is the linear and angular velocities system, the other is the pressure system. Both first-order and second-order projection methods are considered. For the classical first-order projection scheme, the stability and error estimates for the linear and angular velocities and the pressure are established rigorously. In addition, a modified first-order projection scheme which leads to some improved error estimates is also proposed and analyzed. We also present the second-order projection method which is unconditionally stable. Ample numerical experiments are performed to confirm the theoretical predictions and demonstrate the efficiency of the methods.

• 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 Korea Game Society
• /
• v.10 no.4
• /
• pp.3-13
• /
• 2010

This study is about projection methods in computer games that support graphic user interface. Most of previous studies were case studies on or aesthetic approaches to a specific projection method. We investigated projection methods observed in computer games according to the chronicle of games, and studied changes in the methods and their future direction. Furthermore, we examined the emotional and productive aspects of various projection methods, and found that projection methods in computer games are being developed in accordance with graphic designers' job difficulty and computer processing capacity. Project, which determines contents consumers' view, is a very important factor to be decided at the planning stage of contents development. In this sense, we expect the results of this study to make a contribution to relevant areas.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.4
• /
• pp.162-172
• /
• 2021

This paper proposes stochastic methods to find an approximate solution for the L²-Wasserstein least squares problem of Gaussian measures. The variable for the problem is in a set of positive definite matrices. The first proposed stochastic method is a type of classical stochastic gradient methods combined with projection and the second one is a type of variance reduced methods with projection. Their global convergence are analyzed by using the framework of proximal stochastic gradient methods. The convergence of the classical stochastic gradient method combined with projection is established by using diminishing learning rate rule in which the learning rate decreases as the epoch increases but that of the variance reduced method with projection can be established by using constant learning rate. The numerical results show that the present algorithms with a proper learning rate outperforms a gradient projection method.

• Communications for Statistical Applications and Methods
• /
• v.27 no.5
• /
• pp.523-533
• /
• 2020

This paper suggests three available methods for finding nonnegative estimates of variance components of the random effects in mixed models. The three proposed methods based on the concepts of projections are called projection method I, II, and III. Each method derives sums of squares uniquely based on its own method of projections. All the sums of squares in quadratic forms are calculated as the squared lengths of projections of an observation vector; therefore, there is discussion on the decomposition of the observation vector into the sum of orthogonal projections for establishing a projection model. The projection model in matrix form is constructed by ascertaining the orthogonal projections defined on vector subspaces. Nonnegative estimates are then obtained by the projection model where all the coefficient matrices of the effects in the model are orthogonal to each other. Each method provides its own system of linear equations in a different way for the estimation of variance components; however, the estimates are given as the same regardless of the methods, whichever is used. Hartley's synthesis is used as a method for finding the coefficients of variance components.

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

• Korean Journal of Mathematics
• /
• v.22 no.4
• /
• pp.645-658
• /
• 2014

Many projection methods have been progressively constructed to find more accurate and efficient solution of the Navier-Stokes equations. In this paper, we consider most recently constructed projection methods: the pressure correction method, the gauge method, the consistent splitting method, the Gauge-Uzawa method, and the stabilized Gauge-Uzawa method. Each method has different background and theoretical proof. We prove equivalentness of the pressure correction method and the stabilized Gauge-Uzawa method. Also we will obtain that the Gauge-Uzawa method is equivalent to the gauge method and the consistent splitting method. We gather theoretical results of them and conclude that the results are also valid on other equivalent methods.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.3
• /
• pp.1-12
• /
• 2023

Software tools for manual 3D projection mapping have been widely used in theme parks and exhibitions. However, no research has been conducted on detailed utilization methods and usability of those tools yet. This study organizes the entire process of manual 3D projection mapping step by step and analyzes the problems that occurred at each step to identify potential improvements of 3D projection mapping tools. First, we introduce the process, which includes: two methods for creating virtual-physical object pairs to construct a virtual environment that is identical to the real-world target of the 3D projection mapping, the production of video textures for special effects, and mapping methods that use semi-automatic projector calibration. In addition, through experiments comparing and analyzing two widely used tools under various conditions for 3D mapping, we identified the technical limitations, performance differences between tools, and issues that impede usability. Finally, we suggest improvements and future research directions to enhance the usability of the 3D projection mapping technology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2341-2348
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on mean-residual metod. Sub-blocks of an image are encoded using mean-residual method where mean value is predicted according to that of neighboring blocks. Projection scheme with 8 directions is applied to the compression of residual signals of blocks. Projection vectors are finite-state vector quantized according to the projection angle of nighboring blocks in order to exploit the correlation among them. Side information to represent the repetition of projection is run-length coded while the information for projection direction is compressed using entropy encoding. The proposed scheme apears to be better in PSNR performance when compared with conventional projection scheme as well as in subjective quality preserving the edges of images better than most tranform methods which usually require heavy computation load.