This paper presents a comparison in terms of accuracy and complexity between two approaches used for state estimation of linear systems: a classic Kalman filter and a guaranteed set-membership state estimation technique. The main goal of this paper is to analyze the advantages of these techniques and to combine them in the future in a new accurate and simple extension that handles system uncertainties and chance constraints. Two academic examples illustrate the main differences between the compared techniques.