• Journal of the Korean Institute of Navigation
• /
• v.24 no.4
• /
• pp.227-234
• /
• 2000

In general, neural networks are widely used for the category classification of multispectral images. Since the input multispectral images into neural networks we, however, low contrast images, neural networks converge very slowly and are of bad performance. To overcome this problem, we propose a new image enhancement method which consists of smoothing process, finding the main valley and enhancement process. In addition the enhanced images by the proposed method are used as the input of neural networks for the category classification. When the new category classification method is applied to multispectral LANDSAT TM images, we verified that the neural networks converge very lastly and that the overall category classification performance is improved.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.3
• /
• pp.39-44
• /
• 2009

Local Binary Pattern (LBP) is becoming a popular tool for various machine vision applications such as face recognition, classification and background subtraction. In this paper, we propose a new extension of LBP, called the Diagonal LBP (DLBP), to handle the image-based gender classification problem arise in interactive display systems. Instead of comparing neighbor pixels with the center pixel, DLBP generates codes by comparing a neighbor pixel with the diagonal pixel (the neighbor pixel in the opposite side). It can reduce by half the code length of LBP and consequently, can improve the computation complexity. The Support Vector Machine is utilized as the gender classifier, and the texture profile based on DLBP is adopted as the feature vector. Experimental results revealed that our approach based on the diagonal LPB is very efficient and can be utilized in various real-time pattern classification applications.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.116-126
• /
• 2019

In this paper, an improved one-against-one support vector machine algorithm is used to classify multiple power quality disturbances. To solve the problem of parameter selection, an improved particle swarm optimization algorithm is proposed to optimize the parameters of the support vector machine. By proposing a new inertia weight expression, the particle swarm optimization algorithm can effectively conduct a global search at the outset and effectively search locally later in a study, which improves the overall classification accuracy. The experimental results show that the improved particle swarm optimization method is more accurate than a grid search algorithm optimization and other improved particle swarm optimizations with regard to its classification of multiple power quality disturbances. Furthermore, the number of support vectors is reduced.

• Journal of IKEEE
• /
• v.26 no.4
• /
• pp.639-646
• /
• 2022

In this paper, to solve the large dataset problem, we collect images through an image collection method called web crawling and build datasets for use in image classification models through a data preprocessing process. We also propose a lightweight model that can automatically classify images by adding category values by incorporating transfer learning into the image classification model and an image classification model that reduces training time and achieves high accuracy.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.1
• /
• pp.111-120
• /
• 2020

Generative adversarial networks (GANs) achieved impressive performance on image generation and visual classification applications. However, adversarial networks meet difficulties in combining the generative model and unstable training process. To overcome the problem, we combined the deep residual network with upsampling convolutional layers to construct the generative network. Moreover, the study shows that image generation and classification performance become more prominent when the residual layers include on the generator. The proposed network empirically shows that the ability to generate images with higher visual accuracy provided certain amounts of additional complexity using proper regularization techniques. Experimental evaluation shows that the proposed method is superior to image generation and classification tasks.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.124-131
• /
• 2024

Breast cancer classification using ultrasound, while widely employed, faces challenges due to its relatively low predictive value arising from significant overlap in characteristics between benign and malignant lesions, as well as operator-dependency. To alleviate these challenges and reduce dependency on radiologist interpretation, the implementation of automatic breast cancer classification in ultrasound image can be helpful. To deal with this problem, we propose a semi-supervised deep learning framework for breast cancer classification. In the proposed method, we could achieve reasonable performance utilizing less than 50% of the training data for supervised learning in comparison to when we utilized a 100% labeled dataset for training. Though it requires more modification, this methodology may be able to alleviate the time-consuming annotation burden on radiologists by reducing the number of annotation, contributing to a more efficient and effective breast cancer detection process in ultrasound images.

• Journal of Korean Library and Information Science Society
• /
• v.21
• /
• pp.459-483
• /
• 1994

The purpose of the study is to design and implement a prototype expert system for library classification in the literature field of the DDC 20. The system was largely consisted of a knowledge base, an inference engine, a knowledge acquisition facility, an explanation facility and an user interface facility. The knowledge base was represented by inference rules and frames. The name file for authors and titles was designed separately. The forward chaining technique was chosen for the inference engine and the menu-driven dialog technique was also taken for the user interface. The conclusions of the study can be summarized as follows: 1) The difficulty of document classification work is due to the complex and stringent classification rules. Such problems can be considerably alleviated by using the present system. 2) Even the novice with a knowledge about the DDC 20 can easily access the system. And also librarian other than the professional classifier can easily be accustomed to the classification work. 3) The system can be used as an online classification scheme. 4) By adding any local language other than English or Hangeul on the menu screen, the language problem relating classification can be overcome. 5) The system can be employed as the intensification tool for the education of classification as well as library automation.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.220-226
• /
• 2015

Semantic role labeling (SRL) systems determine the semantic role labels of the arguments of predicates in natural language text. An SRL system usually needs to perform four tasks in sequence: Predicate Identification (PI), Predicate Classification (PC), Argument Identification (AI), and Argument Classification (AC). In this paper, we use the Korean Propbank to develop our Korean semantic role labeling system. We describe our Korean semantic role labeling system that uses sequence labeling with structured Support Vector Machine (SVM). The results of our experiments on the Korean Propbank dataset reveal that our method obtains a 97.13% F1 score on Predicate Identification and Classification (PIC), and a 76.96% F1 score on Argument Identification and Classification (AIC).

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.1
• /
• pp.27-38
• /
• 2017

Packet classification is one of the essential functionalities of Internet routers in providing quality of service. Since the arrival rate of input packets can be tens-of-millions per second, wire-speed packet classification has become one of the most challenging tasks. While traditional packet classification only reports a single matching result, new network applications require multiple matching results. Ternary content-addressable memory (TCAM) has been adopted to solve the multi-match classification problem due to its ability to perform fast parallel matching. However, TCAM has a fundamental issue: high power dissipation. Since TCAM is designed for a single match, the applicability of TCAM to multi-match classification is limited. In this paper, we propose a cost- and energy-efficient multi-match classification architecture that combines TCAM with a tuple space search algorithm. The proposed solution uses two small TCAM modules and requires a single-cycle TCAM lookup, two SRAM accesses, and several Bloom filter query cycles for multi-match classifications.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.288-295
• /
• 1998

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.