|
Grid Cell Topology
The grid cell topology is studied in digital topology as part of the theoretical basis for (low-level) algorithms in computer image analysis or computer graphics. The elements of the ''n''-dimensional grid cell topology (''n'' ≥ 1) are all ''n''-dimensional grid cubes and their ''k''-dimensional faces ( for 0 ≤ ''k'' ≤ ''n''−1); between these a partial order ''A'' ≤ ''B'' is defined if ''A'' is a subset of ''B'' (and thus also dim(''A'') ≤ dim(''B'')). The grid cell topology is the Alexandrov topology (open sets are up-sets) with respect to this partial order. (See also poset topology.) Alexandrov and Hopf first introduced the grid cell topology, for the two-dimensional case, within an exercise in their text ''Topologie'' I (1935). A recursive method to obtain ''n''-dimensional grid cells and an intuitive definition for grid cell manifolds can be found in Chen, 2004. It is related to digital manifolds. See also * Pixel connectivity In image processing, p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Digital Topology
Digital topology deals with properties and features of two-dimensional (2D) or three-dimensional (3D) digital images that correspond to topological properties (e.g., connectedness) or topological features (e.g., boundaries) of objects. Concepts and results of digital topology are used to specify and justify important (low-level) image analysis algorithms, including algorithms for thinning, border or surface tracing, counting of components or tunnels, or region-filling. History Digital topology was first studied in the late 1960s by the computer image analysis researcher Azriel Rosenfeld (1931–2004), whose publications on the subject played a major role in establishing and developing the field. The term "digital topology" was itself invented by Rosenfeld, who used it in a 1973 publication for the first time. A related work called the grid cell topology, which could be considered as a link to classic combinatorial topology, appeared in the book of Pavel Alexandrov and Hein ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Image Analysis
Image analysis or imagery analysis is the extraction of meaningful information from images; mainly from digital images by means of digital image processing techniques. Image analysis tasks can be as simple as reading bar coded tags or as sophisticated as identifying a person from their face. Computers are indispensable for the analysis of large amounts of data, for tasks that require complex computation, or for the extraction of quantitative information. On the other hand, the human visual cortex is an excellent image analysis apparatus, especially for extracting higher-level information, and for many applications — including medicine, security, and remote sensing — human analysts still cannot be replaced by computers. For this reason, many important image analysis tools such as edge detectors and neural networks are inspired by human visual perception models. Digital Digital Image Analysis or Computer Image Analysis is when a computer or electrical device automa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Graphics
Computer graphics deals with generating images with the aid of computers. Today, computer graphics is a core technology in digital photography, film, video games, cell phone and computer displays, and many specialized applications. A great deal of specialized hardware and software has been developed, with the displays of most devices being driven by computer graphics hardware. It is a vast and recently developed area of computer science. The phrase was coined in 1960 by computer graphics researchers Verne Hudson and William Fetter of Boeing. It is often abbreviated as CG, or typically in the context of film as computer generated imagery (CGI). The non-artistic aspects of computer graphics are the subject of computer science research. Some topics in computer graphics include user interface design, sprite graphics, rendering, ray tracing, geometry processing, computer animation, vector graphics, 3D modeling, shaders, GPU design, implicit surfaces, visualization, scientific c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology
In mathematics, topology (from the Greek language, Greek words , and ) is concerned with the properties of a mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such as Stretch factor, stretching, Twist (mathematics), twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a set (mathematics), set endowed with a structure, called a ''Topology (structure), topology'', which allows defining continuous deformation of subspaces, and, more generally, all kinds of continuity (mathematics), continuity. Euclidean spaces, and, more generally, metric spaces are examples of a topological space, as any distance or metric defines a topology. The deformations that are considered in topology are homeomorphisms and homotopy, homotopies. A property that is invariant under such deformations is a topological property. Basic exampl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Order
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x'' ''y'', or ''x'' and ''y'' are ''incompar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexandrov Topology
In topology, an Alexandrov topology is a topology in which the intersection of any family of open sets is open. It is an axiom of topology that the intersection of any ''finite'' family of open sets is open; in Alexandrov topologies the finite restriction is dropped. A set together with an Alexandrov topology is known as an Alexandrov-discrete space or finitely generated space. Alexandrov topologies are uniquely determined by their specialization preorders. Indeed, given any preorder ≤ on a set ''X'', there is a unique Alexandrov topology on ''X'' for which the specialization preorder is ≤. The open sets are just the upper sets with respect to ≤. Thus, Alexandrov topologies on ''X'' are in one-to-one correspondence with preorders on ''X''. Alexandrov-discrete spaces are also called finitely generated spaces since their topology is uniquely determined by the family of all finite subspaces. Alexandrov-discrete spaces can thus be viewed as a generalization of finite topolog ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poset Topology
In mathematics, the poset topology associated to a poset (''S'', ≤) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of (''S'', ≤), ordered by inclusion. Let ''V'' be a set of vertices. An abstract simplicial complex Δ is a set of finite sets of vertices, known as faces \sigma \subseteq V, such that ::\forall \rho \, \forall \sigma \!: \ \rho \subseteq \sigma \in \Delta \Rightarrow \rho \in \Delta. Given a simplicial complex Δ as above, we define a (point set) topology on Δ by declaring a subset \Gamma \subseteq \Delta be closed if and only if Γ is a simplicial complex, i.e. ::\forall \rho \, \forall \sigma \!: \ \rho \subseteq \sigma \in \Gamma \Rightarrow \rho \in \Gamma. This is the Alexandrov topology on the poset of faces of Δ. The order complex associated to a poset (''S'', ≤) has the set ''S'' as vertices, and the finite chains of (''S'', ≤) as faces. The poset topology associated to a poset (''S'', ≤) is then the Alexandrov ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pavel Sergeevich Alexandrov
Pavel Sergeyevich Alexandrov (russian: Па́вел Серге́евич Алекса́ндров), sometimes romanized ''Paul Alexandroff'' (7 May 1896 – 16 November 1982), was a Soviet mathematician. He wrote about three hundred papers, making important contributions to set theory and topology. In topology, the Alexandroff compactification and the Alexandrov topology are named after him. Biography Alexandrov attended Moscow State University where he was a student of Dmitri Egorov and Nikolai Luzin. Together with Pavel Urysohn, he visited the University of Göttingen in 1923 and 1924. After getting his Ph.D. in 1927, he continued to work at Moscow State University and also joined the Steklov Institute of Mathematics. He was made a member of the Russian Academy of Sciences in 1953. Personal life Luzin challenged Alexandrov to determine if the continuum hypothesis is true. This still unsolved problem was too much for Alexandrov and he had a creative crisis at the end of 1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heinz Hopf
Heinz Hopf (19 November 1894 – 3 June 1971) was a German mathematician who worked on the fields of topology and geometry. Early life and education Hopf was born in Gräbschen, Germany (now , part of Wrocław, Poland), the son of Elizabeth (née Kirchner) and Wilhelm Hopf. His father was born Jewish and converted to Protestantism a year after Heinz was born; his mother was from a Protestant family. Hopf attended Karl Mittelhaus higher boys' school from 1901 to 1904, and then entered the König-Wilhelm- Gymnasium in Breslau. He showed mathematical talent from an early age. In 1913 he entered the Silesian Friedrich Wilhelm University where he attended lectures by Ernst Steinitz, Adolf Kneser, Max Dehn, Erhard Schmidt, and Rudolf Sturm. When World War I broke out in 1914, Hopf eagerly enlisted. He was wounded twice and received the iron cross (first class) in 1918. After the war Hopf continued his mathematical education in Heidelberg (winter 1919/20 and summer 1920) and Berl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Two-dimensional
In mathematics, a plane is a Euclidean (flat), two-dimensional surface that extends indefinitely. A plane is the two-dimensional analogue of a point (zero dimensions), a line (one dimension) and three-dimensional space. Planes can arise as subspaces of some higher-dimensional space, as with one of a room's walls, infinitely extended, or they may enjoy an independent existence in their own right, as in the setting of two-dimensional Euclidean geometry. Sometimes the word ''plane'' is used more generally to describe a two-dimensional surface, for example the hyperbolic plane and elliptic plane. When working exclusively in two-dimensional Euclidean space, the definite article is used, so ''the'' plane refers to the whole space. Many fundamental tasks in mathematics, geometry, trigonometry, graph theory, and graphing are performed in a two-dimensional space, often in the plane. Euclidean geometry Euclid set forth the first great landmark of mathematical thought, an axiomatic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Digital Manifold
In mathematics, a digital manifold is a special kind of combinatorial manifold which is defined in digital space i.e. grid cell space. A combinatorial manifold is a kind of manifold which is a discretization of a manifold. It usually means a piecewise linear manifold made by simplicial complexes. Concepts Parallel-move is used to extend an i-cell to (i+1)-cell. In other words, if A and B are two i-cells and A is a parallel-move of B, then is an (i+1)-cell. Therefore, k-cells can be defined recursively. Basically, a connected set of grid points M can be viewed as a digital k-manifold if: (1) any two k-cells are (k-1)-connected, (2) every (k-1)-cell has only one or two parallel-moves, and (3) M does not contain any (k+1)-cells. See also *Digital geometry *Digital topology *Topological data analysis *Topology *Discrete mathematics Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, havi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pixel Connectivity
In image processing, pixel connectivity is the way in which pixels in 2-dimensional (or hypervoxels in n-dimensional) images relate to their neighbors. Formulation In order to specify a set of connectivities, the dimension N and the width of the neighborhood n , must be specified. The dimension of a neighborhood is valid for any dimension n\geq1 . A common width is 3, which means along each dimension, the central cell will be adjacent to 1 cell on either side for all dimensions. Let M_N^n represent a N-dimensional hypercubic neighborhood with size on each dimension of n=2k+1, k\in\mathbb Let \vec represent a discrete vector in the first orthant from the center structuring element to a point on the boundary of M_N^n. This implies that each element q_i \in \ ,\forall i \in \ and that at least one component q_i = k Let S_N^d represent a N-dimensional hypersphere with radius of d=\left \Vert \vec \right \Vert. Define the amount of elements on the hypersphere S_N^d with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
