• Title/Summary/Keyword: Noisy image

Search Result 321, Processing Time 0.022 seconds

Evaluation of Restoration Schemes for Bi-Level Digital Image Degraded by Impulse Noise (임펄스 잡음에 의해 훼손된 이진 디지탈 서류 영상의 복구 방법들의 비교 평가)

  • Shin Hyun-Kyung;Shin Joong-Sang
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.369-376
    • /
    • 2006
  • The degradation and its inverse modeling can achieve restoration of corrupted image, caused by scaled digitization and electronic transmission. De-speckle process on the noisy document(or SAR) images is one of the basic examples. Non-linearity of the speckle noise model may hinder the inverse process. In this paper, our study is focused on investigation of the restoration methods for bi-level document image degraded by the impulse noise model. Our study shows that, on bi-level document images, the weighted-median filter and the Lee filter methods are very effective among other spatial filtering methods, but wavelet filter method is ineffective in aspect of processing speed: approximately 100 times slower. Optimal values of the weight to be used in the weighted median filter are investigated and presented in this paper.

Adaptive image contrast enhancement algorithm based on block approach (블럭방법에 근거한 영상의 적응적 대비증폭 알고리즘)

  • Kim, Yeong-Hwa
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.3
    • /
    • pp.371-380
    • /
    • 2011
  • The noise caused by a variety of reasons worsens the quality of input image when we use the images reproducing device. The basic difficulty to solve this problem is that the noise and the signal are difficult to be distinguished. Contrast enhancement such as unsharp masking is one of the most important procedures to improve the quality of input images. The conventional unsharp masking enhances the images by adding their amplified high frequency components. The noise component of the input images, however, also tends to be amplified due to the nature of the unsharp masking. This paper considers the block approach for detecting niose and image feature of the input image so that the unsharp masking could be adaptively applied accordingly. Simulation results show that it is made possible to enhance contrast of the image without boosting up the noisy components by applying the proposed algorithm.

A Study on Improvement in Digital Image Restoration by a Recursive Vector Processing (순환벡터처리에 의한 디지털 영상복원에 관한 연구)

  • 이대영;이윤현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.3
    • /
    • pp.105-112
    • /
    • 1983
  • This paper discribes technique of the recursive restoration for the images degraded by linear space invariant blur and additive white Gaussian noise. The image is characterized statistically by tis mean and correlation function. An exponential autocorrelation function has been used to model neighborhood model. The vector model was used because of analytical simplicitly and capability to implement brightness correlation function. Base on the vector model, a two-dimensional discrete stochastic a 12 point neighborhood model for represeting images was developme and used the technique of moving window processing to restore blurred and noisy images without dimensionality increesing, It has been shown a 12 point neighborhood model was found to be more adequate than a 8 point pixel model to obtain optimum pixel estimated. If the image is highly correlated, it is necessary to use a large number of points in the neighborhood in order to have improvements in restoring image. It is believed that these result could be applied to a wide range of image processing problem. Because image processing thchniques normally required a 2-D linear filtering.

  • PDF

Reduction of Speckle Noise in Images Using Homomorphic Wavelet-Based MMSE Filter with Edge Detection (에지 영역을 고려한 호모모르픽 웨이브렛 기반 MMSE 필터를 이용한 영상 신호의 스펙클 잡음 제거)

  • 박원용;장익훈;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11C
    • /
    • pp.1098-1110
    • /
    • 2003
  • In this paper, we propose a homomorphic wavelet-based MMSE filter with edge detection to restore images degraded by speckle noise. In the proposed method, a noisy image is first transformed into logarithmic domain. Each pixel in the transformed image is then classified into flat and edge regions by applying DIP operator to the image restored by homomorphic directional MMSE filter. Each pixel in flat region is restored by homomorphic wavelet-based MMSE filter. Each pixel in edge region is restored by the weighted sum of the output of homomorphic wavelet-based MMSE filtering and that of homomorphic directional MMSE filtering. The restored image in spatial domain is finally obtained by applying the exponential function to the restored image in logarithmic domain. Experimental results show that the restored images by the proposed method have ISNR improvement of 3.3-4.0 ㏈ and ${\beta}$, a measurement parameter on edge preservation, improvement of 0.0103-0.0126 and superior subjective image quality over those by conventional methods.

A Study of optimal algorithm for high-speed process of image signal (영상신호의 고속처리를 위한 최적화 알고리즘에 대한 연구)

  • 권기홍
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.10
    • /
    • pp.2001-2013
    • /
    • 1994
  • In this paper, the method of processing a blurred noisy image has been researched. The conventional method of processing signal has faluts which are slow convergence speed and long time-consuming process at the singular point and or in the ill condition. There is the process, the Gauss Seidel's method to remove these faults, but it takes too much time because it processed singnal repeatedly. For overcoming the faults, this paper shows a image restoration method which takes shorter than the Gauss-Seidel's by comparing the Gauss Seidel's with proposed alogorithm and accelerating convergence speed at the singular point and/or in the ill condition. In this paper, the conventional process method(Gauss-Seidel) and proposed optimal algorithm were used to get a standard image($256{\times}56{\times}bits$). and then the results are simulated and compared each other in order to examine the variance of MSE(Mean Square Error) by the acceleration parameter in the proposed image restoration. The result of the signal process and the process time was measured at all change of acceleration parameter in order to verify the effectveness of the proposed algorithm.

  • PDF

Developing Image Processing Program for Automated Counting of Airborne Fibers (이미지 처리를 통한 공기 중 섬유의 자동계수 알고리즘 프로그램 개발)

  • Choi, Sungwon;Lee, Heekong;Lee, Jong Il;Kim, Hyunwook
    • Journal of Korean Society of Occupational and Environmental Hygiene
    • /
    • v.24 no.4
    • /
    • pp.484-491
    • /
    • 2014
  • Objectives: An image processing program for asbestos fibers analyzing the gradient components and partial linearity was developed in order to accurately segment fibers. The objectives were to increase the accuracy of counting through the formulation of the size and shape of fibers and to guarantee robust fiber detection in noisy backgrounds. Methods: We utilized samples mixed with sand and sepiolite, which has a similar structure to asbestos. Sample concentrations of 0.01%, 0.05%, 0.1%, 0.5%, 1%, 2%, and 3%(w/w) were prepared. The sand used was homogenized after being sieved to less than $180{\mu}m$. Airborne samples were collected on MCE filters by utilizing a personal pump with 2 L/min flow rate for 30 minutes. We used the NIOSH 7400 method for pre-treating and counting the fibers on the filters. The results of the NIOSH 7400 method were compared with those of the image processing program. Results: The performance of the developed algorithm, when compared with the target images acquired by PCM, showed that the detection rate was on average 88.67%. The main causes of non-detection were missing fibers with a low degree of contrast and overlapping of faint and thin fibers. Also, some duplicate countings occurred for fibers with breaks in the middle due to overlapping particles. Conclusions: An image detection algorithm that could increase the accuracy of fiber counting was developed by considering the direction of the edge to extract images of fibers. It showed comparable results to PCM analysis and could be used to count fibers through real-time tracking by modeling a branch point to graph. This algorithm can be utilized to measure the concentrations of asbestos in real-time if a suitable optical design is developed.

Depth-map Preprocessing Algorithm Using Two Step Boundary Detection for Boundary Noise Removal (경계 잡음 제거를 위한 2단계 경계 탐색 기반의 깊이지도 전처리 알고리즘)

  • Pak, Young-Gil;Kim, Jun-Ho;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.12
    • /
    • pp.555-564
    • /
    • 2014
  • The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

Real-Time Moving Object Tracking System using Advanced Block Based Image Processing (개선된 블록기반 영상처리기법에 의한 실시간 이동물체 추적시스템)

  • Kim, Dohwan;Cheoi, Kyung-Joo;Lee, Yillbyung
    • Korean Journal of Cognitive Science
    • /
    • v.16 no.4
    • /
    • pp.333-349
    • /
    • 2005
  • In this paper, we propose a real tine moving object tracking system based on block-based image processing technique and human visual processing. The system has two nun features. First, to take advantage of the merit of the biological mechanism of human retina, the system has two cameras, a CCD(Charge-Coupled Device) camera equipped with wide angle lens for more wide scope vision and a Pan-Tilt-Zoon tamers. Second, the system divides the input image into a numbers of blocks and processes coarsely to reduce the rate of tracking error and the processing time. Tn an experiment, the system showed satisfactory performances coping with almost every noisy image, detecting moving objects very int and controlling the Pan-Tilt-Zoom camera precisely.

  • PDF

Design of an Efficient VLSI Architecture and Verification using FPGA-implementation for HMM(Hidden Markov Model)-based Robust and Real-time Lip Reading (HMM(Hidden Markov Model) 기반의 견고한 실시간 립리딩을 위한 효율적인 VLSI 구조 설계 및 FPGA 구현을 이용한 검증)

  • Lee Chi-Geun;Kim Myung-Hun;Lee Sang-Seol;Jung Sung-Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.2 s.40
    • /
    • pp.159-167
    • /
    • 2006
  • Lipreading has been suggested as one of the methods to improve the performance of speech recognition in noisy environment. However, existing methods are developed and implemented only in software. This paper suggests a hardware design for real-time lipreading. For real-time processing and feasible implementation, we decompose the lipreading system into three parts; image acquisition module, feature vector extraction module, and recognition module. Image acquisition module capture input image by using CMOS image sensor. The feature vector extraction module extracts feature vector from the input image by using parallel block matching algorithm. The parallel block matching algorithm is coded and simulated for FPGA circuit. Recognition module uses HMM based recognition algorithm. The recognition algorithm is coded and simulated by using DSP chip. The simulation results show that a real-time lipreading system can be implemented in hardware.

  • PDF

Iterative Low Rank Approximation for Image Denoising (영상 잡음 제거를 위한 반복적 저 계수 근사)

  • Kim, Seehyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1317-1322
    • /
    • 2021
  • Nonlocal similarity of natural images leads to the fact that a patch matrix whose columns are similar patches of the reference patch has a low rank. Images corrupted by additive white Gaussian noises (AWGN) make their patch matrices to have a higher rank. The noise in the image can be reduced by obtaining low rank approximation of the patch matrices. In this paper, an image denoising algorithm is proposed, which first constructs the patch matrices by combining the similar patches of each reference patch, which is a part of the noisy image. For each patch matrix, the proposed algorithm calculates its low rank approximate, and then recovers the original image by aggregating the low rank estimates. The simulation results using widely accepted test images show that the proposed denoising algorithm outperforms four recent methods.