Generate Possion dis.
step1:Generate a random number between [0,1]
step2:Let u=F(x)=1-[(1/e)x]
step3:Slove x=1/F(u)
step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn
step5:If the first packet was generated at time [0], than the
second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2],
and so on ….
Random-number generation
1.static method random from class Math
-Returns doubles in the range 0.0 <= x < 1.0
2.class Random from package java.util
-Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values
-Is seeded with the current time of day to generate different sequences of numbers each time the program executes
標簽：
Generate
Possion
between
random
上傳時間：
2017-05-25
上傳用戶：bibirnovis
A general technique for the recovery of signi cant
image features is presented. The technique is based on
the mean shift algorithm, a simple nonparametric pro-
cedure for estimating density gradients. Drawbacks of
the current methods (including robust clustering) are
avoided. Feature space of any nature can be processed,
and as an example, color image segmentation is dis-
cussed. The segmentation is completely autonomous,
only its class is chosen by the user. Thus, the same
program can produce a high quality edge image, or pro-
vide, by extracting all the signi cant colors, a prepro-
cessor for content-based query systems. A 512 512
color image is analyzed in less than 10 seconds on a
standard workstation. Gray level images are handled
as color images having only the lightness coordinate
標簽：
technique
presented
features
recovery
上傳時間：
2015-10-14
上傳用戶：410805624
