• Title/Summary/Keyword: K-means 병합

Search Result 31, Processing Time 0.028 seconds

Text Detection and Binarization using Color Variance and an Improved K-means Color Clustering in Camera-captured Images (카메라 획득 영상에서의 색 분산 및 개선된 K-means 색 병합을 이용한 텍스트 영역 추출 및 이진화)

  • Song Young-Ja;Choi Yeong-Woo
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3 s.106
    • /
    • pp.205-214
    • /
    • 2006
  • Texts in images have significant and detailed information about the scenes, and if we can automatically detect and recognize those texts in real-time, it can be used in various applications. In this paper, we propose a new text detection method that can find texts from the various camera-captured images and propose a text segmentation method from the detected text regions. The detection method proposes color variance as a detection feature in RGB color space, and the segmentation method suggests an improved K-means color clustering in RGB color space. We have tested the proposed methods using various kinds of document style and natural scene images captured by digital cameras and mobile-phone camera, and we also tested the method with a portion of ICDAR[1] contest images.

A Parallel Algorithm for Merging Relaxed Min-Max Heaps (Relaxed min-max 힙을 병합하는 병렬 알고리즘)

  • Min, Yong-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.5
    • /
    • pp.1162-1171
    • /
    • 1998
  • This paper presents a data structure that implements a mergable double-ended priority queue : namely an improved relaxed min-max-pair heap. By means of this new data structure, we suggest a parallel algorithm to merge priority queues organized in two relaxed heaps of different sizes, n and k, respectively. This new data-structure eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [9]. As a result, employing max($2^{i-1}$,[(m+1/4)]) processors, this algorithm requires O(log(log(n/k))${\times}$log(n)) time. Also, on the MarPar machine, this method achieves a 35.205-fold speedup with 64 processors to merge 8 million data items which consist of two relaxed min-max heaps of different sizes.

  • PDF

Color Quantization of Natural Images for Content-Based Retrieval (내용기반 검색을 위한 자연 영상의 칼라양자화 방법)

  • 길연희;김성영;박창민;김민환
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2000.11a
    • /
    • pp.266-270
    • /
    • 2000
  • 내용기반 영상검색시스템에서 객체 단위로 영상을 검색하기 위해서는 영상에서 의미있는 객체를 추출하는 과정이 필수적이며, 이를 위해 영역 분할을 효율적으로 수행하기 위한 양자화가 선행되어야 한다. 일반적인 칼라 양자화 기법은 칼라 수를 줄이되 양자화 된 영상이 원시 영상과 가능할 비슷해 보이도록 하는 것을 목적으로 하지만, 영역 분할을 위한 칼라 양자화에서는 칼라의 표현보나는 의미있는 객체를 용이하게 추출할 수 있도록 양자화 하는 것을 목적으로 한다. 본 논문에서는 기존의 Octree 양자화 방법과 K-means 알고리즘의 장점을 조합하여 영역 분할에 용이한 양자화 결과를 얻을 수 있는 방법을 제안한다. 먼저, Octree 양자화 방법을 수행하여 얻어진 양자화 된 칼라들 중에서 시각적으로 유사한 칼라를 병합함으로써, Octree 양자화 방법의 단점인 강제 분할 문제점을 해결한다. 이어서, 병합 후의 양자화 된 칼라에 대해서만 K-means 알고리즘을 수행함으로써, 보다 빠른 시간 내에 영역 분할에 적합한 양자화 된 영상을 얻는다. 실험을 통해 제안한 방법의 효용성을 확인하였다.

  • PDF

Fabrication of polymer hierarchical structures by two-step temperature-directed capillary (2단계 모세관 리소그라피 기술을 이용한 마이크로/나노 병합구조 공정 기술 및 수학적 모델을 통한 표면 특성 분석)

  • Jeong H.E.;Lee S.H.;Kim J.K.;Suh K.Y.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.10a
    • /
    • pp.272-274
    • /
    • 2005
  • A simple method for fabricating micro/nanoscale hierarchical structures is presented using a two-step temperature-directed capillary molding technique. This lithographic method involves a sequential application of molding process in which a uniform polymer-coated surface is molded with a patterned mold by means of capillary force above the glass transition temperature of the polymer. Using this approach, multiscale hierarchical structures for biomimetic functional surfaces can be fabricated with precise control over geometrical parameters and the wettability of a solid surface can be designed in a controllable manner.

  • PDF

Preprocessing Effect by Using k-means Clustering and Merging .Algorithms in MR Cardiac Left Ventricle Segmentation (자기공명 심장 영상의 좌심실 경계추출에서의 k 평균 군집화와 병합 알고리즘의 사용으로 인한 전처리 효과)

  • Ik-Hwan Cho;Jung-Su Oh;Kyong-Sik Om;In-Chan Song;Kee-Hyun Chang;Dong-Seok Jeong
    • Journal of Biomedical Engineering Research
    • /
    • v.24 no.2
    • /
    • pp.55-60
    • /
    • 2003
  • For quantitative analysis of the cardiac diseases. it is necessary to segment the left-ventricle (LY) in MR (Magnetic Resonance) cardiac images. Snake or active contour model has been used to segment LV boundary. However, the contour of the LV front these models may not converge to the desirable one because the contour may fall into local minimum value due to image artifact inside of the LY Therefore, in this paper, we Propose the Preprocessing method using k-means clustering and merging algorithms that can improve the performance of the active contour model. We verified that our proposed algorithm overcomes local minimum convergence problem by experiment results.

