• Title/Summary/Keyword: 2-D FFT

Search Result 143, Processing Time 0.034 seconds

Frequency Domain Pre-Processing for Automatic Defect Inspection of TFT-LCD Panels (TFT-LCD 패널의 자동 결함 검출을 위한 주파수영역 전처리)

  • Nam, Hyun-Do;Nam, Seung-Uk
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.7
    • /
    • pp.1295-1297
    • /
    • 2008
  • Large-sized flat-panel displays are widely used for PC monitors and TV displays. In this paper, frequency domain pre-filter algorithms are presented for detection of defects in large-sized Thin Film Transistor-Liquid Crystal Display(TFT-LCD) panel surfaces. Frequency analysis with 1-D, 2-D FFT methods for extract the periodic patterns of lattice structures in TFT-LCD is performed. To remove this patterns, frequency domain band-stop filters were used for eliminating specific frequency components. In order to acquire only defected images, 2-D inverse FFT methods to inverse transform of frequency domain images were used.

Automatic Defect inspection of TFT-LCD Panels Using a Pre-Filter (프리필터를 이용한 TFT-LCD 패널의 자동 결함 검출)

  • Nam, Seung-Uk;Seo, Sung-Dea;Nam, Hyun-Do;Ahn, Dong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.1864-1865
    • /
    • 2007
  • In this paper, we proposed pre-filter algorithms which using frequency domain analysis method, for the detections of defects in large-sized Thin Film Transistor-Liquid Crystal Display(TFT-LCD) panel surfaces. We performed frequency analysis with 1-D, 2-D FFT methods for extract periodic patterns of lattice structures in TFT-LCDs. To remove this patterns, band-stop filters were used for eliminating specific frequency components. In order to acquire only defected images, we used 2-D inverse FFT methods which can be reverts images that remains defects.

  • PDF

Fast Quadtree Based Normalized Cross Correlation Method for Fractal Video Compression using FFT

  • Chaudhari, R.E.;Dhok, S.B.
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.519-528
    • /
    • 2016
  • In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

Design and Fabrication of a Processing Element for 2-D Systolic FFT Array (고속 퓨리어변환용 2차원 시스토릭 어레이를 위한 처리요소의 설계 및 제작)

  • Lee, Moon-Key;Shin, Kyung-Wook;Choi, Byeong-Yoon;,
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.108-115
    • /
    • 1990
  • This paper describes the design and fabrication of a processing element that will be used as a component in the construction of a two dimensional systolic for FFT. The chip performs data shuffling and radix-2 decimation-in-time (DIT) butterfly arithmetic. It consists of a data routing unit, internal control logic and HBA unit which computes butterfly arithmetic. The 6.5K transistors processing element designed with standard cells has been fabricated with a 2u'm double metal CMOS process, and evaluated by wafer probing measurements. The measured characteristics show that a HBA can be computed in 0.5 usec with a 20MHz clok, and it is estimated that the FFT of length 1024 can be transformed in 11.2 usec.

  • PDF

A study on the BER Performance Improvement by Oversampling of the Transmit Signal Waveform in OFDM (OFDM에서 전송 신호의 oversampling을 통한 BER 성능개선에 관한 연구)

  • Kim Jee bum;Jeon Hyoung goo;Jang Jong wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1378-1386
    • /
    • 2004
  • In this paper, we propose an OFDM scheme to increase the BER performance. The proposed OFDM scheme makes the baseband OFDM signal by using the oversampled OFDM signal values which are obtained by inserting N(=2$\^$k/) zeros and carrying out 2N point IFFT. In the demodulation part, the sampling operation for A/D conversion is carried out with the 2 times high sampling speed. 2 N point FFT is carried out for the data demodulation. In this paper, we show, with the mathematical method and the computer simulation, that the SNR of the proposed OFDM scheme is 3 dB higher than that of the conventional OFDM in the same AWGN channel conditions given.

A Study on Signature Identification using the Distribution of Space Spectrum (공간 스펙트럼 분포를 이용한 서명 인식에 관한 연구)

  • 남시병;박진양;이상범
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.8
    • /
    • pp.1-7
    • /
    • 1993
  • This paper proposed an algorithm that extracts the optimum characteristics parameters to identify the signatures from the spectrum using 2-D FFT. The signature image input through a scanner is normalized into 250*128 pixels in the prepocessor. Normalized image is divided into block segments and each segment is transformed into space spectrum by 2-d FFT. There are several methods extracting the signature characteristic parameters from that spectrum. The result of experimentations which use the characteristic parameters extracted between $0^{\circ}and\;90^{\circ}$ in (0, 0), (63, 0) corners from 64$\times$64 block spectrum shows that the signature identification rate using that method gives 92.5% of successful achievement for 100 signatures, higher than the others.

  • PDF

