• Title/Summary/Keyword: Encoding Schemes

Search Result 83, Processing Time 0.027 seconds

Novel Image Stabilizing Techniques toy Mobile Video Communications

  • Kang, Byoung-Su;Kim, Jae-Won;Lee, Jun-Suk;Park, kang-Sun;Ko, Sung-Jea
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.433-436
    • /
    • 2000
  • In this paper, we present two types of digital image stabilization (DIS) schemes for mobile video communications. In the first scheme, the DIS system, which is used as a preprocessor of the video encoder, compensates the camera’s undesirable shakes before encoding. This method can reduce the bit rate of encoded video sequence by attenuating the prediction error to be encoded. In the second proposed scheme, the DIS system is coupled with the video decoder. The second scheme uses the K-means clustering algorithm to estimate the camera motion using motion vectors decoded from the received video stream. Simulation results show that the first scheme improves coding efficiency, while the second scheme is computationally efficient since it does not require motion estimation.

  • PDF

Fast Codebook Search Algorithm for VQ of Subband Images (서브밴드 영상의 VQ를 위한 고속 코드북 탐색 알고리즘)

  • Hwang, Jae-Ho;Hong, Choong-Seon;Lee, Dae-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.883-886
    • /
    • 2000
  • Two fast search algorithms are proposed for VQ encoding in subband/VQ coding schemes. These algorithms exploit the property of the transform domain that the large coefficients rarely exist in the decomposed subbands. And the exit condition of PDE algorithm can be satisfied by comparing the large values of the codeword with the corresponding ones of the input vector. The computational complexity can be reduced at the expense of memories without extra coding errors.

  • PDF

Optical Look-ahead Carry Full-adder Using Dual-rail Coding

  • Gil Sang Keun
    • Journal of the Optical Society of Korea
    • /
    • v.9 no.3
    • /
    • pp.111-118
    • /
    • 2005
  • In this paper, a new optical parallel binary arithmetic processor (OPBAP) capable of computing arbitrary n-bit look-ahead carry full-addition is proposed and implemented. The conventional Boolean algebra is considered to implement OPBAP by using two schemes of optical logic processor. One is space-variant optical logic gate processor (SVOLGP), the other is shadow-casting optical logic array processor (SCOLAP). SVOLGP can process logical AND and OR operations different in space simultaneously by using free-space interconnection logic filters, while SCOLAP can perform any possible 16 Boolean logic function by using spatial instruction-control filter. A dual-rail encoding method is adopted because the complement of an input is needed in arithmetic process. Experiment on OPBAP for an 8-bit look-ahead carry full addition is performed. The experimental results have shown that the proposed OPBAP has a capability of optical look-ahead carry full-addition with high computing speed regardless of the data length.

Traceable Ciphertet-Policy Attribute-Based Encryption with Constant Decryption

  • Wang, Guangbo;Li, Feng;Wang, Pengcheng;Hu, Yixiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3401-3420
    • /
    • 2021
  • We provide a traceable ciphertext-policy attribute based encryption (CP-ABE) construction for monotone access structures (MAS) based on composite order bilinear groups, which is secure adaptively under the standard model. We construct this scheme by making use of an "encoding technique" which represents the MAS by their minimal sets to encrypt the messages. To date, for all traceable CP-ABE schemes, their encryption costs grow linearly with the MAS size, the decryption costs grow linearly with the qualified rows in the span programs. However, in our traceable CP-ABE, the ciphertext is linear with the minimal sets, and decryption needs merely three bilinear pairing computations and two exponent computations, which improves the efficiency extremely and has constant decryption. At last, the detailed security and traceability proof is given.

Wheel Screen Type Lamina 3D Display System with Enhanced Resolution

  • Baek, Hogil;Kim, Hyunho;Park, Sungwoong;Choi, Hee-Jin;Min, Sung-Wook
    • Current Optics and Photonics
    • /
    • v.5 no.1
    • /
    • pp.23-31
    • /
    • 2021
  • We propose a wheel screen type Lamina 3D display, which realizes a 3D image that can satisfy the accommodation cue by projecting volumetric images encoded by varying polarization states to a multilayered screen. The proposed system is composed of two parts: an encoding part that converts depth information to states of polarization and a decoding part that projects depth images to the corresponded diffusing layer. Though the basic principle of Lamina displays has already been verified by previous studies, those schemes suffered from a bottleneck of inferior resolution of the 3D image due to the blurring on the surfaces of diffusing layers in the stacked volume. In this paper, we propose a new structure to implement the decoding part by adopting a form of the wheel screen. Experimental verification is also provided to support the proposed principle.

