System and method for bad pixel replacement in image processing
AssigneeFreescale Semiconductor, Inc.
InventorsArnold Yanof, Nikos Bellas
Life of this patent
Estimating the term…
Abstract
A system and method is provided for processing a digital image. The system and method processes image data by replacing bad pixel data in the digital image. Specifically, the system and method replaces bad pixel data in the image data by comparing each pixel to selected neighboring pixels, including pixels of other colors in some cases, and determining if the pixel is likely corrupt, such as from a detective pixel. Corrupted pixels are then replaced using averages, means, maximums, or other statistical functions of select nearby pixels.
Claims20
A method of processing a digital image, the method comprising the steps of:
- receiving image data defining the image, the image data including a plurality of pixels;
- determining for each pixel if the pixel is likely corrupt by comparing each pixel to a plurality of neighboring pixels;
- replacing each pixel determined to be likely corrupt with a statistical function of a plurality of nearby pixels.
A method of processing an a digital image, the method comprising the steps of:
- receiving image data defining the image, the image data including a plurality of pixels;
- for each green pixel in the plurality of pixels, replacing likely corrupt green pixels by:
- determining if a green pixel exceeds first selected green-neighboring pixels by a first green threshold difference and replacing the green pixel with an average of first selected green-nearby pixels if the green pixel exceeds the first selected green-neighboring pixels by the first green threshold difference;
- and
- determining if the green pixel is less then second selected green-neighboring pixels by a second green threshold difference and replacing the green pixel with an average of selected green-nearby pixels if the green pixel is less than the second selected green-neighboring pixels by the second green threshold difference;
- and
- for each red pixel in the plurality of pixels, replacing likely corrupt red pixels by:
- determining if a red pixel exceeds first selected red-neighboring pixels by a first red threshold difference and replacing the red pixel with a maximum of first selected red-nearby pixels if the red pixel exceeds the first selected red-neighboring pixels by the first red threshold difference;
- and
- determining if the red pixel exceeds second selected red-neighboring pixels by a second red threshold difference and determining if the red pixel is in a locally flat area and determining if the red pixel is in a locally dark area and replacing the red pixel with a maximum of second selected red-nearby pixels if the red pixel exceeds the second selected red-neighboring pixels by the second red threshold difference and if the red pixel is in a locally flat area or a locally dark area;
- and
- determining if the red pixel is less then third selected red-neighboring pixels by a third red threshold difference and replacing the red pixel with a mean of third selected red-nearby pixels if the red pixel is less than the third selected red-neighboring pixels by the third red threshold difference;
- and
- determining if the red pixel is less then fourth selected red-neighboring pixels by a fourth red threshold difference and determining if the red pixel is in a locally flat area and replacing the red pixel with a mean of fourth selected red-nearby pixels if the red pixel is less than the fourth selected red-neighboring pixels by the fourth red threshold difference and if the red pixel is in a locally flat area;
- and
- for each blue pixel in the plurality of pixels, replacing likely corrupt blue pixels by:
- determining if a blue pixel exceeds any pair of first selected blue-neighboring pixels by a first blue threshold difference determining if the blue pixel is in a locally flat area and determining if the blue pixel is in a locally dark area and replacing the blue pixel with a mean of first selected blue-nearby pixels if the blue pixel exceeds the first selected blue-neighboring pixels by the first blue threshold difference and if the blue pixel is in a locally flat area or a locally dark area;
- and
- determining if the blue pixel is less then second selected blue-neighboring pixels by a second blue threshold difference and determining if the blue pixel is in a locally flat area and replacing the blue pixel with a mean of second selected blue-nearby pixels if the blue pixel is less than the second selected blue-neighboring pixels by the second blue threshold difference and if the blue pixel is in a locally flat area;
- and
- determining if the pixel is less then third selected blue-neighboring pixels by a third blue threshold difference and determining if the blue pixel is in a locally flat area and determining if the blue pixel is in a locally dark area and replacing the blue pixel with a mean of third selected blue-nearby pixels if the blue pixel is less than the third selected blue-neighboring pixels by the third blue threshold difference if the blue pixel is in a locally flat area and in a locally dark area.
A processor, tangibly embodying a program of instructions to perform method steps for digital image processing, comprising the machine executed steps of:
- receiving image data defining the image, the image data including a plurality of pixels;
- determining for each pixel if the pixel is likely corrupt by comparing each pixel to a plurality of neighboring pixels;
- replacing each pixel determined to be likely corrupt with a statistical function of a plurality of nearby pixels.
Dependencies are inferred from the claim text.