DocumentCode
1811743
Title
Quick Recognition and Relative Minimum Distances Filtering Assisted Recognition Based on Noisy-robust Rough Set
Author
Yingchun, Li ; Shibing, Zhu ; Sheng, Yang
Author_Institution
Acad. of Equip. Command & Technol., Beijing, China
fYear
2010
fDate
24-25 July 2010
Firstpage
73
Lastpage
77
Abstract
With the development of rough set theory and it´s strengths and weaknesses in the recognition field, the rule and recognition fusing method of noisy-robust rough set (NRRS) are proposed based on full normalized deposal, the non-uniform companding and simple dynamic clustering coding. The robustness of NRRS is improved by weighted reliability during training and recognition to dispose the accidental samples and conflict samples. At the same time, this paper gives the quick recognition and relative minimum distances between classes filtering assisted recognition algorithm based on NRRS. The recognition simulation shows that the method has a good anti-noise performance, processing efficiency and recognition effect.
Keywords
pattern recognition; rough set theory; filtering assisted recognition; noisy-robust rough set; quick recognition; recognition field; relative minimum distance filtering; rough set theory; weighted reliability; Encoding; Filtering; Image recognition; Pattern recognition; Qualifications; Reliability; Training; accidental sample; conflict sample; noisy-robust rough set (NRRS); quick recognition; relative minimum distances between classes; reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology and Computer Science (ITCS), 2010 Second International Conference on
Conference_Location
Kiev
Print_ISBN
978-1-4244-7293-2
Electronic_ISBN
978-1-4244-7294-9
Type
conf
DOI
10.1109/ITCS.2010.24
Filename
5557328
Link To Document