نتایج جستجو برای: connected component
تعداد نتایج: 721492 فیلتر نتایج به سال:
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
Let $pounds$ be the category of locally compact abelian groups and $A,Cin pounds$. In this paper, we define component extensions of $A$ by $C$ and show that the set of all component extensions of $A$ by $C$ forms a subgroup of $Ext(C,A)$ whenever $A$ is a connected group. We establish conditions under which the component extensions split and determine LCA groups which are component projective. ...
— This paper presents the method for the extraction of the lungs part from the other parts for the diagnostic of the lungs part. The proposed method is based on the calculation of the connected component and the centroid of the image. Connected Component labeling is used to label the each objects in the binarized image. After the labeling is done, centroid value is calculated for each object. T...
In this paper, we describe a new method to identify the writer of Chinese handwriting documents. There are many methods for signature verification or writer identification, but most of them require segmentation or connected component analysis. They are the kinds of content dependent identification methods as signature verification requires the writer to write the same text (e.g. his name). In o...
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes in G. This article provides a necessary condition for the K node-disjoint paths problem which combines (1) the structure of the reduced graph associated with G, (2) the structure of each strongly connected component o...
We present a fully automatic solution to human face detection on still color images and to the closely related problems of face segmentation and location. Our method is based on the use of color and texture for searching skin-like regions in the images. This is accomplished with connected component analysis in adaptatively thresholded images. Multiple candidate regions appear, so determining wh...
An approach to searching for user-specified words in imaged Chinese documents, without the requirements of layout analysis and OCR processing of the entire documents, is proposed in this paper. A small number of Chinese characters that cannot be successfully bounded using connected component analysis due to larger gaps between elements within the characters are blacklisted. A suitable character...
An approach to searching user-specified words/phrases in Chinese document images, without the requirements of layout analysis, is proposed in this paper. Bounding boxes of Chinese character images are first determined using connected component analysis. Next, a suitable character from the user-specified word/phrase is chosen as the initial character to search for a matching candidate in the doc...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید