From 1e866f0063b8c60d56aaf2e6210e051ff0047aba Mon Sep 17 00:00:00 2001
From: AlexeyAB <alexeyab84@gmail.com>
Date: Wed, 15 Aug 2018 21:01:22 +0000
Subject: [PATCH] Fixed yolov3-tiny.cfg
---
src/utils.c | 308 +++++++++++++++++++++++++++++++++++++++++++++++----
1 files changed, 283 insertions(+), 25 deletions(-)
diff --git a/src/utils.c b/src/utils.c
index 3121ef6..09c50b2 100644
--- a/src/utils.c
+++ b/src/utils.c
@@ -2,12 +2,44 @@
#include <stdlib.h>
#include <string.h>
#include <math.h>
-#include <unistd.h>
+#include <assert.h>
#include <float.h>
#include <limits.h>
-
+#ifdef WIN32
+#include "unistd.h"
+#include "gettimeofday.h"
+#else
+#include <unistd.h>
+#include <sys/time.h>
+#endif
#include "utils.h"
+#pragma warning(disable: 4996)
+
+double what_time_is_it_now()
+{
+ struct timeval time;
+ if (gettimeofday(&time, NULL)) {
+ return 0;
+ }
+ return (double)time.tv_sec + (double)time.tv_usec * .000001;
+}
+
+int *read_map(char *filename)
+{
+ int n = 0;
+ int *map = 0;
+ char *str;
+ FILE *file = fopen(filename, "r");
+ if(!file) file_error(filename);
+ while((str=fgetl(file))){
+ ++n;
+ map = realloc(map, n*sizeof(int));
+ map[n-1] = atoi(str);
+ }
+ return map;
+}
+
void sorta_shuffle(void *arr, size_t n, size_t size, size_t sections)
{
size_t i;
@@ -15,7 +47,7 @@
size_t start = n*i/sections;
size_t end = n*(i+1)/sections;
size_t num = end-start;
- shuffle(arr+(start*size), num, size);
+ shuffle((char*)arr+(start*size), num, size);
}
}
@@ -25,9 +57,9 @@
void *swp = calloc(1, size);
for(i = 0; i < n-1; ++i){
size_t j = i + rand()/(RAND_MAX / (n-i)+1);
- memcpy(swp, arr+(j*size), size);
- memcpy(arr+(j*size), arr+(i*size), size);
- memcpy(arr+(i*size), swp, size);
+ memcpy(swp, (char*)arr+(j*size), size);
+ memcpy((char*)arr+(j*size), (char*)arr+(i*size), size);
+ memcpy((char*)arr+(i*size), swp, size);
}
}
@@ -105,6 +137,7 @@
{
c = next+1;
}
+ if(!next) while ((next = strchr(c, '\\'))) { c = next + 1; }
c = copy_string(c);
next = strchr(c, '.');
if (next) *next = 0;
@@ -127,28 +160,75 @@
for(i =0 ; i < M; ++i){
printf("%d ", i+1);
for(j = 0; j < N; ++j){
- printf("%10.6f, ", A[i*N+j]);
+ printf("%2.4f, ", A[i*N+j]);
}
printf("\n");
}
printf("\n");
}
-
-char *find_replace(char *str, char *orig, char *rep)
+void find_replace(char *str, char *orig, char *rep, char *output)
{
- static char buffer[4096];
+ char *buffer = calloc(8192, sizeof(char));
char *p;
- if(!(p = strstr(str, orig))) // Is 'orig' even in 'str'?
- return str;
+ sprintf(buffer, "%s", str);
+ if(!(p = strstr(buffer, orig))){ // Is 'orig' even in 'str'?
+ sprintf(output, "%s", str);
+ free(buffer);
+ return;
+ }
- strncpy(buffer, str, p-str); // Copy characters from 'str' start to 'orig' st$
- buffer[p-str] = '\0';
+ *p = '\0';
- sprintf(buffer+(p-str), "%s%s", rep, p+strlen(orig));
+ sprintf(output, "%s%s%s", buffer, rep, p+strlen(orig));
+ free(buffer);
+}
- return buffer;
+void find_replace_extension(char *str, char *orig, char *rep, char *output)
+{
+ char *buffer = calloc(8192, sizeof(char));
+
+ sprintf(buffer, "%s", str);
+ char *p = strstr(buffer, orig);
+ int offset = (p - buffer);
+ int chars_from_end = strlen(buffer) - offset;
+ if (!p || chars_from_end != strlen(orig)) { // Is 'orig' even in 'str' AND is 'orig' found at the end of 'str'?
+ sprintf(output, "%s", str);
+ free(buffer);
+ return;
+ }
+
+ *p = '\0';
+
+ sprintf(output, "%s%s%s", buffer, rep, p + strlen(orig));
+ free(buffer);
+}
+
+void replace_image_to_label(char *input_path, char *output_path) {
+ //find_replace(input_path, "/images/", "/labels/", output_path); // COCO
+ find_replace(input_path, "/images/train2014/", "/labels/train2014/", output_path); // COCO
+ find_replace(output_path, "/images/val2014/", "/labels/val2014/", output_path); // COCO
+ find_replace(output_path, "/JPEGImages/", "/labels/", output_path); // PascalVOC
+ find_replace(output_path, "\\images\\train2014\\", "\\labels\\train2014\\", output_path); // COCO
+ find_replace(output_path, "\\images\\val2014\\", "\\labels\\val2014\\", output_path); // COCO
+ find_replace(output_path, "\\JPEGImages\\", "\\labels\\", output_path); // PascalVOC
+ //find_replace(output_path, "/VOC2007/JPEGImages/", "/VOC2007/labels/", output_path); // PascalVOC
+ //find_replace(output_path, "/VOC2012/JPEGImages/", "/VOC2012/labels/", output_path); // PascalVOC
+
+ //find_replace(output_path, "/raw/", "/labels/", output_path);
+
+ // replace only ext of files
+ find_replace_extension(output_path, ".jpg", ".txt", output_path);
+ find_replace_extension(output_path, ".JPG", ".txt", output_path); // error
+ find_replace_extension(output_path, ".jpeg", ".txt", output_path);
+ find_replace_extension(output_path, ".JPEG", ".txt", output_path);
+ find_replace_extension(output_path, ".png", ".txt", output_path);
+ find_replace_extension(output_path, ".PNG", ".txt", output_path);
+ find_replace_extension(output_path, ".bmp", ".txt", output_path);
+ find_replace_extension(output_path, ".BMP", ".txt", output_path);
+ find_replace_extension(output_path, ".ppm", ".txt", output_path);
+ find_replace_extension(output_path, ".PPM", ".txt", output_path);
}
float sec(clock_t clocks)
@@ -175,19 +255,20 @@
void error(const char *s)
{
perror(s);
- exit(0);
+ assert(0);
+ exit(EXIT_FAILURE);
}
void malloc_error()
{
fprintf(stderr, "Malloc error\n");
- exit(-1);
+ exit(EXIT_FAILURE);
}
void file_error(char *s)
{
fprintf(stderr, "Couldn't open file: %s\n", s);
- exit(0);
+ exit(EXIT_FAILURE);
}
list *split_str(char *s, char delim)
@@ -212,12 +293,26 @@
size_t offset = 0;
for(i = 0; i < len; ++i){
char c = s[i];
- if(c==' '||c=='\t'||c=='\n') ++offset;
+ if(c==' '||c=='\t'||c=='\n'||c =='\r'||c==0x0d||c==0x0a) ++offset;
else s[i-offset] = c;
}
s[len-offset] = '\0';
}
+
+void strip_args(char *s)
+{
+ size_t i;
+ size_t len = strlen(s);
+ size_t offset = 0;
+ for (i = 0; i < len; ++i) {
+ char c = s[i];
+ if (c == '\t' || c == '\n' || c == '\r' || c == 0x0d || c == 0x0a) ++offset;
+ else s[i - offset] = c;
+ }
+ s[len - offset] = '\0';
+}
+
void strip_char(char *s, char bad)
{
size_t i;
@@ -264,11 +359,51 @@
fgets(&line[curr], readsize, fp);
curr = strlen(line);
}
- if(line[curr-1] == '\n') line[curr-1] = '\0';
+ if(curr >= 2)
+ if(line[curr-2] == 0x0d) line[curr-2] = 0x00;
+
+ if(curr >= 1)
+ if(line[curr-1] == 0x0a) line[curr-1] = 0x00;
return line;
}
+int read_int(int fd)
+{
+ int n = 0;
+ int next = read(fd, &n, sizeof(int));
+ if(next <= 0) return -1;
+ return n;
+}
+
+void write_int(int fd, int n)
+{
+ int next = write(fd, &n, sizeof(int));
+ if(next <= 0) error("read failed");
+}
+
+int read_all_fail(int fd, char *buffer, size_t bytes)
+{
+ size_t n = 0;
+ while(n < bytes){
+ int next = read(fd, buffer + n, bytes-n);
+ if(next <= 0) return 1;
+ n += next;
+ }
+ return 0;
+}
+
+int write_all_fail(int fd, char *buffer, size_t bytes)
+{
+ size_t n = 0;
+ while(n < bytes){
+ size_t next = write(fd, buffer + n, bytes-n);
+ if(next <= 0) return 1;
+ n += next;
+ }
+ return 0;
+}
+
void read_all(int fd, char *buffer, size_t bytes)
{
size_t n = 0;
@@ -359,6 +494,28 @@
return sum_array(a,n)/n;
}
+void mean_arrays(float **a, int n, int els, float *avg)
+{
+ int i;
+ int j;
+ memset(avg, 0, els*sizeof(float));
+ for(j = 0; j < n; ++j){
+ for(i = 0; i < els; ++i){
+ avg[i] += a[j][i];
+ }
+ }
+ for(i = 0; i < els; ++i){
+ avg[i] /= n;
+ }
+}
+
+void print_statistics(float *a, int n)
+{
+ float m = mean_array(a, n);
+ float v = variance_array(a, n);
+ printf("MSE: %.6f, Mean: %.6f, Variance: %.6f\n", mse_array(a, n), m, v);
+}
+
float variance_array(float *a, int n)
{
int i;
@@ -369,6 +526,13 @@
return variance;
}
+int constrain_int(int a, int min, int max)
+{
+ if (a < min) return min;
+ if (a > max) return max;
+ return a;
+}
+
float constrain(float min, float max, float a)
{
if (a < min) return min;
@@ -376,6 +540,14 @@
return a;
}
+float dist_array(float *a, float *b, int n, int sub)
+{
+ int i;
+ float sum = 0;
+ for(i = 0; i < n; i += sub) sum += pow(a[i]-b[i], 2);
+ return sqrt(sum);
+}
+
float mse_array(float *a, int n)
{
int i;
@@ -409,7 +581,7 @@
int i;
float sum = 0;
for(i = 0; i < n; ++i){
- sum += a[i]*a[i];
+ sum += a[i]*a[i];
}
return sqrt(sum);
}
@@ -422,6 +594,19 @@
}
}
+int sample_array(float *a, int n)
+{
+ float sum = sum_array(a, n);
+ scale_array(a, n, 1./sum);
+ float r = rand_uniform(0, 1);
+ int i;
+ for(i = 0; i < n; ++i){
+ r = r - a[i];
+ if (r <= 0) return i;
+ }
+ return n-1;
+}
+
int max_index(float *a, int n)
{
if(n <= 0) return -1;
@@ -436,8 +621,27 @@
return max_i;
}
+int int_index(int *a, int val, int n)
+{
+ int i;
+ for (i = 0; i < n; ++i) {
+ if (a[i] == val) return i;
+ }
+ return -1;
+}
+
+int rand_int(int min, int max)
+{
+ if (max < min){
+ int s = min;
+ min = max;
+ max = s;
+ }
+ int r = (rand()%(max - min + 1)) + min;
+ return r;
+}
+
// From http://en.wikipedia.org/wiki/Box%E2%80%93Muller_transform
-#define TWO_PI 6.2831853071795864769252866
float rand_normal()
{
static int haveSpare = 0;
@@ -470,9 +674,34 @@
}
*/
-float rand_uniform()
+size_t rand_size_t()
{
- return (float)rand()/RAND_MAX;
+ return ((size_t)(rand()&0xff) << 56) |
+ ((size_t)(rand()&0xff) << 48) |
+ ((size_t)(rand()&0xff) << 40) |
+ ((size_t)(rand()&0xff) << 32) |
+ ((size_t)(rand()&0xff) << 24) |
+ ((size_t)(rand()&0xff) << 16) |
+ ((size_t)(rand()&0xff) << 8) |
+ ((size_t)(rand()&0xff) << 0);
+}
+
+float rand_uniform(float min, float max)
+{
+ if(max < min){
+ float swap = min;
+ min = max;
+ max = swap;
+ }
+ return ((float)rand()/RAND_MAX * (max - min)) + min;
+ //return (random_float() * (max - min)) + min;
+}
+
+float rand_scale(float s)
+{
+ float scale = rand_uniform_strong(1, s);
+ if(random_gen()%2) return scale;
+ return 1./scale;
}
float **one_hot_encode(float *a, int n, int k)
@@ -487,3 +716,32 @@
return t;
}
+unsigned int random_gen()
+{
+ unsigned int rnd = 0;
+#ifdef WIN32
+ rand_s(&rnd);
+#else
+ rnd = rand();
+#endif
+ return rnd;
+}
+
+float random_float()
+{
+#ifdef WIN32
+ return ((float)random_gen() / (float)UINT_MAX);
+#else
+ return ((float)random_gen() / (float)RAND_MAX);
+#endif
+}
+
+float rand_uniform_strong(float min, float max)
+{
+ if (max < min) {
+ float swap = min;
+ min = max;
+ max = swap;
+ }
+ return (random_float() * (max - min)) + min;
+}
\ No newline at end of file
--
Gitblit v1.10.0