نتایج جستجو برای: edge distance

تعداد نتایج: 343714  

Journal: :Journal of cataract and refractive surgery 2008
Muriël Doors Diana W J K Cals Tos T J M Berendschot John de Brabander Fred Hendrikse Carroll A B Webers Rudy M M A Nuijts

PURPOSE To analyze the position of iris-fixated phakic intraocular lenses (pIOLs) using anterior segment optical coherence tomography (AS-OCT) and evaluate the effect of anterior chamber morphometrics on endothelial cell changes. SETTING Department of Ophthalmology, Academic Hospital Maastricht, The Netherlands. METHODS In this cross-sectional study, AS-OCT was used to measure the distances...

2009
Ruyi Jiang Mutsuhiro Terauchi Reinhard Klette Shigang Wang Tobi Vaudrey

Lane detection and tracking is a significant component of vision-based driver assistance systems (DAS). Low-level image processing is the first step in such a component. This paper suggests three useful techniques for low-level image processing in lane detection situations: bird’s-eye view mapping, a specialized edge detection method, and the distance transform. The first two techniques have be...

Journal: :Pattern Recognition 2001
Jeong-Hun Jang Ki-Sang Hong

A linear band, which is a straight line segment with some width (i.e., thickness), is a more structured, higher-level feature compared to edge or line features. In spite of the usefulness of linear bands as features, papers dealing with their detection problem are rare. In this paper, we propose a new method for detecting linear bands in gray-scale images. We "rst talk about our opinion on what...

2001
Jeong-Hun Jang Ki-Sang Hong

In this paper, we introduce a new tool, called a pseudodistance map (PDM), for extracting skeletons from grayscale images without region segmentation or edge detection. Given an edge-strength function (ESF) of a gray-scale image, the PDM is computed from the ESF using the partial differential equations we propose. The PDM can be thought of as a relaxed version of a Euclidean distance map. There...

Journal: :جنگل و فرآورده های چوب 0
سمیه کرمی راد دانشگاه تهران احسان عبدی دانشکده منابع طبیعی باریس مجنونیان دانشگاه تهران وحید اعتماد دانشگاه تهران هرمز سهرابی دانشگاه تربیت مدرس

road construction is one of the effective factors for ecological changes which affects diversity and species composition in forest roads edges. this research was performed in kheirud forest to evaluate herbaceous diversity and tree regeneration establishment in different distances from road edge. for this purpose, we sampled herbaceous and tree species regeneration in 0,5,10,25, 50 and 100 m di...

In this paper, we classify surface at a constant distance from the edge of regression on translation surfaces of Type 1 in the three dimensional simply isotropic space I^1_3 satisfying some algebraic equations in terms of the coordinate functions and the Laplacian operators with respect to the first, the second and the third fundamental form of the surface. We also give explicit forms of these ...

Journal: :Symmetry 2017
Nazeran Idrees Muhammad Jawwad Saif Asia Rauf Saba Mustafa

The Zagreb eccentricity indices are the eccentricity reformulation of the Zagreb indices. Let H be a simple graph. The first Zagreb eccentricity index (E1(H)) is defined to be the summation of squares of the eccentricity of vertices, i.e., E1(H) = ∑u∈V(H) Symmetry 2016, 9, 7; doi: 10.3390/sym9010007 www.mdpi.com/journal/symmetry Article First and Second Zagreb Eccentricity Indices of Thorny Gra...

1998
Philip N. Klein

An ordered tree is a tree in which each node’s incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. We give an O(n logn) algorithm to compute the e...

Journal: :Graphs and Combinatorics 2013
Javier Cano José Miguel Díaz-Báñez Clemens Huemer Jorge Urrutia

Let P be a set of n points on the plane in general position, n ≥ 3. The edge rotation graph ERG(P, k) of P is the graph whose vertices are the plane geometric graphs on P with exactly k edges, two of which are adjacent if one can be obtained from the other by an edge rotation. In this paper we study some structural properties of ERG(P, k), such as its connectivity and diameter. We show that if ...

2014
George Nagy

Quantification of the rectilinear configuration of typeset rules (lines) opens the way to form classification and content extraction. Line detection on scanned forms is often accomplished with the Hough transform. Here it is followed by simultaneous extraction of the dominant perpendicular sets of extracted lines, which ensures rotation invariance. Translation and scale invariance are attained ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید