# US 2026/0087671 A1 · Camera calibration method based on integrated dynamic dispersion-enhanced particle swarm optimization algorithm

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0087671 A1
- Document ID: US20260087671A1
- Status: Published application
- Kind: A1
- Application number: 19/324,147
- Filed: 2025-09-10
- Published: 2026-03-26
- Earliest claimed: 2024-09-20
- Assignees: Guilin University of Technology; Guilin University of Aerospace Technology; Guilin Urban Planning&Design Institute; Guilin Saipu Electronic Technology Co., Ltd
- Applicants: Guilin University of Technology; Guilin University Of Aerospace Technology; Guilin Urban Planning&Design Institute; Guilin Saipu Electronic Technology Co., Ltd
- Inventors: Xiaoping Yang; Longfei Nie; Zhehong Li; Xiaoxia Li; Yaolan Niu; Lieping Zhang; Guanghui Liu
- Web page: https://patentgrep.com/patent/US20260087671A1

## CPC

- G06T 7/80: Analysis of captured images to determine intrinsic or extrinsic camera parameters, i.e. camera calibration
- G06N 3/006: based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
- G06T 2207/20004: Adaptive image processing
- G06T 2207/20081: Training; Learning
- G06T 2207/30208: Marker matrix
- Y02T 10/40: Engine management systems
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- Y02T: CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION

## Abstract

A camera calibration method based on an integrated dynamic dispersion-enhanced particle swarm optimization algorithm includes: acquiring multiple images of a calibration board of different angles and converting them into grayscale images, detecting Harris corner points, and solving sub-pixel coordinate; estimating, by using the sub-pixel coordinates and a distortion camera model, initial values of camera intrinsic parameters through Zhang's camera calibration method; calibrating the camera intrinsic parameters, and calculating fitness values of particles; determining whether iteration termination condition is met, whether the fitness values of the particles have reached a convergence condition, and whether algorithm is trapped in a local optimum, to thereby determine whether a maximum number of iterations is reached or a specific fitness threshold is met; and outputting camera parameters corresponding to a global optimal solution of the particles when the maximum number of iterations is reached or the specific fitness threshold is met.

## Claims

### Claim 1

A camera calibration method based on an integrated dynamic dispersion-enhanced particle swarm optimization (IDDE-PSO) algorithm, comprising the following steps:
S1, acquiring a plurality of images of a calibration board of different angles, converting the plurality of images of the calibration board into grayscale images, detecting Harris corner points of the grayscale images, and solving sub-pixel coordinates;
S2, estimating, by using the sub-pixel coordinates and a distortion camera model, initial values X0 of camera intrinsic parameters through Zhang's camera calibration method;
S3, initializing parameters of the IDDE-PSO algorithm, calibrating the camera intrinsic parameters based on the initial values of the camera intrinsic parameters, and calculating fitness values of particles;
S4, determining whether the fitness values of the particles have reached a convergence condition; when the fitness values of the particles have not reached the convergence condition, performing adaptive nonlinear adjustment on an inertial parameter, adaptively adjusting learning factors by using sine and cosine variations, iteratively updating velocities and positions of the particles, continuously updating individual optimal positions and global optimal positions of the particles by using a greedy selection algorithm, optimizing the camera intrinsic parameters by using the IDDE-PSO algorithm, and determining whether a maximum number of iterations is reached or a specific fitness threshold is met;
S5, determining whether the IDDE-PSO algorithm is trapped in a local optimum when the fitness values of the particles in step S4 have reached the convergence condition; when the IDDE-PSO algorithm is trapped in the local optimum, introducing a Cauchy perturbation-based particle swarm optimization algorithm, updating the individual optimal positions of the particles and re-evaluating the fitness values of the particles, continuously updating the individual optimal positions and the global optimal positions of the particles by using the greedy selection algorithm, optimizing the camera intrinsic parameters by using the IDDE-PSO algorithm, and determining whether the maximum number of iterations is reached or the specific fitness threshold is met; when the IDDE-PSO algorithm is not trapped in the local optimum, directly determining whether the maximum number of iterations is reached or the specific fitness threshold is met; and
S6, outputting camera parameters corresponding to a global optimal solution of the particles, when the maximum number of iterations is reached or the specific fitness threshold is met; returning to execute steps S3 to S5 until the maximum number of iterations is reached or the specific fitness threshold is met, when the maximum number of iterations is not reached and the specific fitness threshold is not met.

### Claim 2 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein, in step S2, the initial values X0 of the camera intrinsic parameters estimated through the Zhang's camera calibration method are specifically as follows:
X
0
=
(
α
,
β
,
γ
,
u
0
,
v
0
,
k
1
,
k
2
,
p
1
,
p
2
,
k
3
)
;
where, (u0, v0) is a principal point coordinate of image; (α,β) is a ratio of a camera focal length to a physical size of a unit pixel; γ represents a skew factor, k1, k2, and k3 are radial distortion parameters, and p1 and p2 are tangential distortion parameters.

### Claim 3 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein the parameters of the IDDE-PSO algorithm initialized in step S3 comprise a population size N, the maximum number of iterations T, a stagnation threshold St=15, an inertia weight w, and maximum values and minimum values of the learning factors c1 and c2.

### Claim 4 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein, in step S3, the calculating fitness values of particles specifically comprises:
calculating a minimum average reprojection error Xbest of M corner points in each of the plurality of images of the calibration board, and taking the minimum average reprojection error Xbest as an optimization objective;
taking current position of each of the particles as the individual optimal position of the particle; and
taking the fitness value of current one of the particles as an individual optimal solution of the current one of the particles.

