Benchmark instances for making mosaics from Tetris tiles

Read full text
Authors: Herminia I. Calvete, Aitor Hernández, José Ángel Iranzo
Cited by: 0

Abstract

This repository contains the instance files used in the computational experiments for the problem of reproducing grayscale images with Tetris tiles. The repository includes four plain text files named: Mona Lisa.txt, Frankenstein.txt, Einstein.txt, and Liberty.txt. File structure Each file contains the numerical data organized as follows: $m$: Number of rows $n$: Number of columns $\beta_{ij}$: A matrix of dimensions $m \times n$ representing the average brightness of each block, normalized in the range $[0, 1]$. Partition: A vector of length 7 representing the grayscale levels for the tiles using the Uniform Division scheme. Quantile: A vector of length 7 representing the grayscale levels for the tiles using the Quantiles-based scheme. Clustering: A vector of length 7 representing the grayscale levels for the tiles using the K-means clustering scheme. Contact For any questions or further information, please contact José A. Iranzo at joseani@unizar.es.

Fields of Study & Subjects

Metaheuristic Optimization Algorithms Research Optimization and Packing Problems Digital Image Processing Techniques

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
17 February 2026
Language
EN
Document type
Dataset