• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.3
• /
• pp.140-147
• /
• 2013

We present a vaguelette-curvelet decomposition based image deblurring algorithm. We first perform denoising based on the hard-thresholding rule by estimating unknown curvelet coefficients. The proposed algorithm then calculates vaguelette functions by deconvolving the curvelet bases by the point spread function. Vaguelette transform is finally performed to make a clearly restored image. Since the proposed algorithm uses the curvelet transform to sensitively express the edges in all directions, it is possible to restore images with more naturally preserved edges in all directions.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.265-272
• /
• 2003

In this paper, we propose a novel improved algorithm for the rectangular decomposition technique for the purpose of performing data mining from large scaled database in a dynamic environment. The proposed algorithm performs the rectangular decompositions by transforming a binary matrix to bipartite graph and finding bicliques from the transformed bipartite graph. To demonstrate its effectiveness, we compare the proposed one which is based on the newly derived mathematical properties with those of other methods with respect to the classification rate, the number of rules, and complexity analysis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.51-69
• /
• 1997

Recently Lee et al[5] developed an approximation algorithm for the performance evaluation of the open queueing networks with blocking. This algorithm, which solves the exponential queueing networks with general configuration is developed based on the symmetrical decomposition approach and is reported to have many advantages over the previous algorithmsf. In addition to being very accurate, this algorithm is reported to be quite simple, pretty fast and solves very general configurations. In this study, we show that if a network has a tree-like configurations, the algorithm developed by Lee at al, always converges to the unique solution. To prove the theoretical results pertaining to the algorithm, some properties associated with symmetrical decomposition approach are exploited. The results obtained in this study such as the proofs of convergence of the algorithm as well as uniquences of the solution would contribute to the theoretical study for the non-tandem configurating of open queueing network.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.67-75
• /
• 1999

In this paper, a shape decomposition method using morphological operations is studied for decomposing the complex shape in 2-D image into its simple primitive elements. The serious drawback of conventional shape representation algorithm is that primitive elements are extracted too much to represent and to describe the shape. To solve these problems, a new shape decomposition algorithm using primitive elements tat are similar to the geometrical characteristics of shape and 4 scan modes is proposed in this study. The multiple primitive elements as circle, square, and rhombus are extracted by using multiscan modes in a new algorithm. This algorithm have chatacteristics that description error and number of primitive elements is reduced. Then, description efficiency is improved. The procedures is also simple and the processing time is reduced.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.6
• /
• pp.230-237
• /
• 1985

Shortest path calculations for a large-scale network have to be performed using a decomposition techniqre, since the calculations require large memory size which increases by the square of the number of vertices in the network. Also, the calculation time increases by the cube of the number of vertices in the network. In the decomposition technique,the network is broken into a number of smaller size subnetworks for each of which shortest paths are computed. A union of the solutions provides the solution of the original network. In all of the decomposition algirithms developed up to now, boundary vertices which divide all the subnetworks have to be included in computing shortest paths for each subnetwork. In this paper, an improved algorithm is developed to reduce the number of boundary vertices to be engaged. In the algorithm, only those boundary vertices that are directly connected to the subnetwork are engaged. The algorithm is suitable for an application to real time computation using a parallel processor system which consists of a number of micro-computers or prcessors. The algorithm has been applied to a 39- vertex network and a 232-vertex network. The results show that it is efficient and has better performance than any other algorithms. A parallel processor system has been built employing an MZ-80 micro-computer and two Z-80 microprocessor kits. The former is used as a master processor and the latter as slave processors. The algorithm is embedded into the system and proven effective for real-time shortest path computations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.195-201
• /
• 2007

A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.4
• /
• pp.23-29
• /
• 2016

Rotary machine is major equipment in industry. The rotary machine is applied for a machine tool, ship, vehicle, power plant, and so on. But a spindle fault increase product's expense and decrease quality of a workpiece in machine tool. A turbine in power plant is directly connected to human safety. National crisis could be happened by stopping of rotary machine in nuclear plant. Therefore, it is very important to know rotary machine condition in industry field. This study mentioned fault diagnosis algorithm with statistical parameter and empirical mode decomposition. Vibration locations can be found by analyze kurtosis of data from triaxial axis. Support vector of data determine threshold using hyperplane with fault location. Empirical mode decomposition is used to find fault caused by intrinsic mode. This paper suggested algorithm to find direction and causes from generated fault.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.765-778
• /
• 2016

In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.115-123
• /
• 1997

In this paper we present a polynomial matrix decomposition algorithm that determines a polynomial matix M(z) which satisfies the relation V(z)=M(z) for a given polynomial matrix V(z) which is paraconjugate hermitian matrix with normal rank r and is positive semidenfinite on the unit circle of z-plane. All the decomposition procedures in this proposed method are performed in the digitral domain. We also discuss how to apply the polynomial matirx decomposition in realizing MIMO LBR two-pairs.