• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.147-156
• /
• 2011

This paper proposes a 3-stage (preprocessing, feature extraction, and classification) fault detection and classification algorithm for induction motors. In the first stage, a low-pass filter is used to remove noise components in the fault signal. In the second stage, a discrete cosine transform (DCT) and a statistical method are used to extract features of the fault signal. Finally, a back propagation neural network (BPNN) method is applied to classify the fault signal. To evaluate the performance of the proposed algorithm, we used one second long normal/abnormal vibration signals of an induction motor sampled at 8kHz. Experimental results showed that the proposed algorithm achieves about 100% accuracy in fault classification, and it provides 50% improved accuracy when compared to the existing fault detection algorithm using a cross-covariance method. In a real-world data acquisition environment, unnecessary noise components are usually included to the real signal. Thus, we conducted an additional simulation to evaluate how well the proposed algorithm classifies the fault signals in a circumstance where a white Gaussian noise is inserted into the fault signals. The simulation results showed that the proposed algorithm achieves over 98% accuracy in fault classification. Moreover, we developed a testbed system including a TI's DSP (digital signal processor) to implement and verify the functionality of the proposed algorithm.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.21-32
• /
• 2015

Since spatio-temporal local features for video representation have become an important issue of modeless bottom-up approaches in action recognition, various methods for feature extraction and description have been proposed in many papers. In particular, BoF(bag of features) has been promised coherent recognition results. The most important part for BoF is how to represent dynamic information of actions in videos. Most of existing BoF methods consider the video as a spatio-temporal volume and describe neighboring 3D interest points as complex volumetric patches. To simplify these complex 3D methods, this paper proposes a novel method that builds BoF representation as a way to learn 2D interest points directly from video data. The basic idea of proposed method is to gather feature points not only from 2D xy spatial planes of traditional frames, but from the 2D time axis called spatio-temporal frame as well. Such spatial-temporal features are able to capture dynamic information from the action videos and are well-suited to recognize human actions without need of 3D extensions for the feature descriptors. The spatio-temporal BoF approach using SIFT and SURF feature descriptors obtains good recognition rates on a well-known actions recognition dataset. Compared with more sophisticated scheme of 3D based HoG/HoF descriptors, proposed method is easier to compute and simpler to understand.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.39-47
• /
• 2012

The opinion of user on a certain product is expressed in positive/negative sentiments for specific features of it. In some cases, they are expressed for a holistic part of homogeneous specific features, or expressed for product itself. Therefore, in the area of opinion mining, name of opinion features to be extracted are specific feature names, holonyms for theses specific features, and product names. However, when the opinion target is described with product name or holonym, sometimes it may not match feature name of opinion sentence to true opinion target intended by the reviewer. In this paper, we present a method to extract opinion targets from opinion sentences. Most importantly, we propose a method to extract true target from the feature names mismatched to a intended target. First, we extract candidate opinion pairs using dependency relation between words, and then select feature names frequently mismatched to opinion target. Each selected opinion feature name is replaced to a specific feature intended by the reviewer. Finally, in order to extract relevant opinion features from the whole candidate opinion pairs including modified opinion feature names, candidate opinion pairs are rearranged by the order of user's interest.

• The KIPS Transactions:PartB
• /
• v.17B no.5
• /
• pp.345-354
• /
• 2010

Visual tracking techniques for Augmented Reality are classified as either a marker tracking approach or a natural feature tracking approach. Marker-based tracking algorithms can be efficiently implemented sufficient to work in real-time on mobile devices. On the other hand, natural feature tracking methods require a lot of computationally expensive procedures. Most previous natural feature tracking methods include heavy feature extraction and pattern matching procedures for each of the input image frame. It is difficult to implement real-time augmented reality applications including the capability of natural feature tracking on low performance devices. The required computational time cost is also in proportion to the number of patterns to be matched. To speed up the natural feature tracking process, we propose a novel fast tracking method based on optical flow. We implemented the proposed method on mobile devices to run in real-time and be appropriately used with mobile augmented reality applications. Moreover, during tracking, we keep up the total number of feature points by inserting new feature points proportional to the number of vanished feature points. Experimental results showed that the proposed method reduces the computational cost and also stabilizes the camera pose estimation results.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.249-254
• /
• 2007

A mobile robot with various types of sensors and wireless camera is introduced. We show this mobile robot can detect objects well by combining the results of active sensors and image processing algorithm. First, to detect objects, active sensors such as infrared rays sensors and supersonic waves sensors are employed together and calculates the distance in real time between the object and the robot using sensor's output. The difference between the measured value and calculated value is less than 5%. We focus on how to detect a object region well using image processing algorithm because it gives robots the ability of working for human. This paper suggests effective visual detecting system for moving objects with specified color and motion information. The proposed method includes the object extraction and definition process which uses color transformation and AWUPC computation to decide the existence of moving object. Shape information and signature algorithm are used to segment the objects from background regardless of shape changes. We add weighing values to each results from sensors and the camera. Final results are combined to only one value which represents the probability of an object in the limited distance. Sensor fusion technique improves the detection rate at least 7% higher than the technique using individual sensor.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.83-93
• /
• 2013

