• Title/Summary/Keyword: BLURRING

Search Result 441, Processing Time 0.032 seconds

A Study on the Usefulness of VGR (Virtual Grid Role) Algorithm for Elevation of Image Quality in DR System (DR 시스템에서 화질 개선을 위한 VGR 알고리즘의 유용성에 관한 연구)

  • Yang, Hyun-Jin;Han, Dong-Kyoon
    • Journal of the Korean Society of Radiology
    • /
    • v.14 no.6
    • /
    • pp.763-772
    • /
    • 2020
  • During X-ray examinations in the DR system, the scattered X-rays physically generated by the patient cause image blurring in poor quality. Although X-rays to increase the contrast of images, this increases the patient's exposure dose and is likely to result in grid induced artifacts. Therefore, the purpose of this study is obtain images similar to those of real-grid with non-grid level conditions using a VGR (Virtual Grid Role) algorithm that serves as a virtual grid. Comparing MTF, SNR and CNR of non-grid and VGR algorithm images obtained with 70% exposure conditions of real-grid images showed that the MTF0.5 differed from 0.265 to 0.350 and the MTF0.1 from 0.412 to 0.467 and the SNR, CNR were also different. In addition, comparing MTF, SNR and CNR of VGR algorithm and real-grid images showed that the MTF0.5 differed from 0.350 to 0.367 and the MTF0.1 from 0.467 to 0.483 and the SNR, CNR by little.

Color Transient Improvement Algorithm Based on Image Fusion Technique (영상 융합 기술을 이용한 색 번짐 개선 방법)

  • Chang, Joon-Young;Kang, Moon-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.4
    • /
    • pp.50-58
    • /
    • 2008
  • In this paper, we propose a color transient improvement (CTI) algorithm based on image fusion to improve the color transient in the television(TV) receiver or in the MPEG decoder. Video image signals are composed of one luminance and two chrominance components, and the chrominance signals have been more band-limited than the luminance signals since the human eyes usually cannot perceive changes in chrominance over small areas. However, nowadays, as the advanced media like high-definition TV(HDTV) is developed, the blurring of color is perceived visually and affects the image quality. The proposed CTI method improves the transient of chrominance signals by exploiting the high-frequency information of the luminance signal. The high-frequency component extracted from the luminance signal is modified by spatially adaptive weights and added to the input chrominance signals. The spatially adaptive weight is estimated to minimize the ${\iota}_2-norm$ of the error between the original and the estimated chrominance signals in a local window. Experimental results with various test images show that the proposed algorithm produces steep and natural color edge transition and the proposed method outperforms conventional algorithms in terms of both visual and numerical criteria.

Performance Analysis of Matching Cost Functions of Stereo Matching Algorithm for Making 3D Contents (3D 콘텐츠 생성에서의 스테레오 매칭 알고리즘에 대한 매칭 비용 함수 성능 분석)

  • Hong, Gwang-Soo;Jeong, Yeon-Kyu;Kim, Byung-Gyu
    • Convergence Security Journal
    • /
    • v.13 no.3
    • /
    • pp.9-15
    • /
    • 2013
  • Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.

A Study on the Restoration of a Low-Resoltuion Iris Image into a High-Resolution One Based on Multiple Multi-Layered Perceptrons (다중 다층 퍼셉트론을 이용한 저해상도 홍채 영상의 고해상도 복원 연구)

  • Shin, Kwang-Yong;Kang, Byung-Jun;Park, Kang-Ryoung;Shin, Jae-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.3
    • /
    • pp.438-456
    • /
    • 2010
  • Iris recognition uses a unique iris pattern of user to identify person. In order to enhance the performance of iris recognition, it is reported that the diameter of iris region should be greater than 200 pixels in the captured iris image. So, the previous iris system used zoom lens camera, which can increase the size and cost of system. To overcome these problems, we propose a new method of enhancing the accuracy of iris recognition on low-resolution iris images which are captured without a zoom lens. This research is novel in the following two ways compared to previous works. First, this research is the first one to analyze the performance degradation of iris recognition according to the decrease of the image resolution by excluding other factors such as image blurring and the occlusion of eyelid and eyelash. Second, in order to restore a high-resolution iris image from single low-resolution one, we propose a new method based on multiple multi-layered perceptrons (MLPs) which are trained according to the edge direction of iris patterns. From that, the accuracy of iris recognition with the restored images was much enhanced. Experimental results showed that when the iris images down-sampled by 6% compared to the original image were restored into the high resolution ones by using the proposed method, the EER of iris recognition was reduced as much as 0.133% (1.485% - 1.352%) in comparison with that by using bi-linear interpolation

