On the complexity of unary tiling-recognizable picture languages