oar-ocr 0.10.1

//! The OpenCV operations Indra OCR's reference pipeline uses, on grayscale
//! planes: the gray conversion of `imread`, `resize` with `INTER_LINEAR` and `INTER_AREA`,
//! `warpAffine` rotations, quarter turns, and 4-connected components.
//!
//! The models were trained on crops made by OpenCV, so these reproduce its
//! arithmetic (fixed-point linear coefficients, area tables, round half to
//! even) rather than approximating it with the `image` crate's filters.

use image::{GrayImage, RgbImage};
use rayon::prelude::*;

/// RGB to gray as the reference reads a color PNG (`cv2.imread` with
/// `IMREAD_GRAYSCALE`, which lets libpng convert): 0.299 / 0.587 / 0.114 in
/// 15-bit fixed point, truncated, with gray pixels passed through.
pub(crate) fn rgb_to_gray(image: &RgbImage) -> GrayImage {
    let (w, h) = image.dimensions();
    let data = image
        .as_raw()
        .as_chunks::<3>()
        .0
        .iter()
        .map(|&[r, g, b]| {
            if r == g && r == b {
                r
            } else {
                ((r as u32 * 9797 + g as u32 * 19234 + b as u32 * 3737) >> 15) as u8
            }
        })
        .collect();
    GrayImage::from_raw(w, h, data).expect("buffer matches dimensions")
}

/// Interpolation of [`resize`].
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub(crate) enum Interp {
    Linear,
    Area,
}

/// Saturating round half to even, as OpenCV's `saturate_cast<uchar>(float)`.
fn sat_u8(v: f32) -> u8 {
    v.round_ties_even().clamp(0.0, 255.0) as u8
}

/// `cv2.resize` of an 8-bit plane to `w` x `h`.
pub(crate) fn resize(src: &GrayImage, w: u32, h: u32, interp: Interp) -> GrayImage {
    let (sw, sh) = src.dimensions();
    if (sw, sh) == (w, h) {
        return src.clone();
    }
    // OpenCV derives the scale from its inverse, which can differ in the
    // last bit from `sw / w`.
    let scale_x = 1.0 / (w as f64 / sw as f64);
    let scale_y = 1.0 / (h as f64 / sh as f64);
    let iscale_x = scale_x.round_ties_even() as u32;
    let iscale_y = scale_y.round_ties_even() as u32;
    let area_fast = (scale_x - iscale_x as f64).abs() < f64::EPSILON
        && (scale_y - iscale_y as f64).abs() < f64::EPSILON;
    let mut interp = interp;
    // OpenCV turns an exact 2x linear downscale into an area average.
    if interp == Interp::Linear && area_fast && iscale_x == 2 && iscale_y == 2 {
        interp = Interp::Area;
    }
    let data = if interp == Interp::Area && scale_x >= 1.0 && scale_y >= 1.0 {
        if area_fast {
            resize_area_fast(
                src,
                w as usize,
                h as usize,
                iscale_x as usize,
                iscale_y as usize,
            )
        } else {
            resize_area(src, w as usize, h as usize, scale_x, scale_y)
        }
    } else {
        resize_linear(src, w as usize, h as usize, interp == Interp::Area)
    };
    GrayImage::from_raw(w, h, data).expect("buffer matches dimensions")
}

/// Fixed-point bilinear resize (`INTER_RESIZE_COEF_BITS` = 11); with
/// `area_mode`, the coefficients OpenCV uses to emulate `INTER_AREA` when
/// upscaling.
fn resize_linear(src: &GrayImage, w: usize, h: usize, area_mode: bool) -> Vec<u8> {
    const SCALE: f32 = 2048.0;
    let (sw, sh) = (src.width() as usize, src.height() as usize);
    let s = src.as_raw();
    let (inv_x, inv_y) = (w as f64 / sw as f64, h as f64 / sh as f64);
    let coef = |d: usize, inv: f64, size: usize, clamp: bool| -> (i64, i32, i32) {
        let scale = 1.0 / inv;
        let (mut sx, mut f) = if area_mode {
            let sx = (d as f64 * scale).floor() as i64;
            let f = ((d + 1) as f64 - (sx + 1) as f64 * inv) as f32;
            (sx, if f <= 0.0 { 0.0 } else { f - f.floor() })
        } else {
            let f = ((d as f64 + 0.5) * scale - 0.5) as f32;
            let sx = f.floor() as i64;
            (sx, f - sx as f32)
        };
        if clamp {
            if sx < 0 {
                f = 0.0;
                sx = 0;
            }
            if sx >= size as i64 - 1 {
                f = 0.0;
                sx = size as i64 - 1;
            }
        }
        let a0 = ((1.0 - f) * SCALE).round_ties_even() as i32;
        let a1 = (f * SCALE).round_ties_even() as i32;
        (sx, a0, a1)
    };
    let xs: Vec<_> = (0..w).map(|dx| coef(dx, inv_x, sw, true)).collect();
    let mut out = vec![0u8; w * h];
    let mut r0 = vec![0i32; w];
    let mut r1 = vec![0i32; w];
    let hresize = |row: usize, dst: &mut [i32]| {
        let line = &s[row * sw..(row + 1) * sw];
        for (d, &(sx, a0, a1)) in dst.iter_mut().zip(&xs) {
            let sx = sx as usize;
            *d = if sx + 1 < sw {
                line[sx] as i32 * a0 + line[sx + 1] as i32 * a1
            } else {
                line[sx] as i32 * 2048
            };
        }
    };
    for dy in 0..h {
        // Rows are clamped to the image instead of zeroing the weight.
        let (sy, b0, b1) = coef(dy, inv_y, sh, false);
        let y0 = sy.clamp(0, sh as i64 - 1) as usize;
        let y1 = (sy + 1).clamp(0, sh as i64 - 1) as usize;
        hresize(y0, &mut r0);
        hresize(y1, &mut r1);
        let dst = &mut out[dy * w..(dy + 1) * w];
        for x in 0..w {
            // OpenCV's SIMD rows keep 16 bits: (S >> 4) * b >> 16, then >> 2.
            let v = (((r0[x] >> 4) * b0) >> 16) + (((r1[x] >> 4) * b1) >> 16);
            dst[x] = ((v + 2) >> 2).clamp(0, 255) as u8;
        }
    }
    out
}

/// Block average for integer downscale factors.
fn resize_area_fast(src: &GrayImage, w: usize, h: usize, kx: usize, ky: usize) -> Vec<u8> {
    let sw = src.width() as usize;
    let s = src.as_raw();
    let scale = 1.0f32 / (kx * ky) as f32;
    let mut out = vec![0u8; w * h];
    for dy in 0..h {
        for dx in 0..w {
            let mut sum = 0u32;
            for y in dy * ky..(dy + 1) * ky {
                for x in dx * kx..(dx + 1) * kx {
                    sum += s[y * sw + x] as u32;
                }
            }
            out[dy * w + dx] = if kx == 2 && ky == 2 {
                ((sum + 2) >> 2) as u8
            } else {
                sat_u8(sum as f32 * scale)
            };
        }
    }
    out
}

/// `computeResizeAreaTab`: (destination index, source index, weight).
fn area_tab(ssize: usize, dsize: usize, scale: f64) -> Vec<(usize, usize, f32)> {
    let mut tab = Vec::with_capacity(ssize * 2);
    for d in 0..dsize {
        let fs1 = d as f64 * scale;
        let fs2 = fs1 + scale;
        let cell = scale.min(ssize as f64 - fs1);
        let mut s2 = fs2.floor() as i64;
        s2 = s2.min(ssize as i64 - 1);
        let s1 = (fs1.ceil() as i64).min(s2);
        if s1 as f64 - fs1 > 1e-3 {
            tab.push((d, (s1 - 1) as usize, ((s1 as f64 - fs1) / cell) as f32));
        }
        for s in s1..s2 {
            tab.push((d, s as usize, (1.0 / cell) as f32));
        }
        if fs2 - s2 as f64 > 1e-3 {
            tab.push((
                d,
                s2 as usize,
                ((fs2 - s2 as f64).min(1.0).min(cell) / cell) as f32,
            ));
        }
    }
    tab
}

/// Area-weighted downscale for non-integer factors.
fn resize_area(src: &GrayImage, w: usize, h: usize, scale_x: f64, scale_y: f64) -> Vec<u8> {
    let (sw, sh) = (src.width() as usize, src.height() as usize);
    let s = src.as_raw();
    let xtab = area_tab(sw, w, scale_x);
    let ytab = area_tab(sh, h, scale_y);
    let mut out = vec![0u8; w * h];
    let mut buf = vec![0f32; w];
    let mut sum = vec![0f32; w];
    let mut prev_dy: Option<usize> = None;
    for &(dy, sy, beta) in &ytab {
        buf.fill(0.0);
        let line = &s[sy * sw..(sy + 1) * sw];
        for &(dx, sx, alpha) in &xtab {
            buf[dx] += line[sx] as f32 * alpha;
        }
        if prev_dy != Some(dy) {
            if let Some(p) = prev_dy {
                for (o, v) in out[p * w..(p + 1) * w].iter_mut().zip(&sum) {
                    *o = sat_u8(*v);
                }
            }
            for (v, b) in sum.iter_mut().zip(&buf) {
                *v = beta * b;
            }
            prev_dy = Some(dy);
        } else {
            for (v, b) in sum.iter_mut().zip(&buf) {
                *v += beta * b;
            }
        }
    }
    if let Some(p) = prev_dy {
        for (o, v) in out[p * w..(p + 1) * w].iter_mut().zip(&sum) {
            *o = sat_u8(*v);
        }
    }
    out
}

