• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1998-2009
• /
• 1998

An effective algorithm for tracking rigid or non-rigid moving object(s) which segments local moving parts from image sequence in the presence of backgraound motion by camera movenment, predicts the direction of it, and tracks the object is proposed. It requires no camera calibration and no knowledge of the installed position of camera. In order to segment the moving object, feature points configuring the shape of moving object are firstly selected, feature flow field composed of motion vectors of the feature points is computed, and moving object(s) is (are) segmented by clustering the feature flow field in the multi-dimensional feature space. Also, we propose IRMAS, an efficient algorithm that finds the convex hull in order to cinstruct the shape of moving object(s) from clustered feature points. And, for the purpose of robjst tracking the objects whose movement characteristics bring about the abrupt change of moving trajectory, an improved order adaptive lattice structured linear predictor is used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.315-318
• /
• 2005

Recently, the advent of wireless communication and other handhold devices like Personal Digital Assistants and smart cards have made in implementation of cryptosystems a major issue. One important aspect of modern day ciphers is the scope for hardware sharing between the encryption and decryption algorithm. The cellular Automata which have been proposed as an alternative to linear feedback shift registers(LFSRs) can be programmed to perform the operations without using any dedicated hardware. But to generalize and analyze CA is not easy. In this paper, we characterizes uniform/hybird complemented group CA with rules 195/153/51 that divide the entire state space into smaller spaces of maximal equal lengths. This properties can be useful in constructing key agreement algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.1-8
• /
• 2009

In this paper, we deal an implementation of the software that produces sub-optimal solution of cutting-ironbar planning problem using dynamic programming. Generally, it is required to design an optimization algorithm to accept the practical requirements of cutting ironbar manufacturing. But, this problem is a multiple-sized 1-dimensional cutting stock problem and Linear Programming approaches to get the optimal solution is difficult to be applied due to the problem of explosive computation and memory limitation. In order to overcome this problem, we reform the problem for applying Dynamic Programming and propose a cutting-ironbar planning algorithm searching the sub-optimal solution in the space of fixed amount of combinated columns by using heuristics. Then, we design a graphic user interfaces and screen displays to be operated conveniently in the industry workplace and implement the software using open-source GUI library toolkit, GTK+.

• Tunnel and Underground Space
• /
• v.30 no.6
• /
• pp.540-550
• /
• 2020

Machine learning has been actively used in the field of automation due to the development and establishment of AI technology. The important thing in utilizing machine learning is that appropriate algorithms exist depending on data characteristics, and it is needed to analysis the datasets for applying machine learning techniques. In this study, advance rate is predicted using geotechnical and machine data of TBM tunnel section passing through the soil ground below the stream. Although there were no problems of application of statistical technology in the linear regression model, the coefficient of determination was 0.76. While, the ensemble model and support vector machine showed the predicted performance of 0.88 or higher. it is indicating that the model suitable for predicting advance rate of the EPB Shield TBM was the support vector machine in the analyzed dataset. As a result, it is judged that the suitability of the prediction model using data including mechanical data and ground information is high. In addition, research is needed to increase the diversity of ground conditions and the amount of data.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.12
• /
• pp.1150-1158
• /
• 2010

In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problem. First, in preprocessing part, we use a CCD camera to obtain a picture frame in real-time. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. We use an AdaBoost algorithm proposed by Viola and Jones, which is exploited for the detection of facial image area between face and non-facial image area. As the feature extraction algorithm, PCA method is used. In this study, the PCA method, which is a feature extraction algorithm, is used to carry out the dimension reduction of facial image area formed by high-dimensional information. Secondly, we use pRBFNNs to identify the ID by recognizing unique pattern of each person. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. Coefficients of connection weight identified with back-propagation using gradient descent method. The output of pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of the Particle Swarm Optimization. The proposed pRBFNNs are applied to real-time face recognition system and then demonstrated from the viewpoint of output performance and recognition rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.717-725
• /
• 2000

Within the last several years, there has been a large number of algorithms developed for face recognition. The majority of these algorithms have been view- and projection-based algorithms. Our definition of projection is not restricted to projecting the image onto an orthogonal basis the definition is expansive and includes a general class of linear transformation of the image pixel values. The class includes correlation, principal component analysis, clustering, gray scale projection, and matching pursuit filters. In this paper, we perform a detailed analysis of this class of algorithms by evaluating them on the FERET database of facial images. In our experiments, a projection-based algorithms consists of three steps. The first step is done off-line and determines the new basis for the images. The bases is either set by the algorithm designer or is learned from a training set. The last two steps are on-line and perform the recognition. The second step projects an image onto the new basis and the third step recognizes a face in an with a nearest neighbor classifier. The classification is performed in the projection space. Most evaluation methods report algorithm performance on a single gallery. This does not fully capture algorithm performance. In our study, we construct set of independent galleries. This allows us to see how individual algorithm performance varies over different galleries. In addition, we report on the relative performance of the algorithms over the different galleries.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.749-754
• /
• 2011

In this study, we propose the design of optimized pRBFNNs-based face recognition system using two-dimensional Image and ASM algorithm. usually the existing 2 dimensional face recognition methods have the effects of the scale change of the image, position variation or the backgrounds of an image. In this paper, the face region information obtained from the detected face region is used for the compensation of these defects. In this paper, we use a CCD camera to obtain a picture frame directly. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. AdaBoost algorithm is used for the detection of face image between face and non-face image area. We can butt up personal profile by extracting the both face contour and shape using ASM(Active Shape Model) and then reduce dimension of image data using PCA. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of RBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to real-time face image database and then demonstrated from viewpoint of the output performance and recognition rate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.25-33
• /
• 2006

This paper proposed device-independent color matching algorithm based on the 3D RGB lookup table (LUT) between mobile camera and mobile LCD (Liquid Crystal Display) to improve the color-fidelity. Proposed algorithm is composed of thee steps, which is device characterization, gamut mapping, 3D RGB-LUT design. First, the characterization of mobile LCD is executed using the sigmoidal function, different from conventional method such as GOG (Gain Offset Gamma) and S-curve modeling, based on the observation of electro-optical transfer function of mobile LCD. Next, mobile camera characterization is conducted by fitting the digital value of GretagColor chart captured under the daylight environment (D65) and tristimulus values (CIELAB) using the polynomial regression. However, the CIELAB values estimated by polynomial regression exceed the maximum boundary of the CIELAB color space. Therefore, these values are corrected by linear compression of the lightness and chroma. Finally, gamut mapping is used to overcome the gamut difference between mobile camera and moible LCD. To implement the real-time processing, 3D RGB-LUT is designed based on the 3D RGB-LUT and its performance is evaluated and compared with conventional method.

• Journal of Astronomy and Space Sciences
• /
• v.26 no.1
• /
• pp.75-88
• /
• 2009

The main purpose of the current research is to introduce the alternative algorithm of the non-recursive batch filter based on the unscented transformation in which the linearization process is unnecessary. The presented algorithm is applied to the orbit determination of a low earth orbiting satellite and compared its results with those of the well-known Bayesian batch least squares estimation and the iterative UKF smoother (IUKS). The system dynamic equations consist of the Earth's geo-potential, the atmospheric drag, solar radiation pressure and the lunar/solar gravitational perturbations. The range, azimuth and elevation angles of the satellite measured from ground stations are used for orbit determination. The characteristics of the non recursive unscented batch filter are analyzed for various aspects, including accuracy of the determined orbit, sensitivity to the initial uncertainty, measurement noise and stability performance in a realistic dynamic system and measurement model. As a result, under large non-linear conditions, the presented non-recursive batch filter yields more accurate results than the other batch filters about 5% for initial uncertainty test and 12% for measurement noise test. Moreover, the presented filter exhibits better convergence reliability than the Bayesian least squares. Hence, it is concluded that the non-recursive batch filter based on the unscented transformation is effectively applicable for highly nonlinear batch estimation problems.

• Tunnel and Underground Space
• /
• v.20 no.2
• /
• pp.97-104
• /
• 2010

The materials failure relation $\ddot{\Omega}=A{(\dot{\Omega})}^\alpha$ where $\Omega$ is a measurable quantity such as displacement and the dot superscript is the time derivative, may be used to analyze the accelerating creep of materials. Coefficients, A and $\alpha$, are determined by fitting given data sets. In this study, it is tried to predict the failure time of tunnel using the materials failure relation. Four fitting techniques of applying the materials failure relation are attempted to forecast a failure time. Log velocity versus log acceleration technique, log time versus log velocity technique, inverse velocity technique are based on the linear least squares fits and non-linear least squares technique utilizes the Levenberg-Marquardt algorithm. Since the log velocity versus log acceleration technique utilizes a logarithmic representation of the materials failure relation, it indicates the suitability of the materials failure relation applied to predict a failure time of tunnel. A linear correlation between log velocity and log acceleration appears satisfactory(R=0.84) and this represents that the materials failure relation is a suitable model for predicting a failure time of tunnel. Through comparing the real failure time of tunnel with the predicted failure times from four curve fittings, it is shown that the log time versus log velocity technique results in the best prediction.