Search results for "Connected component"
showing 10 items of 31 documents
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.
Stationary states in quantum walk search
2016
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state c…
Separation properties of continuous maps in codimension 1 and geometrical applications
1992
Abstract Nuno Ballesteros, J.J. and M.C. Romero Fuster, Separation properties of continuous maps in codimension 1 and geometrical applications, Topology and its Applications 46 (1992) 107-111. We show that the image of a proper closed continuous map, f , from an n -manifold X to an ( n + 1)-manifold Y , such that H 1 (Y; Z 2 ) =0 , separates Y into at least two connected components provided the self-intersections set of f is not dense in any connected component of Y . We also obtain some geometrical applications.
An Efficient Immunization Strategy Using Overlapping Nodes and Its Neighborhoods
2018
International audience; When an epidemic occurs, it is often impossible to vaccinate the entire population due to limited amount of resources. Therefore, it is of prime interest to identify the set of influential spreaders to immunize, in order to minimize both the cost of vaccine resource and the disease spreading. While various strategies based on the network topology have been introduced, few works consider the influence of the community structure in the epidemic spreading process. Nowadays, it is clear that many real-world networks exhibit an overlapping community structure, in which nodes are allowed to belong to more than one community. Previous work shows that the numbers of communit…
Representing 2D Digital Objects
2000
The paper describes the combination a multi-views approach to represent connected components of 2D binary images. The approach is based on the Object Connectivity Graph (OCG), which is a sub-graph of the connectivity graph generated by the Discrete Cylindrical Algebraic Decomposition(DCAD) performed in the 2D discrete space. This construction allows us to find the number of connected components, to determine their connectivity degree, and to solve visibility problem. We show that the CAD construction, when performed on two orthogonal views, supply information to avoid ambiguities in the interpretation of each image component. The implementation of the algorithm is outlined and the computati…
Witness computation for solving geometric constraint systems
2014
International audience; In geometric constraint solving, the constraints are represented with an equation system F(U, X) = 0, where X denotes the unknowns and U denotes a set of parameters. The target solution for X is noted XT. A witness is a couple (U_W, X_W) such that F(U_W, X_W) = 0. The witness is not the target solution, but they share the same combinatorial features, even when the witness and the target lie on two distinct connected components of the solution set of F(U, X) = 0. Thus a witness enables the qualitative study of the system: the detection of over- and under-constrained systems, the decomposition into irreducible subsystems, the computation of subsystems boundaries. This …
Topological invariants of stable immersions of oriented 3-manifolds in R4
2012
Abstract We show that the Z -module of first order local Vassiliev type invariants of stable immersions of oriented 3-manifolds into R 4 is generated by 3 topological invariants: The number of pairs of quadruple points and the positive and negative linking invariants l + and l − introduced by V. Goryunov (1997) [7] . We obtain the expression for the Euler characteristic of the immersed 3-manifold in terms of these invariants. We also prove that the total number of connected components of the triple points curve is a non-local Vassiliev type invariant.
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using 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+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…
INTERVAL-BASED TRACING OF STRANGE ATTRACTORS
2006
The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like Hénon attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.