• Journal of the Korean Data and Information Science Society
• /
• v.26 no.2
• /
• pp.347-354
• /
• 2015

This paper deals with a method for intrablock anlaysis of balanced incomplete block designs on the basis of projections under the assumption of mixed effects model. It shows how to construct a model at each step by the stepwise procedure and discusses how to use projection for the analysis of intrablock. Projections are obtained in vector subspaces orthogonal to each other. So the estimates of the treatment effects are not affected by the block effects. The estimability of a parameter or a function of parameters is discussed and eigenvectors are dealt for the construction of estimable functions.

• Korean Journal of Optics and Photonics
• /
• v.18 no.6
• /
• pp.421-425
• /
• 2007

A new 3D rear projection display system using double-layer polarization-selective screen systems, one stacked in front of the other, has been developed. The front and rear screens are made of scattering polarizer films, and they either diffuse-scatter or transmit the incident light depending on the polarization state of the light. The near and for images are projected onto the front and rear screens, respectively, using light waves with mutually orthogonal polarization states. The new display system produces clear high-resolution images, which are visible over a wide range of viewing angle. It was found that the impression of depth is pronounced and eyestrain is only comparable to that by 2D display systems.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.2
• /
• pp.79-86
• /
• 2012

In this paper, we propose an enhanced algorithm for affine projection algorithms which have been proposed to speed up the convergence of the conventional NLMS algorithm. Since affine projection (AP) or pseudo AP algorithms are based on the delayed input vector and error vector, they are complicated and not suitable for applying methods developed for the LMS-type algorithms which are based on the scalar error signal. We devised a variable step size algorithm for pseudo AP using the fact that pseudo AP algorithms are updated using the scalar error and that the error signal is getting orthogonal to the input signal. We carried out a performance comparison of the proposed algorithm with other pseudo AP algorithms using a system identification model. It is shown that the proposed algorithm presents good convergence characteristics under both stationary and non-stationary environments despites its low complexity.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.686-698
• /
• 2021

A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.621-632
• /
• 2004

Multiresoluton analysis(MRA) of space of square integrable functions defined on whole entire line has been well-known. But for many applications, MRA on bounded interval was required and studied. In this paper we give a MRA for $L^2$(0, 1) by means of periodic wavelets based on regular MRA for $L^2$(R) and give the convergence of partial sums.

• Honam Mathematical Journal
• /
• v.24 no.1
• /
• pp.9-23
• /
• 2002

For a closed densely defined linear operator T on a Hilbert space H, let ${\prod}$ denote the function which corresponds to T, the orthogonal projection from $H{\oplus}H$ onto the graph of T. We extend some ordinary norm ineqralites comparing ${\parallel}{\Pi}(A)-{\Pi}(B){\parallel}$ and ${\parallel}A-B{\parallel}$ to the Schatten p-norm where A and B are bounded operators on H.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.5
• /
• pp.394-402
• /
• 2015

CMA (Constant Modulus Algorithm) is one of the well-known algorithms in blind acoustic channel equalization. Generally, CMA converges slowly and the speed of convergence is dependent on a step-size in the CMA procedure. Many researches have tried to speed up the convergence speed by applying a variable step-size to CMA, e.g. the orthogonal projection CMA and algebraic optimal step-size CMA. In this paper, we summarize these two algorithms, and we propose a new CMA with improved convergence performance. The improvement comes from the switching between the orthogonal projection CMA and algebraic optimal step-size CMA. In simulation results, we show the performance improvement in the time invariant channels as well as in time varying channel.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.5
• /
• pp.506-512
• /
• 2003

An output multiplexer of manifold type is widely used in a recent satellite transponder f3r its mass and volume reduction. For correct operation, the filter of such a multiplexer must be singly terminated. In this paper, a simple synthesis method of a 6-pole dual-mode singly terminated filter is described. From the transfer function of the filter, network parameters such as in/output terminations and coupling matrix are obtained with the aid of orthogonal projection and plane rotation. The rotation order, pivot, and rotation angle of the plane rotation process are given for easy filter synthesis. Two different-structure filters are taken into consideration and the network parameters of each filter have been obtained from the same transfer function. The method described in this paper can be applied to the other degree singly terminated filter.

• Korean Journal of Remote Sensing
• /
• v.33 no.5_1
• /
• pp.547-557
• /
• 2017

In this paper, a new spectral unmixing based target detection algorithm is proposed which adopted Iterative Error Analysis as a tool for extraction of background endmembers by using the target spectrum to be detected as initial endmember. In the presented method, the number of background endmembers is automatically decided during the IEA by stopping the iteration when the maximum change in abundance of the target is less than a given threshold value. The proposed algorithm does not have the dependence on the selection of image endmembers in the model-based approaches such as Orthogonal Subspace Projection and the target influence on the background statistics in the stochastic approaches such as Matched Filter. The experimental result with hyperspectral image data where various real and simulated targets are implanted shows that the proposed method is very effective for the detection of both rare and non-rare targets. It is expected that the proposed method can be effectively used for mineral detection and mapping as well as target object detection.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.449-453
• /
• 2001

In this paper, we propose an algorithm to design the adaptive structure of wavelet neural network with F-projection and geometric growing criterion. Geometric growing criterion consists of estimated error criterion considering local error and angle criterion which attempts to assign a wavelet function that is nearly orthogonal to all other existing wavelet functions. These criteria provide a methodology that a network designer can construct wavelet neural network according to one's intention. We apply the proposed constructing algorithm of the adaptive structure of wavelet neural network to approximation problems of 1-D and 2-D function, and evaluate the effectiveness of the proposed algorithm.