Relevant bibliographies by topics / Connected component

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Connected component'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Connected component.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Connected component"

1

Møller, Jesper, and Rasmus Plenge Waagepetersen. "Markov connected component fields." Advances in Applied Probability 30, no. 1 (1998): 1–35. http://dx.doi.org/10.1239/aap/1035227989.

Full text
Abstract:
A new class of Gibbsian models with potentials associated with the connected components or homogeneous parts of images is introduced. For these models the neighbourhood of a pixel is not fixed as for Markov random fields, but is given by the components which are adjacent to the pixel. The relationship to Markov random fields and marked point processes is explored and spatial Markov properties are established. Extensions to infinite lattices are also studied, and statistical inference problems including geostatistical applications and statistical image analysis are discussed. Finally, simulation studies are presented which show that the models may be appropriate for a variety of interesting patterns, including images exhibiting intermediate degrees of spatial continuity and images of objects against background.
APA, Harvard, Vancouver, ISO, and other styles
2

Møller, Jesper, and Rasmus Plenge Waagepetersen. "Markov connected component fields." Advances in Applied Probability 30, no. 01 (1998): 1–35. http://dx.doi.org/10.1017/s0001867800008053.

Full text
Abstract:
A new class of Gibbsian models with potentials associated with the connected components or homogeneous parts of images is introduced. For these models the neighbourhood of a pixel is not fixed as for Markov random fields, but is given by the components which are adjacent to the pixel. The relationship to Markov random fields and marked point processes is explored and spatial Markov properties are established. Extensions to infinite lattices are also studied, and statistical inference problems including geostatistical applications and statistical image analysis are discussed. Finally, simulation studies are presented which show that the models may be appropriate for a variety of interesting patterns, including images exhibiting intermediate degrees of spatial continuity and images of objects against background.
APA, Harvard, Vancouver, ISO, and other styles
3

He, Lifeng, Yuyan Chao, Kenji Suzuki, and Kesheng Wu. "Fast connected-component labeling." Pattern Recognition 42, no. 9 (2009): 1977–87. http://dx.doi.org/10.1016/j.patcog.2008.10.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

M⊘ller, Jesper, and Rasmus Waagepetersen. "Markov connected component fields." Advances in Applied Probability 28, no. 2 (1996): 340. http://dx.doi.org/10.1017/s0001867800048400.

Full text
Abstract:
A new class of Gibbsian models with potentials associated with the connected components or homogeneous parts of images is introduced. The relationship with Markov random fields and marked point processes is explored and spatial Markov properties are established. Further, extensions to infinite lattices are studied. Statistical inference problems including geostatistical applications and statistical image analysis are also discussed. Finally, simulation studies are presented which show that the models may be appropriate for a variety of interesting patterns.
APA, Harvard, Vancouver, ISO, and other styles
5

Rakhmadi. "Connected Component Labeling Using Components Neighbors-Scan Labeling Approach." Journal of Computer Science 6, no. 10 (2010): 1099–107. http://dx.doi.org/10.3844/jcssp.2010.1099.1107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gayathri Devi, G. "Positional Connected Component Labeling Algorithm." Indian Journal of Science and Technology 7, no. 3 (2013): 306–11. http://dx.doi.org/10.17485/ijst/2014/v7i3.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Al-Ghour, Samer, and Hanan Al-Saadi. "Soft weakly connected sets and soft weakly connected components." AIMS Mathematics 9, no. 1 (2023): 1562–75. http://dx.doi.org/10.3934/math.2024077.

Full text
Abstract:
<abstract><p>Although the concept of connectedness may seem simple, it holds profound implications for topology and its applications. The concept of connectedness serves as a fundamental component in the Intermediate Value Theorem. Connectedness is significant in various applications, including geographic information systems, population modeling and robotics motion planning. Furthermore, connectedness plays a crucial role in distinguishing between different topological spaces. In this paper, we define soft weakly connected sets as a new class of soft sets that strictly contains the class of soft connected sets. We characterize this new class of sets by several methods. We explore various results related to soft subsets, supersets, unions, intersections and subspaces within the context of soft weakly connected sets. Additionally, we provide characterizations for soft weakly connected sets classified as soft pre-open, semi-open or $ \alpha $-open sets. Furthermore, we introduce the concept of a soft weakly connected component as follows: Given a soft point $ a_{x} $ in a soft topological space $ \left(X, \Delta, A\right) $, we define the soft weakly component of $ \left(X, \Delta, A\right) $ determined by $ a_{x} $ as the largest soft weakly connected set, with respect to the soft inclusion ($ \widetilde{\subseteq } $) relation, that contains $ a_{x} $. We demonstrate that the family of soft weakly components within a soft topological space comprises soft closed sets, forming a soft partition of the space. Lastly, we establish that soft weak connectedness is preserved under soft $ \alpha $-continuity.</p></abstract>
APA, Harvard, Vancouver, ISO, and other styles
8

Bok, Kyoungsoo, Namyoung Kim, Dojin Choi, Jongtae Lim, and Jaesoo Yoo. "Incremental Connected Component Detection for Graph Streams on GPU." Electronics 12, no. 6 (2023): 1465. http://dx.doi.org/10.3390/electronics12061465.

