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

boofcv.alg.disparity.block.select.SelectSparseErrorBasicWta_S32 Maven / Gradle / Ivy

Go to download

BoofCV is an open source Java library for real-time computer vision and robotics applications.

There is a newer version: 1.1.7
Show newest version
/*
 * Copyright (c) 2021, Peter Abeles. All Rights Reserved.
 *
 * This file is part of BoofCV (http://boofcv.org).
 *
 * 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 boofcv.alg.disparity.block.select;

import boofcv.alg.disparity.block.DisparitySparseSelect;
import boofcv.alg.disparity.block.score.DisparitySparseRectifiedScoreBM;

/**
 * 

* Selects the disparity with the lowest score with no additional validation. Lack * of validation speeds up the code at the cost of reduced signal to noise ratio. This * strategy of selecting the lowest score is also known as Winner Take All (WTA). *

* * @author Peter Abeles */ public class SelectSparseErrorBasicWta_S32 implements DisparitySparseSelect { // selected disparity int disparity; @Override public boolean select( DisparitySparseRectifiedScoreBM scorer, int x, int y ) { if (!scorer.processLeftToRight(x, y)) return false; int[] scores = scorer.getScoreLtoR(); int disparityRange = scorer.getLocalRangeLtoR(); disparity = 0; int best = scores[0]; for (int i = 1; i < disparityRange; i++) { if (scores[i] < best) { best = scores[i]; disparity = i; } } return true; } @Override public double getDisparity() { return disparity; } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy