alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2021 Arm Limited. All rights reserved. |
| 3 | * SPDX-License-Identifier: Apache-2.0 |
| 4 | * |
| 5 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 6 | * you may not use this file except in compliance with the License. |
| 7 | * You may obtain a copy of the License at |
| 8 | * |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 10 | * |
| 11 | * Unless required by applicable law or agreed to in writing, software |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 14 | * See the License for the specific language governing permissions and |
| 15 | * limitations under the License. |
| 16 | */ |
| 17 | #include "Classifier.hpp" |
| 18 | |
| 19 | #include "hal.h" |
| 20 | #include "TensorFlowLiteMicro.hpp" |
| 21 | |
| 22 | #include <vector> |
| 23 | #include <string> |
| 24 | #include <set> |
| 25 | #include <cstdint> |
Kshitij Sisodia | f9c19ea | 2021-05-07 16:08:14 +0100 | [diff] [blame] | 26 | #include <inttypes.h> |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 27 | #include "PlatformMath.hpp" |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 28 | |
| 29 | namespace arm { |
| 30 | namespace app { |
| 31 | |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 32 | void Classifier::SetVectorResults(std::set<std::pair<float, uint32_t>>& topNSet, |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 33 | std::vector<ClassificationResult>& vecResults, |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 34 | const std::vector <std::string>& labels) |
| 35 | { |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 36 | |
| 37 | /* Reset the iterator to the largest element - use reverse iterator. */ |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 38 | |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 39 | auto topNIter = topNSet.rbegin(); |
| 40 | for (size_t i = 0; i < vecResults.size() && topNIter != topNSet.rend(); ++i, ++topNIter) { |
| 41 | vecResults[i].m_normalisedVal = topNIter->first; |
| 42 | vecResults[i].m_label = labels[topNIter->second]; |
| 43 | vecResults[i].m_labelIdx = topNIter->second; |
| 44 | } |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 45 | } |
| 46 | |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 47 | bool Classifier::GetTopNResults(const std::vector<float>& tensor, |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 48 | std::vector<ClassificationResult>& vecResults, |
| 49 | uint32_t topNCount, |
| 50 | const std::vector <std::string>& labels) |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 51 | { |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 52 | |
| 53 | std::set<std::pair<float , uint32_t>> sortedSet; |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 54 | |
| 55 | /* NOTE: inputVec's size verification against labels should be |
| 56 | * checked by the calling/public function. */ |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 57 | |
| 58 | /* Set initial elements. */ |
| 59 | for (uint32_t i = 0; i < topNCount; ++i) { |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 60 | sortedSet.insert({tensor[i], i}); |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 61 | } |
| 62 | |
| 63 | /* Initialise iterator. */ |
| 64 | auto setFwdIter = sortedSet.begin(); |
| 65 | |
| 66 | /* Scan through the rest of elements with compare operations. */ |
| 67 | for (uint32_t i = topNCount; i < labels.size(); ++i) { |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 68 | if (setFwdIter->first < tensor[i]) { |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 69 | sortedSet.erase(*setFwdIter); |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 70 | sortedSet.insert({tensor[i], i}); |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 71 | setFwdIter = sortedSet.begin(); |
| 72 | } |
| 73 | } |
| 74 | |
| 75 | /* Final results' container. */ |
| 76 | vecResults = std::vector<ClassificationResult>(topNCount); |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 77 | SetVectorResults(sortedSet, vecResults, labels); |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 78 | |
| 79 | return true; |
| 80 | } |
| 81 | |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 82 | bool Classifier::GetClassificationResults( |
| 83 | TfLiteTensor* outputTensor, |
| 84 | std::vector<ClassificationResult>& vecResults, |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 85 | const std::vector <std::string>& labels, |
| 86 | uint32_t topNCount, |
| 87 | bool useSoftmax) |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 88 | { |
| 89 | if (outputTensor == nullptr) { |
| 90 | printf_err("Output vector is null pointer.\n"); |
| 91 | return false; |
| 92 | } |
| 93 | |
| 94 | uint32_t totalOutputSize = 1; |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 95 | for (int inputDim = 0; inputDim < outputTensor->dims->size; inputDim++) { |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 96 | totalOutputSize *= outputTensor->dims->data[inputDim]; |
| 97 | } |
| 98 | |
| 99 | /* Sanity checks. */ |
| 100 | if (totalOutputSize < topNCount) { |
Kshitij Sisodia | f9c19ea | 2021-05-07 16:08:14 +0100 | [diff] [blame] | 101 | printf_err("Output vector is smaller than %" PRIu32 "\n", topNCount); |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 102 | return false; |
| 103 | } else if (totalOutputSize != labels.size()) { |
| 104 | printf_err("Output size doesn't match the labels' size\n"); |
| 105 | return false; |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 106 | } else if (topNCount == 0) { |
| 107 | printf_err("Top N results cannot be zero\n"); |
| 108 | return false; |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 109 | } |
| 110 | |
| 111 | bool resultState; |
| 112 | vecResults.clear(); |
| 113 | |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 114 | /* De-Quantize Output Tensor */ |
| 115 | QuantParams quantParams = GetTensorQuantParams(outputTensor); |
| 116 | |
| 117 | /* Floating point tensor data to be populated |
| 118 | * NOTE: The assumption here is that the output tensor size isn't too |
| 119 | * big and therefore, there's neglibible impact on heap usage. */ |
| 120 | std::vector<float> tensorData(totalOutputSize); |
| 121 | |
| 122 | /* Populate the floating point buffer */ |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 123 | switch (outputTensor->type) { |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 124 | case kTfLiteUInt8: { |
| 125 | uint8_t *tensor_buffer = tflite::GetTensorData<uint8_t>(outputTensor); |
| 126 | for (size_t i = 0; i < totalOutputSize; ++i) { |
| 127 | tensorData[i] = quantParams.scale * |
| 128 | (static_cast<float>(tensor_buffer[i]) - quantParams.offset); |
| 129 | } |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 130 | break; |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 131 | } |
| 132 | case kTfLiteInt8: { |
| 133 | int8_t *tensor_buffer = tflite::GetTensorData<int8_t>(outputTensor); |
| 134 | for (size_t i = 0; i < totalOutputSize; ++i) { |
| 135 | tensorData[i] = quantParams.scale * |
| 136 | (static_cast<float>(tensor_buffer[i]) - quantParams.offset); |
| 137 | } |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 138 | break; |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 139 | } |
| 140 | case kTfLiteFloat32: { |
| 141 | float *tensor_buffer = tflite::GetTensorData<float>(outputTensor); |
| 142 | for (size_t i = 0; i < totalOutputSize; ++i) { |
| 143 | tensorData[i] = tensor_buffer[i]; |
| 144 | } |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 145 | break; |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 146 | } |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 147 | default: |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 148 | printf_err("Tensor type %s not supported by classifier\n", |
| 149 | TfLiteTypeGetName(outputTensor->type)); |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 150 | return false; |
| 151 | } |
| 152 | |
Kshitij Sisodia | 76a1580 | 2021-12-24 11:05:11 +0000 | [diff] [blame^] | 153 | if (useSoftmax) { |
| 154 | math::MathUtils::SoftmaxF32(tensorData); |
| 155 | } |
| 156 | |
| 157 | /* Get the top N results. */ |
| 158 | resultState = GetTopNResults(tensorData, vecResults, topNCount, labels); |
| 159 | |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 160 | if (!resultState) { |
alexander | c350cdc | 2021-04-29 20:36:09 +0100 | [diff] [blame] | 161 | printf_err("Failed to get top N results set\n"); |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 162 | return false; |
| 163 | } |
| 164 | |
| 165 | return true; |
| 166 | } |
alexander | 3c79893 | 2021-03-26 21:42:19 +0000 | [diff] [blame] | 167 | } /* namespace app */ |
| 168 | } /* namespace arm */ |