• Title/Summary/Keyword: Tree filter

Search Result 120, Processing Time 0.027 seconds

A New Flash TPR-tree for Indexing Moving Objects with Frequent Updates

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.95-104
    • /
    • 2022
  • A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

Analysis Performance Characterics of Dynamic Signature File Methods

  • Yoo, Jae-Soo;Choi, Kil-Seong;Kim, Myoung-Ho
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.4
    • /
    • pp.37-45
    • /
    • 1997
  • With rapid increase of information requirements from various application areas, there has been much research on dynamic information storage structures that effectively support insertions, deletions and updates. In this appear we evaluate the performance of he existing dynamic signature file methods such as the S-tree, Quick Filter and HS file and provide guidelines for the most effective usage to a given operational environment. We derive analytic performance evaluation models of the storage structures based on retrieval time, storage overhead and insertion time. We also perform extensive experiments with various data distributions such as uniform, normal and exponential distributions. The relationships among various performance parameters are throughly investigated. We show through performance comparison based on analytic models and experiments that regardless of data distribution, the HS file significantly improves performance in both the retreival time and the storage overhead over S-tree and Quick Filter.

  • PDF

Detection of Individual Trees in Human Settlement Using Airborne LiDAR Data and Deep Learning-Based Urban Green Space Map (항공 라이다와 딥러닝 기반 도시 수목 면적 지도를 이용한 개별 도시 수목 탐지)

  • Yeonsu Lee ;Bokyung Son ;Jungho Im
    • Korean Journal of Remote Sensing
    • /
    • v.39 no.5_4
    • /
    • pp.1145-1153
    • /
    • 2023
  • Urban trees play an important role in absorbing carbon dioxide from the atmosphere, improving air quality, mitigating the urban heat island effect, and providing ecosystem services. To effectively manage and conserve urban trees, accurate spatial information on their location, condition, species, and population is needed. In this study, we propose an algorithm that uses a high-resolution urban tree cover map constructed from deep learning approach to separate trees from the urban land surface and accurately detect tree locations through local maximum filtering. Instead of using a uniform filter size, we improved the tree detection performance by selecting the appropriate filter size according to the tree height in consideration of various urban growth environments. The research output, the location and height of individual trees in human settlement over Suwon, will serve as a basis for sustainable management of urban ecosystems and carbon reduction measures.

Parallel Deblocking Filter Based on Modified Order of Accessing the Coding Tree Units for HEVC on Multicore Processor

  • Lei, Haiwei;Liu, Wenyi;Wang, Anhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1684-1699
    • /
    • 2017
  • The deblocking filter (DF) reduces blocking artifacts in encoded video sequences, and thereby significantly improves the subjective and objective quality of videos. Statistics show that the DF accounts for 5-18% of the total decoding time in high-efficiency video coding. Therefore, speeding up the DF will improve codec performance, especially for the decoder. In view of the rapid development of multicore technology, we propose a parallel DF scheme based on a modified order of accessing the coding tree units (CTUs) by analyzing the data dependencies between adjacent CTUs. This enables the DF to run in parallel, providing accelerated performance and more flexibility in the degree of parallelism, as well as finer parallel granularity. We additionally solve the problems of variable privatization and thread synchronization in the parallelization of the DF. Finally, the DF module is parallelized based on the HM16.1 reference software using OpenMP technology. The acceleration performance is experimentally tested under various numbers of cores, and the results show that the proposed scheme is very effective at speeding up the DF.

Nonuniform Delayless Subband Filter Structure with Tree-Structured Filter Bank (트리구조의 비균일한 대역폭을 갖는 Delayless 서브밴드 필터 구조)

  • 최창권;조병모
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.13-20
    • /
    • 2001
  • Adaptive digital filters with long impulse response such as acoustic echo canceller and active noise controller suffer from slow convergence and computational burden. Subband techniques and multirate signal processing have been recently developed to improve the problem of computational complexity and slow convergence in conventional adaptive filter. Any FIR transfer function can be realized as a serial connection of interpolators followed by subfilters with a sparse impulse response. In this case, each interpolator which is related to the column vector of Hadamard matrix has band-pass magnitude response characteristics shifted uniformly. Subband technique using Hadamard transform and decimation of subband signal to reduce sampling rate are adapted to system modeling and acoustic noise cancellation In this paper, delayless subband structure with nonuniform bandwidth has been proposed to improve the performance of the convergence speed without aliasing due to decimation, where input signal is split into subband one using tree-structured filter bank, and the subband signal is decimated by a decimator to reduce the sampling rate in each channel, then subfilter with sparse impulse response is transformed to full band adaptive filter coefficient using Hadamard transform. It is shown by computer simulations that the proposed method can be adapted to general adaptive filtering.

  • PDF

Tree Coding of Speech Signals (음성신호에 대한 트리 코우딩)

  • 김경수;이상욱
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1984.04a
    • /
    • pp.18-21
    • /
    • 1984
  • In this paper, the tree coding using the (M, L) multi-path search algorithm has teen investigated. A hybrid adaptation scheme which employs a block adaptation as well as a sequential dadptation is described for application in quantization and compression of speech signals. Simulation results with the gybrid adaptation scheme indicate that a relatively good speech quality can be obtained at rate about 8Kbps. All necessary parameters such as MlL and filter-order were found from simulation and these parameters turned out to be a good compromise between the complexity and overall performance.

  • PDF