Full text
Abstract:
Studies on the real-time detection of connected components in graph streams have been carried out. The existing connected component detection method cannot process connected components incrementally, and the performance deteriorates due to frequent data transmission when GPU is used. In this paper, we propose a new incremental processing method to solve the problems found in the existing methods for detecting connected components on GPUs. The proposed method minimizes the amount of data to be sent to the GPU by determining the subgraph affected by the graph stream update and by detecting the part to be recalculated. We consider the number of vertices to quickly determine the connected components of a graph stream on the GPU. An asynchronous execution method is used to shorten the transfer time between the CPU and the GPU according to real-time graph stream changes. In order to show that the proposed method provides fast incremental connected component detection on the GPU, we evaluated its performance using various datasets.
APA, Harvard, Vancouver, ISO, and other styles
9

IIJIMA, Yusuke, and Tomo MURAO. "On Connected Component Decompositions of Quandles." Tokyo Journal of Mathematics 42, no. 1 (2019): 63–82. http://dx.doi.org/10.3836/tjm/1502179252.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Umniati, Naeli, Achmad Benny Mutiara, Tubagus Maulana Kusuma, and Suryarini Widodo. "Component-connected Feature for Signature Identification." International Journal on Advanced Science, Engineering and Information Technology 8, no. 3 (2018): 756. http://dx.doi.org/10.18517/ijaseit.8.3.2880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Connected component"

1

Morimitsu, Alexandre. "Computação incremental e eficiente de sequências de árvores de componentes." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12112015-150044/.

Full text
Abstract:
Árvore de componentes é uma forma hierárquica de representar imagens em níveis de cinza baseada nas relações de inclusão dos componentes conexos da imagem. A escolha da vizinhança utilizada para gerar os componentes impacta diretamente na árvore resultante, de forma que uma alteração na escolha da vizinhança pode acarretar em uma alteração na árvore de componentes obtida. Em particular, quando uma sequência de vizinhanças crescentes é usada, os nós das árvores obtidas a partir dessas vizinhanças satisfazem uma relação de inclusão, de forma que se é possível estabelecer relações entre nós de diferentes árvores. Assim sendo, o principal objetivo desta dissertação consiste no desenvolvimento de um algoritmo eficiente para a construção de uma sequência de árvores de componentes. Para tanto, será introduzida uma classe particular de sequências de vizinhanças, que não apenas satisfaz a propriedade crescente como também permite que as árvores de componentes associadas a ela sejam construídas de forma incremental. Com base nestas propriedades, um novo algoritmo de construção de árvores de componentes associado a esta classe de vizinhanças será proposto. Para analisar a eficiência do algoritmo proposto apresentamos, ao final do texto, alguns resultados práticos e teóricos obtidos com relação ao consumo de tempo e à complexidade computacional.<br>Component tree is a hierarchical way of representing gray-level images based on the inclusion relation of the connected components of the image. The choice of the neighborhood used to generate these components directly impacts in the resulting tree: changing the neighborhood used may cause a change in the resulting component tree. In particular, when considering a sequence of increasing neighborhoods, the nodes of the obtained from these neighborhoods will also satisfy an inclusion relation and that will make it possible to link nodes from different trees. Therefore, the main goal of this dissertation is the development of an efficient algorithm to build a sequence of component trees. In order to do that, we will introduce a class of sequences of neighborhood that not only satisfy the increasing property but also makes it possible to incrementally build the trees associated to it. This additional property will guide us to a novel algorithm, that will build the component trees associated to this class of neighborhoods. To show how efficient the proposed algorithm is, we present some experimental and theoretical results regarding time consumption and computational complexity.
APA, Harvard, Vancouver, ISO, and other styles
2

Matas, Petr. "Connected component tree construction for embedded systems." Thesis, Paris Est, 2014. http://www.theses.fr/2014PEST1116/document.

Full text
Abstract:
L'objectif du travail présenté dans cette thèse est de proposer un avancement dans la construction des systèmes embarqués de traitement d'images numériques, flexibles et puissants. La proposition est d'explorer l'utilisation d'une représentation d'image particulière appelée « arbre des composantes connexes » (connected component tree – CCT) en tant que base pour la mise en œuvre de l'ensemble de la chaîne de traitement d'image. Cela est possible parce que la représentation par CCT est à la fois formelle et générale. De plus, les opérateurs déjà existants et basés sur CCT recouvrent tous les domaines de traitement d'image : du filtrage de base, passant par la segmentation jusqu'à la reconnaissance des objets. Une chaîne de traitement basée sur la représentation d'image par CCT est typiquement composée d'une cascade de transformations de CCT où chaque transformation représente un opérateur individuel. A la fin, une restitution d'image pour visualiser les résultats est nécessaire. Dans cette chaîne typique, c'est la construction du CCT qui représente la tâche nécessitant le plus de temps de calcul et de ressources matérielles. C'est pour cette raison que ce travail se concentre sur la problématique de la construction rapide de CCT. Dans ce manuscrit, nous introduisons le CCT et ses représentations possibles dans la mémoire de l'ordinateur. Nous présentons une partie de ses applications et analysons les algorithmes existants de sa construction. Par la suite, nous proposons un nouvel algorithme de construction parallèle de CCT qui produit le « parent point tree » représentation de CCT. L'algorithme est conçu pour les systèmes embarqués, ainsi notre effort vise la minimisation de la mémoire occupée. L'algorithme en lui-même se compose d'un grand nombre de tâches de la « construction » et de la « fusion ». Une tâche de construction construit le CCT d'une seule ligne d'image, donc d'un signal à une dimension. Les tâches de fusion construisent progressivement le CCT de l'ensemble. Pour optimiser la gestion des ressources de calcul, trois différentes stratégies d'ordonnancement des tâches sont développées et évaluées. Également, les performances des implantations de l'algorithme sont évaluées sur plusieurs ordinateurs parallèles. Un débit de 83 Mpx/s pour une accélération de 13,3 est réalisé sur une machine 16-core avec Opteron 885 processeurs. Les résultats obtenus nous ont encouragés pour procéder à une mise en œuvre d'une nouvelle implantation matérielle parallèle de l'algorithme. L'architecture proposée contient 16 blocs de base, chacun dédié à la transformation d'une partie de l'image et comprenant des unités de calcul et la mémoire. Un système spécial d'interconnexions est conçu pour permettre à certaines unités de calcul d'accéder à la mémoire partagée dans d'autres blocs de base. Ceci est nécessaire pour la fusion des CCT partiels. L'architecture a été implantée en VHDL et sa simulation fonctionnelle permet d'estimer une performance de 145 Mpx/s à fréquence d'horloge de 120 MHz<br>The aim of this work is to enable construction of embedded digital image processing systems, which are both flexible and powerful. The thesis proposal explores the possibility of using an image representation called connected component tree (CCT) as the basis for implementation of the entire image processing chain. This is possible, because the CCT is both simple and general, as CCT-based implementations of operators spanning from filtering to segmentation and recognition exist. A typical CCT-based image processing chain consists of CCT construction from an input image, a cascade of CCT transformations, which implement the individual operators, and image restitution, which generates the output image from the modified CCT. The most time-demanding step is the CCT construction and this work focuses on it. It introduces the CCT and its possible representations in computer memory, shows some of its applications and analyzes existing CCT construction algorithms. A new parallel CCT construction algorithm producing the parent point tree representation of the CCT is proposed. The algorithm is suitable for an embedded system implementation due to its low memory requirements. The algorithm consists of many building and merging tasks. A building task constructs the CCT of a single image line, which is treated as a one-dimensional signal. Merging tasks fuse the CCTs together. Three different task scheduling strategies are developed and evaluated. Performance of the algorithm is evaluated on multiple parallel computers. A throughput 83 Mpx/s at speedup 13.3 is achieved on a 16-core machine with Opteron 885 CPUs. Next, the new algorithm is further adapted for hardware implementation and implemented as a new parallel hardware architecture. The architecture contains 16 basic blocks, each dedicated to processing of an image partition and consisting of execution units and memory. A special interconnection switch is designed to allow some executions units to access memory in other basic blocks. The algorithm requires this for the final merging of the CCTs constructed by different basic blocks together. The architecture is implemented in VHDL and its functional simulation shows performance 145 Mpx/s at clock frequency 120 MHz
APA, Harvard, Vancouver, ISO, and other styles
3

Larose, Christopher James. "Micro-Specialization in Multidimensional Connected-Component Labeling." Thesis, The University of Arizona, 2014. http://hdl.handle.net/10150/321789.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chai, Bing-Bing. "Significance-linked connected component analysis and morpho-subband decomposition for multiresolution image compression /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9842514.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Berba, Farag Hussein Bahri. "Minimisation of output DC current component in grid-connected inverters for solar power applications." Thesis, University of Newcastle Upon Tyne, 2012. http://hdl.handle.net/10443/1548.

Full text
Abstract:
In grid-connected photovoltaic applications, a supply-frequency output transformer is normally used to isolate the inverter from the supply. This transformer is heavy, costly and adds to the overall power loss. However removal of the output transformer can result in unwanted DC components appearing in the inverter output current. Excessive DC current injection into the distribution network can affect distribution components as well as other loads connected to the network. There are various circuits which can be used to for grid connection without the use of an output transformer. These include the 2-level half-bridge and the H-bridge inverters. These circuits have the disadvantage of the requirement for higher rated power devices or increased EMI problems due to high frequency switching of the DC-link relative to earth. To overcome these problems, a three-level half-bridge inverter circuit is used, where the DC-link voltage can be twice the device voltage rating allowing the use low rated switching devices. The neutral conductor is connected to the mid-point of a split rail supply from PV array, and therefore the DC-link voltage is not switching relative to earth. The aim of this research is to minimise the DC current component in the output of a grid-connected inverter when a supply-frequency output transformer is not used. A three-level diode-clamped half-bridge inverter is proposed to interface the PV panel directly to the utility grid. The main contribution of this research lies in the development of an auto-calibration technique for the DC-link current sensors in the multi-level inverter. Combined with a current feedback control scheme this technique allows the minimisation of DC current offset drift in the Hall-Effect current sensors. Auto-calibrated DC-link current sensors in turn allow the inverter output current controller to minimise the output DC current component in spite of sensor drift and other disturbances. A comprehensive review on the different types of grid-connected PV systems, the problems caused by DC current injection into the grid, and up-to-date techniques to overcome this problem is included. The performance of the auto-calibration technique is investigated using both computer simulation and an experimental test rig.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Phillip Hua-Kuan. "The applications of component mode analysis on the response characteristics of a flexible connected beam." Thesis, Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/17572.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pidcock, Dan. "Convex hull generation, connected component labelling, and minimum distance calculation for set-theoretically defined models." Thesis, University of Bath, 2000. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ortiz, Marby Zuley Bolaños. "Componentes conexas de grupos em teorias NIP." Universidade Federal de Goiás, 2017. http://repositorio.bc.ufg.br/tede/handle/tede/7089.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2017-04-06T12:58:28Z No. of bitstreams: 2 Dissertação - Marby Zuley Bolaños Ortiz - 2017.pdf: 1515856 bytes, checksum: 739fa4d4c051b1c82f2f7ed1e4427c73 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-04-06T12:58:41Z (GMT) No. of bitstreams: 2 Dissertação - Marby Zuley Bolaños Ortiz - 2017.pdf: 1515856 bytes, checksum: 739fa4d4c051b1c82f2f7ed1e4427c73 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Made available in DSpace on 2017-04-06T12:58:41Z (GMT). No. of bitstreams: 2 Dissertação - Marby Zuley Bolaños Ortiz - 2017.pdf: 1515856 bytes, checksum: 739fa4d4c051b1c82f2f7ed1e4427c73 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-03-30<br>Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPq<br>In this work, we estudied three special subgroups of bounded index in G: The intersection of subgroups definables of G, the small type-definable subgroup and the small invariant subgroup of G, called connected components of G and denoted G0G00 e G¥. We give an exposition of theorem of Gismatullim, where he proved the existence of G¥ in a theory with NIP.<br>Neste trabalho estudamos três subgrupos de um grupo G com índices limitados em G: A interseção de todos os subgrupos definíveis de G , o menor subgrupo tipo-definível e o menor subgrupo invariante de G, chamados componentes conexas de G, denotados respectivamente G0G00 e G¥. Apresentamos uma demonstração da existência de G¥ em uma teoria NIP, baseados na prova feita por Gismatullin em 2011.
APA, Harvard, Vancouver, ISO, and other styles
9

