• 제목/요약/키워드: Block-based

검색결과 4,491건 처리시간 0.042초

목질폐잔재를 재활용한 목질보도블록 제조기술 개발 (A Development of Manufacturing Process of Wooden Footpath Block to Reuse of Wood Waste)

  • 박희준
    • Journal of the Korean Wood Science and Technology
    • /
    • 제25권3호
    • /
    • pp.96-104
    • /
    • 1997
  • The objective of this research project was to develop the wooden footpath block to reuse of wood waste. Some physical and mechanical properties of the wooden block such as water absorption, thickness swelling, modulus of rupture, internal bond, density profile and impact resistance were studied. Water absorption and thickness swelling of the wooden block were greatly reduced when the wooden block was pressed inside the forming device than by conventional hot pressing. Also, Modulus of rupture and internal bond of the wooden block were increased greatly when the pressing was completed inside the forming device. The density profile of the wooden block was improved up to 93.5%, minimum to average density ratio. The wooden block manufactured in this study have excellent physical and mechanical prperties in comparison with existing wood based materials. So, these wooden blocks are applicable to footpth block or other exterior members.

  • PDF

블록 신뢰도와 경계면 매칭 기반의 잡음 은닉 알고리즘 (Boundary Match and Block Reliability Based Error Concealment Algorithm)

  • 김도현;최경호
    • 스마트미디어저널
    • /
    • 제6권2호
    • /
    • pp.9-14
    • /
    • 2017
  • 무선 환경에서의 패킷 손실은 비디오 통신과정에서 심각한 비디오 품질 저하를 초래한다. 이 논문에서는 블록의 신뢰도와 블록 경계면 매칭을 기반으로 한 비디오 에러 은닉 기술에 대해서 제안한다. 손실된 블록의 모션 정보를 참조 프레임의 동일한 위치에 존재하는 블록의 모션 정보를 복사하여 사용함으로써 임시로 손실된 블록의 잡음을 은닉하고, 블록의 신뢰도를 기준으로 블록의 신뢰도가 낮은 경우에는 추가적으로 블록의 경계면 매칭을 이용하여 모션 벡터를 재탐색하여 잡음 은닉에 대한 정확도를 높이도록 하였다. 실험을 통해서 제안된 기법이 다양한 패킷 손실 환경에서 우수한 에러 은닉 성능을 보임을 확인하였다.

Content Based Image Retrieval Based on A Novel Image Block Technique Combining Color and Edge Features

  • Kwon, Goo-Rak;Haoming, Zou;Park, Sei-Seung
    • Journal of information and communication convergence engineering
    • /
    • 제8권2호
    • /
    • pp.185-190
    • /
    • 2010
  • In this paper we propose the CBIR algorithm which is based on a novel image block method that combined both color and edge feature. The main drawback of global histogram representation is dependent of the color without spatial or shape information, a new image block method that divided the image to 8 related blocks which contained more information of the image is utilized to extract image feature. Based on these 8 blocks, histogram equalization and edge detection techniques are also used for image retrieval. The experimental results show that the proposed image block method has better ability of characterizing the image contents than traditional block method and can perform the retrieval system efficiently.

다해상도 기반 계층적 변이맵을 이용한 중간영상 생성 방법 (An Intermediate Image Generation Method using Multiresolution-based Hierarchical Disparity Map)

  • 허경무;유재민
    • 제어로봇시스템학회논문지
    • /
    • 제9권11호
    • /
    • pp.899-905
    • /
    • 2003
  • An intermediate images generation method using multi-resolution based hierarchical block matching disparity map is proposed. This method is composed of a disparity estimation, an occlusion detection and intermediate image synthesis. For the disparity estimation, which is one of the important processes in intermediate image synthesis, we use the multi-resolution based hierarchical block matching algorithm to overcome the imperfect ness of block matching algorithm. The proposed method makes disparity maps more accurate and dense by multi-resolution based hierarchical block matching, and the estimated disparity maps are used to generate intermediate images of stereo images. Generated intermediate images show 0.1∼1.4 ㏈ higher PSNR than the images obtained by block matching algorithm.

Block-Based Method를 이용한 Motion Estimation에 관한 연구 (A study of a motion estimation with the block-based method)

  • 김상기;이원희;김재영;변재응;이범로;정진현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.1-4
    • /
    • 1996
  • It is difficult that a non-translational motion in a block is estimated by the block matching algorithm (BMA). In this paper, a nodal-displacement-based deformation model is used for this reason. This model assumes that a selected number of control nodes move freely in a block and that displacement of any interior point can be interpolated from nodal displacements. As a special case with a single node this model is equivalent to a translational model. And this model can represent more complex deformation using more nodes. We used an iterative gradient based search algorithm to estimate nodal displacement. Each iteration involves the solution of a simple linear equation. This method is called the deformable block matching algorithm (DBMA).

  • PDF

