Related papers: A note on digitized angles
The polarization state of the optical electromagnetic field lying several nanometers above complex dielectric structures reveals the intricate light-matter interaction that occurs in this near-field zone. This information can only be…
I give a brief review of results obtained recently at Ecole Normale on the depinning transition of interfaces and contact lines using a variety of approaches: non-local Monte Carlo algorithms, dynamical renormalization group calculations to…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
In this article, we investigate some properties of the coincidence point set of digitally continuous maps. Following the Rosenfeld graphical model which seems more combinatorial than topological, we expect to achieve results that might not…
Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. The reason for this is that edges form the outline of an object. An edge is the…
We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs.
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…
We study the crossover between liquid and solid electron phases in a two-dimensional harmonic trap as the density is progressively diluted. We infer the formation of geometrically ordered phases from charge distributions and pair…
In this paper we use a new logarithmic model of image representation, developed in [1,2], for edge detection. In fact, in the framework of the new model we obtain the formulas for computing the "contrast of a pixel" and the "contrast" image…
A bisection line divides a convex planar curve into two parts with equal areas. It is natural to study the envelope of these lines, which in general present singularities. The polygonal case is particularly inte\-resting, since there are…
This paper presents an iterative smoothing technique for polygonal approximation of digital image boundary. The technique starts with finest initial segmentation points of a curve. The contribution of initially segmented points towards…
Image Registration is the process of aligning two or more images of the same scene with reference to a particular image. The images are captured from various sensors at different times and at multiple view-points. Thus to get a better…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
In this work we present a unified method of relative camera pose estimation from points and lines correspondences. Given a set of 2D points and lines correspondences in three views, of which two are known, a method has been developed for…
Line waves are defined as confined edge modes propagating at the interface of dual electromagnetic metasurfaces that preserve mirror reflection symmetries. Previous works have theoretically and practically explored these waves, showing that…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Finding point-wise correspondences between images is a long-standing problem in image analysis. This becomes particularly challenging for sketch images, due to the varying nature of human drawing style, projection distortions and viewport…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.