Covering is a common form of data representation, and covering-based rough sets, a technique of granular computing, provide an effective tool to deal with this type of data. However, many important problems of covering-based rough sets, such as covering reduction, are NP-hard so that most algorithms to solve them are greedy ones. Matroid theory, based on linear algebra and graph theory, provides well-established platforms for greedy algorithms. Lattice has been widely used in diverse fields, especially algorithm design, which plays an important role in covering reduction. Therefore, it is necessary to integrate covering-based rough sets with matroid and lattice. In this paper, we construct three types of matroids through covering-based rough sets and investigate their modularity. Moreover, we investigate some characteristics of these types of closed-set lattices induced by these three types of matroids and the relationships among these closed-set lattices. First, based on covering-based rough sets, three families of sets are constructed and proved to satisfy independent set axiom of matroids. So three types of matroids are induced by covering-based rough sets in this way. Second, some characteristics of these matroids, such as rank function, closure operator and closed set, are presented. Moreover, we investigate the characteristics of these closed-set lattices induced by these three types of matroids, such as modular pair, modular element. Finally, the relationships among these closed-set lattices induced by these three types of matroids are investigated. Especially, we prove that these three types of matroids induced by covering-based rough sets are all modular matroids.