Suppose $$\text{Im}(A) = \text{span}\{\begin{bmatrix} 0 \\ 1 \\ 0 \\ 1 \end{bmatrix} , \begin{bmatrix} 1 \\ 0 \\ 1\\ 0 \end{bmatrix} \}$$
How would you go about turning this very set into a linear equality constraint of the form: $$\text{Im}(A) = \{x \in \mathbb{R}^4 | Gx = 0\}$$
In other words, how do you find the $G$?
First your system of vectors obviously has rank $2$. In $\mathbf R^4$, their span requires $4-2=2$ linearly independent equations.
Although one may guess the system of equations, due to the very simple of vectors, I'll show the general method; the vector $u=\begin{bmatrix}x\\y\\z\\t\end{bmatrix}$ lies inthe span of $e_1=\begin{bmatrix}0\\1\\0\\1\end{bmatrix}$ and $e_2=\begin{bmatrix}1\\0\\1\\0\end{bmatrix}$ if and only if the system of equations in $\lambda,\mu$: $$u=\lambda e_1+\mu e_2 $$ has a solution. Let's solve this system by Gauß's pivot method applied to the bordered matrix: $$\begin{bmatrix}0&1&x\\1&0&y\\0&1&z\\1&0&t\end{bmatrix}\rightsquigarrow\begin{bmatrix}1&0&y\\0&1&x\\0&1&z\\1&0&t\end{bmatrix}\rightsquigarrow\begin{bmatrix}1&0&y\\0&1&x\\0&0&z-x\\0&0&t-y\end{bmatrix}$$ (we first swapped row 1 and row 2, then substracted row1 from row 3, and row 3 from row 4). Hence the consistency conditions to have a solution are $$\begin{cases} x-z=0,\\y-t=0. \end{cases}$$