• Title/Summary/Keyword: Shape Decomposition

Search Result 229, Processing Time 0.039 seconds

A damage localization method based on the singular value decomposition (SVD) for plates

  • Yang, Zhi-Bo;Yu, Jin-Tao;Tian, Shao-Hua;Chen, Xue-Feng;Xu, Guan-Ji
    • Smart Structures and Systems
    • /
    • v.22 no.5
    • /
    • pp.621-630
    • /
    • 2018
  • Boundary effect and the noise robustness are the two crucial aspects which affect the effectiveness of the damage localization based on the mode shape measurements. To overcome the boundary effect problem and enhance the noise robustness in damage detection, a simple damage localization method is proposed based on the Singular Value Decomposition (SVD) for the mode shape of composite plates. In the proposed method, the boundary effect problem is addressed by the decomposition and reconstruction of mode shape, and the noise robustness in enhanced by the noise filtering during the decomposition and reconstruction process. Numerical validations are performed on plate-like structures for various damage and boundary scenarios. Validations show that the proposed method is accurate and effective in the damage detection for the two-dimensional structures.

Hierarchical Shape Decomposition of Grayscale Image (다치영상의 계층적 형상분해)

  • 최종호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.595-598
    • /
    • 2004
  • In this paper, a shape decomposition method using morphological operations is studied for decomposing the complex shape in 2-D mage into its simple primitive elements. The serious drawback of conventional shape representation algorithm is that the primitive elements are extracted too much to represent the shape and the processing time is long. To solve these problems, a new shape decomposition algorithm using the 8 bit planes obtained from gray code is proposed.

  • PDF

Multi-scale crack detection using decomposition and composition (해체와 구성을 이용한 다중 스케일 균열 검출)

  • Kim, Young Ro;Chung, Ji Yung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.13-20
    • /
    • 2013
  • In this paper, we propose a multi-scale crack detection method. This method uses decomposition, composition, and shape properties. It is based on morphology algorithm, crack features. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use decomposition and composition methods. We use a decimation method for decomposition. After decomposition and morphology operation, we get edge images given by binary values. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.

Hand Gesture Recognition Using Shape Decomposition (형상 분해를 이용한 손동작 인식)

  • Choi, Junyeong;Park, Jong-Il
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.11a
    • /
    • pp.223-224
    • /
    • 2010
  • 본 논문에서는 형상 분해(Shape Decomposition)를 이용한 손동작 인식 방법을 제안한다. 형상 분해 방법을 손동작 인식에 적용함으로써 다양한 동작에 대해서 유연한 인식이 가능하며, 기존의 형상 분해 방법을 손 형상 분해에 적합하게 효율적으로 개선함으로써 실시간 연산이 가능하도록 하였다.

  • 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

Algorithm of Morphological Multimode Binary Shape Decomposition (형태론적 다중모드 2진 형상분해 알고리즘)

  • Choi, Jong-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.9
    • /
    • pp.67-75
    • /
    • 1999
  • In this paper, 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 tat 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 chatacteristics 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

Shape Reconstruction from Unorganized Cloud of Points using Adaptive Domain Decomposition Method (적응적 영역분할법을 이용한 임의의 점군으로부터의 형상 재구성)

  • Yoo Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.8 s.185
    • /
    • pp.89-99
    • /
    • 2006
  • In this paper a new shape reconstruction method that allows us to construct surface models from very large sets of points is presented. In this method the global domain of interest is divided into smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together according to weighting coefficients to obtain a global solution using partition of unity function. The suggested approach gives us considerable flexibility in the choice of local shape functions which depend on the local shape complexity and desired accuracy. At each domain, a quadratic polynomial function is created that fits the points in the domain. If the approximation is not accurate enough, other higher order functions including cubic polynomial function and RBF(Radial Basis Function) are used. This adaptive selection of local shape functions offers robust and efficient solution to a great variety of shape reconstruction problems.

Decomposition based on Object of Convex Shapes Using Poisson Equation (포아송 방정식을 이용한 컨벡스 모양의 형태 기반 분할)

  • Kim, Seon-Jong;Kim, Joo-Man
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.137-144
    • /
    • 2014
  • This paper proposes a novel procedure that uses a combination of overlapped basic convex shapes to decompose 2D silhouette image. A basic convex shape is used here as a structuring element to give a meaningful interpretation to 2D images. Poisson equation is utilized to obtain the basic shapes for either the whole image or a partial region or segment of an image. The reconstruction procedure is used to combine the basic convex shapes to generate the original shape. The decomposition process involves a merging stage, filtering stage and finalized by compromising stage. The merging procedure is based on solving Poisson's equation for two regions satisfying the same symmetrical conditions which leads to finding equivalencies between basic shapes that need to be merged. We implemented and tested our novel algorithm using 2D silhouette images. The test results showed that the proposed algorithm lead to an efficient shape decomposition procedure that transforms any shape into a simpler basic convex shapes.

Development of Morphological Pattern Recognition System - Morphological Shape Decomposition using Shape Function (형태론적 패턴인식 시스템의 개발 - 형상함수를 이용한 형태론적 형상분해)

  • Jong Ho Choi
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.8
    • /
    • pp.1127-1136
    • /
    • 1995
  • In this paper, a morphological shape decomposition method is proposed for the purpose of pattern recognition and image compression. In the method, a structuring element that geometrical characteristics is more similar to the shape function is preselected. The shape is decomposed into the primitive elements corresponding to the structuring element. A gray scale image also is transformed into 8 bit plane images for the hierarchical reconstruction required in image communication systems. The shape in each bitplane is decomposed to the proposed method. Through the experiment. it is proved that the description error is reduced and the coding efficiency is improved.

  • PDF

A Study on Feature Extraction of Morphological Shape Decomposition for Face Verification (얼굴인증을 위한 형태학적 형상분해의 특징추출에 관한 연구)

  • Park, In-Kyu;Ahn, Bo-Hyuk;Choi, Gyoo-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.7-12
    • /
    • 2009
  • The new approach was proposed which uses feature extraction based on fuzzy integral in the process of face verification using morphological shape decomposition. The centre of area was used with image pixels related with structure element and its weight in an attempt to consider neighborhood information. Therefore the morphological operators were defined for feature extraction. And then the number of decomposition images were more about 4 times than the conventional. Finally in the simulations with the extractions for face verification it was proved that the approach in this paper was even more good than the conventional in stability of feature extraction and threshold value.

  • PDF