mirror of
https://github.com/kerberos-io/openalpr-base.git
synced 2025-10-06 16:27:07 +08:00
Moved character segmentation code to its own directory
Conflicts: src/openalpr/CMakeLists.txt
This commit is contained in:
1143
src/openalpr/segmentation/charactersegmenter.cpp
Normal file
1143
src/openalpr/segmentation/charactersegmenter.cpp
Normal file
File diff suppressed because it is too large
Load Diff
98
src/openalpr/segmentation/charactersegmenter.h
Normal file
98
src/openalpr/segmentation/charactersegmenter.h
Normal file
@@ -0,0 +1,98 @@
|
||||
/*
|
||||
* Copyright (c) 2013 New Designs Unlimited, LLC
|
||||
* Opensource Automated License Plate Recognition [http://www.openalpr.com]
|
||||
*
|
||||
* This file is part of OpenAlpr.
|
||||
*
|
||||
* OpenAlpr is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License
|
||||
* version 3 as published by the Free Software Foundation
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU Affero General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef OPENALPR_CHARACTERSEGMENTER_H
|
||||
#define OPENALPR_CHARACTERSEGMENTER_H
|
||||
|
||||
#include "opencv2/imgproc/imgproc.hpp"
|
||||
#include "constants.h"
|
||||
#include "binarize_wolf.h"
|
||||
#include "utility.h"
|
||||
#include "characterregion.h"
|
||||
#include "colorfilter.h"
|
||||
#include "verticalhistogram.h"
|
||||
#include "config.h"
|
||||
|
||||
|
||||
//const float MIN_BOX_WIDTH_PX = 4; // 4 pixels
|
||||
|
||||
const cv::Scalar COLOR_DEBUG_EDGE(0,0,255); // Red
|
||||
const cv::Scalar COLOR_DEBUG_SPECKLES(0,0,255); // Red
|
||||
const cv::Scalar COLOR_DEBUG_MIN_HEIGHT(255,0,0); // Blue
|
||||
const cv::Scalar COLOR_DEBUG_MIN_AREA(255,0,0); // Blue
|
||||
const cv::Scalar COLOR_DEBUG_FULLBOX(255,255,0); // Blue-green
|
||||
const cv::Scalar COLOR_DEBUG_COLORFILTER(255,0,255); // Magenta
|
||||
const cv::Scalar COLOR_DEBUG_EMPTYFILTER(0,255,255); // Yellow
|
||||
|
||||
class CharacterSegmenter
|
||||
{
|
||||
|
||||
public:
|
||||
CharacterSegmenter(PipelineData* pipeline_data);
|
||||
virtual ~CharacterSegmenter();
|
||||
|
||||
int confidence;
|
||||
|
||||
|
||||
private:
|
||||
Config* config;
|
||||
PipelineData* pipeline_data;
|
||||
|
||||
CharacterAnalysis* charAnalysis;
|
||||
|
||||
LineSegment top;
|
||||
LineSegment bottom;
|
||||
|
||||
std::vector<cv::Mat> imgDbgGeneral;
|
||||
std::vector<cv::Mat> imgDbgCleanStages;
|
||||
|
||||
std::vector<bool> filter(cv::Mat img, std::vector<std::vector<cv::Point> > contours, std::vector<cv::Vec4i> hierarchy);
|
||||
std::vector<bool> filterByBoxSize(std::vector< std::vector<cv::Point> > contours, std::vector<bool> goodIndices, float minHeightPx, float maxHeightPx);
|
||||
std::vector<bool> filterBetweenLines(cv::Mat img, std::vector<std::vector<cv::Point> > contours, std::vector<cv::Vec4i> hierarchy, std::vector<cv::Point> outerPolygon, std::vector<bool> goodIndices);
|
||||
std::vector<bool> filterContourHoles(std::vector<std::vector<cv::Point> > contours, std::vector<cv::Vec4i> hierarchy, std::vector<bool> goodIndices);
|
||||
|
||||
std::vector<cv::Point> getBestVotedLines(cv::Mat img, std::vector<std::vector<cv::Point> > contours, std::vector<bool> goodIndices);
|
||||
int getGoodIndicesCount(std::vector<bool> goodIndices);
|
||||
|
||||
cv::Mat getCharacterMask(cv::Mat img_threshold, std::vector<std::vector<cv::Point> > contours, std::vector<cv::Vec4i> hierarchy, std::vector<bool> goodIndices);
|
||||
cv::Mat getCharBoxMask(cv::Mat img_threshold, std::vector<cv::Rect> charBoxes);
|
||||
|
||||
void removeSmallContours(std::vector<cv::Mat> thresholds, std::vector<std::vector<std::vector<cv::Point > > > allContours, float avgCharWidth, float avgCharHeight);
|
||||
|
||||
cv::Mat getVerticalHistogram(cv::Mat img, cv::Mat mask);
|
||||
std::vector<cv::Rect> getHistogramBoxes(VerticalHistogram histogram, float avgCharWidth, float avgCharHeight, float* score);
|
||||
std::vector<cv::Rect> getBestCharBoxes(cv::Mat img, std::vector<cv::Rect> charBoxes, float avgCharWidth);
|
||||
std::vector<cv::Rect> combineCloseBoxes( std::vector<cv::Rect> charBoxes, float avgCharWidth);
|
||||
|
||||
std::vector<cv::Rect> get1DHits(cv::Mat img, int yOffset);
|
||||
|
||||
void cleanCharRegions(std::vector<cv::Mat> thresholds, std::vector<cv::Rect> charRegions);
|
||||
void cleanBasedOnColor(std::vector<cv::Mat> thresholds, cv::Mat colorMask, std::vector<cv::Rect> charRegions);
|
||||
void cleanMostlyFullBoxes(std::vector<cv::Mat> thresholds, const std::vector<cv::Rect> charRegions);
|
||||
std::vector<cv::Rect> filterMostlyEmptyBoxes(std::vector<cv::Mat> thresholds, const std::vector<cv::Rect> charRegions);
|
||||
void filterEdgeBoxes(std::vector<cv::Mat> thresholds, const std::vector<cv::Rect> charRegions, float avgCharWidth, float avgCharHeight);
|
||||
|
||||
int getLongestBlobLengthBetweenLines(cv::Mat img, int col);
|
||||
|
||||
int isSkinnyLineInsideBox(cv::Mat threshold, cv::Rect box, std::vector<std::vector<cv::Point> > contours, std::vector<cv::Vec4i> hierarchy, float avgCharWidth, float avgCharHeight);
|
||||
|
||||
std::vector<cv::Point> getEncapsulatingLines(cv::Mat img, std::vector<std::vector<cv::Point> > contours, std::vector<bool> goodIndices);
|
||||
};
|
||||
|
||||
#endif // OPENALPR_CHARACTERSEGMENTER_H
|
181
src/openalpr/segmentation/verticalhistogram.cpp
Normal file
181
src/openalpr/segmentation/verticalhistogram.cpp
Normal file
@@ -0,0 +1,181 @@
|
||||
/*
|
||||
* Copyright (c) 2013 New Designs Unlimited, LLC
|
||||
* Opensource Automated License Plate Recognition [http://www.openalpr.com]
|
||||
*
|
||||
* This file is part of OpenAlpr.
|
||||
*
|
||||
* OpenAlpr is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License
|
||||
* version 3 as published by the Free Software Foundation
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU Affero General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "verticalhistogram.h"
|
||||
|
||||
using namespace cv;
|
||||
using namespace std;
|
||||
|
||||
VerticalHistogram::VerticalHistogram(Mat inputImage, Mat mask)
|
||||
{
|
||||
analyzeImage(inputImage, mask);
|
||||
}
|
||||
|
||||
VerticalHistogram::~VerticalHistogram()
|
||||
{
|
||||
histoImg.release();
|
||||
colHeights.clear();
|
||||
}
|
||||
|
||||
void VerticalHistogram::analyzeImage(Mat inputImage, Mat mask)
|
||||
{
|
||||
highestPeak = 0;
|
||||
lowestValley = inputImage.rows;
|
||||
|
||||
histoImg = Mat::zeros(inputImage.size(), CV_8U);
|
||||
|
||||
int columnCount;
|
||||
|
||||
for (int col = 0; col < inputImage.cols; col++)
|
||||
{
|
||||
columnCount = 0;
|
||||
|
||||
for (int row = 0; row < inputImage.rows; row++)
|
||||
{
|
||||
if (inputImage.at<uchar>(row, col) > 0 && mask.at<uchar>(row, col) > 0)
|
||||
columnCount++;
|
||||
}
|
||||
|
||||
this->colHeights.push_back(columnCount);
|
||||
|
||||
if (columnCount < lowestValley)
|
||||
lowestValley = columnCount;
|
||||
if (columnCount > highestPeak)
|
||||
highestPeak = columnCount;
|
||||
|
||||
for (; columnCount > 0; columnCount--)
|
||||
histoImg.at<uchar>(inputImage.rows - columnCount, col) = 255;
|
||||
}
|
||||
}
|
||||
|
||||
int VerticalHistogram::getLocalMinimum(int leftX, int rightX)
|
||||
{
|
||||
int minimum = histoImg.rows + 1;
|
||||
int lowestX = leftX;
|
||||
|
||||
for (int i = leftX; i <= rightX; i++)
|
||||
{
|
||||
if (colHeights[i] < minimum)
|
||||
{
|
||||
lowestX = i;
|
||||
minimum = colHeights[i];
|
||||
}
|
||||
}
|
||||
|
||||
return lowestX;
|
||||
}
|
||||
|
||||
int VerticalHistogram::getLocalMaximum(int leftX, int rightX)
|
||||
{
|
||||
int maximum = -1;
|
||||
int highestX = leftX;
|
||||
|
||||
for (int i = leftX; i <= rightX; i++)
|
||||
{
|
||||
if (colHeights[i] > maximum)
|
||||
{
|
||||
highestX = i;
|
||||
maximum = colHeights[i];
|
||||
}
|
||||
}
|
||||
|
||||
return highestX;
|
||||
}
|
||||
|
||||
int VerticalHistogram::getHeightAt(int x)
|
||||
{
|
||||
return colHeights[x];
|
||||
}
|
||||
|
||||
void VerticalHistogram::findValleys()
|
||||
{
|
||||
int MINIMUM_PEAK_HEIGHT = (int) (((float) highestPeak) * 0.75);
|
||||
|
||||
int totalWidth = colHeights.size();
|
||||
|
||||
int midpoint = ((highestPeak - lowestValley) / 2) + lowestValley;
|
||||
|
||||
HistogramDirection prevDirection = FALLING;
|
||||
|
||||
int relativePeakHeight = 0;
|
||||
int valleyStart = 0;
|
||||
|
||||
for (int i = 0; i < totalWidth; i++)
|
||||
{
|
||||
bool aboveMidpoint = (colHeights[i] >= midpoint);
|
||||
|
||||
if (aboveMidpoint)
|
||||
{
|
||||
if (colHeights[i] > relativePeakHeight)
|
||||
relativePeakHeight = colHeights[i];
|
||||
|
||||
prevDirection = FLAT;
|
||||
}
|
||||
else
|
||||
{
|
||||
relativePeakHeight = 0;
|
||||
|
||||
HistogramDirection direction = getHistogramDirection(i);
|
||||
|
||||
if ((prevDirection == FALLING || prevDirection == FLAT) && direction == RISING)
|
||||
{
|
||||
}
|
||||
else if ((prevDirection == FALLING || prevDirection == FLAT) && direction == RISING)
|
||||
{
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
HistogramDirection VerticalHistogram::getHistogramDirection(int index)
|
||||
{
|
||||
int EXTRA_WIDTH_TO_AVERAGE = 2;
|
||||
|
||||
float trailingAverage = 0;
|
||||
float forwardAverage = 0;
|
||||
|
||||
int trailStartIndex = index - EXTRA_WIDTH_TO_AVERAGE;
|
||||
if (trailStartIndex < 0)
|
||||
trailStartIndex = 0;
|
||||
int forwardEndIndex = index + EXTRA_WIDTH_TO_AVERAGE;
|
||||
if (forwardEndIndex >= colHeights.size())
|
||||
forwardEndIndex = colHeights.size() - 1;
|
||||
|
||||
for (int i = index; i >= trailStartIndex; i--)
|
||||
{
|
||||
trailingAverage += colHeights[i];
|
||||
}
|
||||
trailingAverage = trailingAverage / ((float) (1 + index - trailStartIndex));
|
||||
|
||||
for (int i = index; i <= forwardEndIndex; i++)
|
||||
{
|
||||
forwardAverage += colHeights[i];
|
||||
}
|
||||
forwardAverage = forwardAverage / ((float) (1 + forwardEndIndex - index));
|
||||
|
||||
float diff = forwardAverage - trailingAverage;
|
||||
float minDiff = ((float) (highestPeak - lowestValley)) * 0.10;
|
||||
|
||||
if (diff > minDiff)
|
||||
return RISING;
|
||||
else if (diff < minDiff)
|
||||
return FALLING;
|
||||
else
|
||||
return FLAT;
|
||||
}
|
64
src/openalpr/segmentation/verticalhistogram.h
Normal file
64
src/openalpr/segmentation/verticalhistogram.h
Normal file
@@ -0,0 +1,64 @@
|
||||
/*
|
||||
* Copyright (c) 2013 New Designs Unlimited, LLC
|
||||
* Opensource Automated License Plate Recognition [http://www.openalpr.com]
|
||||
*
|
||||
* This file is part of OpenAlpr.
|
||||
*
|
||||
* OpenAlpr is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU Affero General Public License
|
||||
* version 3 as published by the Free Software Foundation
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU Affero General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef OPENALPR_VERTICALHISTOGRAM_H
|
||||
#define OPENALPR_VERTICALHISTOGRAM_H
|
||||
|
||||
#include "opencv2/imgproc/imgproc.hpp"
|
||||
|
||||
|
||||
struct Valley
|
||||
{
|
||||
int startIndex;
|
||||
int endIndex;
|
||||
int width;
|
||||
int pixelsWithin;
|
||||
};
|
||||
|
||||
enum HistogramDirection { RISING, FALLING, FLAT };
|
||||
|
||||
class VerticalHistogram
|
||||
{
|
||||
|
||||
public:
|
||||
VerticalHistogram(cv::Mat inputImage, cv::Mat mask);
|
||||
virtual ~VerticalHistogram();
|
||||
|
||||
cv::Mat histoImg;
|
||||
|
||||
// Returns the lowest X position between two points.
|
||||
int getLocalMinimum(int leftX, int rightX);
|
||||
// Returns the highest X position between two points.
|
||||
int getLocalMaximum(int leftX, int rightX);
|
||||
|
||||
int getHeightAt(int x);
|
||||
|
||||
private:
|
||||
std::vector<int> colHeights;
|
||||
int highestPeak;
|
||||
int lowestValley;
|
||||
std::vector<Valley> valleys;
|
||||
|
||||
void analyzeImage(cv::Mat inputImage, cv::Mat mask);
|
||||
void findValleys();
|
||||
|
||||
HistogramDirection getHistogramDirection(int index);
|
||||
};
|
||||
|
||||
#endif // OPENALPR_VERTICALHISTOGRAM_H
|
Reference in New Issue
Block a user