New Internal Clustering Evaluation Index Based on Line Segments

With the rapid progress of digital image technology, the management of duplicate document images is also emphasized widely. As a result, this paper suggests a duplicate Chinese document image retrieval (DCDIR) system, which uses the ratio of the number of black pixels to that of white pixels on the scanned line segments in a character image block as the feature of the character image block. Experimental results indicate that the system can indeed effectively and quickly retrieve the desired duplicate Chinese document image from a database.

Download Full-text

Quantitative Imaging With Incident Field Modeling From Multistatic Measurements on Line Segments

IEEE Antennas and Wireless Propagation Letters ◽

10.1109/lawp.2014.2360775 ◽

2015 ◽

Vol 14 ◽

pp. 253-256 ◽

Cited By ~ 4

Author(s):

Soufiane Nounouh ◽

Christelle Eyraud ◽

Amelie Litman ◽

Herve Tortel

Keyword(s):

Quantitative Imaging ◽

Incident Field ◽

Line Segments ◽

Field Modeling ◽

On Line

Download Full-text

Proximity problems on line segments spanned by points

Computational Geometry ◽

10.1016/j.comgeo.2005.08.007 ◽

2006 ◽

Vol 33 (3) ◽

pp. 115-129 ◽

Cited By ~ 4

Author(s):

Ovidiu Daescu ◽

Jun Luo ◽

David M. Mount

Keyword(s):

Line Segments ◽

On Line

Download Full-text

Yang–Mills Measure on the Two-Dimensional Torus as a Random Distribution

Communications in Mathematical Physics ◽

10.1007/s00220-019-03567-5 ◽

2019 ◽

Vol 372 (3) ◽

pp. 1027-1058

Author(s):

Ilya Chevyrev

Keyword(s):

Random Distribution ◽

Random Variable ◽

Continuous Functions ◽

Small Scale ◽

Dimensional Torus ◽

Hölder Continuous ◽

Line Segments ◽

Yang Mills ◽

Hölder Continuous Functions ◽

On Line

Abstract We introduce a space of distributional 1-forms $$\Omega ^1_\alpha $$Ωα1 on the torus $$\mathbf {T}^2$$T2 for which holonomies along axis paths are well-defined and induce Hölder continuous functions on line segments. We show that there exists an $$\Omega ^1_\alpha $$Ωα1-valued random variable A for which Wilson loop observables of axis paths coincide in law with the corresponding observables under the Yang–Mills measure in the sense of Lévy (Mem Am Math Soc 166(790), 2003). It holds furthermore that $$\Omega ^1_\alpha $$Ωα1 embeds into the Hölder–Besov space $$\mathcal {C}^{\alpha -1}$$Cα-1 for all $$\alpha \in (0,1)$$α∈(0,1), so that A has the correct small scale regularity expected from perturbation theory. Our method is based on a Landau-type gauge applied to lattice approximations.

Download Full-text

VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME

International Journal of Computational Geometry & Applications ◽

10.1142/s0218195900000309 ◽

2000 ◽

Vol 10 (05) ◽

pp. 535-552 ◽

Cited By ~ 4

Author(s):

MARK KEIL ◽

DAVID M. MOUNT ◽

S. K. WISMATH

Keyword(s):

Practical Method ◽

Visibility Graph ◽

New Technique ◽

Line Segments ◽

Depth First Search ◽

On Line ◽

A New Technique ◽

Visibility Polygons

Given a set S of n non-intersecting line segments in the plane, we vpresent a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth-first spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depth-first search. It is a practical method and has been implemented in C++ using LEDA.

Download Full-text