Recently, the SURF algorithm, which is conjugated for object tracking system as part of many computer vision applications, is a well-known scale- and rotation-invariant feature detection algorithm. The SURF, due to its high computational complexity, there is essential to develop a hardware accelerator in order to be used on an IP in embedded environment. However, the SURF requires a huge local memory, causing many problems that increase the chip size and decrease the value of IP in ASIC and SoC system design. In this paper, we proposed a way to design a SURF algorithm in hardware with greatly reduced local memory by partitioning the algorithms into several Sub-IPs using external memory and a DMA. To justify validity of the proposed method, we developed an example of simplified object tracking algorithm. The execution speed of the hardware IP was about 31 frame/sec, the logic size was about 74Kgate in the 30nm technology with 81Kbytes local memory in the embedded system platform consisting of ARM Cortex-M0 processor, AMBA bus(AHB-lite and APB), DMA and a SDRAM controller. Hence, it can be used to the hardware IP of SoC Chip. If the image processing algorithm akin to SURF is applied to the method proposed in this paper, it is expected that it can implement an efficient hardware design for target application.

• Korean Journal of Food Science and Technology
• /
• v.20 no.2
• /
• pp.176-187
• /
• 1988

Volatile flavor components in the Chinese quince fruits were trapped by simultaneous steam distillation-extraction method, and these were fractionated into the neutral, the basic, the phenolic and the acidic fraction. In the identification of carboxylic acids, the acidic fraction was methylated with diazomethane. Volatile flavor components in these fractions were analyzed by the high-resolution GC and GC-MS equipped with a fused silica capillary column. The total of one hundred and forty-five compounds from the steam volatile concentrate of the Chinese quince fruits were identified: they were 3 aliphatic hydrocarbons, 1 cyclic hydrocarbon, 4 aromatic hydrocarbons, 9 terpene hydrocarbons, 17 alcohols, 3 terpene alcohols, 6 phenols, 21 aldehydes, 7 ketones, 28 esters, 27 acids, 3 furans, 2 thiazoles, 2 acetals, 3 lactones and 9 miscellaneous ones. The greater part of the components except for carboxylic acids were identified from the neutral fraction. The neutral fraction gave a much higher yield than others and was assumed to be indispensable for the reproduction of the aroma of the Chinese quince fruits in a sensory evaluation. According to the results of the GC-sniff evaluation, 1-hexanal, cis-3-hexenal, trans-2-hexenal, 2-methyl-2-hepten-6-one, 1-hexanol, cis-3-hexenol, trans, trans-2, 4-hexadienal and trans-2-hexenol were considered to be the key compounds of grassy odor. On the other hand, esters seemed to be the main constituents of a fruity aroma in the Chinese quince fruits.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.689-698
• /
• 2006

Pattern recognition is the study of how machines can observe the environment, learn to distinguish patterns of interest from their background, and make sound and reasonable decisions about the categories of the patterns. Color image consists of various color patterns. And most pattern recognition methods use the information of color which has been trained and extract the feature of the color. This thesis extracts adaptively specific color feature from images with several limited colors. Because the number of the color patterns is limited, the distribution of the color in the image is similar. But, when there are some noises and distortions in the image, its distribution can be various. Therefore we cannot extract specific color regions in the standard image that is well expressed in special color patterns to extract, and special color regions of the image to test. We suggest new method to reduce the error of recognition by extracting the specific color feature adaptively for images with the low distortion, and six test images with some degree of noises and distortion. We consequently found that proposed method shouws more accurate results than those of statistical pattern recognition.

• CRM연구
• /
• v.2 no.2
• /
• pp.53-70
• /
• 2009

Understanding consumer behavior based on the analysis of the customer data is one essential part of analytic CRM. To do this, the analytic skills for data extraction and data processing are required to users. As a user has various kinds of questions for the consumer data analysis, the user should use database language such as SQL. However, for the firm's user, to generate SQL statements is not easy because the accuracy of the query result is hugely influenced by the knowledge of work-site operation and the firm's database. This paper proposes a natural language based database search framework finding relevant database elements. Specifically, we describe how our TableRank method can understand the user's natural query language and provide proper relations and attributes of data records to the user. Through several experiments, it is supported that the TableRank provides accurate database elements related to the user's natural query. We also show that the close distance among relations in the database represents the high data connectivity which guarantees matching with a search query from a user.