• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1313-1316
• /
• 1993

This paper presents a fuzzy system that estimates the optimal bit allocation matrices for the spatially active subimage classes of adaptive transform image coding in noisy channels. Transform image coding is good for image data compression but it requires a transmission error protection scheme to maintain the performance since the channel noise degrades its performance. The fuzzy system provides a simple way of estimating the bit allocation matrices from the optimal bit map computed by the method of minimizing the mean square error between the transform coefficients of the original and the reconstructed images.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.43-46
• /
• 2000

In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.303-307
• /
• 2002

Although Synthetic Aperture Radar(SAR) is a very powerful and attractive tool, automatic interpretation of SAR images is extremely difficult because of several reason. Spatially, speckle noise reduction in SAR images is important step to interpret the SAR image at the preprocessing step. The speckle noise in SAR images is modeled to be multiplicative, and therefore, a signal-dependent noise. So, it has deflated many image-denoising algorithms that are based on additive noise model. In this paper, we propose an adaptive wavelet shrinkage method for speckle noise reduction in SAR images by analyzing the high frequency level in detail. We first decompose minutely the high frequency level to analyze the noise level. And then, we determine the weighting threshold value per the level, and layer. Finally, using those weighting threshold, we produce the efficient wavelet shrinkage method. So, this method not only reduces the speckle noise, but also preserves image detail and sharpness.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.222-229
• /
• 2001

Many techniques have been proposed for digital image enlargement, which use spatially neighbored pixels information in a still image. In this paper, we propose the digital image interpolation method that improves edge characteristics by selectively transposing the sub-windows of pseudomedian filter, which results in relatively better performance than others. We have simulated the proposed algorithm using Visual C++ and verified performance of the algorithm by PSNR(Peak signal Noise Ratio) and edge characteristics. Finally, we have designed the adaptive pseudomedian by using synopsys VHDL(Very high speed integrated circuit Hardware Description Language).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.1
• /
• pp.38-43
• /
• 2004

We designed and implemented a medical image query system, including a relational database and DBMS (database management system), which can visualize image data and can achieve spatial, attribute, and mixed queries. Image data used in querying can be visualized in slice, MPR(multi-planner reformat), volume rendering, and overlapping on the query system. To reduce spatial cost and processing time in the system. brain images are spatially clustered, by an adaptive Hilbert curve filling, encoded, and stored to its database without loss for spatial query. Because the query is often applied to small image regions of interest(ROI's), the technique provides higher compression rate and less processing time in the cases.

• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.1
• /
• pp.50.1-50.1
• /
• 2016

The incorporation of radiation from massive stars is essential for modeling the dynamics and chemistry of star-forming clouds, yet it is a computationally demanding task for three-dimensional problems. We describe the implementation and tests of radiative transfer module due to point sources on a three-dimensional Cartesian grid in the Eulerian MHD code Athena. To solve the integral form of the radiation transfer equation, we adopt a widely-used long characteristics method with spatially adaptive ray tracing in which rays are split when sampling of cells becomes coarse. We use a completely asynchronous communication pattern between processors to accelerate transport of rays through a computational domain, a major source of performance bottleneck. The results of strong and weak scaling tests show that our code performs well with a large number of processors. We apply our radiation hydrodynamics code to some test problems involving dynamical expansion of HII regions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.583-590
• /
• 2008

In this paper, we present a spatially adaptive post-processing algorithm for H.264 video coding standard to remove blocking artifacts. The loop filter of H.264 increases computational complexity of the encoder. Furthermore it doesn't clearly remove the blocking artifacts, resulting in over-blurring. For overcoming them, we combine the projection method with the Constraint Least Squares(CLS) method to restore the high quality image. To reflect the Human Visual System, we adopt the weight norm CLS method. Particularly pixel location-based local variance and laplacian operator are newly defined for the CLS method. In addition, the fact that correlation among adjoining pixels is high is utilized to constrain the solution space when the projection method is applied. Quantization Index(QP) of H.264 is also used to control the degree of smoothness. The simulation results show that the proposed post-processing filter works better than the loop filter of H.264 and converges more quickly than the CLS method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.86-94
• /
• 2010

In this paper, we propose spatially adaptive color demosaicing of noisy Bayer data. When sensor noises are not considered in demosaicing, they may degrade result image. In order to obtain high resolution image, sensor noises are considered in the color demosaicing step. We identify flat, edge and pattern regions at each pixel location to improve the performance of the algorithm and to reduce complexity. Based on the pre-classified regions, the demosaicing of the G channel is performed using the local statistics to reduce the interpolation error. The sensor noise is simultaneously removed by a modified version of non-local mean filter in the green and in the color difference domain. The R and B channels are interpolated easily using fully interpolated and denoised G and color difference values. Experimental results show that the proposed method achieves a significant improvement in terms of visual and numerical criteria, when compared to conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8C
• /
• pp.795-802
• /
• 2003

It is very important to construct statistical model in order to exactly estimate the signal variance from a noisy image. In order to estimate variance, information of neighboring region is used generally. The size of neighbor region is varied according to the regional characteristics of image. More accurate estimation of edge variance is due to smaller region of neighbor, on the other hands, larger region of neighbor is used to estimate the variance of flat region. By using estimated variance of original image, in general, Wiener filter is constructed, and it is applied to the noisy image. In this paper, we propose a new method for determining the range of neighbors to estimate the variance in wavelet domain. Firstly, a significance map is constructed using the parent-child relationship of wavelet domain. Based on the number of the significant wavelet coefficients, the range of neighbors is determined and then the variance of the original signal is estimated using ML(maximum likelihood method. Experimental results show that the proposed method yields better results than conventional methods for image denoising.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1368-1375
• /
• 2013

In this paper, we presents a spatially adaptive noise detection and removal algorithm. Under the assumption that an observed image and the additive noise have Gaussian distribution, the noise parameters are estimated with local statistics, and the parameters are used to define the constraints on the noise detection process, where the first order Markov Random Field (MRF) is used. In addition, an adaptive low-pass filter having a variable window sizes defined by the constraints on noise detection is used to control the degree of smoothness of the reconstructed image. Experimental results demonstrate the capability of the proposed algorithm.