• Title/Summary/Keyword: Clustering Problem

Search Result 710, Processing Time 0.023 seconds

Confidence-based Background Subtraction Algorithm for Moving Cameras (움직이는 카메라를 위한 신뢰도 기반의 배경 제거 알고리즘)

  • Mun, Hyeok;Lee, Bok Ju;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.16 no.4
    • /
    • pp.30-35
    • /
    • 2017
  • Moving object segmentation from a nonstationary camera is a difficult problem due to the motion of both camera and the object. In this paper, we propose a new confidence-based background subtraction technique from moving camera. The method is based on clustering of motion vectors and generating adaptive multi-homography from a pair of adjacent video frames. The main innovation concerns the use of confidence images for each foreground and background motion groups. Experimental results revealed that our confidence-based approach robustly detect moving targets in sequences taken by a freely moving camera.

  • PDF

Matching game based resource allocation algorithm for energy-harvesting small cells network with NOMA

  • Wang, Xueting;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5203-5217
    • /
    • 2018
  • In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.

Femtocell Networks Interference Management Approaches

  • Alotaibi, Sultan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.329-339
    • /
    • 2022
  • Small cells, particularly femtocells, are regarded a promising solution for limited resources required to handle the increasing data demand. They usually boost wireless network capacity. While widespread usage of femtocells increases network gain, it also raises several challenges. Interference is one of such concerns. Interference management is also seen as a main obstacle in the adoption of two-tier networks. For example, placing femtocells in a traditional macrocell's geographic area. Interference comes in two forms: cross-tier and co-tier. There have been previous studies conducted on the topic of interference management. This study investigates the principle of categorization of interference management systems. Many methods exist in the literature to reduce or eliminate the impacts of co-tier, cross-tier, or a combination of the two forms of interference. Following are some of the ways provided to manage interference: FFR, Cognitive Femtocell and Cooperative Resource Scheduling, Beamforming Strategy, Transmission Power Control, and Clustering/Graph-Based. Approaches, which were proposed to solve the interference problem, had been presented for each category in this work.

Low-overhead Information Lookup in MANET (MANET 환경에서의 Low-overhead를 위한 Lookup 기법)

  • Khac Tiep Mai;Hyunseung Choo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1142-1145
    • /
    • 2008
  • This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By applying a self-adaptive multi-hop clustering, we avoid the empty region problem of grid system and omit the need of GPS device. The novelty of the proposed scheme is in its exploitation of hashing function for location querying to achieve low communication overhead. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios. Experiment results demonstrate that our scheme reduces the communication overhead significantly.

Takagi-Sugeno Fuzzy Model for Greenhouse Climate

  • Imen Haj Hamad;Amine Chouchaine;Hajer Bouzaouache
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.7
    • /
    • pp.24-30
    • /
    • 2024
  • This paper investigates the identification and modeling of a climate greenhouse. Given real climate data from greenhouse installed in the LAPER laboratory in Tunisia, the objective of this paper is to propose a solution of the problem of nonlinear time variant inputs and outputs of greenhouse internal climate. Based on fuzzy logic technique combined with least mean squares (lms) a robust greenhouse climate model for internal temperature prediction is proposed. The simulation results are presented to demonstrate the effectiveness of the identification approach and the power of the implemented Takagi-Sugeno Fuzzy model based Algorithm.

A Pattern Recognition Method of Fatigue Crack Growth on Metal using Acoustic Emission (음향방출을 이용한 금속의 피로 균열성장 패턴인식 기법)

  • Lee, Soo-Ill;Lee, Jong-Seok;Min, Hwang-Ki;Park, Cheol-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.3
    • /
    • pp.125-137
    • /
    • 2009
  • Acoustic emission-based techniques are being used for the nondestructive inspection of mechanical systems used in service. For reliable fault monitoring related to the crack growth, it is important to identify the dynamical characteristics as well as transient crack-related signals. Widely used methods which are based on physical phenomena of the three damage stages for detecting the crack growth have a problem that crack-related acoustic emission activities overlap in time, therefore it is insufficient to estimate the exact crack growth time. The proposed pattern recognition method uses the dynamical characteristics of acoustic emission as inputs for minimizing false alarms and miss alarms and performs the temporal clustering to estimate the crack growth time accurately. Experimental results show that the proposed method is effective for practical use because of its robustness to changes of acoustic emission caused by changes of pressure levels.

Enhanced FCM-based Hybrid Network for Pattern Classification (패턴 분류를 위한 개선된 FCM 기반 하이브리드 네트워크)

  • Kim, Kwang-Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1905-1912
    • /
    • 2009
  • Clustering results based on the FCM algorithm sometimes produces undesirable clustering result through data distribution in the clustered space because data is classified by comparison with membership degree which is calculated by the Euclidean distance between input vectors and clusters. Symmetrical measurement of clusters and fuzzy theory are applied to the classification to tackle this problem. The enhanced FCM algorithm has a low impact with the variation of changing distance about each cluster, middle of cluster and cluster formation. Improved hybrid network of applying FCM algorithm is proposed to classify patterns effectively. The proposed enhanced FCM algorithm is applied to the learning structure between input and middle layers, and normalized delta learning rule is applied in learning stage between middle and output layers in the hybrid network. The proposed algorithms compared with FCM-based RBF network using Max_Min neural network, FMC-based RBF network and HCM-based RBF network to evaluate learning and recognition performances in the two-dimensional coordinated data.

Visual Exploration based Approach for Extracting the Interesting Association Rules (유용한 연관 규칙 추출을 위한 시각적 탐색 기반 접근법)

  • Kim, Jun-Woo;Kang, Hyun-Kyung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.9
    • /
    • pp.177-187
    • /
    • 2013
  • Association rule mining is a popular data mining technique with a wide range of application domains, and aims to extract the cause-and-effect relations between the discrete items included in transaction data. However, analysts sometimes have trouble in interpreting and using the plethora of association rules extracted from a large amount of data. To address this problem, this paper aims to propose a novel approach called HTM for extracting the interesting association rules from given transaction data. The HTM approach consists of three main steps, hierarchical clustering, table-view, and mosaic plot, and each step provides the analysts with appropriate visual representation. For illustration, we applied our approach for analyzing the mass health examination data, and the result of this experiment reveals that the HTM approach help the analysts to find the interesting association rules in more effective way.

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.

A Grading Method for Student′s Achievements Based on the Clustering Technique (클러스터링에 기반한 학업성적의 등급화 방법)

  • Park, Eun-Jin;Chung, Hong;Jang, Duk-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.2
    • /
    • pp.151-156
    • /
    • 2002
  • There are two methods in evaluation student s achievement. The two evaluation methods are absolute evaluation and relative evaluation. They have much advantages respectively, but also have some limitations such as being too stereotyped or causing overcompetition among learners. This paper suggests a new evaluation method which evaluates student s achievements by considering the score distribution and the frequency The proposed method classifies the scores into several clusters considering the goodness. This approach calculates the goodness by applying the RE(relaxation error), and grades the achievement scores based on the goodness. The suggested method can avoid the problem of grading caused by the narrow gap of scores because it sets a standard for grading by the calculated goodness considering the score distribution and frequency of occurrence. The method can differentiate achievements of a school from those of others, and that it is useful for selecting advanced students and dull ones, and for evaluation of classes based on student s achievement.