• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.433-434
• /
• 2010

본 논문에서는 영상처리에서 많이 사용하는 bilateral filtering과 mean shift segmentation을 이용하여 일반적인 사진을 수채화 스타일로 변환하는 기법에 대하여 제안한다. 먼저 bilateral filtering을 이용하여 사진의 외곽선 부분은 보존하면서 고주파 성분을 약화시키도록 한다. 그리고 bilateral filtering된 영상에서 mean shift segmentation을 수행하여 수채화 스타일의 영상을 생성한다. 본 논문에서 제안하는 기법으로 다양한 사진에 대하여 실험한 결과 수채화 스타일로 잘 변화되는 것을 확인하였으며 특히 주광에서 촬영한 풍경 사진들에 대하여 보다 우수한 성능을 보임을 확인하였다.

• Journal of Korea Multimedia Society
• /
• v.15 no.12
• /
• pp.1417-1429
• /
• 2012

In neuroscientific research, image segmentation is one of the most important processes. The morphology of axons plays an important role for researchers seeking to understand axonal functions and connectivity. In this study, we evaluated the level set segmentation method for neuronal axons in a Brainbow confocal microscopy image. We first obtained a reconstructed image on an x-z plane. Then, for preprocessing, we also applied two methods: anisotropic diffusion filtering and bilateral filtering. Finally, we performed image segmentation using the level set method with three different approaches. The accuracy of segmentation for each case was evaluated in diverse ways. In our experiment, the combination of bilateral filtering with the level set method provided the best result. Consequently, we confirmed reasonable results with our approach; we believe that our method has great potential if successfully combined with other research findings.

• Journal of Korea Game Society
• /
• v.9 no.2
• /
• pp.135-142
• /
• 2009

Mesh denoising is a method to remove noise applying various filters. However, those methods usually spend much time since filtering is performed on CPU. Because GPU is specialized for floating point operations and faster than CPU, real-time processing for complex operations is possible. Especially mesh denoising is adequate for GPU parallel processing since it repeats the same operations for vertices or triangles. In this paper, we propose mesh denoising algorithm based on bilateral filtering using GPU parallel processing to reduce processing time. It finds neighbor triangles of each vertex for applying bilateral filter, and computes its normal vector. Then it performs bilateral filtering to estimate new vertex position and to update its normal vector.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.176-179
• /
• 2010

In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.11
• /
• pp.2413-2418
• /
• 2010

We propose a retouching method that converts a photography taken by smartphone to a watercolor painting image using bilateral filtering and mean shift segmentation which are mostly used in image processing. The first step is to convert an input image to fit the screen resolution of smartphone. And next step is to weaken high frequency components of the image, while preserving the edge of image using the bilateral filtering. And after that we perform mean shift segmentation from the bilateral filtered image. We apply parameters of mean shift segmentation considering the processing speed of smartphone. Experimental result shows that our method can be applied to various types of image and bring better result.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.25-33
• /
• 2010

We propose a retouching method that converts a general photography to a watercolor painting image using bilateral filtering and mean shift segmentation which are mostly used in image processing. The first step is to weaken high frequency components of the image, while preserving the edge of image using the bilateral filtering. And after that we perform DoG(Difference of Gradient) edge extraction and mean shift segmentation respectively from the bilateral filtered image. The DoG edge extraction is performed using luminance component of the image whose RGB color space is transformed into CIELAB space. Experimental result shows that our method can be applied to various types of image and bring better result, especially against the photo taken in daylight.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3217-3238
• /
• 2018

In this paper, a depth image up-sampling method is put forward by using pixel classifying and jointed bilateral filtering. By analyzing the edge maps originated from the high-resolution color image and low-resolution depth map respectively, pixels in up-sampled depth maps can be classified into four categories: edge points, edge-neighbor points, texture points and smooth points. First, joint bilateral up-sampling (JBU) method is used to generate an initial up-sampling depth image. Then, for each pixel category, different refinement methods are employed to modify the initial up-sampling depth image. Experimental results show that the proposed algorithm can reduce the blurring artifact with lower bad pixel rate (BPR).

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.631-643
• /
• 2016

Due to the block-based discrete cosine transform (BDCT), JPEG compressed images usually exhibit blocking artifacts. When the bit rates are very low, blocking artifacts will seriously affect the image's visual quality. A bilateral filter has the features for edge-preserving when it smooths images, so we propose an adaptive-weighted bilateral filter based on the features. In this paper, an image-deblocking scheme using this kind of adaptive-weighted bilateral filter is proposed to remove and reduce blocking artifacts. Two parameters of the proposed adaptive-weighted bilateral filter are adaptive-weighted so that it can avoid over-blurring unsmooth regions while eliminating blocking artifacts in smooth regions. This is achieved in two aspects: by using local entropy to control the level of filtering of each single pixel point within the image, and by using an improved blind image quality assessment (BIQA) to control the strength of filtering different images whose blocking artifacts are different. It is proved by our experimental results that our proposed image-deblocking scheme provides good performance on eliminating blocking artifacts and can avoid the over-blurring of unsmooth regions.

• Journal of Korea Game Society
• /
• v.15 no.2
• /
• pp.159-168
• /
• 2015

This paper introduces effective noise removal method for medical ultrasound volume data. Ultrasound volume data need to be filtered because it has a lot of noise. Conventional 2d filtering methods ignore information of adjacent layers and conventional 3d filtering methods are slow or have simple filter that are not efficient for removing noise and also don't equally operate filtering because that don't take into account ultrasound' sampling character. To solve this problem, we introduce method that fast perform in parallel bilateral filtering that is known as good for noise removal and adjust proportionally window size depending on that's position. Experiments compare noise removal and loss of original data among average filtered or biliteral filtered or adaptive biliteral filtered ultrasound volume rendering images. In this way, we can more efficiently and correctly remove noise of ultrasound volume data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3166-3179
• /
• 2013

A pre-processing system for adaptive noise removal is proposed based on the principle of identifying and filtering object regions and background regions. Human perception of images depends on bright, well-focused object regions; these regions can be treated with the best filters, while simpler filters can be applied to other regions to reduce overall computational complexity. In the proposed method, bright region segmentation is performed, followed by segmentation of object and background regions. Noise in dark, background, and object regions is then removed by the median, fast bilateral, and bilateral filters, respectively. Simulations show that the proposed algorithm is much faster than and performs nearly as well as the bilateral filter (which is considered a powerful noise removal algorithm); it reduces computation time by 19.4 % while reducing PSNR by only 1.57 % relative to bilateral filtering. Thus, the proposed algorithm remarkably reduces computation while maintaining accuracy.