In experimental tests, besides data in range of allowable error, the experimenters usually get some unexpected wrong data called bad points. In usual experimental data processing, the method of bad points exclusion ba...In experimental tests, besides data in range of allowable error, the experimenters usually get some unexpected wrong data called bad points. In usual experimental data processing, the method of bad points exclusion based on automatic programming is seldom taken into consideration by researchers. This paper presents a new method to reject bad points based on Hough transform, which is modified to save computational and memory consumptions. It is fit for linear data processing and can be extended to process data that is possible to be transformed into and from linear form; curved lines, which can be effectively detected by Hough transform. In this paper, the premise is the distribution of data, such as linear distribution and exponential distribution, is predetermined. Steps of the algorithm start from searching for an approximate curve line that minimizes the sum of parameters of data points. The data points, whose parameters are above a self-adapting threshold, will be deleted. Simulation experiments have manifested that the method proposed in this paper performs efficiently and robustly.展开更多
文摘In experimental tests, besides data in range of allowable error, the experimenters usually get some unexpected wrong data called bad points. In usual experimental data processing, the method of bad points exclusion based on automatic programming is seldom taken into consideration by researchers. This paper presents a new method to reject bad points based on Hough transform, which is modified to save computational and memory consumptions. It is fit for linear data processing and can be extended to process data that is possible to be transformed into and from linear form; curved lines, which can be effectively detected by Hough transform. In this paper, the premise is the distribution of data, such as linear distribution and exponential distribution, is predetermined. Steps of the algorithm start from searching for an approximate curve line that minimizes the sum of parameters of data points. The data points, whose parameters are above a self-adapting threshold, will be deleted. Simulation experiments have manifested that the method proposed in this paper performs efficiently and robustly.
