• 제목/요약/키워드: image algorithm

검색결과 8,962건 처리시간 0.031초

Self-adaptive and Bidirectional Dynamic Subset Selection Algorithm for Digital Image Correlation

  • Zhang, Wenzhuo;Zhou, Rong;Zou, Yuanwen
    • Journal of Information Processing Systems
    • /
    • 제13권2호
    • /
    • pp.305-320
    • /
    • 2017
  • The selection of subset size is of great importance to the accuracy of digital image correlation (DIC). In the traditional DIC, a constant subset size is used for computing the entire image, which overlooks the differences among local speckle patterns of the image. Besides, it is very laborious to find the optimal global subset size of a speckle image. In this paper, a self-adaptive and bidirectional dynamic subset selection (SBDSS) algorithm is proposed to make the subset sizes vary according to their local speckle patterns, which ensures that every subset size is suitable and optimal. The sum of subset intensity variation (${\eta}$) is defined as the assessment criterion to quantify the subset information. Both the threshold and initial guess of subset size in the SBDSS algorithm are self-adaptive to different images. To analyze the performance of the proposed algorithm, both numerical and laboratory experiments were performed. In the numerical experiments, images with different speckle distribution, different deformation and noise were calculated by both the traditional DIC and the proposed algorithm. The results demonstrate that the proposed algorithm achieves higher accuracy than the traditional DIC. Laboratory experiments performed on a substrate also demonstrate that the proposed algorithm is effective in selecting appropriate subset size for each point.

Rock Fracture Centerline Extraction based on Hessian Matrix and Steger algorithm

  • Wang, Weixing;Liang, Yanjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권12호
    • /
    • pp.5073-5086
    • /
    • 2015
  • The rock fracture detection by image analysis is significant for fracture measurement and assessment engineering. The paper proposes a novel image segmentation algorithm for the centerline tracing of a rock fracture based on Hessian Matrix at Multi-scales and Steger algorithm. A traditional fracture detection method, which does edge detection first, then makes image binarization, and finally performs noise removal and fracture gap linking, is difficult for images of rough rock surfaces. To overcome the problem, the new algorithm extracts the centerlines directly from a gray level image. It includes three steps: (1) Hessian Matrix and Frangi filter are adopted to enhance the curvilinear structures, then after image binarization, the spurious-fractures and noise are removed by synthesizing the area, circularity and rectangularity; (2) On the binary image, Steger algorithm is used to detect fracture centerline points, then the centerline points or segments are linked according to the gap distance and the angle differences; and (3) Based on the above centerline detection roughly, the centerline points are searched in the original image in a local window along the direction perpendicular to the normal of the centerline, then these points are linked. A number of rock fracture images have been tested, and the testing results show that compared to other traditional algorithms, the proposed algorithm can extract rock fracture centerlines accurately.

PET/MR 영상에서의 팬텀을 활용한 노이즈 감소를 위한 변형된 중간값 위너필터의 적용 효율성 연구 (Efficiency of Median Modified Wiener Filter Algorithm for Noise Reduction in PET/MR Images: A Phantom Study)

  • 조영현;이세정;이영진;박찬록
    • 대한방사선기술학회지:방사선기술과학
    • /
    • 제44권3호
    • /
    • pp.225-229
    • /
    • 2021
  • The digital image such as medical X-ray and nuclear medicine field mainly contains noise distribution. The noise degree in image degrades image quality. That is why, the noise reduction algorithm is efficient for medical image field. In this study, we confirmed effectiveness of application for median modified Wiener filter (MMWF) algorithm for noise reduction in PET/MR image compared with median filter image, which is used as conventional noise redcution algorithm. The Jaszczak PET phantom was used by using 18F solution and filled with NaCl+NiSO4 fluids. In addition, the radioactivity ratio between background and six spheres in the phantom is maintained to 1:8. In order to mimic noise distribution in the image, we applied Gaussian noise using MATLAB software. To evlauate image quality, the contrast to noise ratio (CNR) and coefficient of variation (COV) were used. According to the results, compared with noise image and images with MMWF algorithm, the image with MMWF algorithm is increased approximately 33.2% for CNR result, decreased approximately 79.3% for COV result. In conclusion, we proved usefulness of MMWF algorithm in the PET/MR images.

Economical image stitching algorithm for portable panoramic image assistance in automotive application

  • Demiryurek, Ahmet;Kutluay, Emir
    • Advances in Automotive Engineering
    • /
    • 제1권1호
    • /
    • pp.143-152
    • /
    • 2018
  • In this study an economical image stitching algorithm for use in automotive industry is developed for retrofittable panoramic image assistance applications. The aim of this project is to develop a driving assistance system known as Panoramic Parking Assistance (PPA) which is cheap, retrofittable and compatible for every type of automobiles. PPA generates bird's eye view image using cameras installed on the automobiles. Image stitching requires to get bird's eye view position of the vehicle. Panoramic images are wide area images that cannot be available by taking one shot, attained by stitching the overlapping areas. To achieve correct stitching many algorithms are used. This study includes some type of these algorithms and presents a simple one that is economical and practical. Firstly, the mathematical model of a wide view of angle camera is provided. Then distorted image correction is performed. Stitching is implemented by using the SIFT and SURF algorithms. It has been seen that using such algorithms requires complex image processing knowledge and implementation of high quality digital processors, which would be impracticle and costly for automobile use. Thus a simpler algorithm has been developed to decrase the complexity. The proposed algorithm uses one matching point for every couple of images and has ease of use and does not need high power processors. To show the efficiency, images coming from four distinct cameras are stitched by using the algorithm developed for the study and usability for automotive application is analyzed.

전력밀도 스펙트럼을 이용한 반복적 영상 신호 복원 알고리즘 (Iterative Image Restoration Algorithm Using Power Spectral Density)

  • 임영석;이문호
    • 대한전자공학회논문지
    • /
    • 제24권4호
    • /
    • pp.713-718
    • /
    • 1987
  • In this paper, an iterative restoration algorithm from power spectral density with 1 bit sign information of real part of two dimensional Fourier transform of image corrupted by additive white Gaussian noise is proposed. This method is a modified version of image reconstruction algorithm from power spectral density. From the results of computer simulation with original 32 gray level imgae of 64x64 pixels, we can find that restorated image after each iteration converge to original image very fast, and SNR gain be at least 8[dB] after 10th iteration for corrupted image with additive white Gaussian noise.

  • PDF

OCR 시스템을 위한 화상 정렬 알고리즘과 고속 하드웨어 구현 (A Image Alignment Algorithm for an OCR System and its Hardware Implementation)

  • 최완수;최진호;정윤구;김수원
    • 전자공학회논문지B
    • /
    • 제30B권8호
    • /
    • pp.33-40
    • /
    • 1993
  • This paper presents a hardware for image alignment based on proposed new algorithm which can align a small misaligned document image simply by one transformation with a parallel shifting of pixels. This hardware is simulated with VHDL and estimated to be about 65 ms to align an image made up of 380 by 480 pixels. Also, we will demonstrate the effectiveness of the proposed image alignment algorithm in OCR system by comparing its characteristics with those of the existing image rotation algorithms.

  • PDF

사분트리 알고리즘과 기하학적 웨이블렛을 이용한 손실 영상 압축 (Lossy Image Compression Based on Quad Tree Algorithm and Geometrical Wavelets)

  • 추형석;안종구
    • 전기학회논문지
    • /
    • 제58권11호
    • /
    • pp.2292-2298
    • /
    • 2009
  • In this paper, the lossy image compression algorithm using the quad tree and the bandlets is proposed. The proposed algorithm transforms input images by the discrete wavelet transform (DWT) and represents the geometrical structures of high frequency bands using the bandlets with a 8 block- size. In addition, the proposed algorithm searches the position information of the significant coefficients by using the quad tree algorithm and computes the magnitude and the sign information of the significant coefficients by using the Embedded Image Coding using Zerotrees of Wavelet Coefficients (EZW) algorithm. The compression result by using the quad tree algorithm improves the PSNR performance of high frequency images up to 1 dB, compared to that of JPEG-2000 algorithm and that of S+P algorithm. The PSNR performance by using DWT and bandlets improves up to 7.5dB, compared to that by using only DWT.

변수화된 영상 보정을 통한 전방향 영상 생성 방법 (Omni-directional Image Generation Algorithm with Parametric Image Compensation)

  • 김유나;심동규
    • 방송공학회논문지
    • /
    • 제11권4호
    • /
    • pp.396-406
    • /
    • 2006
  • 본 논문에서는 변수화된 영상 보정을 통한 전방향 영상 (Omni-directional image) 생성 방법을 제안한다. 제안한 방법은 모든 방향의 영상을 포함하고 영상 합성 시에 발생하는 왜곡과 에러를 최소화하는 전방향 영상을 생성하기 위해, 원형 좌표계를 기반으로 평면 영상을 원형 영상으로 변환한다. 카메라로 획득한 각각의 영상은 카메라의 시스템과 외부 환경 조건에 따라 발생하는 비그네이팅 효과와 조명 변화를 포함하고 있으므로, 최적의 비그네이팅 및 조명 변수를 추출하여 자연스러운 전방향 영상 생성을 위한 영상 보정 과정을 수행한다. 실험 결과에서는 제안한 방법에 따라 생성된 전방향 영상을 확인하고 비그네이팅 효과 및 조명 변화를 고려하지 않은 방법과 제안한 방법의 성능을 비교, 분석하여 제안한 방법이 $1{\sim}4dB$ 정도 더 효과적임을 보인다.

영상코드화 기법을 이용한 PIV 알고리듬에 대한 연구 (A Research on the PIV Algorithm Using Image Coding)

  • 김성균
    • 대한기계학회논문집B
    • /
    • 제24권2호
    • /
    • pp.153-160
    • /
    • 2000
  • A Particle Image Velocimetry(PIV) algorithm is developed to analyze whole flow field both qualitatively and quantitatively. The practical use of PIV requires the use of fast, reliable, computer-based methods for tracking numerous particles suspended in a flow field. The TSS, NTSS, FFT-Hybrid, which are developed in the area of image compression and coding, are introduced to develop fast vector search algorithm. The numerical solution of the lid-driven cavity flow by the ADI algorithm with the Wachspress Formula is introduced to produce synthetic data for the validation of the tracking algorithms. The algorithms are applied to image data of real flow experiments. The comparisons in CPU time and mean error show, with a small loss of accuracy, CPU time for tracking is reduced considerably.

가변적 감마 계수를 이용한 노출융합기반 단일영상 HDR기법 (A HDR Algorithm for Single Image Based on Exposure Fusion Using Variable Gamma Coefficient)

  • 한규필
    • 한국멀티미디어학회논문지
    • /
    • 제24권8호
    • /
    • pp.1059-1067
    • /
    • 2021
  • In this paper, a HDR algorithm for a single image is proposed using the exposure fusion, that adaptively calculates gamma correction coefficients according to the image distribution. Since typical HDR methods should use at least three images with different exposure values at the same scene, the main problem was that they could not be applied at the single shot image. Thus, HDR enhancements based on a single image using tone mapping and histogram modifications were recently presented, but these created some location-specific noises due to improper corrections. Therefore, the proposed algorithm calculates proper gamma coefficients according to the distribution of the input image and generates different exposure images which are corrected by the dark and the bright region stretching. A HDR image reproduction controlling exposure fusion weights among the gamma corrected and the original pixels is presented. As the result, the proposed algorithm can reduce certain noises at both the flat and the edge areas and obtain subjectively superior image quality to that of conventional methods.