All Downloads are FREE. Search and download functionalities are using the official Maven repository.

one.empty3.feature.CurveFitting Maven / Gradle / Ivy

Go to download

3D rendering engine. Plus modelling. Expected glsl textures 3d and 2d rendering3D primitives, and a lot of scenes' samples to test.+ Game Jogl reworked, Calculator (numbers and vectors). Java code parser implementation starts (<=1.2)

The newest version!
/*
 *
 *  * Copyright (c) 2024. Manuel Daniel Dahmen
 *  *
 *  *
 *  *    Copyright 2024 Manuel Daniel Dahmen
 *  *
 *  *    Licensed under the Apache License, Version 2.0 (the "License");
 *  *    you may not use this file except in compliance with the License.
 *  *    You may obtain a copy of the License at
 *  *
 *  *        http://www.apache.org/licenses/LICENSE-2.0
 *  *
 *  *    Unless required by applicable law or agreed to in writing, software
 *  *    distributed under the License is distributed on an "AS IS" BASIS,
 *  *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  *    See the License for the specific language governing permissions and
 *  *    limitations under the License.
 *
 *
 */

package one.empty3.feature;

import one.empty3.feature.app.replace.java.awt.Color;
import one.empty3.feature.shape.Rectangle;
import one.empty3.io.ProcessFile;
import one.empty3.library.Axe;
import one.empty3.library.Circle;
import one.empty3.library.ColorTexture;
import one.empty3.library.Point3D;
import one.empty3.library.core.nurbs.CourbeParametriquePolynomialeBezier;

import javax.imageio.ImageIO;
import java.awt.*;
import java.awt.image.BufferedImage;
import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.logging.Level;
import java.util.logging.Logger;

public class CurveFitting extends ProcessFile {
    CourbeN11 curvePoints;
    /*
     *
     * Morphing
     * Mask
     *     Paste
     *
     *     On donne une courbe initiale on essaie de la faire correspondre à une portion de l'image
     *     Commencer par une courbe initiale comme un cercle
     *     Déformer en courbe de Bézier de longueur N = N points de contrôle correspondant aux pixels
     *     de la carte initiale
     *     Carte des distances à la courbe
     *     Vu dans Dr Lingrand, et R. Szeliski.
     */

    PixM pix = null;
    private double lambda1 = 0.01, lambda2 = 0.01, lambda3 = 1.0;
    double[] outAvg = new double[]{0, 0, 0}, inAvg = new double[]{0, 0, 0};
    private double arcLength;
    private double[][] distancesArr;
    private CourbeParametriquePolynomialeBezier curveResult;
    private CourbeParametriquePolynomialeBezier curveInitial;
    private double[][] deltaE;
    private HashMap> border;
    private PixM inPix;
    private PixM outPix;

    public void init() {
        border = new HashMap<>();
        deltaE = new double[pix.getColumns()][pix.getLines()];
        lambda1 = 0.01;
        lambda2 = 0.02;
        lambda3 = 1.0;
        distancesArr = new double[pix.getColumns()][pix.getLines()];
        outAvg = new double[]{0., 0., 0.};
        inAvg = new double[]{0., 0., 0.};
        curveResult = new CourbeParametriquePolynomialeBezier();
    }

    public double E() {
        double t1 = 0.0;
        double t2 = 0.0;
        double arcLengthPart = 0;
        double e = 0.0;

        inAvg = mean(true);
        outAvg = mean(false);

        for (int j = 0; j < pix.getColumns(); j++) {
            for (int k = 0; k < pix.getLines(); k++) {
                t1 += inPix.get(j, k) * lambda1 * (pix.luminance(j, k) - Math.sqrt(inAvg[0] * inAvg[0]
                        + inAvg[1] * inAvg[1] + inAvg[2] * inAvg[2])) * (pix.luminance(j, k)
                        - Math.sqrt(inAvg[0] * inAvg[0]
                        + inAvg[1] * inAvg[1] + inAvg[2] * inAvg[2]));
                t2 += outPix.get(j, k) * lambda2 * (pix.luminance(j, k)
                        + Math.sqrt(outAvg[0] * outAvg[0] + outAvg[1] * outAvg[1] + outAvg[2] * outAvg[2]))
                        * (pix.luminance(j, k) -
                        Math.sqrt(outAvg[0] * outAvg[0] + outAvg[1] * outAvg[1] + outAvg[2] * outAvg[2]));


            }
        }
        arcLength = 0.0;
        for (int i = 1; i < curvePoints.getCoefficients().getData1d().size() - 1; i++)
            arcLength += lambda3 * curvePoints.getCoefficients().getData1d().get(i + 1)
                    .moins(curvePoints.getCoefficients().getElem(i)).norme();

        e = t1 - t2 + lambda3 * arcLength;
        System.out.printf("\nE  terme intérieur   t1 %f\n", t1);
        System.out.printf("t2 terme extérieur  t2 %f\n", t2);
        System.out.printf("L  Longueur de la courbe  %f\n", arcLength);


        return e;
    }

