Related papers: Minimal and Canonical Images
We describe a new algorithm for finding a canonical image of an object under the action of a finite permutation group. This algorithm builds on previous work using Graph Backtracking, which extends Jeffrey Leon's Partition Backtrack…
We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…
The purpose of this paper is to introduce a set of four test images containing features and structures that can facilitate effective examination and comparison of image processing algorithms. More specifically, the images are designed to…
We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…
We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems. First we explain how orbital graphs can be integrated in partition…
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…
We discuss a simple search problem which can be pursued with different methods, either on a classical or on a quantum basis. The system is represented by a chain of trapped ions. The ion to be searched is a member of that chain, consists,…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
Image orientation detection requires high-level scene understanding. Humans use object recognition and contextual scene information to correctly orient images. In literature, the problem of image orientation detection is mostly confronted…
Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol…
Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subproblems. Canonical labeling of combinatorial objects…
We present a fast algorithm for approximate Canonical Correlation Analysis (CCA). Given a pair of tall-and-thin matrices, the proposed algorithm first employs a randomized dimensionality reduction transform to reduce the size of the input…
The individualization-refinement paradigm for computing a canonical labeling and the automorphism group of a graph is investigated. A new algorithmic design aimed at reducing the size of the associated search space is introduced, and a new…
With the rapid progress in quantum hardware and software, the need for verification of quantum systems becomes increasingly crucial. While model checking is a dominant and very successful technique for verifying classical systems, its…
We describe a simple algorithm for classifying orbits into orbit families. This algorithm works by finding patterns in the sign changes of the principal coordinates. Orbits in the logarithmic potential are studied as an application; we…
We present a novel quantum algorithm for classification of images. The algorithm is constructed using principal component analysis and von Neuman quantum measurements. In order to apply the algorithm we present a new quantum representation…
This paper introduces an astronomical image alignment algorithm. This algorithm uses the means of the rows and columns of the original image for alignment, and finds the optimal offset corresponding to the maximum similarity by comparing…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
In this paper, we define the concepts of semi-canonical and canonical binary matrix. Strictly mathematical, we prove the correctness of these definitions. We describe and we implement an algorithm for finding all semi-canonical binary…
We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…