• Korean Journal of Remote Sensing
• /
• v.34 no.3
• /
• pp.481-494
• /
• 2018

The accurate radiative transfer model simulation is essential for an accurate ozone profile retrieval using optimal estimation from backscattered ultraviolet (BUV) measurement. The input parameters of the radiative transfer model are the main factors that determine the model accuracy. In particular, meteorological parameters such as temperature and surface pressure have a direct effect on simulating radiation spectrum as a component for calculating ozone absorption cross section and Rayleigh scattering. Hence, a sensitivity of UV ozone profile retrievals to these parameters has been investigated using radiative transfer model. The surface pressure shows an average error within 100 hPa in the daily / monthly climatological data based on the numerical weather prediction model, and the calculated ozone retrieval error is less than 0.2 DU for each layer. On the other hand, the temperature shows an error of 1-7K depending on the observation station and altitude for the same daily / monthly climatological data, and the calculated ozone retrieval error is about 4 DU for each layer. These results can help to understand the obtained vertical ozone information from satellite. In addition, they are expected to be used effectively in selecting the meteorological input data and establishing the system design direction in the process of applying the algorithm to satellite operation.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.11-19
• /
• 2008

Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

• Journal of Korean Society for Atmospheric Environment
• /
• v.23 no.1
• /
• pp.97-109
• /
• 2007

Vertical distribution and optical properties of atmospheric aerosols above the Korean peninsula are quite important to estimate effects of aerosol on atmospheric environment and regional radiative forcing. For the first time in Korea, vertical microphysical properties of atmospheric aerosol obtained by inversion algorithm were analyzed based on optical data of multi-wavelength Raman lidar system developed by the Advanced Environmental Monitoring Research Center (ADEMRC), Gwangju Institute Science and Technology (GIST). Data collected on 14 June 2004 at Gwangju ($35.10^{\circ}N,\;126.53^{\circ}E$) and 27 May 2005 at Anmyeon island ($36.32^{\circ}N,\;126.19^{\circ}E$) were used as raw optical data for inversion algorithm. Siberian forest fire smoke and local originated haze were observed above and within the height of PBL, respectively on 14 June 2004 according to NOAA/Hysplit backstrajectory analysis. The inversion of lidar optical data resulted in particle effective radii around $0.31{\sim}0.33{\mu}m$, single scattering albedo between $0.964{\sim}0.977$ at 532 nm in PBL and effective radii of $0.27{\mu}m$ and single scattering albedo between $0.923{\sim}0.924$ above PBL. In the case on 27 May 2005, biomass burning from east China was a main source of aerosol plume. The inversion results of the data on 27 May 2005 were found to be particle effective radii between $0.23{\sim}0.24{\mu}m$, single scattering albedo around $0.924{\sim}0.929$ at 532 nm. Additionally, the inversion values were well matched with those of Sun/sky radiometer in measurement period.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.271-278
• /
• 2004

In this paper, we propose a content-based audio genre classification algorithm that automatically classifies the query audio into five genres such as Classic, Hiphop, Jazz, Rock, Speech using digital sign processing approach. From the 20 seconds query audio file, the audio signal is segmented into 23ms frame with non-overlapped hamming window and 54 dimensional feature vectors, including Spectral Centroid, Rolloff, Flux, LPC, MFCC, is extracted from each query audio. For the classification algorithm, k-NN, Gaussian, GMM classifier is used. In order to choose optimum features from the 54 dimension feature vectors, SFS(Sequential Forward Selection) method is applied to draw 10 dimension optimum features and these are used for the genre classification algorithm. From the experimental result, we can verify the superior performance of the proposed method that provides near 90% success rate for the genre classification which means 10%∼20% improvements over the previous methods. For the case of actual user system environment, feature vector is extracted from the random interval of the query audio and it shows overall 80% success rate except extreme cases of beginning and ending portion of the query audio file.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2327-2340
• /
• 2000

Existing bulk loading algorithms for multi-dimensional index structures suffer from satisfying both index construction time and retrieval perfonnancc. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both constnlCtion time and search performance. To improve the construction time, we don't sort whole data set and use bisectiou algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. We show that the proposed algorithm is superior to existing algorithms in terms of construction time and search perfomlance through various experiments.

• Journal of the Korea Convergence Society
• /
• v.9 no.7
• /
• pp.1-7
• /
• 2018

Feature selection, one of data preprocessing techniques, is one of major research areas in many applications dealing with large dataset. It has been used in pattern recognition, machine learning and data mining, and is now widely applied in a variety of fields such as text classification, image retrieval, intrusion detection and genome analysis. The proposed method is based on a genetic algorithm which is one of meta-heuristic algorithms. There are two methods of finding feature subsets: a filter method and a wrapper method. In this study, we use a wrapper method, which evaluates feature subsets using a real classifier, to find an optimal feature subset. The training dataset used in the experiment has a severe class imbalance and it is difficult to improve classification performance for rare classes. After preprocessing the training dataset with SMOTE, we select features and evaluate them with various machine learning algorithms.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.150-156
• /
• 2008

Many papers have shown that the hierarchical clustering method takes good-performance, but is limited because of its quadratic time complexity. In contrast, with a large number of variables, K-means reduces a time complexity. Think of the factor of simplify, high-quality and high-efficiency, we combine the two approaches providing a new system named CONDOR system with hierarchical structure based on document clustering using K-means algorithm. Evaluated the performance on different hierarchy depth and initial uncertain centroid number based on variational relative document amount correspond to given queries. Comparing with regular method that the initial centroids have been established in advance, our method performance has been improved a lot.

• Korean Institute of Interior Design Journal
• /
• v.24 no.2
• /
• pp.32-41
• /
• 2015

We live in the era of unlimited design competition. As the importance of design is increasing in all areas including marketing, each country does its best effort on design development. However, the preparation on protecting interior design rights by intellectual property laws(IPLs) has not been enough even though they occupy an important place in the design field. It is not quite easy to make a judgement on the similarity between two images having a single common factor because the factors which are composed of interior design have complicated interactive relations between them. From the IPLs point of view, designs with the similar overall appearance are decided to be similar. Objective evaluation criteria not only for designers but also for design examiners and judges are required in order to protect interior design by the IPLs. The objective of this study is the analysis of the possibility that a computer algorithm method can be useful to decide the similarity of interior design images. According to this study, it is realized that the Img2 which is one of content-based image retrieval computer programs can be utilized to measure the degree of the similarity. The simulation results of three descriptors(CEDD, FCTH, JCD) in the Img2 showed the high degree of similar patterns compared with the results of perceptual judgment by observers. In particular, it was verified that the Img2 has high availability on interior design images with a high score of similarity below 60 which are perceptually judged by observers.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.168-179
• /
• 2002

In this paper, we investigate video representation techniques that are the foundational work for the subsequent video processing such as video storage and retrieval. A video data set if a collection of video clips, each of which is a sequence of video frames and is represented by a multidimensional data sequence (MDS). An MDS is partitioned into video segments considering temporal relationship among frames, and then similar segments of the clip are grouped into video clusters. Thus, the video clip is represented by a small number of video clusters. The video segmentation and clustering algorithm, VDCluster, proposed in this paper guarantee clustering quality to south an extent that satisfies predefined conditions. The experiments show that our algorithm performs very effectively with respect to various video data sets.