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

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

2012
HAO WANG LING-LING LIU

This paper is in order to improve the efficiency of image segmentation and reduce the amount of user interaction, the mean shift algorithm is proposed with a combination of segmentation methods applied to the vertebra images. The image was pre-processed with the mean shift method and the region graph was obtained instead of pixel graph, which could reduce dozen times edge numbers in the graph. ...

2003
Marius Bulacu Lambert Schomaker Louis Vuurpijl

This paper evaluates the performance of edge-based directional probability distributions as features in writer identification in comparison to a number of non-angular features. It is noted that the joint probability distribution of the angle combination of two ”hinged” edge fragments outperforms all other individual features. Combining features may improve the performance. Limitations of the me...

Journal: :Optics express 2007
Kaan Guven Ekmel Ozbay

We experimentally and numerically investigate the spatial distribution of the emission from a photonic crystal waveguide, coupled with defects, that are located at the output edge. Two defects that are located symmetrically enhance the directivity of the beam compared to that of a plain waveguide, as was reported in recently conducted theoretical work. We further demonstrate that a single defec...

2005
L. M. Galantucci G. Percoco

Reverse Engineering software packages are not able to automatically and robustly detect the sub-regions of a tessellated model; it generally results in a first trial subdivision which subsequently has to be refined, requiring a large amount of human intervention and high computational effort. To avoid these limitations, the authors propose a multilevel local approach for the automatic identific...

2000
Timothy Dorney Srikrishna Bhashyam Andrew Doran Hyeokho Choi Patrick Flandrin Richard Baraniuk

Traditional filtering methods operate on the entire signal or image. In some applications, however, errors are concentrated in specific regions or features. A prime example is images generated using computed tomography. Practical implementations limit the amount of high frequency content in the reconstructed image, and consequently, edges are blurred. We introduce a new post-reconstruction edge...

2014
Gérard Guiffant Patrice Flaud Jean Jacques Durussel Jacques Merckx

Now widely used, totally implantable venous access devices allow mid- and long-term, frequent, repeated, or continuous injection of therapeutic products by vascular, cavitary, or perineural access. The effective flushing of these devices is a key factor that ensures their long-lasting use. We present experimental results and a numerical simulation to demonstrate that the implementation of round...

2011
W. K. A.

Kingsbury, Inc., Philadelphia, PA 19154 In this paper dealing with the tilting pad journal bearing, experim'ental results are presented which show that, at higher shaft speeds, the leading-edge-groove (LEG) design has significantly lower operating temperatures to those of the conventional design of tilting pad journal bearing. Subsequent theoretical analysis has shown that this reduction in pad...

A. Iranmanesh , A. Mahmiani , O. Khormali ,

The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.

A. Mahmiani , O. Khormali , Z. Bagheri ,

The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.

Journal: :iranian journal of mathematical chemistry 2014
a. marandi a. h. nejah a. behmaram

we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

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

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