• Title/Summary/Keyword: 3D DCT

Search Result 110, Processing Time 0.022 seconds

P22-Based Challenge Phage Constructs to Study DNA-Protein Interactions between the $\sigma$54-Dependent Promoter, dctA, and Its Transcriptional Regulators

  • Kim, Euhgbin;Kim, Daeyou;Lee, Joon-Haeng
    • Journal of Microbiology
    • /
    • v.38 no.3
    • /
    • pp.176-179
    • /
    • 2000
  • A challenge phage system was used to study the DNA-protein interaction between C4-dicarboxylic acid transport protein D(DCTD) or $\sigma$54, and a $\sigma$54 -dependent promoter, dctAp. R. meliloti dctA promoter regulatory region replaced the Omnt site on the phage. S. typhimurium strains overproducing either DCTD or $\sigma$54 directed this challenge phage towards lysogency, indicating that DCTD or E$\sigma$54 recognized the dctA promoter on the phage and repressed transcription of the ant gene. These challenge phage constructs will be useful for examining interactions between DCTD(or $\sigma$54) and the dctA promoter region.

  • PDF

Image Coding Using DCT and Block Hierarchical Segmentation Finite-State Vector Quantization (DCT와 블록 계층 분할 유한상태 벡터 양자화를 이용한 영상 부호화)

  • Jo, Seong-Hwan;Kim, Eung-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.3
    • /
    • pp.1013-1020
    • /
    • 2000
  • In this paper, we propose an algorithm which segments hierarchically blocks of image using discrete cosine transform(DCT) and execute finite-state vector quantization (FSVQ) for each block. Using DCT coefficient feature, image is segmented hierarchically to large smooth block and small edge block, then the block hierarchy informations are transmitted. The codebooks are respectively constructed for each hierarchical blocks, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation. Compared with side match VQ(SMVQ) and hierarchical FSVQ(HFSVQ) algorithm, about Zelda and Boat image, the new algorithm shows better picture quality with 1.97dB and 2.85 dB difference as to SMVQ, 1.78dB and 1.85dB diffences as to HFSVQ respectively.

  • PDF

Development of Shift Map for TMED Type DCT PHEV in Charge Sustaining Mode considering Transmission and Motor Losses (변속기 및 모터 손실을 고려한 TMED Type DCT PHEV의 CS 모드 주행 시 변속맵 개발)

  • Jeon, Sungbae;Bae, Kyunggook;Wi, Junbeom;Namkoong, Choul;Goo, Changgi;Lee, Ji-suk;Hwang, Sung-Ho;Kim, Hyunsoo
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.25 no.3
    • /
    • pp.367-373
    • /
    • 2017
  • In this paper, a new shift map was proposed to improve the fuel economy of a transmission mounted electric device(TMED) type dual clutch transmission(DCT) plug-in hybrid electric vehicle(PHEV) by considering transmission and motor losses. To construct the shift map, powertrain efficiencies of the engine-DCT-motor were obtained at each gear step. A shift map that provides the highest powertrain efficiency was constructed for the given wheel torque and vehicle speed. Simulation results showed that the fuel economy of the target PHEV can be improved by the new shift map compared with the existing engine optimal operating line(OOL) shift control.

Watermarking of 3D Mesh Model using DCT of Distances between Vertices (정점간 거리의 DCT를 이용한 3차원 메쉬 모델 워터마킹)

  • Kim Sung-Jun;Kim Jeong-Yeop;Hyun Ki-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.11a
    • /
    • pp.875-878
    • /
    • 2004
  • 본 논문은 3차원 메쉬 모델의 정점간 거리 및 DCT를 이용한 3차원 메쉬 모델 워터마킹 방법을 제안한다. 제안한 방법은 3차원 메쉬 모델의 임의의 정점간 거리를 이용하여 워터마킹하게 되며 삽입 시 임의의 정점간 거리집합을 DCT 변환 하여 그 계수 값에 워터마크가 삽입된다. 그러므로 정점간의 거리를 DCT변환하여 삽입함으로써 비지각성 및 여러 공격에 강인하다. 또한 워터마크 크기만큼의 여러 거리집합을 생성하여 사용함으로 지역패치 및 지역분할 개념으로써 부분적인 공격에 강인하며 3차원 메쉬 모델의 페이스모양에 상관없이 워터마크를 삽입 할 수 있다.

  • PDF

