Abstract
A novel algorithm, which can be used to resolve the problem that how to use the least vectors in vector space, expresses the known vector, was proposed in this paper. Compared with MP (matching pursuit) algorithm, the new algorithm has less errors and more exactly than MP algorithm of the lower dimension. By this novel algorithm, the vectors was cut off first, so it can be expressed by simple vector, and then extended these vectors. The novel algorithm is better than MP algorithm, for MP algorithm just closed infinitely, and cannot be exactly to express the known vector.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
