• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2000.11a
• /
• pp.41-44
• /
• 2000

With the advent of DNA microarray and "chip" technologies, gene expression in an organism can be monitored on a genomic scale, allowing the transcription levels of many genes to be measured simultaneously. Functional interpretation of massive expression data and linking such data to DNA sequences have become the new challenges to bioinformatics. I will us yeast cell cycle expression data analysis as an example to demonstrate how special database and computational methods may be used for extracting functional information, I will also briefly describe a novel clustering algorithm which has been applied to the cell cycle data.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.16.1-164
• /
• 1998

This paper describes Facial Expression Explorer to search for the components of a facial expression and to map the expression to other expressionless figures like a robot, frog, teapot, rabbit and others. In general, it is a time-consuming and laborious job to create a facial expression manually, especially when the facial expression must personify a well-known public figure or an actor. In order to extract a blending ratio from facial images automatically, the Facial Expression Explorer uses Networked Genetic Algorithm(NGA) which is a fast method for the convergence by GA. The blending ratio is often used to create facial expressions through shape blending methods by animators. With the Facial Expression Explorer a realistic facial expression can be modeled more efficiently.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.163-166
• /
• 2000

This paper presents an image processing algorithm which gives an sketch effect on the real image taken by CCD camera. The essence of the technique is the expression of shading by the line touch. Several line patterns are developed to emulate pencil drawings, fusains, Indian ink paintings. This algorithm is expected to be used for computer portraits, character development, and souvenirs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.33-40
• /
• 2012

This paper proposes a method to implement biological early warning systems(BEWS). This system generates periodically data event using a monitoring daemon and it extracts the feature parameters from this data sets. The feature parameters are derived with 6 variables, x/y coordinates, distance, absolute distance, angle, and fractal dimension. Specially by using the fractal dimension theory, the proposed algorithm define the input features represent the organism characteristics in non-toxic or toxic environment. And to find a moderate algorithm for learning the extracted feature data, the system uses an extended learning algorithm(UChoo) popularly used in machine learning. And this algorithm includes a learning method with the extended data expression to overcome the BEWS environment which the feature sets added periodically by a monitoring daemon. In this algorithm, decision tree classifier define class distribution information using the weight parameter in the extended data expression. Experimental results show that the proposed BEWS is available for environmental toxicity detection.

• Journal of Internet Computing and Services
• /
• v.6 no.1
• /
• pp.85-93
• /
• 2005

This paper describes how to distribute high multi-dimensional facial expression data of vast quantity over a suitable space and produce facial expression animations by selecting expressions while animator navigates this space in real-time. We have constructed facial spaces by using about 2400 facial expression frames on this paper. These facial spaces are created by calculating of the shortest distance between two random expressions. The distance between two points In the space of expression, which is manifold space, is described approximately as following; When the linear distance of them is shorter than a decided value, if the two expressions are adjacent after defining the expression state vector of facial status using distance matrix expressing distance between two markers, this will be considered as the shortest distance (manifold distance) of the two expressions. Once the distance of those adjacent expressions was decided, We have taken a Floyd algorithm connecting these adjacent distances to yield the shortest distance of the two expressions. We have used CCA(Curvilinear Component Analysis) technique to visualize multi-dimensional spaces, the form of expressing space, into two dimensions. While the animators navigate this two dimensional spaces, they produce a facial animation by using user interface in real-time.

• The Journal of the Korea Contents Association
• /
• v.8 no.2
• /
• pp.33-40
• /
• 2008

In various manners, string pattern matching algorithm has been proven for prominence in speed of searching particular queries and keywords. Whereas, the existing algorithms are limited in terms of various pattern. In this paper, regular expression has been utilized to improve efficiency of pattern matching through efficient execution towards various pattern of queries including particular keywords. Such as this research would enable to search various harmful string pattern more efficiently, rather than matching simple keywords, which also implies excellent speed of string pattern matching compared to that of those existing algorism. In this research, the proposed string search engine generated from the LEX are more efficient than BM & AC algorithm for a string patterns search speed in cases of 1000 with more than patterns, but we have got similar results for the keywords pattern matching.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.25-30
• /
• 2013

Uplink multicarrier code-division multiple-access (MC-CDMA) with equal gain combining (EGC) over Nakagami fading channels is considered. An improved expression which is a feasible alternative for the bit error rate (BER) performance evaluation of MC-CDMA signals is proposed. Simulated annealing algorithm is employed to obtain the optimum value of the coefficients belonging to the proposed expression. Numerical examples show that the performance curves computed by the improved expression are in good agreement with the results obtained by the exact expression. Thus, the proposed expression can improve the accuracy of BER performance evaluation that has been realized by the approximate expression.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.139-152
• /
• 2002

Gene-shaving(Hastie et al, 2000) is a very useful method to identify a meaningful group of genes when the variation of expression is large. By shaving off the low-correlated genes with the leading principal component, the primary genes with the coherent expression pattern can be identified. Gene-shaving method works well If expression levels are varied enough, but it may not catch the meaningful cluster in low expression level or different expression time even with coherent patterns. The sliding window gene-shaving method which is to apply gene-shaving in each sliding window after hierarchical clustering is to compensate losing a meaningful set of genes whose variation is not large but distinct. The performance to identify expression patterns is compared for the simulated profile data by the different variance and expression level.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.363-366
• /
• 2005

In this paper, for detecting human faces under variations of lighting condition and facial expression, distance ranking feature and detection algorithm based on the feature are proposed. Distance ranking is the intensity ranking of a distance transformed image. Based on statistically consistent edge information, distance ranking is robust to lighting condition change. The proposed detection algorithm is a matching algorithm based on FFT and a solution of discretization problem in the sliding window methods. In experiments, face detection results in the situation of varying lighting condition, complex background, facial expression change and partial occlusion of face are shown

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.3
• /
• pp.232-239
• /
• 1992

In this paper, an analytical expression of the excess MSE of ITLMS(Individual Tap LMS) which results from the random fluctuation of the distance between the actual and optimal coefficients due to noisy gradient estimates, is derived. The expression reveals that the excess MSE of the ITLMS algorithm is smaller that that of the LMS algorithm. The performance of the algorithm from the computer simulation for a fading time-dispersive channel verifies the theoretical results.