|
Medial Axis
The medial axis of an object is the set of all points having more than one closest point on the object's boundary. Originally referred to as the topological skeleton, it was introduced in 1967 by Harry Blum as a tool for biological shape recognition. In mathematics the closure of the medial axis is known as the cut locus. In 2D, the medial axis of a subset ''S'' which is bounded by planar curve ''C'' is the locus of the centers of circles that are tangent to curve ''C'' in two or more points, where all such circles are contained in ''S''. (It follows that the medial axis itself is contained in ''S''.) The medial axis of a simple polygon is a tree whose leaves are the vertices of the polygon, and whose edges are either straight segments or arcs of parabolas. The medial axis together with the associated radius function of the maximally inscribed discs is called the medial axis transform (MAT). The medial axis transform is a complete shape descriptor (see also shape analysis) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ellipse Symmetry Set
In mathematics, an ellipse is a plane curve surrounding two focal points, such that for all points on the curve, the sum of the two distances to the focal points is a constant. It generalizes a circle, which is the special type of ellipse in which the two focal points are the same. The elongation of an ellipse is measured by its eccentricity e, a number ranging from e = 0 (the limiting case of a circle) to e = 1 (the limiting case of infinite elongation, no longer an ellipse but a parabola). An ellipse has a simple algebraic solution for its area, but only approximations for its perimeter (also known as circumference), for which integration is required to obtain an exact solution. Analytically, the equation of a standard ellipse centered at the origin with width 2a and height 2b is: : \frac+\frac = 1 . Assuming a \ge b, the foci are (\pm c, 0) for c = \sqrt. The standard parametric equation is: : (x,y) = (a\cos(t),b\sin(t)) \quad \text \quad 0\leq t\leq 2\pi. Ellipses ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Optical Character Recognition
Optical character recognition or optical character reader (OCR) is the electronic or mechanical conversion of images of typed, handwritten or printed text into machine-encoded text, whether from a scanned document, a photo of a document, a scene-photo (for example the text on signs and billboards in a landscape photo) or from subtitle text superimposed on an image (for example: from a television broadcast). Widely used as a form of data entry from printed paper data records – whether passport documents, invoices, bank statements, computerized receipts, business cards, mail, printouts of static-data, or any suitable documentation – it is a common method of digitizing printed texts so that they can be electronically edited, searched, stored more compactly, displayed on-line, and used in machine processes such as cognitive computing, machine translation, (extracted) text-to-speech, key data and text mining. OCR is a field of research in pattern recognition, artificial int ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Local Feature Size
Local feature size refers to several related concepts in computer graphics and computational geometry for measuring the size of a geometric object near a particular point. *Given a smooth manifold M, the local feature size at any point x \in M is the distance between x and the medial axis of M. *Given a planar straight-line graph, the local feature size at any point x is the radius of the smallest closed ball centered at x which intersects any two disjoint features (vertices or edges) of the graph. See also *Nearest neighbour function In probability and statistics, a nearest neighbor function, nearest neighbor distance distribution,A. Baddeley, I. Bárány, and R. Schneider. Spatial point processes and their applications. ''Stochastic Geometry: Lectures given at the CIME Summer ... References {{Reflist Geometric algorithms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grassfire Transform
In image processing, the grassfire transform is the computation of the distance from a pixel to the border of a region. It can be described as "setting fire" to the borders of an image region to yield descriptors such as the region's skeleton or medial axis. Harry Blum introduced the concept in 1967. Motivation A region's skeleton can be a useful descriptor, because it describes things such as the symmetry of the region as well as subparts, depressions and protrusions. It also provides a way of relating the interior of a region to the shape of the boundary. In the grassfire transform, the skeleton forms at the points in the region where the "fires" meet. In the literature this is described as the locus of meeting waveforms. Another advantage of using the outcome of the grassfire transform as a descriptor is that it is invertible. Assuming information about when the medial axis or skeleton is created by meeting waveforms is kept, then the skeleton can be restored by radiating outwar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (curve)
In the geometry of plane curves, a vertex is a point of where the first derivative of curvature is zero. This is typically a local maximum or minimum of curvature, and some authors define a vertex to be more specifically a local extremum of curvature. However, other special cases may occur, for instance when the second derivative is also zero, or when the curvature is constant. For space curves, on the other hand, a vertex is a point where the torsion vanishes. Examples A hyperbola has two vertices, one on each branch; they are the closest of any two points lying on opposite branches of the hyperbola, and they lie on the principal axis. On a parabola, the sole vertex lies on the axis of symmetry and in a quadratic of the form: :ax^2 + bx + c\,\! it can be found by completing the square or by differentiation., p. 127. On an ellipse, two of the four vertices lie on the major axis and two lie on the minor axis. For a circle, which has constant curvature, every point is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cusp (singularity)
In mathematics, a cusp, sometimes called spinode in old texts, is a point on a curve where a moving point must reverse direction. A typical example is given in the figure. A cusp is thus a type of singular point of a curve. For a plane curve defined by an analytic, parametric equation :\begin x &= f(t)\\ y &= g(t), \end a cusp is a point where both derivatives of and are zero, and the directional derivative, in the direction of the tangent, changes sign (the direction of the tangent is the direction of the slope \lim (g'(t)/f'(t))). Cusps are ''local singularities'' in the sense that they involve only one value of the parameter , in contrast to self-intersection points that involve more than one value. In some contexts, the condition on the directional derivative may be omitted, although, in this case, the singularity may look like a regular point. For a curve defined by an implicit equation :F(x,y) = 0, which is smooth, cusps are points where the terms of lowest de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homotopy Equivalent
In topology, a branch of mathematics, two continuous functions from one topological space to another are called homotopic (from grc, ὁμός "same, similar" and "place") if one can be "continuously deformed" into the other, such a deformation being called a homotopy (, ; , ) between the two functions. A notable use of homotopy is the definition of homotopy groups and cohomotopy groups, important invariants in algebraic topology. In practice, there are technical difficulties in using homotopies with certain spaces. Algebraic topologists work with compactly generated spaces, CW complexes, or spectra. Formal definition Formally, a homotopy between two continuous functions ''f'' and ''g'' from a topological space ''X'' to a topological space ''Y'' is defined to be a continuous function H: X \times ,1\to Y from the product of the space ''X'' with the unit interval , 1to ''Y'' such that H(x,0) = f(x) and H(x,1) = g(x) for all x \in X. If we think of the second ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Open Set
In mathematics, open sets are a generalization of open intervals in the real line. In a metric space (a set along with a distance defined between any two points), open sets are the sets that, with every point , contain all points that are sufficiently near to (that is, all points whose distance to is less than some value depending on ). More generally, one defines open sets as the members of a given collection of subsets of a given set, a collection that has the property of containing every union of its members, every finite intersection of its members, the empty set, and the whole set itself. A set in which such a collection is given is called a topological space, and the collection is called a topology. These conditions are very loose, and allow enormous flexibility in the choice of open sets. For example, ''every'' subset can be open (the discrete topology), or no set can be open except the space itself and the empty set (the indiscrete topology). In practice, howe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface Reconstruction
Surface reconstruction refers to the process by which atoms at the surface of a crystal assume a different structure than that of the bulk. Surface reconstructions are important in that they help in the understanding of surface chemistry for various materials, especially in the case where another material is adsorbed onto the surface. Basic principles In an ideal infinite crystal, the equilibrium position of each individual atom is determined by the forces exerted by all the other atoms in the crystal, resulting in a periodic structure. If a surface is introduced to the surroundings by terminating the crystal along a given plane, then these forces are altered, changing the equilibrium positions of the remaining atoms. This is most noticeable for the atoms at or near the surface plane, as they now only experience inter-atomic forces from one direction. This imbalance results in the atoms near the surface assuming positions with different spacing and/or symmetry from the bulk atoms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Voronoi Diagram
In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region, called a Voronoi cell, consisting of all points of the plane closer to that seed than to any other. The Voronoi diagram of a set of points is dual to that set's Delaunay triangulation. The Voronoi diagram is named after mathematician Georgy Voronoy, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet). Voronoi cells are also known as Thiessen polygons. Voronoi diagrams have practical and theoretical applications in many fields, mainly in science and technology, but also in visual art. The simplest case In the simplest case, shown in the first picture, we are given a finite set of points in the Euclid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetry Set
In geometry, the symmetry set is a method for representing the local symmetries of a curve, and can be used as a method for representing the shape of objects by finding the topological skeleton. The medial axis The medial axis of an object is the set of all points having more than one closest point on the object's boundary. Originally referred to as the topological skeleton, it was introduced in 1967 by Harry Blum as a tool for biological shape recog ..., a subset of the symmetry set is a set of curves which roughly run along the middle of an object. In 2 dimensions Let I \subseteq \mathbb be an open interval, and \gamma : I \to \mathbb^2 be a parametrisation of a smooth plane curve. The symmetry set of \gamma (I) \subset \mathbb^2 is defined to be the closure of the set of centres of circles tangent to the curve at at least two distinct points ( bitangent circles). The symmetry set will have endpoints corresponding to vertices of the curve. Such points will lie at cus ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
