• Title/Summary/Keyword: Clustering detection

Search Result 516, Processing Time 0.025 seconds

Community Detection using Closeness Similarity based on Common Neighbor Node Clustering Entropy

  • Jiang, Wanchang;Zhang, Xiaoxi;Zhu, Weihua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2587-2605
    • /
    • 2022
  • In order to efficiently detect community structure in complex networks, community detection algorithms can be designed from the perspective of node similarity. However, the appropriate parameters should be chosen to achieve community division, furthermore, these existing algorithms based on the similarity of common neighbors have low discrimination between node pairs. To solve the above problems, a noval community detection algorithm using closeness similarity based on common neighbor node clustering entropy is proposed, shorted as CSCDA. Firstly, to improve detection accuracy, common neighbors and clustering coefficient are combined in the form of entropy, then a new closeness similarity measure is proposed. Through the designed similarity measure, the closeness similar node set of each node can be further accurately identified. Secondly, to reduce the randomness of the community detection result, based on the closeness similar node set, the node leadership is used to determine the most closeness similar first-order neighbor node for merging to create the initial communities. Thirdly, for the difficult problem of parameter selection in existing algorithms, the merging of two levels is used to iteratively detect the final communities with the idea of modularity optimization. Finally, experiments show that the normalized mutual information values are increased by an average of 8.06% and 5.94% on two scales of synthetic networks and real-world networks with real communities, and modularity is increased by an average of 0.80% on the real-world networks without real communities.

Research on the Hybrid Paragraph Detection System Using Syntactic-Semantic Analysis (구문의미 분석을 활용한 복합 문단구분 시스템에 대한 연구)

  • Kang, Won Seog
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.1
    • /
    • pp.106-116
    • /
    • 2021
  • To increase the quality of the system in the subjective-type question grading and document classification, we need the paragraph detection. But it is not easy because it is accompanied by semantic analysis. Many researches on the paragraph detection solve the detection problem using the word based clustering method. However, the word based method can not use the order and dependency relation between words. This paper suggests the paragraph detection system using syntactic-semantic relation between words with the Korean syntactic-semantic analysis. This system is the hybrid system of word based, concept based, and syntactic-semantic tree based detection. The experiment result of the system shows it has the better result than the word based system. This system will be utilized in Korean subjective question grading and document classification.

Video Abstracting Using Scene Change Detection and Sho Clustering for Construction of Efficient Video Database (비디오 데이터베이스 구축을 위하여 장면전환 검출과 샷 클러스터링을 이용한 비디오 개요 추출)

  • 표성배
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.4
    • /
    • pp.75-82
    • /
    • 2002
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper Propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with χ2 histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

Optimal Parameter Analysis and Evaluation of Change Detection for SLIC-based Superpixel Techniques Using KOMPSAT Data (KOMPSAT 영상을 활용한 SLIC 계열 Superpixel 기법의 최적 파라미터 분석 및 변화 탐지 성능 비교)

  • Chung, Minkyung;Han, Youkyung;Choi, Jaewan;Kim, Yongil
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.6_3
    • /
    • pp.1427-1443
    • /
    • 2018
  • Object-based image analysis (OBIA) allows higher computation efficiency and usability of information inherent in the image, as it reduces the complexity of the image while maintaining the image properties. Superpixel methods oversegment the image with a smaller image unit than an ordinary object segment and well preserve the edges of the image. SLIC (Simple linear iterative clustering) is known for outperforming the previous superpixel methods with high image segmentation quality. Although the input parameter for SLIC, number of superpixels has considerable influence on image segmentation results, impact analysis for SLIC parameter has not been investigated enough. In this study, we performed optimal parameter analysis and evaluation of change detection for SLIC-based superpixel techniques using KOMPSAT data. Forsuperpixel generation, three superpixel methods (SLIC; SLIC0, zero parameter version of SLIC; SNIC, simple non-iterative clustering) were used with superpixel sizes in ranges of $5{\times}5$ (pixels) to $50{\times}50$ (pixels). Then, the image segmentation results were analyzed for how well they preserve the edges of the change detection reference data. Based on the optimal parameter analysis, image segmentation boundaries were obtained from difference image of the bi-temporal images. Then, DBSCAN (Density-based spatial clustering of applications with noise) was applied to cluster the superpixels to a certain size of objects for change detection. The changes of features were detected for each superpixel and compared with reference data for evaluation. From the change detection results, it proved that better change detection can be achieved even with bigger superpixel size if the superpixels were generated with high regularity of size and shape.

Voice Activity Detection Algorithm using Fuzzy Membership Shifted C-means Clustering in Low SNR Environment (낮은 신호 대 잡음비 환경에서의 퍼지 소속도 천이 C-means 클러스터링을 이용한 음성구간 검출 알고리즘)

  • Lee, G.H.;Lee, Y.J.;Cho, J.H.;Kim, M.N.
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.312-323
    • /
    • 2014
  • Voice activity detection is very important process that find voice activity from noisy speech signal for noise cancelling and speech enhancement. Over the past few years, many studies have been made on voice activity detection, it has poor performance for speech signal of sentence form in a low SNR environment. In this paper, it proposed new voice activity detection algorithm that has beginning VAD process using entropy and main VAD process using fuzzy membership shifted c-means clustering. We conduct an experiment in various SNR environment of white noise to evaluate performance of the proposed algorithm and confirmed good performance of the proposed algorithm.

