AI Glossary / Computer vision and multimodal AI / Intermediate
Division model (Fitzgibbon)
Definition
The division model associated with Fitzgibbon is a compact mathematical model of radial lens distortion. In its common one-parameter form, it maps a distorted image point to an idealized undistorted point by dividing its coordinates by a radius-dependent factor. Its simple form supports estimation of image geometry together with a radial-distortion parameter.
What it means
An ideal pinhole camera maps straight scene lines to straight image lines, but real lenses can introduce curved-looking radial distortion. Geometric methods that ignore this distortion may struggle, especially toward the image edges.
The division model approximates that distortion with a small number of parameters. In the one-parameter form, coordinates are measured relative to a specified distortion center. The undistorted coordinates are obtained by dividing the distorted coordinates by 1 plus a coefficient times the squared distorted radius.
Fitzgibbon's 2001 work used this representation in multiple-view estimation. The model is useful because of its algebraic structure, not because every lens follows it exactly. A more detailed calibration model may be needed when a single radial term does not describe the imaging system adequately.
How it works
Choose a coordinate system with its origin at the assumed distortion center. Record any coordinate normalization, since the numerical coefficient depends on the coordinate scale.
For a distorted point with coordinates (x, y), calculate r squared = x squared + y squared. With coefficient lambda, the simple division mapping gives undistorted coordinates (x, y) divided by (1 + lambda times r squared).
Estimate lambda from suitable image evidence and geometric constraints. The original research demonstrates how a radial term can be included when estimating relationships between views, rather than requiring a separately known correction first.
Check the model against observed correspondences or calibration evidence across the image. Confirm the mapping direction, coefficient convention, and valid radius range before applying it. Producing a corrected image also requires a resampling strategy; a coordinate formula alone does not specify how all output pixel colors are obtained.
Three practical examples
1. Image matching: A reconstruction pipeline accounts for radial distortion when comparing corresponding features across photographs.
2. Archive-footage analysis: A researcher estimates a simple distortion correction when the original camera is unavailable and suitable multi-view evidence exists.
3. Calibration comparison: An imaging team evaluates whether a one-parameter radial model fits its data well enough or requires a richer alternative.
Think of it this way
Think of a drawing on a flexible sheet that has been stretched differently at different distances from its center. A radial correction moves points along rays from that center to approximate the intended geometry.
The analogy is limited because the division model is a specific equation, not an arbitrary flexible correction. It cannot represent every local deformation, tangential effect, or complex lens behavior simply by changing one coefficient.
Worked example
Use normalized distorted coordinates (0.6, 0.8), measured relative to the chosen distortion center. Their squared radius is 0.6 squared + 0.8 squared = 1.
Set lambda = 0.2 for this teaching example. The denominator is 1 + 0.2 × 1 = 1.2. The undistorted coordinates are therefore (0.5, approximately 0.6667), with radius approximately 0.8333.
Now consider the point (0.3, 0.4), whose squared radius is 0.25. Its denominator is 1.05, giving approximately (0.2857, 0.3810). The farther point receives a stronger relative radial adjustment in this example.
These numbers illustrate the specified distorted-to-undistorted mapping. They are not a universal camera calibration. If coordinates are rescaled, the coefficient must be adjusted consistently; copying lambda into a pixel-coordinate implementation without accounting for normalization changes the model. Also, a denominator near zero signals an unsuitable or problematic parameter-range combination rather than a useful correction.
Illustrative case study
Fictional case study: ArchiveTrack reconstructs camera motion from an old video sequence. Feature matches near the image center fit its initial geometry, while matches near the edges show systematic residual errors.
The team evaluates a radial division model and compares residuals across the frame. It verifies the assumed distortion center and keeps some observations separate for validation rather than judging only the fitting data.
Where the simple model remains inadequate, it investigates other explanations and calibration models. This fictional case illustrates a diagnostic workflow; it does not claim that radial distortion is the cause of every peripheral mismatch or that one parameter guarantees an accurate reconstruction.
Common misconceptions and mistakes
Do not substitute a division-model coefficient directly into a different polynomial distortion formula. The mapping direction, radius definition, and coefficient conventions may differ.
Do not treat the model as an exact algebraic inverse of every familiar radial polynomial. It is its own approximation to lens behavior.
Do not ignore the distortion center or coordinate normalization. Both affect how the coefficient should be interpreted.
Do not assume a low fitting error proves the complete camera model is correct. Correspondence errors, scene geometry, and insufficient coverage can affect estimation and validation.
Business use
Businesses encounter this model in image matching, camera tracking, and three-dimensional reconstruction tools. The practical question is whether its simplicity provides adequate accuracy for the intended images and measurements.
Ask how calibration is estimated, which image regions support it, and how the result is checked on independent evidence. Preserve the mapping convention and normalization with the coefficient. A single unexplained number is not a portable calibration record, and an attractive corrected preview is weaker evidence than measured geometric residuals across representative views.
People also ask
Does the model correct all lens distortion?
No. Its common one-parameter form addresses a radial approximation and may miss other effects.
Is lambda independent of image-coordinate units?
No. Changing coordinate scale requires a consistent change in the parameter interpretation.
Is the division model a neural network?
No. It is a mathematical camera-distortion model that can be used within larger vision pipelines.
Check your understanding
Why should a coefficient estimated in normalized coordinates not be copied directly into a pixel-coordinate formula?
Answer: The squared radius changes with coordinate scale. Without a corresponding coefficient adjustment, the denominator describes a different distortion mapping.
Related terms
- Image rectification
- Bundle adjustment
- Radial distortion
- camera calibration
- pinhole camera
- fundamental matrix
- image resampling
Learn next
Learn radial-distortion conventions next and compare distorted-to-undistorted and undistorted-to-distorted mappings. Then study bundle adjustment to see how camera parameters and scene geometry can be refined together after an initial estimate.
More in Computer vision and multimodal AI
- Distance map - A distance map is an image or grid in which each location stores its distance to a specified set of locations, such as the nearest background pixel, object...
- Distant supervision - Distant supervision creates training signals by connecting unlabeled examples with an external source of information, rather than manually labeling every...
- Divergence - In vector calculus, divergence measures the local net outward flow of a vector field per unit volume, or per unit area in two dimensions.
- Document retrieval - Document retrieval is the process of finding documents that are relevant to a user's information need within a collection.
- Domain (spatial) operation - In the supplied computational-photography glossary, a domain (spatial) operation changes where image information is sampled: an output pixel obtains its...
- Downhill simplex - Downhill simplex is a derivative-free optimization method commonly referring to the Nelder - Mead algorithm.
Sources
Andrew W. Fitzgibbon, Simultaneous linear estimation of multiple view geometry and lens distortion, 2001: primary paper consulted for the division mapping, coordinate assumptions, and multiple-view estimation motivation. The normalized-coordinate calculation and fictional archive case are original teaching examples. https://www.robots.ox.ac.uk/~vgg/publications/2001/Fitzgibbon01b/fitzgibbon01b.pdf
Previous: Divide-and-conquer algorithm Next: Divisive clustering