arXiv subjects

James East

Publications and source records attributed to James East.

At least 55 records · Page 3Linked to original sources

arXiv2019

Endoscopy artifact detection (EAD 2019) challenge dataset

Endoscopic artifacts are a core challenge in facilitating the diagnosis and treatment of diseases in hollow organs. Precise detection of specific artifacts like pixel saturations, motion blur, specular reflections, bubbles and debris is essential for high-quality frame restoration and is crucial for realizing reliable computer-assisted tools for improved patient care. At present most videos in endoscopy are currently not analyzed due to the abundant presence of multi-class artifacts in video frames. Through the endoscopic artifact detection (EAD 2019) challenge, we address this key bottleneck problem by solving the accurate identification and localization of endoscopic frame artifacts to enable further key quantitative analysis of unusable video frames such as mosaicking and 3D reconstruction which is crucial for delivering improved patient care. This paper summarizes the challenge tasks and describes the dataset and evaluation criteria established in the EAD 2019 challenge.

cs.CV↗

arXiv2019

A deep learning framework for quality assessment and restoration in video endoscopy

Endoscopy is a routine imaging technique used for both diagnosis and minimally invasive surgical treatment. Artifacts such as motion blur, bubbles, specular reflections, floating objects and pixel saturation impede the visual interpretation and the automated analysis of endoscopy videos. Given the widespread use of endoscopy in different clinical applications, we contend that the robust and reliable identification of such artifacts and the automated restoration of corrupted video frames is a fundamental medical imaging problem. Existing state-of-the-art methods only deal with the detection and restoration of selected artifacts. However, typically endoscopy videos contain numerous artifacts which motivates to establish a comprehensive solution. We propose a fully automatic framework that can: 1) detect and classify six different primary artifacts, 2) provide a quality score for each frame and 3) restore mildly corrupted frames. To detect different artifacts our framework exploits fast multi-scale, single stage convolutional neural network detector. We introduce a quality metric to assess frame quality and predict image restoration success. Generative adversarial networks with carefully chosen regularization are finally used to restore corrupted frames. Our detector yields the highest mean average precision (mAP at 5% threshold) of 49.0 and the lowest computational time of 88 ms allowing for accurate real-time processing. Our restoration models for blind deblurring, saturation correction and inpainting demonstrate significant improvements over previous methods. On a set of 10 test videos we show that our approach preserves an average of 68.7% which is 25% more frames than that retained from the raw videos.

cs.CV↗

arXiv2018

Integer polygons of given perimeter

A classical result of Honsberger states that the number of incongruent triangles with integer sides and perimeter $n$ is the nearest integer to $\frac{n^2}{48}$ ($n$ even) or $\frac{(n+3)^2}{48}$ ($n$ odd). We solve the analogous problem for $m$-gons (for arbitrary but fixed $m\geq3$), and for polygons (with arbitrary number of sides). We also show that the solution to the latter is asymptotic to $\frac{2^{n-1}}n$, and the former (for fixed $m$) to $\frac{2^{m-1}-m}{2^mm!}n^{m-1}$.

math.CO↗

arXiv2018

Enumeration of idempotents in planar diagram monoids

We classify and enumerate the idempotents in several planar diagram monoids: namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The classification is in terms of certain vertex- and edge-coloured graphs associated to Motzkin diagrams. The enumeration is necessarily algorithmic in nature, and is based on parameters associated to cycle components of these graphs. We compare our algorithms to existing algorithms for enumerating idempotents in arbitrary (regular *-) semigroups, and give several tables of calculated values.

math.CO↗

arXiv2018

Maximal subsemigroups of finite transformation and diagram monoids

We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving transformations and partial permutations considered by V. H. Fernandes and co-authors (12 monoids in total); the partition, Brauer, Jones, and Motzkin monoids; and certain further monoids. Although descriptions of the maximal subsemigroups of some of the aforementioned classes of monoids appear in the literature, we present a unified framework for determining these maximal subsemigroups. This approach is based on a specialised version of an algorithm for determining the maximal subsemigroups of any finite semigroup, developed by the third and fourth authors. This allows us to concisely present the descriptions of the maximal subsemigroups, and to more clearly see their common features.

math.GR↗

arXiv2018

Congruence lattices of finite diagram monoids

We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin monoid, and the partial Brauer monoid. All the congruences under discussion arise as special instances of a new construction, involving an ideal I, a retraction I->M onto the minimal ideal, a congruence on M, and a normal subgroup of a maximal subgroup outside I.

math.GR↗

arXiv2018

Presentations for singular wreath products

For a monoid $M$ and a subsemigroup $S$ of the full transformation semigroup $T_n$, the wreath product $M\wr S$ is defined to be the semidirect product $M^n\rtimes S$, with the coordinatewise action of $S$ on $M^n$. The full wreath product $M\wr T_n$ is isomorphic to the endomorphism monoid of the free $M$-act on $n$ generators. Here, we are particularly interested in the case that $S=Sing_n$ is the singular part of $T_n$, consisting of all non-invertible transformations. Our main results are presentations for $M\wr Sing_n$ in terms of certain natural generating sets, and we prove these via general results on semidirect products and wreath products. We re-prove a classical result of Bulman-Fleming that $M\wr Sing_n$ is idempotent generated if and only if the set $M/L$ of $L$-classes of $M$ forms a chain under the usual ordering of $L$-classes, and we give a presentation for $M\wr Sing_n$ in terms of idempotent generators for such a monoid $M$. Among other results, we also give estimates for the minimal size of a generating set for $M\wr Sing_n$, as well as exact values in some cases (including the case that $M$ is finite and $M/L$ is a chain, in which case we also calculate the minimal size of an idempotent generating set). As an application of our results, we obtain a presentation (with idempotent generators) for the idempotent generated subsemigroup of the endomorphism monoid of a uniform partition of a finite set.

math.GR↗

arXiv2018

Transformation representations of sandwich semigroups

Let $a$ be an element of a semigroup $S$. The local subsemigroup of $S$ with respect to $a$ is the subsemigroup $aSa$ of $S$. The variant of $S$ with respect to $a$ is the semigroup with underlying set $S$ and operation $\star_a$ defined by $x\star_ay=xay$ for $x,y\in S$. We show that the following classes contain precisely the same semigroups, up to isomorphism: all local subsemigroups of all finite full transformation semigroups; and all variants of all finite full transformation semigroups. This result was discovered as a result of some experiments (and accidents) when working with the Semigroups package for GAP.

math.GR↗

arXiv2018

Sandwich semigroups in locally small categories I: Foundations

Fix (not necessarily distinct) objects $i$ and $j$ of a locally small category $S$, and write $S_{ij}$ for the set of all morphisms $i\to j$. Fix a morphism $a\in S_{ji}$, and define an operation $\star_a$ on $S_{ij}$ by $x\star_ay=xay$ for all $x,y\in S_{ij}$. Then $(S_{ij},\star_a)$ is a semigroup, known as a sandwich semigroup, and denoted by $S_{ij}^a$. This article develops a general theory of sandwich semigroups in locally small categories. We begin with structural issues such as regularity, Green's relations and stability, focusing on the relationships between these properties on $S_{ij}^a$ and the whole category $S$. We then identify a natural condition on $a$, called sandwich regularity, under which the set Reg$(S_{ij}^a)$ of all regular elements of $S_{ij}^a$ is a subsemigroup of $S_{ij}^a$. Under this condition, we carefully analyse the structure of the semigroup Reg$(S_{ij}^a)$, relating it via pullback products to certain regular subsemigroups of $S_{ii}$ and $S_{jj}$, and to a certain regular sandwich monoid defined on a subset of $S_{ji}$; among other things, this allows us to also describe the idempotent-generated subsemigroup $\mathbb E(S_{ij}^a)$ of $S_{ij}^a$. We also study combinatorial invariants such as the rank (minimal size of a generating set) of the semigroups $S_{ij}^a$, Reg$(S_{ij}^a)$ and $\mathbb E(S_{ij}^a)$; we give lower bounds for these ranks, and in the case of Reg$(S_{ij}^a)$ and $\mathbb E(S_{ij}^a)$ show that the bounds are sharp under a certain condition we call MI-domination. Applications to concrete categories of transformations and partial transformations are given in Part II.

math.GR↗

arXiv2018

Sandwich semigroups in locally small categories II: Transformations

Fix sets $X$ and $Y$, and write $\mathcal{PT}_{XY}$ for the set of all partial functions $X\to Y$. Fix a partial function $a:Y\to X$, and define the operation $\star_a$ on $\mathcal{PT}_{XY}$ by $f\star_ag=fag$ for $f,g\in\mathcal{PT}_{XY}$. The sandwich semigroup $(\mathcal{PT}_{XY},\star_a)$ is denoted $\mathcal{PT}_{XY}^a$. We apply general results from Part I to thoroughly describe the structural and combinatorial properties of $\mathcal{PT}_{XY}^a$, as well as its regular and idempotent-generated subsemigroups, Reg$(\mathcal{PT}_{XY}^a)$ and $\mathbb E(\mathcal{PT}_{XY}^a)$. After describing regularity, stability and Green's relations and preorders, we exhibit Reg$(\mathcal{PT}_{XY}^a)$ as a pullback product of certain regular subsemigroups of the (non-sandwich) partial transformation semigroups $\mathcal{PT}_X$ and $\mathcal{PT}_Y$, and as a kind of "inflation" of $\mathcal{PT}_A$, where $A$ is the image of the sandwich element $a$. We also calculate the rank (minimal size of a generating set) and, where appropriate, the idempotent rank (minimal size of an idempotent generating set) of $\mathcal{PT}_{XY}^a$, Reg$(\mathcal{PT}_{XY}^a)$ and $\mathbb E(\mathcal{PT}_{XY}^a)$. The same program is also carried out for sandwich semigroups of totally defined functions and for injective partial functions. Several corollaries are obtained for various (non-sandwich) semigroups of (partial) transformations with restricted image, domain and/or kernel.

math.GR↗

arXiv2017

Structural aspects of semigroups based on digraphs

Given any digraph $D$ without loops or multiple arcs, there is a natural construction of a semigroup $\langle D\rangle$ of transformations. To every arc $(a,b)$ of $D$ is associated the idempotent transformation $(a\to b)$ mapping $a$ to $b$ and fixing all vertices other than $a$. The semigroup $\langle D\rangle$ is generated by the idempotent transformations $(a\to b)$ for all arcs $(a,b)$ of $D$. In this paper, we consider the question of when there is a transformation in $\langle D\rangle$ containing a large cycle, and, for fixed $k\in \mathbb N$, we give a linear time algorithm to verify if $\langle D\rangle$ contains a transformation with a cycle of length $k$. We also classify those digraphs $D$ such that $\langle D\rangle$ has one of the following properties: inverse, completely regular, commutative, simple, 0-simple, a semilattice, a rectangular band, congruence-free, is $\mathscr{K}$-trivial or $\mathscr{K}$-universal where $\mathscr{K}$ is any of Green's $\mathscr{H}$-, $\mathscr{L}$-, $\mathscr{R}$-, or $\mathscr{J}$-relation, and when $\langle D\rangle$ has a left, right, or two-sided zero.

math.CO↗

arXiv2017

Enumerating Transformation Semigroups

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation semigroups up to degree 4. Classification of these semigroups up to conjugacy, isomorphism and anti-isomorphism, by size and rank, provides a solid base for further investigations of transformation semigroups.

math.GR↗

arXiv2016

Ranks of ideals in inverse semigroups of difunctional binary relations

The set D_n of all difunctional relations on an n element set is an inverse semigroup under a variation of the usual composition operation. We solve an open problem of Kudryavtseva and Maltcev (2011), which asks: What is the rank (smallest size of a generating set) of D_n? Specifically, we show that the rank of D_n is B(n)+n, where B(n) is the nth Bell number. We also give the rank of an arbitrary ideal of D_n. Although D_n bears many similarities with families such as the full transformation semigroups and symmetric inverse semigroups (all contain the symmetric group and have a chain of J-classes), we note that the fast growth of rank(D_n) as a function of n is a property not shared with these other families.

math.GR↗

arXiv2016

Twisted Brauer monoids

We investigate the structure of the twisted Brauer monoid $\mathcal B_n^τ$, comparing and contrasting it to the structure of the (untwisted) Brauer monoid $\mathcal B_n$. We characterise Green's relations and pre-orders on $\mathcal B_n^τ$, describe the lattice of ideals, and give necessary and sufficient conditions for an ideal to be idempotent-generated. We obtain formulae for the rank (smallest size of a generating set) and (where applicable) the idempotent rank (smallest size of an idempotent generating set) of each principal ideal; in particular, when an ideal is idempotent-generated, its rank and idempotent rank are equal. As an application of our results, we also describe the idempotent-generated subsemigroup of $\mathcal B_n^τ$ (which is not an ideal) as well as the singular ideal of $\mathcal B_n^τ$ (which is neither principal nor idempotent-generated), and we deduce a result of Maltcev and Mazorchuk that the singular part of the Brauer monoid $\mathcal B_n$ is idempotent-generated.

math.GR↗

arXiv2016

Motzkin monoids and partial Brauer monoids

We study the partial Brauer monoid and its planar submonoid, the Motzkin monoid. We conduct a thorough investigation of the structure of both monoids, providing information on normal forms, Green's relations, regularity, ideals, idempotent generation, minimal (idempotent) generating sets, and so on. We obtain necessary and sufficient conditions under which the ideals of these monoids are idempotent-generated. We find formulae for the rank (smallest size of a generating set) of each ideal, and for the idempotent rank (smallest size of an idempotent generating set) of the idempotent-generated subsemigroup of each ideal; in particular, when an ideal is idempotent-generated, the rank and idempotent rank are equal. Along the way, we obtain a number of results of independent interest, and we demonstrate the utility of the semigroup theoretic approach by applying our results to obtain new proofs of important representation theoretic results concerning the corresponding diagram algebras, the partial (or rook) Brauer algebra and Motzkin algebra.

math.GR↗

arXiv2016

Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals

We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of the partition monoid P_n is an idempotent generated semigroup, and obtain a formula for the minimal number of elements (and the minimal number of idempotent elements) needed to generate these semigroups. In particular, we show that these two numbers, which are called the rank and idempotent rank (respectively) of the semigroup, are equal to each other, and we characterize the generating sets of this minimal cardinality. We also characterize and enumerate the minimal idempotent generating sets for the largest proper ideal of P_n, which coincides with the singular part of P_n. Analogous results are proved for the ideals of the Brauer and Jones monoids; in each case, the rank and idempotent rank turn out to be equal, and all the minimal generating sets are described. We also show how the rank and idempotent rank results obtained, when applied to the corresponding twisted semigroup algebras (the partition, Brauer, and Temperley--Lieb algebras), allow one to recover formulae for the dimensions of their cell modules (viewed as cellular algebras) which, in the semisimple case, are formulae for the dimensions of the irreducible representations of the algebras. As well as being of algebraic interest, our results relate to several well-studied topics in graph theory including the problem of counting perfect matchings (which relates to the problem of computing permanents of {0,1}-matrices and the theory of Pfaffian orientations), and the problem of finding factorizations of Johnson graphs. Our results also bring together several well-known number sequences such as Stirling, Bell, Catalan and Fibonacci numbers.

math.GR↗

arXiv2016

Semigroups of rectangular matrices under a sandwich operation

Let $\mathcal M_{mn}=\mathcal M_{mn}(\mathbb F)$ denote the set of all $m\times n$ matrices over a field $\mathbb F$, and fix some $n\times m$ matrix $A\in\mathcal M_{nm}$. An associative operation $\star$ may be defined on $\mathcal M_{mn}$ by $X\star Y=XAY$ for all $X,Y\in\mathcal M_{mn}$, and the resulting \emph{sandwich semigroup} is denoted $\mathcal M_{mn}^A=\mathcal M_{mn}^A(\mathbb F)$. These semigroups are closely related to Munn rings, which are fundamental tools in the representation theory of finite semigroups. In this article, we study $\mathcal M_{mn}^A$ as well as its subsemigroups $\operatorname{Reg}(\mathcal M_{mn}^A)$ and $\mathcal E_{mn}^A$ (consisting of all regular elements and products of idempotents, respectively), as well as the ideals of $\operatorname{Reg}(\mathcal M_{mn}^A)$. Among other results, we: characterise the regular elements, determine Green's relations and preorders, calculate the minimal number of matrices (or idempotent matrices, if applicable) required to generate each semigroup we consider, and classify the isomorphisms between finite sandwich semigroups $\mathcal M_{mn}^A(\mathbb F_1)$ and $\mathcal M_{kl}^B(\mathbb F_2)$. Along the way, we develop a general theory of sandwich semigroups in a suitably defined class of \emph{partial semigroups} related to Ehresmann-style "arrows only" categories, we hope this framework will be useful in studies of sandwich semigroups in other categories. We note that all our results have applications to the \emph{variants} $\mathcal M_n^A$ of the full linear monoid $\mathcal M_n$ (in the case $m=n$), and to certain semigroups of linear transformations of restricted range or kernel (in the case that $\operatorname{rank}(A)$ is equal to one of $m,n$).

math.GR↗

arXiv2016

The idempotent generated subsemigroup of the Kauffman monoid

We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent generating set.

math.GR↗