Rossmo's formula

Last updated September 30, 2024

Rossmo's formula is a geographic profiling formula to predict where a serial criminal lives. It relies upon the tendency of criminals to not commit crimes near places where they might be recognized, but also to not travel excessively long distances. The formula was developed and patented in 1996^[1] by criminologist Kim Rossmo and integrated into a specialized crime analysis software product called Rigel.^[2] The Rigel product is developed by the software company Environmental Criminology Research Inc. (ECRI), which Rossmo co-founded.^[3]

Formula

Imagine a map with an overlaying grid of little squares named sectors. If this map is a raster image file on a computer, these sectors are pixels. A sector $S_{i,j}$ is the square on row i and column j, located at coordinates $(X_{i},Y_{j})$ . The following function gives the probability $p_{i,j}$ of the position of the serial criminal residing within a specific sector (or point) $(X_{i},Y_{j})$ :^[4]

$p_{i,j}=k\sum _{n=1}^{T}\left[\underbrace {\frac {\phi _{ij}}{(|X_{i}-x_{n}|+|Y_{j}-y_{n}|)^{f}}} _{1^{\mathrm {st} }\mathrm {\;term} }+\underbrace {\frac {(1-\phi _{ij})(B^{g-f})}{(2B-|X_{i}-x_{n}|-|Y_{j}-y_{n}|)^{g}}} _{2^{\mathrm {nd} }\mathrm {\;term} }\right],$ where: $\phi _{ij}={\begin{cases}1,&\mathrm {\quad if\;} (|X_{i}-x_{n}|+|Y_{j}-y_{n}|)>B\quad \\0,&\mathrm {\quad else} \end{cases}}$

Here the summation is over past crimes located at coordinates $(x_{n},y_{n})$ , $n=1,\ldots ,T$ , where $T$ is the number of past crimes. Furthermore, $\phi _{ij}$ is an indicator function that returns 0 when a point $(X_{i},Y_{j})$ is an element of the buffer zone B (the neighborhood of a criminal residence that is swept out by a radius of B from its center). The indicator $\phi _{ij}$ allows the computation to switch between the two terms. If a crime occurs within the buffer zone, then $\phi _{ij}=0$ and, thus, the first term does not contribute to the overall result. This is a prerogative for defining the first term in the case when the distance between a point (or pixel) becomes equal to zero. When $\phi _{ij}=1$ , the 1st term is used to calculate $p_{i,j}$ .

$|X_{i}-x_{n}|+|Y_{j}-y_{n}|$ is the Manhattan distance between a point $(X_{i},Y_{j})$ and the n-th crime site $(x_{n},y_{n})$ , $n=1,\ldots ,T$ .

Finally, $k>0$ is an appopriately selected normalization constant to ensure that $\sum _{i}\sum _{j}p_{i,j}\leq 1$ .

Alternative Implementation

$p_{i,j}$ is not well suited for image processing because of the asymptotic behavior near the coordinates of a crime site.

Alternatively, Rossmo's function may use other distance decay functions instead of ${\frac {1}{(\mathrm {Mathattan\;Distance} )^{f}}}$ .

One method would be to use a probability distribution similar to the Gaussian Distribution as a distance decay function:

$1^{\mathrm {st} }\mathrm {\;term} (x,y)=\left\lfloor (\mathrm {number\;of\;colors} )\times \sum _{n=1}^{(\mathrm {total\;crimes} )}{\frac {1}{\sqrt {e^{({|x-C_{n}(x)|}^{2}+{|y-C_{n}(y)|}^{2})}}}}\right\rfloor$

If implementing on a computer, the maximum value of p() matches the maximum value of a set of colors being used to create the n by m Jeopardy Surface matrix J. The elements of the matrix J may represent the pixel values of an image.

Where: $J={\begin{bmatrix}p(n,0)&\cdots &\;&p(n,m)\\\vdots &\ddots &\;&\vdots \\p(x,0)&\cdots &p(x,y)&\vdots \\\vdots &\;&\;&\vdots \\p(0,0)&p(1,0)&p(2,0)&\cdots \end{bmatrix}}$

Explanation

The summation in the formula consists of two terms. The first term describes the idea of decreasing probability with increasing distance. The second term deals with the concept of a buffer zone. The variable $\phi$ is used to put more weight on one of the two ideas. The variable $B$ describes the radius of the buffer zone. The constant $k$ is empirically determined.

