Compare commits
14
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
54ca7acca2 | ||
|
|
b998717e19 | ||
|
|
89262e4763 | ||
|
|
75dc5fc631 | ||
|
|
d36d185214 | ||
|
|
6c514d28ca | ||
|
|
3a6cf8a104 | ||
|
|
e25875fac6 | ||
|
|
2dffac5f07 | ||
|
|
b30c2a3808 | ||
|
|
89e99abf8e | ||
|
|
113cb5adb3 | ||
|
|
bf7355b3c5 | ||
|
|
7a373d5940 |
+2
-80
@@ -6,95 +6,17 @@
|
||||
#define BUFFER_SIZE 100
|
||||
#define FILE_HEADER_STRING "__info2_image_file_format__"
|
||||
|
||||
// TODO Implementieren Sie geeignete Hilfsfunktionen für das Lesen der Bildserie aus einer Datei
|
||||
|
||||
// TODO Vervollständigen Sie die Funktion readImages unter Benutzung Ihrer Hilfsfunktionen
|
||||
GrayScaleImageSeries *readImages(const char *path)
|
||||
{
|
||||
// Initialisiert einen Zeiger zur struct und reserviert Speicherplatz
|
||||
GrayScaleImageSeries *series = malloc(sizeof(GrayScaleImageSeries));
|
||||
if(series == NULL){
|
||||
printf("Es ist nicht genügend Speicher übrig");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
FILE * data = fopen(path, "rb");
|
||||
if (data == NULL){
|
||||
printf("Die Datei konnte nicht gelesen werden");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
// Überprüfung, ob die Datei einen Header hat
|
||||
char header[BUFFER_SIZE];
|
||||
fread(header, strlen(FILE_HEADER_STRING), 1, data);
|
||||
header[strlen(FILE_HEADER_STRING)] ='\0';
|
||||
if(strncmp(header, FILE_HEADER_STRING, strlen(FILE_HEADER_STRING) )!= 0){
|
||||
printf("Die Datei hat keinen Header");
|
||||
fclose(data);
|
||||
return NULL;
|
||||
}
|
||||
//liest die Anzahl der Bilder aus
|
||||
fread(&series->count, sizeof(unsigned short),1, data);
|
||||
series->images = malloc(series->count * sizeof(GrayScaleImage));
|
||||
if (series->images == NULL){
|
||||
printf("Es ist nicht genügend Speicher übrig");
|
||||
fclose(data);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
//liest die Höhe und Breite der Bilder aus
|
||||
unsigned short height = 0, width = 0;
|
||||
fread(&width, sizeof(unsigned short), 1, data);
|
||||
fread(&height, sizeof(unsigned short), 1, data);
|
||||
GrayScaleImageSeries *series = NULL;
|
||||
|
||||
//reserviert Speicher für die Labels, die aber erst nach jedem Bild eingelesen werden
|
||||
series->labels = malloc(sizeof(unsigned char) * series->count);
|
||||
if (series->labels == NULL){
|
||||
printf("Es ist nicht genügend Speicher übrig");
|
||||
free(series->images);
|
||||
fclose(data);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
//liest jedes Bild einzeln aus und speichert es in images
|
||||
for(int counter_picture = 0 ; counter_picture < series->count; counter_picture++){
|
||||
|
||||
// für jedes Bild muss vorher eine Größe festgelegt werden, die jedoch in diesem Fall immer gleich ist
|
||||
series->images[counter_picture].width = width;
|
||||
series->images[counter_picture].height =height;
|
||||
unsigned int size_picture = height * width;
|
||||
|
||||
//reservieren des Speichers für Buffer, der die einzelnen Pixels speichert
|
||||
series->images[counter_picture].buffer = malloc(size_picture* sizeof(GrayScalePixelType));
|
||||
if (series->images[counter_picture].buffer == NULL){
|
||||
printf("Es ist nicht genügend Speicher übrig");
|
||||
free(series->images);
|
||||
free(series);
|
||||
fclose(data);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
//einlesen der einzelnen Pixel in buffer
|
||||
for(int counter_pixels = 0; counter_pixels < size_picture; counter_pixels++){
|
||||
fread(&series->images[counter_picture].buffer[counter_pixels], sizeof(unsigned char), 1, data);
|
||||
}
|
||||
|
||||
//einlesen der Labels
|
||||
fread(&series->labels[counter_picture], sizeof(unsigned char), 1, data);
|
||||
|
||||
}
|
||||
|
||||
fclose(data);
|
||||
return series;
|
||||
}
|
||||
|
||||
// TODO Vervollständigen Sie die Funktion clearSeries, welche eine Bildserie vollständig aus dem Speicher freigibt
|
||||
void clearSeries(GrayScaleImageSeries *series)
|
||||
{
|
||||
//erst den Speicherplatz der Pixel freigeben
|
||||
for(int number= 0; number < series->count; number++){
|
||||
free(series->images[number].buffer);
|
||||
}
|
||||
// dann die Bilder freigeben
|
||||
free(series-> images);
|
||||
free(series);
|
||||
}
|
||||
+1
-1
@@ -12,7 +12,7 @@ typedef struct
|
||||
|
||||
typedef struct
|
||||
{
|
||||
GrayScaleImage *images; //in sich verschachtelte Struktur
|
||||
GrayScaleImage *images;
|
||||
unsigned char *labels;
|
||||
unsigned int count;
|
||||
} GrayScaleImageSeries;
|
||||
|
||||
@@ -2,20 +2,22 @@
|
||||
#include <string.h>
|
||||
#include "matrix.h"
|
||||
|
||||
// TODO Matrix-Funktionen implementieren
|
||||
|
||||
Matrix createMatrix(unsigned int rows, unsigned int cols)
|
||||
{
|
||||
Matrix m = {NULL, 0, 0};
|
||||
Matrix matrix = {NULL, 0, 0};
|
||||
|
||||
if (rows == 0 || cols == 0)
|
||||
return m;
|
||||
return matrix; //gibt leere Matrix zurück
|
||||
|
||||
m.buffer = (MatrixType *)calloc(rows * cols, sizeof(MatrixType));
|
||||
if (m.buffer == NULL)
|
||||
return m;
|
||||
matrix.buffer = (MatrixType *)calloc(rows * cols, sizeof(MatrixType));
|
||||
if (matrix.buffer == NULL) //auf verfügbaren Speicherplatz prüfen
|
||||
return matrix;
|
||||
|
||||
m.rows = rows;
|
||||
m.cols = cols;
|
||||
return m;
|
||||
matrix.rows = rows;
|
||||
matrix.cols = cols;
|
||||
return matrix; //Matrix zurückgeben
|
||||
}
|
||||
|
||||
void clearMatrix(Matrix *matrix)
|
||||
@@ -23,18 +25,18 @@ void clearMatrix(Matrix *matrix)
|
||||
|
||||
if (matrix != NULL)
|
||||
{
|
||||
free(matrix->buffer);
|
||||
matrix->buffer = 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)
|
||||
// Matrix matrix zu Matrix *matrix, empfehlung
|
||||
void setMatrixAt(MatrixType value, Matrix matrix, unsigned int rowIdx, unsigned int colIdx)
|
||||
{
|
||||
if (rowIdx < matrix.rows && colIdx < matrix.cols && matrix.buffer != NULL)
|
||||
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)
|
||||
@@ -45,11 +47,10 @@ MatrixType getMatrixAt(const Matrix matrix, unsigned int rowIdx, unsigned int co
|
||||
}
|
||||
|
||||
// TODO: Funktionen implementieren
|
||||
|
||||
Matrix add(const Matrix matrix1, const Matrix matrix2)
|
||||
{
|
||||
// check, equal rows
|
||||
// "Elementweise Addition": test, if two matrix has exact size
|
||||
// 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);
|
||||
@@ -64,7 +65,7 @@ Matrix add(const Matrix matrix1, const Matrix matrix2)
|
||||
}
|
||||
return result_add;
|
||||
}
|
||||
// "Broadcasting": matrix1 has 1 collum
|
||||
// "Broadcasting": matrix1 hat 1 Spalte
|
||||
if (matrix1.rows == matrix2.rows && matrix1.cols == 1)
|
||||
{
|
||||
Matrix result_add = createMatrix(matrix1.rows, matrix2.cols);
|
||||
@@ -78,7 +79,7 @@ Matrix add(const Matrix matrix1, const Matrix matrix2)
|
||||
}
|
||||
return result_add;
|
||||
}
|
||||
// "Broadcasting": matrix2 has 1 collum
|
||||
// "Broadcasting": matrix2 hat 1 Spalte
|
||||
if (matrix1.rows == matrix2.rows && matrix2.cols == 1)
|
||||
{
|
||||
Matrix result_add = createMatrix(matrix1.rows, matrix1.cols);
|
||||
@@ -98,13 +99,14 @@ Matrix add(const Matrix matrix1, const Matrix matrix2)
|
||||
|
||||
Matrix multiply(const Matrix matrix1, const Matrix matrix2)
|
||||
{
|
||||
// Needed: rows/Zeilen, collums/Spalten
|
||||
MatrixType buffer_add;
|
||||
// Probe ob Spalten1 = Zeilen2
|
||||
if (matrix1.cols != matrix2.rows)
|
||||
|
||||
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); // ""
|
||||
Matrix result_mul = createMatrix(matrix1.rows, matrix2.cols);
|
||||
|
||||
for (unsigned int index = 0; index < matrix1.rows; index++)
|
||||
{
|
||||
@@ -113,12 +115,10 @@ Matrix multiply(const Matrix matrix1, const Matrix matrix2)
|
||||
buffer_add = 0;
|
||||
for (unsigned int skalar = 0; skalar < matrix1.cols; skalar++)
|
||||
{
|
||||
// buffer_add += matrix1[index][skalar]*matrix2[skalar][shift];
|
||||
buffer_add += getMatrixAt(matrix1, index, skalar) * getMatrixAt(matrix2, skalar, shift);
|
||||
}
|
||||
// matrix_mul[index][shift] = buffer_add;
|
||||
setMatrixAt(buffer_add, result_mul, index, shift); // result als Pointer, also mit &result
|
||||
setMatrixAt(buffer_add, result_mul, index, shift);
|
||||
}
|
||||
}
|
||||
return result_mul;
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user