• Title/Summary/Keyword: reverse segmentation algorithm

Search Result 11, Processing Time 0.025 seconds

Design and Implementation of the Compound Noun Segmentation Algorithm Based on Statistical Information

  • Kim, Chang-Geun;Tack, Han-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.306-310
    • /
    • 2004
  • This paper suggests a reverse segmentation algorithm using affix information and some preference pattern information of Korean compound nouns. The structure of Korean compound nouns is mostly derived from Chinese characters, and it includes some preference patterns utilized as a segmentation rule in this paper. To evaluate the accuracy of the proposed algorithm, an experiment was performed with 36,061 compound nouns. The experiment resulted in getting 99.3% of correct segmentation and showed excellent satisfactory results from the comparative experimentation with other algorithms. Especially, most of the four-syllable or five-syllable compound nouns were successfully segmented without fail.

A Reverse Segmentation Algorithm of Compound Nouns Using Affix Information and Preference Pattern (접사정보 및 선호패턴을 이용한 복합명사의 역방향 분해 알고리즘)

  • Ryu, Bang;Baek, Hyun-Chul;Kim, Sang-Bok
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.3
    • /
    • pp.418-426
    • /
    • 2004
  • This paper suggests a reverse segmentation Algorithm using affix information and some preference pattern information of Korean compound nouns. The structure of Korean compound nouns are mostly derived from the Chinese characters and it includes some preference patterns, which are going to be utilized as a segmentation rule in this paper. To evaluate the accuracy of the proposed algorithm, an experiment was performed with 36061 compound nouns. The experiment resulted in getting 99.3% of correct segmentation and showed excellent satisfactory result from the comparative experimentation with other algorithm, especially most of the four or five-syllable compound nouns were successfully segmented without fail.

  • PDF

B-spline Surface Reconstruction in Reverse Engineering by Segmentation of Measured Point Data (역공학에서의 측정점의 분할에 의한 B-spline 곡면의 재생성)

  • Hur, Sung-Min;Kim, Ho-Chan;Lee, Seok-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.10
    • /
    • pp.1961-1970
    • /
    • 2002
  • A laser scanner is widely used fur a device fur acquiring point data in reverse engineering. It is more efficient to generate a surface automatically from the line-typed data than scattered data of points clouds. In the case of a compound model, it is hard to represent all the scanned data into one surface maintaining its original line characteristics. In this paper, a method is presented to generate a surface by the segmentation of measured point data. After forming triangular net, the segmentation is done by the user input such as the angle between triangles, the number of facets to be considered as small segment, and the angle for combining small segment. B-spline fitting is implemented to the point data in each segment. The surface generation through segmentation shows a reliable result when it is applied to the models with curvature deviation regions. An useful algorithm for surface reconstruction is developed and verified by applying an practical model and shows a good tools fur reverse engineering in design modification.

Segmentation of Measured Point Data for Reverse Engineering (역공학을 위한 측정점의 영역화)

  • 양민양;이응기
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.3
    • /
    • pp.173-179
    • /
    • 1999
  • In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.

  • PDF

Inversion of Spread-Direction and Alternate Neighborhood System for Cellular Automata-Based Image Segmentation Framework

  • Lee, Kyungjae;Lee, Junhyeop;Hwang, Sangwon;Lee, Sangyoun
    • Journal of International Society for Simulation Surgery
    • /
    • v.4 no.1
    • /
    • pp.21-23
    • /
    • 2017
  • Purpose In this paper, we proposed alternate neighborhood system and reverse spread-direction approach for accurate and fast cellular automata-based image segmentation method. Materials and Methods On the basis of a simple but effective interactive image segmentation technique based on a cellular automaton, we propose an efficient algorithm by using Moore and designed neighborhood system alternately and reversing the direction of the reference pixels for spreading out to the surrounding pixels. Results In our experiments, the GrabCut database were used for evaluation. According to our experimental results, the proposed method allows cellular automata-based image segmentation method to faster while maintaining the segmentation quality. Conclusion Our results proved that proposed method improved accuracy and reduced computation time, and also could be applied to a large range of applications.

Development of Standardization Algorithm for Indoor Point Cloud Data Based on the Geometric Feature of Structural Components (구조 부재의 형상적 특성 기반의 실내 포인트 클라우드 데이터의 표준화 알고리즘 개발)

  • Oh, Sangmin;Cha, Minsu;Cho, Hunhee
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2023.05a
    • /
    • pp.345-346
    • /
    • 2023
  • As the shape and size of detectable objects diversifying recognition and segmentation algorithms have been developed to acquire accurate shape information. Although a high density of data captured by the repetition of scanning improves the accuracy of algorithms the high dense data decreases the efficiency due to its large size. This paper proposes standardization algorithms using the feature of structural members on indoor point cloud data to improve the process. First of all we determine the reduction rate of the density based on the features of the target objects then the data reduction algorithm compresses the data based on the reduction rate. Second the data arrangement algorithm rotates the data until the normal vector of data is aligned along the coordinate axis to allow the following algorithms to operate properly. Final the data arrangement algorithm separates the rotated data into their leaning axis. This allows reverse engineering of indoor point clouds to obtain the efficiency and accuracy of refinement processes.

  • PDF