The main idea of the formula is that the probability of crimes first increases as one moves through the buffer zone away from the hotzone, but decreases afterwards. The variable $f$ can be chosen so that it works best on data of past crimes. The same idea goes for the variable $g$ .

The distance is calculated with the Manhattan distance formula.

Applications

The formula has been applied to fields other than forensics.^[5] Because of the buffer zone idea, the formula works well for studies concerning predatory animals such as white sharks.^[6]

This formula and math behind it were used in crime detecting in the Pilot episode of the TV series Numb3rs and in the 100th episode of the same show, called "Disturbed".

Related Research Articles

Inductance is the tendency of an electrical conductor to oppose a change in the electric current flowing through it. The electric current produces a magnetic field around the conductor. The magnetic field strength depends on the magnitude of the electric current, and follows any changes in the magnitude of the current. From Faraday's law of induction, any change in magnetic field through a circuit induces an electromotive force (EMF) (voltage) in the conductors, a process known as electromagnetic induction. This induced voltage created by the changing current has the effect of opposing the change in current. This is stated by Lenz's law, and the voltage is called back EMF.

In the mathematical field of differential geometry, a metric tensor is an additional structure on a manifold $M$ that allows defining distances and angles, just as the inner product on a Euclidean space allows defining distances and angles there. More precisely, a metric tensor at a point $p$ of $M$ is a bilinear form defined on the tangent space at $p$ , and a metric field on $M$ consists of a metric tensor at each point $p$ of $M$ that varies smoothly with $p$ .

In mathematics, a direct limit is a way to construct a object from many objects that are put together in a specific way. These objects may be groups, rings, vector spaces or in general objects from any category. The way they are put together is specified by a system of homomorphisms between those smaller objects. The direct limit of the objects $, where ranges over some directed set, is denoted by . This notation suppresses the system of homomorphisms; however, the limit depends on the system of homomorphisms.$

An operator is a function over a space of physical states onto another space of states. The simplest example of the utility of operators is the study of symmetry. Because of this, they are useful tools in classical mechanics. Operators are even more important in quantum mechanics, where they form an intrinsic part of the formulation of the theory.

Electrostatics is a branch of physics that studies slow-moving or stationary electric charges.

In linear algebra, the Gram matrix of a set of vectors $in an inner product space is the Hermitian matrix of inner products, whose entries are given by the inner product . If the vectors are the columns of matrix then the Gram matrix is in the general case that the vector coordinates are complex numbers, which simplifies to for the case that the vector coordinates are real numbers.$

In mathematics, an ordered basis of a vector space of finite dimension $n$ allows representing uniquely any element of the vector space by a coordinate vector, which is a sequence of $n$ scalars called coordinates. If two different bases are considered, the coordinate vector that represents a vector $v$ on one basis is, in general, different from the coordinate vector that represents $v$ on the other basis. A change of basis consists of converting every assertion expressed in terms of coordinates relative to one basis into an assertion expressed in terms of coordinates relative to the other basis.

In differential geometry, the Laplace–Beltrami operator is a generalization of the Laplace operator to functions defined on submanifolds in Euclidean space and, even more generally, on Riemannian and pseudo-Riemannian manifolds. It is named after Pierre-Simon Laplace and Eugenio Beltrami.

In mathematics, a volume element provides a means for integrating a function with respect to volume in various coordinate systems such as spherical coordinates and cylindrical coordinates. Thus a volume element is an expression of the form $where the are the coordinates, so that the volume of any set can be computed by For example, in spherical coordinates, and so .$

In physics, a sigma model is a field theory that describes the field as a point particle confined to move on a fixed manifold. This manifold can be taken to be any Riemannian manifold, although it is most commonly taken to be either a Lie group or a symmetric space. The model may or may not be quantized. An example of the non-quantized version is the Skyrme model; it cannot be quantized due to non-linearities of power greater than 4. In general, sigma models admit (classical) topological soliton solutions, for example, the skyrmion for the Skyrme model. When the sigma field is coupled to a gauge field, the resulting model is described by Ginzburg–Landau theory. This article is primarily devoted to the classical field theory of the sigma model; the corresponding quantized theory is presented in the article titled "non-linear sigma model".

In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations, resulting in faster convergence. A similar method can be used for any slowly converging iterative process.

<span class="mw-page-title-main">Prony's method</span> Method to estimate the components of a signal

