Inter-operator optimization in deep neural networks (DNNs) relies on accurate data dependency analysis. Traditional machine learning compilers (MLCs) perform static data dependency analysis at the element and operator levels, leading to two key limitations: complex dependencies that hinder efficient inter-operator optimizations, and overlooked parallelizable computations that underutilize GPU resources. We introduce BlockDepend, a novel MLC framework that addresses these issues through block-level dependency analysis. By examining the lower-level phases of compilation, BlockDepend extracts crucial block-level dependency information, simplifying complex relationships between operators and uncovering hidden parallelization opportunities. This allows for targeted optimization strategies that enhance memory access efficiency and improve GPU utilization. Our experiments demonstrate BlockDepend's effectiveness, achieving speedups of 1.71× and 2.88× compared to NVIDIA TensorRT and AMD MIGraphX, respectively, across various workloads.

Automatic optical-to-SAR image registration is considered as a challenging problem because of the inconsistency of radiometric and geometric properties. Feature-based methods have proven to be effective; however, common features are difficult to extract and match, and the robustness of those methods strongly depends on feature extraction results. In this paper, a new method based on iterative line extraction and Voronoi integrated spectral point matching is developed. The core idea consists of three aspects: 1) An iterative procedure that combines line segment extraction and line intersections matching is proposed to avoid registration failure caused by poor feature extraction. 2) A multilevel strategy of coarse-to-fine registration is presented. The coarse registration aims to preserve main linear structures while reducing data redundancy, thus providing robust feature matching results for fine registration. 3) Voronoi diagram is introduced into spectral point matching to further enhance the matching accuracy between two sets of line intersection. Experimental results show that the proposed method improves the matching performance. Compared with previous methods, the proposed algorithm can effectively and robustly generate sufficient reliable point pairs and provide accurate registration.