Comparison of Document Clustering Performance Using Various Dimension Reduction Methods (다양한 차원 축소 기법을 적용한 문서 군집화 성능 비교)

  • Cho, Heeryon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.05a
    • /
    • pp.437-438
    • /
    • 2018
  • 문서 군집화 성능을 높이기 위한 한 방법으로 차원 축소를 적용한 문서 벡터로 군집화를 실시하는 방법이 있다. 본 발표에서는 특이값 분해(SVD), 커널 주성분 분석(Kernel PCA), Doc2Vec 등의 차원 축소 기법을, K-평균 군집화(K-means clustering), 계층적 병합 군집화(hierarchical agglomerative clustering), 스펙트럼 군집화(spectral clustering)에 적용하고, 그 성능을 비교해 본다.

Representation of Three-dimensional Polygonal Mesh Models Using Hierarchical Partitioning and View dependent Progressive Transmission (계층적 분할을 이용한 삼차원 다각형 메쉬 모델의 표현 및 인간 시점에 따른 점진적 전송 방법)

  • 김성열;호요성
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.132-140
    • /
    • 2003
  • In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

Clustering Method for Reduction of Cluster Center Distortion (클러스터 중심 왜곡 저감을 위한 클러스터링 기법)

  • Jeong, Hye-C.;Seo, Suk-T.;Lee, In-K.;Kwon, Soon-H.
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.3
    • /
    • pp.354-359
    • /
    • 2008
  • Clustering is a method to classify the given data set with same property into several classes. To cluster data, many methods such as K-Means, Fuzzy C-Means(FCM), Mountain Method(MM), and etc, have been proposed and used. But the clustering results of conventional methods are sensitively influenced by initial values given for clustering in each method. Especially, FCM is very sensitive to noisy data, and cluster center distortion phenomenon is occurred because the method dose clustering through minimization of within-clusters variance. In this paper, we propose a clustering method which reduces cluster center distortion through merging the nearest data based on the data weight, and not being influenced by initial values. We show the effectiveness of the proposed through experimental results applied it to various types of data sets, and comparison of cluster centers with those of FCM.

A Design of Full Flash 8-Bit CMOS A/D Converter (Full Flash 8-Bit CMOS A/D 변환기 설계)

  • Choi, Young-Gyu;Yi, Cheon-Hee
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.11
    • /
    • pp.126-134
    • /
    • 1990
  • In order to implement high-speed data acquistion system in CMOS VLSI technology, means must be found to overcome the relatively low transconductance and large device mismatch characteristic of MOS device. Because of these device limitations, circuit design approaches tradition-ally used in high-speed bipolar analog-to-digital converter(ADC) are suited to CMOS implementation. Also the design of VLSI CMOS comparator wherein voltage comparision is accomplished by means of a pipelined cascade RSA (Regenerative Sense Amplifier). So, in this paper we designed the A/D converter incorporates the pipelined CMOS comparator.

  • PDF

Vortex pairing in an axisymmetric jet using fundamental and subharmonic forcing (기본교란 및 분수조화교란을 이용한 원형제트에서의 보텍스병합)

  • Jo, Seong-Gwon;Yu, Jeong-Yeol;Choe, Hae-Cheon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.21 no.10
    • /
    • pp.1350-1362
    • /
    • 1997
  • An experimental study has been performed on vortex pairing under fundamental and subharmonic forcing with controlled initial phase differences through hot-wire measurements and a multi-smoke wire flow visualization. For the range of St$_{D}$ < 0.6, vortex pairing was controlled by means of fundamental and subharmonic forcing with varying initial phase differences. Much larger mixing rate was achieved by two-frequency forcing with a proper phase difference than one frequency forcing. As St$_{D}$ decreased, vortex pairing was limited to a narrow region of the initial phase difference between two disturbances and higher amplitudes of the fundamental and its subharmonic at the nozzle exit were required for more stable pairing. As the amplitude of the subharmonic at the nozzle exit increased for fixed St$_{D}$ and fundamental amplitude, the distribution of the subharmonic mode against the variation of the initial phase difference changed from a sine function form into a cusp-like form. Thus, vortex pairing can be controlled more precisely for the former case. For St$_{D}$ > 0.6, non-pairing advection of vortices due to the improper phase difference was sometimes observed in several fundamental forcing amplitudes when only the fundamental was applied. However, when its subharmonic was added, vortex pairing readily occurred. As the initial amplitude of this subharmonic increased, the position of vortex pairing moved upstream. This was thought to be due to the fact that the variation of the initial phase difference between the fundamental and its subharmonic has less effects on vortex pairing in the region of fundamental-only vortex pairing.pairing.