• The Journal of the Acoustical Society of Korea
• /
• v.37 no.1
• /
• pp.73-81
• /
• 2018

The quality of side scan sonar images is determined by the frequency of a sonar. A side scan sonar with a low frequency creates low-quality images. One of the factors that lead to low quality is a high-level noise. The noise is occurred by the underwater environment such as equipment noise, signal interference and so on. In addition, in order to compensate for the transmission loss of sonar signals, the received signal is recovered by TVG (Time-Varied Gain), and consequently the side scan sonar images contain non-homogeneous noise which is opposite to optic images whose noise is assumed as homogeneous noise. In this paper, the SSCS (Structural Sparsity based Compressive Sensing) is proposed for removing non-homogeneous noise. The algorithm incorporates both local and non-local models in a structural feature domain so that it guarantees the sparsity and enhances the property of non-local self-similarity. Moreover, the non-local model is corrected in consideration of non-homogeneity of noises. Various experimental results show that the proposed algorithm is superior to existing method.

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

For quantitative analysis of spatio-temporal distribution pattern on marine environment, spatial autocorrelation statistics on the both global and local aspects was applied to the observed data obtained from Gwangyang Bay in South Sea of Korea. Global indexes such as Moran's I and General G were used for understanding environmental distribution pattern in the whole study area. LISAs (local indicators of spatial association) such as Moran's I ($I_i$) and $G_i{^*}$ were considered to find similarity between a target feature and its neighborhood features and to detect hot spot and/or cold spot. Additionally, the significance test on clustered patterns by Z-scores was carried out. Statistical results showed variations of spatial patterns quantitatively in the whole year. Then all of general water quality, nutrients, chlorophyll-a and phytoplankton had strong clustered pattern in summer. When global indexes showed strong clustered pattern, the front region with a negative $I_i$ which means a strong spatial variation was observed. Also, when global indexes showed random pattern, hot spot and/or cold spot were/was found in the small local region with a local index $G_i{^*}$. Therefore, global indexes were useful for observing the strength and time series variations of clustered patterns in the whole study area, and local indexes were useful for tracing the location of hot spot and/or cold spot. Quantification of both spatial distribution pattern and clustering characteristics may play an important role to understand marine environment in depth and to find the reasons for spatial pattern.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.514-528
• /
• 2004

An emotion-based video scene retrieval algorithm is proposed in this paper. First, abrupt/gradual shot boundaries are detected in the video clip representing a specific story Then, five video features such as 'average color histogram' 'average brightness', 'average edge histogram', 'average shot duration', and 'gradual change rate' are extracted from each of the videos and mapping between these features and the emotional space that user has in mind is achieved by an interactive genetic algorithm. Once the proposed algorithm has selected videos that contain the corresponding emotion from initial population of videos, feature vectors from the selected videos are regarded as chromosomes and a genetic crossover is applied over them. Next, new chromosomes after crossover and feature vectors in the database videos are compared based on the similarity function to obtain the most similar videos as solutions of the next generation. By iterating above procedures, new population of videos that user has in mind are retrieved. In order to show the validity of the proposed method, six example categories such as 'action', 'excitement', 'suspense', 'quietness', 'relaxation', 'happiness' are used as emotions for experiments. Over 300 commercial videos, retrieval results show 70% effectiveness in average.

• Journal of Internet Computing and Services
• /
• v.23 no.1
• /
• pp.125-134
• /
• 2022

The development of information communication and artificial intelligence technology requires the intelligent command and control (C2) system for Korean military, and various studies are attempted to achieve it. In particular, as a volume ofinformation in the C2 workflow increases exponentially, this study pays attention to the collaborative filtering (CF) and recommendation systems (RS) that can provide the essential information for the users of the C2 system has been developed. The RS performing information filtering in the C2 system should provide an explanatory recommendation and consider the context of the tasks and users. In this paper, we propose a contextual pre-filtering CARS framework that recommends information in the C2 workflow. The proposed framework consists of four components: 1) contextual pre-filtering that filters data in advance based on the context and relationship of the users, 2) feature selection to overcome the data sparseness that is a weak point for the CF, 3) the proposed CF with the features distances between the users used to calculate user similarity, and 4) rule-based post filtering to reflect user preferences. In order to evaluate the superiority of this study, various distance methods of the existing CF method were compared to the proposed framework with two experimental datasets in real-world. As a result of comparative experiments, it was shown that the proposed framework was superior in terms of MAE, MSE, and MSLE.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.1
• /
• pp.23-28
• /
• 2013

