• Title/Summary/Keyword: coding sequences

Search Result 578, Processing Time 0.027 seconds

Data hiding in partially encrypted HEVC video

  • Xu, Dawen
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.446-458
    • /
    • 2020
  • In this study, an efficient scheme for hiding data directly in partially encrypted versions of high efficiency video coding (HEVC) videos is proposed. The content owner uses stream cipher to selectively encrypt some HEVC-CABAC bin strings in a format-compliant manner. Then, the data hider embeds the secret message into the encrypted HEVC videos using the specific coefficient modification technique. Consequently, it can be used in third-party computing environments (more generally, cloud computing). For security and privacy purposes, service providers cannot access the visual content of the host video. As the coefficient is only slightly modified, the quality of the decrypted video is satisfactory. The encrypted and marked bitstreams meet the requirements of format compatibility, and have the same bit rate. At the receiving end, data extraction can be performed in the encrypted domain or decrypted domain that can be adapted to different application scenarios. Several standard video sequences with different resolutions and contents have been used for experimental evaluation.

A Video Coding Scheme for Reconstructing an Interest Region with High Quality

  • Lee, Jong-Bae-;Kim, Seong-Dae
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.2
    • /
    • pp.222-229
    • /
    • 1998
  • In the circumstances we want to deal with, a transmission channel is limited and a global motion can happen by camera movement, and also there exists a region-of-interest(ROI) which is more important than background. So very low bit rate coding algorithm is required and processing of global motion must be considered. Also ROI must be reconstructed with required quality after decoding because of its importance. But the existing methods such as H.261, H.263 can not reconstruct ROIs with high quality because they do not consider the fact that ROIs are more important than background. So a new coding scheme is proposed that describes a method for encoding image sequences distinguishing bits between ROI and background. Experimental results show that the suggested algorithm performs well especially in the circumstances where background changes and the area of ROI is small enough compared with that of background.

  • PDF

Highly Efficient Video Codec for Entertainment-Quality

  • Jeong, Se-Yoon;Lim, Sung-Chang;Lee, Ha-Hyun;Kim, Jong-Ho;Choi, Jin-Soo;Choi, Hae-Chul
    • ETRI Journal
    • /
    • v.33 no.2
    • /
    • pp.145-154
    • /
    • 2011
  • We present a novel video codec for supporting entertainment-quality video. It has new coding tools such as an intra prediction with offset, integer sine transform, and enhanced block-based adaptive loop filter. These tools are used adaptively in the processing of intra prediction, transform, and loop filtering. In our experiments, the proposed codec achieved an average reduction of 13.35% in BD-rate relative to H.264/AVC for 720p sequences.

Region-based H.263 Video Codec with Effective Rate Control Algorithm for Low VBR Video

  • Song, Hwangjun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1755-1766
    • /
    • 1999
  • A region-based video codec based on the H.263+ standard is examined and its associated novel rate control scheme is proposed in this work. The region-based coding scheme is a hybrid method that consists of the traditional block DCT coding and the object-based coding. Basically, we adopt H.263+ as the platform, and develop a fast macroblock-based segmentation method to implement the region-based video codec. The proposed rate control solution includes rate control in three levels: encoding frame selection, frame-layer rate control and macroblock-layer rate control. The goal is to enhance the visual quality of decoded frames at low bit rates. The efficiency of proposed rate control scheme applied to the region-based video codes is demonstrated via several typical test sequences.

  • PDF

Cardio-Angiographic Sequence Coding Using Neural Network Adaptive Vector Quantization (신격회로망 적응 VQ를 이용한 심장 조영상 부호화)

  • 주창희;최종수
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.4
    • /
    • pp.374-381
    • /
    • 1991
  • As a diagnostic image of hospitl, the utilization of digital image is steadily increasing. Image coding is indispensable for storing and compressing an enormous amount of diagnostic images economically and effectively. In this paper adaptive two stage vector quantization based on Kohonen's neural network for the compression of cardioangiography among typical angiography of radiographic image sequences is presented and the performance of the coding scheme is compare and gone over. In an attempt to exploit the known characteristics of changes in cardioangiography, relatively large blocks of image are quantized in the first stage and in the next stage the bloks subdivided by the threshold of quantization error are vector quantized employing the neural network of frequency sensitive competitive learning. The scheme is employed because the change produced in cardioangiography is due to such two types of motion as a heart itself and body motion, and a contrast dye material injected. Computer simulation shows that the good reproduction of images can be obtained at a bit rate of 0.78 bits/pixel.

  • PDF

ORF Miner: a Web-based ORF Search Tool

  • Park, Sin-Gi;Kim, Ki-Bong
    • Genomics & Informatics
    • /
    • v.7 no.4
    • /
    • pp.217-219
    • /
    • 2009
  • The primary clue for locating protein-coding regions is the open reading frame and the determination of ORFs (Open Reading Frames) is the first step toward the gene prediction, especially for prokaryotes. In this respect, we have developed a web-based ORF search tool called ORF Miner. The ORF Miner is a graphical analysis utility which determines all possible open reading frames of a selectable minimum size in an input sequence. This tool identifies all open reading frames using alternative genetic codes as well as the standard one and reports a list of ORFs with corresponding deduced amino acid sequences. The ORF Miner can be employed for sequence annotation and give a crucial clue to determination of actual protein-coding regions.

A fractal coding technique for color image sequence employing non-contractive interframe mapping (비축소 프레임간 변환을 이용한 컬러 동영상 프랙탈 부호화 기법)

  • 김창수;김인철;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.8
    • /
    • pp.1707-1714
    • /
    • 1997
  • This paper proposes a novel algorithm for fractal coding of image sequence, based on the CPM (Circular Prediction Mapping) and the NCIM (Non Contractive Interframe Mapping). In the CPM and the NCIM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Also, in this paepr, we propose a coding scheme of color components and an algorithm for controlling the bit rate, resepectively, for practical implementation of the fractal coder. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, below 256 Kbps.

  • PDF

Survey on Nucleotide Encoding Techniques and SVM Kernel Design for Human Splice Site Prediction

  • Bari, A.T.M. Golam;Reaz, Mst. Rokeya;Choi, Ho-Jin;Jeong, Byeong-Soo
    • Interdisciplinary Bio Central
    • /
    • v.4 no.4
    • /
    • pp.14.1-14.6
    • /
    • 2012
  • Splice site prediction in DNA sequence is a basic search problem for finding exon/intron and intron/exon boundaries. Removing introns and then joining the exons together forms the mRNA sequence. These sequences are the input of the translation process. It is a necessary step in the central dogma of molecular biology. The main task of splice site prediction is to find out the exact GT and AG ended sequences. Then it identifies the true and false GT and AG ended sequences among those candidate sequences. In this paper, we survey research works on splice site prediction based on support vector machine (SVM). The basic difference between these research works is nucleotide encoding technique and SVM kernel selection. Some methods encode the DNA sequence in a sparse way whereas others encode in a probabilistic manner. The encoded sequences serve as input of SVM. The task of SVM is to classify them using its learning model. The accuracy of classification largely depends on the proper kernel selection for sequence data as well as a selection of kernel parameter. We observe each encoding technique and classify them according to their similarity. Then we discuss about kernel and their parameter selection. Our survey paper provides a basic understanding of encoding approaches and proper kernel selection of SVM for splice site prediction.

Phylogenetic Analysis of Pines Based on Chloroplast trnT-trnL Intergenic Spacer DNA Sequences

  • Um, Yurry;Park, Won-Kyu;Jo, Nam-Su;Han, Sim-Hee;Lee, Yi
    • Journal of Forest and Environmental Science
    • /
    • v.30 no.3
    • /
    • pp.307-313
    • /
    • 2014
  • This study was conducted to distinguish the pines that are too similar to differentiate using conventional methods. Pinus densiflora and Pinus sylvestris have similar anatomical structure. They both have window-like pits and dentate ray tracheids, so it is not easy to distinguish the plants. We tried to find molecular markers by comparing chloroplast DNA sequences to differentiate the pines growing in Korea. We used P. densiflora, P. densiflora for. multicaulis, P. sylvestris, P. rigida, P. rigitaeda, P. koraiensis, and P. bungeana for this study. We found that the non-coding intergenic region of trnT(UGU) and trnL(UAA) genes have differences among the species. We designed a primer set to amplify the region efficiently and compared the PCR product sequences using CLC Workbench programs to find the polymorphism. We could distinguish the species using the sequences of the amplified region and the sequences were reproducible from the pines collected in Korea.

A Study on Parallel Processing System for Automatic Segmentation of Moving Object in Image Sequences

  • Lee, Hyung;Park, Jong-Won
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.429-432
    • /
    • 2000
  • The new MPEG-4 video coding standard enables content-based functionalities. In order to support the philosophy of the MPEG-4 visual standard, each frame of video sequences should be represented in terms of video object planes (VOP’s). In other words, video objects to be encoded in still pictures or video sequences should be prepared before the encoding process starts. Therefore, it requires a prior decomposition of sequences into VOP’s so that each VOP represents a moving object. A parallel processing system is required an automatic segmentation to be processed in real-time, because an automatic segmentation is time consuming. This paper addresses the parallel processing: system for an automatic segmentation for separating moving object from the background in image sequences. The proposed parallel processing system comprises of processing elements (PE’s) and a multi-access memory system (MAMS). Multi-access memory system is a memory controller to perform parallel memory access with the variety of types: horizontal, vertical, and block access way. In order to realize these ways, a multi-access memory system consists of a memory module selection module, data routing modules, and an address calculation and routing module. The proposed system is simulated and evaluated by the CADENCE Verilog-XL hardware simulation package.

  • PDF