### Claim 5 (depends on 4)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 4, wherein the calculating a minimum average reprojection error Xbest of M corner points in each of the plurality of images of the calibration board is specifically as follows:
expressing an average reprojection error function of each of the plurality of images of the calibration board as follows:
f
⁡
(
X
)
=
1
M
⁢
∑
i
=
1
M
⁢
(
K
⁡
(
X
)
[
R
⁢
T
]
⁢
P
i
-
q
i
)
2
,
where, M is a number of corner points of the calibration board, K(X)[R T]Pi is a coordinate of a reprojection point obtained by projecting a coordinate point Pi in a world coordinate system corresponding to an i-th target point back onto an image plane through a nonlinear camera imaging model; and qi is a sub-pixel corner point coordinate actually detected at an i-th corner point; and
calculating the minimum average reprojection error Xbest of the M corner points in each of the plurality of images of the calibration board as follows:
X
best
=
arg
⁢
min
x
⁢
(
1
M
⁢
∑
i
=
1
M
⁢
(
K
⁡
(
X
)
[
R
⁢
T
]
⁢
P
i
-
q
i
)
2
)
.

### Claim 6 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein in step S5, the Cauchy perturbation-based particle swarm optimization algorithm is specifically as follows:
{
v
id
t
+
1
=
w
id
t
⁢
v
id
t
+
c
1
⁢
r
1
(
p
id
t
-
X
id
t
+
r
3
⁢
Gaussian
i
t
)
+
c
2
⁢
r
2
(
g
d
-
X
id
t
)
x
id
t
+
1
=
x
id
t
+
v
id
t
+
1
where
⁢
Cauchy
i
t
=
r
4
⁢
Cauchy
(
u
,
σ
)
represents a Cauchy perturbation generated by a particle i in a t-th iteration; u represents a mean value, r3 and r4 are random numbers in a range of
[
0
,
1
]
;
σ
=
σ
0
⁢
T
-
t
T
represents a variance; σ0 represents an initial standard deviation; t represents a current number of iterations; and T represents the maximum number of iterations.

### Claim 7 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein in step S4, the performing adaptive nonlinear adjustment on an inertia parameter is realized as follows:
w
i
t
=
{
w
min
-
(
w
max
-
w
min
)
⁢
f
⁡
(
X
i
t
)
-
f
min
t
f
average
t
-
f
min
t
,
f
⁡
(
X
i
t
)
≤
f
average
t
w
max
,
f
⁡
(
X
i
t
)
>
f
average
t
f
average
t
=
∑
i
=
1
n
f
⁡
(
X
i
t
)
n
f
min
t
=
min
⁢
{
f
⁡
(
X
1
t
)
,
f
⁡
(
X
2
t
)
,
…
,
f
⁡
(
X
n
t
)
}
where, wmax=0.9 represents a maximum value of the inertial parameter; wmin=0.4 represents a minimum value of the inertial parameter;
f
⁡
(
X
i
t
)
represents the fitness value of current one of the particles in a t-th iteration;
f
average
t
represents an average value of current fitness values of all the particles; and
f
min
t
represents a minimum value of the current fitness values of all the particles.

### Claim 8 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein, in step S4, the adaptively adjusting learning factors by using sine and cosine variations is realized as follows:
c
1
=
c
1
⁢
_
⁢
max
+
(
c
1
⁢
_
⁢
max
-
c
1
⁢
_
⁢
min
)
⁢
cos
⁢
(
π
*
t
T
)
c
2
=
c
2
⁢
_
⁢
max
+
(
c
2
⁢
_
⁢
max
-
c
2
⁢
_
⁢
min
)
⁢
sin
⁢
(
π
*
t
T
)
where, c1_max=1.5 and c1_min=1 are upper and lower limit values of a learning factor c1, respectively; c2_max=1.5 and c2_min=1 are upper and lower limit values of a learning factor c2, respectively; t represents a current number of iterations; and T represents a total number of iterations.

### Claim 9 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein, in step S4, the iteratively updating velocities and positions of the particles specifically comprises the following steps:
taking positions corresponding to all the particles as global optimal positions;
comparing a current state of each of the particles with a historical global optimal state of the particle, screening by minimizing an average reprojection error function, and taking current fitness value of the particle and a position of the particle corresponding thereto as an updated individual optimal value of the particle when the current fitness value of the particle is smaller than an individual optimal value of the particle; and
calculating a minimum value of individual optimal values of all the particles; comparing the minimum value with a global optimal value; and when the minimum value is smaller than the global optimal value, namely a particle state is better than a global optimal state, updating the global optimal state.

### Claim 10 (depends on 1)

The camera calibration method based on the IDDE-PSO algorithm as claimed in claim 1, wherein, in step S5, the updating the individual optimal positions of the particles and re-evaluating the fitness values of the particles is realized as follows:
v
id
t
+
1
=
wv
id
t
+
c
1
⁢
r
1
(
p
id
t
-
X
id
t
)
+
c
2
⁢
r
2
(
g
d
-
X
id
t
)
X
id
t
+
1
=
X
id
t
+
v
id
t
+
1
,
d
=
1
,
2
,
…
,
D
where
,
v
id
t
represents the velocity of a particle; a superscript t represents a current number of iterations; a subscript i represents an index of the particle; a subscript d represents a dimension of the particle; X represents a position of an i-th particle; p represents the individual optimal position Pbest of the i-th particle; g represents a global optimal value searched by a particle swarm; w represents an inertia weight and is configured to balance global search and local development capabilities; c1 and c2 are acceleration coefficients, namely the learning factors; and r1 and r2 are random numbers in a range of [0, 1].
