Related papers: Color Dipole Moments for Edge Detection
Differential dynamic microscopy (DDM) is increasingly used in the fields of soft matter physics and biophysics to extract the dynamics of microscopic objects across a range of wavevectors using optical microscopy. Standard DDM is limited to…
We present the first evaluation of color dipole cross section from experimental data on diffractive photo- and electroproduction of vector mesons. The dipole-size and energy dependence of the found dipole cross section is consistent with…
Computing the gradient of an image is a common step in computer vision pipelines. The image gradient quantifies the magnitude and direction of edges in an image and is used in creating features for downstream machine learning tasks.…
If supersymmetric unification is true, we show how the combined effort of several experiments under way to try to measure an electric dipole moment of the electron or of the neutron has a significant chance not only of producing a positive…
We give a brief exposition of the color dipole picture of deep inelastic scattering.
Despite recent success of object detectors using deep neural networks, their deployment on safety-critical applications such as self-driving cars remains questionable. This is partly due to the absence of reliable estimation for detectors'…
Semantic boundary and edge detection aims at simultaneously detecting object edge pixels in images and assigning class labels to them. Systematic training of predictors for this task requires the labeling of edges in images which is a…
A $k$-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident to each vertex. The smallest value $k$ for which $G$ admits…
This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…
Dark matter candidates with electromagnetic dipole moments can arise as dark baryons in gauge-mediated or technicolor models. These dark matter candidates interact with nuclei in direct detection experiments mainly through magnetic and/or…
We present a machine learning model for predicting the electric dipole moment of diatomic molecules using only the atomic properties of the constituent atoms. Our model can screen the entire periodic table and identify the molecules with…
We present the contributions to electric dipole moments (EDMs) induced by the Yukawa couplings of an additional electroweak doublet of colour-octet scalars. The full set of one-loop diagrams and the enhanced higher-order effects from…
This is a review paper of traditional approaches for edge, corner, and boundary detection methods. There are many real-world applications of edge, corner, and boundary detection methods. For instance, in medical image analysis, edge…
Permanent electric dipole moments (EDMs) violate parity and time reversal symmetry. Within the Standard Model (SM) they are many orders of magnitude below present experimental sensitivity. Many extensions of the SM predict much larger EDMs,…
We introduce a deterministic approach to edge detection and image segmentation by formulating pseudo-Boolean polynomials on image patches. The approach works by applying a binary classification of blob and edge regions in an image based on…
The electric dipole moment of the electron (eEDM) can be measured with high precision using heavy polar molecules. In this paper, we report on a series of new techniques that have improved the statistical sensitivity of the YbF eEDM…
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
We consider two graph colouring problems in which edges at distance at most $t$ are given distinct colours, for some fixed positive integer $t$. We obtain two upper bounds for the distance-$t$ chromatic index, the least number of colours…
We probe the top-quark electric dipole moment (EDM) in top-quark pair production via photon-photon fusion at a photon linear collider. We show how linearly-polarized photon beams can be used to extract information on the top-quark EDM…