• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.797-799
• /
• 1999

In this paper, the edge intensification and detection algorithm which is one of image processing operations is considered. Edge detection algorithm is the most useful and important method for image processing or image analysis. The vision system based on these processing and concerned in specific project is proposed and is applied to the inverted pendulum in order to automatically acquire the angles between the bar and the perpendicular reference line. In this paper, the angles that are obtained from some images of computer vision system can offer useful informations for control of real inverted pendulum system. Next, the inverted pendulum will be controlled by the proposed method.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.52-58
• /
• 2014

Exact histogram specification (EHS) transforms the histogram of an input image into the specified histogram. In the conventional EHS techniques, the pixels are first sorted according to their graylevels, and the pixels that have the same graylevel are further differentiated according to the local average of the pixel values and the edge strength. The strictly ordered pixels are then mapped to the desired histogram. However, since the conventional sorting method is inherently dependent on the initial graylevel-based sorting, the contrast enhancement capability of the conventional EHS algorithms is restricted. We propose a modified EHS algorithm considering the just noticeable difference. In the proposed algorithm, the edge pixels are pre-processed such that the output edge pixels obtained by the modified EHS can result in the local contrast enhancement. Moreover, we introduce a new sorting method for the pixels that have the same graylevel. Experimental results show that the proposed algorithm provides better image enhancement performance compared to the conventional EHS algorithms.

• Journal of Industrial Technology
• /
• v.15
• /
• pp.93-101
• /
• 1995

Fractal coding is a promising method for image compression, but it has not lived up to its promise as low bit-rate image compression scheme. The existing algorithms for finding self-mapping contractive transforms are computationally expensive and offer a poor rate-quality tradeoff. In this paper, we propose a segment based fractal coding. We classify the range blocks into shade, midrange or edge blocks, and segment edge block along the edge. And we apply midrange coding scheme for each segment. Our experiments show that our method gives better rate-qualty trade of than current fractal block coding methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4108-4125
• /
• 2015

This paper presents a scalable coding method for depth images by considering the quality of synthesized images in virtual views. First, we design a new edge detection algorithm that is based on calculating the depth difference between two neighboring pixels within the depth map. By choosing different thresholds, this algorithm generates a scalable bit stream that puts larger depth differences in front, followed by smaller depth differences. A scalable scheme is also designed for coding depth pixels through a layered sampling structure. At the receiver side, the full-resolution depth image is reconstructed from the received bits by solving a partial-differential-equation (PDE). Experimental results show that the proposed method improves the rate-distortion performance of synthesized images at virtual views and achieves better visual quality.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.223-239
• /
• 2014

New IIR digital differintegrators (differentiator and integrator) with very minor absolute relative errors are presented in this paper. The digital integrator is designed by interpolating some of the existing integrators. The optimum value of the interpolation ratio is obtained through linear programming optimization. Subsequently, by modifying the transfer function of the proposed integrator appropriately, new digital differentiator is obtained. Simulation results demonstrate that the proposed differintegrator are a more accurate approximation of ideal ones, than the existing differintegrators. Furthermore, the proposed differentiator has been tested in an image processing application. Edges characterize boundaries and are, therefore, a problem of fundamental importance in image processing. For comparison purpose Prewitt, Sobel, Roberts, Canny, Laplacian of Gaussian (LOG), Zerocross operators were used and their results are displayed. The results of edge detection by some of the existing differentiators are also provided. The simulation results have shown the superiority of the proposed approach over existing ones.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.65-69
• /
• 2001

Edge detection is the most important process that belongs to the first step in image recognition or vision system and can determine the efficiency valuation. The edge detection with color images is very difficult. because color images have lots of information that contain not only general information representing shape, brightness and so on but also that representing colors. In this paper, we propose architecture of universalized Color Morphological Pyramids(CMP) which is able to give effective edge detection. Image pyramid architecture is a successive image sequence whose area ratio 2$\^$-1/(ι= 1, 2, . . . ,N) after filtering and subsampling of input image. In this technique, noise removed by sequential filtering and resolution is degraded by downsampling using CMP in various color spaces. After that, new level images are constructed that apply formula using distance of neighbor vectors in close level images and detection its image.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.6
• /
• pp.800-807
• /
• 2016

We propose a fast algorithm using Extreme Contour Point (ECP) to detect the angle of rotated images, is implemented by rotation feature of one covered frame image that can be applied to correct the rotated images like in image processing for real time applications, while CORDIC is inefficient to calculate various points like high definition image since it is only possible to detect rotated angle between one point and the other point. The two advantages of this algorithm, namely compatibility to images in preprocessing by using Sobel edge process for pattern recognition. While the other one is its simplicity for rotated angle detection with cyclic shift of two $1{\times}n$ matrix set without complexity in calculation compared with CORDIC algorithm. In ECP, the edge features of the sample image of gray scale were determined using the Sobel Edge Process. Then, it was subjected to binary code conversion of 0 or 1 with circular boundary to constitute the rotation in invariant conditions. The results were extracted to extreme points of the binary image. Its components expressed not just only the features of angle ${\theta}$ but also the square of radius $r^2$ from the origin of the image. The detected angle of this algorithm is limited only to an angle below 10 degrees but it is appropriate for real time application because it can process a 200 degree with an assumption 20 frames per second. ECP algorithm has an O ($n^2$) in Big O notation that improves the execution time about 7 times the performance if CORDIC algorithm is used.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2005

The basis function of wavelet transform used in this paper is constructed by using lifting scheme, which is different from general wavelet transform. Lifting scheme is a new biorthogonal wavelet con-structing method, that does not use Fourier transform for constructing its basis function. In this paper, an image compression and reconstruction method using the lifting scheme was proposed. And this method improves data visualization by supporting a partial reconstruction and a local reconstruction. Approx- imations at various resolutions allow extracting various sizes of feature from an image or signal with a small amount of original information. An approximation with small size of scaling coefficients gives a brief outline of features at fast. Image compression and edge detection techniques provide good frame- works for data management and visualization in multimedia database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1773-1778
• /
• 2012

Nowadays, the high quality of image is required with the demand for digital image processing devices is rapidly increasing. But image always damaged by many kinds of noises and it is necessary to remove noise and the denoising becomes one of the most important fields. In many cases image is corrupted by AWGN(additive white Gaussian noise). In this paper, we proposed an improved denoising algorithm with edge preservation. The proposed algorithm averages values processed by spatial weighted filter and self adaptive weighted filter. Then we add the value which is computed by the equation considering variance of mask and the estimated noise variance. Through the experience, the proposed filter performs well on noise suppression and edge preservation properties and improves the image visual quality.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.585-589
• /
• 2002

In this paper, hierarchical retrieval system based on efficient feature extraction is proposed. In order to retrieval the image with robustness for geometrical transformation such as translation, scaling, and rotation. After performing the 2-level wavelet transform on image, We extract moment in low-level subband which was subdivided into subimages and texture feature, contrast of GLCM(Gray Level Co-occurrence Matrix). At first we retrieve the candidate images in database by the ones of image. To perform a more accurate image retrieval, the edge information on the high-level subband was subdivided horizontally, vertically and diagonally. And then, the energy rate of edge per direction was determined and used to compare the energy rate of edge between images for higher accuracy.