• Title/Summary/Keyword: Tree filter

Search Result 120, Processing Time 0.022 seconds

Korean Character Recognition with Tree Structure Using Representative Images (대표영상을 이용한 나무구조의 한글문자 인식)

  • 김정우;정수길;조웅호;김성용;김수중
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.18-29
    • /
    • 1994
  • For the efficient recognition of Korean Alphabets, we proposed the tree structure algorithm which was based on K-tuple NRF-SDF using representative images as training images. Representative images consisted of ECP-SDF images of several consonants or vowels. To reduce the effect of sidelobe in the output correlation plane, we used the representative images as training images and obtained the elements of a vector inner product matrix using the peak value of AMPOF correlation of training images with one another. The proposed algorithm consisted of three main-step containing several substeps. In filter synthesis of each step, representative images were used as training images in the first and the second main-step and each consonant or vowel was used as training images in the third main-step. The performance of this algorithm is demonstrated by computer simulation and optical experiment.

  • PDF

Efficient Filter Step of DOT Spatial Join Algorithm (DOT 공간조인 알고리즘의 효율적인 여과단계 처리)

  • Yu, Yong-Hyuk;Back, Hyun;Yoon, Jee-Hee;Lee, Keon-Bae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04b
    • /
    • pp.39-41
    • /
    • 2000
  • 공간조인 연산은 지리정보시스템의 연산 중 매우 높은 처리비용을 요구하는 연산이다. DOT 공간 색인 기법은 전통적인 데이터베이스 시스템의 주색인 기법을 적용할 수 있으며, 공간객체의 상호 인접성이 유지되도록 Hilbert 값으로 정렬되어 클러스터링 된다. 이러한 특징을 이용한 DOT공간 조인 알고리즘은 적정한 버퍼크기를 유지하는 경우 잘 알려진 R-tree를 이용한 공간조인 알고리즘에 비해 디스크 액세스면에서 유리한 장점이 있으나, 조인가능영역 산출시 많은 양의 공간변환 연산을 필요로 하므로 전체적인 성능이 만족스럽지 못하다. 본 논문은 DOT 공간조인 알고리즘의 성능을 향상시키기 위하여 이러한 공간변환 연사의 횟수를 최소화시킨 효율적인 여과단계처리 방법을 제시하며, 이를 적용한 DOT공간조인 알고리즘과 R-tree 공간조인 알고리즘의 실행시간을 비교 분석하여 DOT 공간조인 알고리즘이 최대 약 2배까지 우수한 성능을 가지고 있음을 보인다.

  • PDF

A Versatile Medical Image Enhancement Algorithm Based on Wavelet Transform

  • Sharma, Renu;Jain, Madhu
    • Journal of Information Processing Systems
    • /
    • v.17 no.6
    • /
    • pp.1170-1178
    • /
    • 2021
  • This paper proposed a versatile algorithm based on a dual-tree complex wavelet transform for intensifying the visual aspect of medical images. First, the decomposition of the input image into a high sub-band and low-sub-band image is done. Further, to improve the resolution of the resulting image, the high sub-band image is interpolated using Lanczos interpolation. Also, contrast enhancement is performed by singular value decomposition (SVD). Finally, the image reconstruction is achieved by using an inverse wavelet transform. Then, the Gaussian filter will improve the visual quality of the image. We have collected images from the hospital and the internet for quantitative and qualitative analysis. These images act as a reference image for comparing the effectiveness of the proposed algorithm with the existing state-of-the-art. We have divided the proposed algorithm into several stages: preprocessing, contrast enhancement, resolution enhancement, and visual quality enhancement. Both analyses show the proposed algorithm's effectiveness compared to existing methods.

