• Title/Summary/Keyword: 블록 기반 클러스터링

Search Result 17, Processing Time 0.02 seconds

Motion Object Segmentation based on Clustering using Color and Position features (색상과 위치정보를 이용한 클러스터링 기반의 움직이는 객체의 검출)

  • 정윤주;김성동;최기호
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.11a
    • /
    • pp.306-308
    • /
    • 2003
  • 본 논문은 컬러영상내 움직이는 객체의 효과적인 검출을 위해 색상과 위치정보를 적용시킨 K-means 클러스터링 알고리즘을 이용하여 움직이는 객체들을 추출한 방법을 제안하고 있다. 최종 클러스터링된 중심픽셀(prototype)이 갖고있는 RGB 값을 사용해 프레임을 비교해 객체와 배경의 분리를 가능하게 했고 마지막으로 후처리를 이용해 남아있는 배경잡음을 제거하였다. 본 연구의 실험은 여러 교통장면을 포함한 다양한 영상에서 이루어졌으며 실험결과 제안된 알고리즘은 기존의 픽셀이나 블록기반의 방법에 비해 보다 정확한 객체 검출이 가능했으며 한 가지 특징 정보를 사용한 클러스터링에 비해 보다 높은 정확도를 보였다.

  • PDF

Motion Segmentation based on Modified Hierarchical Block-based Motion Estimation and Contour Extraction (블록 기반 움직임 추정과 윤곽선 추출을 통한 움직임 분할)

  • 장정진;김태용;최종수
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.333-336
    • /
    • 2001
  • 본 논문에서는 영상 시퀀스 상에서 물체의 가려짐을 고려하여 상대적인 깊이 순서에 의해 정렬되는 계층을 분리하기 위한 새로운 움직임 분할 방법을 제안한다. 블록을 기반으로 한 움직임 추정 및 클러스터링 과정을 통하여 각 계층에 대한 블록영역을 구하고, 이 블록영역에 대하여 윤곽선 추출을 이용하여 각 계층에 대한 정확한 객체를 분리할 수 있다. 이러한 움직임 분할방법을 통한 동영상의 계층적인 표현은 영상에서 원하지 않는 물체, 전경, 배경의 제거나 기존의 영상을 이용한 새로운 영상의 합성에 이용될 수 있으며, 분할을 통해 얻어진 객체는 영상 압축, 영상 합성 등을 위한 데이터베이스에 저장되어 응용될 수 있다.

  • PDF

Fingerprint Image Quality Analysis for Knowledge-based Image Enhancement (지식기반 영상개선을 위한 지문영상의 품질분석)

  • 윤은경;조성배
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.7
    • /
    • pp.911-921
    • /
    • 2004
  • Accurate minutiae extraction from input fingerprint images is one of the critical modules in robust automatic fingerprint identification system. However, the performance of a minutiae extraction is heavily dependent on the quality of the input fingerprint images. If the preprocessing is performed according to the fingerprint image characteristics in the image enhancement step, the system performance will be more robust. In this paper, we propose a knowledge-based preprocessing method, which extracts S features (the mean and variance of gray values, block directional difference, orientation change level, and ridge-valley thickness ratio) from the fingerprint images and analyzes image quality with Ward's clustering algorithm, and enhances the images with respect to oily/neutral/dry characteristics. Experimental results using NIST DB 4 and Inha University DB show that clustering algorithm distinguishes the image Quality characteristics well. In addition, the performance of the proposed method is assessed using quality index and block directional difference. The results indicate that the proposed method improves both the quality index and block directional difference.

Cause Diagnosis Method of Semiconductor Defects using Block-based Clustering and Histogram x2 Distance (블록 기반 클러스터링과 히스토그램 카이 제곱 거리를 이용한 반도체 결함 원인 진단 기법)

  • Lee, Young-Joo;Lee, Jeong-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.9
    • /
    • pp.1149-1155
    • /
    • 2012
  • In this paper, we propose cause diagnosis method of semiconductor defects from semiconductor industrial images. Our method constructs feature database (DB) of defect images. Then, defect and input images are subdivided by uniform block. And the block similarity is measured using histogram kai-square distance after color histogram calculation. Then, searched blocks in each image are merged into connected objects using clustering. Finally, the most similar defect image from feature DB is searched with the defect cause by measuring cluster similarity based on features of each cluster. Our method was validated by calculating the search accuracy of n output images having high similarity. With n = 1, 2, 3, the search accuracy was measured to be 100% regardless of defect categories. Our method could be used for the industrial applications.

Moving Object Segmentation Using the Clustering of Region Trajectories (영역 궤적의 클러스터링을 이용한 비디오 영상에서의 움직이는 객체의 검출)

  • 권영진;이재호;김회율
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.15-18
    • /
    • 2001
  • 동영상에서 움직이는 객체 검출은 동영상의 내용을 표현하고 유사한 동영상을 검색하는 데 있어 중요한 특징간을 추출하는 방법으로 사용된다. 그러나 복잡하게 카메라가 움직이는 동영상에서 움직이는 객체 검출은 아직까지 어려운 과제이다. 본 논문에서는 복잡한 카메라의 움직임이 있는 환경에서 움직이는 객체를 강인하게 검출하는 방법을 제안한다. 움직이는 객체 검출 방법은 입력 영상을 색상간의 클러스터링을 이용하여 각 영역으로 구분하는 Mean Shift 알고리즘과 인접한 프레임에서 구분된 영역을 대응시켜 영역의 모션 벡터를 구하는 영역 매칭, 유사한 궤적을 가지는 영역들의 클러스터링을 이용하여 객체를 검출하는 궤적 클러스터링 알고리즘을 사용한다. 제안한 영역 기반 알고리즘은 기존의 픽셀이나 블록 기반의 방법보다 움직이는 객체를 정확하게 검출하였다. 실험 결과 복잡하게 움직이는 카메라의 환경 속에서 움직이는 객체를 강인하게 검출하였다.

  • PDF

