Compare commits

14 Commits
Author SHA1 Message Date
maxgrf 54ca7acca2 Kommentare angepasst 2025-11-20 14:27:47 +01:00
maxgrf b998717e19 angepasste Kommentare 2025-11-20 14:12:47 +01:00
maxgrf 89262e4763 weitere Absicherung multiply 2025-11-18 13:18:29 +01:00
maxgrf 75dc5fc631 formatiert 2025-11-16 21:31:24 +01:00
maxgrf d36d185214 error fix matrix 2025-11-16 21:29:56 +01:00
maxgrf 6c514d28ca error fix matrix 2025-11-16 21:15:00 +01:00
maxgrf 3a6cf8a104 Broadcasting implementiert 2025-11-16 21:11:25 +01:00
maxgrf e25875fac6 reload 2025-11-15 04:07:49 +01:00
maxgrf 2dffac5f07 return in add und mul 2025-11-15 04:01:27 +01:00
maxgrf b30c2a3808 error fix matrix.c 2025-11-15 03:58:42 +01:00
maxgrf 89e99abf8e matrix.h Matrxtyp definiert 2025-11-15 03:51:18 +01:00
maxgrf 113cb5adb3 fix errors in matrix 2025-11-15 03:49:05 +01:00
maxgrf bf7355b3c5 matrix function written 2025-11-15 03:42:28 +01:00
maxgrf 7a373d5940 test2 2025-11-12 09:26:31 +01:00
4 changed files with 101 additions and 49 deletions
-25
View File
@@ -7,25 +7,6 @@
#define FILE_HEADER_STRING "__info2_image_file_format__"
// TODO Implementieren Sie geeignete Hilfsfunktionen für das Lesen der Bildserie aus einer Datei
static int checkFileHeader(FILE *fp)
{
if (!fp) // Datei konnte nicht geöffnet werden
return 0;
char buffer[BUFFER_SIZE];
size_t headerLen = strlen(FILE_HEADER_STRING);
if (headerLen >= BUFFER_SIZE) // Safety Check
return 0;
if (fread(buffer, 1, headerLen, fp) != headerLen)
return 0;
buffer[headerLen] = '\0';
if (strcmp(buffer, FILE_HEADER_STRING) != 0)
return 0;
return 1; // Header stimmt
}
// TODO Vervollständigen Sie die Funktion readImages unter Benutzung Ihrer Hilfsfunktionen
GrayScaleImageSeries *readImages(const char *path)
@@ -38,10 +19,4 @@ GrayScaleImageSeries *readImages(const char *path)
// TODO Vervollständigen Sie die Funktion clearSeries, welche eine Bildserie vollständig aus dem Speicher freigibt
void clearSeries(GrayScaleImageSeries *series)
{
if (series == NULL)
return;
free(series->images);
free(series->labels);
free(series);
}
+92 -20
View File
@@ -6,47 +6,119 @@
Matrix createMatrix(unsigned int rows, unsigned int cols)
{
Matrix matrix = {NULL, 0, 0};
if (rows == 0 || cols == 0)
return matrix; //gibt leere Matrix zurück
matrix.buffer = (MatrixType *)calloc(rows * cols, sizeof(MatrixType));
if (matrix.buffer == NULL) //auf verfügbaren Speicherplatz prüfen
return matrix;
matrix.rows = rows;
matrix.cols = cols;
return matrix; //Matrix zurückgeben
}
void clearMatrix(Matrix *matrix)
{
//test
if (matrix != NULL)
{
free(matrix->buffer); //Speicherplatz bereinigen
matrix->buffer = NULL; //Werte auf 0 setzen
matrix->rows = 0;
matrix->cols = 0;
}
}
void setMatrixAt(MatrixType value, Matrix matrix, unsigned int rowIdx, unsigned int colIdx)
{
if (matrix.buffer != NULL)
{
if (rowIdx < matrix.rows && colIdx < matrix.cols)
{
matrix.buffer[rowIdx * matrix.cols + colIdx] = value;
}
}
if (rowIdx < matrix.rows && colIdx < matrix.cols && matrix.buffer != NULL) //Prüft ob Zugriff möglich
matrix.buffer[rowIdx * matrix.cols + colIdx] = value;
//schreibt 2D element in 1D Liste: Element_Reihe*Matrix_Spalten + Element_Spalte
}
MatrixType getMatrixAt(const Matrix matrix, unsigned int rowIdx, unsigned int colIdx)
{
if (matrix.buffer != NULL)
{
if (rowIdx < matrix.rows && colIdx < matrix.cols)
{
return matrix.buffer[rowIdx * matrix.cols + colIdx];
}
}
else
{
return 0;
}
if (rowIdx >= matrix.rows || colIdx >= matrix.cols || matrix.buffer == NULL)
return 0; // Sicherheitscheck
return matrix.buffer[rowIdx * matrix.cols + colIdx];
}
// TODO: Funktionen implementieren
Matrix add(const Matrix matrix1, const Matrix matrix2)
{
// immer Probe, gleiche Zeilen der Matrizen
// "Elementweise Addition": Probe, ob matrix gleiche größe hat
if (matrix1.rows == matrix2.rows && matrix1.cols == matrix2.cols)
{
Matrix result_add = createMatrix(matrix1.rows, matrix1.cols);
for (int r = 0; r < matrix1.rows; r++)
{
for (int c = 0; c < matrix1.cols; c++)
{
// first version: matrix_add[r][c] = matrix1[r][c] + matrix2[r][c]
MatrixType sum = getMatrixAt(matrix1, r, c) + getMatrixAt(matrix2, r, c);
setMatrixAt(sum, result_add, r, c);
}
}
return result_add;
}
// "Broadcasting": matrix1 hat 1 Spalte
if (matrix1.rows == matrix2.rows && matrix1.cols == 1)
{
Matrix result_add = createMatrix(matrix1.rows, matrix2.cols);
for (int r = 0; r < matrix1.rows; r++)
{
for (int c = 0; c < matrix2.cols; c++)
{
MatrixType sum = getMatrixAt(matrix2, r, c) + getMatrixAt(matrix1, r, 0);
setMatrixAt(sum, result_add, r, c);
}
}
return result_add;
}
// "Broadcasting": matrix2 hat 1 Spalte
if (matrix1.rows == matrix2.rows && matrix2.cols == 1)
{
Matrix result_add = createMatrix(matrix1.rows, matrix1.cols);
for (int r = 0; r < matrix1.rows; r++)
{
for (int c = 0; c < matrix1.cols; c++)
{
MatrixType sum = getMatrixAt(matrix1, r, c) + getMatrixAt(matrix2, r, 0);
setMatrixAt(sum, result_add, r, c);
}
}
return result_add;
}
return createMatrix(0, 0);
}
Matrix multiply(const Matrix matrix1, const Matrix matrix2)
{
MatrixType buffer_add;
if (!matrix1.buffer || !matrix2.buffer) // Probe ob leere Matrize vorliegt
return createMatrix(0, 0);
if (matrix1.cols != matrix2.rows) // Probe ob Spalten1 = Zeilen2
return createMatrix(0, 0);
Matrix result_mul = createMatrix(matrix1.rows, matrix2.cols);
for (unsigned int index = 0; index < matrix1.rows; index++)
{
for (unsigned int shift = 0; shift < matrix2.cols; shift++)
{
buffer_add = 0;
for (unsigned int skalar = 0; skalar < matrix1.cols; skalar++)
{
buffer_add += getMatrixAt(matrix1, index, skalar) * getMatrixAt(matrix2, skalar, shift);
}
setMatrixAt(buffer_add, result_mul, index, shift);
}
}
return result_mul;
}
+5
View File
@@ -6,6 +6,11 @@
typedef float MatrixType;
// TODO Matrixtyp definieren
typedef struct {
MatrixType *buffer;
unsigned int rows;
unsigned int cols;
} Matrix;
Matrix createMatrix(unsigned int rows, unsigned int cols);
+1 -1
View File
@@ -9,7 +9,7 @@
static void prepareNeuralNetworkFile(const char *path, const NeuralNetwork nn)
{
// TODO
}.
}
void test_loadModelReturnsCorrectNumberOfLayers(void)
{