Bad Pixel Correction Using Weak Pixel Pair Detection

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Conventional bad-pixel correction methods fail to detect short bad-pixel clusters composed of three consecutive bad pixels, leading to inefficiencies in image processing.

Innovation Solution

A method and apparatus that dynamically read and label pixels as good, weak, or bad, detect weak-pixel pairs, re-label them as bad pixels, and correct them, reducing computing complexity and false positives by determining short bad-pixel clusters based on pixel locations without computing all pixel coordinates.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional bad-pixel detection algorithm is used, then isolated bad pixels can be detected, but short bad-pixel clusters of three consecutive bad pixels cannot be detected

Engineering Contradiction:

Improvebad pixel detection accuracyVSAvoiddetection capability for different bad pixel patterns

Core Design Contradiction:

Measurement precisionVSAdaptability or versatility

Solution Approach 1:

The patent segments the pixel array into multiple blocks and processes each block independently. Within each block, pixels are labeled as good, weak, or bad based on local characteristics. This segmentation enables the detection of short bad-pixel clusters within blocks while maintaining overall detection accuracy across the entire image sensor array.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent applies different labeling criteria to different regions (blocks) of the pixel array. Each block is processed with localized bad-pixel detection algorithms that consider the specific spatial relationships and characteristics of pixels within that block, enabling accurate detection of short bad-pixel clusters while preserving good pixel identification.

Inventive Principle:

Principle #3Local quality

2Measurement precision

If all pixel coordinates are computed to detect short bad-pixel clusters, then detection completeness improves, but computing complexity increases

Engineering Contradiction:

Improveshort bad-pixel cluster detectionVSAvoidcomputing complexity

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The patent divides the pixel array into blocks and processes each block independently, computing coordinates and detecting bad-pixel clusters only within each block rather than across the entire array. This segmentation significantly reduces the total computing complexity while maintaining detection completeness for short bad-pixel clusters.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent performs coordinate computation and bad-pixel cluster detection only for pixels and blocks that are necessary, rather than processing all pixels uniformly. By focusing computational resources on regions with potential bad pixels and using block-based processing, the algorithm achieves detection completeness with reduced computing complexity.

Inventive Principle:

Principle #16Partial or excessive action

Data Source

PatentUS9807324B2Methods for correcting bad pixels and apparatuses using the same

Publication Date: 2017.10.31 GLENFLY TECH CO LTD

AI summary

A method for correcting bad pixels, performed by a processing unit, at least contains: reading a block of a frame; labeling each pixel of the block as a good pixel, a weak pixel, or a bad pixel; detecting a weak-pixel pair from the block, which includes two pixels labeled as weak pixels; re-labeling the pixels of the weak-pixel pair as bad pixels converted from weak pixels; and correcting the pixels labeled as the bad pixels, and the bad pixels converted from weak pixels.