• Title/Summary/Keyword: 블록 크기

Search Result 991, Processing Time 0.027 seconds

Hierarchical Feature Based Block Motion Estimation for Ultrasound Image Sequences (초음파 영상을 위한 계층적 특징점 기반 블록 움직임 추출)

  • Kim, Baek-Sop;Shin, Seong-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.402-410
    • /
    • 2006
  • This paper presents a method for feature based block motion estimation that uses multi -resolution image sequences to obtain the panoramic images in the continuous ultrasound image sequences. In the conventional block motion estimation method, the centers of motion estimation blocks are set at the predetermined and equally spaced locations. This requires the large blocks to include at least one feature, which inevitably requires long estimation time. In this paper, we propose an adaptive method which locates the center of the motion estimation blocks at the feature points. This make it possible to reduce the block size while keeping the motion estimation accuracy The Harris-Stephen corner detector is used to get the feature points. The comer points tend to group together, which cause the error in the global motion estimation. In order to distribute the feature points as evenly as Possible, the image is firstly divided into regular subregions, and a strongest corner point is selected as a feature in each subregion. The ultrasound Images contain speckle patterns and noise. In order to reduce the noise artifact and reduce the computational time, the proposed method use the multi-resolution image sequences. The first algorithm estimates the motion in the smoothed low resolution image, and the estimated motion is prolongated to the next higher resolution image. By this way the size of search region can be reduced in the higher resolution image. Experiments were performed on three types of ultrasound image sequences. These were shown that the proposed method reduces both the computational time (from 77ms to 44ms) and the displaced frame difference (from 66.02 to 58.08).

Local Block Learning based Super resolution for license plate (번호판 화질 개선을 위한 국부 블록 학습 기반의 초해상도 복원 알고리즘)

  • Shin, Hyun-Hak;Chung, Dae-Sung;Ku, Bon-Hwa;Ko, Han-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.6
    • /
    • pp.71-77
    • /
    • 2011
  • In this paper, we propose a learning based super resolution algorithm using local block for image enhancement of vehicle license plate. Local block is defined as the minimum measure of block size containing the associative information in the image. Proposed method essentially generates appropriate local block sets suitable for various imaging conditions. In particular, local block training set is first constructed as ordered pair between high resolution local block and low resolution local block. We then generate low resolution local block training set of various size and blur conditions for matching to all possible blur condition of vehicle license plates. Finally, we perform association and merging of information to reconstruct into enhanced form of image from training local block sets. Representative experiments demonstrate the effectiveness of the proposed algorithm.

Fractal Image Coding Based On Variable Block (가변 블록 기반 프랙탈 영상 부호화)

  • 노근수;조성환
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.35T no.3
    • /
    • pp.15-24
    • /
    • 1998
  • In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.

  • PDF

A Temporal Error Concealment Algorithm with Adaptive Block Size in the H.264/AVC Standard (H.264에서의 시방향(時方向) 에러은닉 기법)

  • Kim, Dong-Hyung;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2C
    • /
    • pp.49-58
    • /
    • 2005
  • For the improvement of coding efficiency, the H.264 standard uses new coding tools. Using these coding tools, H.264 has achieved significant improvements from rate-distortion point of view. The adoption of these tools enables a macroblock in H.264 to have more information, sixteen motion vectors, four reference frames and a macroblock mode. In this paper, we present an efficient temporal error concealment algorithm by using not only motion vectors and reference frames but also macroblock mode of neighbor macroblocks. Our algorithm conceals the macroblock error with variable sizes, $16{\times}16,\;16{\times}8,\;8{\times}16,\;8{\times}8$ depending on the macroblock modes of neighbor macroblocks. Simulation results show that the proposed method increase the objective quality regardless of bit-rate and block error rate.

Analysis of Parameters to Influence on Rock Fragmentation in Bench Blasting (벤치발파에서 암석 파쇄도에 영향을 미치는 요인 분석)

  • 최용근;이정인;이정상;김장순
    • Explosives and Blasting
    • /
    • v.22 no.3
    • /
    • pp.1-12
    • /
    • 2004
  • In bench blasting, rock fragmentation is one of the most important factors determining productivity. Rock fragmentation could be affected by various conditions and these were hewn that rock joint conditions and in-situ block sizes were the biggest effect on it. This research is focused on what or how to influence on rock fragmentation according to relation between blasting conditions and the in-situ rock conditions such as rock joint conditions and in-situ block size. Field measurements were carried out in 3 open pit limestone mines, where in-situ rock conditions and blasting conditions were fully investigated. The results show that the parameters interact with blasting conditions complicatedly and especially in-situ block size has bigger effects. Dip direction of major joint set also can affect on fragmentation. Mean fragment size become smallest when dip direction of major joint set is about $30^{\circ}$ with the bench direction. The reason is considered to be come from difference of propagation paths of elastic wave.

Study of the Optimal Mesh Size for a Safety Net for Preventing Falls from Wave-dissipating Blocks (소파블록 낙상사고 방지를 위한 안전망 그물코 크기 산정에 관한 연구)

  • Yoon, Han-Sam;Kim, Min-Su;Jang, Sung-Chul;Lee, Hieung-Sin
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.7
    • /
    • pp.834-840
    • /
    • 2019
  • Recently, due to increased tourism and leisure activities, falls by fishers from coastal wave-dissipating blocks (breakwaters) in Korea have been rising. We investigated the optimal mesh size for use in safety nets designed to cover Tetrapod (TTP) breakwaters to prevent casualties from falls. This is a prerequisite for considering the scale and economics of safety net facilities. The optimal mesh size was determined based on the fisher gender and age, and the bodily features of Koreans. The optimal mesh size was found to be 18.6-27.0 cm, derived based on the femoral length and chest circumference.

High Performance Data Cache Memory Architecture (고성능 데이터 캐시 메모리 구조)

  • Kim, Hong-Sik;Kim, Cheong-Ghil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.4
    • /
    • pp.945-951
    • /
    • 2008
  • In this paper, a new high performance data cache scheme that improves exploitation of both the spatial and temporal locality is proposed. The proposed data cache consists of a hardware prefetch unit and two sub-caches such as a direct-mapped (DM) cache with a large block size and a fully associative buffer with a small block size. Spatial locality is exploited by fetching and storing large blocks into a direct mapped cache, and is enhanced by prefetching a neighboring block when a DM cache hit occurs. Temporal locality is exploited by storing small blocks from the DM cache in the fully associative buffer according to their activity in the DM cache when they are replaced. Experimental results on Spec2000 programs show that the proposed scheme can reduce the average miss ratio by $12.53%\sim23.62%$ and the AMAT by $14.67%\sim18.60%$ compared to the previous schemes such as direct mapped cache, 4-way set associative cache and SMI(selective mode intelligent) cache[8].

A SPECK Crypto-Core Supporting Eight Block/Key Sizes (8가지 블록/키 크기를 지원하는 SPECK 암호 코어)

  • Yang, Hyeon-Jun;Shin, Kyung-Wook
    • Journal of IKEEE
    • /
    • v.24 no.2
    • /
    • pp.468-474
    • /
    • 2020
  • This paper describes the hardware implementation of SPECK, a lightweight block cipher algorithm developed for the security of applications with limited resources such as IoT and wireless sensor networks. The block cipher SPECK crypto-core supports 8 block/key sizes, and the internal data-path was designed with 16-bit for small gate counts. The final round key to be used for decryption is pre-generated through the key initialization process and stored with the initial key, enabling the encryption/decryption for consecutive blocks. It was also designed to process round operations and key scheduling independently to increase throughput. The hardware operation of the SPECK crypto-core was validated through FPGA verification, and it was implemented with 1,503 slices on the Virtex-5 FPGA device, and the maximum operating frequency was estimated to be 98 MHz. When it was synthesized with a 180 nm process, the maximum operating frequency was estimated to be 163 MHz, and the estimated throughput was in the range of 154 ~ 238 Mbps depending on the block/key sizes.

Noise Reduction Characteristic of Total Quiet Pavement System (저소음 포장체의 소음저감 특성)

  • Lee, Kwan-Ho;Park, Woo-Jin
    • International Journal of Highway Engineering
    • /
    • v.14 no.1
    • /
    • pp.25-34
    • /
    • 2012
  • The rapid economic development induced the massive road constructions, becoming bigger and high-speed of the vehicles. However, it brings lots of social problems, such as air pollutions, traffic noise and vibration. Special concrete block for the base course of asphalt pavement is needed to decrease traffic noise such as tire's explosive and vehicles sound, applying Helmholtz Resonators theory to asphalt pavement. If it is applied to the area where it happens considerable noise such as a junction, the street of a housing complex and a residential street, it is one of alternative methods to solve the social requirements of noise problems. This research examines couple of laboratory tests for the sound absorption effect of the concrete block and the base concrete block for quiet pavement. The specimens, which is fixed hall-size, space, depth as the condition of this research, are analysed of noise reduction effect using different noise levels of vehicles. Judging from the analysis of test results with vehicle noise volume, measurement distance, a form and size of the hall using the base concrete block, the use of special concrete base and quiet asphalt surface showed a good alternative solution for decreasing traffic noise level, from 4dB to 9dB.

A Texture Classification Based on LBP by Using Intensity Differences between Pixels (화소간의 명암차를 이용한 LBP 기반 질감분류)

  • Cho, Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.483-488
    • /
    • 2015
  • This paper presents a local binary pattern(LBP) for effectively classifying textures, which is based on the multidimensional intensity difference between the adjacent pixels in the block image. The intensity difference by considering the a extent of 4 directional changes(verticality, horizontality, diagonality, inverse diagonality) in brightness between the adjacent pixels is applied to reduce the computation load as a results of decreasing the levels of histogram for classifying textures of image. And the binary patterns that is represented by the relevant intensities within a block image, is also used to effectively classify the textures by accurately reflecting the local attributes. The proposed method has been applied to classify 24 block images from USC Texture Mosaic #2 of 128*128 pixels gray image. The block images are different in size and texture. The experimental results show that the proposed method has a speedy classification and makes a free size block images classify possible. In particular, the proposed method gives better results than the conventional LBP by increasing the range of histogram level reduction as the block size becomes larger.