• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.426-440
• /
• 2016

Developed countries have already applied variable Intelligent Transportation System (ITS) technologies and have solved many transportation problems. Researchers also expect that ITS solutions can solve the transportation problems of Korean roads, when they are applied to Korean roads. However, since the existing ITS solutions applied in other countries are used for Korean roads without calibration, they will incur unexpected problems and high cost maintenance costs. In this paper, to solve the above problem, we propose the Korean Highway Traffic Analysis tool (KHTA). It not only analyzes all highway information in Korea, but also simulates the ITS algorithm implemented by traffic developers for the Korean highway environment. To test the stability, applicability and efficiency of the KHTA, we developed and analyzed the result of the ramp metering algorithm. The results show that the total travel time was reduced by 5 minutes compared to that without ramp metering, and traffic congestion was decreased. Thus, we confirmed that the KHTA can simulate ITS systems and can analyze the traffic environment in Korean highway. We expect that this tool would be very helpful to develop and analyze ITS systems in Korea.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.1
• /
• pp.56-63
• /
• 2016

In this study, we introduce a design of Fuzzy RBFNNs-based digit recognition system using the incremental-PCA in order to recognize the handwritten digits. The Principal Component Analysis (PCA) is a widely-adopted dimensional reduction algorithm, but it needs high computing overhead for feature extraction in case of using high dimensional images or a large amount of training data. To alleviate such problem, the incremental-PCA is proposed for the computationally efficient processing as well as the incremental learning of high dimensional data in the feature extraction stage. The architecture of Fuzzy Radial Basis Function Neural Networks (RBFNN) consists of three functional modules such as condition, conclusion, and inference part. In the condition part, the input space is partitioned with the use of fuzzy clustering realized by means of the Fuzzy C-Means (FCM) algorithm. Also, it is used instead of gaussian function to consider the characteristic of input data. In the conclusion part, connection weights are used as the extended diverse types in polynomial expression such as constant, linear, quadratic and modified quadratic. Experimental results conducted on the benchmarking MNIST handwritten digit database demonstrate the effectiveness and efficiency of the proposed digit recognition system when compared with other studies.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.4
• /
• pp.97-110
• /
• 2007

A laser scanning technique has been attracting much attention as a new technology to acquire location information. This technique might be applicable to a wide range of areas, most notably in geomatics, due to its high accuracy of location and automation of high-density data acquisition. A alignment information extraction system on highway has been developed in this study by utilizing the advantages of the laser scanning technique. The system can accurately interpret the alignment information of highway and can be applied to actual works. To develop the alignment information extraction system on highway, an algorithm that can automatically separate a horizontal alignment into a straight line, a transition curve, and a circular curve was developed. It can increase its efficiency compared to the conventional methods. In addition, an algorithm that can automatically extract design elements of horizontal and vertical alignments of highway was developed and applied to an object highway. This yielded higher practicality with more accurate values compared to those from previous studies on the extraction of design elements of highway alignment. Furthermore, the extracted design elements were used to perform a virtual driving simulation on the object highway. Through this, data were provided for a visual judgment for judging visually whether the topography and structures were harmonized in a three-dimensional manner or not. The study also presents data that can serve as a basis to determine highway surface freezing sections and to analyze three-dimensional sight distance models. Through the establishment of a systematic database for diverse data on highway and the development of web-based operating programs, an efficient highway maintenance can be ensured and also they can provide important information to be used when estimating a highway safety in the future.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.465-482
• /
• 1997

In this paper, we have studied on cinstructing code-recognition shstem by neural network according to a image process taking the DOT classification code stamped on tire surface.It happened to a few problems that characters distorted in edge by diffused reflection and two adjacent characters take the same label,even very sen- sitive to illumination ofr recognition the stamped them on tire.Thus,this paper would propose the algorithm for tire code under being cinscious of these properties and prove the algorithm drrciency with a simulation.Also,we have suggerted the MCBP network composing of multi-linked recognizers of dffcient identify the DOT code being tire classification code.The MCBP network extracts the projection balue for classifying each character's rdgion after taking out the prjection of each chracter's region on X,Y axis,processes each chracters by taking 7$\times$8 normalization.We have improved error rate 3% through the MCBP network and post-process comparing the DOT code Database. This approach has a accomplished that learming time get's improvenent at 60% and recognition rate has become to 95% from 90% than BckPropagation with including post- processing it has attained greate rates of entire of tire recoggnition at 98%.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.495-508
• /
• 2004

