• Title/Summary/Keyword: skeleton

Search Result 1,041, Processing Time 0.026 seconds

New Rearranged Abietane Diterpenoids from the Roots of Salvia aegyptiaca L. Growing in Egypt

  • El-Lakany, Abdalla M.
    • Natural Product Sciences
    • /
    • v.9 no.4
    • /
    • pp.220-222
    • /
    • 2003
  • Two new abietane diterpenes with rearranged skeleton; aegyptinol and aegyptinone C; have been isolated and identified for the first time from the anti-microbial petroleum ether extract of the roots of Salvia aegyptiaca L. Their chemical structures have been elucidated by interpretation of the detailed 1D-and 2D-NMR spectra, as well as other spectroscopic tools. In addition, full assignment of $^{13}C-NMR$ of aegyptinone B was also conducted for the first time.

Comparison of Contour-Tracing Based Thinning Algorithms (윤곽선 추적 기반의 세선화 알고리듬 비교)

  • 김기수;이정환;심재창
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1101-1104
    • /
    • 1999
  • This paper performed a comparative study on contour tracing based thinning algorithms. These algorithms are widely used for extracting skeleton due to its superiority to other techniques in processing speed to perform comparison. We selected general eight images consisted of fingerprints, characters, and figures. According to experimental results, we compared each algorithm in performance and ability made skeleton.

  • PDF

Human Gender and Motion Analysis with Ellipsoid and Logistic Regression Method

  • Ansari, Md Israfil;Shim, Jaechang
    • Journal of Multimedia Information System
    • /
    • v.3 no.2
    • /
    • pp.9-12
    • /
    • 2016
  • This paper is concerned with the effective and efficient identification of the gender and motion of humans. Tracking this nonverbal behavior is useful for providing clues about the interaction of different types of people and their exact motion. This system can also be useful for security in different places or for monitoring patients in hospital and many more applications. Here we describe a novel method of determining identity using machine learning with Microsoft Kinect. This method minimizes the fitting or overlapping error between an ellipsoid based skeleton.

Two New Species of Genus Suberites (Hadromerida: Suberitidae) from Korea

  • Shim, Eun-Jeong;Sim, Chung-Ja
    • Animal Systematics, Evolution and Diversity
    • /
    • v.24 no.2
    • /
    • pp.215-218
    • /
    • 2008
  • Two new marine sponges in genus Suberites, S. hataedoensis n. sp and S. waedoensis n. sp have been collected from Hataedo Island and Waedo Island, Korea during 2005-2006. S. hataedoensis n. sp. is similar to S. durissimus in the spicule composition and texture. However, they differ in growth form, skeleton and surface. S. waedoensis n. sp. is similar to S. japonicus in spicule composition and skeleton. However, they differ in growth form, surface and texture.

A Modified WPTA Thinning Algorithm (수정된 WPTA 세선화 알고리즘)

  • Won, Nam-Sik;Nam, In-Gil;Jeon, Il-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2823-2829
    • /
    • 1999
  • This paper is a study on the improvement of WPTA algorithm available for the recognition of various characters. WPTA algorithm can extract the skeleton of a character almost similar to the original pattern by using the connection value representing connectivity of each pixel. In this paper we show that the skeleton disappearance phenomena existing in WPTA and propose modified algorithm which can eliminate this phenomena.

  • PDF

Triangulation Based Skeletonization and Trajectory Recovery for Handwritten Character Patterns

  • Phan, Dung;Na, In-Seop;Kim, Soo-Hyung;Lee, Guee-Sang;Yang, Hyung-Jeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.358-377
    • /
    • 2015
  • In this paper, we propose a novel approach for trajectory recovery. Our system uses a triangulation procedure for skeletonization and graph theory to extract the trajectory. Skeletonization extracts the polyline skeleton according to the polygonal contours of the handwritten characters, and as a result, the junction becomes clear and the characters that are touching each other are separated. The approach for the trajectory recovery is based on graph theory to find the optimal path in the graph that has the best representation of the trajectory. An undirected graph model consisting of one or more strokes is constructed from a polyline skeleton. By using the polyline skeleton, our approach accelerates the process to search for an optimal path. In order to evaluate the performance, we built our own dataset, which includes testing and ground-truth. The dataset consist of thousands of handwritten characters and word images, which are extracted from five handwritten documents. To show the relative advantage of our skeletonization method, we first compare the results against those from Zhang-Suen, a state-of-the-art skeletonization method. For the trajectory recovery, we conduct a comparison using the Root Means Square Error (RMSE) and Dynamic Time Warping (DTW) in order to measure the error between the ground truth and the real output. The comparison reveals that our approach has better performance for both the skeletonization stage and the trajectory recovery stage. Moreover, the processing time comparison proves that our system is faster than the existing systems.

