A computational method, based on l1-norm minimization, is proposed for the problem traffic flow correction. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corruptions accurately if there are only a few bad sensors which are located at certain links by the proposed method. We mathematically quantify these links that are robust to miscounts and relate them to the geometric structure of the traffic network. In a more realistic setting, besides the unhealthy link sensors, if small measure noise are present at the other sensors, our method guarantees to give an estimated traffic flow fairly close to the ground-truth. Both toy and real-world examples are provided to demonstrate the effectiveness of the proposed method.