A b-coloring of a graph $G$ is a proper vertex coloring where each color class contains at least one vertex (a b-vertex) adjacent to a vertex in every other color class. The maximum number of colors in such a coloring is the b-chromatic number, ${\rm b}(G)$. A ${\rm b}^{\ast}$-coloring is a variation in which a b-vertex is adjacent to a b-vertex in every other color class. We employ the ${\rm b}^{\ast}$-coloring to prove that any $n$-vertex graph $G$ with independence number at most $t$ satisfies ${\rm b}(G) \leq [(t-1)n+tχ(G)]/(2t-1)$. This bound extends the bounds of Kouider and Zaker (2006) and Alkhateeb and Kohl (2011) and improves the bound in terms of the clique partition number. We show that this bound is sharp for all $t\geq 2$ and $χ(G)\geq 3$. Furthermore, we provide a refined bound based on the maximum number of vertex-disjoint independent sets of size $t$. Finally, we prove ${\rm b}^{\ast}(G) \leq [(t-2)n+(t-1)χ(G)]/(2t-3)$ for all $K_{1,t}$-free graphs $G$, a significant improvement over the analogous bound for ${\rm b}(G)$.