The process of a feature matching for two different spatial data sets is similar to the process of classification as a binary class such as matching or non-matching. In this paper, we calculated a threshold by applying an equal error rate (EER) which is widely used in biometrics that classification is a main topic into spatial data sets. In a process of discriminating what's a matching or what's not, a precision and a recall is changed and a trade-off appears between these indexes because the number of matching pairs is changed when a threshold is changed progressively. This trade-off point is EER, that is, threshold. To the result of applying this method into training data, a threshold is estimated at 0.802 of a value of shape similarity. By applying the estimated threshold into test data, F-measure that is a evaluation index of matching method is highly value, 0.940. Therefore we confirmed that an accurate threshold is calculated by EER without person intervention and this is appropriate to matching different spatial data sets.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.3
• /
• pp.409-414
• /
• 2013

With the increase of multimedia information such as images, researches have been realized on how to extract the high-level semantic information from low-level visual information, and a variety of techniques have been proposed to generate this information automatically. However, most of these technologies extract the semantic information between single images, it's difficult to extract semantic information when a combination of multiple objects within the image. In this paper, we extract the visual features of objects within the image and training images stored in the DB and the features of each object are defined by measuring the similarity. Using ontology reasoner, each object feature within images infers the semantic information by positional relation and associative relation. With this, it's possible to infer semantic information between objects within images, we proposed a method for inferring more complicated and a variety of high-level semantic information.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.3
• /
• pp.83-89
• /
• 2016

The group formation problem of the machine and part is a critical issue in the planning stage of cellular manufacturing systems. The machine-part grouping with alternative process plans means to form machine-part groupings in which a part may be processed not only by a specific process but by many alternative processes. For this problem, this study presents an algorithm based on self organizing neural networks, so called SOM (Self Organizing feature Map). The SOM, a special type of neural networks is an intelligent tool for grouping machines and parts in group formation problem of the machine and part. SOM can learn from complex, multi-dimensional data and transform them into visually decipherable clusters. In the proposed algorithm, output layer in SOM network had been set as one-dimensional structure and the number of output node has been set sufficiently large in order to spread out the input vectors in the order of similarity. In the first stage of the proposed algorithm, SOM has been applied twice to form an initial machine-process group. In the second stage, grouping efficacy is considered to transform the initial machine-process group into a final machine-process group and a final machine-part group. The proposed algorithm was tested on well-known machine-part grouping problems with alternative process plans. The results of this computational study demonstrate the superiority of the proposed algorithm. The proposed algorithm can be easily applied to the group formation problem compared to other meta-heuristic based algorithms. In addition, it can be used to solve large-scale group formation problems.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.11a
• /
• pp.17-22
• /
• 2005

Generally, pixel-based classification, utilize the similarity of distances between the pixel values in feature space, is applied to land use mapping using satellite remote sensing data. But this method is Improper to be applied to the very high resolution satellite data (VHRS) due to complexity of the spatial structure and the variety of pixel values. In this paper, we performed the hierarchical classification of VHRS imagery by data fusion, which integrated LiDAR height and intensity information. MLC and ISODATA methods were applied to IKONOS-2 imagery with and without LiDAR data prior to the hierarchical classification, and then results was evaluated. In conclusion, the hierarchical method with LiDAR data was the superior than others in VHRS imagery and both MLC and ISODATA classification with LiDAR data were better than without.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.81-86
• /
• 2002

In current CBR(Case-Based Reasoning) systems, the case adaptation is usually performed by rule-based method that use rules hand-coded by the system developer. So, CBR system designer faces knowledge acquisition bottleneck similar to those found in traditional expert system design. In this thesis, 1 present a model for learning method of case adaptation knowledge using case base. The feature difference of each pair of cases are noted and become the antecedent part of an adaptation rule, the differences between the solutions in the compared cases become the consequent part of the rule. However, the number of rules that can possibly be discovered using a learning algorithm is enormous. The first method for finding cases to compare uses a syntactic measure of the distance between cases. The threshold fur identification of candidates for comparison is fixed th the maximum number of differences between the target and retrived case from all retrievals. The second method is to use similarity metric since the threshold method may not be an accurate measure. I suggest the elimination method of duplicate rules. In the elimination process, a confidence value is assigned to each rule based on its frequency. The learned adaptation rules is applied in riven target Problem. The basic. process involves search for all rules that handle at least one difference followed by a combination process in which complete solutions are built.