• Title/Summary/Keyword: Image algorithm

Search Result 8,966, Processing Time 0.036 seconds

Implementation of Image Enhancement Algorithm for Embedded System (임베디드 시스템을 위한 영상 개선 알고리즘 구현)

  • An, Jeong-yeon;Rhee, Sang-Burm
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.473-480
    • /
    • 2009
  • This paper is to enhance a color image running in the PXA255 ARM processor based on embedded linux environments. Retinex is one of the representative algorithm for image enhancement in the previous research. However, retinex is not suitable the run on the embedded system because of its long processing time. So, we proposed the image enhancement algorithm for embedded system, with less quantity of operation and the effect equivalent to retinex. To achieve this goal, we propose and implement the image enhancement algorithm, which utilizes the image formation model and gamma correction to be effective in a back-light and dark image. The proposed algorithm converts the color space from RGB to HSV, and then V and S channels are processed. In order to optimize the proposed method in the PXA255 ARM processor, quantity of calculation is reduced. The performance of the proposed algorithm was evaluated through qualitative method and quantitative method. The results show that brightness and contrast are improved with less quantity of operation.

Region Segmentation from MR Brain Image Using an Ant Colony Optimization Algorithm (개미 군집 최적화 알고리즘을 이용한 뇌 자기공명 영상의 영역분할)

  • Lee, Myung-Eun;Kim, Soo-Hyung;Lim, Jun-Sik
    • The KIPS Transactions:PartB
    • /
    • v.16B no.3
    • /
    • pp.195-202
    • /
    • 2009
  • In this paper, we propose the regions segmentation method of the white matter and the gray matter for brain MR image by using the ant colony optimization algorithm. Ant Colony Optimization (ACO) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. This algorithm finds the expected pixel for image as the real ant finds the food from nest to food source. Then ants deposit pheromone on the pixels, and the pheromone will affect the motion of next ants. At each iteration step, ants will change their positions in the image according to the transition rule. Finally, we can obtain the segmentation results through analyzing the pheromone distribution in the image. We compared the proposed method with other threshold methods, viz. the Otsu' method, the genetic algorithm, the fuzzy method, and the original ant colony optimization algorithm. From comparison results, the proposed method is more exact than other threshold methods for the segmentation of specific region structures in MR brain image.

The Moving Object Detection Of Dynamic Targets On The Image Sequence (영상열에서의 유동적 형태의 이동물체 판별에 관한 연구)

  • 이호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.2
    • /
    • pp.41-47
    • /
    • 2001
  • In this paper, I propose a detection algorithm that can reliably separate moving objects from noisy background in the image sequence received from a camera at the fixed position. The proposed algorithm consists of four processes: generation of the difference image between the input image and the reference image. multilevel quantization of the difference image, and multistage merging in the quantized image, detection of the moving object using a back propagation in a neural network. The test results show that the proposed algorithm can detect moving objects very effectively in noisy environment.

Image Quality Enhancement Method using Retinex in HSV Color Space and Saturation Correction (HSV 컬러 공간에서의 레티넥스와 채도 보정을 이용한 화질 개선 기법)

  • Kang, Han-Sol;Ko, Yun-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.9
    • /
    • pp.1481-1490
    • /
    • 2017
  • This paper presents an image quality enhancement algorithm for dark image acquired under poor lighting condition. Various retinex algorithms which are human perception-based image processing methods were proposed to solve this problem. Although MSR(Multi-Scale Retinex) among these algorithm works well under most lighting condition, it shows color degradation because their separate nonlinear processing of RGB color channels. To compensate for the loss of the color, MSRCR(Multi-Scale Retinex with Color Restoration) was proposed. However, it requires high computational load and has additional parameters that need to be adjusted according to input image. In order to overcome this problem, a new retinex algorithm based on MSR is proposed in this paper. The proposed method consists of V channel MSR, saturation correction, and separate contrast enhancement process. Experimental results show that the subjective and objective image quality of the proposed method better than those of the conventional methods.

Shading Correction Algorithm and CMOS Image Sensing System Design (쉐이딩 보정 알고리즘과 CMOS 이미지 센싱 시스템 설계)

  • Kim, Young Bin;Ryu, Conan K.R.
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.1003-1006
    • /
    • 2012
  • The image correction algorithm and system design for CMOS sensor to enhance the image resolution is presented in this paper. The proposed algorithm finds out the image cell from the sensor and process them by the limited memory configuration. The evaluation of the method is done by the designed hardware system. The experimental results are capable of improving contrast per channel and of sensing equalized image quality on an edge of image.

  • PDF

Thangka Image Inpainting Algorithm Based on Wavelet Transform and Structural Constraints

  • Yao, Fan
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1129-1144
    • /
    • 2020
  • The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

The Moving Object Segmentation By Using Multistage Merging (다단계 결합을 이용한 이동 물체 분리 알고리즘에 관한 연구)

  • 안용학;이정헌;채옥삼
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.10
    • /
    • pp.2552-2562
    • /
    • 1996
  • In this paper, we propose a segmentation algorithm that can reliably separate moving objects from noisy background in the image sequance received from a camera at the fixed position. The proposed algorithm consists of three processes:generation of the difference image between the input image and the reference image, multilevel quantization of the difference image, and multistagemerging in the quantized image. The quantization process requantizes the difference image based on the multiple threshold values determined bythe histogram analysis. The merging starts from the seed region which created by using the highest threshold value and ends when termination conditions are met. the proposed method has been tested with various real imge sequances containing intruders. The test results show that the proposed algorithm can detect moving objects like intruders very effectively in the noisy environment.

  • PDF

Improved image alignment algorithm based on projective invariant for aerial video stabilization

  • Yi, Meng;Guo, Bao-Long;Yan, Chun-Man
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3177-3195
    • /
    • 2014
  • In many moving object detection problems of an aerial video, accurate and robust stabilization is of critical importance. In this paper, a novel accurate image alignment algorithm for aerial electronic image stabilization (EIS) is described. The feature points are first selected using optimal derivative filters based Harris detector, which can improve differentiation accuracy and obtain the precise coordinates of feature points. Then we choose the Delaunay Triangulation edges to find the matching pairs between feature points in overlapping images. The most "useful" matching points that belong to the background are used to find the global transformation parameters using the projective invariant. Finally, intentional motion of the camera is accumulated for correction by Sage-Husa adaptive filtering. Experiment results illustrate that the proposed algorithm is applied to the aerial captured video sequences with various dynamic scenes for performance demonstrations.

Infrared and Visible Image Fusion Based on NSCT and Deep Learning

  • Feng, Xin
    • Journal of Information Processing Systems
    • /
    • v.14 no.6
    • /
    • pp.1405-1419
    • /
    • 2018
  • An image fusion method is proposed on the basis of depth model segmentation to overcome the shortcomings of noise interference and artifacts caused by infrared and visible image fusion. Firstly, the deep Boltzmann machine is used to perform the priori learning of infrared and visible target and background contour, and the depth segmentation model of the contour is constructed. The Split Bregman iterative algorithm is employed to gain the optimal energy segmentation of infrared and visible image contours. Then, the nonsubsampled contourlet transform (NSCT) transform is taken to decompose the source image, and the corresponding rules are used to integrate the coefficients in the light of the segmented background contour. Finally, the NSCT inverse transform is used to reconstruct the fused image. The simulation results of MATLAB indicates that the proposed algorithm can obtain the fusion result of both target and background contours effectively, with a high contrast and noise suppression in subjective evaluation as well as great merits in objective quantitative indicators.

A Modified Steering Kernel Filter for AWGN Removal based on Kernel Similarity

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.3
    • /
    • pp.195-203
    • /
    • 2022
  • Noise generated during image acquisition and transmission can negatively impact the results of image processing applications, and noise removal is typically a part of image preprocessing. Denoising techniques combined with nonlocal techniques have received significant attention in recent years, owing to the development of sophisticated hardware and image processing algorithms, much attention has been paid to; however, this approach is relatively poor for edge preservation of fine image details. To address this limitation, the current study combined a steering kernel technique with adaptive masks that can adjust the size according to the noise intensity of an image. The algorithm sets the steering weight based on a similarity comparison, allowing it to respond to edge components more effectively. The proposed algorithm was compared with existing denoising algorithms using quantitative evaluation and enlarged images. The proposed algorithm exhibited good general denoising performance and better performance in edge area processing than existing non-local techniques.