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

one.empty3.feature20220726.lbp.OriginalLBP Maven / Gradle / Ivy

There is a newer version: 2024.5.10
Show newest version
/*
 * Copyright (c) 2023. Manuel Daniel Dahmen
 *
 *
 *    Copyright 2012-2023 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.feature20220726.lbp;

import one.empty3.feature20220726.PixM;
import one.empty3.library.Point3D;

import javaAnd.awt.*;

public class OriginalLBP {
    private final PixM pixM;
    private final float radius;

    public OriginalLBP(PixM pixM, float radius) {
        this.radius = radius;
        this.pixM = pixM;
    }

    public void computeCircle() {
        float[] values = new float[1 + (int) (2 * Math.PI * radius)];
        PixM m = new PixM(pixM.getColumns(), pixM.getLines());
        for (int i = 0; i < pixM.getColumns(); i++)
            for (int j = 0; j < pixM.getLines(); j++) {
                values[0] = (float) pixM.luminance(i, j);
                for (float angle = 0; angle < 2 * Math.PI * radius; angle++) {
                    Point3D p = new Point3D((double) i, (double) j, 0.0).plus(
                            new Point3D(radius * Math.cos(angle), -radius * Math.sin(angle), 0.0));
                    Point point = new Point((int) (double) p.getX(), (int) (double) p.getY());
                    double v = pixM.luminance((int) point.getX(), (int) point.getY());
                    values[(int) angle + 1] = (float) v;
                }
                long binary = 0;
                for (int k = 1; i < values.length; i++) {
                    if (values[k] > values[0]) {
                        binary += Math.pow(2, i);
                    } else if (values[k] < values[0]) {

                    }
                }
                m.set(i, j, binary);
            }
        m.compCount = 1;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy