A more constrained and friendlier fork of ImageHash.
imha is constrained to not use numpy and keep dependencies to a minimum. This keeps the package simpler and also easier to be installed on limited environments. imha also offers:
- more customization for parametrizing the hash computation,
- a better engineered hash representation that can be easily converted to different types and representations
- and a command line interface.
As a Python package:
>>> from PIL import Image
>>> import imha
>>> hash1 = imha.average_hash(Image.open("photo1.jpg"))
>>> hash1.bin()
'1111111111010111100100011000000110000001110010011111111111111111'
>>> hash1.hex()
'ffd7918181c9ffff'
>>> hash1.uint()
18435363585078722559
>>> bytes(hash1)
b'\xff\xd7\x91\x81\x81\xc9\xff\xff'
>>> int(hash1)
-11380488630829057
>>> len(hash1) # hash length in bits
64
>>> hash2 = imha.average_hash(Image.open("photo2.jpg"))
>>> hash2.hex()
'9f172786e71f1e00'
>>> hash1 == hash2
False
>>> hash1 - hash2 # hamming distance between hashes
33As a command-line tool:
$ imha --help
usage: imha [--size WIDTH HEIGHT] [--skip-corners] [--format FORMAT] ALGORITHM FILE [FILE ...]
A more constrained and friendlier fork of ImageHash.
positional arguments:
ALGORITHM one of: average_hash, dhash, dhash_vertical
FILE input file(s)
options:
-h, --help show this help message and exit
--version show program's version number and exit
--size WIDTH HEIGHT dimensions to resize the image to (default: see API Reference)
--skip-corners ignore the four corners
--format FORMAT output format, one of: bin, hex, uint, int (default: hex)
$ imha average_hash *.jpg
ffd7918181c9ffff photo1.jpg
9f172786e71f1e00 photo2.jpg
- Generate the same hash values as ImageHash.
- Require only the pillow package.
- Be compatible with currently supported Python versions.
def average_hash(
image: Image.Image, size: tuple[int, int] = (8, 8), *, skip_corners: bool = False
) -> HashCompute Average Hash.
Computes hash with width*height bits. Enabling skip_corners reduces the hash
length by 4 bits. This means a 64-bits hash can be generated with size=(8, 8)
or a 16-bit hash be generated with either size=(4, 4) or
size=(5, 4), skip_corners=True for example.
Arguments:
image: Input image.size: Tuple with width and height to resize the image to. (default:(8, 8))skip_corners: Ignore the four corners. (default:False)
def dhash(
image: Image.Image, size: tuple[int, int] = (9, 8), *, skip_corners: bool = False
) -> HashCompute Difference Hash by row.
Computes row hash with (width-1)*height bits. Enabling skip_corners reduces
the hash length by 4 bits. This means a 64-bits hash can be generated with
size=(9, 8) or a 16-bit hash be generated with either size=(5, 4) or
size=(6, 4), skip_corners=True for example.
Arguments:
image: Input image.size: Tuple with width and height to resize the image to. (default:(9, 8))skip_corners: Ignore the four corners. (default:False)
def dhash_vertical(
image: Image.Image, size: tuple[int, int] = (8, 9), *, skip_corners: bool = False
) -> HashCompute Difference Hash by column.
Computes col hash with width*(height-1) bits. Enabling skip_corners reduces
the hash length by 4 bits. This means a 64-bits hash can be generated with
size=(8, 9) or a 16-bit hash be generated with either size=(4, 5) or
size=(5, 5), skip_corners=True for example.
Arguments:
image: Input image.size: Tuple with width and height to resize the image to. (default:(8, 9))skip_corners: Ignore the four corners. (default:False)
class Hash()Represents a hash object.
The hash value can be converted to various types and representations using the built-in functions and provided methods. The hamming distance between hashes can be computed by subtracting one hash from another.
def __init__(value: int, len_: int) -> NoneCreate hash object.
Arguments:
value: The hash as an unsigned integer value.len_: The hash length in bits.
def bin() -> strReturn the hash binary representation.
def hex() -> strReturn the hash hexadecimal representation.
def uint() -> intReturn the hash as an unsigned integer value.
def __len__() -> intReturn len(self), the hash length in bits.
def __sub__(other: Self) -> intReturn self - other, the hamming distance between hashes.
def __eq__(other: Any) -> boolReturn self == other.
def __hash__() -> intReturn hash(self).
def __bytes__() -> bytesReturn bytes(self), the hash as bytes.
def __int__() -> intReturn int(self), the hash as a signed integer value.
def __index__() -> intReturn integer for bin(self), hex(self) and oct(self).
def __repr__() -> strReturn repr(self).
def __str__() -> strReturn str(self).