• Journal of Digital Contents Society
• /
• v.18 no.8
• /
• pp.1635-1640
• /
• 2017

In this paper, a hierarchical image tree model for weather classification is defined in a single outdoor image, and a weather classification algorithm using image intensity and k-mean segmentation image is proposed. In the first level of the hierarchical image tree model, the indoor and outdoor images are distinguished. Whether the outdoor image is daytime, night, or sunrise/sunset image is judged using the intensity and the k-means segmentation image at the second level. In the last level, if it is classified as daytime image at the second level, it is finally estimated whether it is sunny or foggy image based on edge map and fog rate. Some experiments are conducted so as to verify the weather classification, and as a result, the proposed method shows that weather features are effectively detected in a given image.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.2
• /
• pp.241-262
• /
• 2010

This study aims to perform an evaluation of classification systems provided by major Korean search portals, Naver, Nate, Daum, and Yahoo-Korea. These classification systems are evaluated in terms of the consistency of classification system, logicality of classification system, ease of interface, clarity of category names, order of category and site listing, and hierarchical structure. The results of this study show that each search portal provides separate classification systems for their services. These results imply that it is crucial for search portals to implement a common classification system and a common interface for their services. This study could contribute to the development and improvement of portals' classification systems.

• Korean Journal of Remote Sensing
• /
• v.17 no.1
• /
• pp.57-69
• /
• 2001

This study propose a image processing system of unsupervised analysis. This system integrates low-level segmentation and high-level classification. The segmentation and classification are conducted respectively with and without spatial constraints on merging by a hierarchical clustering procedure. The clustering utilizes the local mutually closest neighbors and multi-window operation of a pyramid-like structure. The proposed system has been evaluated using simulated images and applied for the LANDSATETM+ image collected from Youngin-Nungpyung area on the Korean Peninsula.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.1
• /
• pp.249-256
• /
• 2024

Machine learning-based intrusion detection methodologies require a large amount of uniform learning data for each class to be classified, and have the problem of having to retrain the entire system when adding an attack type to be detected or classified. In this paper, we use feature learning and hierarchical classification methods to solve classification problems and data imbalance problems using relatively little training data, and propose an intrusion detection methodology that makes it easy to add new attack types. The feasibility of the proposed system was verified through experiments using KDD IDS data..

• Korean Journal of Remote Sensing
• /
• v.27 no.4
• /
• pp.435-444
• /
• 2011

The land cover map derived from spectral features of high resolution optical images has low spectral resolution and heterogeneity in the same land cover class. For this reason, despite the same land cover class, the land cover can be classified into various land cover classes especially in vegetation area. In order to overcome these problems, detailed vegetation classification is applied to optical satellite image and SAR(Synthetic Aperture Radar) integrated data in vegetation area which is the result of pre-classification from optical image. The pre-classification and vegetation classification were performed with MLC(Maximum Likelihood Classification) method. The hierarchical land cover classification was proposed from fusion of detailed vegetation classes and non-vegetation classes of pre-classification. We can verify the facts that the proposed method has higher accuracy than not only general SAR data and GLCM(Gray Level Co-occurrence Matrix) texture integrated methods but also hierarchical GLCM integrated method. Especially the proposed method has high accuracy with respect to both vegetation and non-vegetation classification.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.3
• /
• pp.173-179
• /
• 2015

In this paper, object-based classification of urban areas based on a combination of information from lidar and aerial images is introduced. High resolution images are frequently used in automatic classification, making use of the spectral characteristics of the features under study. However, in urban areas, pixel-based classification can be difficult since building colors differ and the shadows of buildings can obscure building segmentation. Therefore, if the boundaries of buildings can be extracted from lidar, this information could improve the accuracy of urban area classifications. In the data processing stage, lidar data and the aerial image are co-registered into the same coordinate system, and a local maxima filter is used for the building segmentation of lidar data, which are then converted into an image containing only building information. Then, multiresolution segmentation is achieved using a scale parameter, and a color and shape factor; a compactness factor and a layer weight are implemented for the classification using a class hierarchy. Results indicate that lidar can provide useful additional data when combined with high resolution images in the object-oriented hierarchical classification of urban areas.

• Journal of the Korean Statistical Society
• /
• v.28 no.2
• /
• pp.183-193
• /
• 1999

In the problem of estimating estimable functions in classification linear models, we propose a method of obtaining least squares estimators of estimable functions. This method is based on the hierarchical Bayesian approach for estimating a vector of unknown parameters. Also, we verify that estimators obtained by our method are identical to least squares estimators of estimable functions obtained by using either generalized inverses or full rank reparametrization of the models. Some examples are given which illustrate our results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1285-1296
• /
• 2011

Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.89-96
• /
• 2007

Various classification methods have been developed to reuse components. These classification methods enable the user to access the needed components quickly and easily. Conventional classification approaches include the following problems: a labor-intensive domain analysis effort to build a classification structure, the representation of the inter-component relationships, difficult to maintain as the domain evolves, and applied to a limited domain. In order to solve these problems, this paper describes a composite cluster analysis approach for component classification. The cluster analysis approach is a combination of a hierarchical cluster analysis method, which generates a stable clustering structure automatically, and a non-hierarchical cluster analysis concept, which classifies new components automatically. The clustering information generated from the proposed approach can support the domain analysis process.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.44 no.2
• /
• pp.354-368
• /
• 2020

Accurate and versatile image data-sets are essential for fashion AI research and AI-based fashion businesses based on a systematic attribute classification system. This study constructs a color and texture attribute hierarchical classification system by collecting fashion item images and analyzing the metadata of fashion items described by consumers. Essential dimensions to explain color and texture attributes were extracted; in addition, attribute values for each dimension were constructed based on metadata and previous studies. This hierarchical classification system satisfies consistency, exclusiveness, inclusiveness, and flexibility. The image tagging to confirm the usefulness of the proposed classification system indicated that the contents of attributes of the same image differ depending on the annotator that require a clear standard for distinguishing differences between the properties. This classification system will improve the reliability of the training data for machine learning, by providing standardized criteria for tasks such as tagging and annotating of fashion items.