• Korean Journal of Remote Sensing
• /
• v.23 no.5
• /
• pp.409-420
• /
• 2007

Since 1988, pine wilt disease has spread over rapidly in Korea. It is not easy to detect the damaged pine trees by pine wilt disease from conventional remote sensing skills. Thus, many possibilities were investigated to detect the damaged pines using various kinds of remote sensing data including high spatial resolution satellite image of 2000/2003 IKONOS and 2005 QuickBird, aerial photos, and digital airborne data, too. Time series of B&W aerial photos at the scale of 1:6,000 were used to validate the results. A local maximum filtering was adapted to determine whether the damaged pines could be detected or not at the tree level from high resolution satellite images, and to locate the damaged trees. Several enhancement methods such as NDVI and image transformations were examined to find out the optimal detection method. Considering the mean crown radius of pine trees, local maximum filter with 3 pixels in radius was adapted to detect the damaged trees on IKONOS image. CIR images of 50 cm resolution were taken by PKNU-3(REDLAKE MS4000) sensor. The simulated CIR images with resolutions of 1 m, 2 m, and 4 m were generated to test the possibility of tree detection both in a stereo and a single mode. In conclusion, in order to detect the pine tree damaged by pine wilt disease at a tree level from satellite image, a spatial resolution might be less than 1 m in a single mode and/or 1 m in a stereo mode.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.77-84
• /
• 2017

Generally, a time-varying vibration signal is generated in a rotating machine system, and when there is a failure in the rotating machine, the signal contains noise. In this paper, we propose a system consisting of an adaptive predictor and a binary tree filter bank for analyzing time - varying vibration signals with noise. And the vibration signal analyzed results in this system is used for fault diagnosis of the rotating machine. The adaptive predictor of the proposed system predicts the periodic signal components, and the filter bank system decomposes the difference signal between the input signal and the predicted periodic signal into subband. Since each subband signal includes a noise signal component due to a failure, it is possible to diagnose the failure of the using rotary machine. The validity of the proposed vibration signal analysis method is shown in the simulations, where the periodic components cancelled vibrating signals are decomposed to 32 subband, and the signal characteristics related faults are analyzed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.92-97
• /
• 2012

This paper suggests a data gathering scheme using dynamic branch tree in wireless sensor networks. A mobile sink gathers data from each sensor node using a dynamic data gathering tree rooted at the mobile sink node. As the sink moves, a tree that has multiple branch is formed and changed dynamically as with the position of the sink node. A hop-based scope filter and a restricted flooding scheme of the tree are also suggested. Simulation results show that the proposed data gathering scheme has better results in data arrival rate, the end-to-end delay and energy saving characteristics compared with the previous scheme.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.515-518
• /
• 2005

LiDAR(Light Detection and Ranging) with digital aerial photograph can be used to measure tree growth factors like total height, height of clear-length, dbh(diameter at breast height) and crown projection area. Delineating crown is an important process for identifying and numbering individual trees. Crown delineation can be done by watershed method to segment basin according to elevation values of DSMmax produced by LiDAR. Digital aerial photograph can be used to validate the crown projection area using LiDAR. And tree height can be acquired by image processing using window filter$(3cell\times3cell\;or\;5cell\times5cell)$ that compares grid elevation values of individual crown segmented by watershed.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.3
• /
• pp.405-412
• /
• 2010

The purpose of this paper is to compare complexity and to assess flexibility of competing transponder architectures for satellite communication services. For performance comparison, we consider three channelization techniques: digital down converter(DDC) based on the use of the cascaded integrator-comb(CIC) filter, tuneable pipeline frequency transform(T-PFT) based on the tree-structure(TS) and variable oversampled complex-modulated filter banks(OCM-FB) based on the polyphase FFT(P-FFT). The comparison begins by presenting a basic architecture of each channelization method and includes analytical expressions of the number of multiplications as a computational complexity perspective. The analytical results show that DDC with CIC filter requires the heavy computational burden and the perfect flexibility. T-PFT based on the TS provides the almost perfect flexibility with the low complexity over DDC with the CIC filter for a large number of sub-channels. OCM-FB based on the P-FFT shows the high flexibility and the best computational complexity performance compared with other approaches.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.143-144
• /
• 2020

VVC (Versatile Video Coding)는 HEVC이후 차세대 표준 비디오 코딩으로 JVET(Joint Video Exploration)에 의해 2018년 표준화를 시작하였다. VVC에는 복원픽쳐의 변환-양자화에러에 의해 발생한 블로어, 블로킹, 링잉 아티팩트를 감소시키기 위하여 deblocking filter (DF), sample adaptive offset (SAO), adaptive loop filter(ALF)와 같은 모듈을 사용한다. 한편 CNN (Convolutional Neural Network)은 최근 이미지와 비디오 복원에 높은 성능을 보이고 있다. VVC에서 픽쳐는 CTU (Coding Tree Unit)으로 분할되고 각 CTU는 다시 CU (Coding Unit)으로 분할된다. 그리고 인코딩을 위한 중요한 정보들이 Picture, CTU, CU단위로 디코더에 전송된다. 이 논문에서는 화면 간 예측으로 인코딩 된 픽처에서 블록과 픽처정보를 이용한 딥러닝 기반의 인루프 필터 모델을 제안한다. 제안하는 모델은 화면 간 예측에서 QP, 4×4 블록단위의 모션벡터, 참조블록과의 시간적거리, CU의 깊이를 모델에 추가적인 정보로 이용한다.

• Journal of the Korean Society of Safety
• /
• v.34 no.1
• /
• pp.14-20
• /
• 2019

This paper presents a safety assessment based approach for the safe operation for PCS(Power Conditioning System) of photovoltaic and energy storage systems, applying FTA. The approach established top events as power outage and a failure likely to cause the largest damage among the potential risks of PCS. Then the Minimal Cut Set (MCS) and the importance of basic events were analyzed for implementing risk assessment. To cope with the objects, the components and their functions of PCS were categorized. To calculate the MCS frequency based on IEEE J Photovolt 2013, IEEE Std. 493-2007 and RAC (EPRD, NPRD), the failure rate and failure mode were produced regarding the basic events. In order to analyze the top event of failure and power outage, it was assumed that failures occurred in DC breaker, AC breaker, SMPS, DC filter, Inverter, CT, PT, DSP board, HMI, AC reactor, MC and EMI filter and Fault Tree was drawn. It is expected that the MCS and the importance of basic event resulting from this study will help find and remove the causes of failure and power outage in PCS for efficient safety management.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.1-11
• /
• 2009

A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.240-248
• /
• 2022

Floating-point images that express pixel information as real numbers are used in HDR images. There have been various researches on efficient median filter algorithms, but most of them are applicable to 8-bit depth images and there are only a few number of algorithms applicable to floating-point images, including Gil and Werman's algorithm. In this paper, we propose a median filter algorithm that works efficiently on floating-point images by improving Kim's algorithm, which improved Gil and Werman's algorithm. Experimental results show that the execution time is improved by about 10% compared to the Kim's algorithm by reducing the redundant work for the repetitively used binary search tree and applying the inverted index.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.