Master's student in Information Engineering and Computer Science, building practical projects in image processing, data structures, and AI-assisted development.
- Implementing image processing algorithms from first principles
- Strengthening data structures and algorithmic problem solving in C and Java
- Building a clearer portfolio around coursework, experiments, and applied software projects
- Manual Histogram Equalization: manual histogram computation, CDF equalization, RGB equalization, and brightness-based enhancement.
- Manual Canny Edge Detection: full Canny pipeline implemented without
cv2.Canny. - Interactive Graph Cut Segmentation: foreground/background segmentation using user seeds, GMMs, graph construction, and min-cut optimization.
- Maze Search: stack-based maze pathfinding in C.
- Matrix Search Benchmark GUI: Java Swing benchmark for sequential, binary, and hash-based search.
- Sparse Matrix Operations: sparse matrix triplet operations with C and Java JNI.
- Stack Expression Converter: infix, postfix, prefix conversion and expression evaluation with C and Java JNI.
- Linked List Polynomial Application: polynomial equation manager using linked lists in C.
- Heap Producer-Consumer Buffer: Java Swing producer-consumer simulation using a min-heap priority buffer.
- Graph Traversal GUI: graph representation, DFS, and BFS traversal with a C backend and Java Swing GUI.
- Graph Applications GUI: MST, shortest path, articulation points, and verification workflows with C and Java Swing.
- Sorting Algorithm Benchmark: sorting benchmark suite across Python, C, and Java with CSV results and charts.
See the grouped index: Academic Coursework
- Email: melovinasjr@gmail.com
- LinkedIn: https://www.linkedin.com/in/ermelovinasjr/
- Portfolio: https://melo-portfolio.onrender.com/