On the automorphism group of a matroid

For a graphic matroid, we can produce a group of edge permutations that preserve independent sets. We call this group the automorphism group of our matroid. For 3-connected graphs, this automorphism group is the same as the graph automorphism group (which permutes vertices). We give several results about which groups can arise in such a way as well as some examples.