• Bulletin of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.991-1002
• /
• 2011

An iterative algorithm is provided to find a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of some variational inequality in a Hilbert space. Using this result, we consider a strong convergence result for finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping. Our results include the previous results as special cases and can be viewed as an improvement and refinement of the previously known results.

• Journal of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.561-576
• /
• 2009

We introduce two iterative algorithms for finding a common element of the set of fixed points of an asymptotically k-strict pseudo-contraction and the set of solutions of a mixed equilibrium problem in a Hilbert space. We obtain some weak and strong convergence theorems by using the proposed iterative algorithms. Our results extend and improve the corresponding results of Tada and Takahashi [16] and Kim and Xu [8, 9].

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.296-300
• /
• 1996

This paper presents 3D position estimation algorithm with the images of 2D vision sensors which issues Red Laser Slit light and recieves the line images. Since the sensor usually measures 2D position of corner(or edge) of a body and the measured point is not fixed in the body, the additional information of the corner(or edge) is used. That is, corner(or edge) line is straight and fixed in the body. For the body which moves in a plane, the Transformation matrix between the body coordinate and the reference coordinate is analytically found. For the 3D motion body, linearization technique and least mean squares method are used.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.4
• /
• pp.365-372
• /
• 2001

The general rule of boundary delimitation is a the principle of equidistant. The principle of equidistant is a method that determine boundary delimitation from fixed distant of baseline or basepoint. In this paper, study Two-Point Algorithm and Three-Point Algorithm that are widely used. and developed the Boundary Delimitation Program to verify the result and error. This program is specially useful for maritime boundary delimitation problem because there is no artificial and natural object in sea to determine boundary. As a result The mid-points computed on Ellipsoid have small error rather than mid-points on plane or sphere without any distortion by map projection. Through developing boundary delimitation program, can eliminate the various manipulation error using paper map, and quickly cope with maritime boundary delimitation negotiation. Also, verify that the error of basepoint in baseline is propagate the mid-point in mid-line, and determine suitable reference plane.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.11
• /
• pp.18-26
• /
• 2011

This paper describes a multi-mode LDPC decoder which supports three block lengths(648, 1296, 1944) and four code rates(1/2, 2/3, 3/4, 5/6) of IEEE 802.11n wireless LAN standard. To minimize hardware complexity, it adopts a block-serial (partially parallel) architecture based on the layered decoding scheme. A novel memory reduction technique devised using the min-sum decoding algorithm reduces the size of check-node memory by 47% as compared to conventional method. From fixed-point modeling and Matlab simulations for various bit-widths, decoding performance and optimal hardware parameters such as fixed-point bit-width are analyzed. The designed LDPC decoder is verified by FPGA implementation, and synthesized with a 0.18-${\mu}m$ CMOS cell library. It has 219,100 gates and 45,036 bits RAM, and the estimated throughput is about 164~212 Mbps at 50 MHz@2.5v.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.617-623
• /
• 2008

This paper presents a human motion recognition method using both centroid shift and local basis images. The centroid shift based on 1st moment balance technique is applied to get the robust motion images against position or size changes, the extraction of local basis images based on independent component analysis(ICA) is also applied to find a set of statistically independent motion features, which is included in each motions. Especially, ICA of fixed-point(FP) algorithm based on Newton method is used for being quick to extract a local basis images of motions. The proposed method has been applied to the problem for recognizing the 160(1 person * 10 animals * 16 motions) sign language motion images of 240*215 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate) than the method using local eigen images and the method using local basis images without centroid shift respectively.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.263-271
• /
• 2000

In this paper, an acoustic echo canceller(AEC) is implemented by ADSP-2181. This AEC uses a noise robust adaptive algorithm and a postprocessing method which attenuates residual echo using cross-correlation between estimated error signal and microphone input signal. We propose new postprocessing method that uses two thresholds to prevent signal distortion after postprocessing and to improve the performance of AEC without extra computational burden. Through experiments using a 16 bit fixed-point DSP board (ADSP-2181 EZ-KIT Lite board), it is shown that the noise robust adaptive algorithm performs well in the double-talk situations and the convergence speed is comparable to NLMS. Using the postprocessor, ERLE is improved about 20 dB. As a result, the AEC with a postprocessor shows better performance than conventional ones.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.116-123
• /
• 2009

Feature point matching, which is finding the corresponding points from two images with different viewpoint, has been used in various vision-based applications and the demand for the real-time operation of the matching is increasing these days. This paper presents a real-time feature point matching method by using a local descriptor derived by Zernike moments. From an input image, we find a set of feature points by using an existing fast corner detection algorithm and compute a local descriptor derived by Zernike moments at each feature point. The local descriptor based on Zernike moments represents the properties of the image patch around the feature points efficiently and is robust to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions with fixed size in advance and store them in lookup tables. The initial matching results are acquired by an Approximate Nearest Neighbor (ANN) method and false matchings are eliminated by a RANSAC algorithm. In the experiments we confirmed that the proposed method matches the feature points in images with various transformations in real-time and outperforms existing methods.

• Journal of the Korean Physical Society
• /
• v.73 no.11
• /
• pp.1774-1786
• /
• 2018

Phenotypic variation among clones (individuals with identical genes, i.e. isogenic individuals) has been recognized both theoretically and experimentally. We investigate the effects of phenotypic variation on evolutionary dynamics of a population. In a population, the individuals are assumed to be haploid with two genotypes : one genotype shows phenotypic variation and the other does not. We use an individual-based Moran model in which the individuals reproduce according to their fitness values and die at random. The evolutionary dynamics of an individual-based model is formulated in terms of a master equation and is approximated as the Fokker-Planck equation (FPE) and the coupled non-linear stochastic differential equations (SDEs) with multiplicative noise. We first analyze the deterministic part of the SDEs to obtain the fixed points and determine the stability of each fixed point. We find that there is a discrete phase transition in the population distribution when the probability of reproducing the fitter individual is equal to the critical value determined by the stability of the fixed points. Next, we take demographic stochasticity into account and analyze the FPE by eliminating the fast variable to reduce the coupled two-variable FPE to the single-variable FPE. We derive a quasi-stationary distribution of the reduced FPE and predict the fixation probabilities and the mean fixation times to absorbing states. We also carry out numerical simulations in the form of the Gillespie algorithm and find that the results of simulations are consistent with the analytic predictions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3140-3149
• /
• 1999

Skew correction for document images can be using a rotational transformation of pixel coordinates. In this paper we propose a method which corrects the document skew, by an amount of $\theta$ degrees, using block information, where the block is defined as a rectangular area containing adjacent black pixels. Processing speed of the proposed method is faster than that of the method using pixel transformation, since the number of floating-point operations can be reduced significantly. In the proposed method, we rotate only the four corner points of each block, and then identify the pixels inside the block. Two methods for inside pixel identification are proposed; the first method finds two points intersecting the boundary of the rotated block in each row, and determines the pixels between the two intersection points as the inside pixel. The second method finds boundary points based on Bresenham's line drawing algorithm, using fixed-point operation, and fills the region surrounded by these boundaries as black pixels. We have measured the performance of the proposed method by experimenting it with 2,016 images of various English and Korean documents. We have also proven the superiority of our algorithm through performance comparison with respect to existing methods based on pixel transformation.