• Title/Summary/Keyword: 3D Clustering

Search Result 207, Processing Time 0.031 seconds

2D-THI: Two-Dimensional Type Hierarchy Index for XML Databases (2D-THI: XML 데이테베이스를 위한 이차원 타입상속 계층색인)

  • Lee Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.3
    • /
    • pp.265-278
    • /
    • 2006
  • This paper presents a two-dimensional type inheritance hierarchy index(2D-THI) for XML databases. XML Schema is one of schema models for the XML documents supporting. The type inheritance. The conventional indexing techniques for XML databases can not support XML queries on type inheritance hierarchies. We construct a two-dimensional index structure using multidimensional file organizations for supporting type inheritance hierarchy in XML queries. This indexing technique deals with the problem of clustering index entries in the two-dimensional domain space that consists of a key element domain and a type identifier domain based on the user query pattern. This index enhances query performance by adjusting the degree of clustering between the two domains. For performance evaluation, we have compared our proposed 2D-THI with the conventional class hierarchy indexing techniques in object-oriented databases such as CH-index and CG-tree through the cost model. As the result of the performance evaluations, we have verified that our proposed two-dimensional type inheritance indexing technique can efficiently support the query Processing in XML databases according to the query types.

  • PDF

Calibration of 3D Coordinates in Orthogonal Stereo Vision (직교식 스테레오 비젼에서의 3차원 좌표 보정)

  • Yoon, Hee-Joo;Seo, Young-Wuk;Bae, Jung-Soo;Cha, Eui-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.504-507
    • /
    • 2005
  • In this paper, we propose a calibration technique of 3D coordinates using orthogonal stereo vision. First, we acquire front- image and upper- image from stereo cameras with real time and extract each coordinates of a moving object using differential operation and ART2 clustering algorithm. Then, we can generate 3D coordinates of that moving object through combining these two coordinates. Finally, we calibrate 3D coordinates using orthogonal stereo vision since 3D coordinates are not accurate due to perspective. Experimental results show that accurate 3D coordinates of a moving object can be generated by the proposed calibration technique.

  • PDF

Visual Semantic Based 3D Video Retrieval System Using HDFS

  • Ranjith Kumar, C.;Suguna, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3806-3825
    • /
    • 2016
  • This paper brings out a neoteric frame of reference for visual semantic based 3d video search and retrieval applications. Newfangled 3D retrieval application spotlight on shape analysis like object matching, classification and retrieval not only sticking up entirely with video retrieval. In this ambit, we delve into 3D-CBVR (Content Based Video Retrieval) concept for the first time. For this purpose we intent to hitch on BOVW and Mapreduce in 3D framework. Here, we tried to coalesce shape, color and texture for feature extraction. For this purpose, we have used combination of geometric & topological features for shape and 3D co-occurrence matrix for color and texture. After thriving extraction of local descriptors, TB-PCT (Threshold Based- Predictive Clustering Tree) algorithm is used to generate visual codebook. Further, matching is performed using soft weighting scheme with L2 distance function. As a final step, retrieved results are ranked according to the Index value and produce results .In order to handle prodigious amount of data and Efficacious retrieval, we have incorporated HDFS in our Intellection. Using 3D video dataset, we fiture the performance of our proposed system which can pan out that the proposed work gives meticulous result and also reduce the time intricacy.

Vertex Detection of 3-D Data Using FCV Clustering Algorithm (FCE 클러스터링 알고리듬을 이용한 3차원 데이터의 정점 검출)

  • Choi, Byeong-Geol;Lee, Won-Hui;Kang, Hun
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.03a
    • /
    • pp.24-27
    • /
    • 1998
  • 최근 컴퓨터의 속도 및 용량의 확장과 더불어 3차원 정보에 대한 연구의 필요성이 요구되고 있다. 본 논문에서는이 여기에 관한 연구의 하나로 FCV(Fuzzy c-Varieties)클러스터링의 방법을 써서 3차원 데이터의 변과 장점을 찾아 3차원 물체를 구성하여 중복된 자료의 크기를 압축하는 방법을 제시한다. 여기에 따른 문제점으로 클러스터의 개수를 결정하는 문제가 있는데 이는 fuzzy classification entropy로 해결하였다.

  • PDF

Human Action Recognition Based on 3D Human Modeling and Cyclic HMMs

  • Ke, Shian-Ru;Thuc, Hoang Le Uyen;Hwang, Jenq-Neng;Yoo, Jang-Hee;Choi, Kyoung-Ho
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.662-672
    • /
    • 2014
  • Human action recognition is used in areas such as surveillance, entertainment, and healthcare. This paper proposes a system to recognize both single and continuous human actions from monocular video sequences, based on 3D human modeling and cyclic hidden Markov models (CHMMs). First, for each frame in a monocular video sequence, the 3D coordinates of joints belonging to a human object, through actions of multiple cycles, are extracted using 3D human modeling techniques. The 3D coordinates are then converted into a set of geometrical relational features (GRFs) for dimensionality reduction and discrimination increase. For further dimensionality reduction, k-means clustering is applied to the GRFs to generate clustered feature vectors. These vectors are used to train CHMMs separately for different types of actions, based on the Baum-Welch re-estimation algorithm. For recognition of continuous actions that are concatenated from several distinct types of actions, a designed graphical model is used to systematically concatenate different separately trained CHMMs. The experimental results show the effective performance of our proposed system in both single and continuous action recognition problems.

