• Title/Summary/Keyword: variable blocks

Search Result 164, Processing Time 0.049 seconds

A Lossless compression of Medical Images using Global & Local redundancy (전역적.국부적 중복성을 이용한 의료영상의 무손실 압축)

  • Lee, J.S.;Kwon, O.S.;Han, Y.H.;Hong, S.H.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1996 no.11
    • /
    • pp.293-296
    • /
    • 1996
  • In this paper, we studied two image characteristics, similarity and smoothness, which give rise to local and global redundancy in image representation. The similarty means that any patterns in the image repeat itself anywhere in the rest of image. The smoothness means that the gray level values within a given block vary gradually rather than abruptly. In this sense, we propose a lossless medical image compression scheme which exploits both types of redundancy. This method segments the image into variable size blocks and encodes them depending on characteristics of the block. The proposed compression schemes works better than other compression schemes such as the huffman, the arithmetic, the Lempel-Ziv and the lossless scheme of JPEG.

  • PDF

Design of user-level file system using variable-length blocks (가변 블록을 이용한 사용자 파일 시스템설계)

  • Yoo, Young-Jun;Kim, Byung-Kwan;Ko, Young-Woong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.04a
    • /
    • pp.51-53
    • /
    • 2015
  • 본 논문은 기존의 파일 시스템에서 파일의 일부를 수정했을 경우 수정된 위치 이후의 모든 블록이 수정되는 문제점을 개선하고자 가변 길이 블록 파일 시스템을 제안한다. 가변 길이 블록 파일 시스템은 파일 수정 시 수정이 발생한 데이터 블록만 새로 저장하고 나머지 블록의 상태는 유지함으로써 파일의 쓰기 연산을 최소화시킨다. 제안된 시스템을 사용할 경우 파일 수정 시 기존 파일 시스템보다 빠른 속도로 파일의 내용을 변경 시킬 수 있으며, 특히 대용량 파일에서 우수한 성능을 보인다.

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.

Variable Cut-off Frequency and Variable Sample Rate Small-Area Multi-Channel Digital Filter for Telemetry System (텔레메트리 시스템을 위한 가변 컷 오프 주파수 및 가변 샘플 레이트 저면적 다채널 디지털 필터 설계)

  • Kim, Ho-keun;Kim, Jong-guk;Kim, Bok-ki;Lee, Nam-sik
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.5
    • /
    • pp.363-369
    • /
    • 2021
  • In this paper, We propose variable cut-off frequency and variable sample rate small-area multi-channel digital filter for telemetry system. Proposed digital filter reduced hardware area by implementing filter banks that can variably use cut-off frequency and sample rate without additional filter banks for an arbitrary cut ratio. In addition, We propose the architecture in which sample rate can variably be selected according to the number of filters that pass through the multiplexer control. By using time division multiplexing (TDM) supported by the finite impulse response (FIR) intellectual property (IP) of Quartus, the proposed digital filter can greatly reduce digital signal processing (DSP) blocks from 80 to 1 compared without TDM. Proposed digital filter calculated order and coefficients using Kaiser window function in Matlab, and implemented using very high speed integrated circuits hardware descryption language (VHDL). After applying to the telemetry system, we confirmed that the proposed digital filter was operating through the experimental results in the test environment.

An Early Termination Algorithm of Prediction Unit (PU) Search for Fast HEVC Encoding (HEVC 고속 부호화를 위한 PU 탐색 조기 종료 기법)

  • Kim, Jae-Wook;Kim, Dong-Hyun;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.627-630
    • /
    • 2014
  • The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

Efficient Hardware Design of Hash Processor Supporting SHA-3 and SHAKE256 Algorithms (SHA-3과 SHAKE256 알고리듬을 지원하는 해쉬 프로세서의 하드웨어 설계)

  • Choi, Byeong-Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.6
    • /
    • pp.1075-1082
    • /
    • 2017
  • This paper describes a design of hash processor which can execute new hash algorithm, SHA-3 and extendable-output function (XOF), SHAKE-256. The processor that consists of padder block, round-core block and output block maximizes its performance by using the block-level pipelining scheme. The padder block formats the variable-length input data into multiple blocks and then round block generates SHA-3 message digest or SHAKE256 result for multiple blocks using on-the-fly round constant generator. The output block finally transfers the result to host processor. The hash processor that is implemented with Xilinx Virtex-5 FPGA can operate up to 220-MHz clock frequency. The estimated maximum throughput is 5.28 Gbps(giga bits per second) for SHA3-512. Because the processor supports both SHA-3 hash algorithm and SHAKE256 algorithm, it can be applicable to cryptographic areas such as data integrity, key generation and random number generation.

Digital Video Scrambling Method using Intra Prediction Mode of H.264 (H.264 인트라 예측 모드를 이용한 디지털 비디오 스크램블링 방법)

  • Ahn Jinhaeng;Jeon Byeungwoo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.2 s.302
    • /
    • pp.59-68
    • /
    • 2005
  • The amount of digitalized contents has been rapidly increased, but the main distribution channel of them is Internet which is easily accessible. Therefore 'security' necessarily arises as one of the most important issues and the method of protecting contents becomes a major research topic as much as data coding techniques. In recent years, many developers have studied on techniques that allow only authorized person to access contents. Among them the scrambling method is one of well-known security techniques. In this paper, we propose a simple and effective digital video scrambling method which utilizes the intra block properties of a recent video coding technique, H.264. Since intra prediction modes are adopted in H.264 standard, it is easy to scramble a video sequence with modification of the intra prediction modes. In addition to its simplicity, the proposed method does not increase bit rate after scrambling. The inter blocks are also distorted by scrambling intra blocks only. This paper introduces a new digital video scrambling method and verifies its effectiveness through simulation.

A Study on the MARC Format for Classification Data (분류용 MARC 포맷에 관한 연구)

  • Oh Dong-Geun
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.33 no.1
    • /
    • pp.87-111
    • /
    • 1999
  • This article investigates the functions, needs, and developments of the MARC format for classification data. and recommends the development for the KORMARC format for classification data. It ae analyzes the record structure, content designation and the content of it mainly based on USMARC format. Structure and content designation are almost same with those of the bibliographic and authority formats. The data fields divided into functional blocks based on their functions. Record contents of the data in the fixed-length fields include more elements on the classification numbers, including type of number, classification validity, standard or optional number, synthesized number. Variable fields can be grouped into several blocks, inducing those for numbers and codes: for classification numbers and terms; for references and tracings; for notes fields: for index terms fields, and for number building fields. Data in each fields of this format have the same contents with those in other related fields as soon as possible. This article analyzes the content in each data fields in detail.

  • PDF

Algorithm for Block Packing of Main Memory Allocation Problem (주기억장치 할당 문제의 블록 채우기 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.99-105
    • /
    • 2022
  • This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

Deterioration Assessment and Conservational Scientific Diagnosis of the Stone Pagoda in the Bunhwangsa temple, Gyeongju, Korea (경주 분황사석탑의 풍화훼손도 평가와 보존과학적 진단)

  • Yi, Jeong-Eun;Lee, Chan-Hee;Lee, Myeong-Seong
    • Journal of Conservation Science
    • /
    • v.18 s.18
    • /
    • pp.19-32
    • /
    • 2006
  • The stone pagoda of the Bunhwangsa temple made by piling small brick-shaped stones. The major rock forming stone bricks are andesites with variable genesis. Rock properties of the pagoda roof stone suffer partly including multiple peel-offs, exfoliation, decomposition like onion peels, cracks forming round lines and falling off stone pieces. The stylobates and tabernacles in all the four directions the pagoda are mostly composed of granitic rocks. Those rock properties are heavily contaminated by lichens and mosses with the often marks of inorganic contamination by secondary hydrates that are dark black or yellowish brown. Within the four tabernacles and northern pagoda body situated to relatively high humidity. There are even light gray precipitate looking like stalactites between the northern and western rocks of the body Their major minerals are calcite, gypsum and clays. The stone lion standing in the southeast and northeast side are alkali granite, while that in the southwest and northwest lithic tuff. Total rock properties of the pagoda are 9,708 pieces, among the all properties, fractured blocks are 11.0%, fall out blocks are 6.7% and covered blocks by precipitates are 7.0%, respectively. The pagoda has highly deteriorated the functions of the rock properties due to physical, chemical and biological weathering, therefore, we suggest that this pagoda has need to do long term monitoring and synthetic conservation researches.

  • PDF