【正文】
2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 2022 R. C. Gonzalez amp。 R. E. Woods Procedures for Histogram Matching 1) Obtain the histogram of the given image. 2) Use Eq. () to prepute a mapped level sk fro each level rk. 3) Obtain the transformation function G from the given pz(z) using Eq. (). 4) Prepute zk for each value of sk using the iterative scheme defined in connection with Eq. (). 5) For each pixel in the original image, if the value of that pixel is rk, map this value to its corresponding level sk。 R. E. Woods Histogram Matching Digital Image Processing, 2nd ed. 169。 R. E. Woods Implementation Details 1) Each set of gray levels {rj}, {sj}, and {zj}, j=0, 1, 2, …, L1, is onedimensional array of dimension Lx1. 2) All mappings from r to s and from s to z are simple table lookups between a given pixel value and these arrays. 3) Each of the elements of these arrays, for example, sk, contains two important pieces of information: The subscript k denotes the location of the element in the array, and s denotes the value at that location. 4) We need to be concerned only with integer pixel values. Digital Image Processing, 2nd ed. 169。 R. E. Woods Discrete Version ? ?1,...,2,1,0 )(1,...,2,1,0 )(1,...,2,1,0 )()(1,...,2,1,0 )()(11000????????????????????????LksGzLkrTGzLkszpzGvLknnrprTskkkkkikizkkkjjkjjrkkDigital Image Processin