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

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

1995
Nick Barnes

In this paper, we propose a system for vision guided autonomous circumnavigation, allowing robots to navigate around objects of arbitrary pose. The system performs knowledge-based object recognition from an intensity image using a canonical viewer-centred model. A path planned from a geometric model then guides the robot in circum-navigating the object. This system can be used in many applicati...

Journal: :JSW 2012
Mingfu Wang

The most famous one for finding the shortest path is the Dijkstra, but it has some limitations. For example, when there are more than one shortest path between the source node and one special node, Dijkstra could find only one of them. Besides, the algorithm is quite complex. This article introduce a conception of coding graph, abstracting the problem of shortest paths and critical paths into t...

Vegetation in any landscape reflects its health condition. Monitoring land use change and land cover plays a key role in environmental planning and management. Mazandaran province has always been considered by tourists due to its high tourism potential and consequently the vegetation, especially the forest, has been damaged. In this study, vegetation Contiguity and integrity in Mazandaran using...

Journal: :فیزیک زمین و فضا 0
وحید انتظارسعادت دانشجوی کارشناسی ارشد موسسه ژئوفیزیک دانشگاه تهران سید هانی متولی عنبران عضو هیات علمی موسسه ژئوفیزیک دانشگاه تهران

there are several varieties of edge detection method. edge detection and edge enhancement techniques play an essential role in interpreting potential field data. some of common methods are: tilt angle filter (ta), total horizontal derivative of tilt angle filter (thdt), theta filter, tdx filter, hyperbolic tilt angle (hta). these filters maximum values are when facing with the edge of an anomal...

2007
Sébastien Sorlin Christine Solnon Jean-Michel Jolion

Many applications such as information retrieval and classification, involve measuring graph distance or similarity, i.e., matching graphs to identify and quantify their common features. Different kinds of graph matchings have been proposed, giving rise to different graph similarity or distance measures. Graph matchings may be univalent – when each vertex is associated with at most one vertex of...

2008
Shuyuan Yang

The edge map of a facial image contains abundant information about its shape and structure, which is useful for face recognition. To compare edge images, Hausdroff distance is an efficient measure that can determine the degree of their resemblance, and does not require a knowledge of correspondence among those points in the two edge maps. In this paper, a new modified Hausdorff distance measure...

Journal: :JIPS 2014
Kittiya Khongkraphan

The performance of edge detection often relies on its ability to correctly determine the dissimilarities of connected pixels. For grayscale images, the dissimilarity of two pixels is estimated by a scalar difference of their intensities and for color images, this is done by using the vector difference (color distance) of the three-color components. The Euclidean distance in the RGB color space ...

2012
Xiaochun Cai Bo Zhou

The edge Szeged index of a connected graph G is defined as the sum of products mu(e|G)mv(e|G) over all edges e = uv of G, where mu(e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and mv(e|G) is the number of edges whose distance to vertex v is smaller than the distance to vertex u. In this paper, we determine the n-vertex unicyclic graphs with th...

2017
Claudia D'Ambrosio Leo Liberti

Distance Geometry puts the concept of distance at its center. The basic problem in distance geometry could be described as drawing an edge-weighted undirected graph in R for some given K such that the positions for adjacent vertices have distance which is equal to the corresponding edge weight. As we are unaware of any work in this field using any other norm but `2, we move some first steps usi...

1994
Marie-Pierre Dubuisson Anil K. Jain

The purpose of object matching is to decide the similarity between two objects. This paper introduces 24 possible distance measures based on the Hausdor distance between two point sets. These measures can be used to match two sets of edge points extracted from any two objects. Based on our experiments on synthetic images containing various levels of noise, we determined that one of these distan...

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

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