• Title/Summary/Keyword: Time-based Clustering

Search Result 721, Processing Time 0.028 seconds

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.

Design of Nonlinear Model Using Type-2 Fuzzy Logic System by Means of C-Means Clustering (C-Means 클러스터링 기반의 Type-2 퍼지 논리 시스템을 이용한 비선형 모델 설계)

  • Baek, Jin-Yeol;Lee, Young-Il;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.6
    • /
    • pp.842-848
    • /
    • 2008
  • This paper deal with uncertainty problem by using Type-2 fuzzy logic set for nonlinear system modeling. We design Type-2 fuzzy logic system in which the antecedent and the consequent part of rules are given as Type-2 fuzzy set and also analyze the performance of the ensuing nonlinear model with uncertainty. Here, the apexes of the antecedent membership functions of rules are decided by C-means clustering algorithm and the apexes of the consequent membership functions of rules are learned by using back-propagation based on gradient decent method. Also, the parameters related to the fuzzy model are optimized by means of particle swarm optimization. The proposed model is demonstrated with the aid of two representative numerical examples, such as mathematical synthetic data set and Mackey-Glass time series data set and also we discuss the approximation as well as generalization abilities for the model.

Effective Streaming of XML Data for Wireless Broadcasting (무선 방송을 위한 효과적인 XML 스트리밍)

  • Park, Jun-Pyo;Park, Chang-Sup;Chung, Yon-Dohn
    • Journal of KIISE:Databases
    • /
    • v.36 no.1
    • /
    • pp.50-62
    • /
    • 2009
  • In wireless and mobile environments, data broadcasting is recognized as an effective way for data dissemination due to its benefits to bandwidth efficiency, energy-efficiency, and scalability. In this paper, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of the mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data which enable energy and latency-efficient broadcast of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains tag name, attributes, and text content of an element as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the wireless stream in a shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing over the stream in the mobile clients. Through extensive performance experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.

A Study on the Evacuation Performance Analysis Model Considering Clustering Types at the Fire Event in Geriatric Hospital (노인 요양병원에서 화재 시 군집유형에 따른 피난 성능 분석 모델에 관한 연구)

  • Kim, Mijung;Kweon, Jihoon
    • Journal of The Korea Institute of Healthcare Architecture
    • /
    • v.28 no.1
    • /
    • pp.63-74
    • /
    • 2022
  • Purpose: The purpose of this study is to present an evacuation performance analysis model that can derive vulnerable evacuation spaces with considering the movement behavior as per the elderly groups in the event of a fire in a geriatric hospital. Methods: The evacuation characteristics of geriatric hospital users were investigated through the review of precedent studies. First, the occupant conditions and the evacuation scenario were set to analyze a study target hospital. Then, the evacuation simulation was carried out considering the group types and the density of each group. Finally, an evacuation performance analysis model according to the group type was presented based on the simulation results. Results: The results of this study are as follows: (1) The evacuation performance according to the group type is to be clarified through the suggested study model. (2) It is necessary to secure a ramp or an emergency elevator to distribute the evacuation personnel at the design stage because congestion occurs due to collisions between evacuees on the stairs and delays the evacuation time. (3) It is necessary to consider the evacuation stairs and openings of sufficient size by analyzing the frequency of congestion occurrence and the escape routes of occupants in advance to identify the space where the evacuation flow overlaps. Implications: It is expected that the study result is to be used as primary data for studies that consider the elderly and clustering evacuation behavior in the event of a fire in a geriatric hospital.

Hair Classification and Region Segmentation by Location Distribution and Graph Cutting (위치 분포 및 그래프 절단에 의한 모발 분류와 영역 분할)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.3
    • /
    • pp.1-8
    • /
    • 2022
  • Recently, Google MedeiaPipe presents a novel approach for neural network-based hair segmentation from a single camera input specifically designed for real-time, mobile application. Though neural network related to hair segmentation is relatively small size, it produces a high-quality hair segmentation mask that is well suited for AR effects such as a realistic hair recoloring. However, it has undesirable segmentation effects according to hair styles or in case of containing noises and holes. In this study, the energy function of the test image is constructed according to the estimated prior distributions of hair location and hair color likelihood function. It is further optimized according to graph cuts algorithm and initial hair region is obtained. Finally, clustering algorithm and image post-processing techniques are applied to the initial hair region so that the final hair region can be segmented precisely. The proposed method is applied to MediaPipe hair segmentation pipeline.

Automatic detection of discontinuity trace maps: A study of image processing techniques in building stone mines

  • Mojtaba Taghizadeh;Reza Khalou Kakaee;Hossein Mirzaee Nasirabad;Farhan A. Alenizi
    • Geomechanics and Engineering
    • /
    • v.36 no.3
    • /
    • pp.205-215
    • /
    • 2024
  • Manually mapping fractures in construction stone mines is challenging, time-consuming, and hazardous. In this method, there is no physical access to all points. In contrast, digital image processing offers a safe, cost-effective, and fast alternative, with the capability to map all joints. In this study, two methods of detecting the trace of discontinuities using image processing in construction stone mines are presented. To achieve this, we employ two modified Hough transform algorithms and the degree of neighborhood technique. Initially, we introduced a method for selecting the best edge detector and smoothing algorithms. Subsequently, the Canny detector and median smoother were identified as the most efficient tools. To trace discontinuities using the mentioned methods, common preprocessing steps were initially applied to the image. Following this, each of the two algorithms followed a distinct approach. The Hough transform algorithm was first applied to the image, and the traces were represented through line drawings. Subsequently, the Hough transform results were refined using fuzzy clustering and reduced clustering algorithms, along with a novel algorithm known as the farthest points' algorithm. Additionally, we developed another algorithm, the degree of neighborhood, tailored for detecting discontinuity traces in construction stones. After completing the common preprocessing steps, the thinning operation was performed on the target image, and the degree of neighborhood for lineament pixels was determined. Subsequently, short lines were removed, and the discontinuities were determined based on the degree of neighborhood. In the final step, we connected lines that were previously separated using the method to be described. The comparison of results demonstrates that image processing is a suitable tool for identifying rock mass discontinuity traces. Finally, a comparison of two images from different construction stone mines presented at the end of this study reveals that in images with fewer traces of discontinuities and a softer texture, both algorithms effectively detect the discontinuity traces.

Managing Flow Transfers in Enterprise Datacenter Networks with Flow Chasing

  • Ren, Cheng;Wang, Sheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1519-1534
    • /
    • 2016
  • In this paper, we study how to optimize the data shuffle phase by leveraging the flow relationship in datacenter networks (DCNs). In most of the clustering computer frameworks, the completion of a transfer (a group of flows that can enable a computation stage to start or complete) is determined by the flow completing last, so that limiting the rate of other flows (not the last one) appropriately can save bandwidth without impacting the performance of any transfer. Furthermore, for the flows enter network late, more bandwidth can be assigned to them to accelerate the completion of the entire transfer. Based on these characteristics, we propose the flow chasing algorithm (FCA) to optimize the completion of the entire transfer. We implement FCA on a real testbed. By evaluation, we find that FCA can not only reduce the completion time of data transfer by 6.24% on average, but also accelerate the completion of data shuffle phase and entire job.

Convolutional Neural Network-based System for Vehicle Front-Side Detection (컨볼루션 신경망 기반의 차량 전면부 검출 시스템)

  • Park, Young-Kyu;Park, Je-Kang;On, Han-Ik;Kang, Dong-Joong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.11
    • /
    • pp.1008-1016
    • /
    • 2015
  • This paper proposes a method for detecting the front side of vehicles. The method can find the car side with a license plate even with complicated and cluttered backgrounds. A convolutional neural network (CNN) is used to solve the detection problem as a unified framework combining feature detection, classification, searching, and localization estimation and improve the reliability of the system with simplicity of usage. The proposed CNN structure avoids sliding window search to find the locations of vehicles and reduces the computing time to achieve real-time processing. Multiple responses of the network for vehicle position are further processed by a weighted clustering and probabilistic threshold decision method. Experiments using real images in parking lots show the reliability of the method.

Identification of Research Areas and Evolution of 2D Materials by the Keyword Mapping Methodology (키워드 매핑 기반 2차원 물질 연구 영역 탐지와 발전 과정 분석)

  • Ahn, Sejung;Lee, June Young
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.31 no.1
    • /
    • pp.11-18
    • /
    • 2018
  • Two-dimensional (2D) materials such as transition metal dichalcogenides have attracted tremendous scientific interests owing to their potential of solving the zero band-gap issue of graphene. In this work, the research areas and technology evolutionary dynamics of the 2D materials were identified using the scientometric method focusing on keyword mapping and clustering. The time-series analysis showed that the technological progress of 2D material is in the early growth period. The overlay mapping analysis were carried out to investigate the technology evolution of 2D materials with time. The strategic diagram of co-word analysis classifying the topological positions of keyword was derived to support the analysis results. It is conjectured that extensive research will be conducted widely on the application of 2D materials not only in electronic and optoelectronic devices, but also in various other fields such as biomedical applications, and that their development will be more rapid based on accumulated results of extant graphene research.

A Study on the Forming Failure Inspection of Small and Multi Pipes (소형 다품종 파이프의 실시간 성형불량 검사 시스템에 관한 연구)

  • 김형석;이회명;이병룡;양순용;안경관
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.11
    • /
    • pp.61-68
    • /
    • 2004
  • Recently, there has been an increasing demand for computer-vision based inspection and/or measurement system as a part of factory automation equipment. Existing manual inspection method can inspect only specific samples and has low measuring accuracy as well as it increases working time. Thus, in order to improve the objectivity and reproducibility, computer-aided analysis method is needed. In this paper, front and side profile inspection and/or data transfer system are developed using computer-vision during the inspection process on three kinds of pipes coming from a forming line. Straight line and circle are extracted from profiles obtained from vision using Laplace operator. To reduce inspection time, Hough Transform is used with clustering method for straight line detection and the center points and diameters of inner and outer circle are found to determine eccentricity and whether good or bad. Also, an inspection system has been built that each pipe's data and images of good/bad test are stored as files and transferred to the server so that the center can manage them.