• Journal of Information Display
• /
• v.3 no.3
• /
• pp.1-11
• /
• 2002

Multi-view function is important to three-dimensional displays without dedicated glasses. It is the reason that the observers earnestly desire to change their positions freely. Multi-viewing is also principal to the reality of three-dimensional (3D) image displayed on the screen. The display of projection type has the advantage that the number of viewing points can be easily increased according to the number of projectors. The authors research on multi-view projection display with hologram screen. Powerful directionality of the diffracted beam from hologram screen is required unlike two-dimensional (2D) display. We developed a new method that all diffracted beams satisfied the same Bragg condition and became sufficiently bright to observe the 3D image under usual indoor light. The principle is based on the essential Bragg diffraction in the three-dimensional space. Owing to such three-dimensional Bragg diffraction we achieved an excellent hologram screen that could be multiple reconstructed in spite of single recording. This hologram screen is able to answer arbitrary numbers of viewing points within wide viewing zone. The distortion of 3D image becomes also sufficiently small with the method of dividing the cross angle between illumination and diffraction beam.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.2
• /
• pp.55-64
• /
• 2005

In this paper, generalized difference methods(GDM) for one-dimensional viscoelastic problems are proposed and analyzed. The new initial values are given in the generalized difference scheme, so we obtain optimal error estimates in $L^p$ and $W^{1,p}(2\;{\leq}\;p\;{\leq}\;{\infty})$ as well as some superconvergence estimates in $W^{1,p}(2\;{\leq}\;p\;{\leq}\;{\infty})$ between the GDM solution and the generalized Ritz-Volterra projection of the exact solution.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.170-176
• /
• 1998

In this paper, the column space and null space of the Jacobian matrix were obtained by using the pseudo-inverse method and projection matrix. The equations of motion of the system were replaced by independent acceleration components using the null space matrix. The proposed method has the following advantages. (1) It is simple to derive the null space. (2) The efficiency is improved by getting rid of constrained force terms. (3) Neither null space updating nor coordinate partitioning method is required. The suggested algorithm is applied to a three-dimensional vehicle model to show the efficiency.

• The Journal of Korean Society for Radiation Therapy
• /
• v.28 no.2
• /
• pp.123-130
• /
• 2016

Purpose : The aim of this study was to compare the differences between the volumes acquired with four-dimensional computed tomography (4DCT)images with a reconstruction image-filtering algorithm and cone-beam computed tomography (CBCT) images with dynamic phantom. Materials and Methods : The 4DCT images were obtained from the computerized imaging reference systems (CIRS) phantom using a computed tomography (CT) simulator. We analyzed the volumes for maximum intensity projection (MIP), minimum intensity projection (MinIP) and average intensity projection (AVG) of the images obtained with the 4DCT scanner against those acquired from CBCT images with CT ranger tools. Results : Difference in volume for node of 1, 2 and 3 cm between CBCT and 4DCT was 0.54~2.33, 5.16~8.06, 9.03~20.11 ml in MIP, respectively, 0.00~1.48, 0.00~8.47, 1.42~24.85 ml in MinIP, respectively and 0.00~1.17, 0.00~2.19, 0.04~3.35 ml in AVG, respectively. Conclusion : After a comparative analysis of the volumes for each nodal size, it was apparent that the CBCT images were similar to the AVG images acquired using 4DCT.

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

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.651-656
• /
• 2001

Histogram intersection method, that counts the occurrence of color pixels, is one of the easy and simple color image retrieval methods. The method has an appropriate global property but does not contain the knowledge of shape for images. The absence of spatial information makes it difficult to discriminate images of the similar histogram. The application of one-dimensional projection to each image enables to obtain shape or spatial information of image. But in this case there is another problem having different length of the projection vector according to the size of each image. Thus 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.

• The Korean Journal of Applied Statistics
• /
• v.27 no.5
• /
• pp.717-729
• /
• 2014

Projection pursuit classification tree uses a 1-dimensional projection with the view of the most separating classes in each node. These projection coefficients contain information distinguishing two groups of classes from each other and can be used to calculate the importance measure of classification in each variable. This paper reviews the variable importance measure with increasing interest in line with growing data size. We compared the performances of projection pursuit classification tree with those of classification and regression tree(CART) and random forest. Projection pursuit classification tree are found to produce better performance in most cases, particularly with highly correlated variables. The importance measure of projection pursuit classification tree performs slightly better than the importance measure of random forest.

• Communications of the Korean Mathematical Society
• /
• v.26 no.1
• /
• pp.125-133
• /
• 2011

A new kind of structure is introduced in an even dimensional differentiable Riemannian manifold and some basic properties of this structure is discussed. Also the existence of such structure is shown with an example.

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

In this paper, the bit-level 1-dimensional systolic array for modular multiplication is designed. First of all, the parallel algorithm and data dependence graph from walter's method based on montgomery algorithm suitable for array design for modular multiplication is derived. By the systematic procedure for systolic array design, four 1-dimensional systolic arrays are obtained and then are evaluated by various criteria. As it is modified the array which is derived form [0,1] projection direction by adding a control logic and it is serialized the communication paths of data A, optimal 1-dimensional systolic array is designed. It has constant I/O channels for expansile module and it is easy for fault tolerance due to unidirectional paths. It is suitable for RSA cryptosystem which deals iwth the large size and many consecutive message blocks.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1355-1375
• /
• 2021

The n-dimensional generalized Hartogs triangles ℍⁿ_𝐩 with n ≥ 2 and 𝐩 := (p₁, …, p_n) ∈ (ℝ⁺)ⁿ are the domains defined by ℍⁿ_𝐩 := {z = (z₁, …, z_n) ∈ ℂⁿ : |z₁|^p₁ < ⋯ < |z_n|^p_n < 1}. In this paper, we study the L^p Sobolev mapping properties for the Bergman projections on the n-dimensional generalized Hartogs triangles ℍⁿ_𝐩, which can be viewed as a continuation of the work by S. Zhang in [25] and a higher-dimensional generalization of the work by L. D. Edholm and J. D. McNeal in [16].