• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.7
• /
• pp.498-506
• /
• 2003

A computer vision system applied to an intelligent safety vehicle has been required to be worked on a small sized real time special purposed hardware not on a general purposed computer. In addition, the system should have a high reliability even under the adverse road traffic environment. This paper presents a design and an implementation of an onboard hardware system taking into account for high speed image processing to analyze a road traffic scene. The system is mainly composed of two parts: an early processing module of FPGA and a postprocessing module of DSP. The early processing module is designed to extract several image primitives such as the intensity of a gray level image and edge attributes in a real-time Especially, the module is optimized for the Sobel edge operation. The postprocessing module of DSP utilizes the image features from the early processing module for making image understanding or image analysis of a road traffic scene. The performance of the proposed system is evaluated by an experiment of a lane-related information extraction. The experiment shows the successful results of image processing speed of twenty-five frames of 320$\times$240 pixels per second.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.355-362
• /
• 2009

A new intra field deinterlacing algorithm with edge map in the image block is introduced. Conventional deinterlacing methods usually employ edge-based line average algorithm within pixel-by-pixel approach. However, it is sensitive to variation of intensity. To reduce this shortcoming, we proposed edge direction vector computed by edge map, and also its interpolation technique. We first introduce an edge direction vector, which is computed by Sobel mask, so that finer resolution of the edge direction can be acquired. The proposed edge direction vector oriented deinterlacer operates by identifying small pixel variations in five orientations, while weighted averaging to estimate missing pixel. According to the edge direction of the direction vector, we calculate weights on each edge direction. These weight values multiplied by the candidate deinterlaced pixels in order to successively build approximations of the deinterlaced sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2345-2354
• /
• 1998

There have been many researches to yield higher resolution image quality from the low resolution CCD device. The resolution of it is primary factor for the image quality of digital still camera and in manufacturing price. IN this paper, image enlargement algorithm, which reduces blocking effect of enlarged low resolution image and minimizes ringing and blur effect occurring around edge in linear interpolation, is proposed. This algorithm is composed of gaussian low pass filter which eliminates aliasing, least square spline interpolation and non-linear interpolation based on step edge model.

• Journal of IKEEE
• /
• v.21 no.1
• /
• pp.46-65
• /
• 2017

This paper proposes a fast patch-based de-blurring algorithm including kernel estimation based on the angle between the edge and the blur direction. For de-blurring, image patches from the most informative edges in the blurry image are used to estimate a kernel with low computational cost. Moreover, the kernels of each patch are estimated based on the correlation between the edge direction and the blur direction. This makes the final kernel more reliable and creates an accurate latent image from the blurry image. The combination of directionally oriented kernel estimation and patch-based de-blurring is faster and more accurate than existing state-of-the art methods. Experimental results using various test images show that the proposed method achieves its objectives: speed and accuracy.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.11a
• /
• pp.145-156
• /
• 2003

This paper for real time object tracking in this treatise detect histogram analysis that is accumulation value of binary conversion density and edge information and body that move by real time use of difference Image techniques and proposed method to object tracking. Firstly, we extract edge that can reduce quantity of data keeping information about form of input image in object detection. Object is extracted by performing difference image and binarization in edge image. Area of detected object is determined by threshold value that divide sum of horizontal accumulation value about binary conversion density by value that add horizontalityㆍverticality maximum accumulation value. Object is tracked by comparing similarity with object that is detected in previous frame and present frame. As experiment result, proposed algorithm could improve the object detection speed, and could track object by real time and could track local movement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1700-1721
• /
• 2017

The problem of blocking artifacts is very common in block-based image and video compression, especially at very low bit rates. In this paper, we propose a post-processing method for JPEG-coded image deblocking via sparse representation and adaptive residual threshold. This method includes three steps. First, we obtain the dictionary by online dictionary learning and the compressed images. The dictionary is then modified by the histogram of oriented gradient (HOG) feature descriptor and K-means cluster. Second, an adaptive residual threshold for orthogonal matching pursuit (OMP) is proposed and used for sparse coding by combining blind image blocking assessment. At last, to take advantage of human visual system (HVS), the edge regions of the obtained deblocked image can be further modified by the edge regions of the compressed image. The experimental results show that our proposed method can keep the image more texture and edge information while reducing the image blocking artifacts.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2464-2478
• /
• 2013

Image stitching techniques produce an image with a wide field-of-view by aligning multiple images with a narrow field-of-view. While conventional algorithms successfully stitch images with a small parallax, structure misalignment may occur when input images contain a large parallax. This paper presents an image stitching algorithm that aligns images with a large parallax by regional linear warping. To this end, input images are first approximated as multiple planar surfaces, and different linear warping is applied to each planar surface. For approximating input images as multiple planar surfaces, the concept of dominant edges is introduced. Dominant edges are defined as conspicuous edges of lines in input images, and extracted dominant edges identify the boundaries of each planar surface. Dominant edge extraction is conducted by detecting distinct changes of local characteristics around strong edge pixels. Experimental results show that the proposed algorithm successfully stitches images with a large parallax without structure misalignment.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.411-420
• /
• 1999

In geology, lineament features have been used to identify geological events, and many of scientists have been developed the algorithm that can be applied with the computer to recognize the lineaments. We choose several edge detection filter, line detection filters and Hough transform to detect an edge, line, and to vectorize the extracted lineament features, respectively. firstly the edge detection filter using a first-order derivative is applied to the original image In this step, rough lineament image is created Secondly, line detection filter is used to refine the previous image for further processing, where the wrong detected lines are, to some extents, excluded by using the variance of the pixel values that is composed of each line Thirdly, the thinning process is carried out to control the thickness of the line. At last, we use the Hough transform to convert the raster image to the vector one. A Landsat image is selected to extract lineament features. The result shows the lineament well regardless of directions. However, the degree of extraction of linear feature depends on the values of parameters and patterns of filters, therefore the development of new filter and the reduction of the number of parameter are required for the further study.

• Journal of KIISE:Software and Applications
• /
• v.33 no.10
• /
• pp.862-867
• /
• 2006

To restore image degraded by blur and additive noise in the optical and electrical system, a regularized iterative restoration is used. A regularization operator is usually applied to all over the image without considering the local characteristics of image in conventional method. As a result, ringing artifacts appear in edge regions and the noise is amplified in flat regions. To solve these problems we propose an adaptive regularization iterative restoration considering the characteristic of edge and flat regions using directional regularization operator. Experimental results show that the proposed method suppresses the noise amplification in flat regions, and restores the edge more sharply in edge regions.