iSCSI Protocol-based Clustering Storage System for supporting Multimedia Contents (iSCSI 프로토콜 기반의 멀티미디어 콘텐츠 서비스지원을 위한 클러스터링 저장시스템)

  • Kim, Moon-Kyung;Kim, Sun-Tae;No, Jae-Chun;Park, Sung-Sun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06b
    • /
    • pp.489-493
    • /
    • 2008
  • 본 논문은 블록단위 데이터 접근이 가능하며, 같은 데이터로의 동시 접근을 제어할 수 있는 록서비스 기능을 지원하는 iSCSI 기반의 클러스터링 저장 시스템을 제안한다. 본 논문에서 제시되는 iSCSI 기반의 클러스터링 시스템은 중.소 규모의 저장 시스템 구축에 유용하게 활용될 수 있고, 동시에 빠른 성능의 멀티미디어 데이터 서비스를 제공할 수 있다.

  • PDF

EPR : Enhanced Parallel R-tree Indexing Method for Geographic Information System (EPR : 지리 정보 시스템을 위한 향상된 병렬 R-tree 색인 기법)

  • Lee, Chun-Geun;Kim, Jeong-Won;Kim, Yeong-Ju;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2294-2304
    • /
    • 1999
  • Our research purpose in this paper is to improve the performance of query processing in GIS(Geographic Information System) by enhancing the I/O performance exploiting parallel I/O and efficient disk access. By packing adjacent spatial data, which are very likely to be referenced concurrently, into one block or continuous disk blocks, the number of disk accesses and the disk access overhead for query processing can be decreased, and this eventually leads to the I/O time decrease. So, in this paper, we proposes EPR(Enhanced Parallel R-tree) indexing method which integrates the parallel I/O method of the previous Parallel R-tree method and a packing-based clustering method. The major characteristics of EPR method are as follows. First, EPR method arranges spatial data in the increasing order of proximity by using Hilbert space filling curve, and builds a packed R-tree by bottom-up manner. Second, with packing-based clustering in which arranged spatial data are clustered into continuous disk blocks, EPR method generates spatial data clusters. Third, EPR method distributes EPR index nodes and spatial data clusters on multiple disks through round-robin striping. Experimental results show that EPR method achieves up to 30% or more gains over PR method in query processing speed. In particular, the larger the size of disk blocks is and the smaller the size of spatial data objects is, the better the performance of query processing by EPR method is.

  • PDF

A Method of Image Matching by 2D Alignment of Unit Block based on Comparison between Block Content (단위블록의 색공간 내용비교 기반 2차원 블록정렬을 이용한 이미지 매칭방법)

  • Jang, Chul-Jin;Cho, Hwan-Gue
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.611-615
    • /
    • 2009
  • Due to the popular use of digital camera, a great number of photos are taken at every usage of camera. It is essential to reveal relationship between photos to manage digital photos efficiently. We propose a method that tessellates image into unit blocks and applies 2D alignment to extend content-based similar region from seed block pair having high similarity. Through an alignment, we can get a block region scoring best matching value on whole image. The method can distinguish whether photos are sharing the same object or background. Our result is less sensitive to transition or pause change of objects. In experiment, we show how our alignment method is applied to real photo and necessities for further research like photo clustering and massive photo management.

A Clustering File Backup Server Using Multi-level De-duplication (다단계 중복 제거 기법을 이용한 클러스터 기반 파일 백업 서버)

  • Ko, Young-Woong;Jung, Ho-Min;Kim, Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.657-668
    • /
    • 2008
  • Traditional off-the-shelf file server has several potential drawbacks to store data blocks. A first drawback is a lack of practical de-duplication consideration for storing data blocks, which leads to worse storage capacity waste. Second drawback is the requirement for high performance computer system for processing large data blocks. To address these problems, this paper proposes a clustering backup system that exploits file fingerprinting mechanism for block-level de-duplication. Our approach differs from the traditional file server systems in two ways. First, we avoid the data redundancy by multi-level file fingerprints technology which enables us to use storage capacity efficiently. Second, we applied a cluster technology to I/O subsystem, which effectively reduces data I/O time and network bandwidth usage. Experimental results show that the requirement for storage capacity and the I/O performance is noticeably improved.

A Customer Segmentation Scheme Base on Big Data in a Bank (빅데이터를 활용한 은행권 고객 세분화 기법 연구)

  • Chang, Min-Suk;Kim, Hyoung Joong
    • Journal of Digital Contents Society
    • /
    • v.19 no.1
    • /
    • pp.85-91
    • /
    • 2018
  • Most banks use only demographic information such as gender, age, occupation and address to segment customers, but they do not reflect financial behavior patterns of customers. In this study, we aim to solve the problems by using various big data in a bank and to develop customer segmentation method which can be widely used in many banks in the future. In this paper, we propose an approach of segmenting clustering blocks with bottom-up method. This method has an advantage that it can accurately reflect various financial needs of customers based on various transaction patterns, channel contact patterns, and existing demographic information. Based on this, we will develop various marketing models such as product recommendation, financial need rating calculation, and customer churn-out prediction based on this, and we will adapt this models for the marketing strategy of NH Bank.