Confidential Convergecast Based on Random Linear Network Coding for the Multi-hop Wireless Sensor Network

  • Davaabayar Ganchimeg;Sanghyun Ahn;Minyeong Gong
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.252-262
    • /
    • 2024
  • The multi-hop wireless sensor network (WSN) suffers from energy limitation and eavesdropping attacks. We propose a simple and energy-efficient convergecast mechanism using inter-flow random linear network coding that can provide confidentiality to the multi-hop WSN. Our scheme consists of two steps, constructing a logical tree of sensor nodes rooted at the sink node, with using the Bloom filter, and transmitting sensory data encoded by sensor nodes along the logical tree upward to the sink where the encoded data are decoded according to our proposed multi-hop network coding (MHNC) mechanism. We conducted simulations using OMNET++ CASTALIA-3.3 framework and validated that MHNC outperforms the conventional mechanism in terms of packet delivery ratio, data delivery time and energy efficiency.

Similarity-Based Subsequence Search in Image Sequence Databases (이미지 시퀀스 데이터베이스에서의 유사성 기반 서브시퀀스 검색)

  • Kim, In-Bum;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.501-512
    • /
    • 2003
  • This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure than Lp distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequences without false dismissals. It applies the normaliration for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verify that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.

Video Subband Coding using Quad-Tree Algorithm (쿼드트리 알고리즘을 이용한 비디오 서브밴드 코딩)

  • An, Chong-Koo;Chu, Hyung-Suk
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.3
    • /
    • pp.120-126
    • /
    • 2005
  • This paper presents the 3D wavelet based video compression system using quad-tree algorithm. The 3D wavelet based video compression system removes the temporal correlation of the input sequences using the motion compensation filter and decomposes the spatio-temporal subband using the spatial wavelet transform. The proposed system allocates the higher bit rate to the low frequency image of the 3D wavelet sequences and improves the 0.64dB PSNR performance of the reconstructed image in comparison with that of H.263. In addition to the limitation on the propagation of the motion compensation error by the 3D wavelet transform, the proposed system progressively transmits the input sequence according to the resolution and rate scalability.

  • PDF

Low Memory Zerotree Coding (저 메모리를 갖는 제로트리 부호화)

  • Shin, Cheol;Kim, Ho-Sik;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.814-821
    • /
    • 2002
  • The SPIHT(set partitioning in hierarchical tree) is efficient and well-known in the zerotree coding algorithm. However SPIHT's high memory requirement is a major difficulty for hardware implementation. In this paper we propose low-memory and fast zerotree algorithm. We present following three methods for reduced memory and fst coding speed. First, wavelet transform by lifting has a low memory requirement and reduced complexity than traditional filter bank implementation. The second method is to divide the wavelet coefficients into a block. Finally, we use NLS algorithm proposed by Wheeler and Pearlman in our codec. Performance of NLS is nearly same as SPIHT and reveals low and fixed memory and fast coding speed.

CNN-based In-loop Filter on TU Block (TU 블록 크기에 따른 CNN기반 인루프필터)

  • Kim, Yang-Woo;Jeong, Seyoon;Cho, Seunghyun;Lee, Yung-Lyul
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.11a
    • /
    • pp.15-17
    • /
    • 2018
  • VVC(Versatile Video Coding)는 입력된 영상을 CTU(Coding Tree Unit) 단위로 분할하여 코딩하며, 이를 다시 QTBTT(Quadtree plus binary tree and triple tree)로 분할하고, TU(Transform Unit)도 이와 같은 단위로 분할된다. 따라서 TU의 크기는 $4{\times}4$, $4{\times}8$, $4{\times}16$, $4{\times}32$, $8{\times}4$, $16{\times}4$, $32{\times}4$, $8{\times}8$, $8{\times}16$, $8{\times}32$, $16{\times}8$, $32{\times}8$, $16{\times}16$, $16{\times}32$, $32{\times}16$, $32{\times}32$, $64{\times}64$의 17가지 종류가 있다. 기존의 VVC 참조 Software인 VTM에서는 디블록킹필터와 SAO(Sample Adaptive Offset)로 이루어진 인루프필터를 이용하여 에러를 복원하는데, 본 논문은 TU 크기에 따라서 원본블록과 복원블록의 차이(에러)가 통계적으로 다름을 이용하여 서로 다른 CNN(Convolution Neural Network)을 구축하고 에러를 복원하는 방법으로 VTM의 인루프 필터를 대체한다. 복원영상의 에러를 감소시키기 위하여 TU 블록크기에 따라 DenseNet의 Dense Block기반 CNN을 구성하고, Hyper Parameter와 복잡도의 감소를 위해 네트워크 간에 일부 가중치를 공유하는 모양의 Network를 구성하였다.

  • PDF

