Open Turbulent Image Set (OTIS)

Nearly Optimal Node-to-Set Parallel Routing in OTIS Networks

The node-to-set parallel routing problem for a k-connected network Γ is as follows: given a node s and k other nodes {t 1 , t 2 , ... , t k } in Γ, find k node-disjoint paths connecting s and t i , for 1 ≤ i ≤ k. From the viewpoint of applications in synthesizing fast and resilient collective communication operations, it is desirable to make the parallel paths as short as possible. Building suc...

Image Processing on the OTIS-Mesh Optoelectronic Computer

Open-Set Language Identification

We present the first open-set language identification experiments using one-class classification models. We first highlight the shortcomings of traditional feature extractionmethods and propose a hashing-based feature vectorization approach as a solution. Using a dataset of 10 languages from different writing systems, we train a One-Class Support Vector Machine using only a monolingual corpus f...

Examples of Set - to - Set Image Classification

We present a framework for representing a set of images as a point on a Grassmann manifold. A collection of sets of images for a specific class is then associated with a collection of points on this manifold. Relationships between classes as defined by points associated with sets of images may be determined using the projection F-norm, geodesic (or other) distances on the Grassmann manifold. We...

Sorting on the OTIS-Mesh

In this paper we present sorting algorithms on the recently introducedN processor OTIS-Mesh, a network with diameter 4 p N 3 consisting of N connected meshes of size p N pN . We show that k-k sorting can be done in 8 p N + O(N 1 3 ) steps for k = 1; 2; 3; 4 and in 2k p N + O(kN 1 3 ) steps for k > 4 with constant buffersize for all k. We show how our algorithms can be modified to achieve 4 p N+...