• Title/Summary/Keyword: Domain Block

Search Result 431, Processing Time 0.029 seconds

PBS-PTMG Segmented Block Copolymer의 Segment와 Domain 배향 거동

  • 박해동;이한섭;조창기;박영효
    • Proceedings of the Korean Fiber Society Conference
    • /
    • 1998.04a
    • /
    • pp.76-79
    • /
    • 1998
  • 일반적인 합성 섬유들은 비생분해성 고분자로 환경문제의 원인이므로 이를 대체하기 위하여 생분해성 지방족 폴리에스터가 널리 연구되고 있다.[1] 그러나, 이들의 기계적, 열적 성질이 다른 합성 섬유에 비해 떨어진다. 따라서, 생분해성 고분자의 특성을 유지하면서 기계적 성질을 향상시키기 위하여 다른 유연한 고분자와 지방족 폴리에스터를 공중합하였다.(중략)

  • PDF

Implementation of Foveation Filter in DCT Domain

  • Tran, Huy;Kim, Wonha
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.315-318
    • /
    • 2013
  • A novel foveation filter method is proposed in DCT domain. For countering the blocking and ringing artifacts, we devise the tools measuring the signal gradient, the block signal variations in the DCT domain. Each measurement is properly applied to each enhancement region and smoothing region. The proposed method optimally adapts the enhancement factors to the characteristics of the underlying signals and so maximizes the enhancement performances with significantly suppressing the artifacts. The subjective and objective evaluations verify that the proposed method sustains producing the improved video qualities for various sequences without tuning any parameters to individual sequences.

  • PDF

PRECONDITIONERS FOR A COUPLED PROBLEM BY A PENALTY TERM ARISEN IN AN AUGMENTED LAGRANGIAN METHOD

  • Lee, Chang-Ock;Park, Eun-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.5
    • /
    • pp.1267-1286
    • /
    • 2020
  • We pay attention to a coupled problem by a penalty term which is induced from non-overlapping domain decomposition methods based on augmented Lagrangian methodology. The coupled problem is composed by two parts mainly; one is a problem associated with local problems in non-overlapping subdomains and the other is a coupled part over all subdomains due to the penalty term. For the speedup of iterative solvers for the coupled problem, we propose two different types of preconditioners: a block-diagonal preconditioner and an additive Schwarz preconditioner as overlapping domain decomposition methods. We analyze the coupled problem and the preconditioned problems in terms of their condition numbers. Finally we present numerical results which show the performance of the proposed methods.

Motion Estimation and Compensation based on Advanced DCT (변환 영역에서 개선된 DCT를 기반으로 한 움직임 예측 및 보상)

  • Jang, Young;Cho, Hyo-Moon;Cho, Sang-Bock
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.38-40
    • /
    • 2007
  • In this paper, we propose a novel architecture, which is based on DCT (Discrete Cosine Transform), for ME (Motion Estimation) and MC (Motion Compensation). The traditional algorithms of ME and MC based on DCT did not suffer the advantage of the coarseness of the 2-dimensional DCT (2-D DCT) coefficients to reduce the operational time. Therefore, we derive a recursion equation for transform-domain ME and MC and design the structure by using highly regular, parallel, and pipeline processing elements. The main difference with others is removing the IDCT block by using to transform domain. Therefore, the performance of our algorithm is more efficient in practical image processing such as DVR (Digital Video Recorder) system. We present the simulation result which is compare with the spatial domain methods. it shows reducing the calculation cost. compression ratio. and peak signal to noise ratio (PSNR).

  • PDF

Security Properties of Domain Extenders for Cryptographic Hash Functions

  • Andreeva, Elena;Mennink, Bart;Preneel, Bart
    • Journal of Information Processing Systems
    • /
    • v.6 no.4
    • /
    • pp.453-480
    • /
    • 2010
  • Cryptographic hash functions reduce inputs of arbitrary or very large length to a short string of fixed length. All hash function designs start from a compression function with fixed length inputs. The compression function itself is designed from scratch, or derived from a block cipher or a permutation. The most common procedure to extend the domain of a compression function in order to obtain a hash function is a simple linear iteration; however, some variants use multiple iterations or a tree structure that allows for parallelism. This paper presents a survey of 17 extenders in the literature. It considers the natural question whether these preserve the security properties of the compression function, and more in particular collision resistance, second preimage resistance, preimage resistance and the pseudo-random oracle property.

The Integrity Evaluation of weld zone in railway rails Using Neural Network (신경회로망을 이용한 철도레일 용접부의 건전성평가)

  • 윤인식;임미섭
    • Journal of the Korean Society for Railway
    • /
    • v.6 no.2
    • /
    • pp.81-86
    • /
    • 2003
  • This study proposes the neural network simulator for the integrity evaluation of weld zone in railway rails. For these purposes, the ultrasonic signals for defects(crack) of weld zone in frames are acquired in the type of time series data and echo strength. The detection of the natural defects in railway truck is performed using the characteristics of echodynamic pattern in ultrasonic signal. And then their applications evaluated feature extraction based on the time-frequency-attractor domain(peak to peak, rise time, rise slope, fall time, fall slope, pulse duration, power spectrum, and bandwidth) and attractor characteristics (fractal dimension and attractor quadrant) etc. The constructed neural network simulator agrees fairly well with the measured results of test block(defect location, beam propagation distance, echo strength, etc). The Proposed neural network simulator in this study can be used for the integrity evaluation of weld zone in railway rails.

An Iterative CRT Based Image Watermarking on DCT Domain

  • Choi, Ji-Su;Kim, Gye-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.2
    • /
    • pp.41-48
    • /
    • 2019
  • Digital image watermarking techniques have been studied in various fields in order to protect the copyright of multimedia contents mostly composed by images. JPEG compression is a representative copyright attack for image watermarking. The CRT-based watermarking methods in DCT domain have been studied, because these are robust for JPEG compression attack. In this paper, we propose a new method with improved performance compared with the existing CRT based methods in DCT domain. The proposed method selects the DCT block according to the denseness at the watermark insertion phase, and iteratively adjust the CRT Conditional coefficients at the watermark extraction. This paper shows that it is more robust for the JPEG compression attacks through experimental results.

BlockSim++: A Lightweight Block-oriented Hierarchical Modeling and Simulation Framework for Continuous Systems (BlockSim++: 연속시스템의 계층적 모델링 및 시뮬레이션을 위한 블록기반 경량 프레임워크)

  • Song, Hae-Sang;Se, Jeong-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.11-22
    • /
    • 2012
  • This paper proposes for practical engineers a lightweight modeling and simulation environment for continuous system models specified in ordinary differential equations, which are time-domain specification of such systems. We propose a block-oriented specification formalism that has two levels: one for atomic behavior and the other the structure of models. Also we provide with a simulation framework, called BlockSim++, which make models specified in the block-oriented formalism be easily translated in object-oriented program that runs with the proposed simulation framework. The proposed formalism and framework has advantage of reuse such that it can be easily integrated into application programs and heterogeneous simulators. We illustrates the usefulness of the proposed framework by a simple hybrid modeling simulation example.

Fuzzy Measures to Control Video Bit-rate in the DCT Domain (동영상 대역폭 조절을 위한 DCT 영역의 퍼지 측정값)

  • Kim Tae-Yong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.4 s.310
    • /
    • pp.113-122
    • /
    • 2006
  • In this paper, we propose a fuzzy method to control bit-rate in the DCT Domain. The method consists of a bit-rate allocation with fuzzy measures and a least-distortion bit-rate reduction. Fuzzy measures are calculated by the code length, the discontinuity ambiguity, and the neighborhood momentum in each DCT block. These measures are summed with weights and form a reduction fuzziness to indicate the degree of preferable reduction. Using the reduction fuzziness. each DCT block is filtered by the least-distortion reduction method to adjust the bit-rate for the target bandwidth. In the experiment, we show the results that the transcoded video quality by the method is better and the bandwidth is more regular than those of existing methods in both visually and quantitatively.

Half-Pixel Correction for MPEG-2/H.264 Transcoding (DCT 기반 MPEG-2/H.264 변환을 위한 1/2 화소 보정)

  • Kwon Soon-young;Lee Joo-kyong;Chung Ki-dong
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.956-962
    • /
    • 2005
  • To improve video quality and coding efficiency, H.264/AVC adopts different half pixel calculating method compared with the previous standards. So, the transcoder requires additional works to transcode the pre-coded video contents with the previous standards to H.264/AVC in DCT domain. In this paper, we propose the first half-pixel correction method for MPEG-2 to H.264 transcoding in DCT domain. In the proposed method, MPEG-2 block is added to the correction block obtained by difference calculation of half-pixel values between two standards using DCT reference frame. Experimental results show that the proposed achieves better quality than pixel based cascaded transcoding method.