In structured system theory, a pattern matrix is a matrix with entries either fixed to zero or free to take arbitrary numbers. The (generic) rank of a pattern matrix is the rank of almost all its realizations. The resilience of various system properties is closely tied to the rank resilience of the corresponding pattern matrices. Yet, existing literature predominantly explores the latter aspect by focusing on perturbations that change the zero-nonzero structure of pattern matrices, corresponding to link additions/deletions. In this paper, we consider the rank resilience of pattern matrices against structured perturbations that can arbitrarily alter the values of a prescribed set of entries, corresponding to link weight variations. We say a pattern matrix is structurally rank $r$ resilient against a perturbation pattern if almost all realizations of this pattern matrix have a rank not less than $r$ under arbitrary complex-valued realizations of the perturbation pattern. We establish a generic property in this concept. We then present combinatorial necessary and sufficient conditions for a rectangular pattern matrix to lose full rank under given perturbation patterns. We also generalize them to obtain a sufficient condition and a necessary one for losing an arbitrarily prescribed rank. We finally show our results can be applied to the resilience analysis of various properties of structured (descriptor) systems, including controllability and input-state observability, as well as characterizing zero structurally fixed modes.