• Title/Summary/Keyword: 적응적 후처리 기법

Search Result 89, Processing Time 0.027 seconds

Super-resolution Algorithm using Local Structure Analysis and Scene Adaptive Dictionary (국부 구조 분석과 장면 적응 사전을 이용한 초고해상도 알고리즘)

  • Choi, Ik Hyun;Lim, Kyoung Won;Song, Byung Cheol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.144-154
    • /
    • 2013
  • This paper proposes a new super-resolution algorithm where sharpness enhancement is merged in order to improve overall visual quality of up-scaled images. In the learning stage, multiple dictionaries are generated according to sharpness strength, and a proper dictionary among those dictionaries is selected to adapt to each patch in the inference stage. Also, additional post-processing suppresses boosting of artifacts in input low-resolution images during the inference stage. Experimental results that the proposed algorithm provides 0.3 higher CPBD than the bi-cubic and 0.1 higher CPBD than Song's and Fan's algorithms. Also, we can observe that the proposed algorithm shows better quality in textures and edges than the previous works. Finally, the proposed algorithm has a merit in terms of computational complexity because it requires the memory of only 17% in comparison with the previous work.

A Real Time Deblocking Technique Using Adaptive Filtering in a Mobile Environment (모바일 환경에서 적응적인 필터링을 이용한 실시간 블록현상 제거 기법)

  • Yoo, Jae-Wook;Park, Dae-Hyun;Kim, Yoon
    • The Journal of Korean Association of Computer Education
    • /
    • v.13 no.4
    • /
    • pp.77-86
    • /
    • 2010
  • In this paper, we propose a real time post-processing visual enhancement technique to reduce the blocking artifacts in block based DCT decoded image for mobile devices that have allocation of the restricted resource. In order to reduce the blocking artifacts effectively even while preserving the image edge to the utmost, the proposed algorithm uses the deblocking filtering or the directional filtering according to the edge detection of the each pixel. After it is discriminated that the pixel to apply the deblocking filtering belongs again to the monotonous area, the weighted average filter with the adaptive mask is applied for the pixel to remove the blocking artifacts. On the other hand, a new directional filter is utilized to get rid of staircase noise and preserve the original edge component. Experimental results show that the proposed algorithm produces better results than those of the conventional algorithms in both subjective and objective qualities.

  • PDF

Generation of Humanoid Walking Motion Adapted to the Ground's Sliding Properties (지면의 미끄러운 정도에 따른 캐릭터의 걷기 동작 생성)

  • Lee KumHee;Song MiYoung;Cho HyungJe
    • The KIPS Transactions:PartB
    • /
    • v.12B no.2 s.98
    • /
    • pp.157-166
    • /
    • 2005
  • In 3D virtual environment the description of character' s movement that has utilized the conventional key-frame technique is gradually being developed toward the application of motion control method to generate more realistic and natural motion. Even the motion control method, however, has the limitation for expression of character's motion adapted to the ground properties of virtual world. That is, the walking motions of character are not only, for the most part, so uniform simple and repeated often as to feel to be tedious, but also the unnatural motion in which the tips of the toes soak through a plane or float in the air discording with the conditions of terrain lowers the semblance of reality. This paper proposes an adaptive motion control method for human figure locomotion in virtual environments or games, in which the walking motion is dynamiccally adapted to the ground's sliding properties. We compute an optimal parameters for one cycle of walking motion adapted to the ground properties by combining the coefficient of friction and centripetal force, and therefrom we induce a set of nonskid speed corresponding to various sliding properties of the ground.

The Technique of Blocking Artifacts Reduction Method Based on Spatially Adaptive Image Restoration (공간 적응적 영상복원을 이용한 블록화 현상 제거 기법)

  • Kim, Tae-Keun;Woo, Hun-Bae;Paik, Joon-Ki
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.46-54
    • /
    • 1998
  • In this paper we propose a fast adaptive image restoration filter using DCT-based block classification for reducing block artifacts in compressed images. In order to efficiently reduce block artifacts, edge direction of each block is classified by using the DCT coefficients, and the constrained least square (CLS) on the observation that the quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space-varying degradation operator. For real-time implementation, the proposed restoration filter can be realized in the form of a truncated FIR filter, which is suitable for postprocessing reconstructed images in HDTV, DVD, or video conference systems.

  • PDF

p-Adaptive Analysis by Three Dimensional Hierarchical Hexahedral Solid Element (3차원 계층적 육면체 고체요소에 의한 p-적응적 해석)

  • Woo, Kwang-Sung;Jo, Jun-Hyung;Shin, Young-Sik
    • Journal of Korean Association for Spatial Structures
    • /
    • v.8 no.4
    • /
    • pp.81-90
    • /
    • 2008
  • This paper presents a finite element formulation for the three-dimensional hierarchical solid element using Integrals of Legendre polynomials. The proposed hexahedral solid element is composed of four different modes including vertex, edge, face, and internal mode, respectively. The eigenvalue and patch test have been carried out to confirm the zero-energy mode and constant strain condition. In addition to these, a posteriori error estimation has been studied for the p-adaptive finite element analysis that is based on a smoothing technique to compute a post-processed solution from the finite element solution. The uniform p-refinement and non-uniform p-refinement are compared in terms of convergence rate as the number of degree of freedom is increased. The simple cantilever beam is tested to show the performance of the proposed solid element.

  • PDF