/// `cv2.getRotationMatrix2D(center, degrees, 1.0)`.
pub(crate) fn rotation_matrix(cx: f64, cy: f64, degrees: f64) -> [f64; 6] {
    let a = degrees.to_radians();
    let (alpha, beta) = (a.cos(), a.sin());
    [
        alpha,
        beta,
        (1.0 - alpha) * cx - beta * cy,
        -beta,
        alpha,
        beta * cx + (1.0 - alpha) * cy,
    ]
}

/// `cv2.invertAffineTransform`.
fn invert_affine(m: &[f64; 6]) -> [f64; 6] {
    let d = m[0] * m[4] - m[1] * m[3];
    let d = if d != 0.0 { 1.0 / d } else { 0.0 };
    let (a11, a22, a12, a21) = (m[4] * d, m[0] * d, -m[1] * d, -m[3] * d);
    [
        a11,
        a12,
        -a11 * m[2] - a12 * m[5],
        a21,
        a22,
        -a21 * m[2] - a22 * m[5],
    ]
}

/// A plane element [`warp`] samples.
trait Pixel: Copy + Default + Send + Sync {
    fn get(self) -> f32;
    fn put(v: f32) -> Self;
}

impl Pixel for u8 {
    fn get(self) -> f32 {
        self as f32
    }
    fn put(v: f32) -> Self {
        sat_u8(v)
    }
}

/// Bilinear `cv2.warpAffine` of a plane onto a same-size plane, with
/// `BORDER_REPLICATE` (`replicate`) or a constant zero border. Rows are
/// computed in parallel.
fn warp<T: Pixel>(src: &[T], w: usize, h: usize, m: &[f64; 6], replicate: bool) -> Vec<T> {
    let inv = invert_affine(m);
    let im = inv.map(|v| v as f32);
    let at = |x: i64, y: i64| -> f32 {
        if replicate {
            T::get(src[y.clamp(0, h as i64 - 1) as usize * w + x.clamp(0, w as i64 - 1) as usize])
        } else if x < 0 || y < 0 || x >= w as i64 || y >= h as i64 {
            0.0
        } else {
            T::get(src[y as usize * w + x as usize])
        }
    };
    let mut out = vec![T::default(); w * h];
    out.par_chunks_mut(w).enumerate().for_each(|(y, row)| {
        let yf = y as f32;
        let (bx, by) = (yf * im[1] + im[2], yf * im[4] + im[5]);
        for (x, o) in row.iter_mut().enumerate() {
            // OpenCV 5's float-coordinate warp: a fused multiply-add per
            // coordinate and lerp-form interpolation.
            let xf = x as f32;
            let sx = xf.mul_add(im[0], bx);
            let sy = xf.mul_add(im[3], by);
            let (x0, y0) = (sx.floor(), sy.floor());
            let (fx, fy) = (sx - x0, sy - y0);
            let (x0, y0) = (x0 as i64, y0 as i64);
            let (p00, p01, p10, p11) =
                if x0 >= 0 && y0 >= 0 && x0 + 1 < w as i64 && y0 + 1 < h as i64 {
                    let i = y0 as usize * w + x0 as usize;
                    (
                        T::get(src[i]),
                        T::get(src[i + 1]),
                        T::get(src[i + w]),
                        T::get(src[i + w + 1]),
                    )
                } else {
                    (
                        at(x0, y0),
                        at(x0 + 1, y0),
                        at(x0, y0 + 1),
                        at(x0 + 1, y0 + 1),
                    )
                };
            let top = p00 + fx * (p01 - p00);
            let bottom = p10 + fx * (p11 - p10);
            *o = T::put(top + fy * (bottom - top));
        }
    });
    out
}

/// An 8-bit plane rotated by `degrees` counter-clockwise about its center,
/// zero outside (`cv2.warpAffine` defaults).
pub(crate) fn rotate_u8_zero(src: &GrayImage, degrees: f64) -> GrayImage {
    let (w, h) = (src.width() as usize, src.height() as usize);
    let m = rotation_matrix(w as f64 / 2.0, h as f64 / 2.0, degrees);
    let data = warp(src.as_raw(), w, h, &m, false);
    GrayImage::from_raw(w as u32, h as u32, data).expect("buffer matches dimensions")
}

/// An 8-bit page rotated by `degrees` counter-clockwise about its center,
/// edges replicated.
pub(crate) fn rotate_u8(src: &GrayImage, degrees: f64) -> GrayImage {
    let (w, h) = (src.width() as usize, src.height() as usize);
    let m = rotation_matrix(w as f64 / 2.0, h as f64 / 2.0, degrees);
    let data = warp(src.as_raw(), w, h, &m, true);
    GrayImage::from_raw(w as u32, h as u32, data).expect("buffer matches dimensions")
}

/// `np.rot90(img, -k)`: `k` quarter turns clockwise.
pub(crate) fn rot90_cw(src: &GrayImage, k: u32) -> GrayImage {
    match k % 4 {
        1 => image::imageops::rotate90(src),
        2 => image::imageops::rotate180(src),
        3 => image::imageops::rotate270(src),
        _ => src.clone(),
    }
}

/// A 4-connected component of a binary mask.
#[derive(Clone, Copy, Debug, Default)]
pub(crate) struct Component {
    pub left: usize,
    pub right: usize,
    pub area: usize,
}

/// `cv2.connectedComponentsWithStats(mask, connectivity=4)`: per-pixel labels
/// (0 = background, components numbered 1.. in raster order of their first
/// pixel) and the stats of component `i` at index `i - 1`.
pub(crate) fn connected_components(
    mask: &[bool],
    w: usize,
    h: usize,
) -> (Vec<u32>, Vec<Component>) {
    fn find(parent: &mut [u32], mut i: u32) -> u32 {
        while parent[i as usize] != i {
            parent[i as usize] = parent[parent[i as usize] as usize];
            i = parent[i as usize];
        }
        i
    }
    let mut labels = vec![0u32; w * h];
    let mut parent = vec![0u32];
    for y in 0..h {
        for x in 0..w {
            let i = y * w + x;
            if !mask[i] {
                continue;
            }
            let up = if y > 0 { labels[i - w] } else { 0 };
            let left = if x > 0 { labels[i - 1] } else { 0 };
            labels[i] = match (up, left) {
                (0, 0) => {
                    let l = parent.len() as u32;
                    parent.push(l);
                    l
                }
                (a, 0) | (0, a) => a,
                (a, b) => {
                    let (ra, rb) = (find(&mut parent, a), find(&mut parent, b));
                    // The smaller root wins, so numbering stays in raster order.
                    let (lo, hi) = (ra.min(rb), ra.max(rb));
                    parent[hi as usize] = lo;
                    lo
                }
            };
        }
    }
    let mut final_label = vec![0u32; parent.len()];
    let mut n = 0u32;
    for i in 1..parent.len() {
        let r = find(&mut parent, i as u32);
        if r == i as u32 {
            n += 1;
            final_label[i] = n;
        } else {
            final_label[i] = final_label[r as usize];
        }
    }
    let mut stats = vec![
        Component {
            left: usize::MAX,
            right: 0,
            area: 0
        };
        n as usize
    ];
    for y in 0..h {
        for x in 0..w {
            let i = y * w + x;
            if labels[i] == 0 {
                continue;
            }
            let l = final_label[labels[i] as usize];
            labels[i] = l;
            let c = &mut stats[l as usize - 1];
            c.left = c.left.min(x);
            c.right = c.right.max(x + 1);
            c.area += 1;
        }
    }
    (labels, stats)
}

#[cfg(test)]
mod tests {
    use super::*;

    /// Outputs of `cv2.resize` (OpenCV 5.0) on a fixed ramp; the models
    /// expect crops made with OpenCV's exact arithmetic.
    #[test]
    fn resize_matches_opencv() {
        let src: Vec<u8> = (0..35u32).map(|i| ((i * 37 + 11) % 256) as u8).collect();
        let a = GrayImage::from_raw(7, 5, src).unwrap();
        let b = image::imageops::crop_imm(&a, 0, 0, 4, 3).to_image();
        let cases: [(&GrayImage, u32, u32, Interp, &[u8]); 4] = [
            (&a, 3, 2, Interp::Linear, &[38, 124, 211, 45, 132, 218]),
            (&a, 3, 2, Interp::Area, &[40, 124, 209, 47, 132, 216]),
            (
                &b,
                6,
                5,
                Interp::Linear,
                &[
                    11, 29, 54, 79, 103, 122, 12, 30, 55, 80, 105, 123, 14, 33, 57, 82, 107, 125,
                    16, 34, 59, 83, 108, 127, 17, 35, 60, 85, 109, 128,
                ],
            ),
            (
                &b,
                6,
                4,
                Interp::Area,
                &[
                    11, 30, 48, 85, 104, 122, 13, 31, 50, 87, 105, 124, 15, 33, 52, 89, 107, 126,
                    17, 36, 54, 91, 110, 128,
                ],
            ),
        ];
        for (src, w, h, interp, expected) in cases {
            assert_eq!(
                resize(src, w, h, interp).as_raw(),
                expected,
                "{w}x{h} {interp:?}"
            );
        }
    }
}