• Title/Summary/Keyword: Clustering Problem

Search Result 708, Processing Time 0.025 seconds

Data Aggregation and Transmission Mechanism for Energy Adaptive Node in Wireless Sensor Networks (무선 센서네트워크 환경에서 에너지를 고려한 노드 적응적 데이터 병합 및 전달 기법)

  • Cho, Young-Bok;You, Mi-Kyung;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.903-911
    • /
    • 2011
  • In this paper we proposed an energy adaptive data aggregation and transmission mechanism to solve the problem of energy limitation in wireless sensor networks (WSNs). Hierarchical structure methods are wildly used in WSNs to improve the energy efficiency. LEACH and TEEN protocols are the typical techniques. In these methods, all nodes, including nodes who have sensed data to transmit and nodes who haven't, are set frame timeslots in every round. MNs (member nodes) without sensed data keep active all the time, too. These strategies caused energy waste. Furthermore, if data collection in MNs is same to the previous transmission, it increases energy consumption. Most hierarchical structure protocols are developed based on LEACH. To solve the above problems, this paper proposed a method in which only MNs with sensed data can obtain allocated frame to transmit data. Moreover, if the MNs have same sensed data with previous, MNs turn to sleep mode. By this way redundant data transmission is avoided and aggregation in CH is lightened, too.

A Study on Recommendation Technique Using Mining and Clustering of Weighted Preference based on FRAT (마이닝과 FRAT기반 가중치 선호도 군집을 이용한 추천 기법에 관한 연구)

  • Park, Wha-Beum;Cho, Young-Sung;Ko, Hyung-Hwa
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.419-428
    • /
    • 2013
  • Real-time accessibility and agility are required in u-commerce under ubiquitous computing environment. Most of the existing recommendation techniques adopt the method of evaluation based on personal profile, which has been identified with difficulties in accurately analyzing the customers' level of interest and tendencies, as well as the problems of cost, consequently leaving customers unsatisfied. Researches have been conducted to improve the accuracy of information such as the level of interest and tendencies of the customers. However, the problem lies not in the preconstructed database, but in generating new and diverse profiles that are used for the evaluation of the existing data. Also it is difficult to use the unique recommendation method with hierarchy of each customer who has various characteristics in the existing recommendation techniques. Accordingly, this dissertation used the implicit method without onerous question and answer to the users based on the data from purchasing, unlike the other evaluation techniques. We applied FRAT technique which can analyze the tendency of the various personalization and the exact customer.

Gunnery Classification Method Using Profile Feature Extraction in Infrared Images (적외선 영상에서의 시계열 특징 추출을 이용한 Gunnery 분류 기법 연구)

  • Kim, Jae-Hyup;Cho, Tae-Wook;Chun, Seung-Woo;Lee, Jong-Min;Moon, Young-Shik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.10
    • /
    • pp.43-53
    • /
    • 2014
  • Gunnery has been used to detect and classify artilleries. In this paper, we used electro-optical data to get the information of muzzle flash from the artilleries. Feature based approach was applied; we first defined features and sub-features. The number of sub-features was 38~40 generic sub-features, and 2 model-based sub-features. To classify multiclass data, we introduced tree structure with clustering the classes according to the similarity of them. SVM was used for each non-leaf nodes in the tree, as a sub-classifier. From the data, we extracted features and sub-features and classified them by the tree structure SVM classifier. The results showed that the performance of our classifier was good for our muzzle flash classification problem.

Contrast Enhancement based on Gaussian Region Segmentation (가우시안 영역 분리 기반 명암 대비 향상)

  • Shim, Woosung
    • Journal of Broadcast Engineering
    • /
    • v.22 no.5
    • /
    • pp.608-617
    • /
    • 2017
  • Methods of contrast enhancement have problem such as side effect of over-enhancement with non-gaussian histogram distribution, tradeoff enhancement efficiency against brightness preserving. In order to enhance contrast at various histogram distribution, segmentation to region with gaussian distribution and then enhance contrast each region. First, we segment an image into several regions using GMM(Gaussian Mixture Model)fitting by that k-mean clustering and EM(Expectation-Maximization) in $L^*a^*b^*$ color space. As a result region segmentation, we get the region map and probability map. Then we apply local contrast enhancement algorithm that mean shift to minimum overlapping of each region and preserve brightness histogram equalization. Experiment result show that proposed region based contrast enhancement method compare to the conventional method as AMBE(AbsoluteMean Brightness Error) and AE(Average Entropy), brightness is maintained and represented detail information.

New surveillance concepts in food safety in meat producing animals: the advantage of high throughput 'omics' technologies - A review

  • Pfaffl, Michael W.;Riedmaier-Sprenzel, Irmgard
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.31 no.7
    • /
    • pp.1062-1071
    • /
    • 2018
  • The misuse of anabolic hormones or illegal drugs is a ubiquitous problem in animal husbandry and in food safety. The ban on growth promotants in food producing animals in the European Union is well controlled. However, application regimens that are difficult to detect persist, including newly designed anabolic drugs and complex hormone cocktails. Therefore identification of molecular endogenous biomarkers which are based on the physiological response after the illicit treatment has become a focus of detection methods. The analysis of the 'transcriptome' has been shown to have promise to discover the misuse of anabolic drugs, by indirect detection of their pharmacological action in organs or selected tissues. Various studies have measured gene expression changes after illegal drug or hormone application. So-called transcriptomic biomarkers were quantified at the mRNA and/or microRNA level by reverse transcription-quantitative polymerase chain reaction (RT-qPCR) technology or by more modern 'omics' and high throughput technologies including RNA-sequencing (RNA-Seq). With the addition of advanced bioinformatical approaches such as hierarchical clustering analysis or dynamic principal components analysis, a valid 'biomarker signature' can be established to discriminate between treated and untreated individuals. It has been shown in numerous animal and cell culture studies, that identification of treated animals is possible via our transcriptional biomarker approach. The high throughput sequencing approach is also capable of discovering new biomarker candidates and, in combination with quantitative RT-qPCR, validation and confirmation of biomarkers has been possible. These results from animal production and food safety studies demonstrate that analysis of the transcriptome has high potential as a new screening method using transcriptional 'biomarker signatures' based on the physiological response triggered by illegal substances.

Centroidal Voronoi Tessellation-Based Reduced-Order Modeling of Navier-Stokes Equations

  • 이형천
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.1-1
    • /
    • 2003
  • In this talk, a reduced-order modeling methodology based on centroidal Voronoi tessellations (CVT's)is introduced. CVT's are special Voronoi tessellations for which the generators of the Voronoi diagram are also the centers of mass (means) of the corresponding Voronoi cells. The discrete data sets, CVT's are closely related to the h-means clustering techniques. Even with the use of good mesh generators, discretization schemes, and solution algorithms, the computational simulation of complex, turbulent, or chaotic systems still remains a formidable endeavor. For example, typical finite element codes may require many thousands of degrees of freedom for the accurate simulation of fluid flows. The situation is even worse for optimization problems for which multiple solutions of the complex state system are usually required or in feedback control problems for which real-time solutions of the complex state system are needed. There hava been many studies devoted to the development, testing, and use of reduced-order models for complex systems such as unsteady fluid flows. The types of reduced-ordered models that we study are those attempt to determine accurate approximate solutions of a complex system using very few degrees of freedom. To do so, such models have to use basis functions that are in some way intimately connected to the problem being approximated. Once a very low-dimensional reduced basis has been determined, one can employ it to solve the complex system by applying, e.g., a Galerkin method. In general, reduced bases are globally supported so that the discrete systems are dense; however, if the reduced basis is of very low dimension, one does not care about the lack of sparsity in the discrete system. A discussion of reduced-ordering modeling for complex systems such as fluid flows is given to provide a context for the application of reduced-order bases. Then, detailed descriptions of CVT-based reduced-order bases and how they can be constructed of complex systems are given. Subsequently, some concrete incompressible flow examples are used to illustrate the construction and use of CVT-based reduced-order bases. The CVT-based reduced-order modeling methodology is shown to be effective for these examples and is also shown to be inexpensive to apply compared to other reduced-order methods.

  • PDF

An Innovative Approach to Track Moving Object based on RFID and Laser Ranging Information

  • Liang, Gaoli;Liu, Ran;Fu, Yulu;Zhang, Hua;Wang, Heng;Rehman, Shafiq ur;Guo, Mingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.131-147
    • /
    • 2020
  • RFID (Radio Frequency Identification) identifies a specific object by radio signals. As the tag provides a unique ID for the purpose of identification, RFID technology effectively solves the ambiguity and occlusion problem that challenges the laser or camera-based approach. This paper proposes an approach to track a moving object based on the integration of RFID and laser ranging information using a particle filter. To be precise, we split laser scan points into different clusters which contain the potential moving objects and calculate the radial velocity of each cluster. The velocity information is compared with the radial velocity estimated from RFID phase difference. In order to achieve the positioning of the moving object, we select a number of K best matching clusters to update the weights of the particle filter. To further improve the positioning accuracy, we incorporate RFID signal strength information into the particle filter using a pre-trained sensor model. The proposed approach is tested on a SCITOS service robot under different types of tags and various human velocities. The results show that fusion of signal strength and laser ranging information has significantly increased the positioning accuracy when compared to radial velocity matching-based or signal strength-based approaches. The proposed approach provides a solution for human machine interaction and object tracking, which has potential applications in many fields for example supermarkets, libraries, shopping malls, and exhibitions.

A Statistical Image Segmentation Method in the Hierarchical Image Structure (계층적 영상구조에서 통계적 방법에 의한 영상분할)

  • 최성진
    • Journal of Broadcast Engineering
    • /
    • v.1 no.2
    • /
    • pp.165-175
    • /
    • 1996
  • In this paper, the image segmentation method based on the hierarchical pyramid image structure of reduced resolution versions of the image for solving the problems in the conventional methods is presented. This method is described the object detection and delineation by statistical approach. In the object detection method, IFSVR( Inverse-father-son variance ratio) method and FSVR(father-son variance ratio ) method are proposed for solving clustering validity problem occurred In the hierarchical pyramid image structure. An optimal object pixel Is detected at some level by this method. In the object delineation method, the iterative algorithm by top-down traversing method is proposed for moving the optimal object pixel to levels of higher resolution. Using the computer simulation, the results by the proposed statistical methods and object traversing method are investigated for the binary Image and the real image. At the results of computer simulation, the proposed methods of image segmentation based on the hierarchical pyramid Image structure seem to have useful properties and deserve consideration as a possible alternative to existing methods of image segmentation. The computation for the proposed method is required 0(log n) for n${\times}$n input image.

  • PDF

Efficient Disk Access Method Using Region Storage Structure in Spatial Continuous Query Processing (공간 연속질의 처리에서 영역 기반의 저장 구조를 이용한 효율적인 디스크 접근 방법)

  • Chung, Weon-Il
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.5
    • /
    • pp.2383-2389
    • /
    • 2011
  • Ubiquitous applications require hybrid continuous query processing which processes both on-line data stream and spatial data in the disk. In the hybrid continuous spatial query processing, disk access costs for the high-volume spatial data should be minimized. However, previous indexing methods cannot reduce the disk seek time, because it is difficult that the data are stored in contiguity with others. Also, existing methods for the space-filling curve considering data cluster have the problem which does not cluster available data for queries. Therefore, we propose the region storage structure for efficient data access in hybrid continues spatial query processing. This paper shows that there is an obvious improvement of query processing costs through the contiguous data storing method and the group processing for user queries based on the region storage structure.

The Improved Binary Tree Vector Quantization Using Spatial Sensitivity of HVS (인간 시각 시스템의 공간 지각 특성을 이용한 개선된 이진트리 벡터양자화)

  • Ryu, Soung-Pil;Kwak, Nae-Joung;Ahn, Jae-Hyeong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.1
    • /
    • pp.21-26
    • /
    • 2004
  • Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. The basic problem is how to display 256 colors or less colors, called color palette, In this paper, we propose improved binary tree vector quantization based on spatial sensitivity which is one of the human visual properties. We combine the weights based on the responsibility of human visual system according to changes of three Primary colors in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get the better result in subjective quality test and WSNR.