• Title/Summary/Keyword: 형상특징

Search Result 761, Processing Time 0.03 seconds

A Three-Dimensional Feature Data Recognizing Algorithm for CAD and CAPP Interface (CAD/CAPP 연계를 위한 3차원 형상 데이터 인식 시스템)

  • Park, Hwa-Gyoo
    • 한국IT서비스학회:학술대회논문집
    • /
    • 2003.05a
    • /
    • pp.623-628
    • /
    • 2003
  • 제품의 개발 및 생산 과정에는 설계, 해석, 가공, 검사 등의 많은 부문이 서로 밀접하게 연계되어 있고 각 부문 간에는 각기 서로 다른 형태의 정보를 필요로 하기 때문에 이들의 유기적인 통합을 위해서는 각각의 응용 분야에서 요구되는 다양한 정보가 효과적으로 제공될 필요가 있다. 본 연구에서는 특징형상을 이용하여 설계 기능과 다른 응용 부분을 유기적으로 연계할 수 있는 알고리즘을 제시한다. ISO에서 진행 중인 STEP의 Form Feature을 기준으로 일반적인 분류를 하고 이를 기초로 특징형상을 인식하고자 하였다. 이를 위해 B-Rep 데이터로부터 Face-Edge Graph를 구성하고 다중 절점(Cut Node)을 인식하였으며, 본 연구를 바탕으로 하여 향후 몇 가지 단점을 보완하고 대상 영역을 확대시켜 감으로써 Computer-aided Design 시스템으로부터 얻어지는 3차원 형상 데이터로부터 Computer-aided Process Plan을 위해 필요한 특징형상을 컴퓨터에 의해 자동으로 추출하기 위한 발판을 구축할 수 있을 것이다.

  • PDF

Analysis of Geometrical Relations of 2D Affine-Projection Images and Its 3D Shape Reconstruction (정사투영된 2차원 영상과 복원된 3차원 형상의 기하학적 관계 분석)

  • Koh, Sung-Shik;Zin, Thi Thi;Hama, Hiromitsu
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.1-7
    • /
    • 2007
  • In this paper, we analyze geometrical relations of 3D shape reconstruction from 2D images taken under anne projection. The purpose of this research is to contribute to more accurate 3-D reconstruction under noise distribution by analyzing geometrically the 2D to 3D relationship. In situation for no missing feature points (FPs) or no noise in 2D image plane, the accurate solution of 3D shape reconstruction is blown to be provided by Singular Yalue Decomposition (SVD) factorization. However, if several FPs not been observed because of object occlusion and image low resolution, and so on, there is no simple solution. Moreover, the 3D shape reconstructed from noise-distributed FPs is peturbed because of the influence of the noise. This paper focuses on analysis of geometrical properties which can interpret the missing FPs even though the noise is distributed on other FPs.

A Study on the Development of Feature-Based NC Part Programming System 'FeaTURN' for Turning Operation (특징형상을 이용한 NC선반가공 프로그래밍 시스템 'FeaTURN'의 개발에 관한 연구)

  • 강신한;이재원
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.1
    • /
    • pp.38-45
    • /
    • 1993
  • The feature based modeling approach is useful for post-CAD related works such as process planning and NC part programming. This paper describes the development of 'FeaTURN' system which is feature based NC part programming system for turning operation. The programming task in 'FeaTURN' system becomes easy and effective with the assistance of feature icons. The manufacturing attributes can be handled toghther with the features during input procedure. The cutter location data (CLD) is determined by the processor module. The post process module converts the CL data to machine control data (MCD). Also, the system graphically displays the tool path.

Three-Dimensional Object Discrimination by the Similarity Measures of the Fuzzified Image Data (퍼지화 영상데이타의 일치도연산에 의한 3차원 물체의 식별)

  • 조동욱;김지영;유흥균
    • The Journal of the Acoustical Society of Korea
    • /
    • v.12 no.2
    • /
    • pp.51-59
    • /
    • 1993
  • 본 논문에서는 입력으로 들어 온 레인지데이타에서 특징 추출을 통하여 3차원물체를 식별하는 방법을 제안하고자 한다. Z축 기울기를 이용하여 형상특징을 추출하고, 각 표면조각에서 법선벡터를 구해 기하학적 특징을 추출한다. 그 후 위에서 구한 특징들을 퍼지화데이타로 만들어 일치도 연산에 의해 표준 물체와 입력화상 물체 사이의 정합을 수행한다. 최종적으로 본 논문의 유용성을 실험에 의해 입증하고자 한다.

  • PDF

An Efficient Shape-Feature Computing Method from Boundary Sequences of Arbitrary Shapes (임의 형상의 윤곽선 시퀀스 정보로부터 형상 특징의 효율적인 연산 방법)

  • 김성옥;김동규;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.255-262
    • /
    • 2002
  • A boundary sequence can be a good representation of arbitrary shapes, because it can represent them simply and precisely. However, boundary sequences have not been used as a representation of arbitrary shapes, because the pixel-based shape-features such as area, centroid, orientation, projection and so forth, could not be computed directly from them. In this paper, we show that the shape-features can be easily computed from the boundary sequences by introducing the cross-sections that are defined as vertical (or horizontal) line segments in a shape. A cross-section generation method is proposed, which generates cross-sections of the shape efficiently by tracing the boundary sequence of the shape once. Furthermore, a boundary sequence extraction method is also proposed, which generates a boundary sequence for each shape in a binary image automatically The proposed methods work well even if a shape has holes. Eventually, we show that a boundary sequence can be used effectively for representing arbitrary shapes.

  • PDF

