Learn More
The high computational complexity and great memory requirement prevent the SIFT algorithm from being processed realtimely. The block-parallel SIFT algorithm with boundary extension adopted by existing researches suffers from redundant storages or extra communications to process the boundaries of partitions. The block-parallel SIFT algorithm without boundary(More)
  • 1