• Title/Summary/Keyword: View Clustering

Search Result 100, Processing Time 0.026 seconds

A new Clustering Algorithm for the Scanned Infrared Image of the Rosette Seeker (로젯 탐색기의 적외선 주사 영상을 위한 새로운 클러스터링 알고리즘)

  • Jahng, Surng-Gabb;Hong, Hyun-Ki;Doo, Kyung-Su;Oh, Jeong-Su;Choi, Jong-Soo;Seo, Dong-Sun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.2
    • /
    • pp.1-14
    • /
    • 2000
  • The rosette-scan seeker, mounted on the infrared guided missile, is a device that tracks the target It can acquire the 2D image of the target by scanning a space about target in rosette pattern with a single detector Since the detected image is changed according to the position of the object in the field of view and the number of the object is not fixed, the unsupervised methods are employed in clustering it The conventional ISODATA method clusters the objects by using the distance between the seed points and pixels So, the clustering result varies in accordance with the shape of the object or the values of the merging and splitting parameters In this paper, we propose an Array Linkage Clustering Algorithm (ALCA) as a new clustering algorithm improving the conventional method The ALCA has no need for the initial seed points and the merging and splitting parameters since it clusters the object using the connectivity of the array number of the memory stored the pixel Therefore, the ALCA can cluster the object regardless of its shape With the clustering results using the conventional method and the proposed one, we confirm that our method is better than the conventional one in terms of the clustering performance We simulate the rosette scanning infrared seeker (RSIS) using the proposed ALCA as an infrared counter countermeasure The simulation results show that the RSIS using our method is better than the conventional one in terms of the tracking performance.

  • PDF

A New Clustering Method for Minimum Classification Error (분류 오류 최소화를 위한 클러스터링 기법)

  • Heo, Gyeong-Yong;Kim, Seong-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.1-8
    • /
    • 2014
  • Clustering is one of the most popular unsupervised learning methods, which is widely used to form clusters with homogeneous data. Clustering was used to extract contexts corresponding to clusters and a classification method was applied to each context or cluster individually. However, it is difficult to say that the unsupervised clustering is the best context forming method from the view of classification. In this paper, a new clustering method considering classification was proposed. The proposed method tries to minimize classification error in each cluster when a classification method is applied to each context locally. For this purpose, the proposed method adds constraints forcing two data points belong to the same class to have small distances, and two data points belong to different classes to have large distances in each cluster like in linear discriminant analysis. The usefulness of the proposed method is confirmed by experimental results.

Improving View-consistency on 4D Light Field Superpixel Segmentation (라이트필드 영상 슈퍼픽셀 분할의 시점간 일관성 개선)

  • Yim, Jonghoon;Duong, Vinh Van;Huu, Thuc Ngyuen;Jeon, Byeungwoo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2021.06a
    • /
    • pp.97-100
    • /
    • 2021
  • Light field (LF) superpixel segmentation aims to group the similar pixels not only in the single image but also in the other views to improve the computational efficiency of further applications like object detection and pattern recognition. Among the state-of-the-art methods, there is an approach to segment the LF images while enforcing the view consistency. However, it leaves too much noise and inaccuracy in the shape of superpixels. In this paper, we modify the process of the clustering step. Experimental results demonstrate that our proposed method outperforms the existing method in terms of view-consistency.

  • PDF

Recognition of Lanes, Stop Lines and Speed Bumps using Top-view Images (탑뷰 영상을 이용한 차선, 정지선 및 과속방지턱 인식)

  • Ahn, Young-Sun;Kwak, Seong Woo;Yang, Jung-Min
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.11
    • /
    • pp.1879-1886
    • /
    • 2016
  • In this paper, we propose a real-time recognition algorithm of lanes, stop lines and speed bumps on roads for autonomous vehicles. First, we generate a top-view using the image transmitted from a camera that is installed to see the front of a vehicle. To speed up the processing, we simplify the mapping algorithm in constructing a top-view wherein the region of interest (ROI) is concerned. The features of lanes, stop lines and speed bumps, which are composed of lines, are searched in the edge image of the top-view, then followed by labeling and clustering specialized to detect straight lines. The width of lines, distances from the center of a vehicle, and curvature of each cluster are considered to select final candidates. We verify the proposed algorithm on real roads using the commercial car (KIA K7) which is converted into an autonomous vehicle.

Advanced Stability Distributed Weighted Clustering Algorithm in the MANET (모바일 에드혹 네트워크에서 안정성을 향상시킨 분산 조합 가중치 클러스터링 알고리즘)

  • Hwang, Yoon-Cheol;Lee, Sang-Ho;Kim, Jin-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.33-42
    • /
    • 2007
  • Mobile ad-hoc network(MANET) can increase independence and flexibility of network because it consists of mobile node without the aid of fixed infrastructure. But, Because of unrestriction for the participation and breakaway of node, it has the difficulty in management and stability which is a basic function of network operation. Therefore, to solve those problems, we suggest a distributed weighted clustering algorithm from a manageable and stable point of view. The suggested algorithm uses distributed weighted clustering algorithm when it initially forms the cluster and uses a concept which is distributed gateway and sub-cluster head to reduce the re-clustering to the minimum which occurs mobile nodes after forming the cluster. For performance evaluation, We compare DCA and WCA with the suggested algorithm on the basis of initial overhead, resubscriber rate and a number of cluster.

  • PDF

Analysis of Combined Yeast Cell Cycle Data by Using the Integrated Analysis Program for DNA chip (DNA chip 통합분석 프로그램을 이용한 효모의 세포주기 유전자 발현 통합 데이터의 분석)

  • 양영렬;허철구
    • KSBB Journal
    • /
    • v.16 no.6
    • /
    • pp.538-546
    • /
    • 2001
  • An integrated data analysis program for DNA chip containing normalization, FDM analysis, various kinds of clustering methods, PCA, and SVD was applied to analyze combined yeast cell cycle data. This paper includes both comparisons of some clustering algorithms such as K-means, SOM and furry c-means and their results. For further analysis, clustering results from the integrated analysis program was used for function assignments to each cluster and for motif analysis. These results show an integrated analysis view on DNA chip data.

  • PDF

Clustering-based Cooperative Routing using OFDM for Supporting Transmission Efficiency in Mobile Wireless Sensor Networks (모바일 무선 센서네트워크에서 전송 효율 향상을 지원하기 위한 OFDM을 사용한 클러스터링 기반의 협력도움 라우팅)

  • Lee, Joo-Sang;An, Beong-Ku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.85-92
    • /
    • 2010
  • In this paper, we propose a Clustering-based Cooperative Routing using OFDM (CCRO) for supporting transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed method are as follows. First, the clustering method which uses the location information of nodes as underlying infrastructure for supporting stable transmission services efficiently is used. Second, cluster-based cooperative data transmission method is used for improving data transmission and reliability services. Third, OFDM based data transmission method is used for improving data transmission ratio with channel efficiency. Fourth, we consider realistic approach in the view points of the mobile ad-hoc wireless sensor networks while conventional methods just consider fixed sensor network environments. The performance evaluation of the proposed method is performed via simulation using OPNET and theoretical analysis. The results of performance evaluation show improvement of transmission efficiency.

Moving Object Tracking Using Co-occurrence Features of Objects (이동 물체의 상호 발생 특징정보를 이용한 동영상에서의 이동물체 추적)

  • Kim, Seongdong;Seongah Chin;Moonwon Choo
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.2
    • /
    • pp.1-13
    • /
    • 2002
  • In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

  • PDF

Object Model ing from Depth Information Using Z-gradient (3차원 정보로 부터 Z축의 기울기를 이용한 물체의 조형.)

  • Kim, T.Y.;Cho, D.U.;Choi, B.U.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1069-1072
    • /
    • 1987
  • In this paper, we drive useful data from 3-D depth information as input using discontinuity boundary or clustering. And using magnitude and direction of z-gradient we classify the data into adaptable primitive types through intrinsic and stochastical processing. After these processing information is reconstructed for forming data base. And make relationship and standard view position for matching.

  • PDF

Analysis and Visualization for Comment Messages of Internet Posts (인터넷 게시물의 댓글 분석 및 시각화)

  • Lee, Yun-Jung;Ji, Jeong-Hoon;Woo, Gyun;Cho, Hwan-Gue
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.7
    • /
    • pp.45-56
    • /
    • 2009
  • There are many internet users who collect the public opinions and express their opinions for internet news or blog articles through the replying comment on online community. But, it is hard to search and explore useful messages on web blogs since most of web blog systems show articles and their comments to the form of sequential list. Also, spam and malicious comments have become social problems as the internet users increase. In this paper, we propose a clustering and visualizing system for responding comments on large-scale weblogs, namely 'Daum AGORA,' using similarity analysis. Our system shows the comment clustering result as a simple screen view. Our system also detects spam comments using Needleman-Wunsch algorithm that is a well-known algorithm in bioinformatics.