Recently, in content-based music information retrieval systems, to enhance the response time of retrieving music data from large music database, some researches have adopted the indexing mechanism that extracts and indexes the representative melodies. The representative melody of music data must stand for the music itself and have strong possibility to use as users' input queries. However, since the previous researches have not considered the musical composition forms, they are not able to correctly catch the contrast, repetition and variation of motif in musical forms. In this paper, we use an index automatically constructed from representative melodies such like first melody, climax melodies and similarly repeated theme melodies. At first, we expand the clustering algorithm in order to extract similarly repeated theme melodies based on the musical composition forms. If the first melody and climax melodies are not included into the representative melodies of music by the clustering algorithm, we add them into representative melodies. We implemented a prototype system and did experiments on comparison the representative melody index with other melody indexes. Since, we are able to construct the representative melody index with the lower storage by 34％ than whole melody index, the response time can be decreased. Also, since we include first melody and climax melody which have the strong possibility to use as users' input query into representative melodies, we are able to get the more correct results against the various users' input queries than theme melody index with the cost of storage overhead of 20％.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.279-300
• /
• 2001

Data mining plays an important role in knowledge discovery process and usually various existing algorithms are selected for the specific purpose of the mining. Currently, data mining techniques are actively to the statistics, business, electronic commerce, biology, and medical area and currently numerous algorithms are being researched and developed for these applications. However, in a long run, only a few algorithms, which are well-suited to specific applications with excellent performance in large database, will survive. So it is reasonable to focus our effort on those selected algorithms in the future. This paper classifies about 30 existing algorithms into 7 categories - association rule, clustering, neural network, decision tree, genetic algorithm, memory-based reasoning, and bayesian network. First of all, this work analyzes systematic hierarchy and characteristics of algorithms and we present 14 criteria for classifying the algorithms and the results based on this criteria. Finally, we propose the best algorithms among some comparable algorithms with different features and performances. The result of this paper can be used as a guideline for data mining researches as well as field applications of data mining.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.287-296
• /
• 2003

There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1982-1987
• /
• 2011

In this study, we proposed a new method that can estimate viscosity curves of unknown samples or high viscous resins like LFT(Long Fiber Thermoplastics). First, we built the system that could detect the pressure of melt during filling the cavity in a mold. It consists of both pressure sensors which are installed in a mold and the Kit which can convert analog signal to digital signal. The kit measures the melt pressure in mold cavity. We could also simulate the cavity pressure during filling process with commercialized CAE softwares(ex, Moldflow). If the viscosity data in CAE Database were correct, the simulated pressure profile coincided with the measured one. According to our proposed algorithm, we obtained correct viscosity data by iterating the process of comparing the simulated profile with the measured one until both coincided each other. In order to verify this algorithm, we selected well-defined PP resin and concluded that the experimental profile comply with the CAE profile. We could also estimate the optimized viscosity curves for PP-LFT by applying our method.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.864-876
• /
• 2000

This paper proposes a new scene boundary detection scheme for the MPEG System stream using MPEG Audio information and proves its usefulness by extensive experiments. A scene boundary has a characteristic that the audio as well as video information are changed rapidly. This paper first classifies this scene boundary into three cases ; Radical, Gradual, Micro Changes, with respect to the audio changes. The Radical change has a large-scale changing of decibel value and pitch value at a scene boundary, the Gradual change shows the long-time transition of decibel and pitch values from max to min or vice versa, and the Micro change displays a some change of pitch or frequency distribution without decibel changes. Upon this analysis, a new scene change detection algorithm detecting these three cases is proposed in which a progressive window with a time line is used to trace the changes in the audio information. Some experiments with various movies show that proposed algorithm could produce a high detection ratio for Radical change that is the most popular scene change in the movies, while producing a moderate detection ratio for Gradual and Micro changes. The proposed scene boundary detection scheme could be used to build a database for visual information like MPEG System stream.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.732-741
• /
• 2001

In the relational database systems the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed 개 reduce the execution time Multiple hash join algorithm using allocation tree is one of the most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. This delay problem was solved by using the concept of synchronization of page execution time with we had proposed In this paper the effects of the performance improvements in each node of the allocation tree are extended to the whole allocation tree and the performance evaluation about that is processed. In addition we propose an efficient algorithm for multiple hash joins in limited number of processor environments according to the relationship between the number of input relations in the allocation tree and the number of processors allocated to the tree. Finally. we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.