Binary Dither Interpolation (BDI) is a linear interpolation algorithm simpler and faster than other methods such as tetrahedral interpolation. Conversion methods employing a lookup table (LUT) process color values in three steps: divide inputs into a table indices and fractions to be interpolated, select LUT entries based on the indices, and weight the selected entries based on the fractions.In contrast to other more geometrically-based methods, BDI generates a base index by truncation, then uses the truncated fractions to conduct a binary search among selected entries. In spite of having a very simple neighborhood dither implementation, the perceived quality of resulting images is comparable to that of more conventional methods, particularly with constraints on memory access. This paper describes some implementation costs and image quality trade-offs among trilinear, tetrahedral and binary dither interpolation for color space conversion of digital images.