    public double[] mean(boolean in) {
        double[] res = new double[]{0., 0., 0.};
        for (int i = 0; i < pix.getCompNo(); i++) {
            for (int j = 0; j < pix.getColumns(); j++) {
                for (int k = 0; k < pix.getLines(); k++) {
                    int isIn = in ? 1 : 0;

                    pix.setCompNo(i);
                    res[i] += pix.get(j, k) / Math.sqrt(3)
                            * (in ? inPix.get(j, k) : (outPix.get(j, k)));

                }
            }
        }
        return res;
    }

    public double[][] distances() {

        border = new HashMap<>();
        int IN = 0, OUT = 0;
        arcLength = 0.0;
        double dist = 0.0;
        double inEnergy, outEnergy;
        arcLength = 0.0;
        distancesArr = new double[pix.getColumns()][pix.getLines()];
        for (int i = 0; i < distancesArr.length; i++) {
            Arrays.fill(distancesArr[i], 100000);
        }
        //distancesArr[i][j] = 0.0;
        for (int j = 0; j < pix.getLines(); j++) {
            border.put(j, new ArrayList<>());
            for (int i = 0; i < pix.getColumns(); i++) {
                for (int k = 0; k < curvePoints.getCoefficients().getData1d().size(); k++) {
                    // Si vous habitez dans une petite rue, ça n'ira pas tout seul. Je le redis une fois. NON. Autographe d'un mongol.
                    // Dédié à Lucky Luke.

                    dist = Point3D.distance(pix.getRgb(i, j), curvePoints.getCoefficients().getElem(k));
                    if (dist < distancesArr[i][j])
                        distancesArr[i][j] = dist;


                    if (dist < 1.0) {

                        // Point de la courbe

                        border.get(j).add(i);
                    }
                }
                if (inPix.luminance(i, j) > 0) {
                    IN++;
                } else if (outPix.luminance(i, j) > 0) {
                    OUT++;
                }

            }
        }
        for (int i = 1; i < curvePoints.getCoefficients().getData1d().size(); i++) {
            arcLength += curvePoints.getCoefficients().getData1d().get(i)
                    .moins(curvePoints.getCoefficients().getData1d().get(i - 1)).norme();

        }

        System.out.printf("In   points count %d\n", IN);
        System.out.printf("Out  points count %d\n", OUT);

        return distancesArr;
    }

    /*

            Générer une approximation avec points de contrôle.
    */
    public CourbeN11 approx() {
        List p = new ArrayList<>();
        double incr = (curveInitial.getEndU() - curveInitial.getStartU()) * 0.0001 /
                Point3D.distance(curveInitial.calculerPoint3D(0.0001),
                        curveInitial.calculerPoint3D(0.0)); // Garder l'incrément en chaque point? pour l'itération suivante
        double incr0 = incr;
        double lastIncr = incr;
        final int MAX_ITER = 100;
        int iter = 0;
        for (double t = 0.0; t < 1.0; t += incr) {
            Point3D pt1 = curveInitial.calculerPoint3D(t);
            Point3D pt2 = curveInitial.calculerPoint3D(t + incr);
            double dist = Point3D.distance(pt1, pt2);
            //if (dist >= 1.0 && dist < 2.0) {
            if (dist >= 0.9 && dist < 1.1) {
                //p.add(Point3D.P.n((int) (double) pt2.get(0),
                //        (int) (double) pt2.get(1), (int) (double) pt2.get(2)));
                iter = 0;
                lastIncr = incr;
                p.add(pt2);
                arcLength += dist;
            } else if (dist < 1.0) {
                t = t - incr0;
                incr *= 1.5;
                incr0 = incr;
                iter++;
            } else if (iter > MAX_ITER) {
                incr = lastIncr;
                incr0 = incr;
                t += incr;
                iter = 0;
                continue;
            } else {
                t = t - incr0;
                incr /= 1.5;
                incr0 = incr;
                iter++;
            } // à détailler
            if (p.size() > maxRes * 4) {
                Logger.getAnonymousLogger().log(Level.INFO, "ArrayList.size too long : " + p.size());
                break;
            }
        }
        Point3D[] point3DS = new Point3D[p.size()];
        p.toArray(point3DS);
        curvePoints = new CourbeN11(point3DS);
        return curvePoints;
    }

