• 제목/요약/키워드: fast image processing

검색결과 591건 처리시간 0.03초

초분광 분해기의 광학계 설계 및 영상 처리 (Optical System Design and Image Processing for Hyperspectral Imaging Systems)

  • 허아영;최승원;이재훈;김태형;박동조
    • 한국군사과학기술학회지
    • /
    • 제13권2호
    • /
    • pp.328-335
    • /
    • 2010
  • A hyperspectral imaging spectrometer has shown significant advantages in performance over other existing ones for remote sensing applications. It can collect hundreds of narrow, adjacent spectral bands for each image, which provides a wealth of information on unique spectral characteristics of objects. We have developed a compact hyperspectral imaging system that successively shows high spatial and spectral resolutions and fast data processing performance. In this paper, we present an overview of the hyperspectral imaging system including the strucure of geometrical optics and several image processing schemes such as wavelength calibration and noise reduction for image data on Visible and Near-Infrared(VNIR) and Shortwave-Infrared(SWIR) band.

Fast Outlier Removal for Image Registration based on Modified K-means Clustering

  • Soh, Young-Sung;Qadir, Mudasar;Kim, In-Taek
    • 융합신호처리학회논문지
    • /
    • 제16권1호
    • /
    • pp.9-14
    • /
    • 2015
  • Outlier detection and removal is a crucial step needed for various image processing applications such as image registration. Random Sample Consensus (RANSAC) is known to be the best algorithm so far for the outlier detection and removal. However RANSAC requires a cosiderable computation time. To drastically reduce the computation time while preserving the comparable quality, a outlier detection and removal method based on modified K-means is proposed. The original K-means was conducted first for matching point pairs and then cluster merging and member exclusion step are performed in the modification step. We applied the methods to various images with highly repetitive patterns under several geometric distortions and obtained successful results. We compared the proposed method with RANSAC and showed that the proposed method runs 3~10 times faster than RANSAC.

영상 처리 방법을 이용한 후각 상피 세포의 섬모 운동 특성 분석에 관한 연구 (A Study on the Analysis of Mucociliary Beat Frequency Using Image Processing)

  • 이원진;박광석;민양기;성명훈
    • 대한의용생체공학회:학술대회논문집
    • /
    • 대한의용생체공학회 1996년도 춘계학술대회
    • /
    • pp.111-114
    • /
    • 1996
  • Mucociliary transport is one of the essential defensive functions of the airway mucosa. In this paper, the objective and quantitative method of measuring CBF(Ciliary Beat Frequency) was developed based on the image processing method. Microscopic ciliary images are acquired through image processing board inside PC, and data necessary for the FFT(Fast Fourier Transform) analysis are extracted. By means of FFT analysis, maximum peak frequencies are found in each divided block of a whole acquired image. Finally using these frequencies, we compose a frequency map showing the spatial distribution of CBF's.

  • PDF

DCT계수를 이용한 고속 프랙탈 압축 기법과 화상 심층암호에의 응용 (Fast Fractal Image Compression Using DCT Coefficients and Its Applications into Video Steganography)

  • 이혜주;박지환
    • 한국정보처리학회논문지
    • /
    • 제4권1호
    • /
    • pp.11-22
    • /
    • 1997
  • 프랙탈 화상압축은 원화상을 일정 크기의 블럭으로 분할하고 자기 유사성(self -similarity)을 지닌 유사 영역을 탐색한다. 이 압축방식은 부가적인 코드북의 전송 이 필요하지 않아 높은 압축율을 달성하고 좋은 화질의 재생화상을 제공한다. 이러한 이점에도 불구하고 부호화시 유사 영역의 결정을 위한 복잡한 선형변환의 수행으로 인해 부호와 시간이 증가되는 단점이 있다. 본 논문에서는 블럭의 AC(alternating current)계수들을 이용하여 선형변환의 횟수를 감소시켜 부호화 시간을 줄이는 고속 프랙탈 화상압축을 제안한다. 제안 방식은 기존의 방식과 비교하여 좋은 화질을 제공 한다. 또한, 중요 기밀 데이터를 합성하는 화상 심층암호에 응용한 프랙탈 화상 압축 응용법을 제시한다.

  • PDF

Line scan camera를 이용한 검사 시스템에서의 새로운 영상 처리 알고리즘 (Development of improved image processing algorithms for an automated inspection system using line scan cameras)

  • 장동식;이만희;부창완
    • 제어로봇시스템학회논문지
    • /
    • 제3권4호
    • /
    • pp.406-414
    • /
    • 1997
  • A real-time inspection system is developed using line scan cameras. Several improved algorithms are proposed for real-time detection of defects in this automated inspection system. The major improved algorithms include the preprocessing, the threshold decision, and the clustering algorithms. The preprocessing algorithms are for exact binarization and the threshold decision algorithm is for fast detection of defects in 1-D binary images. The clustering algorithm is also developed for fast classifying of the defects. The system is applied to PCBs(Printed Circuit Boards) inspection. The typical defects in PCBs are pits, dent, wrinkle, scratch, and black spots. The results show that most defects are detected and classified successfully.

  • PDF

Fast Pedestrian Detection Using Histogram of Oriented Gradients and Principal Components Analysis

  • Nguyen, Trung Quy;Kim, Soo Hyung;Na, In Seop
    • International Journal of Contents
    • /
    • 제9권3호
    • /
    • pp.1-9
    • /
    • 2013
  • In this paper, we propose a fast and accurate system for detecting pedestrians from a static image. Histogram of Oriented Gradients (HOG) is a well-known feature for pedestrian detection systems but extracting HOG is expensive due to its high dimensional vector. It will cause long processing time and large memory consumption in case of making a pedestrian detection system on high resolution image or video. In order to deal with this problem, we use Principal Components Analysis (PCA) technique to reduce the dimensionality of HOG. The output of PCA will be input for a linear SVM classifier for learning and testing. The experiment results showed that our proposed method reduces processing time but still maintains the similar detection rate. We got twenty five times faster than original HOG feature.

A Fast SIFT Implementation Based on Integer Gaussian and Reconfigurable Processor

  • Su, Le Tran;Lee, Jong Soo
    • 한국정보전자통신기술학회논문지
    • /
    • 제2권3호
    • /
    • pp.39-52
    • /
    • 2009
  • Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.

  • PDF

빠른 IHS 기법을 이용한 IKONOS 영상융합 (IKONOS Image Fusion Using a Fast Intensity-Hue-Saturation Fusion Technique)

  • 윤공현
    • 대한공간정보학회지
    • /
    • 제14권1호
    • /
    • pp.21-27
    • /
    • 2006
  • 영상융합의 많은 방법들 중에 IHS 기법은 많은 대용량의 자료를 빨리 융합할 수 있는 장점을 가지고 있다. IKONOS 영상에 대하여 IHS기법은 향상된 공간해상도의 결과를 보여주고 있으나 분광의 왜곡을 포함하고 있다. 즉, 융합된 다중파장대 영상과 원래 다중파장대영상의 비교시 분광정보의 왜곡이 나타난다. 이러한 문제를 해결하기 위해서 본 연구에서는 분광정보 조정을 통하여 빠른 처리 속도를 지니는 IHS기법을 제안하였다. 실험결과 제안된 방법은 고전적인 IHS 융합기법보다 속도와 영상 질의 측면에서 더 나은 결과를 보여주었다.

  • PDF

FFT를 이용한 화재 열영상의 주파수 스펙트럼 분석 (A Frequency Spectrum Analysis based on FFT of Fire Thermal Image)

  • 김원호;장복규
    • 융합신호처리학회논문지
    • /
    • 제12권1호
    • /
    • pp.33-37
    • /
    • 2011
  • 본 논문은 FFT를 이용한 적외선 화재 열영상의 주파수 스펙트럼 분석에 관한 것으로 영상처리를 통하여 화재 발생 유무를 주파수 영역에서 판별하기 위한 조건을 도출하는 것이 목적이다. 적외선 열영상의 주파수 스펙트럼 분석은 고속 푸리에 변환을 이용하여 수행하였으며, 화재로 추정되는 고명도의 영역을 화재 후보영역으로 결정한 다음, 연속적인 열영상의 해당영역에 대하여 DC 및 AC 주파수 분포를 분석하였다. 분석된 결과를 기반으로 정적인 오검출 요소와 동적특성을 가지는 화재영역을 구분하는 열영상의 화재 판정 기준을 제시하고 컴퓨터 모의실험을 통하여 실용성을 확인하였다.

하중 Hadamard 변환의 영상부호화 (Weighted Hadamard Transform Image Coding)

  • Lee, Moon-Ho
    • 대한전자공학회논문지
    • /
    • 제24권2호
    • /
    • pp.301-308
    • /
    • 1987
  • In this paper, we have defined the Weighted Hadamard Transform (WHT) and developed efficient algorithms for the fast computation of the WHT. The WHT is applied to digital image processing and compared with Hadamard Transform (HT). We have weighted at the center spatial frequency domains of the Hadamard Transform and transmitted a image and then center high frequencies are neglected at the receiving. The WHT of signal to noise ratio(SNR) and image quality are enhanced than the HT.

  • PDF