Supervoxel-based Staircase Detection from Range Data

  • Oh, Ki-Won;Choi, Kang-Sun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.6
    • /
    • pp.403-406
    • /
    • 2015
  • In this paper, we propose a supervoxel clustering-based staircase extraction algorithm to obtain poses and dimensions of staircases from a point cloud. In order to effectively reduce the candidate points and accelerate supervoxel clustering, large planes in the scene, such as walls, floors, and ceilings, are eliminated while scanning the environment. Next, staircase candidates with small planes are initially estimated using supervoxel clustering. Then, parameter values for the staircases are refined, and higher staircases that remain undetected due to occlusion are predicted and generated virtually. Experimental results show that staircases are detected accurately and predicted successfully.

Nonlinear damage detection using higher statistical moments of structural responses

  • Yu, Ling;Zhu, Jun-Hua
    • Structural Engineering and Mechanics
    • /
    • v.54 no.2
    • /
    • pp.221-237
    • /
    • 2015
  • An integrated method is proposed for structural nonlinear damage detection based on time series analysis and the higher statistical moments of structural responses in this study. It combines the time series analysis, the higher statistical moments of AR model residual errors and the fuzzy c-means (FCM) clustering techniques. A few comprehensive damage indexes are developed in the arithmetic and geometric mean of the higher statistical moments, and are classified by using the FCM clustering method to achieve nonlinear damage detection. A series of the measured response data, downloaded from the web site of the Los Alamos National Laboratory (LANL) USA, from a three-storey building structure considering the environmental variety as well as different nonlinear damage cases, are analyzed and used to assess the performance of the new nonlinear damage detection method. The effectiveness and robustness of the new proposed method are finally analyzed and concluded.

An Object Detection System using Eigen-background and Clustering (Eigen-background와 Clustering을 이용한 객체 검출 시스템)

  • Jeon, Jae-Deok;Lee, Mi-Jeong;Kim, Jong-Ho;Kim, Sang-Kyoon;Kang, Byoung-Doo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.1
    • /
    • pp.47-57
    • /
    • 2010
  • The object detection is essential for identifying objects, location information, and user context-aware in the image. In this paper, we propose a robust object detection system. The System linearly transforms learning data obtained from the background images to Principal components. It organizes the Eigen-background with the selected Principal components which are able to discriminate between foreground and background. The Fuzzy-C-means (FCM) carries out clustering for images with inputs from the Eigen-background information and classifies them into objects and backgrounds. It used various patterns of backgrounds as learning data in order to implement a system applicable even to the changing environments, Our system was able to effectively detect partial movements of a human body, as well as to discriminate between objects and backgrounds removing noises and shadows without anyone frame image for fixed background.

Adaptive Intrusion Detection System Based on SVM and Clustering (SVM과 클러스터링 기반 적응형 침입탐지 시스템)

  • Lee, Han-Sung;Im, Young-Hee;Park, Joo-Young;Park, Dai-Hee
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.2
    • /
    • pp.237-242
    • /
    • 2003
  • In this paper, we propose a new adaptive intrusion detection algorithm based on clustering: Kernel-ART, which is composed of the on-line clustering algorithm, ART (adaptive resonance theory), combining with mercer-kernel and concept vector. Kernel-ART is not only satisfying all desirable characteristics in the context of clustering-based IDS but also alleviating drawbacks associated with the supervised learning IDS. It is able to detect various types of intrusions in real-time by means of generating clusters incrementally.

Real-time Reflection Light Detection Algorithm using Pixel Clustering Data (Pixel 군집화 Data를 이용한 실시간 반사광 검출 알고리즘)

  • Hwang, Dokyung;An, Jongwoo;Kang, Hosun;Lee, Jangmyung
    • The Journal of Korea Robotics Society
    • /
    • v.14 no.4
    • /
    • pp.301-310
    • /
    • 2019
  • A new algorithm has been propose to detect the reflected light region as disturbances in a real-time vision system. There have been several attempts to detect existing reflected light region. The conventional mathematical approach requires a lot of complex processes so that it is not suitable for a real-time vision system. On the other hand, when a simple detection process has been applied, the reflected light region can not be detected accurately. Therefore, in order to detect reflected light region for a real-time vision system, the detection process requires a new algorithm that is as simple and accurate as possible. In order to extract the reflected light, the proposed algorithm has been adopted several filter equations and clustering processes in the HSI (Hue Saturation Intensity) color space. Also the proposed algorithm used the pre-defined reflected light data generated through the clustering processes to make the algorithm simple. To demonstrate the effectiveness of the proposed algorithm, several images with the reflected region have been used and the reflected regions are detected successfully.