When performing any of these arithmatic operations on the images, we do it pixel by pixel. i.e. when we add image f to image g we are adding the gray level at pixel i image f to the gray level at pixel i in image g. In all these case I assume the images are of the same size.

(a) f + g: It is possible to find histogram of f + gin terms of h_g and h_funder any one of these conditions:
1. f = g   (i.e two images are same size and same gray level)
    Steps to find histogram  h_ (f + g) for this condition:
    For each peak in h_gat gray level i move to the right to gray level 2i
    
2. f is a binary image (2 gray levels only), and g is the binary inverse image of f (i.e. if pixel i is 0 in image f then the same pixel i is 1 in image g)
    Steps to find histogram  h_ (f + g) for this condition:
    Since there are only 2 gray levels in  h_g or h_f, then take switch the positions of the peaks.
    
3. g = N × f where N is some integer. i.e. the images differ from each others only by the intensity level. i.e  h_f is a shifted to the right version of h_g and the peaks in h_g are spread out. (Both images are the same size)
Steps to find histogram  h_ (f + g) for this condition:
Starting from left to right in h_f, number each peak. Call this number FormBox[RowBox[{n, =, RowBox[{1., ., K}]}], TraditionalForm] where K is the total number of peaks.Both h_g and h_fwill have the same K but will be located at different gray levels.
Then For each peak n in h_f, with gray level h_f(n) build a new peak in h_ (f + g) with same hight (frequency) as peak n , but at gray level shifted to the right to new gray level of h_f(n) + N h_f(n)

    
(b) f - g This case is the same as case (a), since we can let g^' = -g and then consider f + g^', where g^'is the negative of image g

(c) f × g It is possible to find histogram of f + gin terms of h_g and h_funder any one of these conditions:

1. f = g   (i.e two images are same size and same gray level).
To build the histogram h_ (f + g)do:

Starting from left to right in h_f, number each peak. Call this number FormBox[RowBox[{n, =, RowBox[{1., ., K}]}], TraditionalForm] where K is the number of peaks.Both h_g and h_fwill have the same K since the same image.
Then For each peak n in h_f, with gray level h_f(n) build a new peak in h_ (f + g) with same hight (frequency) as peak n , but at gray level shifted to the right to new gray level of h_f(n) × h_f(n)

2. f is a binary image (2 gray levels only), and g is the binary inverse image of f (i.e. if pixel i is 0 in image f then the same pixel i is 1 in image g) .
Then histogram h_ (f + g) will be one peak at gray level 0 (all black image)

(d) f ÷ g It is possible to find histogram of f + gin terms of h_g and h_funder any one of these conditions:

1. f = g   (i.e two images are same size and same gray level).
The histogram h_ (f + g) in this case will be all at one gray level 1. (All black) (Assuming black is at gray level 1.) if Black is at gray level 0 and white at 255, then it is not possible to divide any 2 images with each others since we will get a divide by zero error.

2. Can not divide binary images (assuming we assign 0 and 1 for the gray level)


Created by Mathematica  (October 23, 2004)