本文的方法以图像分割之后的区域为匹配基元，灰度相差较大的前景和背景区域分割之后将归属于不同区域，所以能较好的解决该问题。
After divided, the foreground and background regions which have biggish gray difference will belong to different regions, therefore the method can solve the problem mentioned before.
基元抽取问题可以归结为优化问题，即寻找代价函数的全局最小值。
This program can be treated as an optimum program, that is to find the optimum value of a cost function.
同时，通过提高基元的结构化程度，并利用有效的检索手段，解决了搜索空间过大的问题。
Moreover, the question concerning a too large searching space is solved by upgrading the primitives' configuration degree and by means of effective indexing.
应用推荐