Efficient Field of Vision Algorithms for Large 2D Grids

Title Efficient algorithms for finding disjoint paths in grids

The reconfiguration problem on VLSI/WSI processor arrays in the presence of faulty processors can be stated as the following integral multi-source routing problem [16]: Given a set of N nodes (faulty processors or sources) in an m x n rectangular grid where m, n < N, the problem to be solved is to connect the N nodes to distinct nodes at the grid boundary using a set of “disjoint” paths. This p...

Receptive Field Encoding Model for Dynamic Natural Vision

Introduction: Encoding models are used to predict human brain activity in response to sensory stimuli. The purpose of these models is to explain how sensory information represent in the brain. Convolutional neural networks trained by images are capable of encoding magnetic resonance imaging data of humans viewing natural images. Considering the hemodynamic response function, these networks are ...

Efficient Algorithms for Lossless Compression of 2D/3D Images

Thin Plate Spline Interpolation on Large 2D Grids

In the early 1990s BCS was involved in some image processing and detection projects arising in both natural resource and defense settings. We were convinced that thin plate spline (TPS) functions could play an important role in developing effective software for image registration and change detection, but initially we encountered some computational challenges when using TPS functions on mid-siz...

Efficient Algorithms for Large-Scale Temporal Aggregation

The ability to model time-varying natures is essential to many database applications such as data warehousing and mining. However, the temporal aspects provide many unique characteristics and challenges for query processing and optimization. Among the challenges is computing temporal aggregates, which is complicated by having to compute temporal grouping. In this paper, we introduce a variety o...