• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.4 no.1
• /
• pp.31-37
• /
• 1974

The author has studied roentgenographic images of temporomandibular articulation using various conventional roentgenographies. The roentgenographic images have obtained by application of the contrast media on the glenoid fossa and condylar head in a human dry skull. Comparing the various roentgenograms by Modified Transcranial projection, A-P T.M. articulation projection, Reverse Towne projection, Mayer projection and Bregma-Menton projection. The author has drawn following results. 1. The sharp radiogaphic details were obtained by all technics used except the Bregma-Menton projection, which seemed to be impractical to the study of T.M.J. because of to be shortened the image of condylar head. 2. The best image of the condyle-fossa relationship was appeared by Modified Transcranial projection and better image was acquired by Orbito-Ramus projection, but there were all inferior in Reverse Towne projection, Mayer projection and Bregma-Menton projection. 3. In all of the above techniques, the radiographic images of condylar head were clear and were appeared to be the convex type in Modified Transcranial projection, the angled type in Orbito-Ramus and Reverse Towne projection, the flat type in Mayer projection and the distorted angled type in Bregma-Menton projection. 4. The radiographic image of condylar head was shortened in Bregma-Menton projection only and was magnified somewhat in other projection.

• 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 Biomedical Engineering Research
• /
• v.15 no.3
• /
• pp.275-280
• /
• 1994

In the case of the image reconstruction from unknown projection data such as imaging the object with opaque obstructions, conventional reconstruction algorithms may reconstruct a degraded image. In this paper, a new method for the estimation of the unknown projection data based on known projection data and the bandwidth of projection data is proposed. The proposed method successfully estimates the unknown projection data through iterative transformation between projection space and frequency space using the known projection data and the bandwidth of the projection data. Computer simulation shows that the proposed method significantly improves image quality and convergence behavior over conventional algorithms. In addition, the proposed method is successfully applied to ultrasound attenuation CT using a sponge phantom.

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

• Korea journal of population studies
• /
• v.33 no.2
• /
• pp.85-111
• /
• 2010

South Korea has experienced a rapid fertility decline and notable mortality improvement. As the drop in TFR was quicker and greater in terms of tempo and magnitude, it cast a new challenge of population projection - how to improve the forecasting accuracy in the country with a super-low fertility pattern. This study begin with the current status of the national population projection as implemented by Statistics Korea by comparing the 2009 interim projection with the 2006 official national population projection. Secondly, this study compare the population projection system including projection agencies, projection horizons, projection intervals, the number of projection scenarios, and the number of assumptions on fertility, mortality and international migration among super-low fertility countries. Thirdly we illustrate a stochastic population projection for Korea by transforming the population rates into one parameter series. Finally we describe the future challenges of the national population projection, and propose the projection scenarios for the 2011 official population projection. To enhance the accuracy, we suggest that Statistics Korea should update population projections more frequently or distinguish them into short-term and long-term projections. Adding more than four projection scenarios including additional types of "low-variant"fertility could show a variety of future changes. We also expect Statistics Korea topay more attention to the determination of a base population that should include both national and non-national populations. Finally we hope that Statistics Korea will find a wise way to incorporate the ideas underlying the system of stochastic population projection as part of the official national population projection.

• Advances in robotics research
• /
• v.2 no.1
• /
• pp.45-57
• /
• 2018

Even though the popularity of projection mapping continues to increase and it is being implemented in more and more settings, most current projection mapping systems are limited to special purposes, such as outdoor events, live theater and musical performances. This lack of versatility arises from the large number of projectors needed and their proper calibration. Furthermore, we cannot change the positions and poses of projectors, or their projection targets, after the projectors have been calibrated. To overcome these problems, we propose a projection mapping method using a projector robot that can perform projection mapping in more general or ubiquitous situations, such as shopping malls. We can estimate a projector's position and pose with the robot's self-localization sensors, but the accuracy of this approach remains inadequate for projection mapping. Consequently, the proposed method solves this problem by combining self-localization by robot sensors with position and pose estimation of projection targets based on a 3D model. We first obtain the projection target's 3D model and then use it to accurately estimate the target's position and pose and thus achieve accurate projection mapping with a projector robot. In addition, our proposed method performs accurate projection mapping even after a projection target has been moved, which often occur in shopping malls. In this paper, we employ Ubiquitous Display (UD), which we are researching as a projector robot, to experimentally evaluate the effectiveness of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.195-203
• /
• 2004

VolumePro is a real-time volume rendering hardware for consumer PCs. However it cannot be used for the applications requiring perspective projection such as virtual endoscopy since it provides only orthographic projection. Several methods have been presented to approximate perspective projection by decomposing a volume into slabs and applying successive parallel projection to thou. But it takes a lot of time since the entire region of every slab should be processed, which does not contribute to final image. In this paper, we propose an efficient perspective projection method that makes the use of several sub-volumes with cropping feature of VolumePro. It reduces the rendering time in comparison to slab-based method without image quality deterioration since it processes only the parts contained in the view frustum.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.651-658
• /
• 2001

The projection matrix plays an important role in the linear model theory. In this paper we derive an algebraic relationship between the projection matrices of submatrices of the design matrix. Using this relationship we can easily obtain the projection matrices of any submatrices of the design matrix. Also we show that every projection matrix can be obtained as a linear combination of Kronecker products of identity matrices and matrices with all elements equal to 1.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.615-622
• /
• 2002

In this paper, the modification of double projection method for the adaptive analysis of Element-free Galerkin(EFG) method were proposed. As results of the double projection method, the smoothed error profile that is adequate for adaptive analysis was obtained by re-projection of error that means the differences of EFG stress and projected stress. However, it was found that the efficiency of double projection method is degraded as increase of the numerical integration order. Since, the iterative refinement to single step error estimation made the same effect as increasing of integration order, the application of the iterative refinement base on double projection method could be produced the inadequately refined analysis model. To overcome this defect, a modified scheme of double projection were proposed. In the numerical example, the results did not show degradation of double projection effect in iterative refinement and the efficiency of proposed scheme were proved.

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