Localization of Subsurface Targets Based on Symmetric Sub-array MIMO Radar

  • Liu, Qinghua;He, Yuanxin;Jiang, Chang
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.774-783
    • /
    • 2020
  • For the issue of subsurface target localization by reverse projection, a new approach of target localization with different distances based on symmetric sub-array multiple-input multiple-output (MIMO) radar is proposed in this paper. By utilizing the particularity of structure of the two symmetric sub-arrays, the received signals are jointly reconstructed to eliminate the distance information from the steering vectors. The distance-independent direction of arrival (DOA) estimates are acquired, and the localizations of subsurface targets with different distances are realized by reverse projection. According to the localization mechanism and application characteristics of the proposed algorithm, the grid zooming method based on spatial segmentation is used to optimize the locaiton efficiency. Simulation results demonstrate the effectiveness of the proposed localization method and optimization scheme.

A Reverse Segmentation Algorithm of Compound Nouns (복합명사의 역방향 분해 알고리즘)

  • 이현민;박혁로
    • Proceedings of the Korean Society for Cognitive Science Conference
    • /
    • 2000.06a
    • /
    • pp.56-59
    • /
    • 2000
  • 한국어에서 복합명사는 명사간 결합이 자유롭고, 단위명사로 띄어쓰는 것을 원칙으로 하나 붙여써도 무방하다. 따라서, 정보검색분야, 기계번역분야에서 복합명사의 정확한 분해는 시스템의 성능에 많은 영향을 미치게 된다. 본 논문에서는 ETRI의 태깅된 코퍼스로부터 추출한 복합명사를 역방향 분해 알고리즘을 이용하여 단위명사로 분해한다. 분해되지 않은 3119개의 복합명사에 대해 실험한 결과 약 96.6%의 정확도를 얻었다. 또한, 미등록이나 접사에 대한 처리에도 비교적 정확한 결과를 얻을 수 있었다.

  • PDF

A Reverse Segmentation Algorithm of Compound Nouns (복합명사의 역방향 분해 알고리즘)

  • Lee, Hyeon-Min;Park, Hyeok-Ro
    • The KIPS Transactions:PartB
    • /
    • v.8B no.4
    • /
    • pp.357-364
    • /
    • 2001
  • 본 논문에서는 단위명사 사전과 접사 사전을 이용하여 한국어 복합명사를 분해하는 새로운 알고리즘을 제안한다. 한국어 복합명사는 그 구조에 있어서 중심어가 뒤에 나타난다는 점에 착안하여 본 논문에서 제안한 분해 알고리즘은 복합명사를 끝음절에서 첫음절 방향 즉 역방향으로 분해를 시도한다. ETRI의 태깅된 코퍼스로부터 추출한 복합명사 3,230개에 대해 실험한 결과 약 96.6%의 분해 정확도를 얻었다. 미등록어를 포함한 복합명사의 경우는 77.5%의 분해 정확도를 나타냈다. 실험에 사용된 데이터중의 미등록어는 대부분 접사를 포함한 파행어로서, 제안한 복합명사 분해 알고리즘은 접사가 부착된 미등록어 분석에 있어서 보다 높은 분석 정확도를 나타냄을 알 수 있었다.

  • PDF

A Design of Real Time Measurement System for EMG Silent Period Under Window Base (윈도우 환경하에서 근전도의 실시간 Silent Period 측정 시스템 설계)

  • 강병길;김태훈;이영석;김덕영;김세동;김성환
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.10
    • /
    • pp.611-617
    • /
    • 2003
  • A mechanical or electrical stimulation to the mandibular symphysis during a maximal voluntary clenching of the teeth always produces a jaw jerk followed by a silent period (transient stops) in the masseteric EMG (electromyogram). Generally, a mechanical stimulation is followed by a single silent period, and an electrical stimulation is followed by multiple silent periods. In this paper, we propose a new algorithm for determining the duration of the masseter silent period. The decision approach in essentially based upon a segmentation algorithm consisted of variance filter, median filter and gaussian filter. The new adaptive digital notch filter using R-CLMS(reverse constrained least mean-squared) algorithm is proposed for the elimination of powerline(60Hz) noise. At the same time, we design a real time measurement system for the EMG silent period under Window base.