• Title/Summary/Keyword: block-adaptive

Search Result 593, Processing Time 0.023 seconds

The Design of MRAC using Block Pulse Functions (블럭펄스함수를 이용한 MRAC설계)

  • Kim, Jin-Tae;Kim, Tai-Hoon;Ahn, Pius;Lee, Myung-Kyu;Shim, Jae-Sun;Ahn, Doo-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.2252-2254
    • /
    • 2001
  • This paper proposes a algebraic parameter determination of MRAC (Model Reference Adaptive Control) controller using block Pulse functions and block Pulse function's differential operation. Generally, adaption is performed by solving differential equations which describe adaptive low for updating controller parameter. The proposes algorithm transforms differential equations into algebraic equation, which can be solved much more easily in a recursive manner. We believe that proposes methods are very attractive and proper for parameter estimation of MRAC controller on account of its simplicity and computational convergence.

  • PDF

Knowledge Based Underwater Acoustic Communication Smart Decision Block Mechanism (지식기반 시스템을 활용한 수중음파통신 Smart Decision Block 매커니즘)

  • Shin, Soo-Young;Park, Soo-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.5
    • /
    • pp.631-639
    • /
    • 2014
  • Recently, research on Media Access Control (MAC) techniques for underwater acoustic communication has been conducted actively. For successful acoustic communication in underwater conditions, development of environmentally adaptive MAC techniques, which is taking narrow bandwidth, distance, depth, noise level, salinity, multipath and etc into account, is an especially important work. In this paper, knowledge based system is introduced not only to obtain adaptive and optimal communication parameters but also increase network efficiency and availability by requesting change of MAC techniques based on decisions from knowledge-based system Smart Decision Block (SDB). Computer simulations were also conducted to verify the performance of the proposed system in underwater conditions.

A Block-Based Adaptive Data Hiding Approach Using Pixel Value Difference and LSB Substitution to Secure E-Governance Documents

  • Halder, Tanmoy;Karforma, Sunil;Mandal, Rupali
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.261-270
    • /
    • 2019
  • In order to protect secret digital documents against vulnerabilities while communicating, steganography algorithms are applied. It protects a digital file from unauthorized access by hiding the entire content. Pixel-value-difference being a method from spatial domain steganography utilizes the difference gap between neighbor pixels to fulfill the same. The proposed approach is a block-wise embedding process where blocks of variable size are chosen from the cover image, therefore, a stream of secret digital contents is hidden. Least significant bit (LSB) substitution method is applied as an adaptive mechanism and optimal pixel adjustment process (OPAP) is used to minimize the error rate. The proposed application succeeds to maintain good hiding capacity and better signal-to-noise ratio when compared against other existing methods. Any means of digital communication specially e-Governance applications could be highly benefited from this approach.

Adaptive Blocking Artifacts Reduction in Block-Coded Images Using Block Classification and MLP (블록 분류와 MLP를 이용한 블록 부호화 영상에서의 적응적 블록화 현상 제거)

  • Kwon, Kee-Koo;Kim, Byung-Ju;Lee, Suk-Hwan;Lee, Jong-Won;Kwon, Seong-Geun;Lee, Kuhn-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.399-407
    • /
    • 2002
  • In this paper, a novel algorithm is proposed to reduce the blocking artifacts of block-based coded images by using block classification and MLP. In the proposed algorithm, we classify the block into four classes based on a characteristic of DCT coefficients. And then, according to the class information of neighborhood block, adaptive neural network filter is performed in horizontal and vertical block boundary. That is, for smooth region, horizontal edge region, vertical edge region, and complex region, we use a different two-layer neural network filter to remove blocking artifacts. Experimental results show that the proposed algorithm gives better results than the conventional algorithms both subjectively and objectively.

Adaptation Types of Urban Tissue in Ipjeong-dong Area, Seoul (서울 입정동 일대 도시조직의 적응 유형)

  • Woo, Don-Son;Cho, Yun-O
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.34 no.7
    • /
    • pp.99-106
    • /
    • 2018
  • The purpose of this study is to examine adaptation types of urban tissue in Ipjeong-dong area, Seoul. Ipjeong-dong area has urban tissue those were made during Joseon dynasty and this is remaining even in the present time. This area was originally urban hanok residential districts till late 1950s. However, it has changed into machinery manufacture business area after demolition of Cheonggyechon shantytown. After several workshops and stores moved in this area, manufacturer and merchants required for more spaces due to lack of room for machinery. To place more workshops in the block, lot alteration were happened and accessibility to workshops inside the block were required. Adaptive road network which is main form of adaptative urban tissue were made to adapt in this kind of poor urban condition. To research about adaptive urban tissue making, distribution were explored and comparison tasks between various cadastral map of 1940, 1964, 1970s and 2017 were conducted. From these tasks, certain types of adaptive urban tissues and characteristics of these elements were found. First of all, forms of adaptive road depend on the surrounded environment. Connecting internal building corridor with original road system is categorized as Type A. Altering a portion of the buildings to make adaptive roads is categorized as Type B. Second, there were two types of formation of adaptive road. Type 1 is for adaptive road which is independent gesture from original road network. Type 2 is for adaptive road which is altering the form of original road network by lengthening or connecting two different dead-end roads.

Adaptive Error Detection Using Causal Block Boundary Matching in Block-Coded Video (블록기반 부호화 비디오에서 인과적 블록 경계정합을 이용한 적응적 오류 검출)

  • 주용수;김태식;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8C
    • /
    • pp.1125-1132
    • /
    • 2004
  • In this Paper, we Propose an effective boundary matching based error detection algorithm using causal neighbor blocks to improve video quality degraded from channel error in block-coded video. The proposed algorithm first calculates boundary mismatch powers between a current block and each of its causal neighbor blocks. It then decides that a current block should be normal if all the mismatch powers are less than an adaptive threshold, which is adaptively determined using the statistics of the two adjacent blocks. In some experiments under the environment of 16bi1s burst error at bit error rates (BERs) of 10$^{-3}$ -10$^{-4}$ , it is shown that the proposed algorithm yields the improvements of maximum 20% in error detection rate and of maximum 3.5㏈ in PSNR of concealed kames, compared with Zeng's error detection algorithm.

A Fast Full-Search Motion Estimation Algorithm using Adaptive Matching Scans based on Image Complexity (영상 복잡도와 다양한 매칭 스캔을 이용한 고속 전영역 움직임 예측 알고리즘)

  • Kim Jong-Nam
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.949-955
    • /
    • 2005
  • In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

A Context-based Fast Encoding Quad Tree Plus Binary Tree (QTBT) Block Structure Partition

  • Marzuki, Ismail;Choi, Hansol;Sim, Donggyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.175-177
    • /
    • 2018
  • This paper proposes an algorithm to speed up block structure partition of quad tree plus binary tree (QTBT) in Joint Exploration Test Model (JEM) encoder. The proposed fast encoding of QTBT block partition employs three spatially neighbor coded blocks, such as left, top-left, and top of current block, to early terminate QTBT block structure pruning. The propose algorithm is organized based on statistical similarity of those spatially neighboring blocks, such as block depths and coded block types, which are coded with overlapped block motion compensation (OBMC) and adaptive multi transform (AMT). The experimental results demonstrate about 30% encoding time reduction with 1.3% BD-rate loss on average compared to the anchor JEM-7.1 software under random access configuration.

  • PDF

Performance Analysis of MIMO-OFDM System Applying AMC and SFC Schemes (AMC와 SFC기법을 적용한 MIMO-OFDM 시스템의 성능 분석)

  • Lee, Yun-Ho;Kim, Hyung-Jung;Jo, G.D.;Kim, Kyung-Seok
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.4
    • /
    • pp.55-62
    • /
    • 2008
  • Adaptive modulation and Coding(AMC) scheme is promising technique to support the demands for high data rates and wideband proposed for 4G mobile communication system standards. In this paper, adaptive modulation and coding(AMC) based on OFDM system is analyzed through simulation for single user case and compared with SISO-OFDM and SFBC(Space frequency block coding)-OFDM. The performance analysis in terms of capacity for downlink system environments with different values of constellation size under multipath fading channel is done. The adaptive modulation and coding technique is based on perfect estimation channel. It has been observed that SFBC(Space-frequency block coding)-OFDM system gives better performance in terms of capacity.

Reversible Watermarking with Adaptive Embedding Threshold Matrix

  • Gao, Guangyong;Shi, Yun-Qing;Sun, Xingming;Zhou, Caixue;Cui, Zongmin;Xu, Liya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4603-4624
    • /
    • 2016
  • In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.