DctNormalization.java

  1. /*
  2.  * Licensed to the Apache Software Foundation (ASF) under one or more
  3.  * contributor license agreements.  See the NOTICE file distributed with
  4.  * this work for additional information regarding copyright ownership.
  5.  * The ASF licenses this file to You under the Apache License, Version 2.0
  6.  * (the "License"); you may not use this file except in compliance with
  7.  * the License.  You may obtain a copy of the License at
  8.  *
  9.  *      https://www.apache.org/licenses/LICENSE-2.0
  10.  *
  11.  * Unless required by applicable law or agreed to in writing, software
  12.  * distributed under the License is distributed on an "AS IS" BASIS,
  13.  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14.  * See the License for the specific language governing permissions and
  15.  * limitations under the License.
  16.  */

  17. /*
  18.  * This is not the original file distributed by the Apache Software Foundation
  19.  * It has been modified by the Hipparchus project
  20.  */
  21. package org.hipparchus.transform;

  22. /**
  23.  * This enumeration defines the various types of normalizations that can be
  24.  * applied to discrete cosine transforms (DCT). The exact definition of these
  25.  * normalizations is detailed below.
  26.  *
  27.  * @see FastCosineTransformer
  28.  */
  29. public enum DctNormalization {
  30.     /**
  31.      * Should be passed to the constructor of {@link FastCosineTransformer}
  32.      * to use the <em>standard</em> normalization convention.  The standard
  33.      * DCT-I normalization convention is defined as follows
  34.      * <ul>
  35.      * <li>forward transform:
  36.      * y<sub>n</sub> = (1/2) [x<sub>0</sub> + (-1)<sup>n</sup>x<sub>N-1</sub>]
  37.      * + &sum;<sub>k=1</sub><sup>N-2</sup>
  38.      * x<sub>k</sub> cos[&pi; nk / (N - 1)],</li>
  39.      * <li>inverse transform:
  40.      * x<sub>k</sub> = [1 / (N - 1)] [y<sub>0</sub>
  41.      * + (-1)<sup>k</sup>y<sub>N-1</sub>]
  42.      * + [2 / (N - 1)] &sum;<sub>n=1</sub><sup>N-2</sup>
  43.      * y<sub>n</sub> cos[&pi; nk / (N - 1)],</li>
  44.      * </ul>
  45.      * where N is the size of the data sample.
  46.      */
  47.     STANDARD_DCT_I,

  48.     /**
  49.      * Should be passed to the constructor of {@link FastCosineTransformer}
  50.      * to use the <em>orthogonal</em> normalization convention. The orthogonal
  51.      * DCT-I normalization convention is defined as follows
  52.      * <ul>
  53.      * <li>forward transform:
  54.      * y<sub>n</sub> = [2(N - 1)]<sup>-1/2</sup> [x<sub>0</sub>
  55.      * + (-1)<sup>n</sup>x<sub>N-1</sub>]
  56.      * + [2 / (N - 1)]<sup>1/2</sup> &sum;<sub>k=1</sub><sup>N-2</sup>
  57.      * x<sub>k</sub> cos[&pi; nk / (N - 1)],</li>
  58.      * <li>inverse transform:
  59.      * x<sub>k</sub> = [2(N - 1)]<sup>-1/2</sup> [y<sub>0</sub>
  60.      * + (-1)<sup>k</sup>y<sub>N-1</sub>]
  61.      * + [2 / (N - 1)]<sup>1/2</sup> &sum;<sub>n=1</sub><sup>N-2</sup>
  62.      * y<sub>n</sub> cos[&pi; nk / (N - 1)],</li>
  63.      * </ul>
  64.      * which makes the transform orthogonal. N is the size of the data sample.
  65.      */
  66.     ORTHOGONAL_DCT_I
  67. }