• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.1005-1008
• /
• 2002

The authors introduce 3D display systems developed in our laboratories for recent ten years. Those are mainly realized by several technologies in holography: electro-holography. holographic stereogram, holographic optical elements (HOE) and hologram screen. We are currently focusing the development of 3D projection screen without glasses. Powerful directionality of the light beam is required for 3D projection screen unlike 2D type. We succeeded in achieving the superior diffractive efficiency of hologram screen that is based on the advanced volume holography. This technology is extensively useful to retrieve the Bragg condition of volume hologram in the three-dimensional space. Owing to this technology we could establish the principle of multi-view projection screen and have confirmed the case of 4 viewing points.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.85-86
• /
• 2014

본 연구의 목적은 브랜드 홍보 잠재력이 낮아지고 있는 기업 브랜드의 아이덴터티 유지를 위한 도구로서 Projection Mapping의 활용 방안을 고찰하는 것이다. 브랜드 홍보 잠재력이 낮아지고 있는 지역 대표 기업인 기아 타이거즈를 연구 대상으로 선정하고, Brand Identity측면에서 Durability, Differentiation, Coherence, Flexibility 특성 중심으로 Interactive Projection Mapping을 구현하였다. 제작과정은 크게 C4d 를 활용한 홍보 영상 제작, VVVV와 Touch Sensor을 활용한 행동에 반응하는 영상 제어 과정으로 이루어졌다.

• Journal of the Optical Society of Korea
• /
• v.15 no.2
• /
• pp.152-154
• /
• 2011

We propose a novel method which detects convex and concave corners using radial projection. The sum of two neighbors' differences at the local maxima or minima of the radial projection is compared with the angle threshold for detecting corners. In addition, the use of oriented bounding box trees and partial circles makes it possible to detect the corners of complex shapes. The experimental results show that the proposed method can separately detect the convex and concave corners, and that this method is scale invariant.

• Journal of Integrative Natural Science
• /
• v.10 no.1
• /
• pp.33-39
• /
• 2017

Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}(p-q{\geq}3)$, $q=rank(P_V)$ with a projection matrix $P_v$ under the quadratic loss, based on a sample $X_1$, $X_2$, ${\cdots}$, $X_n$. We find a James-Stein type decision rule which shrinks towards projection vector when the underlying distribution is that of a variance mixture of normals and when the norm ${\parallel}{\theta}-P_V{\theta}{\parallel}$ is restricted to a known interval, where $P_V$ is an idempotent and projection matrix and rank $(P_V)=q$. In this case, we characterize a minimal complete class within the class of James-Stein type decision rules. We also characterize the subclass of James-Stein type decision rules that dominate the sample mean.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.6
• /
• pp.1549-1555
• /
• 2014

Consider a p-variate normal distribution ($p-q{\geq}3$, q = rank($P_V$) with a projection matrix $P_V$). Using a simple property of noncentral chi square distribution, the generalized Bayes estimators dominating the James-Stein estimator shrinking towards projection vectors under quadratic loss are given based on the methods of Brown, Brewster and Zidek for estimating a normal variance. This result can be extended the cases where covariance matrix is completely unknown or ${\sum}={\sigma}^2I$ for an unknown scalar ${\sigma}^2$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.1
• /
• pp.23-30
• /
• 1980

The reconstruction problem in a low dose case requires some compromise of resolution and noise artifacts, and also some modification of filter kernels depending on the signal-to-noise ratio of projection data. In this paper, ail algorithm for the reconstruction of an image function from noisy projection data is suggested, based on minimum-mean-square error criterion. Modification of the falter kernel is made from information (statistics) obtained from the projection data. The simulation study Proves that this algorithm, based on the Wiener falter approach, provides substantially improved image with reduction of noise as well as improvement of the resolution. An approximate method was also studied which leads to the possible use of a recursive filter in the convolution process of image reconstruction.

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.9
• /
• pp.1001-1006
• /
• 2013

Projection-based stereolithography is divided into constrained-surface and free-surface type according to controlling liquid layer. The constrained-surface type has a uniform layer thickness due to the use of a projection window, which covers the pattern generator such as liquid crystal display. However, the adhered resin on the projection window causes trouble and requires great separation force when the cured layer is separated from the window. To minimize the separation force, we developed a system to measure the separation force. The influence of material covering the pattern generator and the resin temperature is investigated in the system. Several structures according to the resin temperature and the velocity of z-axis elevation are compared. As a result, the fabrication condition to minimize the separation force reduces the process time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.648-661
• /
• 1997

This paper presents a new method for post-processing of coded images based upon the low-pass filtering followed by the projection onto the NQCS (narrow quantization constraint set). We also investigate how the proposed method works on JPEG-coded real images. The starting point of the QCS-based post-processing techniques is the centroid of the QCS, where the original image belongs. The low-pass filtering followed by the projection onto the QCS makes the images lie on the boundary of the QCS. It is likely that, however, the original image is inside the QCS. Hence projection onto the NQCS gives a lower MSE (mean square error) than does the projection onto the QCS. Simulation results show that setting the narrowing coefficients of the NQCS to be 0.2 yields the best performance in most cases. Even though the JPEG-coded image is low-pass filtered and projected onto the NQCS repeatedly, there is no guarantee that the resultant image has a lower MSE and goes closer to the original image. Thus only one iteration is sufficient for the post-processing of the coded images. This is interesting because the main drawback of the iterative post-processing techniques is the heavy computational burden. The single iteration method reduces the computational burden and gives us an easy way to implement the real time VLSI post-processor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.