• Title/Summary/Keyword: Block Size

Search Result 1,415, Processing Time 0.031 seconds

Predictive motion estimation algorithm using spatio-temporal correlation of motion vector (움직임 벡터의 시공간적인 상관성을 이용한 예측 움직임 추정 기법)

  • 김영춘;정원식;김중곤;이건일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.64-72
    • /
    • 1996
  • In this paper, we propose predictive motion estimatin algorithm which can predict motion without additional side information considering spatio-tempral correlatio of motion vector. This method performs motion prediction of current block using correlation of the motion vector for two spatially adjacent blocks and a temporally adjacent block. Form predicted motion, the position of searhc area is determined. Then in this searhc area, we estimate motion vector of current block using block matching algoirthm. Considering spatial an temporal correlation of motion vector, the proposed method can predict motion precisely much more. Especially when the motion of objects is rapid, this method can estimate motion more precisely without reducing block size or increasing search area. Futhrmore, the proposed method has computation time the same as conventional block matching algorithm. And as it predicts motion from adjacent blocks, it does not require additional side information for adjacent block. Computer simulation results show that motion estimation of proposed method is more precise than that of conventioanl method.

  • PDF

Development of Planting Block for Protection of Inclined Plane Using Agriculture By-products (농업부산물을 활용한 사면보호용 식생 블럭 개발)

  • Baek, Sung-Chul;Kim, Young-Ik;Sung, Chan-Yong
    • Proceedings of the Korean Society of Agricultural Engineers Conference
    • /
    • 2002.10a
    • /
    • pp.201-204
    • /
    • 2002
  • This study is performed to develop of planting block using rice straw ash for Protection of Inclined plane. For the planting, porous concrete block is demanded ability to passing water and air through void of block. In this paper, material used for porous concrete block is cement, rice straw ash, and coarse aggregate(5-10, 10-20, 5-20mm). Planting block size is 23*23*4cm and kinds of planting are Tall fescue, Lespedeza cyrtobotrya and Lespedeza cuneata. The results measured for three months show that possible planting of various kinds for porous concrete block.

  • PDF

Experimental Study on Development of Plantable Concrete Block Using Rice Straw Ash and Application for Inclined Plane (볏짚재를 활용한 식생콘크리트 블록 개발 및 사면 적용성에 관한 실험적 연구)

  • 성찬용;김영익
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.45 no.4
    • /
    • pp.107-114
    • /
    • 2003
  • This study was performed to develop the plantable concrete block using rice straw ash and apply for inclined plane. For the planting, plantable concrete block needs infiltration of water and air through void of block. The materials used for plantable concrete block are cement, rice straw ash, and coarse aggregate (5-10, 10-20 mm). Plantable block size is $23\times23\times4$ cm, and species of planting are Tall fescue, Lespedeza cyrtobotrya and Lespedeza cuneata. At the 6 months after seeding, germination ratio and grown-up length of Tall fescue, Lespedeza cyrtobotrya and Lespedeza cuneata are shown in 90%, 60%, 50%, and 40~50 cm, 90~120 cm, 60~75 cm, respectively.

A Quantizer Reconstruction Level Control Method for Block Artifact Reduction in DCT Image Coding (양자화 재생레벨 조정을 통한 DCT 영상 코오딩에서의 블록화 현상 감소 방법)

  • 김종훈;황찬식;심영석
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.5
    • /
    • pp.318-326
    • /
    • 1991
  • A Quantizer reconstruction level control method for block artifact reduction in DCT image coding is described. In our scheme, quantizer reconstruction level control is obtained by adding quantization level step size to the optimum quantization level in the direction of reducing the block artifact by minimizing the mean square error(MSE) and error difference(EDF) distribution in boundary without the other additional bits. In simulation results, although the performance in terms of signal to noise ratio is degraded by a little amount, mean square of error difference at block boundary and mean square error having relation block artifact is greatly reduced. Subjective image qualities are improved compared with other block artifact reduction method such as postprocessing by filtering and trasform coding by block overlapping. But the addition calculations of 1-dimensional DCT become to be more necessary to coding process for determining the reconstruction level.

  • PDF

DCT Coefficient Block Size Classification for Image Coding (영상 부호화를 위한 DCT 계수 블럭 크기 분류)

  • Gang, Gyeong-In;Kim, Jeong-Il;Jeong, Geun-Won;Lee, Gwang-Bae;Kim, Hyeon-Uk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.880-894
    • /
    • 1997
  • In this paper,we propose a new algorithm to perform DCT(Discrete Cosine Transform) withn the area reduced by prdeicting position of quantization coefficients to be zero.This proposed algorithm not only decreases the enoding time and the decoding time by reducing computation amount of FDCT(Forward DCT)and IDCT(Inverse DCT) but also increases comprossion ratio by performing each diffirent horizontal- vereical zig-zag scan assording to the calssified block size for each block on the huffiman coeing.Traditional image coding method performs the samd DCT computation and zig-zag scan over all blocks,however this proposed algorthm reduces FDCT computation time by setting to zero insted of computing DCT for quantization codfficients outside classfified block size on the encoding.Also,the algorithm reduces IDCT computation the by performing IDCT for only dequantization coefficients within calssified block size on the decoding.In addition, the algorithm reduces Run-Length by carrying out horizontal-vertical zig-zag scan approriate to the slassified block chraateristics,thus providing the improverment of the compression ratio,On the on ther hand,this proposed algorithm can be applied to 16*16 block processing in which the compression ratio and the image resolution are optimal but the encoding time and the decoding time take long.Also,the algorithm can be extended to motion image coding requirng real time processing.

  • PDF

A Study on Heat Transfer and Pressure Drop Characteristics according to Block Size and Turbulence Generator's Placement in a Horizontal Channel (블록 크기 및 난류발생기 배치에 따른 수평채널내의 열전달 및 압력강하 특성에 관한 연구)

  • Seo, Kyu-Won;Lim, Jong-Han;Yoon, Jun-Kyu
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.4
    • /
    • pp.639-647
    • /
    • 2019
  • Recently, as the semiconductor integration technology due to miniaturization and high density of electronic equipment have developed, it is importantly recognized the application of thermal control system in order to release inner heat generated from chips, modules, In this study, we considered the heat transfer and pressure drop characteristics in a horizontal channel with four blocks using k-${\omega}$ SST turbulence model During CFD (Computational Fluid Dynamics) analysis, the parameters applied block width, block height, heat source and turbulence generator placement etc. As the boundary conditions of analysis, the channel inlet temperature and flow velocity were respectively 300 K and 3.84 m/s, the heat flux was $358W/m^2$. As a result, the heat transfer performance was decreased as the block width ratio (w/h) was increased, while it was increased as the block height ratio (h/w) was increased. In addition, as the arrangement of heat source size was increased to high heat flux from low heat flux, it was influenced by heat source size and the heat transfer coefficient showed a tendency to increase, When the turbulence generator was installed in the upper part of block No. 1 position the closely to the channel entrance, the heat transfer characteristics was greatly influenced on the whole of four heating blocks. and in oder to consider the pressure drop characteristics, we are able to select the most appropriate turbulence generator's position.

Dosimetric Consideration of the Lung Block in the Mantle Field (Mantle Field에서 Lung Block의 선량분포 고려)

  • Yoo Myung-Jin;Sin Byung-Chul;Moon Chang-Woo;Jeung Tae-Sig;Yum Ha-Yong
    • Radiation Oncology Journal
    • /
    • v.13 no.2
    • /
    • pp.199-203
    • /
    • 1995
  • Purpose: To evaluate the dose under lung block as a function of depth and the effectiveness of a block as a function of block width. Materials and Methods : Field size of mantle field was $22.8{\times}32.4cm^2.$ Dose distribution of the mantle field was measured with two dimensional water phantom system. To analyze the effectiveness of the lung block. central axis plane, 5cm off-axis plane, and 10cm off-axis plane were studied. Results: The dose under the lung block was recorded with maximum at the depth between 5cm and 10cm. In the central axis plane, dosimetric block width was $10-15\%$ less than physical block width. In the 5cm off-axis plane, dosimetric block width was $4-9\%$ less than physical block width. In the 10cm off-axis plane, dosimetric block width was $2\%$ less than physical block width. Conclusion: Depth dependence of the dose under the lung block was founded. Also, block width dependence of the lung block was founded. To induce the accurate relation between the physical block width and the 'effective' block width, it needs more detailed understanding of the variables involved.

  • PDF

Power analysis for 3 ${\times}$ 3 Latin square design (3 ${\times}$ 3 라틴방격모형의 검정력 분석)

  • Choi, Young-Hun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.2
    • /
    • pp.401-410
    • /
    • 2009
  • Due to the characteristics of 3 ${\times}$ 3 Latin square design which is composed of two block effects and one main effect, powers of rank transformed statistic for testing the main effect are very superior to powers of parametric statistic without regard to the type of population distributions. By order of when all three effects are fixed, when on one block effect is random, when two block effects are random, the rank transform statistic for testing the main effect shows relatively high powers as compared with the parametric statistic. Further when the size of main effect is big with one equivalent size of block effect and the other small size of block effect, powers of rank transformed statistic for testing the main effect demonstrate excellent advantage to powers of parametric statistic.

  • PDF

The Content-based Image Retrieval by Using Variable Block Size and Block Matching Algorithm (가변 블록 크기와 블록 매칭 알고리즘의 조합에 의한 내용기반 화상 검색)

  • Kang, Hyun-Inn;Baek, Kwang-Ryul
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.8
    • /
    • pp.47-54
    • /
    • 1998
  • With the increasing popularity of the use of large-volume image database in various application, it becomes imperative to build an efficient and fast retrieval system to browse through the entire database. We present a new method for a content-based image retrieval by using a variable block size and block matching algorithm. Proposed approach is reflecting image features that exploit visual cues such as color and space allocation of image and is getting the fast retrieval time by automatical convergence of retrieval times which adapt to wanting similarity value. We have implemented this technique and tested it for a database of approximately 150 images. The test shows that a 1.9 times fast retrieval time compare to J & V algorithm at the image retrieval efficiency 0.65 and that a 1.83 times fast retrieval time compare to predefined fixed block size.

  • PDF

Index block mapping for flash memory system (플래쉬 메모리 시스템을 위한 인덱스 블록 매핑)

  • Lee, Jung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.23-30
    • /
    • 2010
  • Flash memory is non-volatile and can retain data even after system is powered off. Besides, it has many other features such as fast access speed, low power consumption, attractive shock resistance, small size, and light-weight. As its price decreases and capacity increases, the flash memory is expected to be widely used in consumer electronics, embedded systems, and mobile devices. Flash storage systems generally adopt a software layer, called FTL. In this research, we proposed a new FTL mechanism for overcoming the major drawback of conventional block mapping algorithm. In addition to the block mapping table, a index block mapping table with a small size is used to indicate sector location. The proposed indexed block mapping algorithm by adding a small size. By the simulation result, the proposed FTL provides an enhanced speed than a conventional hybrid mapping algorithm by around 45% in average, and the requirement of mapping memory is also reduced by around 12%.