Cabaret, Laurent. "Algorithmes d'étiquetage en composantes connexes efficaces pour architectures hautes performances." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS299/document.

Full text
Abstract:
Ces travaux de thèse, dans le domaine de l'adéquation algorithme architecture pour la vision par ordinateur, ont pour cadre l'étiquetage en composantes connexes (ECC) dans le contexte parallèle des architectures hautes performances. Alors que les architectures généralistes modernes sont multi-coeur, les algorithmes d'ECC sont majoritairement séquentiels, irréguliers et utilisent une structure de graphe pour représenter les relations d'équivalences entre étiquettes ce qui rend complexe leur parallélisation. L'ECC permet à partir d'une image binaire, de regrouper sous une même étiquette tous les pixels connexes, il fait ainsi le pont entre les traitements bas niveaux tels que le filtrage et ceux de haut niveau tels que la reconnaissance de forme ou la prise de décision. Il est donc impliqué dans un grand nombre de chaînes de traitements qui nécessitent l'analyse d'image segmentées. L'accélération de cette étape représente donc un enjeu pour tout un ensemble d'algorithmes.Les travaux de thèse se sont tout d'abord concentrés sur les performances comparées des algorithmes de l'état de l'art tant pour l'ECC que pour l'analyse des caractéristiques des composantes connexes (ACC) afin d'en dégager une hiérarchie et d’identifier les composantes déterminantes des algorithmes. Pour cela, une méthode d'évaluation des performances, reproductible et indépendante du domaine applicatif, a été proposée et appliquée à un ensemble représentatif des algorithmes de l'état de l'art. Les résultats montrent que l'algorithme séquentiel le plus rapide est l'algorithme LSL qui manipule des segments contrairement aux autres algorithmes qui manipulent des pixels.Dans un deuxième temps, une méthode de parallélisation des algorithmes directs utilisant OpenMP a été proposé avec pour objectif principal de réaliser l’ACC à la volée et de diminuer le coût de la communication entre les threads. Pour cela, l'image binaire est découpée en bandes traitées en parallèle sur chaque coeur du l'architecture, puis une étape de fusion pyramidale d'ensembles deux à deux disjoint d'étiquettes permet d'obtenir l'image complètement étiquetée sans avoir de concurrence d'accès aux données entre les différents threads. La procédure d'évaluation des performances appliquée a des machines de degré de parallélisme variés, a démontré que la méthode de parallélisation proposée était efficace et qu'elle s'appliquait à tous les algorithmes directs. L'algorithme LSL s'est encore avéré être le plus rapide et le seul adapté à l'augmentation du nombre de coeurs du fait de son approche «segments». Pour une architecture à 60 coeurs, l'algorithme LSL permet de traiter de 42,4 milliards de pixels par seconde pour des images de taille 8192x8192, tandis que le plus rapide des algorithmes pixels est limité par la bande passante et sature à 5,8 milliards de pixels par seconde.Après ces travaux, notre attention s'est portée sur les algorithmes d'ECC itératifs dans le but de développer des algorithmes pour les architectures manycore et GPU. Les algorithmes itératifs se basant sur un mécanisme de propagation des étiquettes de proche en proche, aucune autre structure que l'image n'est nécessaire ce qui permet d'en réaliser une implémentation massivement parallèle (MPAR). Ces travaux ont menés à la création de deux nouveaux algorithmes.- Une amélioration incrémentale de MPAR utilisant un ensemble de mécanismes tels qu'un balayage alternatif, l'utilisation d'instructions SIMD ainsi qu'un mécanisme de tuiles actives permettant de répartir la charge entre les différents coeurs tout en limitant le traitement des pixels aux zones actives de l'image et à leurs voisines.- Un algorithme mettant en œuvre la relation d’équivalence directement dans l’image pour réduire le nombre d'itérations nécessaires à l'étiquetage. Une implémentation pour GPU basée sur les instructions atomic avec un pré-étiquetage en mémoire locale a été réalisée et s'est révélée efficace dès les images de petite taille<br>This PHD work take place in the field of algorithm-architecture matching for computer vision, specifically for the connected component labeling (CCL) for high performance parallel architectures.While modern architectures are overwhelmingly multi-core, CCL algorithms are mostly sequential, irregular and they use a graph structure to represent the equivalences between labels. This aspects make their parallelization challenging.CCL processes a binary image and gathers under the same label all the connected pixels, doing so CCL is a bridge between low level operations like filtering and high level ones like shape recognition and decision-making.It is involved in a large number of processing chains that require segmented image analysis. The acceleration of this step is therefore an issue for a variety of algorithms.At first, the PHD work focused on the comparative performance of the State-of-the-Art algorithms, as for CCL than for the features analysis of the connected components (CCA) in order to identify a hierarchy and the critical components of the algorithms. For this, a benchmarking method, reproducible and independent of the application domain was proposed and applied to a representative set of State-of-the-Art algorithms. The results show that the fastest sequential algorithm is the LSL algorithm which manipulates segments unlike other algorithms that manipulate pixels.Secondly, a parallelization framework of directs algorithms based on OpenMP was proposed with the main objective to compute the CCA on the fly and reduce the cost of communication between threads.For this, the binary image is divided into bands processed in parallel on each core of the architecture and a pyramidal fusion step that processes the generated disjoint sets of labels provides the fully labeled image without concurrent access to data between threads.The benchmarking procedure applied to several machines of various parallelism level, shows that the proposed parallelization framework applies to all the direct algorithms.The LSL algorithm is once again the fastest and the only one suitable when the number of cores increases due to its run-based conception. With an architecture of 60 cores, the LSL algorithm can process 42.4 billion pixels per second for images of 8192x8192 pixels, while the fastest pixel-based algorithm is limited by the bandwidth and saturates at 5.8 billion pixels per second.After these works, our attention focused on iterative CCL algorithms in order to develop new algorithms for many-core and GPU architectures. The Iterative algorithms are based on a local propagation mechanism without supplementary equivalence structure which allows to achieve a massively parallel implementation (MPAR). This work led to the creation of two new algorithms.- An incremental improvement of MPAR using a set of mechanisms such as an alternative scanning, the use of SIMD instructions and an active tile mechanism to distribute the load between the different cores while limiting the processing of the pixels to the active areas of the image and to their neighbors.- An algorithm that implements the equivalence relation directly into the image to reduce the number of iterations required for labeling. An implementation for GPU, based on atomic instructions with a pre-labeling in the local memory has been realized and it has proven effective from the small images
APA, Harvard, Vancouver, ISO, and other styles
10