Method of Harmonic Magnitude Quantization for Harmonic Coder Using the Straight Line and DCT (Discrete Cosine Transform) (하모닉 코더를 위한 직선과 이산코사인변환 (DCT)을 이용한 하모닉 크기값 (Magnitude) 양자화 기법)

  • Choi, Ji-Wook;Jeong, Gyu-Hyeok;Lee, In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.4
    • /
    • pp.200-206
    • /
    • 2008
  • This paper presents a method of quantization to extract quantization parameters using the straight-line and DCT (Discrete Cosine Transform) for two splited frequency bands. As the number of harmonic is variable frame to frame, harmonics in low frequency band is oversampled to fix the dimension and straight-lines present a spectral envelope, then the discontinuous points of straight-lines in low frequency is sent to quantizer. Thus, extraction of quantization parameters using the straight-line provides a fixed dimension. Harmonics in high frequency use variable DCT to obtain quantization parameters and this paper proposes a method of quantization combining the straight-line with DCT. The measurement (If proposed method of quantization uses spectral distortion (SD) for spectral magnitudes. As a result, The proposed method of quantization improved 0.3dB in term of SD better than HVXC.

A Study on Fast 2-D DCT Using Hadamard Transform (Hadamard 변환을 이용한 고속 2차원 DCT에 관한 연구)

  • 전중남;최원호;최성남;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.3
    • /
    • pp.221-231
    • /
    • 1990
  • In this paper, A new 2-D DCT algorithm is proposed to reduce the computational amount of transform operation using the distribution of the motion compensated error signal and the bit allocation table. In the this algorithm, 2-D Walsh-Hadamard transform is directly computed and then multiplied by a constant matrix. Multiplications are concentrated on the final stage in thie algorithm, thus the computational amount is reduced in proportion to the number of transform coefficients that are excluded from quatization. The computational amount in computing only the DCT coefficients allocated to the bit allocation table is calculated. As the result, the number of multiplications is less thn the algorithm known to have the fewest number of computations when less than 0.6 bits per pixel are allocated to tranform coding for the motion compensated error image in the case of the proposed algorithm. Thus, it shows that the proposed algorithm is valid in reducing the computational loads of transform coding.

  • PDF

A VLSI Implementation of Real-time 8$\times$8 2-D DCT Processor for the Subprimary Rate Video Codec (저 전송률 비디오 코덱용 실시간 8$\times$8 이차원 DCT 처리기의 VLSI 구현)

  • 권용무;김형곤
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.1
    • /
    • pp.58-70
    • /
    • 1990
  • This paper describes a VLSI implementation of real-time two dimensional DCT processor for the subprimary rate video codec system. The proposed architecture exploits the parallelism and concurrency of the distributes architecture for vector inner product operation of DCT and meets the CCITT performance requirements of video codec for full CSIF 30 frames/sec. It is also shown that this architecture satisfies all the CCITT IDCT accuracy specification by simulating the suggested architecture in bit level. The efficient VLSI disign methodology to design suggested architecture is considered and the module generator oriented design environments are constructed based on SUN 3/150C workstation. Using the constructed design environments. the suggensted architecture have been designed by double metal 2micron CMOS technology. The chip area fo designed 8x8 2-D DA-DCT (Distributed Arithmetic DCT) processor is about 3.9mmx4.8mm.

  • PDF

Age Invariant Face Recognition Based on DCT Feature Extraction and Kernel Fisher Analysis

  • Boussaad, Leila;Benmohammed, Mohamed;Benzid, Redha
    • Journal of Information Processing Systems
    • /
    • v.12 no.3
    • /
    • pp.392-409
    • /
    • 2016
  • The aim of this paper is to examine the effectiveness of combining three popular tools used in pattern recognition, which are the Active Appearance Model (AAM), the two-dimensional discrete cosine transform (2D-DCT), and Kernel Fisher Analysis (KFA), for face recognition across age variations. For this purpose, we first used AAM to generate an AAM-based face representation; then, we applied 2D-DCT to get the descriptor of the image; and finally, we used a multiclass KFA for dimension reduction. Classification was made through a K-nearest neighbor classifier, based on Euclidean distance. Our experimental results on face images, which were obtained from the publicly available FG-NET face database, showed that the proposed descriptor worked satisfactorily for both face identification and verification across age progression.

Analysis of CGH and Watermarking Method using Global 2DDCT (전역 2차원 DCT를 이용한 디지털 홀로그램의 분석 및 워터마킹 기법)

  • Choi, Hyun-Jun;Seo, Young-Ho;Yoo, Ji-Sang;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.7
    • /
    • pp.1267-1274
    • /
    • 2007
  • In this paper, we propose a digital watermarking algorithm for digital hologram generated by computer generated hologram(CGH) method. Digital hologram generated by a computer calculation(CGH) is one of the most expensive contents and its usage is being expanded. Thus, it is highly necessary to protect the ownership of digital hologram. In this paper two digital watermarking schemes are introduced hologram-domain and global 2DDCT-domain scheme. Proposed watermarking scheme showed very high imperceptibility and quite high robustness against the attacks. The purpose of this paper is to introduce these global 2DDCT based watermarking schemes. Thus, we expect that these and the contents in this paper can be very useful bases for the further digital watermarking schemes of the digital holograms.

Selective Encryption Algorithm for 3D Printing Model Based on Clustering and DCT Domain

  • Pham, Giao N.;Kwon, Ki-Ryong;Lee, Eung-Joo;Lee, Suk-Hwan
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.4
    • /
    • pp.152-159
    • /
    • 2017
  • Three-dimensional (3D) printing is applied to many areas of life, but 3D printing models are stolen by pirates and distributed without any permission from the original providers. Moreover, some special models and anti-weapon models in 3D printing must be secured from the unauthorized user. Therefore, 3D printing models must be encrypted before being stored and transmitted to ensure access and to prevent illegal copying. This paper presents a selective encryption algorithm for 3D printing models based on clustering and the frequency domain of discrete cosine transform. All facets are extracted from 3D printing model, divided into groups by the clustering algorithm, and all vertices of facets in each group are transformed to the frequency domain of a discrete cosine transform. The proposed algorithm is based on encrypting the selected coefficients in the frequency domain of discrete cosine transform to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The decrypting error is approximated to be zero. The proposed algorithm provides a better method and more security than previous methods.