• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.97-104
• /
• 2009

This paper describes comparison and analysis of methodology which enables us in order to search the projection technique of optimum for projection in the plane. For this methodology, we applies the high-dimensional facial motion capture data respectively in linear and nonlinear projection techniques. The one core element of the methodology is to applies the high-dimensional facial expression data of frame unit in PCA where is a linear projection technique and Isomap, MDS, CCA, Sammon's Mapping and LLE where are a nonlinear projection techniques. And another is to find out the methodology which distributes in this low-dimensional space, and analyze the result last. For this goal, we calculate the distance between the high-dimensional facial expression frame data of existing. And we distribute it in two-dimensional plane space to maintain the distance relationship between the high-dimensional facial expression frame data of existing like that from the condition which applies linear and nonlinear projection techniques. When comparing the facial expression data which distribute in two-dimensional space and the data of existing, we find out the projection technique to maintain the relationship of distance between the frame data like that in condition of optimum. Finally, this paper compare linear and nonlinear projection techniques to projection high-dimensional facial expression data in low-dimensional space and analyze it. And we find out the projection technique of optimum from it.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.1019-1044
• /
• 2022

In this paper, we propose new algorithms for solving equilibrium and multivalued variational inequality problems in a real Hilbert space. The first algorithm for equilibrium problems uses only one approximate projection at each iteration to generate an iteration sequence converging strongly to a solution of the problem underlining the bifunction is pseudomonotone. On the basis of the proposed algorithm for the equilibrium problems, we introduce a new algorithm for solving multivalued variational inequality problems. Some fundamental experiments are given to illustrate our algorithms as well as to compare them with other algorithms.

• Communications of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.717-729
• /
• 2024

Let 𝓑(H) be the algebra of all bounded linear operators on a Hilbert space H with dim(H) > 2. Let 𝒢𝒫(H) be the subset of 𝓑(H) of all generalized projection operators. In this paper, we give a complete characterization of surjective maps 𝚽 : 𝓑(H) → 𝓑(H) satisfying A-𝛌B ∈ 𝒢𝒫(H) ⇔ 𝚽(A) - 𝛌𝚽(B) ∈ 𝒢𝒫(H) for any A, B ∈ 𝓑(H) and 𝛌 ∈ ℂ.

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.4
• /
• pp.11-24
• /
• 2021

In this paper, we propose an artificial neural network framework that can represent the foam effects expressed in liquid simulation in detail without noise. The position and advection of foam particles are calculated using the existing screen projection method, and the noise problem that appears in this process is solved through an proposed artificial neural network. The important thing in the screen projection approach is the projection map, but noise occurs in the projection map in the process of projecting momentum into the discretized screen space, and we efficiently solve this problem by using an artificial neural network-based denoising network. When the foam generating area is selected through the projection map, 2D is inversely transformed into 3D space to generate foam particles. We solve the existing denoising network problem in which small-scaled foam particles disappear. In addition, by integrating the proposed algorithm with the screen-space projection framework, all the advantages of this approach can be accommodated. As a result, it shows through various experiments whether it is possible to stably represent not only the clean foam effects but also the foam particles lost due to the denoising process.

• Journal of architectural history
• /
• v.15 no.3
• /
• pp.27-42
• /
• 2006

Many contemporary architectural avant gardes tend to use painting as a medium to create architecture which goes beyond the rationalized spatial conception of modem architecture represented by perspectivism. They produce non perspective drawings to represent spatial Ideas, and expand it through poetic imagination to create an unexpected architectural form and space. This paper attempts to analyze the historical origin and background of dominance of drawing in the production of architecture. It was with the invention of perspective that architectural representation became important tool for architectural production. Thereafter, drawing was considered prior to actual building and architecture was considered a three dimensional realization of two dimensional drawing. Modernist avant gardes such as Cubism shattered the rationalized pictorial space of perspective and found a new pictorial space. They tried to extend it to three dimensional space through parallel projection largely based on the Hildebrand's theory of pure visibility. However, due to the ambiguity of the position of the viewing subject, their attempts could not succeed in creating a new architecture. The new architectural avant garde of the 70's rediscovered the early 20th century avant gardes in their attempt to create a new architecture which can register the fragmented spatial condition of contemporary society, and used painting as a medium to create architecture. Their difference from the early avant gardes was that they used poetic imagination rather than parallel projection in the process of projecting three dimensional space and form from the painting. However, their architecture cannot escape the scopic field of perspectivism in that they rely on the picture plane and the distance between object and viewing subject. Therefore, I conclude that in order to create architecture which goes beyond the rationalized space of modern architecture, it is necessary to resort to other tradition of modern architecture than visual one.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1207-1214
• /
• 2008

We give an elementary proof of one of the main results in [H.O. Kim, R.Y. Kim, J.K. Lim, The infimum cosine angle between two finitely generated shift-invariant spaces and its applications, Appl. Comput. Har-mon. Anal. 19 (2005) 253-281] concerning the existence of an oblique projection onto a finitely generated shift-invariant space along the orthogonal complement of another finitely generated shift-invariant space under the assumption that the generators generate Riesz bases.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.87-97
• /
• 2018

Maximum intensity projection (MIP) is a common visualization technique in medical imaging system. A typical method to improve the performance of MIP is empty space leaping, which skips unnecessary area. This research proposes a new method to improve the existing empty space leaping. In order to skip more regions, we introduce a variety of acceleration strategies that use some tolerance given by the user to take part in image quality loss. Each proposed method shows various image quality and speed, and this study compares them to select the best one. Experimental results show that it is most efficient to add a constant tolerance function when the image quality required by the user is low. Conversely, when the user required image quality is high, a function with a low tolerance of volume center is most effective. Applying the proposed method to general MIP visualization can generate a relatively high quality image in a short time.

• Kyungpook Mathematical Journal
• /
• v.63 no.3
• /
• pp.413-424
• /
• 2023

The main purpose of this paper is to show that over a large class of bounded domains Ω ⊂ ℂ², for 1 < p < ∞, the Bergman projection 𝓟 is bounded from L^p(Ω, dV ) to the Bergman space A^p(Ω); from L^∞(Ω) to the holomorphic Bloch space BlHol(Ω); and from L¹(Ω, P(z, z)dV) to the holomorphic Besov space Besov(Ω), where P(ζ, z) is the Bergman kernel for Ω.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.101-111
• /
• 1993

The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

• Journal of the Korean Data and Information Science Society
• /
• v.5 no.1
• /
• pp.1-10
• /
• 1994

Projection pursuit(PP) is a computer-intensive method which seeks out interesting linear projections of multivariate data onto a lower dimension space by machine. By working with lower dimensional projections, projection pursuit avoids the sparseness of high dimensional data. We show through simulation that two projection pursuit discriminant mothods proposed by Chen(1989) and Huber(1985) do not improve very much the error rate than the existing methods and compare several classification procedures.