• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.365-372
• /
• 2005

Generally, In a application program the core part for parallel processing is a loop. therefore exist data dependencies between the array index variables of a loop. The data dependence relations between statements which from variable or constant dependence distance are specially complex. Therefore extracting parallelism for those statements at compile time is very difficult. in this paper, among the proposed methods of extracting parallelism, analysis the unimodular method and non-unimodular method and grasping the merits and demerits of them. hereafter, this method will go far toward solving the effectively extracting parallelism of the loop.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.201-204
• /
• 2002

Kansei design knowledge acquisition stage is a crucial stage in kansei designing process and kansei engineering (KE) methodology. In kansei engineering methodology, it is essential to extract design knowledge or rules on relationships between customer's kansei and product design element. We attempt to construct a more powerful melted for extracting the design rules from kansei expremental data. We constucted a kansei experiment concerning color kansei evaluation, and analyzed the sane data by both conventional quantification theory type I and rough set theory. Finally, we compared the effectiveness of both methods for extracting rules and examined the extensions of rough set theory in kansei engineering.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.147-159
• /
• 1994

The performance of the improvement method of spatial resolution for satellite images based on the generalized inverse matrix is superior to the conventional methods. But, this method calculates the coefficient values for extracting the spatial information from the relation between a small pixel and large pixels. Accordingly it has the problem of remaining the blocky patterns at the result image. In this paper, a new generalized inverse matrix method is proposed which is different in the calculation method of coefficient values for extracting the spatial information. In this proposed metod, it calculates the coefficient values for extracting the spatial information from the relation between a small pixel and small pixels. Consequently it can improve the spatial resolution more efficiently without remaining the blocky patterns at the result image. The effectiveness of the proposed method is varified by simulation experiments with real TM image data.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.1
• /
• pp.93-103
• /
• 2005

Since the most program execution time is consumed in a loop structure, extracting parallelism from sequential loop programs is critical for the faster program execution. Conventional studies for extracting the parallelism are focused mostly on a uniform data dependence distance. In this paper, we proposed data dependency elimination method for a nested loop and extended data dependency elimination method to extract parallelism from the loop with procedure calls. The data dependency elimination method and the extended data dependency elimination method can be applied to uniform and non-uniform data dependency distance. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithms are very effective.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.8
• /
• pp.281-286
• /
• 2018

With recent increase in complexity and variety of information and massively available information, interest in and necessity of ontology has been on the rise as a method of extracting a meaningful search result from massive data. Although there have been proposed many methods of extracting the ontology from a given text of a natural language, the extraction based on most of the current methods is not consistent with the structure of the ontology. In this paper, we propose a method of automatically creating ontology by distinguishing a term needed for establishing the ontology from a text given in a specific domain and extracting various relationships between the terms based on the pattern-based method. To extract the relationship between the terms, there is proposed a method of reducing the size of a searching space by taking a matching set of patterns into account and connecting a join-set concept and a pattern array. The result is that this method reduces the size of the search space by 50-95% without removing any useful patterns from the search space.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.5
• /
• pp.575-583
• /
• 2009

Various algorithms and methods, related to preprocessing of LiDAR data, are being developed and proposed. These methods are two ways, one of them is to use the regular form such as DSM or the image converted from raw LiDAR data, and the other is to use raw LiDAR data directly. The image processing method is one of representative method for the regular grid form data. This method is easy to apply to a numerical analysis technique and has an advantage of modeling and noise elimination through smoothing, but it lose the information during the data conversion. This study apply the image processing method to the irregular raw LiDAR data directly for the extracting ground information with minimized information loss and evaluate the extracting accuracy of ground information.

• Journal of Korean Society for Geospatial Information Science
• /
• v.23 no.3
• /
• pp.85-93
• /
• 2015

This paper mainly introduces the methods of extracting landslide information using ALOS(Advanced Land Observing Satellite) images and GIS(Geographical Information System) technology. In this study, we classified images using three different methods which are the unsupervised the supervised and the PCA(Principal Components Analysis) for extracting landslide information based on characteristics of ALOS image. From the image classification results, we found out that the quality of classified image extracted with PCA supervised method was superior than the other images extracted with the other methods. But the accuracy of landslide information extracted from this image classification was still very low as the pixels were very similar between the landslide and safety regions. It means that it is really difficult to distinguish those areas with an image classification method alone because the values of pixels between the landslide and other areas were similar, particularly in a region where the landslide and other areas coexist. To solve this problem, we used the LSM(Landslide Susceptibility Map) created with ArcView software through weighted overlay GIS method in the areas. Finally, the developed LSM was applied to the image classification process using the ALOS images. The accuracy of the extracted landslide information was improved after adopting the PCA and LSM methods. Finally, we found that the landslide region in the study area can be calculated and the accuracy can also be improved with the LSM and PCA image classification methods using GIS tools.

• Journal of Mechanical Science and Technology
• /
• v.17 no.2
• /
• pp.197-206
• /
• 2003

It is intended to retrieve the time history of displacement from measured acceleration signal. In this study, the word retrieving means reconstructing the time history of original displacement signal from already measured acceleration signal not just extracting various information using relevant signal processing techniques. Unlike extracting required information from the signal, there are not many options to apply to retrieve the time history of displacement signal, once the acceleration signal is measured and recorded with given sampling rate. There are two methods, in general, to convert measured acceleration signal into displacement signal. One is directly integrating the acceleration signal in time domain. The other is dividing the Fourier transformed acceleration signal by the scale factor of - $\omega$$^2$and taking the inverse Fourier transform of it. It turned out both the methods produced a significant amount of errors depending on the sampling resolution in time and frequency domain when digitizing the acceleration signals. A simple and effective way to convert the time history of acceleration signal into the time history of displacement signal without significant errors is studied here with the analysis on the errors involved in the conversion process.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.835-838
• /
• 2000

Popular methods for extracting a text region in video images are in general based on analysis of a whole image such as merge and split method, and comparison of two frames. Thus, they take long computing time due to the use of a whole image. Therefore, this paper suggests the faster method of extracting a text region without processing a whole image. The proposed method uses line sampling methods, FFT and neural networks in order to extract texts in real time. In general, text areas are found in the higher frequency domain, thus, can be characterized using FFT The candidate text areas can be thus found by applying the higher frequency characteristics to neural network. Therefore, the final text area is extracted by verifying the candidate areas. Experimental results show a perfect candidate extraction rate and about 92% text extraction rate. The strength of the proposed algorithm is its simplicity, real-time processing by not processing the entire image, and fast skipping of the images that do not contain a text.

• Journal of Korea Multimedia Society
• /
• v.24 no.4
• /
• pp.550-557
• /
• 2021

Image steganalysis is a technique for detecting images with steganographic algorithms applied, called stego images. With state-of-the-art CNN-based steganalysis methods, we can detect stego images with high accuracy, but it is not possible to know which steganographic algorithm is used. Identifying stego images is essential for extracting embedded data. In this paper, as the first step for extracting data from stego images, we propose a hierarchical CNN structure for senary classification of steganographic algorithms. The hierarchical CNN structure consists of multiple CNN networks which are trained to classify each steganographic algorithm and performs binary or ternary classification. Thus, it classifies multiple steganogrphic algorithms hierarchically and stepwise, rather than classifying them at the same time. In experiments of comparing with several conventional methods, including those of classifying multiple steganographic algorithms at the same time, it is verified that using the hierarchical CNN structure can greatly improve the classification accuracy.