A method implemented by computer means for estimating interference on a radiofrequency system using a set of channels (CHi), said interference being caused by interferers of an interfering system using a set of I transmission bands (TBi), each of said transmission band extending on a plurality of contiguous channels of said set of channels, Wherein the method comprises: - Determining a set Ω of all N possible configurations of occupation or non-occupation of said set of transmission bands, defined as a set of possible vectors Z k = [ Z 1, k,..., Z i,k,... Z I, k], where Z i,k is a random variable stating if interference is active on an i-th channel among the set of I channels, at a time instant k, - Building a matrix A from a stacking of all the possible vectors Z k, - Obtaining measurements X 1, X k,..., X K of occupation of at least a part of said set of channels, at respective time instants k: 0 < k ≤ K, where K defines a given observation time window, - Computing probabilities defined as: ∀ k, ∀z j ∈ Ω, P (X k |Z k = z j), where P ( X|Z) defines a channel transition function, so as to determine, for each transmission band, an estimated activation rate τ i, on the basis of said measurements X 1,..., X k,..., X K, said estimated activation rate τ i corresponding to an activation rate of a transmission band i by an interferer within said given observation time window, And wherein said probabilities computations iteratively comprise, at each iteration t: * determining a hidden variable vector θ by resolving a non-linear optimization problem with a constraint defined so as to: maximize ∑ k ∑ j = 1 N P X k | Z k = z j θ j ∑ l = 1 N P X k | Z k = z l θ l log 1 K ∑ k ′ P X k ′ | Z k ′ = z j ∑ l = 1 N P X k ′ | Z k ′ = z l θ l subject to ∑ j = 1 N θ j = 1 Aθ = τ ( t) ∀ j, 0 ≤ θ j ≤ 1 where vector τ ( t) is a column of activation rates τ i in respective transmission bands i estimated at an iteration index t, * computing a vector φ = [ φ 1,..., φ N] as a hidden variable such as: φ j = 1 K ∑ k P X k | Z k = z j θ j ∑ l = 1 N P X k | Z k = z l θ l * and updating the vector of the activation rates for a next iteration index t+1, as τ t + 1 = A φ - Determining a set Ω of all N possible configurations of occupation or non-occupation of said set of transmission bands, defined as a set of possible vectors Z k = [ Z 1, k,..., Z i,k,... Z I, k], where Z i,k is a random variable stating if interference is active on an i-th channel among the set of I channels, at a time instant k, - Building a matrix A from a stacking of all the possible vectors Z k, - Obtaining measurements X 1, X k,..., X K of occupation of at least a part of said set of channels, at respective time instants k: 0 < k ≤ K, where K defines a given observation time window, - Computing probabilities defined as: ∀ k, ∀z j ∈ Ω, P (X k |Z k = z j), where P ( X|Z) defines a channel transition function, so as to determine, for each transmission band, an estimated activation rate τ i, on the basis of said measurements X 1,..., X k,..., X K, said estimated activation rate τ i corresponding to an activation rate of a transmission band i by an interferer within said given observation time window, - Computing probabilities defined as: ∀ k, ∀z j ∈ Ω, P (X k |Z k = z j), where P ( X|Z) defines a channel transition function, so as to determine, for each transmission band, an estimated activation rate τ i, on the basis of said measurements X 1,..., X k,..., X K, said estimated activation rate τ i corresponding to an activation rate of a transmission band i by an interferer within said given observation time window, * determining a hidden variable vector θ by resolving a non-linear optimization problem with a constraint defined so as to: maximize ∑ k ∑ j = 1 N P X k | Z k = z j θ j ∑ l = 1 N P X k | Z k = z l θ l log 1 K ∑ k ′ P X k ′ | Z k ′ = z j ∑ l = 1 N P X k ′ | Z k ′ = z l θ l subject to ∑ j = 1 N θ j = 1 Aθ = τ ( t) ∀ j, 0 ≤ θ j ≤ 1 where vector τ ( t) is a column of activation rates τ i in respective transmission bands i estimated at an iteration index t, * computing a vector φ = [ φ 1,..., φ N] as a hidden variable such as: φ j = 1 K ∑ k P X k | Z k = z j θ j ∑ l = 1 N P X k | Z k = z l θ l * and updating the vector of the activation rates for a next iteration index t+1, as τ t + 1 = A φ