Tree-inspired Chair Modeling (나무 성장 시뮬레이션을 이용한 의자 모델링 기법)

  • Zhang, Qimeng;Byun, Hae Won
    • Journal of the Korea Computer Graphics Society
    • /
    • v.23 no.5
    • /
    • pp.29-38
    • /
    • 2017
  • We propose a method for tree-inspired chair modeling that can generate a tree-branch pattern in the skeleton of an arbitrary chair shape. Unlike existing methods that merge multiple-input models, the proposed method requires only one mesh as input, namely the contour mesh of the user's desired part, to model the chair with a branch pattern generated by tree-growth simulation. We propose a new method for the efficient extraction of the contour-mesh region in the tree-branch pattern. First, we extract the contour mesh based on the face area of the input mesh. We then use the front and back mesh information to generate a skeleton mesh that reconstructs the connection information. In addition, to obtain the tree-branch pattern matching the shape of the input model, we propose a three-way tree-growth simulation method that considers the tangent vector of the shape surface. The proposed method reveals a new type of furniture modeling by using an existing furniture model and simple parameter values to model tree branches shaped appropriately for the input model skeleton. Our experiments demonstrate the performance and effectiveness of the proposed method.

3D Modeling of Self-Occluding Objects from 2D Drawings (자기폐색 물체의 2D 커브로부터의 3D모델링)

  • Cordier Frederic;Seo Hye-Won;Cho Young-Sang
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.9
    • /
    • pp.741-750
    • /
    • 2006
  • In this paper, we propose a method for reconstructing a 3D object (or a set of objects) from a 2D drawing provided by a designer. The input 2D drawing consists of a set of contours that may partially overlap each other or be self-overlapping. Accordingly, the resulting 3D object(s) may occlude each other or be self-occluding. The proposed method is composed of three major steps: 2D contour analysis, 3D skeleton computation, and 3D object construction. Our main contribution is to compute the 3D skeleton from the self-intersecting 2D counterpart. We formulate the 3D skeleton construction problem as a sequence of optimization problems, to shape the skeleton and place it in the 3D space while satisfying C1-continuity and intersection-free conditions. Our method is mainly for a silhouette-based sketching interface for the design of 3D objects including self-intersecting objects.

A Hardware Architecture for Retaining the Connectivity in Gray-Scale Image (그레이 레벨 연결성 복원 하드웨어 구조)

  • 김성훈;양영일
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.4
    • /
    • pp.23-28
    • /
    • 2002
  • In this paper, we have proposed the hardware architecture which implements the algorithm for retaining the connectivity which prevents the disconnection in the gray-scale image thinning. To extract the skeleton from the image in a real time, it is necessary to examine the connectivity of the skeleton in a real time. The proposed architecture finds the connectivity number in the 4-clock period. The architecture consists of three blocks, PS(Parallel to Serial) Converter and Stare Generator and Ridge Checker. The PS Converter changes the 3$\times$3 gray level image to four sets of image pixels. The State Generator examines the connectivity of the central pixel by searching the data from the PS Converter. The Ridge Checker determines whether the central pixel is on the skeleton or not. The proposed architecture finds the connectivity of the central pixel in a 3$\times$3 gray level image in the 4-clocks. The total circuits are verified by the design tools and operate correctly.

  • PDF

Regional Boundary Operation for Character Recognition Using Skeleton (골격을 이용한 문자 인식을 위한 지역경계 연산)

  • Yoo, Suk Won
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.361-366
    • /
    • 2018
  • For each character constituting learning data, different fonts are added in pixel unit to create MASK, and then pixel values belonging to the MASK are divided into three groups. The experimental data are modified into skeletal forms, and then regional boundary operation is used to create a boundary that distinguishes the background region adjacent to the skeleton of the character from the background of the modified experimental data. Discordance values between the modified experimental data and the MASKs are calculated, and then the MASK with the minimum value is found. This MASK is selected as a finally recognized result for the given experiment data. The recognition algorithm using skeleton of the character and the regional boundary operation can easily extend the learning data set by adding new fonts to the given learning data, and also it is simple to implement, and high character recognition rate can be obtained.