dockerfile/openalpr-base
1
0
Fork 0
mirror of https://github.com/kerberos-io/openalpr-base.git synced 2025-10-05 15:57:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

Handled a crash condition when no plate candidates score above the minimum threshold

Browse Source
This commit is contained in:
Matt Hill
2016-03-13 14:55:14 -04:00
parent 74c789187e
commit 0a10773710
1 changed files with 23 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

43
src/openalpr/result_aggregator.cpp
View File

@@ -220,29 +220,32 @@ namespace alpr
} }
} }
// Figure out the best region for this cluster if (sorted_results.size() > 0)
ResultRegionScore regionResults = findBestRegion(clusters[unique_plate_idx]);
AlprPlateResult firstResult = clusters[unique_plate_idx][0];
AlprPlateResult copyResult;
copyResult.bestPlate = sorted_results[0].second.plate;
copyResult.plate_index = firstResult.plate_index;
copyResult.region = regionResults.region;
copyResult.regionConfidence = regionResults.confidence;
copyResult.processing_time_ms = firstResult.processing_time_ms;
copyResult.requested_topn = firstResult.requested_topn;
for (int p_idx = 0; p_idx < 4; p_idx++)
copyResult.plate_points[p_idx] = firstResult.plate_points[p_idx];
for (int i = 0; i < sorted_results.size(); i++)
{ {
if (i >= topn) // Figure out the best region for this cluster
break; ResultRegionScore regionResults = findBestRegion(clusters[unique_plate_idx]);
copyResult.topNPlates.push_back(sorted_results[i].second.plate); AlprPlateResult firstResult = clusters[unique_plate_idx][0];
AlprPlateResult copyResult;
copyResult.bestPlate = sorted_results[0].second.plate;
copyResult.plate_index = firstResult.plate_index;
copyResult.region = regionResults.region;
copyResult.regionConfidence = regionResults.confidence;
copyResult.processing_time_ms = firstResult.processing_time_ms;
copyResult.requested_topn = firstResult.requested_topn;
for (int p_idx = 0; p_idx < 4; p_idx++)
copyResult.plate_points[p_idx] = firstResult.plate_points[p_idx];
for (int i = 0; i < sorted_results.size(); i++)
{
if (i >= topn)
break;
copyResult.topNPlates.push_back(sorted_results[i].second.plate);
}
response.results.plates.push_back(copyResult);
} }
response.results.plates.push_back(copyResult);
} }
} }