• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.813-820
• /
• 2004

This paper proposes a digital image watermarking which is robust to geometric distortions using an independent component analysis(ICA) of fixed-point(FP) algorithm based on secant method. The FP algorithm of secant method is applied for better performance in a separation time and rate, and ICA is applied to reject the prior knowledges for original image, key, and watermark such as locations and size, etc. The proposed method embeds the watermark into the spatial domain of original image The proposed watermarking technique has been applied to lena, key, and two watermarks(text and Gaussian noise) respectively. The simulation results show that the proposed method has higher speed and better rate for extracting the original images than the FP algorithm of Newton method. And the proposed method has a watermarking which is robust to geometric distortions such as resizing, rotation, and cropping. Especially, the watermark of images with Gaussian noise has better extraction performance than the watermark with text since Gaussian noise has lower correlation coefficient than the text to the original and key images. The watermarking of ICA doesn't require the prior knowledge for the original images.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• IE interfaces
• /
• v.20 no.2
• /
• pp.121-132
• /
• 2007

The facility layout problem (FLP) involves the positioning of facilities within a given workplace in order to minimize the material flow distance between facilities. In this paper, we focus on the FLP in which the each facility has a rectangular shape and an input and output points. We develop a heuristic algorithm in which the facilities are arranged according to the layout algorithm using center of gravity and then simulated annealing algorithm is applied to improve the solution. A comparison of the computational results with exiting algorithms shows that the proposed algorithm provides better solutions in reasonable range of computational time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1236-1248
• /
• 1991

A new fast algorithm for computing the discrete cosine transform(DCT) Is developed decomposing N-point DCT into an N /2-point DCT and two N /4 point transforms(transpose of an N /4-point DCT. TN/t'and)It has an important characteristic that in this method, the roundoff noise power for a fixed point arithmetic can be reduced significantly with respect to the wellknown fast algorithms of Lee and Chen. since most coefficients for multiplication are distributed at the nodes close to the output and far from the input in the signal flow graph In addition, it also shows three other versions of factorization of DCT matrix with the same number of operations but with the different distributions of multiplication coefficients.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.701-712
• /
• 2009

In this paper, we first introduce a family S = {$S_n$ : C ${\rightarrow}$ C} of non-Lipschitzian mappings, called total asymptotically nonexpansive (briefly, TAN) on a nonempty closed convex subset C of a real Banach space X, and next give necessary and sufficient conditions for strong convergence of the sequence {$x_n$} defined recursively by the algorithm $x_{n+1}$ = $S_nx_n$, $n{\geq}1$, starting from an initial guess $x_1{\in}C$, to a common fixed point for such a continuous TAN family S in Banach spaces. Finally, some applications to a finite family of TAN self mappings are also added.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.238-241
• /
• 2000

This paper describes an equalizer using the DFE (Decision Feedback Equalizer) structure, CMA. (Constant Modulus Algorithm) and LMS (Least Mean Square) algorithms. We employ high speed multipliers, square logics and many CSAs (Carry Save Adder) for high speed operations. We have developed floating-point models and fixed-point models using the COSSAP$\^$TM/ CAD tool and developed VHDL models. We have peformed logic synthesis using the SYNOPSYS$\^$TM/ CAD tool and the SAMSUNG 0.5 $\mu\textrm{m}$ standard cell library (STD80). The total number of gates is about 130,000.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.197-208
• /
• 2009

In this paper, we study stochastic maximal covering location problem considering floating population. Traditional maximal covering location problem assumed that number of populations at demand point is already known and fixed. In this manner, someone who try to solve real world maximal covering location problem must consider administrative population as a population at demand point. But, after observing floating population, appliance of population in steady-state is more reasonable. In this paper, we suggest revised numerical model of maximal covering location problem. We suggest heuristic methodology to solve large scale problem by using genetic algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.3
• /
• pp.7-14
• /
• 2003

MPEG-1 audio standard is the algorithm for the compression of high-qualify digital audio signals. The standard dictates the functions of encoder and decoder pair, and includes three different layers as the complexity and the performance of the encoder and decoder. In this paper, we implemented the real-time system of MPEG-1 audio layer III decoder(MP3) with the TMS320C541 fixed point DSP chip. MP3 algorithm uses psycho-acoustic characteristic of human hearing system, and it reduces the amount of data with eliminating the signals hard to be heard to the hearing system of human being. It is difficult to implement MP3 decoder with fixed Point DSP because of it's broad dynamic range. We implemented realtime system with fixed DSP chip by using weighted look-up tables to reduce the amount of calculation and solve the problem of broad dynamic range.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.753-762
• /
• 2010

Let K be a nonempty closed convex subset of a real Hilbert space H. Let T : K $\rightarrow$ K be a nonexpansive mapping with a nonempty fixed point set Fix(T). Let f : K $\rightarrow$ K be a contraction mapping. Let {$\alpha_n$} and {$\beta_n$} be sequences in (0, 1) such that $\lim_{x{\rightarrow}0}{\alpha}_n=0$, (0.1) $\sum_{n=0}^{\infty}\;{\alpha}_n=+{\infty}$, (0.2) 0 < a ${\leq}\;{\beta}_n\;{\leq}$ b < 1 for all $n\;{\geq}\;0$. (0.3) Then it is proved that the modified Krasnoselski-Mann iterative sequence {$x_n$} given by {$x_0\;{\in}\;K$, $y_n\;=\;{\alpha}_{n}f(x_n)+(1-\alpha_n)x_n$, $n\;{\geq}\;0$, $x_{n+1}=(1-{\beta}_n)y_n+{\beta}_nTy_n$, $n\;{\geq}\;0$, (0.4) converges strongly to a point p $\in$ Fix(T} which satisfies the variational inequality

$\leq$ 0, z $\in$ Fix(T). (0.5) This result improves and extends the corresponding results of Yao et al[Y.Yao, H. Zhou, Y. C. Liou, Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings, J Appl Math Com-put (2009)29:383-389.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.747-752
• /
• 1996

In this paper, we propose a new SO-MLSE(soft-output maximum likelihood sequence estimation) equalizer, which can be used in GSM digital cellular system) it uses complex correlation of training sequence to obtain the channel information and the equalization is performed by MLSE using Viterbi algorithm. In order to generate a soft-decision input to channel decoder (Viterbi decoder), the soft-output equalization algorithm is needed. The adopted algorithm doesn't require to modify the structure of HO-MLSE(hard output MLSE) equalizer, that is, SO-MLSE equalizer can be implemented by adding soft-output generation block to HO-MLSE equalizer. This algorithm uses the outputs of matched filter and HO-MLSE equalizer. It turns out that the complexity of proposed SO-MLSE equalizer is simpler than those of other SO-MLSE equalizer and its perforance is almost the same as those of others. Finally, the proposed SO-MLSE equalizer is also implemented s a prototype with ADSP-2101 16-bits fixed point digital signal processing chip.