In this paper, a definition of perfect binary matroids is considered and it is shown that, analogous to the Perfect Graph Theorem of Lovász and Fulkerson, the complement of a perfect matroid is also a perfect matroid. In addition, the classes of critically imperfect graphic matroids and critically imperfect graphs are compared.