• Title/Summary/Keyword: feature engineering

Search Result 5,797, Processing Time 0.032 seconds

A Study on Machining data Extraction using Feature Recognition Rules (특정형상인식을 이용한 가공테이터 추출에 관한 연구)

  • 이석희;정구섭
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.581-586
    • /
    • 1996
  • This paper presents a feature recognition system for recognizing and extracting feature information needed for machining from design data contained in the CAD database of AutoCAD system. The developed system carries out feature recognition from an orthographic view of a press mold containing not only atomic features such as holes, pockets, and slots, but also compound features. Based on the result of feature recognition, it generates a 3-D modeling of the press mold. Especially, The feature recognition part is designed for detecting feature styles according to feature definition and classification, extracting parameters for various atomic features, and constructing necessary data structures for the recognized features.

  • PDF

Network-based Feature Modeling in Distributed Design Environment (네트워크 기반 특징형상 모델링)

  • Lee, J.Y.;Kim, H.;Han, S.B.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.1
    • /
    • pp.12-22
    • /
    • 2000
  • Network and Internet technology opens up another domain for building future CAD/CAM environment. The environment will be global, network-centric, and spatially distributed. In this paper, we present an approach for network-centric feature-based modeling in a distributed design environment. The presented approach combines the current feature-based modeling technique with distributed computing and communication technology for supporting product modeling and collaborative design activities over the network. The approach is implemented in a client/server architecture, in which Web-enabled feature modeling clients, neutral feature model server, and other applications communicate with one another via a standard communication protocol. The paper discusses how the neutral feature model supports multiple views and maintains naming consistency between geometric entities of the server and clients. Moreover, it explains how to minimize the network delay between the server and client according to incremental feature modeling operations.

  • PDF

Identification and Modularization of Feature Interactions Using Feature-Feature Code Mapping (휘처-휘처코드 대응을 이용한 휘처상호작용의 검출 및 모듈화)

  • Lee, Kwanwoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.3
    • /
    • pp.105-110
    • /
    • 2014
  • Feature-oriented software product line engineering is to develop various products by developing product line core assets in terms of features and composing those features. However, the developed product may not behave correctly if the feature interaction problem has not be properly taken into account during the feature composition. This paper proposes techniques for identifying and modularizing undesirable feature interactions effectively. The scientific calculator product line is used for evaluating the applicability of the proposed method.

Editing Design Features Constrained by Feature Depedencies (구속조건을 가진 디자인 피쳐의 수정)

  • Woo, Yoon-Hwan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.5
    • /
    • pp.395-404
    • /
    • 2007
  • Feature-based modeling and history-based modeling are the two main paradigms that are used in most of current CAD systems. Although these modeling paradigms make it easier for designers to create solid model, it may pose dependency constraints on features that are interacting one with another. When editing such features, these constraints often cause unpredictable and unacceptable results. For example, when a parent feature is deleted, the child features of the parent feature are also deleted. This entails re-generations of the deleted features, which requires additional modeling time. In order to complement this situation, we propose a method to delete only the features of interest by disconnecting the dependency constraints. This method can provide designers with more efficient way of model modification.

Offline Handwritten Numeral Recognition Using Multiple Features and SVM classifier

  • Kim, Gab-Soon;Park, Joong-Jo
    • Journal of IKEEE
    • /
    • v.19 no.4
    • /
    • pp.526-534
    • /
    • 2015
  • In this paper, we studied the use of the foreground and background features and SVM classifier to improve the accuracy of offline handwritten numeral recognition. The foreground features are two directional features: directional gradient feature by Kirsch operators and directional stroke feature by local shrinking and expanding operations, and the background feature is concavity feature which is extracted from the convex hull of the numeral, where the concavity feature functions as complement to the directional features. During classification of the numeral, these three features are combined to obtain good discrimination power. The efficiency of our scheme is tested by recognition experiments on the handwritten numeral database CENPARMI, where SVM classifier with RBF kernel is used. The experimental results show the usefulness of our scheme and recognition rate of 99.10% is achieved.

Comparative Analysis of the Performance of SIFT and SURF (SIFT 와 SURF 알고리즘의 성능적 비교 분석)

  • Lee, Yong-Hwan;Park, Je-Ho;Kim, Youngseop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.12 no.3
    • /
    • pp.59-64
    • /
    • 2013
  • Accurate and robust image registration is important task in many applications such as image retrieval and computer vision. To perform the image registration, essential required steps are needed in the process: feature detection, extraction, matching, and reconstruction of image. In the process of these function, feature extraction not only plays a key role, but also have a big effect on its performance. There are two representative algorithms for extracting image features, which are scale invariant feature transform (SIFT) and speeded up robust feature (SURF). In this paper, we present and evaluate two methods, focusing on comparative analysis of the performance. Experiments for accurate and robust feature detection are shown on various environments such like scale changes, rotation and affine transformation. Experimental trials revealed that SURF algorithm exhibited a significant result in both extracting feature points and matching time, compared to SIFT method.

CAD/CAPP System based on Manufacturing Feature Recognition (제조특징인식에 의한 CAD/CAPP 시스템)

  • Cho, Kyu-Kab;Kim, Suk-Jae
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.8 no.1
    • /
    • pp.105-115
    • /
    • 1991
  • This paper describes an integrated CAD and CAPP system for prismatic parts of injection mold which generates a complete process plan automatically from CAD data of a part without human intervention. This system employs Auto CAD as a CAD model and GS-CAPP as an automatic process planning system for injection mold. The proposed CAD/CAPP system consists of three modules such as CAD data conversion module, manufacturing feature recognition module, and CAD/CAPP interface module. CAD data conversion module transforms design data of AutoCAD into three dimensional part data. Manufacturing feature recognition module extracts specific manufacturing features of a part using feature recognition rule base. Each feature can be recognized by combining geometry, position and size of the feature. CAD/CAPP interface module links manufacturing feature codes and other head data to automatic process planning system. The CAD/CAPP system can improve the efficiency of process planning activities and reduce the time required for process planning. This system can provide a basis for the development of part feature based design by analyzing manufacturing features.

  • PDF

Effective Multi-label Feature Selection based on Large Offspring Set created by Enhanced Evolutionary Search Process

  • Lim, Hyunki;Seo, Wangduk;Lee, Jaesung
    • 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.

Cross-architecture Binary Function Similarity Detection based on Composite Feature Model

  • Xiaonan Li;Guimin Zhang;Qingbao Li;Ping Zhang;Zhifeng Chen;Jinjin Liu;Shudan Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2101-2123
    • /
    • 2023
  • Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

EKF-based SLAM Using Sonar Salient Feature and Line Feature for Mobile Robots (이동로봇을 위한 Sonar Salient 형상과 선 형상을 이용한 EKF 기반의 SLAM)

  • Heo, Young-Jin;Lim, Jong-Hwan;Lee, Se-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.10
    • /
    • pp.1174-1180
    • /
    • 2011
  • Not all line or point features capable of being extracted by sonar sensors from cluttered home environments are useful for simultaneous localization and mapping (SLAM) due to their ambiguity because it is difficult to determine the correspondence of line or point features with previously registered feature. Confused line and point features in cluttered environments leads to poor SLAM performance. We introduce a sonar feature structure suitable for a cluttered environment and the extended Kalman filter (EKF)-based SLAM scheme. The reliable line feature is expressed by its end points and engaged togather in EKF SLAM to overcome the geometric limits and maintain the map consistency. Experimental results demonstrate the validity and robustness of the proposed method.