Cortical Thickness Estimation Using DIR Imaging with GRAPPA Factor 2 (DIR 영상을 이용한 피질두께 측정: GRAPPA 인자 2를 이용한 비교)

  • Choi, Na-Rae;Nam, Yoon-Ho;Kim, Dong-Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.14 no.1
    • /
    • pp.56-63
    • /
    • 2010
  • Purpose : DIR image is relatively free from susceptibility artifacts therefore, DIR image can make it possible to reliably measure cortical thickness/volume. One drawback of the DIR acquisition is the long scan time to acquire the fully sampled 3D data set. To solve this problem, we applied a parallel imaging method (GRAPPA) and verify the reliability of using the volumetric study. Materials and methods : Six healthy volunteers (3 males and 3 females; age $25.33{\pm}2.25$ years) underwent MRI using the 3D DIR sequence at a 3.0T Siemens Tim Trio MRI scanner. GRAPPA simulation was performed from the fully sampled data set for reduction factor 2. Data reconstruction was performed using MATLAB R2009b. Freesurfer v.4.3.0 was used to evaluate the cortical thickness of the entire brain, and to extract white matter information from the DIR image, Analyze 9.0 was used. The global cortical thickness estimated from the reconstructed image was compared with reference image by using a T-test in SPSS. Results : Although reduced SNR and blurring are observed from the reconstructed image, in terms of segmentation the effect was not so significant. The volumetric result was validated that there were no significant differences in many cortical regions. Conclusion : This study was performed with DIR image for a volumetric MRI study. To solve the long scan time of 3D DIR imaging, we applied GRAPPA algorithm. According to the results, fast imaging can be done with reduction factor 2 with little loss of image quality at 3.0T.

A Method for Reconstructing Original Images for Captions Areas in Videos Using Block Matching Algorithm (블록 정합을 이용한 비디오 자막 영역의 원 영상 복원 방법)

  • 전병태;이재연;배영래
    • Journal of Broadcast Engineering
    • /
    • v.5 no.1
    • /
    • pp.113-122
    • /
    • 2000
  • It is sometimes necessary to remove the captions and recover original images from video images already broadcast, When the number of images requiring such recovery is small, manual processing is possible, but as the number grows it would be very difficult to do it manually. Therefore, a method for recovering original image for the caption areas in needed. Traditional research on image restoration has focused on restoring blurred images to sharp images using frequency filtering or video coding for transferring video images. This paper proposes a method for automatically recovering original image using BMA(Block Matching Algorithm). We extract information on caption regions and scene change that is used as a prior-knowledge for recovering original image. From the result of caption information detection, we know the start and end frames of captions in video and the character areas in the caption regions. The direction for the recovery is decided using information on the scene change and caption region(the start and end frame for captions). According to the direction, we recover the original image by performing block matching for character components in extracted caption region. Experimental results show that the case of stationary images with little camera or object motion is well recovered. We see that the case of images with motion in complex background is also recovered.

  • PDF

Sharpness Evaluation of UAV Images Using Gradient Formula (Gradient 공식을 이용한 무인항공영상의 선명도 평가)

  • Lee, Jae One;Sung, Sang Min
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.38 no.1
    • /
    • pp.49-56
    • /
    • 2020
  • In this study, we analyzed the sharpness of UAV-images using the gradient formula and produced a MATLAB GUI (Graphical User Interface)-based sharpness analysis tool for easy use. In order to verify the reliability of the proposed sharpness analysis method, sharpness values of the UAV-images measured by the proposed method were compared with those by measured the commercial software Metashape of the Agisoft. As a result of measuring the sharpness with both tools on 10 UAV-images, sharpness values themselves were different from each other for the same image. However, there was constant bias of 011 ~ 0.20 between two results, and then the same sharpness was obtained by eliminating this bias. This fact proved the reliability of the proposed sharpness analysis method in this study. In addition, in order to verify the practicality of the proposed sharpness analysis method, unsharp images were classified as low quality ones, and the quality of orthoimages was compared each other, which were generated included low quality images and excluded them. As a result, the quality of orthoimage including low quality images could not be analyzed due to blurring of the resolution target. However, the GSD (Ground Sample Distance) of orthoimage excluding low quality images was 3.2cm with a Bar target and 4.0cm with a Siemens star thanks to the clear resolution targets. It therefore demonstrates the practicality of the proposed sharpness analysis method in this study.

