NDLTD logo NDLTD Union Catalog and Global ETD Search

Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 35 for “"connected component"”.

  1. Significance-linked connected component analysis+ for wavelet image coding

    Zhang, Cheng, 1985-University of Missouri--Columbia2010

    … AT AUTHOR'S REQUEST.] The Significance-Linked Connected Component Analysis+ (SLCCA+) is a efficient wavelet image coding algorithm that extends SLCCA by using new data organization and representation (DOR) and SLCCA+ use a definition of context model for the adaptive arithmetic coding. …

    missouri Repository record

  2. Studying the Space of Almost Complex Structures on a Manifold Using de Rham Homotopy Theory

    Ferlengez, BoraThe Graduate School and University Center of The City University of New York2018

    … invariant (the de Rham homotopy type) for each connected component of the space of cross-sections of certain fibrations. We then apply this result to differential geometry and prove a finiteness theorem of the de Rham homotopy type for each connected component of the space of almost complex …

    cuny-grad Repository record

  3. Properties of link reversal algorithms for routing and leader election

    Radeva, TsvetomiraMassachusetts Institute of Technology2013

    … if topology changes cease, then eventually every connected component contains a unique leader and all nodes have directed paths to that leader. Our contribution includes a complexity analysis of the algorithm showing that after topology changes stop, no more than 0(n) elections occur in the …

    mit Repository record

  4. An analysis of conjunctive-goal planning

    Joslin, David EugeneVirginia Polytechnic Institute and State University1986

    … Each subgraph is composed of one or more connected components. Solving each sub-goal by choosing a connected component that contains a final goal state is a necessary and sufficient condition for solving any planning problem. In the worst case, analyzing goal interactions is shown to be no …

    vt Repository record

  5. Análise de grafos de textos literários: investigação de traços psicóticos

    Pinheiro, Sylvia Galvão de VasconcelosBrasil2016

    … of psychotic speech symptoms, marked by poor, disconnected and repetitive speech. Based on a literal reevaluation of ancient texts, Julian Jaynes proposed that psychosis was socially prevalent until around 1,000 BC (Jaynes, 1976). This conjecture was corroborated for the first time by Diuk et al. …

    brazil-ufrn Repository record

  6. Optimisation techniques for finding connected components in large graphs using GraphX

    Turifi, M2018

    The problem of finding connected components in undirected graphs has been well studied. It is an essential pre-processing step to many graph computations, and a fundamental task in graph analytics applications, such as social network analysis, web graph mining and image processing. Recently, it has …

    salford Repository record

  7. FPGA Implementation of Blob Recognition

    Xiong, JianUniversity of Windsor2011

    … this work comes up with a new method called Dual Connected Component Labelling (DCCL) suitable for FPGA implementation.

    windsor Repository record

  8. Webpage rank using Bayes' rule and connected components

    Song, BoUniversity of Missouri--Columbia2012

    … first decomposes the webgraph into mutually disconnected sub-webgraphs, each called a connected component (CC) or simply a block. A Bayes' theorem based block-wise local PageRank computation and weighting scheme are then used to compute the final ranking vector of CCRank, which approximates the …

    missouri Repository record

  9. Robust Event Detection and Retrieval in Surveillance Video

    Jiang, Jin2014

    … background modeling and foreground detection; a connected component labeling algorithm is then employed to label the foreground pixels. A Kalman filter approach is used to build models for the entities of interest (people and bags), which is combined with color histograms for tracking. We use …

    unr Repository record

  10. Efficiently Learning Monotone Decision Trees with ID3

    Thompson, Pamela2018

    … functions as graphs and examined each type of connected component contained in these models, i.e. path graphs and cycle graphs. I determined the influence of the variables in the pieces of these graph models in order to understand how ID3 behaves when learning these functions. My findings show …

    duquesne Repository record

  11. Region detection and labeling of images in real-time using an FPGA-based custom computing platform

    Rachakonda, Ramana V.Virginia Tech1995

    Region detection can be defined as identifying connected components in an image. Connected component labelling is an important part of performing feature extraction. Industrial applications performing online image analysis may require a real-time implementation of a region labelling algorithm …

    vt Repository record

  12. Plectic arithmetic of Hilbert modular varieties

    Leonhardt, MariusUniversity of Cambridge2020

    … actions on the set of CM points, on the set of connected components, and on the set of cocharacters of Shimura varieties that differ in the centre from the Hilbert modular variety. By allowing the centre to vary, we extend the plectic framework of Nekovář--Scholl to include such Shimura …

    cambridge Repository record

  13. Contour Encoded Compression and Transmission

    Nelson, Christopher B.2006

    … wide variety of shapes, fitting Bezier curves to connected component contours can provide better compression than current glyph library or other codebook compression methods. In addition to better compression, the CECAT system divides the image into layers and tiles that can be used as a …

    byu Repository record

  14. Characterizing the Movement of Contaminant Liquid Metal Particles when subject to Electric Pulses, within the Context of Z-pinch Fusion Reactors

    Sridhar, VigneshVirginia Tech2024

    … automated particle tracking algorithms with connected-component labeling and two-point correlation functions to monitor ejecta trajectories. Results reveal an average ejected particle velocity of 2.54 m/s (±3.58 m/s), with particle formation likelihood peaking at velocities around 1.14 m/s. …

    vt Repository record

  15. Fall detection system using low cost computing and online communication

    Gadre, Kaustubh RaghunathUniversity of Missouri--Columbia2012

    … from the hardware support system, and uses a connected component algorithm to discover the simultaneous activation of group of contiguous sensors during a fall. In addition to the fall detection, the floor sensor data was stored on the Sheevaplug server and then communicated to the remote …

    missouri Repository record

  16. Offline and Online Interactive Frameworks for MRI and CT Image Analysis in the Healthcare Domain : The Case of COVID-19, Brain Tumors and Pancreatic Tumors

    Sailunaz, KashfiaGraduate Studies2023

    … models, graph models, region-based analysis, connected component analysis, machine learning models, and recent deep learning models are used. The following problems for medical images : abnormality detection, abnormal region segmentation, interactive user interface to represent the results of …

    calgary Repository record

  17. Generic FPGA Preprocessing for Astrophysics Instruments in HLS

    Song, Qinzhou2025

    … so, we also present a novel HLS-based two-pass connected-component labeling (CCL) implementation that can be easily switched between 4-way and 8-way CCL.</p>

    wustl Repository record

  18. Detection and Recognition of U.S. Speed Signs from Grayscale Images for Intelligent Vehicles

    Kanaparthi, Pradeep KumarUniversity of Toledo2012

    … in the input image. We have utilized the idea of connected component labeling technique and adapted it for the grayscale images, to divide the input image into a set of regions. The recognition phase calculates the invariant features of the inner parts of the detected regions using Hu’s moments. …

    ohiolink Repository record

  19. High Performance Issues on Parallel Architectures

    Looges, Peter J.2019

    … bipartiteness, fundamental cycles, bridges and biconnected components. Other optimal algorithms for the more complex least common ancestor and the connected component problems are also presented. By design, all algorithms maintain optimality for very large sparse graphs. We further examine the …

    odu Repository record

  20. Hyperdefinable groups and modularity

    Penazzi, DavideUniversity of Leeds2011

    … is a 1-dimensional, definably compact, definably connected, definable group in a saturated real closed field M, with respect to a notion called 1-basedness. In particular G will be one of the following: 1. ([-1,1),+ mod 2) 2. ([1/b,b),*mod b^2 3. (SO_2(M)*) and truncations 4. (E(M)^0,+) and …

    whiterose Repository record

Page 1 of 2