Prony analysis was developed by Gaspard Riche de Prony in 1795. However, practical use of the method awaited the digital computer. Similar to the Fourier transform, Prony's method extracts valuable information from a uniformly sampled signal and builds a series of damped complex exponentials or damped sinusoids. This allows the estimation of frequency, amplitude, phase and damping components of a signal.

In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. The output of the network is a linear combination of radial basis functions of the inputs and neuron parameters. Radial basis function networks have many uses, including function approximation, time series prediction, classification, and system control. They were first formulated in a 1988 paper by Broomhead and Lowe, both researchers at the Royal Signals and Radar Establishment.

<span class="mw-page-title-main">Classical group</span>

In mathematics, the classical groups are defined as the special linear groups over the reals $, the complex numbers and the quaternions together with special automorphism groups of symmetric or skew-symmetric bilinear forms and Hermitian or skew-Hermitian sesquilinear forms defined on real, complex and quaternionic finite-dimensional vector spaces. Of these, the complex classical Lie groups are four infinite families of Lie groups that together with the exceptional groups exhaust the classification of simple Lie groups. The compact classical groups are compact real forms of the complex classical groups. The finite analogues of the classical groups are the classical groups of Lie type . The term "classical group" was coined by Hermann Weyl, it being the title of his 1939 monograph The Classical Groups .$

In mathematics, Liouville's formula, also known as the Abel–Jacobi–Liouville identity, is an equation that expresses the determinant of a square-matrix solution of a first-order system of homogeneous linear differential equations in terms of the sum of the diagonal coefficients of the system. The formula is named after the French mathematician Joseph Liouville. Jacobi's formula provides another representation of the same mathematical relationship.

In mathematics, the spectral theory of ordinary differential equations is the part of spectral theory concerned with the determination of the spectrum and eigenfunction expansion associated with a linear ordinary differential equation. In his dissertation, Hermann Weyl generalized the classical Sturm–Liouville theory on a finite closed interval to second order differential operators with singularities at the endpoints of the interval, possibly semi-infinite or infinite. Unlike the classical case, the spectrum may no longer consist of just a countable set of eigenvalues, but may also contain a continuous part. In this case the eigenfunction expansion involves an integral over the continuous part with respect to a spectral measure, given by the Titchmarsh–Kodaira formula. The theory was put in its final simplified form for singular differential equations of even degree by Kodaira and others, using von Neumann's spectral theorem. It has had important applications in quantum mechanics, operator theory and harmonic analysis on semisimple Lie groups.

<span class="mw-page-title-main">Geographical distance</span> Distance measured along the surface of the Earth

Geographical distance or geodetic distance is the distance measured along the surface of the Earth, or the shortest arch length.

In statistics and in machine learning, a linear predictor function is a linear function of a set of coefficients and explanatory variables, whose value is used to predict the outcome of a dependent variable. This sort of function usually comes in linear regression, where the coefficients are called regression coefficients. However, they also occur in various types of linear classifiers, as well as in various other models, such as principal component analysis and factor analysis. In many of these models, the coefficients are referred to as "weights".

Lagrangian field theory is a formalism in classical field theory. It is the field-theoretic analogue of Lagrangian mechanics. Lagrangian mechanics is used to analyze the motion of a system of discrete particles each with a finite number of degrees of freedom. Lagrangian field theory applies to continua and fields, which have an infinite number of degrees of freedom.

References

↑ USpatent 5781704, Rossmo, D. K.,"Expert system method of performing crime site analysis",issued 2002-07-16
↑ "Rigel Analyst". Geographic Profiling - Crime Analysis. Environmental Criminology Research Inc. Retrieved 2019-02-12.
↑ Rich, T.; Shively, M (December 2004). "A Methodology for Evaluating Geographic Profiling Software" (PDF). U.S. Department of Justice. p. 14.
↑ Rossmo, Kim D. (1995). "Geographic profiling: target patterns of serial murderers" (PDF). Simon Fraser University: 225.{{cite journal}}: Cite journal requires |journal= (help)
↑ Le Comber, S. C.; Stevenson (2012). "From Jack the Ripper to epidemiology and ecology". Trends in Ecology & Evolution. 27 (6): 307–308. doi:10.1016/j.tree.2012.03.004. PMID 22494610.
↑ Martin, R. A.; Rossmo, D. K.; Hammerschlag, N. (2009). "Hunting patterns and geographic profiling of white shark predation" (PDF). Journal of Zoology. 279 (2): 111–118. doi:10.1111/j.1469-7998.2009.00586.x. Archived from the original (PDF) on 2010-06-12.