OSEK/VDX 기반의 차량 전장용 응용개발도구 설계 및 구현 (Design and Implementation of OSEK/VDX Development Tool for Automotive Applications)

  • 안성호;김재영;김광수
    • 대한임베디드공학회논문지
    • /
    • 제4권2호
    • /
    • pp.84-89
    • /
    • 2009
  • This paper describes the development tool for applications of automotive electronic control unit based on OSEK/VDX. This development tool has a plug-in structure and is written in Java language, because of being based on Eclipse CDT. And also this development tool has another functionality of expansion, which means a special function block can be easily adopted in this development tool. Currently, this development tool consists of five blocks, which are integrated development environment block, fusing program block, system generation block, debugger block, and cross-compiler toolchain block. They have relationship between each other and work for developing OSEK/VDX-based applications. In this paper, we show the functionality of each block of this development tool and its implementation.

  • PDF

On the Design of Block Lengths for Irregular LDPC Codes Based on the Maximum Variable Degree

  • 정규혁
    • 한국통신학회논문지
    • /
    • 제35권11C호
    • /
    • pp.907-910
    • /
    • 2010
  • This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.

Reducing Decoding Complexity by Improving Motion Field Using Bicubic and Lanczos Interpolation Techniques in Wyner-Ziv Video Coding

  • Widyantara, I Made O.;Wirawan, Wirawan;Hendrantoro, Gamantyo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권9호
    • /
    • pp.2351-2369
    • /
    • 2012
  • This paper describes interpolation method of motion field in the Wyner-Ziv video coding (WZVC) based on Expectation-Maximization (EM) algorithm. In the EM algorithm, the estimated motion field distribution is calculated on a block-by-block basis. Each pixel in the block shares similar probability distribution, producing an undesired blocking artefact on the pixel-based motion field. The proposed interpolation techniques are Bicubic and Lanczos which successively use 16 and 32 neighborhood probability distributions of block-based motion field for one pixel in k-by-k block on pixel-based motion field. EM-based WZVC codec updates the estimated probability distribution on block-based motion field, and interpolates it to pixel resolution. This is required to generate higher-quality soft side information (SI) such that the decoding algorithm is able to make syndrome estimation more quickly. Our experiments showed that the proposed interpolation methods have the capability to reduce EM-based WZVC decoding complexity with small increment of bit rate.

DABC: A dynamic ARX-based lightweight block cipher with high diffusion

  • Wen, Chen;Lang, Li;Ying, Guo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권1호
    • /
    • pp.165-184
    • /
    • 2023
  • The ARX-based lightweight block cipher is widely used in resource-constrained IoT devices due to fast and simple operation of software and hardware platforms. However, there are three weaknesses to ARX-based lightweight block ciphers. Firstly, only half of the data can be changed in one round. Secondly, traditional ARX-based lightweight block ciphers are static structures, which provide limited security. Thirdly, it has poor diffusion when the initial plaintext and key are all 0 or all 1. This paper proposes a new dynamic ARX-based lightweight block cipher to overcome these weaknesses, called DABC. DABC can change all data in one round, which overcomes the first weakness. This paper combines the key and the generalized two-dimensional cat map to construct a dynamic permutation layer P1, which improves the uncertainty between different rounds of DABC. The non-linear component of the round function alternately uses NAND gate and AND gate to increase the complexity of the attack, which overcomes the third weakness. Meanwhile, this paper proposes the round-based architecture of DABC and conducted ASIC and FPGA implementation. The hardware results show that DABC has less hardware resource and high throughput. Finally, the safety evaluation results show that DABC has a good avalanche effect and security.

A Content Adaptive Fast PDE Algorithm for Motion Estimation Based on Matching Error Prediction

  • Lee, Sang-Keun;Park, Eun-Jeong
    • Journal of Communications and Networks
    • /
    • 제12권1호
    • /
    • pp.5-10
    • /
    • 2010
  • This paper introduces a new fast motion estimation based on estimating a block matching error (i.e., sum of absolute difference (SAD)) between blocks which can eliminate an impossible candidate block much earlier than a conventional partial distortion elimination (PDE) scheme. The basic idea of the proposed scheme is based on predicting the total SAD of a candidate block using its partial SAD. In particular, in order to improve prediction accuracy and computational efficiency, a sub-sample based block matching and a selective pixel-based approaches are employed. In order to evaluate the proposed scheme, several baseline approaches are described and compared. The experimental results show that the proposed algorithm can reduce the computations by about 44% for motion estimation at the cost of 0.0005 dB quality degradation versus the general PDE algorithm.