• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.121-128
• /
• 1997

This paper proposes a class of rearrangeable networks, called generalized rearrangeable networks(GRNs). GRNs are obtained from the Benes network by rearranging the connections between states and the switches within each stage. The GRNs constitute all of the rearrangeable networks which have the recursive decomposition structure and can be routed by the outside-in decomposition of permutations as the Bene network. This paper also presents a necessary condition for a network to be a GRN and a network labeling scheme to check if a network satisfies the condition. the general routing algorithm for the GRNs is given by modifying slightly the looping algorithm of the Benes network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.595-598
• /
• 2004

In this paper, a shape decomposition method using morphological operations is studied for decomposing the complex shape in 2-D mage into its simple primitive elements. The serious drawback of conventional shape representation algorithm is that the primitive elements are extracted too much to represent the shape and the processing time is long. To solve these problems, a new shape decomposition algorithm using the 8 bit planes obtained from gray code is proposed.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.11 no.6
• /
• pp.200-207
• /
• 2001

In this paper, a new method for Partial field decomposition is developed that is based on the beamforming algorithm for the application of acoustical holography to a composite sound field generated by multiple incoherent sound sources. In the proposed method, source Positions are first predicted by MUSIC(multiple signal classification) algorithm. The composite sound fields can then be decomposed into each partial field by the beamforming. Results of both numerical simulations and experiments show that the method can find each partial field very accurately and effectively, and that it also has Potential to be used for application to distributed sources.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.4
• /
• pp.369-378
• /
• 2000

Conventional fractal image compression methods have many problems in searching time for matching domain block. Proposed method is an improved method of Fisher's Quadtree Decomposition in terms of time, compression ratio, and PSNR. This method determines range block in advance using QR algorithm. First, input image is partitioned to $4{\times}4$ range block and then recomposition is performed from bottom level to specified level. As a result, this proposed method achieves high encoding and decoding speed, high compression ratio, and high PSNR than Fisher's Quadtree Decomposition method.

• IE interfaces
• /
• v.1 no.1
• /
• pp.1-7
• /
• 1988

This paper discusses the applicability of the decomposition principle to an LP (Linear Programming) problem. Through a case study on product mix problems in a chemical process of Korean Steel Chemical Co., Ltd., the decomposition algorithm, LP Simplex method and a modified method are compared and evaluated in computation time and number of iterations.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.967-968
• /
• 2008

In this paper we demonstrate the effect of sparse decomposition on various Independent Component Analysis (ICA) algorithms for separating simultaneous linear mixture of independent 2-D signals (images). We will show using simulated results that sparse decomposition before Kernel ICA (Sparse Kernel ICA) algorithm produces the best results as compared to other ICA algorithms.

• Journal of the Korean Statistical Society
• /
• v.24 no.2
• /
• pp.407-417
• /
• 1995

The h-plot is a graphical technique for displaying the structure of one population's variance-covariance matrix. This follows the mathematical algorithem of the principle component biplot based on the singular value decomposition. But it is known that the singular value decomposition is not resistant, i.e., it is very sensitive to small changes in the input data. In this article, since the mathematical algorithm of the h-plot is equivalent to that of principal component biplot of Choi and Huh (1994), we derive the resistant h-plot.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.89-92
• /
• 2014

This paper presents a secure and blind adaptive audio watermarking algorithm based on Empirical Mode Decomposition (EMD). The audio signal is divided into frames and each one is decomposed adaptively, by EMD, into several Intrinsic Mode Functions (IMFs). The watermark and the synchronization codes are then embedded into the extrema of the last IMF. The experimental results show that the proposed method has good imperceptibility and robustness against signal processing attacks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.3 no.3
• /
• pp.55-58
• /
• 1980

Today, L.P. model has often been used in solving economic and managemental phenomena. But in case of adopting L.P. model in dealing with practical economic and managemental problems there is a possibility that we have difficulties in solving these problems because of greatness of model size, cost for collecting data, cost for adjusting matrix, and etc. In this respect "Decomposition Algorithm for L.P." has been used in overcoming the difficulties above stated. In this paper therefore, I will try to introduce and them criticize Dantzig -Wolfe's "Decomposition Method" and Kornai - Liptak's "Two - Level Planning".ot;Two - Level Planning".uot;.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.