    @Override
    public boolean process(File in, File out) {
        try {
            pix = PixM.getPixM(ImageIO.read(in), maxRes);


            init();


            inPix = new PixM(pix.getImage());
            outPix = new PixM(pix.getImage());

            curveInitial = new CourbeN11();


            int imgX1;
            int imgY1;
            int imgX2;
            int imgY2;
            int moy = (pix.getColumns() + pix.getLines()) / 2;
            int square;
            if (pix.getColumns() > pix.getLines()) {
                square = pix.getLines();
                imgX1 = pix.getColumns() / 2 - square / 2;
                imgY1 = 0;
                imgX2 = pix.getColumns() / 2 + square / 2;
                imgY2 = pix.getLines() - 1;
            } else {
                square = pix.getColumns();
                imgX1 = 0;
                imgY1 = pix.getLines() / 2 - square / 2;
                imgX2 = pix.getColumns() - 1;
                imgY2 = pix.getLines() / 2 + square / 2;
            }

            int N = 12;
            for (int i = 0; i < N; i++) {
                curveInitial.getCoefficients().getData1d().add(
                        new Point3D(pix.getColumns() / 2
                                + square / 2. * Math.cos(i * 2 * Math.PI / N),
                                pix.getLines() / 2
                                        + square / 2. * Math.sin(i * 2 * Math.PI / N),
                                0.0));
            }
            Point3D center = new Point3D(pix.getColumns() / 2., pix.getLines() / 2., 0.0);
            Circle circle = new Circle(new Axe(center.plus(Point3D.Z), center.plus(Point3D.Z.mult(-1))), square / 2.);
            //System.out.printf("%s", curveInitial.toString());

            //curveInitial = new Circle(new Axe(Point3D.Z.plus(Point3D.n(pix.getColumns()/2,
            //        pix.getLines()/2, 0)), Point3D.Z.mult(-1)), (imgX2-imgX1)/3.*2);

            inPix.paintAll(new double[]{0, 0, 0});
            inPix.fillIn(curveInitial, new ColorTexture(Color.WHITE), new ColorTexture(Color.RED));
            outPix.paintAll(new double[]{1, 1, 1});
            outPix.fillIn(curveInitial, new ColorTexture(Color.BLACK), new ColorTexture(Color.RED));

            curvePoints = approx();

            curvePoints.getClosed().setElem(false);
            //double[][] distances = distances();
            //inPix.paintAll(new double[]{0, 0, 0});
            //outPix.paintAll(new double[]{1, 1, 1});
            inPix.fillIn(curvePoints, new ColorTexture(Color.WHITE), new ColorTexture(Color.WHITE));
            outPix.fillIn(curvePoints, new ColorTexture(Color.BLACK), new ColorTexture(Color.BLACK));

            double e = E();
            //curveResult = modify();

            PixM p = new PixM(pix.getColumns(), pix.getLines());

            curvePoints.setIncrU(1. / maxRes / curvePoints.getCoefficients().data1d.size());

            Logger.getAnonymousLogger().log(Level.INFO, "Courbe 4/5");
            p.plotCurve(curvePoints, new ColorTexture(Color.WHITE));
            Logger.getAnonymousLogger().log(Level.INFO, "Courbe 5/5");
            p.plotCurve(circle, new ColorTexture(Color.BLUE));
            for (Point3D c : curvePoints.getCoefficients().getData1d()) {
                Rectangle rectangle = new Rectangle(c.getX() - 3, c.getY() - 3, 6, 6);
                rectangle.setIncrU(0.1);
            }

            PixM normalize = p.normalize(0.0, 1.0, 0.0, 1.0);

            // E = Sout + Sin + Scourbe :
            // Convergence vers ?
            // Changer l1,l2,l3
            // Convergence de courbe . Modification de la courbe.
            //normalize.plotCurve(courbeParametriquePolynomialeBezier, Color.GREEN);
            //normalize.plotCurve(curvePoints, Color.BLUE);

            //normalize.fillIn(courbeParametriquePolynomialeBezier, Color.BLACK, Color.WHITE);

            System.out.printf("curveResult  %d\n", curveResult.getCoefficients().getData1d().size());
            System.out.printf("curveInitial %d\n", ((CourbeParametriquePolynomialeBezier) curveInitial)
                    .getCoefficients().getData1d().size());
            System.out.printf("curvePoints  %d\n", curvePoints.getCoefficients().getData1d().size());
            System.out.printf("Energy       %f\n", e);


            Logger.getAnonymousLogger().log(Level.INFO,""+ curvePoints);

            BufferedImage image = normalize.getImage();

            Graphics graphics = image.getGraphics();

            graphics.setColor(Color.RED);

            graphics.drawArc(image.getWidth() / 2 - square / 2, image.getHeight() / 2 - square / 2,
                    square, square, 0, 360);

            String absolutePath = out.getAbsolutePath();
            absolutePath = absolutePath.substring(0, absolutePath.length() - 4);
            ImageIO.write(image, "jpg", new File(absolutePath + ".jpg"));
            ImageIO.write(outPix.normalize(0.0, 1.0, 0., 1.).getImage(), "jpg", new File(
                    absolutePath + "-outPixels.jpg"));
            ImageIO.write(inPix.normalize(0.0, 1.0, 0., 1.).getImage(), "jpg", new File(
                    absolutePath + "-inPixels.jpg"));

            return true;
        } catch (Exception ex) {}


        return false;
    }

    private CourbeParametriquePolynomialeBezier modify() {
        return new CourbeParametriquePolynomialeBezier();
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy