• Title/Summary/Keyword: 3D 클러스터링

Search Result 68, Processing Time 0.027 seconds

Automatic Color Palette Extraction for Paintings Using Color Grouping and Clustering (색상 그룹핑과 클러스터링을 이용한 회화 작품의 자동 팔레트 추출)

  • Lee, Ik-Ki;Lee, Chang-Ha;Park, Jae-Hwa
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.7
    • /
    • pp.340-353
    • /
    • 2008
  • A computational color palette extraction model is introduced to describe paint brush objectively and efficiently. In this model, a color palette is defined as a minimum set of colors in which a painting can be displayed within error allowance and extracted by the two step processing of color grouping and major color extraction. The color grouping controls the resolution of colors adaptively and produces a basic color set of given painting images. The final palette is obtained from the basic color set by applying weighted k-means clustering algorithm. The extracted palettes from several famous painters are displayed in a 3-D color space to show the distinctive palette styles using RGB and CIE LAB color models individually. And the two experiments of painter classification and color transform of photographic image has been done to check the performance of the proposed method. The results shows the possibility that the proposed palette model can be a computational color analysis metric to describe the paint brush, and can be a color transform tool for computer graphics.

Adaptive Load Balancing Scheme using a Combination of Hierarchical Data Structures and 3D Clustering for Parallel Volume Rendering on GPU Clusters (계층 자료구조의 결합과 3차원 클러스터링을 이용하여 적응적으로 부하 균형된 GPU-클러스터 기반 병렬 볼륨 렌더링)

  • Lee Won-Jong;Park Woo-Chan;Han Tack-Don
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.1_2
    • /
    • pp.1-14
    • /
    • 2006
  • Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

Fault Diagnosis of 3 Phase Induction Motor Drive System Using Clustering (클러스터링 기법을 이용한 3상 유도전동기 구동시스템의 고장진단)

  • Park, Jang-Hwan;Kim, Sung-Suk;Lee, Dae-Jong;Chun, Myung-Geun
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.6
    • /
    • pp.70-77
    • /
    • 2004
  • In many industrial applications, an unexpected fault of induction motor drive systems can cause serious troubles such as downtime of the overall system heavy loss, and etc. As one of methods to solve such problems, this paper investigates the fault diagnosis for open-switch damages in a voltage-fed PWM inverter for induction motor drive. For the feature extraction of a fault we transform the current signals to the d-q axis and calculate mean current vectors. And then, for diagnosis of different fault patterns, we propose a clustering based diagnosis algorithm The proposed diagnostic technique is a modified ANFIS(Adaptive Neuro-Fuzzy Inference System) which uses a clustering method on the premise of general ANFIS's. Therefore, it has a small calculation and good performance. Finally, we implement the method for the diagnosis module of the inverter with MATLAB and show its usefulness.

Semantic Object Detection based on LiDAR Distance-based Clustering Techniques for Lightweight Embedded Processors (경량형 임베디드 프로세서를 위한 라이다 거리 기반 클러스터링 기법을 활용한 의미론적 물체 인식)

  • Jung, Dongkyu;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.10
    • /
    • pp.1453-1461
    • /
    • 2022
  • The accuracy of peripheral object recognition algorithms using 3D data sensors such as LiDAR in autonomous vehicles has been increasing through many studies, but this requires high performance hardware and complex structures. This object recognition algorithm acts as a large load on the main processor of an autonomous vehicle that requires performing and managing many processors while driving. To reduce this load and simultaneously exploit the advantages of 3D sensor data, we propose 2D data-based recognition using the ROI generated by extracting physical properties from 3D sensor data. In the environment where the brightness value was reduced by 50% in the basic image, it showed 5.3% higher accuracy and 28.57% lower performance time than the existing 2D-based model. Instead of having a 2.46 percent lower accuracy than the 3D-based model in the base image, it has a 6.25 percent reduction in performance time.

Color Image Segmentation Using Anisotropic Diffusion and Agglomerative Hierarchical Clustering (비등방형 확산과 계층적 클러스터링을 이용한 칼라 영상분할)

  • 김대희;안충현;호요성
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.377-380
    • /
    • 2003
  • A new color image segmentation scheme is presented in this paper. The proposed algorithm consists of image simplification, region labeling and color clustering. The vector-valued diffusion process is performed in the perceptually uniform LUV color space. We present a discrete 3-D diffusion model for easy implementation. The statistical characteristics of each labeled region are employed to estimate the number of total clusters and agglomerative hierarchical clustering is performed with the estimated number of clusters. Since the proposed clustering algorithm counts each region as a unit, it does not generate oversegmentation along region boundaries.

  • PDF

Clustering based Normal Vector Compression of 3D Model (클러스터링기법을 이용한 3차원 모델의 법선 벡터 압축)

  • Cho Youngsong;Kim Deok-Soo
    • Proceedings of the Society of Korea Industrial and System Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.455-460
    • /
    • 2002
  • As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. The issues for normal vectors have not yet been explored as much as it deserves, even though the size of the data for normal vectors can be significantly larger than its counterparts of topology and geometry. Presented in this paper is an approach to compress the normal vectors of a shape model represented in a mesh using the concept of clustering. It turns out that the proposed approach has a significant compression ratio without a serious sacrifice of the visual quality of the model.

  • PDF

Design of Clustering based Smart Platform for 3D Position (클러스터링 기반의 3D 위치표시용 스마트 플랫폼설계)

  • Kang, Min-Goo
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.1
    • /
    • pp.56-61
    • /
    • 2015
  • In this paper, the 3D positioning of IoT sensors with the Unity engine of android platform based home-hub was proposde for IoT(Internet of Things) users. Especially, the monitoring of IoT sensor and battery status was designed with the clustering of IoT sensor's position. The 3D positioning of RSSI(received signal strength indicator) and angle for new IoT sensor according to clustering method was described with the cooperation of beacon and received arrival signal time. This unity engine based smart hub platform can monitor the working situation of IoT sensors, and apply 3D video with texture for the life-cycling of many IoT sensors simultaneously. rs was described with RSSI(received signal strength indicator) and received angle.

Corrupted Region Restoration based on 2D Tensor Voting (2D 텐서 보팅에 기반 한 손상된 텍스트 영상의 복원 및 분할)

  • Park, Jong-Hyun;Toan, Nguyen Dinh;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.15B no.3
    • /
    • pp.205-210
    • /
    • 2008
  • A new approach is proposed for restoration of corrupted regions and segmentation in natural text images. The challenge is to fill in the corrupted regions on the basis of color feature analysis by second order symmetric stick tensor. It is show how feature analysis can benefit from analyzing features using tensor voting with chromatic and achromatic components. The proposed method is applied to text images corrupted by manifold types of various noises. Firstly, we decompose an image into chromatic and achromatic components to analyze images. Secondly, selected feature vectors are analyzed by second-order symmetric stick tensor. And tensors are redefined by voting information with neighbor voters, while restore the corrupted regions. Lastly, mode estimation and segmentation are performed by adaptive mean shift and separated clustering method respectively. This approach is automatically done, thereby allowing to easily fill-in corrupted regions containing completely different structures and surrounding backgrounds. Applications of proposed method include the restoration of damaged text images; removal of superimposed noises or streaks. We so can see that proposed approach is efficient and robust in terms of restoring and segmenting text images corrupted.

The Pattern Segmentation of 3D Image Information Using FCM (FCM을 이용한 3차원 영상 정보의 패턴 분할)

  • Kim Eun-Seok;Joo Ki-See
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.871-876
    • /
    • 2006
  • In this thesis, to accurately measure 3D face information using the spatial encoding patterns, the new algorithm to segment the pattern images from initial face pattern image is proposed. If the obtained images is non-homogeneous texture and ambiguous boundary pattern, the pattern segmentation is very difficult. Furthermore. the non-encoded areas by accumulated error are occurred. In this thesis, the FCM(fuzzy c-means) clustering method is proposed to enhance the robust encoding and segmentation rate under non-homogeneous texture and ambiguous boundary pattern. The initial parameters for experiment such as clustering class number, maximum repetition number, and error tolerance are set with 2, 100, 0.0001 respectively. The proposed pattern segmentation method increased 8-20% segmentation rate with conventional binary segmentation methods.

A Feature-Extraction Method based on shapes of 3D Object (3차원 객체의 모양에 기반한 특징추출 기법)

  • 신준섭;황수찬
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.70-72
    • /
    • 2001
  • 최근 멀티미디어 응용의 증가에 따라 그래픽 데이터를 위한 내용 기반 검색 기술에 대한 연구가 활발히 진행되고 있다. 또한 인터넷 응용분야에서 3차원 그래픽 데이터베이스 사용의 필요성이 대두되고 활용되고 있다. 대부분의 3차원 그래픽 시스템은 사용자에게 그래픽은 검색이 대상이 아니라 단순히 보여주는 역할로 주로 사용되고 있다. 3차원 그래픽객체는 어떤 객체들로 구성되여 있으며 그들의 크기는 어떠한지 등의 정보를 포함하고 있다. 따라서 3차원 그래픽 객체에서는 2차원 그래픽 객체에서는 2차원 이미지보다 의미객체에 대한 정확한 정보를 더 많이 얻어 낼 수 있다. 이러한 사실 때문에 2차원 이미지의 특징추출의 방법과는 다른 형식의 접근이 필요하다. 본 논문에서는 3차원 그래픽으로 모델링 된 3차원 객체들을 대상으로 객체가 이루는 X, Y, Z축상의 비율과 윤곽형태에 대한 SPBT(Space Partitioning Binary Tree)의 결과값으로 특징을 추출하고 샘플 데이터를 통해서 이들간의 클러스터링과 실제 예제 질의를 토한 비교분석을 통해 객체간의 유사검색이 가능하도록 하는 특징추출 방법을 제안하였다. 본 논문에서는 제시한 모양기반 특징추출 방법은 웹상의 다양한 3차원 객체정보의 자동분류나 3차원 그래픽 데이터베이스를 위한 인덱스 구축 등에 활용될 수 있을 것이다.

  • PDF