Study of the Tone Variation on Juniperus chinensis L. and Populus glandulosa Uyeki by Photographs (사진상(寫眞上)에 나타난 향나무(Juniperus chinensis L.)와 수원사시나무(Populus glandulosa Uyeki)의 색조변화(色調變化)에 관(關)한 연구(硏究))

  • Kim, Kap Duk
    • Journal of Korean Society of Forest Science
    • /
    • v.13 no.1
    • /
    • pp.1-24
    • /
    • 1971
  • In order to elucidate the feasibility to identify the plant species through the photographic tone this study was made. In this study the author made photographs of Juniperus chinensis L., and Populus glandulosa Uyeki, with the panchromatic film using either yellow filter or red filter in different seasons respectively. The author analyzed the value of tone variation at the level of stereoscopic view of the same photographs by using tone scale and Automatic Micro-Photo-Densitometer. The results obtained are summarized as follows: A. Tone scale reading 1. The tone of Populus glandulosa Uyeki was darker than that of Juniperus chinensis L. in a photograph. 2. Regardless of the tree species, tone of photographs obtained with yellow filter was darker than that with red filter. 3. Along the progresses of seasons, the photographic tone was changed. That is, from the spring to the summer it showed darker and than, from the summer to winter it changed lighter. 4. During winter and spring the discrimination between the both species of trees can be easily made by stereoscopic view whether there are leaves on the tree or not rather than by tone observation. 5. Regardless of tree species, variation of tone due to the age was noticed. The older trees have darker tone than the younger one. 6. It is recognized that the yearly difference depends on insolation quantities. 7. The highest reflex light-waves were in between $600m{\mu}$ and $660m{\mu}$ for both species of trees. B. Density reading 1. For the density reading, there was the same tendency as in tone scale reading. 2. The changes of peaks of the scanning curves with Populus glandulosa Uyeki is smoother and takes place in lower position than with Juniperus chinensis L. 3. The scanning curves on the 20th May was smoothest, and change of peaks increased gradually according to the season progresses. 4. In relation to the types of filter the photographs with yellow filter showed less changes of peaks then that with red filter.

  • PDF

Evaluation on the Hydrologic Effects after Applying an Infiltration Trench and a Tree Box Filter as Low Impact Development (LID) Techniques (저영향 개발기법의 침투도랑과 나무여과상자 적용 후 수문학적 효과 평가)

  • Flores, Precious Eureka D.;Maniquiz-Redillas, Marla C.;Tobio, Jevelyn Ann S.;Kim, Lee-Hyung
    • Journal of Korean Society on Water Environment
    • /
    • v.31 no.1
    • /
    • pp.12-18
    • /
    • 2015
  • In this research, the hydrologic effects between a pre-existing urban landuse and low impact development (LID) applied conditions were compared and evaluated. The infiltration trench and tree box filter that were utilized in LID represent only 1% of the catchment area that they drain. Storm event monitoring were conducted from July 2010 to July 2014 on a total of 22 storm events in both LID sites. After LID, hydrological improvement was observed as the sites exhibited a delay (lag time) or reduction in the magnitude, frequency and duration of runoff and flow peaks as the rainfall progress. In addition, the maximum irreducible peak flow reduction for infiltration trench was found to be 61% and 33% for the tree box filter when rainfall was 40 mm and 30 mm, respectively. In designing LID, it is recommended to consider the storage capacity and catchment area, as well as the amount of rainfall and runoff on the site.