Although edge detection is a well investigated topic, 3D edge detectors mostly lack either accuracy or speed. We will show, how to build a highly accurate subvoxel edge detector, which is fast enough for practical applications. In contrast to other approaches we use a spline interpolation in order to have an efficient approximation of the theoretically ideal sinc interpolator. We give theoretic...

This paper examines the issue of direct extraction of low level features from compressed images. Specifically, we consider the detection of areas of interest and edges in images compressed using the discrete cosine transform (DCT). For interest areas, we show how a measure based on certain DCT coefficients of a block can provide an indication of underlying activity. For edges, we show using an ...

Let G be a simple graph on the vertex set [n] with edge set E(G) and let S be the polynomial ring K[x1, . . . , xn, y1, . . . , yn] in 2n variables endowed with the lexicographic order induced by x1 > · · · > xn > y1 > · · · > yn. The binomial edge ideal JG ⊂ S associated with G is generated by all the binomials fij = xiyj−xjyi with {i, j} ∈ E(G). The binomial edge ideals were introduced in [5]...

Experimental results of sharp edge potentials in the quantum Hall (QH) regime of a two-dimensional electron system are presented. First the general QH edge state picture is reviewed, including recent theory which explains the importance of incompressible strips at the sample edge. Then two sharp edge geometries are presented where incompressible strips are predicted to vanish below the scale of...

Gu map-1 is a modified version of GGH map. It uses same ideal lattices for constructing the trapdoors, while the novelty is that no encodings of zero are given. In this short paper we show that Gu map-1 cannot be used for the instance of witness encryption (WE) based on the hardness of 3-exact cover problem. That is, if Gu map-1 is used for such instance, we can break it by soving a combined 3-...

The well known correspondence between even cycles of an undirected graph and polynomials in a binomial ideal associated to a graph is extended to odd cycles and polynomials in another binomial ideal. Other binomial ideals associated to an undirected graph are also introduced. The results about them with topics on monomial ideals are used in order to show decision procedures for bipartite graphs...