1. ## pixel puzzle?

The camcorder has a pickup device (charged coupled device or CCD) consisting of a rectangular array of 300,000 sensors or pixels. Four of these are "hot pixels." In every frame shot with this camcorder these four hot pixels although difficult see will always appear in the same locations.

If every one of the total of 300,000 pixels has an equal chance of being one of the four hot pixels, the odds that out of a total of just four hot pixels they would be at these four specific locations in the array is 1 in 300,000 to the 4th power = 8.1 x 10 to the 20th

1) For a particular high-paying customer, Quality Control at the factory that makes the sensor arrays will "Pass" such a 300,000 pixel array if it has no more than 4 isolated hot pixels. However, adjacent hot pixels are much more readily seen, and therefore any arrays with even two adjacent (either side-by-side or one above the other) hot pixels will be rejected.

2) For less discriminating customers (and paying less), Quality Control will "Pass" those sensor arrays if two hot pixels are adjacent and the total of hot pixels does not exceed 4, but it will reject any arrays having three adjacent hot pixels (either all in line or two side-by-side and the third either above or below one of the first two).

3) For even less discriminating customers Quality Control will "Pass" such a sensor array even if it has three adjacent hot pixels and no more than a total of 4 hot pixels. However, the array will be rejected if all four hot pixels are touching (4 possible configurations).

In these three situations the probability of 1 in 8.1 x 10 to the 20th is too high. Because of the limitations made by Quality Control, not all possible locations of 4 hot pixels in the 300,000 pixel array are permitted. In situation 1), one must subtract from that figure the total number of possible combinations of two adjacent pixels (either side-by-side or one above the other) in an array of 300,000 pixels. For situation 2), one must subtract the total number of possible combinations of three adjacent pixels (both all in line or two side-by-side and the third either above or below one of the first two). For situation 3) one must subtract the total number of possible combinations where all 4 hot pixels are in contact (4 possible configurations).

Show how you would calculate the numbers in these three situations and explain your reasoning.

2. Originally Posted by Geezer
In a criminal investigation (hypothetical) the question is: "Was this home video made using this camcorder?" The camcorder has a pickup device (charged coupled device or CCD) consisting of a rectangular array of 300,000 sensors or pixels. Four of these are "hot pixels." In every frame shot with this camcorder these four hot pixels although difficult see will always appear in the same locations.
The "hot pixel" (or dead pixel or stuck pixel) will always occur in the same location.
(However, over time, as the CCD chip ages, other pixels will deteriorate.)
It is only necessary to find the errant pixels.
That can be done by capturing several frames in a dark (no light whatsoever) space with different shutter speeds. Once that is done, you have have the locations where the pixels are defective.
Check those against the video in evidence.
If the location of the defective pixels in the control frames, match the locations of defective pixels in the video, then that camcorder was the one used to make the video.

The other question deals with quality control at the factory.
how you would calculate the numbers in these three situations
It seems that the question is:
To which customer:
1. a particular high-paying customer;
2. the less discriminating customers ; or
3. the even less discriminating customers
can we sell this defective camcorder?

Without knowing the probability that a defective pixel will occur on the chip, it's almost impossible to give a meaningful answer.

.

3. Did you see this before you posted:
If you have a brain teaser, a word problem or an interesting math problem that doesn't require formal math training, put it in here!