Here you can find the source of normalise(double[] A)
Parameter | Description |
---|---|
A | the a |
public static void normalise(double[] A)
//package com.java2s; /*//from w w w . j a v a 2 s . c o m * This file is part of TiPi (a Toolkit for Inverse Problems and Imaging) * developed by the MitiV project. * * Copyright (c) 2014 the MiTiV project, http://mitiv.univ-lyon1.fr/ * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. */ public class Main { /** * Scale array values into a 8bit (between 0 and 255). * * @param A the a */ public static void normalise(double[] A) { int L = A.length; double N = sum(abs2(A, 0)); for (int i = 0; i < L; i++) { A[i] = A[i] / N; } } /** * Sum of the values in the array */ public static double sum(double a[]) { int size = a.length; double sum = 0; for (int i = 0; i < size; i++) { sum += a[i]; } return sum; } /** * Sum of the values in the array */ public static double sum(double a[], int begin, int end) { double sum = 0; for (int i = begin; i <= end; i++) { sum += a[i]; } return sum; } /** * Sum of the values in the array */ public static long sum(long array[]) { int size = array.length; long sum = 0; for (int i = 0; i < size; i++) { sum += array[i]; } return sum; } /** * Sum of the values in the array */ public static double sum(double array[][]) { int H = array.length; double sum = 0; for (int i = 0; i < H; i++) { sum += sum(array[i]); } return sum; } /** * Sum of the values in the array */ public static double sum(double array[][][]) { int D = array.length; double sum = 0; for (int k = 0; k < D; k++) { sum += sum(array[k]); } return sum; } /** * Returns the squared absolute value of a 2d array (complex). * * @param IN array * @return square absolute value. */ public static double[][] abs2(double[][] IN) { int H = IN.length; int W = IN[0].length / 2; double[][] OUT = new double[H][W]; for (int i = 0; i < H; i++) { OUT[i] = abs2(IN[i], 1); } return OUT; } /** * Returns the squared absolute value of 1d array. * * @param IN array * @return square absolute value. */ public static double[] abs2(double[] x, int isComplex) { if (isComplex == 1) { int L = x.length / 2; double[] y = new double[L]; for (int i = 0; i < L; i++) { y[i] = x[2 * i] * x[2 * i] + x[2 * i + 1] * x[2 * i + 1]; } return y; } else { int L = x.length; double[] y = new double[L]; for (int i = 0; i < L; i++) { y[i] = x[i] * x[i]; } return y; } } /** * Returns the squared absolute value of 1d array. * * @param IN array * @return square absolute value. */ public static double[] abs2(double[] x, int begin, int end, int isComplex) { //TODO regarder taille if (isComplex == 1) { int L = x.length / 2; double[] y = new double[L]; for (int i = begin; i < end; i++) { y[i] = x[2 * i] * x[2 * i] + x[2 * i + 1] * x[2 * i + 1]; } return y; } else { int L = end - begin + 1; double[] y = new double[L]; for (int i = 0; i < L; i++) { y[i] = x[i + begin] * x[i + begin]; } return y; } } }