# Size function

Size function

Size functions are shape descriptors, in a geometrical/topological sense. They are functions from the half-plane $x to the natural numbers, counting certain connected components of a topological space. They are used in pattern recognition and topology.

## Formal definition

In size theory, the size function $\ell_{(M,\varphi)}:\Delta^+=\{(x,y)\in \mathbb{R}^2:x associated with the size pair $(M,\varphi:M\to \mathbb{R})$ is defined in the following way. For every $(x,y)\in \Delta^+$, $\ell_{(M,\varphi)}(x,y)$ is equal to the number of connected components of the set $\{p\in M:\varphi(p)\le y\}$ that contain at least one point at which the measuring function (a continuous function from a topological space $M\$ to $\mathbb{R}^k\$. ) φ takes a value smaller than or equal to $x\$ . The concept of size function can be easily extended to the case of a measuring function $\varphi:M\to \mathbb{R}^k$, where $\mathbb{R}^k$ is endowed with the usual partial order . A survey about size functions (and size theory) can be found in .  An example of size function. (A) A size pair $(M,\varphi:M\to\mathbb{R})$, where M is the blue curve and $\varphi:M\to \mathbb{R}$ is the height function. (B) The set $\{p\in M:\varphi(p)\le b\}$ is depicted in green. (C) The set of points at which the measuring function φ takes a value smaller than or equal to a is depicted in red. (D) Two connected component of the set $\{p\in M:\varphi(p)\le b\}$ contain at least one point at which the measuring function φ takes a value smaller than or equal to a. (E) The value of the size function $\ell_{(M,\varphi)}$ in the point (a,b) is equal to 2.

## History and applications

Size functions were introduced in  for the particular case of $M\$ equal to the topological space of all piecewise $C^1\$ closed paths in a $C^\infty\$ closed manifold embedded in a Euclidean space. Here the topology on $M\$ is induced by the $C^0\$-norm, while the measuring function $\varphi\$ takes each path $\gamma\in M$ to its length. In  the case of $M\$ equal to the topological space of all ordered $k\$-tuples of points in a submanifold of a Euclidean space is considered. Here the topology on $M\$ is induced by the metric $d((P_1,\ldots,P_k),(Q_1\ldots,Q_k))=\max_{1\le i\le k}\|P_i-Q_i\|$.

An extension of the concept of size function to algebraic topology was made in , where the concept of size homotopy group was introduced. Here measuring functions taking values in $\mathbb{R}^k$ are allowed. An extension to homology theory (the size functor) was introduced in . The concepts of size homotopy group and size functor are strictly related to the concept of persistent homology group , studied in persistent homology. It is worth to point out that the size function is the rank of the 0-th persistent homology group, while the relation between the persistent homology group and the size homotopy group is analogous to the one existing between homology groups and homotopy groups.

Size functions have been initially introduced as a mathematical tool for shape comparison in computer vision and pattern recognition, and have constituted the seed of size theory , , , , , , ,  The main point is that size functions are invariant for every transformation preserving the measuring function. Hence, they can be adapted to many different applications, by simply changing the measuring function in order to get the wanted invariance. Moreover, size functions show properties of relative resistance to noise, depending on the fact that they distribute the information all over the half-plane $\Delta^+\$.

## Main properties

Assume that $M\$ is a compact locally connected Hausdorff space. The following statements hold:

¤ every size function $\ell_{(M,\varphi)}(x,y)$ is a non-decreasing function in the variable $x\$ and a non-increasing function in the variable $y\$.

¤ every size function $\ell_{(M,\varphi)}(x,y)$ is locally right-constant in both its variables.

¤ for every $x, $\ell_{(M,\varphi)}(x,y)$ is finite.

¤ for every x < min φ and every $y>x\$, $\ell_{(M,\varphi)}(x,y)=0$.

¤ for every $y\ge\max \varphi$ and every $x, $\ell_{(M,\varphi)}(x,y)$ equals the number of connected components of $M\$ on which the minimum value of φ is smaller than or equal to $x\$.

If we also assume that $M\$ is a smooth closed manifold and φ is a $C^1\$-function, the following useful property holds:

¤ in order that $(x,y)\$ is a discontinuity point for $\ell_{(M,\varphi)}$ it is necessary that either $x\$ or $y\$ or both are critical values for φ. 

A strong link between the concept of size function and the concept of natural pseudodistance d((M,φ),(N,ψ)) between the size pairs $(M,\varphi),\ (N,\psi)$ exists , :

¤ if $\ell_{(N,\psi)}(\bar x,\bar y)>\ell_{(M,\varphi)}(\tilde x,\tilde y)$ then $d((M,\varphi),(N,\psi))\ge \min\{\tilde x-\bar x,\bar y-\tilde y\}$.

The previous result gives an easy way to get lower bounds for the natural pseudodistance and is one of the main motivation to introduce the concept of size function.

## Representation by formal series

An algebraic representation of size functions in terms of collections of points and lines in the real plane with multiplicities, i.e. as particular formal series, was furnished in , , . The points (called cornerpoints) and lines (called cornerlines) of such formal series encode the information about discontinuities of the corresponding size functions, while their multiplicities contain the information about the values taken by the size function.

Formally:

• cornerpoints are defined as those points $p=(x,y)\$, with $x, such that the number $\mu (p){\stackrel{{\rm def}}{=}}\min _{\alpha >0 ,\beta>0} \ell _{({M},\varphi )}(x+\alpha ,y- \beta)-\ell _{({ M},\varphi )} (x+\alpha ,y+\beta )- \ell_{({ M},\varphi )} (x-\alpha ,y-\beta )+\ell _{({ M} ,\varphi )} (x-\alpha ,y+\beta )$ is positive. The number $\mu (p)\$ is said to be the multiplicity of $p\$.

• cornerlines and are defined as those lines $r:x=k\$ such that $\mu (r){\stackrel{\rm def}{=}}\min _{\alpha >0 ,k+\alpha 0.$ The number $\mu (r)\$ is sad to be the multiplicity of $r\$.

• Representation Theorem: For every ${\bar x}<{\bar y}$, it holds $\ell _{({M},\varphi )}({\bar x},{\bar y})=\sum _{p=(x,y)\atop x\le {\bar x}, y>\bar y }\mu\big(p\big)+\sum _{r:x=k\atop k\le {\bar x} }\mu\big(r\big)$

This representation contains the same amount of information about the shape under study as the original size function does, but is much more concise.

This algebraic approach to size functions leads to the definition of new similarity measures between shapes, by translating the problem of comparing size functions into the problem of comparing formal series. The most studied among these metrics between size function is the matching distance.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Size functor — Given a size pair (M,f) where M is a manifold of dimensionn and f is an arbitrary real continuous function definedon it, the i th size functor Francesca Cagliari, Massimo Ferri, Paola Pozzi, Size functions from a categorical viewpoint , Acta… …   Wikipedia

• Size pair — In size theory, a size pair is a pair (M,varphi), where M is a compact topological space and varphi:M o mathbb{R}^k is a continuous function Patrizio Frosini, Claudia Landi, Size theory as a topological tool for computer vision , Pattern… …   Wikipedia

• Size homotopy group — The concept of size homotopy group is the anologous in size theory of the classical concept of homotopy group. In order to give its definition, let us assume that a size pair (M,varphi) is given, where M is a closed manifold of class C^0 and… …   Wikipedia

• Size changing — is the hypothetical process of reducing or enlarging the size, mass, and volume of an object in space, usually proportionally. It is a hypothetical process and is not to be confused with known processes where objects appear to change size through …   Wikipedia

• Size-exclusion chromatography — Equipment for running size exclusion chromatography. The buffer is pumped through the column (right) by a computer controlled device Acronym SEC Classification Chromatography Analytes …   Wikipedia

• Function-Point-Verfahren — Das Function Point Verfahren (auch Analyse oder Methode, kurz FPA) dient zur Bewertung des fachlich funktionalen Umfangs eines Informationstechnischen Systems, im Folgenden als Anwendung bezeichnet. Das Ergebnis einer Function Point Bewertung… …   Deutsch Wikipedia

• Function point — A function point is a unit of measurement to express the amount of business functionality an information system provides to a user. Function points are the units of measure used by the IFPUG Functional Size Measurement Method. The IFPUG FSM… …   Wikipedia

• Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a …   Wikipedia

• Function key — A function key is a key on a computer or terminal keyboard which can be programmed so as to cause an operating system command interpreter or application program to perform certain actions. On some keyboards/computers, function keys may have… …   Wikipedia

• Function pointer — A function pointer is a type of pointer in C, C++, D, and other C like programming languages, and Fortran 2003. When dereferenced, a function pointer can be used to invoke a function and pass it arguments just like a normal function. In… …   Wikipedia