当前位置:网站首页>RFs self study notes (III): clutter model - first determine the number with Poisson distribution, and then use uniform distribution as probability distribution
RFs self study notes (III): clutter model - first determine the number with Poisson distribution, and then use uniform distribution as probability distribution
2022-07-28 19:16:00 【Learn something】
The clutter model is derived from the binomial distribution , namely n n n Heavy Bernoulli distribution , When n n n As we go to infinity , At this time, it can be approximated as Poisson distribution C n i p i ( 1 − p ) n − i = λ i e − λ i ! C_n^ip^i(1-p)^{n-i}=\frac{\lambda^ie^{-\lambda}}{i!} Cnipi(1−p)n−i=i!λie−λ
among , n n n Indicates the total number , i i i Indicates the number of successes , p p p Represents the probability of success in Bernoulli distribution , λ \lambda λ It's Poisson's ratio
Number of clutter points
Suppose the field of vision is a two-dimensional plane , Clutter and objects will appear in this two-dimensional plane , Let the area of this two-dimensional plane, that is, the field of view, be V V V, Now I want to know how many clutter will appear at a certain time , How to estimate the number of clutter ?
At first glance, there are few conditions for this problem , What we should be able to think of is : If the number of clutter and the distribution of clutter itself can conform to some probability distribution models we have learned , For example, binomial distribution 、 Poisson distribution 、 Exponential distribution and so on , Because in this way, it is easier for us to estimate —— Abstract and simplify the problem into the probability model we have learned, so as to establish equations to complete the estimation task , This is the process of modeling ? therefore , Many of the algorithms we learn are nothing more than a process of modeling , It is a great test of basic math skills .
For this question , Let's model it like this : View area V V V Divide evenly into n n n A small square , There is either a clutter in each small square , Or there is no clutter , That is, in a single small square , The number of clutter conforms to Bernoulli distribution , The clutter itself conforms to the uniform distribution within this square
( C n t 1 0 P p c 1 − p c ) \begin{pmatrix} Cnt& 1& 0\\ P&p^c &1-p^c \end{pmatrix} (CntP1pc01−pc)
among , C n t Cnt Cnt Represents the number of clutter in a small square , The value can only be 1 or 0,P Represents the probability value corresponding to their respective values : p c p^c pc Indicates the probability of success, that is, the probability of a clutter in a small square is p c p^c pc
There is a Bernoulli distribution in each small square , Then the whole field of vision n n n The distribution composed of three small squares is n n n The heavy Bernoulli distribution is the binomial distribution , Using the formula of binomial distribution, we can calculate : When the number of clutter is i i i The probability value corresponding to each hour is the probability that the number of clutter in the field of vision is i i i individual P ( ∣ C k ∣ = i ) = C n i ( p c ) i ( 1 − p c ) n − i P(|C_k|=i)=C_n^i(p^c)^i(1-p^c)^{n-i} P(∣Ck∣=i)=Cni(pc)i(1−pc)n−i among , C k C_k Ck Represents the clutter variable , It's a collection , contain k k k All clutter points at the moment , C k = [ C k 1 , C k 2 , . . . , C k m ] C_k=[C_k^1,C_k^2,...,C_k^m] Ck=[Ck1,Ck2,...,Ckm]. ∣ C k ∣ |C_k| ∣Ck∣ The potential of this set is the number of clutter points
When the field of vision V V V When the division is very fine, that is n → ∞ n\to\infty n→∞ when , Binomial distribution becomes Poisson distribution . in other words , The number of clutter in the whole field of view obeys Poisson distribution , Set variables m k c = ∣ C k ∣ m_k^c=|C_k| mkc=∣Ck∣, It represents the number of clutter , be m k c m_k^c mkc Obey Poisson distribution m k c ∼ P o ( λ c ) m_k^c\sim Po(\lambda_c) mkc∼Po(λc) among , λ c \lambda_c λc It's Poisson's ratio , We need to decide by ourselves
Observe the calculation formula of binomial distribution : p c p^c pc and n n n It is a parameter that needs to be determined by ourselves , among , n n n It reflects the fineness of our division , p c p^c pc It reflects the possibility or intensity of clutter —— The number of times clutter appears in a small square in unit time . And the product of the two n p c np^c npc It represents the clutter intensity in the whole field of view —— The number of times clutter appears in the whole field of view in unit time . It should be noted that : The mean value of binomial distribution happens to be n p c np^c npc, It means , We can get the number of clutter per unit time in the field of vision by statistical means , And you get n p c np^c npc Value .
Observe the calculation formula of Poisson distribution : Average strength λ c \lambda_c λc It is a parameter that needs to be determined by ourselves . actually , λ c = n p c \lambda_c =np^c λc=npc, It is consistent with binomial distribution , Including the meaning is the same .
Sum up : We have completed the number of clutter m k c m_k^c mkc Obey Poisson distribution P o ( λ c ) Po(\lambda_c) Po(λc), Poisson's ratio λ c \lambda_c λc You need to be sure . In this way, the number of clutter in the field of vision at a certain time can be estimated .
Specific distribution
Up to now , We just get the model of the number of clutter, that is, we just know how many clutter will appear at a certain time , however , What we finally need to know is the distribution characteristics of these clutter points , So that we can distinguish clutter points from real object points . therefore , Next, we need to solve the probability distribution of clutter .
Here we think that the clutter points themselves obey the uniform distribution in the field of view —— The probability of clutter points appearing anywhere in the field of vision is the same C k i ∼ u n i f ( V ) = f c ( c ) λ ( c ) = { λ c ∈ V 0 o t h e r s C_k^i\sim unif(V)=f_c(c)\\\lambda(c)=\left\{\begin{matrix} \lambda &c\in V \\ 0&others \end{matrix}\right. Cki∼unif(V)=fc(c)λ(c)={ λ0c∈Vothers among , C k i C_k^i Cki It means k k k At the moment i i i Clutter points , λ \lambda λ It represents the intensity of the whole field of view ( Because it reflects the number , So general λ \lambda λ>0) Not a probability distribution , It mainly corresponds to the Poisson distribution, which corresponds to the estimated number of clutter . If it is used to represent the probability distribution of clutter points , It needs to be transformed into a form of uniform distribution, that is, the next standardization .
in addition λ c = ∫ λ ( c ) d c f c ( c ) = λ ( c ) λ c = { 1 V c ∈ V 0 o t h e r s \lambda_c=\int\lambda(c)dc\\f_c(c)=\frac{\lambda(c)}{\lambda_c}=\left\{\begin{matrix} \frac{1}{V}&c\in V \\ 0&others \end{matrix}\right. λc=∫λ(c)dcfc(c)=λcλ(c)={ V10c∈Vothers
This is to standardize it : d c dc dc Integral actually means traversing the entire field of view , If the intensity of each position in the field of vision is the same, that is λ ( c ) = c o n s t a n \lambda(c)=constan λ(c)=constan Is constant , Then this can be simply expressed as λ c = λ ( c ) V \lambda_c=\lambda(c)V λc=λ(c)V That is, the strength is multiplied by the area , The average intensity over the whole field of view is obtained —— λ c \lambda_c λc It represents the average intensity of the visual field , λ ( c ) \lambda(c) λ(c) It represents the strength at a certain position ( When the intensity of each position point is not exactly equal ). The reason why it is written in the form of integral is that the strength at each position may not be the same , λ ( c ) d c \lambda(c)dc λ(c)dc Represents the number of clutter on a small square , Taking the integral again means : Add up the clutter number of all squares to get the average clutter number, that is, the average intensity . And yes λ ( c ) \lambda(c) λ(c) After standardization, we get f c ( c ) f_c(c) fc(c), It represents the probability distribution of clutter points —— It was λ ( c ) \lambda(c) λ(c) Represents the distribution of a clutter point , But because it involves the whole field of vision, that is, the unified relationship of many clutter points , To ensure that the probability integral is 1, Therefore, the original distribution needs to be standardized to ensure that the final full integration result is 1.
for instance : set up V = 4 , n = 4 , λ ( c ) = 2 V=4,n=4,\lambda(c)=2 V=4,n=4,λ(c)=2, Then the area of the small square divided is v = V / n = 1 v=V/n=1 v=V/n=1, The average number of clutter on the small square is v λ ( c ) = 2 v\lambda(c)=2 vλ(c)=2, Then the expectation of the number of clutter in the whole field of vision is λ c = ∫ λ ( c ) d c = V λ ( c ) = 8 \lambda_c=\int\lambda(c)dc=V\lambda(c)=8 λc=∫λ(c)dc=Vλ(c)=8.
Before standardization 1 The distribution of clutter points on the small square No. is λ ( c ) 1 = { 2 c ∈ v 1 0 o t h e r s \lambda(c)_1=\left\{\begin{matrix} 2&c\in v_1 \\ 0& others \end{matrix}\right. λ(c)1={ 20c∈v1others It means that v 1 v_1 v1 In the area , The number of clutter per unit area per unit time is 2 individual ?. Here we think that the intensity of the four small squares is the same , therefore λ ( c ) 1 , λ ( c ) 2 , λ ( c ) 3 , \lambda(c)_1,\lambda(c)_2,\lambda(c)_3, λ(c)1,λ(c)2,λ(c)3, λ ( c ) 4 \lambda(c)_4 λ(c)4 The value of is the same , It's just that the targeted areas are different .
After standardization 1 The distribution of clutter points on the small square No. is f c ( c ) 1 = { 2 λ c = 1 4 c ∈ v 1 0 o t h e r s f_c(c)_1=\left\{\begin{matrix} \frac{2}{\lambda_c}=\frac{1}{4}&c\in v_1 \\ 0& others \end{matrix}\right. fc(c)1={ λc2=410c∈v1others This means 1 The strength of the small square λ ( c ) 1 \lambda(c)_1 λ(c)1 In overall strength λ c \lambda_c λc The proportion of the , It can reflect how big the clutter points may come from 1 Small square No ? Because the intensity of the four small squares is the same , That is to say, for an existing clutter point , It is possible that it comes from any position in the field of vision —— Uniform distribution , therefore f c ( c ) 1 = f c ( c ) 2 = f c ( c ) 3 = f c ( c ) 4 = { 2 λ c = 1 4 = 1 V c ∈ V 0 o t h e r s f_c(c)_1=f_c(c)_2=f_c(c)_3=f_c(c)_4\\=\left\{\begin{matrix} \frac{2}{\lambda_c}=\frac{1}{4}=\frac{1}{V}&c\in V \\ 0& others \end{matrix}\right. fc(c)1=fc(c)2=fc(c)3=fc(c)4={ λc2=41=V10c∈Vothers
It seems that the understanding of standardization is not very good , Let's add later . The question is : clarify λ c , λ ( c ) , V , v , f c ( ) \lambda_c,\lambda(c),V,v,f_c() λc,λ(c),V,v,fc() The relationship between ?
The solution of clutter probability distribution is divided into two steps ( Here we need to review the knowledge of classical probability and joint probability distribution ):
1. Determine the number of clutter points according to Poisson distribution —— When estimating the number, it corresponds to a probability value
2. Calculate the corresponding probability value of each clutter point , Then tired ride
P ( C k ) = P ( C k , m k c ) = P ( m k c ) P ( C k ∣ m k c ) = P o ( m k c ; λ c ) ∏ i = 1 m k c f c ( c k i ) = e − λ c m k c ! ∏ i = 1 m k c λ ( c k i ) P(C_k)=P(C_k,m_k^c)=P(m_k^c)P(C_k|m_k^c)\\= Po(m_k^c;\lambda_c)\prod_{i=1}^{m_k^c}f_c(c_k^i)=\frac{e^{-\lambda_c}}{m_k^c!}\prod_{i=1}^{m_k^c}\lambda(c_k^i) P(Ck)=P(Ck,mkc)=P(mkc)P(Ck∣mkc)=Po(mkc;λc)i=1∏mkcfc(cki)=mkc!e−λci=1∏mkcλ(cki)
What did we finally get ?
The question is : Explain this formula with the relationship between events ?
The sorting of clutter model comes here first , There are still some places that are not clear enough , We need to take a closer look , I'll add later
边栏推荐
- QT & OpenGL lighting
- Open source database innovation in the era of digital economy | the 2022 open atom global open source summit database sub forum was successfully held
- New progress in the implementation of the industry | the openatom openharmony sub forum of the 2022 open atom global open source summit was successfully held
- 关于ASM冗余问题
- Is software testing really as good as online?
- [filter tracking] target tracking based on EKF, TDOA and frequency difference positioning with matlab code
- ECS 5 workflow
- When the new version of easycvr is linked at the same level, the subordinate platform passes up the cause analysis of the incomplete display of the hierarchical directory
- Decimal to binary advanced version (can convert negative numbers and boundary values)
- Wechat solves the problem of long press selected style
猜你喜欢

Win11怎么调亮度?Win11调屏幕亮度的四种方法

Today in history: Microsoft acquires qdos; Model testing pioneer birth; The first laser typesetting Chinese newspaper

The login interface of modern personal blog system modstartblog v5.4.0 has been revised and the contact information has been added

Introduction and advanced MySQL (III)

DevCon. Exe export output to the specified file

MES生产管理系统对设备的应用价值

Qt: one signal binds multiple slots

Why did wechat change from "small and beautiful" to "big and fat" when it expanded 575 times in 11 years?
![[radar] radar signal online sorting based on kernel clustering with matlab code](/img/56/1f8e8690b47fc4a1f101d4e530b87f.png)
[radar] radar signal online sorting based on kernel clustering with matlab code

6-20 vulnerability exploitation proftpd test
随机推荐
MES生产管理系统对设备的应用价值
Introduction and advanced level of MySQL (I)
Pytest custom hook function
Three minutes to understand, come to new media
Four years later, Debian finally recaptured the "debian.community" domain name!
C language (high-level) character function and string function + Exercise
Qt: 一个SIGNAL绑定多个SLOT
SQL custom automatic calculation
[data analysis] realize SVDD decision boundary visualization based on MATLAB
直播平台软件开发,js实现按照首字母排序
How to obtain data on mobile phones and web pages after the SCM data is uploaded to Alibaba cloud Internet of things platform?
How does the mqtt server built with emqx forward data and save it to the cloud database?
2022 Niuke multi School Game 2 J. link with arithmetic progress (three points + enumeration)
“讳疾忌医”的开源走不远
2022杭电多校第二场1011 DOS Card(线段树)
Getting started with QT & OpenGL
BM14 链表的奇偶重排
What is the future of software testing? How to learn?
BM16 删除有序链表中重复的元素-II
Parity rearrangement of Bm14 linked list