Cosmological Tests using Redshift Space Clustering in BOSS DR11

  • Song, Yong-Seon;Sabiu, Cristiano G.;Okumura, Teppei;Oh, Minji;Linder, Eric V.
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.40 no.1
    • /
    • pp.43.3-44
    • /
    • 2015
  • We analyze the clustering of large scale structure in the Universe in a model independent method, accounting for anisotropic effects along and transverse to the line of sight. A large sample of 690,000 galaxies from The Baryon Oscillation Spectroscopy Survey Data Release 11 are used to determine the Hubble expansion H, angular distance D_A, and growth rate GT at an effective redshift of z=0.57. After careful bias and convergence studies of the effects from small scale clustering, we find that cutting transverse separations below 40 Mpc/h delivers robust results while smaller scale data leads to a bias due to unmodelled nonlinear and velocity effects. The converged results are in agreement with concordance LCDM cosmology, general relativity, and minimal neutrino mass, all within the $68{\backslash}%$ confidence level. We also present results separately for the northern and southern hemisphere sky, finding a slight tension in the growth rate -- potentially a signature of anisotropic stress, or just covariance with small scale velocities -- but within $68{\backslash}%$ CL.

  • PDF

Segmentation and Classification of 3-D Object from Range Information (Range 정보로부터 3차원 물체 분할 및 식별)

  • 황병곤;조석제;하영호;김수중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.120-129
    • /
    • 1990
  • In this paper, 3-dimensional object segmentation and classification are proposed. Planar object is segmented surface using jump boundary and internal boundary. Curved object is segmented surfaces by maximin clustering method. Segmented surfaces are classified by depth trends and angle measurement of normal vectors. Classified surfaces are merged according to adjacent surfaces and compared to Guassian curvature and mean curvature method. The proposed methods have been successfully applied to the synthetic range images and shows good classification.

  • PDF

Policies of Trajectory Clustering in Index based on R-trees for Moving Objects (이동체를 위한 R-트리 기반 색인에서의 궤적 클러스터링 정책)

  • Ban ChaeHoon;Kim JinGon;Jun BongGi;Hong BongHee
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.507-520
    • /
    • 2005
  • The R-trees are usually used for an index of trajectories in moving-objects databases. However, they need to access a number of nodes to trace same trajectories because of considering only a spatial proximity. Overlaps and dead spaces should be minimized to enhance the performance of range queries in moving-objects indexes. Trajectories of moving-objects should be preserved to enhance the performance of the trajectory queries. In this paper, we propose the TP3DR-tree(Trajectory Preserved 3DR-tree) using clusters of trajectories for range and trajectory queries. The TP3DR-tree uses two split policies: one is a spatial splitting that splits the same trajectory by clustering and the other is a time splitting that increases space utilization. In addition, we use connecting information in non-leaf nodes to enhance the performance of combined-queries. Our experiments show that the new index outperforms the others in processing queries on various datasets.

Development of improved image processing algorithms for an automated inspection system using line scan cameras (Line scan camera를 이용한 검사 시스템에서의 새로운 영상 처리 알고리즘)

  • Jang, Dong-Sik;Lee, Man-Hee;Bou, Chang-Wan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.4
    • /
    • pp.406-414
    • /
    • 1997
  • A real-time inspection system is developed using line scan cameras. Several improved algorithms are proposed for real-time detection of defects in this automated inspection system. The major improved algorithms include the preprocessing, the threshold decision, and the clustering algorithms. The preprocessing algorithms are for exact binarization and the threshold decision algorithm is for fast detection of defects in 1-D binary images. The clustering algorithm is also developed for fast classifying of the defects. The system is applied to PCBs(Printed Circuit Boards) inspection. The typical defects in PCBs are pits, dent, wrinkle, scratch, and black spots. The results show that most defects are detected and classified successfully.

  • PDF

The HCARD Model using an Agent for Knowledge Discovery

  • Gerardo Bobby D.;Lee Jae-Wan;Joo Su-Chong
    • The Journal of Information Systems
    • /
    • v.14 no.3
    • /
    • pp.53-58
    • /
    • 2005
  • In this study, we will employ a multi-agent for the search and extraction of data in a distributed environment. We will use an Integrator Agent in the proposed model on the Hierarchical Clustering and Association Rule Discovery(HCARD). The HCARD will address the inadequacy of other data mining tools in processing performance and efficiency when use for knowledge discovery. The Integrator Agent was developed based on CORBA architecture for search and extraction of data from heterogeneous servers in the distributed environment. Our experiment shows that the HCARD generated essential association rules which can be practically explained for decision making purposes. Shorter processing time had been noted in computing for clusters using the HCARD and implying ideal processing period than computing the rules without HCARD.

  • PDF