Adaptive Analysis and Error Estimation in Meshless Method (무요소 방법에서의 적응적 해석을 위한 오차의 평가)

  • 정흥진
    • Computational Structural Engineering
    • /
    • v.11 no.1
    • /
    • pp.261-274
    • /
    • 1998
  • In this paper, local and global error estimates for the element-free Galerkin (EFG) method are proposed. The essence of proposed error estimates is to use the difference between the values of the projected stress and these given directly by the EFG solution. The stress projection can be obtained simply by taking product of shape function based on a different domain of influence with the stresses at nodes. In this study, it was found that the effectivity index is optimized if the domain of influence in stress projection procedure is the smallest that retains regularity of the matrices in EFG. Numerical tests are shown for various 1D and 2D examples illustrating the good effectiveness of the proposed error estimator in the global energy norm and in the local error estimates.

  • PDF

Dominant Path Selection Algorithm for Channel Estimation of MUD Based Receiver (MUD 기반 수신기의 채널 추정을 위한 주 경로 선택 알고리즘)

  • Byon Hyoung-joo;Seo In-kwon;Kim Younglok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.398-405
    • /
    • 2005
  • The multiuser detection (MUD) based wireless receiver requires more accurate channel estimation than the single user detection (SUD) schemes such as Rake receiver, and hence the post processing is required for MUD to clean up the estimated channel coefficients by eliminating the noise only coefficients. The adaptive post processing method is proposed in order to provide more accurate channel responses and the power level of the background noise and interferences at the cost of the negligible processing delay compared to the conventional method based on the threshold test with the threshold value relative to the noise variance. The simulations are performed in 3GPP-TDD mode environment. The results show that the noise estimation error of the proposed method is maximum $10\%$, which is much smaller than $50\%$ maximum error of the conventional method.

Photomosaic Algorithm with Adaptive Tilting and Block Matching (적응적 타일링 및 블록 매칭을 통한 포토 모자이크 알고리즘)

  • Seo, Sung-Jin;Kim, Ki-Wong;Kim, Sun-Myeng;Lee, Hae-Yeoun
    • The KIPS Transactions:PartB
    • /
    • v.19B no.1
    • /
    • pp.1-8
    • /
    • 2012
  • Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

Video Coding Using Wavelet Decomposition for Very Low Bit - rate Networks (초저속 전송 네트웍을 위한 웨이브릿 변환을 이용한 비디오 코딩)

  • Oh, Hwang-Seok;Lee, Heung-Kyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2629-2639
    • /
    • 1997
  • The video coding for very low bit-rate has recently received considerable attention, but the conventional coding schemes with block based transform suffer from the blocky effect for the constraints of limited bit-rate. In this paper, we present a video coding system based on wavelet transform and multiresolution motion estimation/compensation for very low bit-rate video. The proposed scheme uses the wavelet transform which is flexible to represent non-stationary image signals and adaptable to the human visual characteristics. The wavelet transformed coefficients are coded by various coding modes in accordance with the sum of absolute error after motion estimation/compensation in wavelet decomposed domain. And simple buffer control technique is applied to handle constant image quality. It is shown that the presented scheme has more acceptable image quality without blocky effects than conventional block based transform video coding.

  • PDF

Adaptive thresholding for eliminating noises in 2-DE image (2차원 전기영동 영상에서 잡영을 제거하기 위한 적응적인 문턱값 결정)

  • Choi, Kwan-Deok;Kim, Mi-Ae;Yoon, Young-Woo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.1-9
    • /
    • 2008
  • One of the problems for implementing the spot detection phase in the 2-DE gel image analysis program is the eliminating noises in the image. Remained noises after the preprocessing phase cause the over-segmented regions by the segmentation phase. To identify and exclude the over-segmented background regions, if we use the fixed thresholding method that is choosing an intensity value for the threshold, the spots that is invisible by the eyes but mean a very small amount proteins which have important role in the biological samples could be eliminated. This paper propose an adaptive thresholding method that come from an idea that is got on statistical analysing for the prominences of the peaks. The adaptive thresholding method works as following. Firstly we calculate an average prominence value curve and fit it to exponential function curve, as a result we get parameters for the exponential function. And then we calculate a threshold value by using the parameters and probability distribution of errors. Lastly we apply the threshold value to the region for determining the region is a noise or not. According to the probability distribution of errors, the reliability is 99.85% and we show the correctness of the proposed method by representing experiment results.

  • PDF