Kanaparthi, Pradeep Kumar. "Detection and Recognition of U.S. Speed Signs from Grayscale Images for Intelligent Vehicles." University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1352934398.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Connected component"

1

Hummel, Robert A. Connected component labeling in image processing with MIMD architectures. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Xue-Dong. Design of fast connected components hardware. Courant Institute of Mathematical Sciences, New York University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

TRW Electronic Components Group. Connector Division., ed. Worldwide connector resource. Connector Division, TRW Electronic Components Group, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schwartz, Jacob T. An efficient algorithm for finding connected components in a binary image. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schwartz, Jacob T. An efficient algorithm for finding connected components in a binary image. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

G, Chrysochoides N., and Commission of the European Communities. Directorate-General for Science, Research and Development., eds. High flux testing reactor Petten: Replacement of the reactor vessel and connected components : overall report. Commission of the European Communities, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

VASIL'EVA, ELENA, ALLA GROMOVA, EVGENIY ZARAMENSKIH, ANDREY KOShKIN, MIHAIL PETROV, and BORIS SLAVIN. Digital platforms and ecosystems in public administration. INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/2021353.

Full text
Abstract:
The monograph is devoted to one of the most relevant topics in the field of modern automation systems of authorities — digital platforms and ecosystems in public administration. The main architectural solutions, components, and technologies used in the construction of existing Russian and international distributed and high-load digital platforms are identified; approaches that determine the choice of certain solutions, components, and technologies are described. The assessment of the demand for technological trends is compiled, the main classes of information systems used to provide social services to the population are formulated. A conceptual approach to the development and implementation of a targeted digital platform for the social sphere is proposed, and the transition from platforms to digital ecosystems is also shown. Theory and practice are connected. It contains rich illustrative material, case studies, features of the application of various methodologies in solving issues of creating digital services, which can be used both in practice and in the educational process.&#x0D; For undergraduate, graduate and postgraduate students studying in the areas of training (specialties) "Business Informatics", "Applied Informatics", "State and Municipal Administration", "Economics", "Management".
APA, Harvard, Vancouver, ISO, and other styles
8

Murphy, Thomas Joseph. An analysis of the costs and benefit in improving the T56-A-427 interconnector harness end and mating thermocouple end connector under the aircraft engine Component Improvement Program (CIP). Naval Postgraduate School, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

van Wijk, Bram, Phil Barnett, and Maurice J. B. van den Hoff. The developmental origin of myocardium at the venous pole of the heart. Edited by José Maria Pérez-Pomares, Robert G. Kelly, Maurice van den Hoff, et al. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780198757269.003.0008.

Full text
Abstract:
The focus of this chapter is an evaluation of the developmental origin of the myocardial component of the venous pole. The venous pole has a complex morphological architecture, reflecting its embryological and evolutionary development from several component parts. We describe the developmental changes observed in the architecture of the inflow of the heart and the large vessels that drain into the venous pole. As the formation of the proepicardium and the epicardial-derived cells are intimately connected to the forming inflow, this topic will also be covered. We compare the development of the inflow in chicken, mouse, and human. We then review the results obtained using the two-component genetic mouse system Cre-LoxP with respect to the myocardial components added to the forming cardiac inflow. These data are discussed within the now discriminated first, second, and third heart fields.
APA, Harvard, Vancouver, ISO, and other styles
10

Redbooks, IBM. IBM Component Broker Connector Overview. Ibm, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Connected component"

1

Yu, Qinglin Roger, and Guizhen Liu. "Component Factors and Connected Factors." In Graph Factors and Matching Extensions. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93952-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Virothi, Venkata Sai Nitesh, and Meghana Santoshi Janapareddy. "Signature Extraction Using Connected Component Labeling." In Communication Software and Networks. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5397-4_62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nina Paravecino, Fanny, and David Kaeli. "Accelerated Connected Component Labeling Using CUDA Framework." In Computer Vision and Graphics. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11331-9_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Agarwal, Pankaj K., and Marc van Kreveld. "Connected component and simple polygon intersection searching." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57155-8_234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Benkrid, K., S. Sukhsawas, D. Crookes, and A. Benkrid. "An FPGA-Based Image Connected Component Labeller." In Field Programmable Logic and Application. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45234-8_108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Naegel, Benoît, and Nicolas Passat. "Towards Connected Filtering Based on Component-Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38294-9_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Grana, Costantino, Daniele Borghesani, and Rita Cucchiara. "Connected Component Labeling Techniques on Modern Architectures." In Image Analysis and Processing – ICIAP 2009. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04146-4_87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vijayalakshmi, Ramasamy, D. Nandagopal, M. Thilaga, and Bernie Cocks. "Characterisation of Cognitive Activity Using Minimum Connected Component." In Neural Information Processing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26561-2_63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

He, Lifeng, Yuyan Chao, Yun Yang, Sihui Li, Xiao Zhao, and Kenji Suzuki. "A Novel Two-Scan Connected-Component Labeling Algorithm." In Lecture Notes in Electrical Engineering. Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-6190-2_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Paranjape, Parnika, Meera Dhabu, Rushikesh Pathak, Nitesh Funde, and Parag Deshpande. "Classification of Query Graph Using Maximum Connected Component." In Smart Innovations in Communication and Computational Sciences. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2414-7_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Connected component"

1

Wang, Qingwang, Xin Qu, Liyao Zhou, Pengcheng Jin, Chengbiao Fu, and Tao Shen. "Edge-Guided Pixel Level Connected Component Assisted Camouflaged Object Detection." In 2024 IEEE International Conference on Image Processing (ICIP). IEEE, 2024. http://dx.doi.org/10.1109/icip51287.2024.10647752.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Oon-Ee, Ng, Velappa Ganapathy, and S. G. Ponnambalam. "Connected-component stereo aggregation." In APCCAS 2010-2010 IEEE Asia Pacific Conference on Circuits and Systems. IEEE, 2010. http://dx.doi.org/10.1109/apccas.2010.5775011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bogeholz, Harald, Michael Brand, and Radu-Alexandru Todor. "In-database connected component analysis." In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 2020. http://dx.doi.org/10.1109/icde48307.2020.00135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Bin, and YaHong Du. "Cloud-based Connected Component Algorithm." In 2010 International Conference on Artificial Intelligence and Computational Intelligence (AICI). IEEE, 2010. http://dx.doi.org/10.1109/aici.2010.360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Kesheng, Ekow Otoo, and Arie Shoshani. "Optimizing connected component labeling algorithms." In Medical Imaging, edited by J. Michael Fitzpatrick and Joseph M. Reinhardt. SPIE, 2005. http://dx.doi.org/10.1117/12.596105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Waltz, Frederick M., and John W. V. Miller. "Comparison of connected-component algorithms." In Photonics East '99, edited by John W. V. Miller, Susan S. Solomon, and Bruce G. Batchelor. SPIE, 1999. http://dx.doi.org/10.1117/12.360267.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dae Ro Lee, Seung Hun Jin, Pham Cong Thien, and Jae Wook Jeon. "FPGA based connected component labeling." In 2007 International Conference on Control, Automation and Systems. IEEE, 2007. http://dx.doi.org/10.1109/iccas.2007.4406746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sowah, Nii Longdon, Qingbo Wu, Fanman Meng, Wu Bo, and King N. Ngan. "Strongly connected component multi-object tracking." In 2016 2nd IEEE International Conference on Computer and Communications (ICCC). IEEE, 2016. http://dx.doi.org/10.1109/compcomm.2016.7924730.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

AbuBaker, Ayman, Rami Qahwaji, Stan Ipson, and Mohmmad Saleh. "One Scan Connected Component Labeling Technique." In 2007 IEEE International Conference on Signal Processing and Communications. IEEE, 2007. http://dx.doi.org/10.1109/icspc.2007.4728561.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Yang, and Prabir Bhattacharya. "Connected component histograms and image structures." In SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, edited by Andrew G. Tescher. SPIE, 1999. http://dx.doi.org/10.1117/12.365859.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Connected component"

1

Cypher, R. E., L. Snyder, and J. L. Sanz. Practical Algorithms for Image Component Labeling on SIMD Mesh Connected Computers. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada197341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Westbrook, Jeffrey, and Robert E. Tarjan. Maintaining Bridge-Connected and Biconnected Components On-Line. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada215107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Greiner, John. A Comparison of Data-Parallel Algorithms for Connected Components. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada270551.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Xue D. An Improved Algorithm for Labeling Connected Components in a Binary Image. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada210100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tayeb, Shahab. Intelligent Blind Crossings for Suburban and Rural Intersections. Mineta Transportation Institute, 2025. https://doi.org/10.31979/mti.2024.2351.

Full text
Abstract:
Blind intersections in suburban and rural areas pose significant safety challenges due to limited visibility and inadequate infrastructure. This project proposes an innovative solution leveraging the Internet of Vehicles (IoV) paradigm, utilizing connected and autonomous vehicles (CAVs) for seamless communication to enhance safety at these intersections. The research focuses on developing a specialized Road-Side Unit (RSU) system equipped with a Virtual Traffic Light Algorithm implemented on a Field-Programmable Gate Array (FPGA). Key stakeholders, including transportation authorities, vehicle manufacturers, and local communities, stand to benefit from this initiative. The RSU system acts as a critical infrastructure component, facilitating efficient intersection management and mitigating visibility challenges. Methodologies involve adapting the Virtual Traffic Light Algorithm, integrating it into the FPGA-based RSU system, and demonstrating RSU communication operability through software-defined radios. Additionally, a novel solar-powered system is designed for lightweight RSUs to enhance sustainability and energy efficiency. The project's findings indicate the feasibility and practicality of the proposed RSU solution in enhancing safety at blind intersections. Successful implementation of the Virtual Traffic Light Algorithm on the FPGA demonstrates its potential for real-world deployment. The operability demonstration of RSU communication validates the effectiveness of the proposed communication system. Overall, this research contributes to advancing safety measures in transportation infrastructure, with potential implications for future urban planning and policy development.
APA, Harvard, Vancouver, ISO, and other styles
6

Wu, Yingjie, Selim Gunay, and Khalid Mosalam. Hybrid Simulations for the Seismic Evaluation of Resilient Highway Bridge Systems. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, 2020. http://dx.doi.org/10.55461/ytgv8834.

Full text
Abstract:
Bridges often serve as key links in local and national transportation networks. Bridge closures can result in severe costs, not only in the form of repair or replacement, but also in the form of economic losses related to medium- and long-term interruption of businesses and disruption to surrounding communities. In addition, continuous functionality of bridges is very important after any seismic event for emergency response and recovery purposes. Considering the importance of these structures, the associated structural design philosophy is shifting from collapse prevention to maintaining functionality in the aftermath of moderate to strong earthquakes, referred to as “resiliency” in earthquake engineering research. Moreover, the associated construction philosophy is being modernized with the utilization of accelerated bridge construction (ABC) techniques, which strive to reduce the impact of construction on traffic, society, economy and on-site safety. This report presents two bridge systems that target the aforementioned issues. A study that combined numerical and experimental research was undertaken to characterize the seismic performance of these bridge systems. The first part of the study focuses on the structural system-level response of highway bridges that incorporate a class of innovative connecting devices called the “V-connector,”, which can be used to connect two components in a structural system, e.g., the column and the bridge deck, or the column and its foundation. This device, designed by ACII, Inc., results in an isolation surface at the connection plane via a connector rod placed in a V-shaped tube that is embedded into the concrete. Energy dissipation is provided by friction between a special washer located around the V-shaped tube and a top plate. Because of the period elongation due to the isolation layer and the limited amount of force transferred by the relatively flexible connector rod, bridge columns are protected from experiencing damage, thus leading to improved seismic behavior. The V-connector system also facilitates the ABC by allowing on-site assembly of prefabricated structural parts including those of the V-connector. A single-column, two-span highway bridge located in Northern California was used for the proof-of-concept of the proposed V-connector protective system. The V-connector was designed to result in an elastic bridge response based on nonlinear dynamic analyses of the bridge model with the V-connector. Accordingly, a one-third scale V-connector was fabricated based on a set of selected design parameters. A quasi-static cyclic test was first conducted to characterize the force-displacement relationship of the V-connector, followed by a hybrid simulation (HS) test in the longitudinal direction of the bridge to verify the intended linear elastic response of the bridge system. In the HS test, all bridge components were analytically modeled except for the V-connector, which was simulated as the experimental substructure in a specially designed and constructed test setup. Linear elastic bridge response was confirmed according to the HS results. The response of the bridge with the V-connector was compared against that of the as-built bridge without the V-connector, which experienced significant column damage. These results justified the effectiveness of this innovative device. The second part of the study presents the HS test conducted on a one-third scale two-column bridge bent with self-centering columns (broadly defined as “resilient columns” in this study) to reduce (or ultimately eliminate) any residual drifts. The comparison of the HS test with a previously conducted shaking table test on an identical bridge bent is one of the highlights of this study. The concept of resiliency was incorporated in the design of the bridge bent columns characterized by a well-balanced combination of self-centering, rocking, and energy-dissipating mechanisms. This combination is expected to lead to minimum damage and low levels of residual drifts. The ABC is achieved by utilizing precast columns and end members (cap beam and foundation) through an innovative socket connection. In order to conduct the HS test, a new hybrid simulation system (HSS) was developed, utilizing commonly available software and hardware components in most structural laboratories including: a computational platform using Matlab/Simulink [MathWorks 2015], an interface hardware/software platform dSPACE [2017], and MTS controllers and data acquisition (DAQ) system for the utilized actuators and sensors. Proper operation of the HSS was verified using a trial run without the test specimen before the actual HS test. In the conducted HS test, the two-column bridge bent was simulated as the experimental substructure while modeling the horizontal and vertical inertia masses and corresponding mass proportional damping in the computer. The same ground motions from the shaking table test, consisting of one horizontal component and the vertical component, were applied as input excitations to the equations of motion in the HS. Good matching was obtained between the shaking table and the HS test results, demonstrating the appropriateness of the defined governing equations of motion and the employed damping model, in addition to the reliability of the developed HSS with minimum simulation errors. The small residual drifts and the minimum level of structural damage at large peak drift levels demonstrated the superior seismic response of the innovative design of the bridge bent with self-centering columns. The reliability of the developed HS approach motivated performing a follow-up HS study focusing on the transverse direction of the bridge, where the entire two-span bridge deck and its abutments represented the computational substructure, while the two-column bridge bent was the physical substructure. This investigation was effective in shedding light on the system-level performance of the entire bridge system that incorporated innovative bridge bent design beyond what can be achieved via shaking table tests, which are usually limited by large-scale bridge system testing capacities.
APA, Harvard, Vancouver, ISO, and other styles
7

Coyner, Kelley, and Jason Bittner. Automated Vehicles and Infrastructure Enablers: Connectivity. SAE International, 2023. http://dx.doi.org/10.4271/epr2023013.

Full text
Abstract:
&lt;div class="section abstract"&gt;&lt;div class="htmlview paragraph"&gt;Do connected vehicle (CV) technologies encourage or dampen progress toward widespread deployment of automated vehicles? Would digital infrastructure components be a better investment for safety, mobility, and the environment? Can CVs, coupled with smart infrastructure, provide an effective pathway to further automation? Highly automated vehicles are being developed (albeit slower than predicted) alongside varied, disruptive connected vehicle technology. &lt;/div&gt;&lt;div class="htmlview paragraph"&gt;&lt;b&gt;Automated Vehicles and Infrastructure Enablers: Connectivity&lt;/b&gt; looks at the status of CV technology, examines the concerns of automated driving system (ADS) developers and infrastructure owners and operators (IOOs) in relying on connected infrastructure, and assesses lessons learned from the growth of CV applications and improved vehicle-based technology. IOOs and ADS developers agree that cost, communications, interoperability, cybersecurity, operation, maintenance, and other issues undercut efforts to deploy a comprehensive connected infrastructure.&lt;/div&gt;&lt;div class="htmlview paragraph"&gt;&lt;a href="https://www.sae.org/publications/edge-research-reports" target="_blank"&gt;Click here to access the full SAE EDGE&lt;/a&gt;&lt;sup&gt;TM&lt;/sup&gt;&lt;a href="https://www.sae.org/publications/edge-research-reports" target="_blank"&gt; Research Report portfolio.&lt;/a&gt;&lt;/div&gt;&lt;/div&gt;
APA, Harvard, Vancouver, ISO, and other styles
8

Kong, Weiqiang, Simon Furbo, and Jianhua Fan. Simulation and design of collector array units within large systems. IEA SHC Task 55, 2019. http://dx.doi.org/10.18777/ieashc-task55-2019-0005.

Full text
Abstract:
Solar collectors are the core components of solar district heating plants. Annual solar heat yield of solar heating plants on average is around 400-500 kWh/m2 in Denmark. Most solar collectors in the large solar district heating plants in Denmark are ground-mounted flat plate collectors. Arcon-Sunmark A/S is the main manufacturer of the large flat plate collectors for district heating in Denmark. Arcon-Sunmark A/S has installed more than 80% of the world’s large solar heating plants connected to district heating networks.
APA, Harvard, Vancouver, ISO, and other styles
9

Razdan, Rahul. Unsettled Issues Regarding Autonomous Vehicles and Open-source Software. SAE International, 2021. http://dx.doi.org/10.4271/epr2021009.

Full text
Abstract:
As automobiles morph from stand-alone mechanical objects to highly connected, autonomous systems with increasing amounts of electronic components. To manage these complex systems, some semblance of in-car decision-making is also being built and networked to a cloud architecture. This cloud can also enable even deeper capabilities within the broader automotive ecosystem. Unsettled Issues Regarding Autonomous Vehicles and Open-source Software introduces the impact of software in advanced automotive applications, the role of open-source communities in accelerating innovation, and the important topic of safety and cybersecurity. As electronic functionality is captured in software and a bigger percentage of that software is open-source code, some critical challenges arise concerning security and validation.
APA, Harvard, Vancouver, ISO, and other styles
10

Seferis, Louisa, and Paul Harvey. Accountability in Crises: Connecting Evidence from Humanitarian and Social Protection Approaches to Social Assistance. Institute of Development Studies (IDS), 2022. http://dx.doi.org/10.19088/basic.2022.013.

Full text
Abstract:
Social assistance in crises, whether part of a social protection system or driven by humanitarian needs, provides crucial support to people affected by disaster and conflict. Accountability is a central component of delivering effective social assistance. The increasing emphasis on reinforcing social protection in fragile contexts and the Grand Bargain ‘participation revolution’ workstream suggest the need for a fresh look at accountability frameworks and how they play out in practice for the people they aim to serve. This paper seeks to connect evidence from humanitarian and development accountability approaches to better understand the linkages and disconnects, and to identify opportunities for future research and learning.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Connected component' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography