• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.7-13
• /
• 2018

Recent advancement in data gathering technique improves the capability of information collecting, thus allowing the learning process between gathered data patterns and application sub-tasks. A pattern can be associated with multiple labels, demanding multi-label learning capability, resulting in significant attention to multi-label feature selection since it can improve multi-label learning accuracy. However, existing evolutionary multi-label feature selection methods suffer from ineffective search process. In this study, we propose a evolutionary search process for the task of multi-label feature selection problem. The proposed method creates large set of offspring or new feature subsets and then retains the most promising feature subset. Experimental results demonstrate that the proposed method can identify feature subsets giving good multi-label classification accuracy much faster than conventional methods.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.444-454
• /
• 2005

Recently, the requirements of multi-resolution models of a solid model, which represent an object at multiple levels of feature detail, are increasing for engineering tasks such as analysis, network-based collaborative design, and virtual prototyping and manufacturing. The research on this area has focused on several topics: topological frameworks for representing multi-resolution solid models, criteria for the level of detail (LOD), and generation of valid models after rearrangement of features. As a solution to the feature rearrangement problem, the new concept of the effective zone of a feature is introduced in the former part of the paper. In this paper, we propose a feature-based non-manifold modeling system to provide multi-resolution models of a feature-based solid or non-manifold model on the basis of the effective feature zones. To facilitate the implementation, we introduce the class of the multi-resolution feature whose attributes contain all necessary information to build a multi-resolution solid model and extract LOD models from it. In addition, two methods are introduced to accelerate the extraction of LOD models from the multi-resolution modeling database: the one is using an NMT model, known as a merged set, to represent multi-resolution models, and the other is storing differences between adjacent LOD models to accelerate the transition to the other LOD. We also suggest the volume of the feature, regardless of feature type, as a criterion for the LOD. This criterion can be used in a wide range of applications, since there is no distinction between additive and subtractive features unlike the previous method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.1
• /
• pp.52-57
• /
• 2007

In this paper we proposed multi-directional matching windows combined by multi-dimensional feature vector matching, which uses not only intensity values but also multiple feature values, such as variance, first and second derivative of pixels. Multi-dimensional feature vector matching has the advantage of compensating the drawbacks of area-based stereo matching using one feature value, such as intensity. We define matching cost of a pixel by the minimum value among eight multi-dimensional feature vector distances of the pixels expanded in eight directions having the interval of 45 degrees. As best stereo matches, we determine the two points with the minimum matching cost within the disparity range. In the experiment we used aerial imagery and IKONOS satellite imagery and obtained more accurate matching results than that of conventional matching method.

• International Journal of CAD/CAM
• /
• v.3 no.1_2
• /
• pp.67-75
• /
• 2003

Viewpoint-dependent feature-based modelling in computer-aided design is developed for the purposes of supporting engineering design representation and automation. The approach of this paper uses a combination of a multi-level modelling approach. This has two stages of mapping between models, and the multi-level model approach is implemented in three-level architecture. Top of this level is a feature-based description for each viewpoint, comprising a combination of form features and other features such as loads and constraints for analysis. The middle level is an executable representation of the feature model. The bottom of this multi-level modelling is a evaluation of a feature-based CAD model obtained by executable feature representations defined in the middle level. The mappings involved in the system comprise firstly, mapping between the top level feature representations associated with different viewpoints, for example for the geometric simplification and addition of boundary conditions associated with moving from a design model to an analysis model, and secondly mapping between the top level and the middle level representations in which the feature model is transformed into the executable representation. Because an executable representation is used as the intermediate layer, the low level evaluation can be active. The example will be implemented with an analysis model which is evaluated and for which results are output. This multi-level modelling approach will be investigated within the framework aimed for the design automation with a feature-based model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.786-799
• /
• 2021

