• Title/Summary/Keyword: Orthogonality of transforms

Search Result 4, Processing Time 0.021 seconds

I.A New Family of Orthogonl Transforms: Derivation based on the Parametric Sinusoidal Matrix (I. 새로운 직교 변환군 : 매개변수형 삼각함수 행렬에 의한 유도)

  • Park, Tae-Young
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.1
    • /
    • pp.159-166
    • /
    • 1987
  • A new family of sinusoidal orthogoal trnasform is introduced. For a derivation, a parametric sinusoidal matrix whose transform might be implemented by a suitable FFT algorithm is modeled basically on the analogy of well-known sinusoidal transform such as DCT,SCT, etc., and its orthogonality condition is calculated. The parameters satisfying orthogonality condition are determined, in a sense, by particular solution after trial and error. However more than then transform matrices not yet known are obtained. It is also shown that these transforms can be computed by a DFT. of an image.

  • PDF

Development of Adaptive Digital Image Watermarking Techniques (적응형 영상 워터마킹 알고리즘 개발)

  • Min, Jun-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1112-1119
    • /
    • 1999
  • Digital watermarking is to embed imperceptible mark into image, video, audio and text data to prevent the illegal copy of multimedia data, arbitrary modification, and also illegal sales of the copes without agreement of copyright ownership. The DCT(discrete Cosine Transforms) transforms of original image is conducted in this research and these DCT coefficients are expanded by Fourier series expansion algorithm. In order to embed the imperceptible and robust watermark, the Fourier coefficients(lower frequency coefficients) can be calculated using sine and cosine function which have a complete orthogonal basis function, and the watermark is embedded into these coefficients, In the experiment, we can show robustness with respect to image distortion such as JPEG compression, bluring and adding uniform noise. The correlation coefficient are in the range from 0.5467 to 0.9507.

  • PDF

An Orthogonal Approximate DCT for Fast Image Compression (고속 영상 압축을 위한 근사 이산 코사인 변환)

  • Kim, Seehyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2403-2408
    • /
    • 2015
  • For image data the discrete cosine transform (DCT) has comparable energy compaction capability to Karhunen-Loeve transform (KLT) which is optimal. Hence DCT has been widely accepted in various image and video compression standard such as JPEG, MPEG-2, and MPEG-4. Recently some approximate DCT's have been reported, which can be computed much faster than the original DCT because their coefficients are either zero or the power of 2. Although the level of energy compaction is slightly degraded, the approximate DCT's can be utilized in real time implementation of image or visual compression applications. In this paper, an approximate 8-point DCT which contains 17 non-zero power-of-2 coefficients and high energy compaction capability comparable to DCT is proposed. Transform coding experiments with several images show that the proposed transform outperforms the published works.

Transforming an Entity-Relationship Model into a Temporal Object Oriented Model Based on Object Versioning (객체 버전화를 중심으로 시간지원 개체-관계 모델의 시간지원 객체 지향 모델로 변환)

  • 이홍로
    • Journal of Internet Computing and Services
    • /
    • v.2 no.2
    • /
    • pp.71-93
    • /
    • 2001
  • Commonly to design a database system. a conceptual database has to be designed and then it is transformed into a logical database schema prior to building a target database system. This paper proposes a method which transforms a Temporal Entity-Relationship Model(TERM) into a Temporal Object-Oriented Model(TOOM) to build an efficient database schema. I formalize the time concept in view of object versioning and specify the constraints required during transformation procedure. The proposed transformation method contributes to getting the logical temporal data from the conceptual temporal events Without any loss of semantics, Compared to other approaches of supporting various properties, this approach is more general and efficient because it is the semantically seamless transformation method by using the orthogonality of types of objects, semantics of relationships and constraints over roles.

  • PDF