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

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

Journal: :علوم کاربردی و محاسباتی در مکانیک 0
رحمن سیفی زهرا عباسی

in this paper, formation of wrinkling in bimetal deep drawing process has been investigated by the analytical, numerical and experimental methods. the effects of width of flange, fillet radii of matrix and punch, clearance of blank holder, contact conditions and relative thickness of two sheets on the number and height of wrinkle waves are studied. clearance and contact conditions have the grea...

Journal: :journal of current ophthalmology 0
مهدی حسینی تهرانی mehdi hosseinitehrani سیدفرزاد محمدی s-farzad mohammadi آسو عل محمودی asou alimahmoudi ونداد فرهادی vandad farhady

we are describing a new surgical approach in the management of advanced ocular surface cicatrization through a single procedure conjunctival-limbal-corneal allograft in which the external eye is resurfaced it involves a lamellar corneolimbal keratoplasty, 360° limbal stem cell transfer (on a “bipedicle” conjunctival-corneal carrier), and conjunctival tissue transplantation - all in a single con...

2002
Patrick S. Huggins Steven W. Zucker

Edge detection depends not only upon the assumed model of what an edge is, but also on how this model is represented. The problem of how to represent the edge model is typically neglected, despite the fact that the representation is a bottleneck for both computational cost and accuracy. We propose to represent edge models by a partition of the edge manifold corresponding to the edge model, wher...

Journal: :Pattern Recognition 2009
Chia-Hung Wei Yue Li Wing-Yin Chau Chang-Tsun Li

A trademark image retrieval (TIR) system is proposed in this work to deal with the vast number of trademark images in the trademark registration system. The proposed approach commences with the extraction of edges using the Canny edge detector, performs a shape normalization procedure, and then extracts the global and local features. The global features capture the gross essence of the shapes w...

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1997
Michael D. Heath Sudeep Sarkar Thomas A. Sanocki Kevin W. Bowyer

A new method for evaluating edge detection algorithms is presented and applied to measure the relative performance of algorithms by Canny, Nalwa-Binford, Iverson-Zucker, Bergholm, and Rothwell. The basic measure of performance is a visual rating score which indicates the perceived quality of the edges for identifying an object. The process of evaluating edge detection algorithms with this perfo...

Journal: :CoRR 2016
Giorgio Toscana Stefano Rosa

Object segmentation is an important capability for robotic systems, in particular for grasping. We present a graphbased approach for the segmentation of simple objects from RGB-D images. We are interested in segmenting objects with large variety in appearance, from lack of texture to strong textures, for the task of robotic grasping. The algorithm does not rely on image features or machine lear...

2015
Yuexiang Li Siu-Yeung Cho John Crowe

Since cell biologists need to use image processing techniques, such as edge detection, to analyze cell images the precision of these techniques is pivotal to their work. Due to the often low quality of cell images, existing edge detectors fail to routinely produce highly accurate results. In this paper, a novel hybrid method based on the canny operator and fuzzy entropy theory is proposed. The ...

2003
Theo Gevers

We aim at using color information to classify the physical nature of edges in video. To achieve physics-based edge classification, we first propose a novel approach to color edge detection by automatic noise-adaptive thresholding derived from sensor noise analysis. Then, we present a taxonomy on color edge types. As a result, a parameter-free edge classifier is obtained labeling color transitio...

‎The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$‎ ‎such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial‎ ‎automorphism‎. ‎For any $n in mathbb{N}$‎, ‎the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...

An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...

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

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