Related papers: Sudoku Associated Two Dimensional Bijections for I…
Data matrix having different sets of entities in its rows and columns are known as two mode data or affiliation data. Many practical problems require to find relationships between the two modes by simultaneously clustering the rows and…
Septoku is a Sudoku variant invented by Bruce Oberg, played on a hexagonal grid of 37 cells. We show that up to rotations, reflections, and symbol permutations, there are only six valid Septoku boards. In order to have a unique solution, we…
Robotic and animal mapping systems share many challenges and characteristics: they must function in a wide variety of environmental conditions, enable the robot or animal to navigate effectively to find food or shelter, and be…
Visualizing spatial correlations in 3D ensembles is challenging due to the vast amounts of information that need to be conveyed. Memory and time constraints make it unfeasible to pre-compute and store the correlations between all pairs of…
Many parallel algorithms which solve basic problems in computer science use auxiliary space linear in the input to facilitate conflict-free computation. There has been significant work on improving these parallel algorithms to be in-place,…
In the parallel processing field, graph embedding is motivated by simulation interconnection networks to another. The quadtree is an important technique used to present spatial data and is used in many application domains, especially…
In this paper we propose an iterative method to address the face identification problem with block occlusions. Our approach utilizes a robust representation based on two characteristics in order to model contiguous errors (e.g., block…
Neural models and symbolic algorithms have recently been combined for tasks requiring both perception and reasoning. Neural models ground perceptual input into a conceptual vocabulary, on which a classical reasoning algorithm is applied to…
Hashing methods have been widely investigated for fast approximate nearest neighbor searching in large data sets. Most existing methods use binary vectors in lower dimensional spaces to represent data points that are usually real vectors of…
Large, high-resolution displays are installed throughout the city as public displays. By superimposing invisible information on the images of these displays, large numbers of devices with cameras and sensors can communicate with the…
In this paper, we introduce a novel implicit neural network for the task of single image super-resolution at arbitrary scale factors. To do this, we represent an image as a decoding function that maps locations in the image along with their…
Superpixels have long been used in image simplification to enable more efficient data processing and storage. However, despite their computational potential, their irregular spatial distribution has often forced deep learning approaches to…
In this paper, a novel image encryption algorithm, which involves a chaotic block image scrambling followed by a two-dimensional (2-D) discrete linear chirp transform, is proposed. The definition of the 2-D discrete linear chirp transform…
Optical fibres are essential for many types of highly-multiplexed and precision spectroscopy. The success of the new generation of multifibre instruments under construction to investigate fundamental problems in cosmology, such as the…
This paper presents a novel spectral algorithm with additive clustering designed to identify overlapping communities in networks. The algorithm is based on geometric properties of the spectrum of the expected adjacency matrix in a random…
This paper proposes a robust, high-precision positioning methodology to address localization failures arising from complex background interference in large-scale flight navigation and the computational inefficiency inherent in conventional…
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…
In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…
This paper studies the optimal solution of the classical problem of detecting the location of multiple image occurrences in a two-dimensional, noisy measurement. Assuming the image occurrences do not overlap, we formulate this task as a…
Spectral embedding finds vector representations of the nodes of a network, based on the eigenvectors of a properly constructed matrix, and has found applications throughout science and technology. Many networks are multipartite, meaning…