Size function

Formal definition

In size theory, the size function ℓ ( M , φ ) : Δ + = { ( x , y ) ∈ R 2 : x < y } → N associated with the size pair ( M , φ : M → R ) is defined in the following way. For every ( x , y ) ∈ Δ + , ℓ ( M , φ ) ( x , y ) is equal to the number of connected components of the set { p ∈ M : φ ( p ) ≤ y } that contain at least one point at which the measuring function (a continuous function from a topological space M   to 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 φ : M → R k , where R k is endowed with the usual partial order . A survey about size functions (and size theory) can be found in .

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 ∞   closed manifold embedded in a Euclidean space. Here the topology on M   is induced by the C 0   -norm, while the measuring function φ   takes each path γ ∈ 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 , … , P k ) , ( Q 1 … , Q k ) ) = max 1 ≤ i ≤ 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 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 Δ +   .

Main properties

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

¤ every size function ℓ ( M , φ ) ( x , y ) is a non-decreasing function in the variable x   and a non-increasing function in the variable y   .

¤ every size function ℓ ( M , φ ) ( x , y ) is locally right-constant in both its variables.

¤ for every x < y   , ℓ ( M , φ ) ( x , y ) is finite.

¤ for every x < min φ and every y > x   , ℓ ( M , φ ) ( x , y ) = 0 .

¤ for every y ≥ max φ and every x < y   , ℓ ( M , φ ) ( 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 ℓ ( M , φ ) 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 , φ ) ,   ( N , ψ ) exists

¤ if ℓ ( N , ψ ) ( x ¯ , y ¯ ) > ℓ ( M , φ ) ( x ~ , y ~ ) then d ( ( M , φ ) , ( N , ψ ) ) ≥ min { x ~ − x ¯ , y ¯ − 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:

μ ( p ) = d e f min α > 0 , β > 0 ℓ ( M , φ ) ( x + α , y − β ) − ℓ ( M , φ ) ( x + α , y + β ) − ℓ ( M , φ ) ( x − α , y − β ) + ℓ ( M , φ ) ( x − α , y + β ) is positive. The number μ ( p )   is said to be the multiplicity of p   .

μ ( r ) = d e f min α > 0 , k + α < y ℓ ( M , φ ) ( k + α , y ) − ℓ ( M , φ ) ( k − α , y ) > 0. The number μ ( r )   is sad to be the multiplicity of r   .

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.