• Title/Summary/Keyword: View Clustering

Search Result 100, Processing Time 0.029 seconds

A Cross-Layer Cooperative Routing Architecture for Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크를 위한 Cross-Layer 협력도움 라우팅 구조)

  • Lee, Joo-Sang;An, Beong-Ku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.141-150
    • /
    • 2011
  • In this paper, we propose a Cross-Layer Cooperative Routing(CLCR) architecture to support transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed architecture and method are as follows. First, the clustering which uses the location information of nodes is utilized as infrastructure. Second, a cross-layer strategy which uses the technologies of network layer, MAC layer, physical layer together to support transmission efficiency and channel efficiency for cooperative-aided routing and transmission. Third, 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 of the proposed CLCR show improvement of transmission efficiency by the proposed CLCR.

Improved CS-RANSAC Algorithm Using K-Means Clustering (K-Means 클러스터링을 적용한 향상된 CS-RANSAC 알고리즘)

  • Ko, Seunghyun;Yoon, Ui-Nyoung;Alikhanov, Jumabek;Jo, Geun-Sik
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.6
    • /
    • pp.315-320
    • /
    • 2017
  • Estimating the correct pose of augmented objects on the real camera view efficiently is one of the most important questions in image tracking area. In computer vision, Homography is used for camera pose estimation in augmented reality system with markerless. To estimating Homography, several algorithm like SURF features which extracted from images are used. Based on extracted features, Homography is estimated. For this purpose, RANSAC algorithm is well used to estimate homography and DCS-RANSAC algorithm is researched which apply constraints dynamically based on Constraint Satisfaction Problem to improve performance. In DCS-RANSAC, however, the dataset is based on pattern of feature distribution of images manually, so this algorithm cannot classify the input image, pattern of feature distribution is not recognized in DCS-RANSAC algorithm, which lead to reduce it's performance. To improve this problem, we suggest the KCS-RANSAC algorithm using K-means clustering in CS-RANSAC to cluster the images automatically based on pattern of feature distribution and apply constraints to each image groups. The suggested algorithm cluster the images automatically and apply the constraints to each clustered image groups. The experiment result shows that our KCS-RANSAC algorithm outperformed the DCS-RANSAC algorithm in terms of speed, accuracy, and inlier rate.

Selecting Representative Views of 3D Objects By Affinity Propagation for Retrieval and Classification (검색과 분류를 위한 친근도 전파 기반 3차원 모델의 특징적 시점 추출 기법)

  • Lee, Soo-Chahn;Park, Sang-Hyun;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of Broadcast Engineering
    • /
    • v.13 no.6
    • /
    • pp.828-837
    • /
    • 2008
  • We propose a method to select representative views of single objects and classes of objects for 3D object retrieval and classification. Our method is based on projected 2D shapes, or views, of the 3D objects, where the representative views are selected by applying affinity propagation to cluster uniformly sampled views. Affinity propagation assigns prototypes to each cluster during the clustering process, thereby providing a natural criterion to select views. We recursively apply affinity propagation to the selected views of objects classified as single classes to obtain representative views of classes of objects. By enabling classification as well as retrieval, effective management of large scale databases for retrieval can be enhanced, since we can avoid exhaustive search over all objects by first classifying the object. We demonstrate the effectiveness of the proposed method for both retrieval and classification by experimental results based on the Princeton benchmark database [16].

An Energy Efficient Variable Area Routing protocol in Wireless Sensor networks (무선 센서 네트워크에서 에너지 효율적인 가변 영역 라우팅 프로토콜)

  • Choi, Dong-Min;Moh, Sang-Man;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1082-1092
    • /
    • 2008
  • In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

  • PDF

Nonlinear Characteristic Analysis of Charging Current for Linear Type Magnetic Flux Pump Using RBFNN (RBF 뉴럴네트워크를 이용한 리니어형 초전도 전원장치의 비선형적 충전전류특성 해석)

  • Chung, Yoon-Do;Park, Ho-Sung;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.140-145
    • /
    • 2010
  • In this work, to theoretically analyze the nonlinear charging characteristic, a Radial Basis Function Neural Network (RBFNN) is adopted. Based on the RBFNN, an charging characteristic tendency of a Linear Type Magnetic Flux Pump (LTMFP) is analyzed. In the paper, we developed the LTMFP that generates stable and controllable charging current and also experimentally investigated its charging characteristic in the cryogenic system. From these experimental results, the charging current of the LTMFP was also found to be frequency dependent with nonlinear quality due to the nonlinear magnetic behaviour of superconducting Nb foil. On the whole, in the case of essentially cryogenic experiment, since cooling costs loomed large in the cryogenic environment, it is difficult to carry out various experiments. Consequentially, in this paper, we estimated the nonlinear characteristic of charging current as well as realized the intelligent model via the design of RBFNN based on the experimental data. In this paper, we view RBF neural networks as predominantly data driven constructs whose processing is based upon an effective usage of experimental data through a prudent process of Fuzzy C-Means clustering method. Also, the receptive fields of the proposed RBF neural network are formed by the FCM clustering.

Real-Time Pipe Fault Detection System Using Computer Vision

  • Kim Hyoung-Seok;Lee Byung-Ryong
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.7 no.1
    • /
    • pp.30-34
    • /
    • 2006
  • Recently, there has been an increasing demand for computer-vision-based inspection and/or measurement system as a part of factory automation equipment. In general, it is almost impossible to check the fault of all parts, coming from part-feeding system, with only manual inspection because of time limitation. Therefore, most of manual inspection is applied to specific samples, not all coming parts, and manual inspection neither guarantee consistent measuring accuracy nor decrease working time. Thus, in order to improve the measuring speed and accuracy of the inspection, a computer-aided measuring and analysis method is highly needed. In this paper, a computer-vision-based pipe inspection system is proposed, where the front and side-view profiles of three different kinds of pipes, coming from a forming line, are acquired by computer vision. And the edge detection is processed by using Laplace operator. To reduce the vision processing time, modified 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 of the parts. Also, an inspection system has been built so that the data and images of faulted parts are stored as files and transferred to the server.

Object Classification based on Weakly Supervised E2LSH and Saliency map Weighting

  • Zhao, Yongwei;Li, Bicheng;Liu, Xin;Ke, Shengcai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.364-380
    • /
    • 2016
  • The most popular approach in object classification is based on the bag of visual-words model, which has several fundamental problems that restricting the performance of this method, such as low time efficiency, the synonym and polysemy of visual words, and the lack of spatial information between visual words. In view of this, an object classification based on weakly supervised E2LSH and saliency map weighting is proposed. Firstly, E2LSH (Exact Euclidean Locality Sensitive Hashing) is employed to generate a group of weakly randomized visual dictionary by clustering SIFT features of the training dataset, and the selecting process of hash functions is effectively supervised inspired by the random forest ideas to reduce the randomcity of E2LSH. Secondly, graph-based visual saliency (GBVS) algorithm is applied to detect the saliency map of different images and weight the visual words according to the saliency prior. Finally, saliency map weighted visual language model is carried out to accomplish object classification. Experimental results datasets of Pascal 2007 and Caltech-256 indicate that the distinguishability of objects is effectively improved and our method is superior to the state-of-the-art object classification methods.

Unified Approach to Path Planning Algorithm for SMT Inspection Machines Considering Inspection Delay Time (검사지연시간을 고려한 SMT 검사기의 통합적 경로 계획 알고리즘)

  • Lee, Chul-Hee;Park, Tae-Hyoung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.8
    • /
    • pp.788-793
    • /
    • 2015
  • This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

A Real-time Lane Tracking Using Inverse Perspective Mapping (역투영 변환을 이용한 고속도로 환경에서의 실시간 차선 추적)

  • Yeo, Jae-yun;Koo, Kyung-mo;Cha, Eui-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.103-107
    • /
    • 2013
  • In this paper, A real-time lane tracking algorithm is proposed for lane departure warning system. To eliminate perspective effect, input image is converted into Bird's View by inverse perspective mapping. Next, suitable features are extracted for lane detection. Lane feature that correspond to area of interest and RANSAC are used to detect lane candidates. And driving lane is decided by clustering of lane candidates. Finally, detected lane is tracked using the Kalman filter. Experimental results show that the proposed algorithm can be processed within 30ms and its detection rate is approximately 90% on the highway in a variety of environments such as day and night.

  • PDF

Visual Information Tactile Transformation Display to Expand the Enjoyment of Art and Culture for the Blind (시각장애인 예술 문화 향유 확장을 위한 시각 정보 촉각 변환 디스플레이)

  • Sang-Don Lee;Ju-Hyeon Lee;Jae-Hyeong Hwang;Hyeon-Jung Hwang;Jae-Hun Lee
    • Annual Conference of KIPS
    • /
    • 2023.11a
    • /
    • pp.996-997
    • /
    • 2023
  • 시각 장애인들의 시각 정보에 대한 낮은 접근성은 문화, 예술 활동에 큰 제약을 가져다 주고 있다. 실제로 시각 장애인 중 약 절반 이상이 문화, 여가생활에 만족하지 못한다고 답하였고 전시회, 미술품 감상 또는 관람 활동은 약 5%만이[1] 참여하고 있는 것으로 나타났다. 이러한 한계를 극복하기 위해 시각이라는 감각의 한계를 뛰어넘어 시각 미디어를 즐길 수 있게 하는 서비스를 제작하였고, 이는 크게 웹서비스인 web view editor와 물리적인 촉각 디스플레이로 구성된다. 시각 미디어인 이미지는 8×8로 나눠 각 영역을 OpenCV 라이브러리와 K-means clustering 알고리즘을 이용하여 9 level로 분류시키고, 구분된 level에 맞게 cell의 높낮이 차이를 두기 위하여 Arduino를 통한 회전-선형 변환기를 제작했다. Arduino의 PWM 기능을 이용해 모터의 속도와 방향을 제어하며, 각 모터의 드라이버는 Arduino와 연결되어 있어 모터의 회전을 제어하게 했다. 결과적으로 본 연구에서는 cell의 높낮이 차이를 9 level로 구분하여 시각 정보를 촉각으로 수용할 수 있는 장치를 제작하였고, 이 장치를 통해 기존의 시각 장애인들이 문화 생활을 쉽게 향유하고 이를 바탕으로 창의성과 상상력을 증대시켜 더욱 밀접하게 사회와 연결되고 소통 할 수 있는 기회의 초석이 되기를 기대하는 바이다.