Road damage detection is important for road maintenance. With the development of deep learning, more and more road damage detection methods have been proposed, such as Fast R-CNN, Faster R-CNN, Mask R-CNN and RetinaNet. However, because shallow and deep layers cannot be extracted at the same time, the existing methods do not perform well in detecting objects with fewer samples. In addition, these methods cannot obtain a highly accurate detecting bounding box. This paper presents a Multi-level Feature Pyramids method based on M2det. Because the feature layer has multi-scale and multi-level architecture, the feature layer containing more information and obvious features can be extracted. Moreover, an attention mechanism is used to improve the accuracy of local boundary boxes in the dataset. Experimental results show that the proposed method is better than the current state-of-the-art methods.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.772-775
• /
• 2006

Muilti-dimensional feature vector matching algorithm uses multiple features such as intensity, gradient, variance, first or second derivative of a pixel to find correspondence pixels in stereo images. In this paper, we proposed a new method for adjusting automatically the weight of feature in multi-dimensional feature vector matching considering sharpeness of a pixel in feature vector distance curve. The sharpeness consists of minimum and maximum vector distances of a small window mask. In the experiment we used IKONOS satellite stereo imagery and obtained accurate matching results comparable to the manual weight-adjusting method.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.196-205
• /
• 2000

This paper proposes a topology-based algorithm for recognizing the passage features using a concept of multi-face hole loop. The Multi-face hole loop is a concetpual hole loop that is formed over several connected faces. A passage feature is recognized in the proposed approach by two multi-face hole loops that constitute its enterance and exit. The algorithm proposed in this paper checks the connectivity of the two multi-face hole loops to recognize passage features. The total number of passage features in a part is calculated from Euler equation and is compared with the number of found passage features to decide when to terminate. To find all multi-face hole loops in a part, this paper proposes an algorithm for finding all combinations of connected faces. The edge convexity is used to judge the validity of multi-face hole loops. By using the algorithm proposed in this paper, the passage features could be recognized effectively. The approach proposed in this paper is illustrated with several example parts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1833-1848
• /
• 2022

Named entity recognition (NER) is an important basic task in the field of Natural Language Processing (NLP). Recently deep learning approaches by extracting word segmentation or character features have been proved to be effective for Chinese Named Entity Recognition (CNER). However, since this method of extracting features only focuses on extracting some of the features, it lacks textual information mining from multiple perspectives and dimensions, resulting in the model not being able to fully capture semantic features. To tackle this problem, we propose a novel Multi-view Semantic Feature Fusion Model (MSFM). The proposed model mainly consists of two core components, that is, Multi-view Semantic Feature Fusion Embedding Module (MFEM) and Multi-head Self-Attention Mechanism Module (MSAM). Specifically, the MFEM extracts character features, word boundary features, radical features, and pinyin features of Chinese characters. The acquired font shape, font sound, and font meaning features are fused to enhance the semantic information of Chinese characters with different granularities. Moreover, the MSAM is used to capture the dependencies between characters in a multi-dimensional subspace to better understand the semantic features of the context. Extensive experimental results on four benchmark datasets show that our method improves the overall performance of the CNER model.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.549-557
• /
• 2005

The requirements of multi-resolution models of feature-based solids, which represent an object at many levels of feature detail, are increasing for engineering purposes, such as analysis, network-based collaborative design, virtual prototyping and manufacturing. To provide multi-resolution models for various applications, it is essential to generate adequate solid models at varying levels of detail (LOD) after feature rearrangement, based on the LOD criteria. However, the non-commutative property of the union and subtraction Boolean operations is a severe obstacle to arbitrary feature rearrangement. To solve this problem we propose history-based Boolean operations that satisfy the commutative law between union and subtraction operations by considering the history of the Boolean operations. Because these operations guarantee the same resulting shape as the original and reasonable shapes at the intermediate LODs for an arbitrary rearrangement of its features, various LOD criteria can be applied for multi-resolution modeling in different applications.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.558-566
• /
• 2005

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.