The analogue of Hadwiger's conjecture for the immersion order states that every graph $G$ contains $K_{χ(G)}$ as an immersion. If true, it would imply that every graph with $n$ vertices and independence number $α$ contains $K_{\lceil \frac nα\rceil}$ as an immersion. The best currently known bound for this conjecture is due to Gauthier, Le and Wollan, who recently proved that every graph $G$ contains an immersion of a clique on $\bigl\lceil \frac{χ(G)-4}{3.54}\bigr\rceil$ vertices. Their result implies that every $n$-vertex graph with independence number $α$ contains an immersion of a clique on $\bigl\lceil \frac{n}{3.54α}-1.13\bigr\rceil$ vertices. We improve on this result for all $α\ge 3$, by showing that every $n$-vertex graph with independence number $α\ge 3$ contains an immersion of a clique on $\bigl\lfloor \frac {n}{2.25 α- f(α)} \bigr\rfloor - 1$ vertices, where $f$ is a nonnegative function.