Abstract : Assume that Y is a noisy version of a point set X in convex position. How many vertices does the convex hull of Y have, that is, what is the number of extreme points of Y? We consider the case where X is an (epsilon,kappa)-sample of a sphere in Rd and the noise is random and uniform: Y is obtained by replacing each point x in X by a point chosen uniformly at random in some region R(x) of size delta around x. We give upper and lower bounds on the expected number of extreme points in Y when R(x) is a ball (in arbitrary dimension) or an axis-parallel square (in the plane). Our bounds depend on the size n of X and $\delta$, and are tight up to a polylogarithmic factor. These results naturally extend in various directions (more general point sets, other regions R(x)...). We also present experimental results, showing that our bounds for random noise provide good estimators of the behavior of snap-rounding, that is when Y is obtained by rounding each point of X to the nearest point on a grid of step delta.