نتایج جستجو برای: connected component

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

Journal: :Discrete Event Dynamic Systems 2018
Joost Berkhout Bernd Heidergott

The basis of Google’s acclaimed PageRank is an artificial mixing of the Markov chain representing the connectivity structure of the network under study with a maximally connected network where every node is connected to every other node. The rate with which the original network is mixed with the strongly connected one is called damping factor. The choice of the damping factor can influence the ...

Journal: :Int. J. Found. Comput. Sci. 2012
Laura Giambruno Sabrina Mantaci Jean Néraud Carla Selmi

In this paper we generalize an encoding method due to Girod (cf. [7]), based on binary prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A∗, whose length depends on the deciphering delay. We moreover define, as in [5], a d...

Journal: :J. Visual Communication and Image Representation 2012
Wu-Chih Hu Chao-Ho Chen Deng-Yuan Huang Yan-Ting Ye

A scheme based on a difference scheme using object structures and color analysis is proposed for video object segmentation in rainy situations. Since shadows and color reflections on the wet ground pose problems for conventional video object segmentation, the proposed method combines the background construction-based video object segmentation and the foreground extraction-based video object seg...

2004
Abdolah Chalechale Golshah Naghdy Alfred Mertins

This paper presents a new approach for document image decomposition and verification based on connected component analysis and geometric properties of labeled regions. The database contains document images with Persian/Arabic text combined with English text, headlines, ruling lines, trademarks and cursive signatures. In particular, Persian/Arabic signature extraction is investigated using speci...

Journal: :CoRR 2013
Olivier Picard Mélanie Lord Alexandre Blondin Massé Odile Marcotte Marcos Lopes Stevan Harnad

How many words are needed to define all the words in a dictionary? Graph-theoretic analysis reveals that about 10% of a dictionary is a unique Kernel of words that define one another and all the rest, but this is not the smallest such subset. The Kernel consists of one huge strongly connected component (SCC), about half its size, the Core, surrounded by many small SCCs, the Satellites. Core wor...

2001
Zheng Zhang Chew Lim Tan

Perspective distortion always occurs while scanning thick, bound documents. This distortion mainly causes two sources of degradation for the scanned grayscale image – i) shade along the ‘spine’ of the book, and ii) warp of the words in the shade. In this paper, we propose a restoration system to solve these two problems. Our system first produces a vertical projection profile to detect which si...

2016
Fedor Alekseev Mikhail Alekseev Artyom Makovetskii

Linear variation is a topological characteristic of a function of two variables. The problem of linear variation computing can be reduced to the problem of counting connected components in a binary image with eight-connected connectivity. The proposed method is essentially a modification of some known raster algorithms for connected components labeling that groups pixels into 2× 2 cells. A perf...

2007
Eduard Vergés Dolors Ayala Sergi Grau Dani Tost

Recently, the term BioCAD has appeared to refer to the modeling of biological processes. This work focuses on the analysis of structural properties such as porosity of bioimplants for bone reconstruction. Specifically, we present a method that, using 3D microCT images, simulates the behavior of a porosimeter, i.e. an instrument to measure the porous structure of samples. After segmentation, we ...

Journal: :CoRR 2015
B. H. Shekar L. Smitha M.

In this paper, we propose a skeleton matching based approach which aids in text localization in scene images. The input image is preprocessed and segmented into blocks using connected component analysis. We obtain the skeleton of the segmented block using morphology based approach. The skeletonized images are compared with the trained templates in the database to categorize into text and non-te...

1993
Abdel Belaïd O. T. Akindele

A block image labeling method is presented. It does not assume that the blocks to be treated are already segmented nor that they contain homogeneous data. It is based on connected component analysis to label the blocks' contents as small letter text, medium letter text, large letter text, graphics or photographs, giving the percentage of each of these components with respect to the surface area...

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

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