• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.695-698
• /
• 2000

Round-cornering machines are mainly used for cornering of stiffners for ship buildings. In the present time they have been operated manually by operators. so they are need to be operated automatically without regard to any shapes of stiffners. We developed the automatic round cornering system which consists of CCd Camera, PC and laser diode to detect automatically the edge of stiffners to be processed

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.3
• /
• pp.125-132
• /
• 2012

This paper proposes an automatic object segmentation and background composition method for video communication over consumer mobile phones. The object regions were extracted based on the motion and color variance of the first two frames. To combine the motion and variance information, the Euclidean distance between the motion boundary pixel and the neighboring color variance edge pixels was calculated, and the nearest edge pixel was labeled to the object boundary. The labeling results were refined using the morphology for a more accurate and natural-looking boundary. The grow-cut segmentation algorithm begins in the expanded label map, where the inner and outer boundary belongs to the foreground and background, respectively. The segmented object region and a new background image stored a priori in the mobile phone was then composed. In the background composition process, the background motion was measured using the optical-flow, and the final result was synthesized by accurately locating the object region according to the motion information. This study can be considered an extended, improved version of the existing background composition algorithm by considering motion information in a video. The proposed segmentation algorithm reduces the computational complexity significantly by choosing the minimum resolution at each segmentation step. The experimental results showed that the proposed algorithm can generate a fast, accurate and natural-looking background composition.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.170-176
• /
• 2010

Prediction is an important step in high-performance lossless data compression. In this paper, we propose a novel lossless image coding algorithm to increase prediction accuracy which can display low-resolution images quickly with a multi-resolution image technique. At each resolution, we use pixels of the previous resolution image to estimate current pixel values. For each pixel, we determine its estimated value by considering horizontal, vertical, diagonal edge information and average, weighted-average information obtained from its neighborhood pixels. In the experiment, we show that our method obtains better prediction than JPEG-LS or HINT.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.63-68
• /
• 2010

In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.178-180
• /
• 2004

In this work, we propose new method of sigma filtering for efficient filtering and preserving edge regions in DCT Domain. In block-based image compression technique, the image is first divided into non-overlapping $8{\times}8$ blocks. Then, the two-dimensional DCT is computed for each $8{\times}8$ block. Once the DCT coefficients are obtained, they are quantized using a specific quantization table. Quantization of the DCT coefficients is a lossy process, and in this step, noise is added. In this work, we combine IDCT matrix and filter matrix to a new matrix to simplify filtering process to remove noise after IDCT in spatial domain, for each $8{\times}8$ DCT coefficient block, we determine whether this block is edge or homogeneous region. If this block is edge region, we divide this $8{\times}8$ block into four $4{\times}4$ sub-blocks, and do filtering process for sub-blocks which is homogeneous region. By this process, we can remove blocking artifacts efficiently preserving edge regions at the same time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.556-566
• /
• 2001

This paper proposes a motion-adaptive de-interlacing algorithm based on EBMF(Edge Based Median Filter) and AMPDF(Adaptive Minimum Pixel Difference Fillet). To compensate 'motion missing'error, which is an important factor in motion-adaptive methods, we used AMPDF which estimates an accurate value using different thresholds after classifying the input image to 4 classes. To efficiently interpolate the moving diagonal edge, we also used EBMF which selects a candidate pixel according to the edge information. Finally, we, to increase the performance, adopted an adaptive interpolation after classifying the input image to moving region, stationary region, and boundary region. Simulation results showed that the proposed method provides better performance than the existing methods.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.51-58
• /
• 2010

This paper proposes an edge adaptive color interpolation for an ultra-small HD-grade complementary metal-oxide semiconductor (CMOS) video sensor in camera phones that can process 720-p/30-fps videos. Recently, proposed methods with great image quality perceptually reconstruct the green component and then estimate the red/blue component using the reconstructed green and neighbor red and blue pixels. However, these methods require the bulky memory line buffers in order to temporally store the reconstructed green components. The edge adaptive color interpolation method uses seven or nine patterns to calculate the six edge directions. At the same time, the threshold values are adaptively adjusted by the sum of the color values of the selected pixels. This method selects the suitable one among the patterns using two flowcharts proposed in this paper, and then interpolates the missing color values. For verification, we calculated the peak-signal-to-noise-ratio (PSNR) in the test images, which were processed by the proposed algorithm, and compared the calculated PSNR of the existing methods. The proposed color interpolation is also fabricated with the 0.18-${\mu}m$ CMOS flash memory process.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1244-1251
• /
• 1988

Edge is one of the primitive features of an image and is widely used in image classification and analysis. New edge extration methods using central moments are presented and show various characteristics according to the order of moment, definition of both random variables and probability density functions. The proposed methods use the integral of differences between local mean and pixels in the window whereas most of conventional edge operators use only differential concepts. This gives good noise immunity and extracts fine edges.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1693-1702
• /
• 1999

This paper proposes the use of an adaptive Wiener filter for edge-preserving image filtering. Images are partitioned into a set of blocks of pixels which is divided into five subsets of blocks according to their edge contents and orientations. Each subset of blocks is used to define a covariance matrix, from which a Wiener filter is derived. Five covariance matrices and Wiener filters are thus obtained. An image-block classifier using the five sets of covariance matrices of the class is designed to classify each incoming block of pixels according to its edge content in the presence of noise. Experimental results are included to verify the usefulness of the proposed method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.2
• /
• pp.41-47
• /
• 2007

A fine segmentation algorithm is proposed for extracting objects in an image, which have both weak boundaries and highly non-convex shapes. The image has simple background colors or simple object colors. Two concepts, geometric attraction-driven flow (GADF) and edge-regions are combined to detect boundaries of objects in a sub-pixel resolution. The main strategy to segment the boundaries is to construct initial curves close to objects by using edge-regions and then to make a curve evolution in GADF. Since the initial curves are close to objects regardless of shapes, highly non-convex shapes are easily detected and dependence on initial curves in boundary-based segmentation algorithms is naturally removed. Weak boundaries are also detected because the orientation of GADF is obtained regardless of the strength of boundaries. For a fine segmentation, we additionally propose a local region competition algorithm to detect perceptible boundaries which are used for the extraction of objects without visual loss of detailed shapes. We have successfully accomplished the fine segmentation of objects from images taken in the studio and aphids from images of soybean leaves.