Search

Stripe noise is a common phenomenon arises in the multi-detectors infrared imaging equipment, which not only generally destroys the quality of the image, but also seriously affects the subsequent processing of the image. We exploit the stripe noise features of infrared image, and find that the adjacent noise difference can be well described by the difference of the mean values of adjacent rows in infrared images with the mean compensation and the two-point correction principle. Based on this, a novel stripe noise removal algorithm based on stable window is designed, it is not only effective to remove stripe noise in infrared image without causing undesired blurring effects and artifacts, but also efficient in terms of storage and computing resource utilization for real-time processing. In addition, in order to meet the demands of image real-time processing on satellites, we also design a low-latency, low-energy and highly-paralleled architecture for the de-noising algorithm, and implement it on a field programmable gate array (FPGA) processor. Experimental results show that the proposed algorithm outperforms the other current methods, and it can not only has a better performance in visual effect and objective quality than other state-of-the-art de-noising methods, but also has obvious advantages in the consumption of storage resources due to the design of resource-efficient parallel architecture. For instance, in the consumption of Block RAM storage, compared with the TPC method, this proposed algorithm reduces 80% memory, and gets a significant improvement of the processing speed.

For most of the existing noncloud-covered water region (NCC water region) extraction methods, they are designed for on-ground ship detection. However, these methods could result in low accuracy and expensive computational costs. In this letter, an accurate and fast NCC water region extraction method is proposed for the typical on-orbit ship detection system with limited computing resources available. According to the relative spectral reflectance difference of water, land, and thick cloud, a triple-peak model is first constructed. Next, the parameters of the triple-peak model can be adaptively obtained based on the correlation of the previous adjacent image blocks acquired from the data stream of the panchromatic camera. Subsequently, the accurate NCC water region can be quickly extracted. Moreover, the proposed method is validated using a large amount of raw data captured by panchromatic satellite cameras. The experimental results on a Xilinx-5VFX130t field-programmable gate array imply that the proposed method performs well in the NCC water region extraction with the precision of 99.3% and recall of 99.5%, and it is suitable for on-orbit processing.

Blob analysis has been extensively used in target detection, object recognition, moving target tracking, among other applications. Because blob analysis is computationally expensive, it has become a bottleneck of real-time applications. To tackle this problem, a parallel algorithm for blob analysis is proposed, and a hardware-efficient architecture for this algorithm is presented in this paper. First, based on image data partition and multi-process units, a novel parallel algorithm of blob analysis is proposed to process objects with different types and sizes. Second, a dynamic convex hull calculation method is designed, which is highly efficient for parallel processing and sub-block merging of connected component labeling. Third, a parallel hardware structure of the proposed algorithm is designed and implemented on FPGA. To evaluate performance, blobs of different types and sizes are located by the proposed algorithm in software and hardware. The experimental results demonstrate that the blobs are effectively and correctly located by the proposed algorithm, and the proposed hardware architecture works more efficiently than the state-of-the-art methods.

Sea-land segmentation based on edge detection is commonly utilized in ship detection, coastline extraction, and satellite system applications due to its high accuracy and rapid speed. Pixel-level distribution statistics do not currently satisfy the requirements for high-resolution, large-scale remote sensing image processing. To address the above problem, in this paper, we propose a high-throughput hardware architecture for sea-land segmentation based on multi-dimensional parallel characteristics. The proposed architecture is well suited to wide remote sensing images. Efficient multi-dimensional block level statistics allow for relatively infrequent pixel-level memory access; a boundary block tracking process replaces the whole-image scanning process, markedly enhancing efficiency. The tracking efficiency is further improved by a convenient two-step scanning strategy that feeds back the path state in a timely manner for a large number of blocks in the same direction appearing in the algorithm. The proposed architecture was deployed on Xilinx Virtex k7-410t to find that its practical processing time for a [Formula: see text] remote sensing image is only about 0.4[Formula: see text]s. The peak performance is 1.625[Formula: see text]gbps, which is higher than other FPGA implementations of segmentation algorithms. The proposed structure is highly competitive in processing wide remote sensing images.

Sea land segmentation is an essential part in remote sensing image processing, greatly reducing the interesting area. However, faced with the faster real-time processing of remote sensing images, the SLS algorithm's throughputs is always constrained by the self complexity and the on-chip resources. A new method based on MIMO for balancing resource and throughputs is proposed to segment the sea and land via edge detection. Firstly, according to the situation that the input and output data rate is not equal, the principle of MIMO is introduced to redesign the edge detection structure to double the bandwidth. Second, multi-port cache brings storage resources, which have to be reused, and reduce resource usage. Finally, the parallel sliding widdows method is adopted to usd in piplines of image outputing. The experimental results show that, compared with the state-of-art structure, this method performed better in hardware utilization and bandwidth.

In many typical wireless sensor networks, the nodes are fixed, where cluster based protocols like LEACH were suitable for routing. However, it is another story when the nodes are mobile. This paper proposes a novel routing protocol supporting node mobility called “2L-LEACH-M”, it divides the nodes into two levels: level 1 (cluster-head level) or level 0 (member level), which makes mobile nodes find a cluster-head more easily and hence ensures higher success rate of data transfer between the cluster-head and collector-nodes even when nodes are moving. We have evaluated our proposed protocol under NS2 and the results show that 2L-LEACH-M can significantly improve data transfer rate, compared to LEACH under mobile scenario.