Fast computer vision algorithms for reconfigurable meshes

摘要

A bus system that can change dynamically to suit computational needs is referred to as reconfigurable. The purpose of this work is to show that a number of seemingly unrelated low-level computer vision tasks are in the same class, in the sense that they can be solved using the same technique. We show that a novel technique for computing integer prefix sums on meshes, augmented with a reconfigurable bus system (reconfigurable meshes), affords us fast algorithms to compute low-level descriptors including perimeter, area, histogram, and median row. Specifically, for an N × N digitized image stored one pixel per processor, all our algorithms run in O(loglogN) time, which is a vast improvement over the state of the art.