Last active
June 22, 2022 23:43
-
-
Save nmichlo/d92e13e2f7de0d96064d5b5bc484f6de to your computer and use it in GitHub Desktop.
N-Dimensional Ordered Dithering
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# ordered dithering generalised to n dims | |
# 2x2 example: | |
# ■ ■ | □ ■ | □ ■ | □ □ | □ □ | |
# ■ ■ | ■ ■ | ■ □ | ■ □ | □ □ | |
# ~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~ | |
# MIT License | |
# | |
# Copyright (c) 2021 Nathan Juraj Michlo | |
# | |
# Permission is hereby granted, free of charge, to any person obtaining a copy | |
# of this software and associated documentation files (the "Software"), to deal | |
# in the Software without restriction, including without limitation the rights | |
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
# copies of the Software, and to permit persons to whom the Software is | |
# furnished to do so, subject to the following conditions: | |
# | |
# The above copyright notice and this permission notice shall be included in | |
# all copies or substantial portions of the Software. | |
# | |
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | |
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | |
# SOFTWARE. | |
# ~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~ | |
import functools | |
from typing import Optional | |
from typing import Sequence | |
import numpy as np | |
# ========================================================================= # | |
# Dither Matrix # | |
# ========================================================================= # | |
def nd_dither_offsets(d: int) -> np.ndarray: | |
""" | |
Get the offsets for the d-dimensional dither matrix. | |
Output: array of shape: [2]*d | |
Algorithm: | |
M(d+1) = | 2 * M(d) | | |
| 2 * flip(M(d)) + 1 | | |
Examples: | |
d=1: | d=2: | d=3: | |
------+---------+---------- | |
[0 1] | [[0 2] | [[[0 4] | |
| [3 1]] | [6 2]] | |
| | [[3 7] | |
| | [5 1]]] | |
""" | |
assert isinstance(d, int) and (d > 0) | |
# base offsets | |
if d == 1: | |
return np.array([0, 1]) | |
# recurse | |
prev = nd_dither_offsets(d=d - 1) | |
offs = np.array([ | |
2 * prev, | |
2 * np.flip(prev) + 1 # flip(prev) is the same as prev[::-1, >>>] with ::-1 in all dimensions | |
]) | |
return _np_immutable_copy(offs) | |
def nd_dither_matrix(n: int = 2, d: int = 2, norm: bool = False) -> np.ndarray: | |
""" | |
Compute the d-dimension dither matrix, with dimensions of size n. | |
- n must be a power of 2! | |
Output: array of shape: [n]*d | |
Algorithm (d=2): | |
M(2n) = | 4 * M(n) + 0 4 * M(n) + 2 | | |
| 4 * M(n) + 3 4 * M(n) + 1 | | |
Examples (n=2, norm=False): | |
d=1: | d=2: | d=3: | |
------+---------+---------- | |
[0 1] | [[0 2] | [[[0 4] | |
| [3 1]] | [6 2]] | |
| | [[3 7] | |
| | [5 1]]] | |
Examples (n=4, norm=False): | |
d=1: | d=2: | |
----------+---------------- | |
[0 2 1 3] | [[ 0 8 2 10] | |
| [12 4 14 6] | |
| [ 3 11 1 9] | |
| [15 7 13 5]] | |
""" | |
assert _is_power_2(n) | |
# handle smallest case | |
if n == 1: | |
return np.zeros([1] * d) # shape: [1] * d | |
# recurse | |
offs = nd_dither_offsets(d=d) # shape: [2] * d | |
prev = nd_dither_matrix(n=n // 2, d=d, norm=False) # shape: [N//2] * d | |
# combine | |
noffs = np.kron( | |
offs, np.ones([n // 2] * d) | |
) # kron, eg. [0, 1] -> [0, 0, 1, 1] | we need to enlarge to shape: [n] * d | |
nprev = np.tile(prev, [2] * d) # tile, eg. [0, 1] -> [0, 1, 0, 1] | we need to enlarge to shape: [n] * d | |
next = nprev * offs.size + noffs # shape: [n] * d | |
# return | |
if norm: | |
next /= next.size | |
return _np_immutable_copy(next) # shape: [n] * d | |
# ========================================================================= # | |
# Apply Dithering # | |
# ========================================================================= # | |
def nd_dither(arr: np.ndarray, n: int = 2, axis: Optional[Sequence[int]] = None) -> np.ndarray: | |
""" | |
Apply ordered dithering along the specified axes of an array. | |
The array must be floats with values in the range [0, 1] | |
If axis is not specified, then all the axes are dithered. | |
The output is a boolean array with the same shape as the input arr. | |
""" | |
dd = nd_dither_matrix_like(arr, n=n, axis=axis, norm=True, expand=True) | |
# compute dither | |
return arr > dd | |
def nd_dither_matrix_like(arr: np.ndarray, n: int = 2, axis: Optional[Sequence[int]] = None, norm: bool = True, expand: bool = True) -> np.ndarray: | |
""" | |
Tile the dither matrix across an array. | |
- `norm` specifies that the values should be in the range [0, 1) | |
and not the original indices in the range [0, 2**d) | |
- Use `axis` to specify which dimensions are tiled | |
unspecified dimensions are set to size 1 for broadcasting | |
with the original matrix, unless `expand=False` | |
- `n` is the size of the underlying dither matrix which is tiled | |
""" | |
axis = _normalize_axis(arr.ndim, tuple(axis)) | |
sizes = np.array(arr.shape)[axis] | |
# get dither values | |
d_mat = nd_dither_matrix(n=n, d=len(axis), norm=norm) | |
# repeat values across array, rounding up and then trimming dims | |
dd = np.tile(d_mat, (sizes + n - 1) // n) | |
dd = dd[tuple(slice(0, l) for l in sizes)] | |
# create missing dims | |
if expand: | |
dd = np.expand_dims(dd, axis=tuple(set(range(arr.ndim)) - set(axis))) | |
# done | |
return dd | |
# ========================================================================= # | |
# Helper # | |
# ========================================================================= # | |
def _np_immutable_copy(arr: np.ndarray): | |
arr = np.copy(arr) # does not copy inner python objects | |
arr.flags.writeable = False | |
return arr | |
def _is_power_2(num: int): | |
assert isinstance(num, int) | |
if num <= 0: | |
return False | |
return not bool(num & (num - 1)) | |
@functools.lru_cache() | |
def _normalize_axis(ndim: int, axis: Optional[Sequence[int]]) -> np.ndarray: | |
# TODO: this functionality may be duplicated | |
# defaults | |
if axis is None: | |
axis = np.arange(ndim) | |
# convert | |
axis = np.array(axis) | |
if axis.ndim == 0: | |
axis = axis[None] | |
# checks | |
assert axis.ndim == 1 | |
assert axis.dtype in ('int', 'int32', 'int64') | |
# convert | |
axis = np.where(axis < 0, ndim + axis, axis) | |
axis = np.sort(axis) | |
# checks | |
assert np.unique(axis).shape == axis.shape | |
assert np.all(0 <= axis) | |
assert np.all(axis < ndim) | |
# done! | |
return _np_immutable_copy(axis) # shape: [d] | |
# ========================================================================= # | |
# END # | |
# ========================================================================= # |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment