• Journal of Digital Convergence
• /
• v.18 no.11
• /
• pp.259-266
• /
• 2020

Many developments have been steadily carried out by researchers with applying knowledge-based expert system or machine learning algorithms to the financial field. In particular, it is now common to perform knowledge based system trading in using stock prices. Recently, deep learning technologies have been applied to real fields of stock trading marketplace as GPU performance and large scaled data have been supported enough. Especially, LSTM has been tried to apply to stock price prediction because of its compatibility for time series data. In this paper, we implement stock price prediction using LSTM. In modeling of LSTM, we propose a fitness combination of model parameters and activation functions for best performance. Specifically, we propose suitable selection methods of initializers of weights and bias, regularizers to avoid over-fitting, activation functions and optimization methods. We also compare model performances according to the different selections of the above important modeling considering factors on the real-world stock price data of global major companies. Finally, our experimental work brings a fitness method of applying LSTM model to stock price prediction.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.609-616
• /
• 2017

In this paper, we propose an algorithm to obtain more stable and high recognition rate by using left and right rotation information of input image in order to obtain a stable recognition rate in face recognition. The proposed algorithm uses the facial image as the input information in the web camera environment to reduce the size of the image and normalize the information about the brightness and color to obtain the improved recognition rate. We apply Principal Component Analysis (PCA) to the detected candidate regions to obtain feature vectors and classify faces. Also, In order to reduce the error rate range of the recognition rate, a set of data with the left and right $45^{\circ}$ rotation information is constructed considering the directionality of the input face image, and each feature vector is obtained with PCA. In order to obtain a stable recognition rate with the obtained feature vector, it is after scattered in the eigenspace and the final face is recognized by comparing euclidean distant distances to each feature. The PCA-based feature vector is low-dimensional data, but there is no problem in expressing the face, and the recognition speed can be fast because of the small amount of calculation. The method proposed in this paper can improve the safety and accuracy of recognition and recognition rate faster than other algorithms, and can be used for real-time recognition system.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.72-78
• /
• 2000

In this study, we propose a model verification algorithm based on DCT and neural network for ATM security system. We construct database about facial images after capturing thirty persons facial images in the same lumination and distance. To simulate model verification, we capture four learning images and test images per a man. After detecting edge in facial images, we detect a characteristic area of square shape using edge distribution in facial images. Characteristic area contains eye bows, eyes, nose, mouth and cheek. We extract characteristic vectors to calculate diagonally coefficients sum after obtaining DCT coefficients about characteristic area. Characteristic vectors is normalized between +1 and -1, and then used for input vectors of neural networks. Not considering passwords, simulations results showed 100% verification rate when facial images were learned and 92% verification rate when facial images weren't learned. But considering passwords, the proposed algorithm showed 100% verification rate in case of two simulations.

• Journal of Digital Convergence
• /
• v.13 no.2
• /
• pp.159-175
• /
• 2015

The two-dimensional QR code has advantages such as directional nature, enough data storage capacity, ability of error correction, and ability of data restoration. There are two major issues like speed and correctiveness of recognition in the two-dimensional QR code. Therefore, this paper proposes a morphology-based algorithm of detecting the interest region of a barcode. Our research contents can be summarized as follows. First, the interest region of a barcode image was detected by close operations in morphology. Second, after that, the boundary of the barcode are detected by intersecting four cross line outside in a code. Three, the projected image is then rectified into a two-dimensional barcode in a square shape by the reverse-perspective transform. In result, it shows that our detection and recognition rates for the barcode image is also 97.20% and 94.80%, respectively and that outperforms than previous methods in various illumination and distorted image environments.

• Journal of Bio-Environment Control
• /
• v.30 no.1
• /
• pp.19-26
• /
• 2021

In this study, analysis was performed to identify three greenhouses located in the same area using principal component analysis (PCA) and linear discrimination analysis (LDA). The environmental data in the greenhouse were from 3 farms in the same area, and the values collected at 1 hour intervals for a total of 4 weeks from April 1 to April 28 were used. Before analyzing the data, it was pre-processed to normalize the data, and the analysis was performed by dividing it into 80% of the training data and 20% of the test data. As a result of PCA and LDA analysis, it was found that PCA classification accuracy was 57.51% and LDA classification was 67.06%, indicating that it can be classified by greenhouse. Based on the farmhouse data classified in advance, the data of the new environment can be classified into specific groups to determine the tendency of the data. Such data is judged to be a way to increase the utilization of data by facilitating identification.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.9
• /
• pp.643-650
• /
• 2013

