Based on the analysis to the behavior of bad pixels, a statistics-based auto-detecting and compensation algorithm for bad pixels is proposed. The correcting process is divided into two stages： bad pixel detection and...Based on the analysis to the behavior of bad pixels, a statistics-based auto-detecting and compensation algorithm for bad pixels is proposed. The correcting process is divided into two stages： bad pixel detection and bad pixel compensation. The proposed detection algorithm is a combination of median filtering and statistic method. Single frame median filtering is used to locate approximate map, then statistic method and threshold value is used to get the accurate location map of bad pixels. When the bad pixel detection is done, neighboring pixel replacement algorithm is used to compensate them in real-time. The effectiveness of this approach is test- ed by applying it to I-IgCATe infrared video. Experiments on real infrared imaging sequences demonstrate that the proposed algorithm requires only a few frames to obtain high quality corrections. It is easy to combine with traditional static methods, update the pre-defined location map in real-time.展开更多
基金Sponsored by the National Natural Science Foundation of China(60877060)
文摘Based on the analysis to the behavior of bad pixels, a statistics-based auto-detecting and compensation algorithm for bad pixels is proposed. The correcting process is divided into two stages： bad pixel detection and bad pixel compensation. The proposed detection algorithm is a combination of median filtering and statistic method. Single frame median filtering is used to locate approximate map, then statistic method and threshold value is used to get the accurate location map of bad pixels. When the bad pixel detection is done, neighboring pixel replacement algorithm is used to compensate them in real-time. The effectiveness of this approach is test- ed by applying it to I-IgCATe infrared video. Experiments on real infrared imaging sequences demonstrate that the proposed algorithm requires only a few frames to obtain high quality corrections. It is easy to combine with traditional static methods, update the pre-defined location map in real-time.