Adaptive Block Recovery Based on Subband Energy and DC Value in Wavelet Domain (웨이블릿 부대역의 에너지와 DC 값에 근거한 적응적 블록 복구)

  • Hyun, Seung-Hwa;Eom, Il-Kyu;Kim, Yoo-Shin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.5 s.305
    • /
    • pp.95-102
    • /
    • 2005
  • When images compressed with block-based compression techniques are transmitted over a noisy channel, unexpected block losses occur. In this paper, we present a post-processing-based block recovery scheme using Haar wavelet features. No consideration of the edge-direction, when recover the lost blocks, can cause block-blurring effects. The proposed directional recovery method in this paper is effective for the strong edge because exploit the varying neighboring blocks adaptively according to the edges and the directional information in the image. First, the adaptive selection of neighbor blocks is performed based on the energy of wavelet subbands (EWS) and difference of DC values (DDC). The lost blocks are recovered by the linear interpolation in the spatial domain using selected blocks. The method using only EWS performs well for horizontal and vertical edges, but not as well for diagonal edges. Conversely, only using DDC performs well diagonal edges with the exception of line- or roof-type edge profiles. Therefore, we combined EWS and DDC for better results. The proposed methods out performed the previous methods using fixed blocks.

Gaussian Noise Reduction Method using Adaptive Total Variation : Application to Cone-Beam Computed Tomography Dental Image (적응형 총변이 기법을 이용한 가우시안 잡음 제거 방법: CBCT 치과 영상에 적용)

  • Kim, Joong-Hyuk;Kim, Jung-Chae;Kim, Kee-Deog;Yoo, Sun-K.
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.1
    • /
    • pp.29-38
    • /
    • 2012
  • The noise generated in the process of obtaining the medical image acts as the element obstructing the image interpretation and diagnosis. To restore the true image from the image polluted from the noise, the total variation optimization algorithm was proposed by the R.O. F (L.Rudin, S Osher, E. Fatemi). This method removes the noise by fitting the balance of the regularity and fidelity. However, the blurring phenomenon of the border area generated in the process of performing the iterative operation cannot be avoided. In this paper, we propose the adaptive total variation method by mapping the control parameter to the proposed transfer function for minimizing boundary error. The proposed transfer function is determined by the noise variance and the local property of the image. The proposed method was applied to 464 tooth images. To evaluate proposed method performance, PSNR which is a indicator of signal and noise's signal power ratio was used. The experimental results show that the proposed method has better performance than other methods.

A Study on the Pixel-Paralled Image Processing System for Image Smoothing (영상 평활화를 위한 화소-병렬 영상처리 시스템에 관한 연구)

  • Kim, Hyun-Gi;Yi, Cheon-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.11
    • /
    • pp.24-32
    • /
    • 2002
  • In this paper we implemented various image processing filtering using the format converter. This design method is based on realized the large processor-per-pixel array by integrated circuit technology. These two types of integrated structure are can be classify associative parallel processor and parallel process DRAM(or SRAM) cell. Layout pitch of one-bit-wide logic is identical memory cell pitch to array high density PEs in integrate structure. This format converter design has control path implementation efficiently, and can be utilize the high technology without complicated controller hardware. Sequence of array instruction are generated by host computer before process start, and instructions are saved on unit controller. Host computer is executed the pixel-parallel operation starting at saved instructions after processing start. As a result, we obtained three result that 1)simple smoothing suppresses higher spatial frequencies, reducing noise but also blurring edges, 2) a smoothing and segmentation process reduces noise while preserving sharp edges, and 3) median filtering, like smoothing and segmentation, may be applied to reduce image noise. Median filtering eliminates spikes while maintaining sharp edges and preserving monotonic variations in pixel values.