In this paper, we propose a novel method for enhancing the detection speed and rate by reducing the computation in Hough Circle Transform on real-time iris detection of smartphone camera image. First of all, we find a face and eyes from input image to detect iris and normalize the iris region into fixed size to prevent variation of size for iris region according to distance from camera lens. Moreover, we carry out histogram equalization to get regular image in bright and dark illumination from smartphone and calculate minimal iris range that contains iris with the distance between corner of the left eye and corner of the right eye on the image. Subsequently, we can minimize the computation of iris detection by applying Hough Circle Transform on the range including the iris only. The experiment is carried out in two case with bright and dark illumination. Our proposed method represents that detection speed is 40% faster and detection rate is 14% better than existing methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.6
• /
• pp.81-89
• /
• 2004

In this paper, we compare face recognition rate by PCA algorithm using distance change and embedded data being input left side and right side image in stereo images. The proposed method detects face region from RGB color space to YCbCr color space. Also, The extracted face image's scale up/down according to distance change and extracts more robust face region. The proposed method through an experiment could establish standard distance (100cm) in distance about 30∼200cm, and get 99.05% (100cm) as an average recognition result by scale change. The definition of super state is specification region in normalized size (92${\times}$112), and the embedded data extracts the inner factor of defined super state, achieved face recognition through PCA algorithm. The orignal images can receive specification data in limited image's size (92${\times}$112) because embedded data to do learning not that do all learning, in image of 92${\times}$112 size averagely 99.05%, shows face recognition rate of test 1 99.05%, test 2 98.93%, test 3 98.54%, test 4 97.85%. Therefore, the proposed method through an experiment showed that if apply distance change rate could get high recognition rate, and the processing speed improved as well as reduce face information.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.37-45
• /
• 2013

Context dependent fusion (CDF) is a fusion algorithm that combines multiple outputs from different classifiers to achieve better performance. CDF tries to divide the problem context into several homogeneous sub-contexts and to fuse data locally with respect to each sub-context. CDF showed better performance than existing methods, however, it is sensitive to noise due to the large number of parameters optimized and the innate linearity limits the application of CDF. In this paper, a variant of CDF using support vector machines (SVMs) for fusion and kernel principal component analysis (K-PCA) for context extraction is proposed to solve the problems in CDF, named CDF-SVM. Kernel PCA can shape irregular clusters including elliptical ones through the non-linear kernel transformation and SVM can draw a non-linear decision boundary. Regularization terms is also included in the objective function of CDF-SVM to mitigate the noise sensitivity in CDF. CDF-SVM showed better performance than CDF and its variants, which is demonstrated through the experiments with a landmine data set.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.9
• /
• pp.1287-1292
• /
• 2010

In this paper, a hybrid technique is presented. First, the isochromatic fringe data of a given set of points are calculated by the finite element method and are used as input data in complex variable formulations. Then the numerical model of the specimen with a central inclined crack is transformed from the physical plane to the complex plane by conformal mapping. The stress field is analyzed and the mixed-mode stress intensity factors are calculated for this complex plane. The stress intensity factors are calculated by the finite element method as well as by a theoretical method and compared with each other. In order to conveniently compare these values with each other, both actual and regenerated photoelastic fringe patterns are multiplied by a factor of two and sharpened by digital image processing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.573-580
• /
• 2005

In this paper, we propose an emotion recognition using static and dynamic facial images to effectively design human interface. The proposed method is constructed by HMM(Hidden Markov Model), PCA(Principal Component) and wavelet transform. Facial database consists of six basic human emotions including happiness, sadness, anger, surprise, fear and dislike which have been known as common emotions regardless of nation and culture. Emotion recognition in the static images is performed by using the discrete wavelet. Here, the feature vectors are extracted by using PCA. Emotion recognition in the dynamic images is performed by using the wavelet transform and PCA. And then, those are modeled by the HMM. Finally, we obtained better performance result from merging the recognition results for the static images and dynamic images.