• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.24 no.9
• /
• pp.716-723
• /
• 2014

Vibration measurement using image processing is a fully non-contact measurement method and has many application fields. The resolution of vibration data measured by image processing depends on the camera performance and is lower than that measured by accelerometers. This work discusses the method to increase resolution of vibration signal measured by image processing based on the image mosaic technique with a high-power lens. The working principle of resolution enhancement was explained theoretically and verified by several experiments. It was shown that the proposed method can measure vibrations of relatively large scale structures with increased resolutions.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.25 no.10
• /
• pp.1400-1407
• /
• 2001

The size distributions of electrospray droplets from the Taylor cone in cone-jet mode are directly measured by using a freezing method and a transmission electron microscope (TEM) image processing technique. These results are compared with the data obtained by an aerodynamic size spectrometer (TSI Aerosizer DSP). The use of glycerol seeded with NaI and a freezing method make it possible to sample droplets with their original sizes preserved. Since pictures of droplets are taken with TEM with very low vapor pressure of the solution, evaporation is suppressed by freezing. For liquid flow rates below 1 nl/sec, the measured droplet diameters by the TEM image processing technique and the aerosizer are in the range of 0.25 to 0.32 m add 0.3B to 0.40m, respectively. Comparing the TEM data with the aerosizer measurements, it has been revealed that the TEM image processing technique can afford more accurate values of droplet size distributions in the submicron range of 0.1 to 0.4m.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.23-27
• /
• 2006

This paper presents a feature selection technique based on distributional differences for efficient machine learning. Initial training data consists of data including many features and a target value. We classified them into positive and negative data based on the target value. We then divided the range of the feature values into 10 intervals and calculated the distribution of the intervals in each positive and negative data. Then, we selected the features and the intervals of the features for which the distributional differences are over a certain threshold. Using the selected intervals and features, we could obtain the reduced training data. In the experiments, we will show that the reduced training data can reduce the training time of the neural network by about 40%, and we can obtain more profit on simulated stock trading using the trained functions as well.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.182-186
• /
• 2008

RFID systems generate huge amount of data quickly. The data are associated with the locations and the timestamps and the containment relationships. It is requires to assure efficient queries and updates for product tracking and monitoring. We propose a clustering technique for fast query processing. Our study presents the state charts of temporal event flow and proposes the dependence trees with data association and uses them to cluster the linked events. Our experimental evaluation show the power of proposing clustering technique based on dependence tree.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.6
• /
• pp.891-897
• /
• 2022

In big data analysis, raw text data mostly exists in various unstructured data forms, so it becomes a structured data form that can be analyzed only after undergoing heuristic pre-processing and computer post-processing cleansing. Therefore, in this study, unnecessary elements are purified through pre-processing of the collected raw data in order to apply the wordcloud of R program, which is one of the text data analysis techniques, and stopwords are removed in the post-processing process. Then, a case study of wordcloud analysis was conducted, which calculates the frequency of occurrence of words and expresses words with high frequency as key issues. In this study, to improve the problems of the "nested stopword source code" method, which is the existing stopword processing method, using the word cloud technique of R, we propose the use of "general stopword corpus" and "user-defined stopword corpus" and conduct case analysis. The advantages and disadvantages of the proposed "unstructured data cleansing process model" are comparatively verified and presented, and the practical application of word cloud visualization analysis using the "proposed external corpus cleansing technique" is presented.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.247-254
• /
• 2020

The recent Internet environment is characterized by the explosion of certain types of data, as the data that people want is affected by certain issues. In this paper, we propose a load balancing technique that considers the data generation forms. The concept of this technique is to prioritize some type of data when it suddenly explodes. This is a technique to build an add-on middle box on a switch to monitor packets and give priority to a queue for load balancing. This technique worked when certain types of data exploded. SDN(Software Defined Networking) has the advantage of efficiently managing a number of network equipment. However, load balancing in the SDN environment has not been studied much. Applying the proposed load balancing technique in the SDN environment can save time and budget and easily implement our policies. When the proposed load balancing technique is applied to the SDN environment, it has been found that the techniques we want can be easily applied to the network systems, and that efficient data processing is possible when certain types of data explosion.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.67-83
• /
• 2008

In order to realize ubiquitous computing, it is essential to efficiently use the resources and the computing power of mobile devices. Among others, memory efficiency, energy efficiency, and processing efficiency are required in executing the softwares embedded in mobile devices. In this paper, query processing over XML data in a mobile device where resources are limited is addressed. In a device with limited amount of memory, the techniques of XML. stream query processing need to be employed to process queries over a large volume of XML data Recently, a technique Galled XFrag was proposed whereby XML data is fragmented with the hole-filler model and streamed in fragments for processing. With XFrag, query processing is possible in the mobile device with limited memory without reconstructing the XML data out of its fragment stream. With the hole-filler model, however, memory efficiency is not high because the additional information on holes and fillers needs to be stored. In this paper, we propose a new technique called XFLab whereby XML data is fragmented with the XML labeling scheme which is for representing the structural relationship in XML data, and streamed in fragments for processing. Through implementation and experiments, XML showed that our XFLab outperformed XFrag both in memory usage and processing time.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1375-1385
• /
• 1996

As there has been much demands for processing multimedia data, a storage manager for multimedia data makes much effects on system performance. Because the size of multimedia data is usually very large, disk I/O for the data consumes much time and causes the system performance to be decreased. Therefore, it makes a better effect on system performance that a multimedia data storage manager decreases its disk I/O by the buffer management of multimedia data. This paper proposes a buffer management technique which allocates the buffer to be equal to its corresponding segment which consists of physically continuous disk page set and is disk management unit for multimedia data in many multimedia data storage manager. As the size of buffer varies, it also proposes a buffer replacement policy which consider not only reference behavior of buffer but also buffer size The proposed multimedia data buffer management technique is implemented in KORED/STORM which is a storage manager for multimedia data.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.33-40
• /
• 2003

Data mining plays an important role in a knowledge discovery process and various algorithms of data mining can be selected for the specific purpose. Most of traditional hierachical clustering methode are suitable for processing small data sets, so they difficulties in handling large data sets because of limited resources and insufficient efficiency. In this study we propose a hybrid neural networks clustering technique, called PPC for Pre-Post Clustering that can be applied to large data sets and find unknown patterns. PPC combinds an artificial intelligence method, SOM and a statistical method, hierarchical clustering technique, and clusters data through two processes. In pre-clustering process, PPC digests large data sets using SOM. Then in post-clustering, PPC measures Similarity values according to cohesive distances which show inner features, and adjacent distances which show external distances between clusters. At last PPC clusters large data sets using the simularity values. Experiment with UCI repository data showed that PPC had better cohensive values than the other clustering techniques.