On Evaluation of Stacking Fault in CERP Composite Plates of Using Ultrasonic Images (초음파 이미지를 이용한 CFRP 복합적층판의 적층결함 평가)

  • 임광희;나승우;심재기;양인영
    • Proceedings of the Korean Society For Composite Materials Conference
    • /
    • 2003.04a
    • /
    • pp.121-124
    • /
    • 2003
  • This paper shows shear wave behavior of CFRP(carton fiber reinforced plastics) composite laminates as a polar grid form to evaluate vibration pattern of ultrasonic transducers, which gives measured modelling fundamental contents of nondestructive evaluation. This modelling decomposes the transmission of a linearly polarized wave into orthogonal components through each ply of a laminate. It is found that a high probability shows between the model and measurement system in characterizing lay up of CFRP composite laminates. Also evaluating quantitatively the defects in CFRP laminates who found to be possible of normalized frequency obtained from 2D-FFT technique based on C-scan method. Thus, the technique is proven to be one of the useful means to evaluate any internal defect in CFRP composite laminates.

  • PDF

An Adaptive Image Restoration Algorithm Using Edge Detection Based on the Block FFT (블록 FFT에 기초한 에지검출을 이용한 적응적 영상복원 알고리즘)

  • Ahn, Do-Rang;Lee, Dong-Wook
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.569-571
    • /
    • 1998
  • In this paper, we propose a method of restoring blurred images by an edge-sensitive adaptive filter. The direction of the edge is estimated using the properties of 2-D block FFT. Reduction of blurring due to the added noise during image transfer and the focus of lens caused by shooting a fast moving object is very important. To remove this phenomenon effectively, we can use the edge information obtained by processing the blurred images. The proposed algorithm estimates both the existence and the direction of the edge. On the basis of the acquired edge direction information, we choose the appropriate edge-sensitive adaptive filter, which enables us to get better images than images obtained by methods not considering the direction of the edge. The performance of the proposed algorithm is shown in the simulation result.

  • PDF

An Implementation and Verification of Performance Monitor for Parallel Signal Processing System (병렬신호처리시스템을 위한 성능 모니터의 구현 및 검증)

  • Lee Won-Joo;Kim Hyo-Nam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.313-322
    • /
    • 2005
  • In this paper, we implement and verify performance monitor for parallel signal processing system, using DSP Starter Kit(DSK) of which the basic Processor is TMS302C6711 chip. The key ideas of this performance monitor is, using Real Time Data Exchange(RTDX) for the Purpose of real-time data transfer and function of DSP/BIOS, the ability to measure the Performance measure like DSP workload, memory usage, and bridge traffic. In the simulation, FFT, 2D FFT, Matrix Multiplication, and Fir Filter, which are widely used DSP algorithms, have been employed. Using performance monitor and Code Composer Studio from Texas Instrument(Tl) , the result has been recorded according to different frequencies, data sizes, and buffer sizes for a single wave file. The accuracy of our performance monitor has been verified by comparing those recorded results.

  • PDF

Efficient All-to-All Personalized Communication Algorithms in Wormhole-Routed Networks (웜홀 방식의 네트워크에서 효율적인 다대다 개별적 통신 알고리즘)

  • 김시관;강오한;정종인
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.359-369
    • /
    • 2003
  • We present efficient generalized algorithms for all-to-all personalized communication operations in a 2D torus. All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, Fast Fourier Transform(FFT), and distributed table lookup. Some algorithms have been Presented when the number of nodes is power-of-2 or multiple-of-four form, but there has been no result for general cases yet. We first present complete exchange algorithm called multiple-Hop-2D when the number of nodes is in the form of multiple-of-two. Then by extending this algorithm, we present two algorithms for an arbitrary number of nodes. Split-and-Merge algorithm first splits the whole network into zones. After each zone performs complete exchange, merge is applied to finish the desired complete exchange. By handling extra steps in Double-Hop-2D algorithm, Modified Double-Hop-2D algorithm performs complete exchange operation for general cases. Finally, we compare the required start-up time for these algorithms.