72 research outputs found

    Labeling Color 2D Digital Images in Theoretical Near Logarithmic Time

    Get PDF
    A design of a parallel algorithm for labeling color flat zones (precisely, 4-connected components) of a gray-level or color 2D digital image is given. The technique is based in the construction of a particular Homological Spanning Forest (HSF) structure for encoding topological information of any image.HSFis a pair of rooted trees connecting the image elements at inter-pixel level without redundancy. In order to achieve a correct color zone labeling, our proposal here is to correctly building a sub- HSF structure for each image connected component, modifying an initial HSF of the whole image. For validating the correctness of our algorithm, an implementation in OCTAVE/MATLAB is written and its results are checked. Several kinds of images are tested to compute the number of iterations in which the theoretical computing time differs from the logarithm of the width plus the height of an image. Finally, real images are to be computed faster than random images using our approach.Ministerio de Economía y Competitividad TEC2016-77785-PMinisterio de Economía y Competitividad MTM2016-81030-

    Operatori za multi-rezolucione komplekse Morza i ćelijske komplekse

    Get PDF
    The topic of the thesis is analysis of the topological structure of scalar fields and shapes represented through Morse and cell complexes, respectively. This is achieved by defining simplification and refinement operators on these complexes. It is shown that the defined operators form a basis for the set of operators that modify Morse and cell complexes. Based on the defined operators, a multi-resolution model for Morse and cell complexes is constructed, which contains a large number of representations at uniform and variable resolution.Тема дисертације је анализа тополошке структуре скаларних поља и облика представљених у облику комплекса Морза и ћелијских комплекса, редом. То се постиже дефинисањем оператора за симплификацију и рафинацију тих комплекса. Показано је да дефинисани оператори чине базу за скуп оператора на комплексима Морза и ћелијским комплексима. На основу дефинисаних оператора конструисан је мулти-резолуциони модел за комплексе Морза и ћелијске комплексе, који садржи велики број репрезентација униформне и варијабилне резолуције.Tema disertacije je analiza topološke strukture skalarnih polja i oblika predstavljenih u obliku kompleksa Morza i ćelijskih kompleksa, redom. To se postiže definisanjem operatora za simplifikaciju i rafinaciju tih kompleksa. Pokazano je da definisani operatori čine bazu za skup operatora na kompleksima Morza i ćelijskim kompleksima. Na osnovu definisanih operatora konstruisan je multi-rezolucioni model za komplekse Morza i ćelijske komplekse, koji sadrži veliki broj reprezentacija uniformne i varijabilne rezolucije

    Operatori za multi-rezolucione komplekse Morza i ćelijske komplekse

    Get PDF
    The topic of the thesis is analysis of the topological structure of scalar fields and shapes represented through Morse and cell complexes, respectively. This is achieved by defining simplification and refinement operators on these complexes. It is shown that the defined operators form a basis for the set of operators that modify Morse and cell complexes. Based on the defined operators, a multi-resolution model for Morse and cell complexes is constructed, which contains a large number of representations at uniform and variable resolution.Тема дисертације је анализа тополошке структуре скаларних поља и облика представљених у облику комплекса Морза и ћелијских комплекса, редом. То се постиже дефинисањем оператора за симплификацију и рафинацију тих комплекса. Показано је да дефинисани оператори чине базу за скуп оператора на комплексима Морза и ћелијским комплексима. На основу дефинисаних оператора конструисан је мулти-резолуциони модел за комплексе Морза и ћелијске комплексе, који садржи велики број репрезентација униформне и варијабилне резолуције.Tema disertacije je analiza topološke strukture skalarnih polja i oblika predstavljenih u obliku kompleksa Morza i ćelijskih kompleksa, redom. To se postiže definisanjem operatora za simplifikaciju i rafinaciju tih kompleksa. Pokazano je da definisani operatori čine bazu za skup operatora na kompleksima Morza i ćelijskim kompleksima. Na osnovu definisanih operatora konstruisan je multi-rezolucioni model za komplekse Morza i ćelijske komplekse, koji sadrži veliki broj reprezentacija uniformne i varijabilne rezolucije

    A parallel Homological Spanning Forest framework for 2D topological image analysis

    Get PDF
    In [14], a topologically consistent framework to support parallel topological analysis and recognition for2 D digital objects was introduced. Based on this theoretical work, we focus on the problem of findingefficient algorithmic solutions for topological interrogation of a 2 D digital object of interest D of a pre- segmented digital image I , using 4-adjacency between pixels of D . In order to maximize the degree ofparallelization of the topological processes, we use as many elementary unit processing as pixels theimage I has. The mathematical model underlying this framework is an appropriate extension of the clas- sical concept of abstract cell complex: a primal–dual abstract cell complex (pACC for short). This versatiledata structure encompasses the notion of Homological Spanning Forest fostered in [14,15]. Starting froma symmetric pACC associated with I , the modus operandi is to construct via combinatorial operationsanother asymmetric one presenting the maximal number of non-null primal elementary interactions be- tween the cells of D . The fundamental topological tools have been transformed so as to promote anefficient parallel implementation in any parallel-oriented architecture (GPUs, multi-threaded computers,SIMD kernels and so on). A software prototype modeling such a parallel framework is built.Ministerio de Educación y Ciencia TEC2012-37868-C04-02/0

    On uniqueness of end sums and 1-handles at infinity

    Full text link
    For oriented manifolds of dimension at least 4 that are simply connected at infinity, it is known that end summing is a uniquely defined operation. Calcut and Haggerty showed that more complicated fundamental group behavior at infinity can lead to nonuniqueness. The present paper examines how and when uniqueness fails. Examples are given, in the categories TOP, PL and DIFF, of nonuniqueness that cannot be detected in a weaker category (including the homotopy category). In contrast, uniqueness is proved for Mittag-Leffler ends, and generalized to allow slides and cancellation of (possibly infinite) collections of 0- and 1-handles at infinity. Various applications are presented, including an analysis of how the monoid of smooth manifolds homeomorphic to R^4 acts on the smoothings of any noncompact 4-manifold.Comment: 25 pages, 8 figures. v2: Minor expository improvement

    The blob complex

    Full text link
    Given an n-manifold M and an n-category C, we define a chain complex (the "blob complex") B_*(M;C). The blob complex can be thought of as a derived category analogue of the Hilbert space of a TQFT, and as a generalization of Hochschild homology to n-categories and n-manifolds. It enjoys a number of nice formal properties, including a higher dimensional generalization of Deligne's conjecture about the action of the little disks operad on Hochschild cochains. Along the way, we give a definition of a weak n-category with strong duality which is particularly well suited for work with TQFTs.Comment: 106 pages. Version 3 contains many improvements following suggestions from the referee and others, and some additional materia

    Reconstruction d'ensembles compacts 3D

    Get PDF
    Reconstruire un modèle à partir d'échantillons est un problème central se posant en médecine numérique, en ingénierie inverse, en sciences naturelles, etc. Ces applications ont motivé une recherche substantielle pour la reconstruction de surfaces, la question de la reconstruction de modèles plus généraux n'ayant pas été examinée. Ce travail présente an algorithme visant à changer le paradigme de reconstruction en 3D comme suit. Premièrement, l'algorithme reconstruit des formes générales--des ensembles compacts et non plus des surfaces. Sous des hypothèses appropriées, nous montrons que la reconstruction a le type d'homotopie de l'objet de départ. Deuxièmement, l'algorithme ne génère pas une seule reconstruction, mais un ensemble de reconstructions plausibles. Troisièmement, l'algorithme peut être couplé à la persistance topologique, afin de sélectionner les traits les plus stables du modèle reconstruit. Enfin, en cas d'échec de la reconstruction, la méthode permet une identification aisée des régions sous-echantillonnées, afin éventuellement de les enrichir. Ces points clefs sont illustrés sur des modèles difficiles, et devraient permettre de mieux tirer parti de leurs caractéristiques dans les application sus-citées

    Pebbles, graphs and equilibria: Higher order shape descriptors for sedimentary particles

    Get PDF
    While three-dimensional measurement technology is spreading fast, its meaningful application to sedimentary geology still lacks content. Classical shape descriptors (such as axis ratios, circularity of projection) were not inherently three-dimensional, because no such technology existed. Recently a new class of three-dimensional descriptors, collectively referred to as mechanical descriptors, has been introduced and applied for a broad range of sedimentary particles. First-order mechanical descriptors (registered for each pebble as a pair {S, U} of integers), refer to the respective numbers of stable and unstable static equilibria and can be reliably detected by hand experiments. However, they have limited ability of distinction, as the majority of coastal pebbles fall into primary class . Higher-order mechanical descriptors offer a more refined distinction. However, for the extraction of these descriptors (registered as graphs for each pebble), hand measurements are not an option and even computer-based extraction from 3D scans offers a formidable challenge. Here we not only describe and implement an algorithm to perform this task, but also apply it to a collection of 271 pebbles with various lithologies, illustrating that the application of higher-order descriptors is a viable option for geologists. We also show that the so-far uncharted connection between the two known secondary descriptors, the so-called Morse–Smale graph and the Reeb-graph, can be established via a third order descriptor which we call the master graph

    ISCR Annual Report: Fical Year 2004

    Full text link
    corecore