• Title/Summary/Keyword: Hierarchical Filtering

Search Result 45, Processing Time 0.022 seconds

An Energy Saving Method using Hierarchical Filtering in Sensor Networks (센서 네트워크에서 계층적 필터링을 이용한 에너지 절약 방안)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.4
    • /
    • pp.768-774
    • /
    • 2007
  • This paper proposes how to reduce the amount of data transmitted in each sensor and cluster head in order to lengthen the lifetime of sensor network. This study proposes hierarchical filtering for reducing the sensor's energy dissipation. Hierarchical filtering is to divide sensor network by two tiers when filtering it. First tier performs filtering when transmitting the data from cluster member to cluster head, and second tier performs filtering when transmitting the data from cluster head to base station. This should increase the efficiency of filtering and decrease the inaccuracy of the data compared to the methods which enlarge the filter width to do more filtering.

  • PDF

An Energy-Efficient Data Aggregation using Hierarchical Filtering in Sensor Network (센서 네트워크에서 계층적 필터링을 이용한 에너지 효율적인 데이터 집계연산)

  • Kim, Jin-Su;Park, Chan-Heum;Kim, Chong-Gun;Kang, Byung-Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.73-82
    • /
    • 2007
  • This paper proposes how to reduce the amount of data transmitted in each sensor and cluster head in order to lengthen the lifetime of sensor network by data aggregation of the continuous queries. The most important factor of refuting the sensor's energy dissipation is to reduce the amount of messages transmitted. The method proposed is basically to combine clustering, in-network data aggregation and hierarchical filtering. Hierarchical filtering is to divide sensor network by two tiers when filtering it. First tier performs filtering when transmitting the data from cluster member to cluster head, and second tier performs filtering when transmitting the data from cluster head to base station. This method is much more efficient and effective than the previous work. We show through various experiments that our scheme reduces the network traffic significantly and increases the network's lifetime than existing methods.

  • PDF

Multi-target tracking using Particle Filtering and Hierarchical Boosting Algorithm (Particle Filtering과 계층적인 Boosting 알고리즘을 기반으로 한 다중 객체 추적 연구)

  • Yang, E-Hwa;Jeon, Moon-Gu
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.516-518
    • /
    • 2012
  • 본 논문은 Particle Filtering과 계층적인 Boosting 알고리즘을 이용한 다중 객체 추적 기법을 제안한다. Particle Filtering을 이용하여 각 객체를 단일 객체로 추적하고 Boosting 기반의 데이터 연관 알고리즘을 사용하여 영상에서 움직이는 물체들을 추적한다. 본 제안한 알고리즘에서는 객체들의 이동경로 정확한 감지를 위해 Particle Filtering을 통해 각 객체가 움직이는 예측 정보를 이용하고, Boosting 알고리즘을 계측적인 형태로 설계함에 따라 데이터 물체의 추적 정확도를 높일 수 있도록 하였다.

Joint Hierarchical Semantic Clipping and Sentence Extraction for Document Summarization

  • Yan, Wanying;Guo, Junjun
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.820-831
    • /
    • 2020
  • Extractive document summarization aims to select a few sentences while preserving its main information on a given document, but the current extractive methods do not consider the sentence-information repeat problem especially for news document summarization. In view of the importance and redundancy of news text information, in this paper, we propose a neural extractive summarization approach with joint sentence semantic clipping and selection, which can effectively solve the problem of news text summary sentence repetition. Specifically, a hierarchical selective encoding network is constructed for both sentence-level and document-level document representations, and data containing important information is extracted on news text; a sentence extractor strategy is then adopted for joint scoring and redundant information clipping. This way, our model strikes a balance between important information extraction and redundant information filtering. Experimental results on both CNN/Daily Mail dataset and Court Public Opinion News dataset we built are presented to show the effectiveness of our proposed approach in terms of ROUGE metrics, especially for redundant information filtering.

Hierarchical Order Statistics Filtering for Fast Bi-Dimensional Empirical Mode Decomposition

  • Semiz, Serkan;Celebi, Anil;Urhan, Oguzhan
    • ETRI Journal
    • /
    • v.38 no.4
    • /
    • pp.695-702
    • /
    • 2016
  • A hierarchical approach for fast bi-dimensional empirical mode decomposition (B-EMD) is proposed. The presented approach utilizes an efficient window size determination scheme that enables the multi-level computation of the order statistics filter (OSF). Our detailed experiments show that the proposed OSF computation approach allows a significantly faster computation of an EMD without degrading the decomposition accuracy.

An Efficient Motion Estimation Method Using Hierarchical Structure (계층적 구조를 이용한 효율적인 변위 추정 방법)

  • 황신환;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.11
    • /
    • pp.913-924
    • /
    • 1991
  • In this paper, we propose a motion estimation algorithm using hierarchical structure. The algorithm uses the image pyramids from the repetitive application of Gaussian filtering and decimation, and performs an inter-level displacement propagation in its motion estimation process. The motion estimation algorithm based on the hierarchical structure is shown to be very effective since this scheme utilizes the local imformation as well as the global imformation. The experimental results on the various data imdicate that compared to the Horn and Schunck's method, the proposed algorithm yields an accurate motion estimation with a fast convergence behaviour.

  • PDF

Hierarchical Haze Removal Using Dark Channel Prior (Dark Channel Prior를 이용한 계층적 영상 안개 제거 알고리즘)

  • Kim, Jin-Hwan;Kim, Chang-Su
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.2
    • /
    • pp.457-464
    • /
    • 2010
  • The haze removal algorithm using dark channel prior, which was proposed by He et al., is an efficient algorithm and presents impressive results. But its high memory and computational requirements limit its applications. In this paper, we propose a method to improve the memory usage and calculation speed. We notice that the matting process accounts for most calculation time, so we replace the matting process with a fast bilateral filtering scheme. Using the bilateral filter, we can reduce the memory usage, but its computational complexity is still high. To reduce the computational complexity as well, we adapt a hierarchical structure for the bilateral filtering. Experimental results show that the proposed algorithm can remove haze in a picture effectively, while requiring much less computations than the He et al.'s method.

Hierarchical transmission using morphology and vector quantization (모폴로지와 벡터 양자화를 사용한 영상의 계층적 전송)

  • 김신환;김성욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1170-1177
    • /
    • 1997
  • Morphology is a shape preseving filter. Several morphology filter can be made by the combination of morphological basic operation. If we use morphology filter in decimation process for a hierarchical encoder, there are some advantagesin reduction aliasing effects. In this paper, we propose a new hierarchical coder with morphological filtering and vector quantization. And then, firstly, we confirm that CO filtering is the best one among the 4 kinds of morphology filters to reduce aliasing effects in Laplacian pyramid transmission proposed by Burt. Secondly, the those two coders was compared. The results of our simulation show that our new coder surpasser the Laplacian pyramid especially in complex images.

  • PDF

FPGA Design of Open-Loop Frame Prediction Processor for Scalable Video Coding (스케일러블 비디오 코딩을 위한 Open-Loop 프레임 예측 프로세서의 FPGA 설계)

  • Seo Young-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5C
    • /
    • pp.534-539
    • /
    • 2006
  • In this paper, we propose a new frame prediction filtering technique and a hardware(H/W) architecture for scalable video coding. We try to evaluate MCTF(motion compensated temporal filtering) and hierarchical B-picture which are a technique for eliminate correlation between video frames. Since the techniques correspond to non-causal system in time, these have fundamental defects which are long latency time and large size of frame buffer. We propose a new architecture to be efficiently implemented by reconfiguring non-causal system to causal system. We use the property of a repetitive arithmetic and propose a new frame prediction filtering cell(FPFC). By expanding FPFC we reconfigure the whole arithmetic architecture. After the operational sequence of arithmetic is analyzed in detail and the causality is imposed to implement in hardware, the unit cell is optimized. A new FPFC kernel was organized as simple as possible by repeatedly arranging the unit cells and a FPFC processor is realized for scalable video coding.

Spatial Region Estimation for Autonomous CoT Clustering Using Hidden Markov Model

  • Jung, Joon-young;Min, Okgee
    • ETRI Journal
    • /
    • v.40 no.1
    • /
    • pp.122-132
    • /
    • 2018
  • This paper proposes a hierarchical dual filtering (HDF) algorithm to estimate the spatial region between a Cloud of Things (CoT) gateway and an Internet of Things (IoT) device. The accuracy of the spatial region estimation is important for autonomous CoT clustering. We conduct spatial region estimation using a hidden Markov model (HMM) with a raw Bluetooth received signal strength indicator (RSSI). However, the accuracy of the region estimation using the validation data is only 53.8%. To increase the accuracy of the spatial region estimation, the HDF algorithm removes the high-frequency signals hierarchically, and alters the parameters according to whether the IoT device moves. The accuracy of spatial region estimation using a raw RSSI, Kalman filter, and HDF are compared to evaluate the effectiveness of the HDF algorithm. The success rate and root mean square error (RMSE) of all regions are 0.538, 0.622, and 0.75, and 0.997, 0.812, and 0.5 when raw RSSI, a Kalman filter, and HDF are used, respectively. The HDF algorithm attains the best results in terms of the success rate and RMSE of spatial region estimation using HMM.