Language: | Slovenian |
---|---|
Year of publishing: | 2013 |
Typology: | 2.11 - Undergraduate Thesis |
Organization: | UL FRI - Faculty of Computer and Information Science |
Publisher: | [G. Čepin] |
UDC: | 004.932(043.2) |
COBISS: |
10160468
![]() |
Views: | 61 |
Downloads: | 6 |
Average score: | 0 (0 votes) |
Metadata: |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Secondary language: | English |
---|---|
Secondary title: | Automatic search for similar unicolored wall painting fragments |
Secondary abstract: | Old wall paintings had over time fallen from the walls and broken into fragments. Reassembly of fragments using real chunks of plaster is a challenging and time-consuming task. With appropriate software it can be done in digital form. In this thesis we discuss one of the challenges that arise in the process, that is automatic search for similar unicolored fragments, which can be placed next to the currently composed patterned fragments, and their clustering. We compare several methods of searching for and clustering of similar fragments. We test these methods on fragments found at archeological site near Celje which originates from the Roman period. |
Secondary keywords: | wall paintings;fragment;spritesheet;histogram;HSV;Hellinger distance;hierarchical clustering;k-means clustering;computer science;computer and information science;diploma; |
File type: | application/pdf |
Type (COBISS): | Bachelor thesis/paper |
Thesis comment: | Univerza v Ljubljani, Fak. za računalništvo in informatiko |
Pages: | 44 str. |
ID: | 24207347 |