Method for detecting a moving radioactive source and associated device
09739893 · 2017-08-22
Assignee
Inventors
- Romain Coulon (Chaulgnes, FR)
- Vladimir Kondrasovs (Palaiseau, FR)
- Karim Boudergui (Nogent-le-Phaye, FR)
- Mounir Bakkali (Meudon, FR)
- Stéphane Normand (Isigny le Buat, FR)
Cpc classification
International classification
Abstract
A method for detecting a radioactive source moving on a linear path substantially parallel to an alignment of N detectors. The method includes: forming N×N.sub.t pulse counting values M.sub.i,t (i=1, 2, . . . , N and t=1, 2, . . . , N.sub.t) from N×N.sub.t detection signals delivered by the N detectors in the form of a succession over time of N.sub.t sets of N signals simultaneously detected by the N detectors over a same duration Δt, a pulse counting value representing a number of pulses detected by a detector over a duration Δt; and computing, using a computer: a set of N.sub.t correlation products R.sub.t, a static mean
Claims
1. A method for detecting a radioactive source moving on a linear path substantially parallel to an alignment of N detectors, N being an integer equal to or greater than 2, the method comprising: simultaneously detecting N signals by N detectors; delivering N×N.sub.t detection signals from the N detectors in the form of a succession over time of N.sub.t sets of the N signals simultaneously detected by the detector over a duration Δt, N.sub.t being significantly greater than N, a pulse counting value representing a number of pulses detected by a detector over a duration Δt; forming N×N.sub.t pulse counting values M.sub.i,t (i=1, 2, . . . , N and t=1, 2, . . . , N.sub.t) from the N×N.sub.t detection signals; computing, using a computer: a set of N.sub.R correlation products R.sub.z so that:
R.sub.z=Π.sub.i=1.sup.NM.sub.i,[(N−i)z+1] (z=1,2, . . . , N.sub.R) with N.sub.R being an integer equal to
2. The method according to claim 1, the method further comprising computing, by the computer, a speed V of the radioactive source as soon as a radioactive source is determined to have moved in front of the detectors, such that:
V=d/(T×Δt), where d is a distance separating two neighbouring detectors and T is a rank t of a set of N pulse counting values for which the correlation product R.sub.Z is maximum.
3. The method according to claim 1, the method further comprising computing, by the computer, an intensity I of the radioactive source as soon as a radioactive source is determined to have moved in front of the detectors, such that:
4. The method according to claim 1, further comprising smoothing the pulse counting values before computing.
5. A device for detecting a radioactive source moving over a substantially linear path, the device comprising: N detectors (D.sub.i, i=1, 2, . . . , N) substantially aligned parallel to the linear path of the radioactive source, N being an integer equal to or greater than 2, the N detectors simultaneously delivering N detection signals over duration Δt, N processing circuits (T.sub.i, i=1, 2, . . . , N) connected to the N detectors, each processing circuit being configured to deliver an electronic signal corresponding to a detection signal delivered by a different detector, N counting circuits (K.sub.i, i=1, 2, . . . , N) connected to the N processing circuits, each counting circuit being configured to count, during N.sub.t successive counting durations Δt, a number of electronic pulses delivered by a different processing circuit and to deliver, for each counting duration Δt, a pulse counting value (M.sub.i,t) (t=1, 2, . . . , N.sub.t), N.sub.t being significantly greater than N, a memory block (B) that stores the N×N.sub.t pulse counting values delivered by the N counting circuits during the N.sub.t successive counting durations, a computer configured to compute: a set of N.sub.R correlation products R.sub.z so that:
R.sub.z=Π.sub.i=1.sup.NM.sub.i,([N−i)z+1] (z=1,2, . . . , N.sub.R) with N.sub.R being an integer equal to
6. The device according to claim 5, the computer being further configured to compute a source speed V if R.sub.z≧
V=d/(T×Δt), where d is a distance separating two neighbouring detectors and T is a rank t of a set of N pulse counting values for which the correlation product R.sub.Z is maximum.
7. The device according to claim 5, the computer being further configured to compute a source intensity I if R.sub.z≧
Description
BRIEF DESCRIPTION OF THE FIGURES
(1) Other features and advantages of the invention will appear upon reading the following description, made in reference to the appended figures, among which:
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
DISCLOSURE OF PARTICULAR EMBODIMENTS OF THE INVENTION
(11)
(12) The radioactive source S which is wanted to be detected moves in principle over a linear path TL (road/conveyor/etc.). The N detectors D.sub.1, D.sub.2, . . . , D.sub.i, . . . , D.sub.N of the detection device are aligned parallel to the path TL. A distance d separates two neighbouring detectors and a distance D separates each detector D.sub.i (i=1, 2, . . . N) from the path TL.
(13)
(14) The device comprises N detectors D.sub.i (i=1, 2, . . . , N), N processing circuits T.sub.i, N pulse counting circuits K.sub.i, a memory block B made of N FIFO memories M.sub.i (FIFO stands for “First In First Out”), and a computer C.
(15) Each detector D.sub.i (i=1, 2, . . . , N) which detects an incident radiation delivers a pulse signal. The pulse signal delivered by the detector D.sub.i is then processed by a processing circuit T.sub.i, the latter comprising, for example, an amplifier A.sub.i and a filtering circuit F.sub.i. Each processing circuit T.sub.i delivers an electronic pulse. The electronic pulses delivered by a processing circuit T.sub.i are counted by a counting circuit K.sub.i. Counting the electronic pulses is made by successive time slots of a duration Δt. The counting values which are delivered by the counter K.sub.i are transmitted to the FIFO memory M.sub.i. A FIFO memory M.sub.i consequently contains a succession of counting values M.sub.i,1, M.sub.i,2, . . . M.sub.i,t, etc., where t is the time position index of the counting values in the history of the FIFO memories.
(16) According to the known principle which governs the FIFO memories, as soon as a FIFO memory is full, the oldest counting value which is stored in the memory is extracted to enable a new counting value to be stored. The counting values which are simultaneously extracted from different memories M.sub.i are then transmitted to the computer C. In a particular embodiment of the invention (not shown in the figure), the counting values are smoothed by a smoothing circuit before being transmitted to the FIFO memory.
(17) The computer C implements a method for processing counting values M.sub.i,t.
(18) In a first step (step 1), the computer C computes N.sub.R correlation products R.sub.Z (z=1, 2, . . . , N.sub.R) such that:
(19) R.sub.ZΠ.sub.i=1.sup.NM.sub.[i,(N−i)z+1]+, with
(20)
N.sub.t being a very large integer ahead of N.
(21) The statistical mean
(22)
(23) Next, the standard deviation σ(
(24)
(25) Once the standard deviation is computed, it is verified whether there is a significant correlation of the time series among the R.sub.t values (step 4). It is thus verified whether the following inequation is performed or not:
R.sub.z≧
(26) where the magnitude K.sub.2 is a scalar chosen with respect to the false alarm rate desired for detection. The order of magnitude of K.sub.2 is a few units.
(27) If the above inequation is not performed, no source is considered to have moved in front of the detectors (step 5: no source).
(28) If the above inequation is performed, a source is considered to have moved in front of the detectors and its speed V and/or its intensity I (number of hits per second) are computed (step 6).
(29) Among the R.sub.t values, there is an R.sub.t value which is maximum. Letting T be the rank t for which the R.sub.t value is maximum, we therefore have:
V=d/(T×Δt),
(30) where d is the distance separating two neighbouring detectors, and
(31)
(32) As soon as the steps 5 and 6 are carried out, a new computing cycle is started (back to step 1).
(33)
(34) The results illustrated in
(35)
τ=t×Δt
(36)
v=d/t×Δt
(37) It can be noticed that the correlation product clearly shows a peak P at a speed substantially equal to 5 m/s.
(38)
(39)
(40)
(41)
(42)
(43)
(44)