Optical Method for Measuring Deposition Amount of Black Carbon Particles on Foliar Surface

  • Yamaguchi, Masahiro;Takeda, Kenta;Otani, Yoko;Murao, Naoto;Sase, Hiroyuki;Lenggoro, I. Wuled;Yazaki, Kenichi;Noguchi, Kyotaro;Ishida, Atsushi;Izuta, Takeshi
    • Asian Journal of Atmospheric Environment
    • /
    • v.6 no.4
    • /
    • pp.268-274
    • /
    • 2012
  • To perform quick measurements of black carbon (BC) particles deposited on foliar surfaces of forest tree species, we investigated an optical method for measuring the amount of BC extracted from foliar surfaces and collected on quartz fiber filters. The seedlings of Fagus crenata, Castanopsis sieboldii, Larix kaempferi and Cryptomeria japonica were exposed to submicron BC particles for one growing season (1 June to 7 December 2009). At the end of the growing season, the leaves or needles of the seedlings were harvested and washed with deionized water followed by washing with chloroform to extract the BC particles deposited on the foliar surfaces. The extracted BC particles were collected on a quartz fiber filter. The absorption spectrum of the filters was measured by spectrophotometer with an integrating sphere. To obtain the relationship between the absorbance of the filter and the amount of BC particles on the filter, the amount of BC particles on the filter was determined as that of elemental carbon (EC) measured by a thermal optical method. At wavelengths below 450 nm, the absorption spectrum of the filter showed absorption by biological substances, such as epicuticular wax, resulting in the low coefficient of determination ($R^2$) in the relationship between the amount of EC on the filter ($M_{EC}$, ${\mu}g\;C\;cm^{-2}$ filter area) and the absorbance of the filter. The intercept of the regression line between $M_{EC}$ and the absorbance of the filter at 580 nm ($A_{580}$) was closest to 0. There was a significant linear relationship between the $A_{580}$ and $M_{EC}$ ($R^2$=0.917, p<0.001), suggesting that the amount of BC particles collected on the filter can be predicted from the absorbance. This optical method might serve as a simple, fast and cost-effective technique for measuring the amount of BC on foliar surfaces.

Fumigant Toxicity and the Repellent Effect of Essential Oils against Sitophilus zeamais Motschulsky (어리쌀바구미에 대한 식물정유의 훈증독성과 기피효과)

  • Kim, Yeon-Kook;Kim, Kwang-Ho;Lee, Jong-Jin;Lee, Hoi-Seon;Lee, Sang-Guei
    • Korean journal of applied entomology
    • /
    • v.51 no.4
    • /
    • pp.389-395
    • /
    • 2012
  • Stored grain insects appear frequently as grains are harvested, stored, and distributed on the market. Producers mostly depend on chemical fumigants to control and repel insect pests, but this application of chemicals may cause side effects for humans and the environment. Safer control approaches, including the use of natural products are required, and in this study, we assessed the control effect of essential oils on stored grain insects. The essential oils of 8 plant species from 6 families were tested for their fumigant toxicity and repellent effects using a Y-tube Olfactometer against Sitophilus zeamais adults. Pennyroyal and tea tree oil respectively exhibited 97% and 63% mortality at $10{\mu}{\ell}L^{-1}$ air concentration in tested fumigant toxicity. Of particular note, pennyroyal oil ($LT_{50}$, hour=3.87) showed higher adulticidal activities than tea tree oil ($LT_{50}$, hour=4.09). When assessing repellent effects, using a Y-tube Olfactometer at $10{\mu}{\ell}$/filter paper concentration, the cedarwood, cinnamon, cypress, patchouli and pennyroyal essential oils showed potent repellent activities against Sitophilus zeamais adults. Cinnamon, cypress and pennyroyal essential oils showed notably high repellent activities of 82.4%, 80.0% and 86.7%, respectively, at $1{\mu}{\ell}$/filter paper concentration.

A Study on the Hardware Implementation of A 3${\times}$3 Window Weighted Median Filter Using Bit-Level Sorting Algorithm (비트 레벨 정렬 알고리즘을 이용한 3${\times}$3 윈도우 가중 메디언 필터의 하드웨어 구현에 관한 연구)

  • 이태욱;조상복
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.3
    • /
    • pp.197-205
    • /
    • 2004
  • In this paper, we studied on the hardware implementation of a 3${\times}$3 window weighted median filter using bit-level sorting algorithm. The weighted median filter is a generalization of the median filter that is able to preserve :,harp changes in signal and is very effective in removing impulse noise. It has been successfully applied in various areas such as digital signal and video/image processing. The weighted median filters are, for the most part, based on word-level sorting methods, which have more hardware and time complexity, However, the proposed bit-serial sorting algorithm uses weighted adder tree to overcome those disadvantages. It also offers a simple pipelined filter architecture that is highly regular with repeated modules and is very suitable for weighted median filtering. The algorithm was implemented by VHDL and graphical environment in MAX+PlusII of ALTERA. The simulation results indicate that the proposed design method is more efficient than the traditional ones.