Search results for "Component"
showing 10 items of 1682 documents
Kustīgu objektu noteikšana
2015
Programma ir paredzēta video analīzei, kustīgu objektu atpazīšanai un uzskaitei. Programma spēj darboties reāllaikā, analizējot jau ierakstītu video materiālu vai materiālu no tīmekļa kameras. Lietotājam ir dotas iespējas mainīt vairākas iestatījumu vērtības, kuras tiek izmantotas video apstrādē, piemēram, mainīt minimālo izmēru objektu atpazīšanai priekšplāna maskā, noteikt robežas izmēru, kādā pikseļu vērtības tiek uzskatītas par fonu. Šis dokuments satur programmatūras prasību specifikāciju, programmatūras projektējuma aprakstu, testēšanas dokumentāciju, kā arī citu svarīgu informāciju par programmu.
Connected-component identification and cluster update on graphics processing units.
2011
Cluster identification tasks occur in a multitude of contexts in physics and engineering such as, for instance, cluster algorithms for simulating spin models, percolation simulations, segmentation problems in image processing, or network analysis. While it has been shown that graphics processing units (GPUs) can result in speedups of two to three orders of magnitude as compared to serial codes on CPUs for the case of local and thus naturally parallelized problems such as single-spin flip update simulations of spin models, the situation is considerably more complicated for the nonlocal problem of cluster or connected component identification. I discuss the suitability of different approaches…
Topology guaranteeing manifold reconstruction using distance function to noisy data
2006
Given a smooth compact codimension one submanifold S of Rk and a compact approximation K of S, we prove that it is possible to reconstruct S and to approximate the medial axis of S with topological guarantees using unions of balls centered on K. We consider two notions of noisy-approximation that generalize sampling conditions introduced by Amenta & al. and Dey & al. Our results are based upon critical point theory for distance functions. For the two approximation conditions, we prove that the connected components of the boundary of unions of balls centered on K are isotopic to S. Our results allow to consider balls of different radii. For the first approximation condition, we also prove th…
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
Generalized twisted cubics on a cubic fourfold as a moduli space of stable objects
2016
We revisit the work of Lehn-Lehn-Sorger-van Straten on twisted cubic curves in a cubic fourfold not containing a plane in terms of moduli spaces. We show that the blow-up $Z'$ along the cubic of the irreducible holomorphic symplectic eightfold $Z$, described by the four authors, is isomorphic to an irreducible component of a moduli space of Gieseker stable torsion sheaves or rank three torsion free sheaves. For a very general such cubic fourfold, we show that $Z$ is isomorphic to a connected component of a moduli space of tilt-stable objects in the derived category and to a moduli space of Bridgeland stable objects in the Kuznetsov component. Moreover, the contraction between $Z'$ and $Z$ i…
The Kuratowski convergence and connected components
2012
International audience; We investigate the Kuratowski convergence of the connected components of the sections of a definable set applying the result obtained to semialgebraic approximation of subanalytic sets. We are led to some considerations concerning the connectedness of the limit set in general. We discuss also the behaviour of the dimension of converging sections and prove some general facts about the Kuratowski convergence in tame geometry.
Farsighted R&D networks
2014
We analyze the formation of bilateral R&D collaborations in an oligopoly when each firm benefits from the research done by other firms it is connected to. In contrast to myopic stability, farsighted stability leads to R&D networks consisting of two minimally connected components, with the largest one comprising three-quarters of firms.
Extracting modular-based backbones in weighted networks
2021
Abstract Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property.In…
Detection and classification of microcalcifications clusters in digitized mammograms
2005
In the present paper we discuss a new approach for the detection of microcalcification clusters, based on neural networks and developed as part of the MAGIC-5 project, an INFN-funded program which aims at the development and implementation of CAD algorithms in a GRID-based distributed environment. The proposed approach has as its roots the desire to maximize the rejection of background during the analytical pre-processing stage, in order to train and test the neural network with as clean as possible a sample and therefore maximize its performance. The algorithm is composed of three modules: the image pre-processing, the feature extraction component and the Backpropagation Neural Network mod…
Two-view “cylindrical decomposition” of binary images
2001
This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.