Performance Evaluation of Channel Estimation Scheme for ATSC 3.0 MIMO under Fixed Reception Environment (고정 수신 환경에서 ATSC 3.0 MIMO의 채널 추정 방법에 따른 성능 평가)

  • Kim, Hyeongseok;Yeom, Myeonggil;Kim, Jeongchang;Park, Sung-Ik;Jung, Hoiyoon;Hur, Namho
    • Journal of Broadcast Engineering
    • /
    • v.24 no.5
    • /
    • pp.879-891
    • /
    • 2019
  • This paper provides performance evaluations of various channel estimation schemes for Advanced Television Systems Committee (ATSC) 3.0 multiple-input multiple-output (MIMO) system under a fixed reception environment. ATSC 3.0 MIMO system can obtain high spectral efficiency and improved reception performance compared to conventional terrestrial broadcasting systems. The ATSC 3.0 MIMO defines Walsh-Hadamard and null pilot encoding algorithms and the amplitude and phase of MIMO pilots are different from those of single-input single-output pilots. At the receiver, linear and discrete Fourier transform (DFT)-based interpolations can be used for the channel estimation. This paper provides the various combinations of the interpolation schemes for channel estimation in time and frequency dimensions, and then analyzes the performance of the various combinations through the computer simulation. The results of computer simulation show that the combination of the linear interpolation in the time dimension and then DFT-based interpolation in the frequency dimension can obtain the best performance among the considered combinations.

Communication-Efficient Representations for Certificate Revocation in Wireless Sensor Network (WSN에서의 효율적 통신을 위한 인증서 폐지 목록 표현 기법)

  • Maeng, Young-Jae;Mohaisen, Abedelaziz;Lee, Kyung-Hee;Nyang, Dae-Hun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.553-558
    • /
    • 2007
  • In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys' identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.

Video Content-Based Bit Rate Estimation (비디오 콘텐츠 기반 비트율 예측)

  • Huang, Fei;Lee, Jaeyong;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.297-310
    • /
    • 2013
  • In this paper, we present a model-based video bit rate estimation scheme for reducing the bit rate while maintaining a subjective quality in many video streaming services limited by network bandwidth, such as IPTV services. First, we extract major parameters which serve as an indirect measurement of frame's bits. Using those parameters, the proposed bit rate estimation scheme can extract candidate frames. Finally, the bit rate of each segment is estimated by statistical analysis and a mathematical model based on a given target quality. In experimental results, we show that the proposed scheme can reduce the bit rate on average by 43% in low-complexity video while maintaining the subjective quality. To find the appropriate bit rate based on video contents, the proposed schemes can estimate the bit rate with neither the repeated full encoding nor subjective quality test. On average, the bit rate can be automatically estimated by encoding the candidate frames of 4%.

Optimized Global Path Planning of a Mobile Robot Using uDEAS (uDEAS를 이용한 이동 로봇의 최적 전역 경로 계획)

  • Kim, Jo-Hwan;Kim, Man-Seok;Choi, Min-Koo;Kim, Jong-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.2
    • /
    • pp.268-275
    • /
    • 2011
  • This paper proposes two optimal path planning methods of a mobile robot using uDEAS (univariate Dynamic Encoding Algorithm for Searches). Before start of autonomous traveling, a self-controlled mobile robot must generate an optimal global path as soon as possible. To this end, numerical optimization method is applied to real time path generation of a mobile robot with an obstacle avoidance scheme and the basic path generation method based on the concept of knot and node points between start and goal points. The first improvement in the present work is to generate diagonal paths using three node points in the basic path. The second innovation is to make a smooth path plotted with the blending polynomial using uDEAS. Effectiveness of the proposed schemes are validated for several environments through simulation.

A Study on Analyzing the Features of 2019 Revised RDA (2019 개정 RDA 특징 분석에 관한 연구)

  • Lee, Mihwa
    • Journal of Korean Library and Information Science Society
    • /
    • v.50 no.3
    • /
    • pp.97-116
    • /
    • 2019
  • This study is to analyze the characteristics of 2019 revised RDA and suggest the consideration in aspects of cataloging using the literature reviews. The following 3 things are suggested with analyzing the revised RDA. First, high quality data such as supplementing cataloging data and constructing vocabulary encoding schemes should be needed to transform bibliographic data to linked data for the semantic web. Second, MARC should be expanded to accept the new conept of LRM and linked data being reflected in revised RDA because MARC is the unique encoding format untile linked data will be transformed from MARC data. Third, the policy statement and the application profile are needed for describing resource consistently because each entity and element has own condition and option, and there are different elements for applying rules in revised RDA. Based on this study, the RDA related researches should be in progress such as exapanding BIBFRAME as well as MARC to accept the new concepts in revised RDA, and, also, reflecting and accepting RDA being able to use revised RDA rules and registries in libraries and nations that have been faced to revise their own cataloging rules.