• The Journal of Society for e-Business Studies
• /
• v.23 no.2
• /
• pp.33-47
• /
• 2018

City gas pipelines are buried underground. Because of this, pipeline is hard to manage, and can be easily damaged. This research proposes a real time prediction system that helps experts can make decision about pressure anomalies. The gas pipline pressure data of Jungbu City Gas Company, which is one of the domestic city gas suppliers, time variables and environment variables are analysed. In this research, regression models that predicts pipeline pressure in minutes are proposed. Random forest, support vector regression (SVR), long-short term memory (LSTM) algorithms are used to build pressure prediction models. A comparison of pressure prediction models' preformances shows that the LSTM model was the best. LSTM model for Asan-si have root mean square error (RMSE) 0.011, mean absolute percentage error (MAPE) 0.494. LSTM model for Cheonan-si have RMSE 0.015, MAPE 0.668.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.1
• /
• pp.79-85
• /
• 2010

In video standards such as H.264/AVC, motion estimation (ME) / compensation (MC) is regarded as a vital component in a video coder as it consumes a large amount of computation resources. The full search technique, which is used in general video codecs, gives the highest visual quality but also has the problem of significant computational load. To solve this problem, many fast algorithm has benn proposed. Among them, NPDS show that can maintain its video quality very close to the full search technique while achieving computation reduction by using a halfway-stop technique in the calculation of block distortion measure. In this paper, we proposed algorithm by determining minimum distortion measure with predictive motion vector and using the new search order. As the result, we can check that the proposed algorithm reduces the computational load 95% in average compared to the full search, respectively with the PSNR lost about 0.04dB.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.5
• /
• pp.361-367
• /
• 2016

The intruder detection system using digital PIR sensor has the problem that it can't recognize human correctly. In this paper, we suggest a new intruder detection system based on analog PIR sensor to get around the drawbacks of the digital PIR sensor. The analog type PIR sensor emits the voltage output at various levels whereas the output of the digitial PIR sensor is binary. The signal captured using analog PIR sensor is sampled, and its frequency feature is extracted using FFT or MFCC. The extracted features are used for the input of neural networks. After neural network is trained using various human and pet's intrusion data, it is used for classifying human and pet in the intrusion situation.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.84-90
• /
• 2010

DBMS is used for a range of applications from data warehousing through on-line transaction processing. As a result of this demand, DBMS has continued to grow in terms of its size. This growth invokes the most important issue of manually tuning the performance of DBMS. The DBMS tuning should be adaptive to the type of the workload put upon it. But, identifying workloads in mixed database applications might be quite difficult. Therefore, a method is necessary for identifying workloads in the mixed database environment. In this paper, we propose a SVM workload classifier to automatically identify a DBMS workload. Database workloads are collected in TPC-C and TPC-W benchmark while changing the resource parameters. Parameters for SVM workload classifier, C and kernel parameter, were chosen experimentally. The experiments revealed that the accuracy of the proposed SVM workload classifier is about 9% higher than that of Decision tree, Naive Bayes, Multilayer perceptron and K-NN classifier.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.63-72
• /
• 2007

Recently, as recognizing the risk about the infection of an infectious wastes, the problems about the management and treatment of the infectious wastes stand out socially. In this paper, as being possible monitoring whole processing from the origin of the infectious waste to the processing plant, using the RFID which is the kernel technology of the next generation, we tried to solve the second infection problem by inefficient treatment of the infectious wastes. Through the research suggesting in this paper, as storing and monitoring the procedural business articles and the problem about miss-writing and input error being found in management system like documentary writing by the existing manager and computation input by the web application, we can understand the management state, immediately. And the Bio information for the personal authentication is carried out through storing the feature vector calculation by the PCA algorithm, into the tag. It suggested more systematic and safer management plan than previous thing, as giving attention about the wastes to manager.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.262-271
• /
• 2004

There are channel errors when video data are transmitted between encoder and decoder. These channel errors would make decoded image incorrect, so it is very important to detect and recover channel errors. This paper proposes a method of error detection and recovery by hiding specific information into video bitstream using fragile watermark and checking it later. The proposed method requires no additional bits into compressed bitstream since it embeds a user-specific data pattern in the least significant bits of LEVELs in VLC codewords. The decoder can extract the information to check whether the received bitstream has an error or not. We also propose to use this method to embed essential data such as motion vectors that can be used for error recovery. The proposed method can detect corrupted MBs that usually escape the conventional syntax-based error detection scheme. This proposed method is quite simple and of low complexity. So the method can be applied to multimedia communication system in low bitrate wireless channel.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.178-185
• /
• 2005

This paper presents a new music identification method using probabilistic and dynamic characteristics of melody. The propo3ed method uses pitch and MFCC parameters as feature vectors for the characteristics of music notes and represents melody pattern by pitch histogram and temporal sequence of codeword indices. We also propose a new pattern matching method for the hybrid method. We have tested the proposed algorithm in small (drama OST) and broad (1.005 popular songs) search spaces. The experimental results on search areas of OST and 1,005 popular songs showed better performance of the proposed method over conventional methods. We achieved the performance improvement of average $9.9\%$ and $10.2\%$ in error reduction rate on each search area.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.5
• /
• pp.13-19
• /
• 2000

The blind segmentation method, which segments input speech data into recognition unit without any prior knowledge, plays an important role in continuous speech recognition system and corpus generation. As no prior knowledge is required, this method is rather simple to implement, but in general, it suffers from bad performance when compared to the knowledge-based segmentation method. In this paper, we introduce a method to improve the performance of a blind segmentation of Korean continuous speech by postprocessing the segment boundaries obtained from the blind segmentation. In the preprocessing stage, the candidate boundaries are extracted by a clustering technique based on the GLR(generalized likelihood ratio) distance measure. In the postprocessing stage, the final phoneme boundaries are selected from the candidates by utilizing a simple a priori knowledge on the syllabic structure of Korean, i.e., the maximum number of phonemes between any consecutive nuclei is limited. The experimental result was rather promising : the proposed method yields 25% reduction of insertion error rate compared that of the blind segmentation alone.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.89-97
• /
• 2008

In this paper, we present a method for the enhancement of marker detection correctness and marker recognition speed by using artificial neural network. Contours of objects are extracted from the input image. They are approximated to a list of line segments. Quadrangles are found with the geometrical features of the approximated line segments. They are normalized into exact squares by using the warping technique and scale transformation. Feature vectors are extracted from the square image by using principal component analysis. Artincial neural network is used to checks if the square image is a marker image or a non-marker image. After that, the type of marker is recognized by using an artificial neural network. Experimental results show that the proposed method enhances the correctness of the marker detection and recognition.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.328-333
• /
• 2003

NGE (Nested Generalized Exemplars) proposed by Salzberg improved the storage requirement and classification rate of the Memory Based Reasoning. It constructs hyperrectangles during training and performs classification tasks. It worked not bad in many area, however, the major drawback of NGE is constructing hyperrectangles because its hyperrectangle is extended so as to cover the error data and the way of maintaining the feature weight vector. We proposed the OH (Optimizing Hyperrectangle) algorithm which use the feature weight vectors and the ED(Exemplar Densimeter) to optimize resulting Hyperrectangles. The proposed algorithm, as well as the EACH, required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the EACH. Also, by reducing the number of stored patterns, it showed excellent results in terms of classification when we compare it to the k-NN and the EACH.