A Dominant Feature based Nomalization and Relational Description of Shape Signature for Scale/Rotational Robustness (2차원 형상 변화에 강건한 지배적 특징 기반 형상 시그너쳐의 정규화 및 관계 특징 기술)

  • Song, Ho-Geun;Koo, Ha-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.103-111
    • /
    • 2011
  • In this paper, we propose a Geometrical Centroid Contour Distance(GCCD) which is described by shape signature based on contour sequence. The proposed method uses geomertrical relation features instead of the absolute angle based features after it was normalized and aligned with dominant feature of the shape. Experimental result with MPEG-7 CE-Shape-1 Data Set reveals that our method has low time/spatial complexity and scale/rotation robustness than the other methods, showing that the precision of our method is more accurate than the conventional desctiptors. However, performance of the GCCD is limited with concave and complex shaped objects.

Combination of Feature-Based Extraction Process and Manufacturing Resource for Distributed Process Planning (분산공정계획을 위한 특징형상 기반 추출 공정 및 가공자원 조합)

  • Oh, Ick Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.2
    • /
    • pp.141-151
    • /
    • 2013
  • Process planning can be defined as determining detailed methods by which parts can be manufactured from the initial to the finished stage. Process planning starts with determining the manufacturing process based on the geometric shape of the part and the machines and tools required for performing this process. Distributed process planning enables production planning to be performed easily by combining the extracted process and various manufacturing resources such as operations and tools. This study proposes an algorithm to determine the process for a feature-based model and to combine manufacturing resources for the process and implements a distributed process planning system.

A Study on the Improvement of Multitree Pattern Recognition Algorithm (Multitree 형상 인식 기법의 성능 개선에 관한 연구)

  • 김태성;이정희;김성대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.4
    • /
    • pp.348-359
    • /
    • 1989
  • The multitree pattern recognition algorithm proposed by [1] and [2] is modified in order to improve its performance. The basic idea of the multitree pattern classification algorithm is that the binary dceision tree used to classify an unknow pattern is constructed for each feature and that at each stage, classification rule decides whether to classify the unknown pattern or to extract the feature value according to the feature ordet. So the feature ordering needed in the calssification procedure is simple and the number of features used in the classification procedure is small compared with other classification algorithms. Thus the algorithm can be easily applied to real pattern recognition problems even when the number of features and that of the classes are very large. In this paper, the wighting factor assignment scheme in the decision procedure is modified and various classification rules are proposed by means of the weighting factor. And the branch and bound method is applied to feature subset selection and feature ordering. Several experimental results show that the performance of the multitree pattern classification algorithm is improved by the proposed scheme.

  • PDF

Recognition and Reconstruction of 3-D Polyhedral Object using Model-based Perceptual Grouping (모델 기반 지각적 그룹핑을 이용한 3차원 다면체의 인식 및 형상 복원)

  • 박인규;이경무;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.7B
    • /
    • pp.957-967
    • /
    • 2001
  • 본 논문에서는 모델 기반 지각적 그룹핑을 이용한 3차원 다면체의 인식 및 형상 복원에 관한 새로운 기법을 제안한다. 2차원 입력 영상과 여기에서 추출된 특징들의 3차원 특징을 거리 측정기를 이용하여 추출하여 인식 및 복원의 기본 특징으로 이용한다. 이 때, 모델의 3차원 기하학적 정보는 결정 트리 분류기에 의하여 학습되며 지각적 그룹핑은 이와 같은 모델 기반으로 이루어진다. 또한, 1차 그룹핑의 결과로 얻어진 3차원 직선 특징간의 관계는 Gestalt 그래프로 표현되며 이것의 부그래프 분할을 통하여 인식을 위한 후보 그룹이 생성된다. 마지막으로 각각의 후보 그룹은 3차원 모델과 정렬되어 가장 잘 부합되는 그룹을 인식 결과로 생성하게 된다. 그리고 정렬의 결과로서 2차원 텍스춰를 추출하여 3차원 모델에 매핑함으로써 실제적인 3차원 형상을 복원할 수 있다. 제안하는 알고리듬의 성능을 평가하기 위하여 불록 영상과 지형 모델 보드 영상에 대하여 실험을 수행하였다. 실험 결과, 모델 기반의 그룹핑 기법은 결과 그룹의 수를 상당히 감소시켰으며 또한 잡음과 가리워짐에 강건한 인식과 복원 결과가 얻어졌다.

  • PDF

Morphological Shape Decomposition using Multiscan Mode (다중스캔 모드를 이용한 형태론적인 형상분해)

  • 고덕영;최종호
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.2
    • /
    • pp.33-40
    • /
    • 2000
  • In this study, a shape decomposition method using morphological operations is studied for decomposing the complex shape in 2-D image into its simple primitive elements. The serious drawback of conventional shape representation algorithm is that primitive elements are extracted too much to represent and to describe the shape. To solve these problems, a new shape decomposition algorithm using primitive elements that are similar to the geometrical characteristics of shape and 4 scan modes is proposed in this study. The multiple primitive elements as circle, square, and rhombus are extracted by using multiscan modes in a new algorithm. This algorithm have the characteristics that description error and number of primitive elements is reduced. Then, description efficiency is improved. The procedures is also simple and the processing time is reduced.

  • PDF