A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. F...A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.展开更多
Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a ...Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.展开更多
Control parameter optimization is an efficient way to improve the endurance of underwater gliders(UGs),which influences their gliding efficiency and energy consumption.This paper analyzes the optimal matching between ...Control parameter optimization is an efficient way to improve the endurance of underwater gliders(UGs),which influences their gliding efficiency and energy consumption.This paper analyzes the optimal matching between the net buoyancy and the pitching angle and proposes a segmented control strategy of Petrel-L.The optimization of this strategy is established based on the gliding range model of UG,which is solved based on the approximate model,and the variations of the optimal control parameters with the hotel load are obtained.The optimization results indicate that the segmented control strategy can significantly increase the gliding range when the optimal matching between the net buoyancy and the pitching angle is reached,and the increase rate is influenced by the hotel load.The gliding range of the underwater glider can be increased by 10.47%at a hotel load of 0.5 W.The optimal matching analysis adopted in this study can be applied to other UGs to realize endurance improvement.展开更多
In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type f...In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type fixed point theorem are obtained.展开更多
As historical Chinese calligraphy works are being digitized, the problem of retrieval becomes a new challenge. But, currently no OCR technique can convert calligraphy character images into text, nor can the existing H...As historical Chinese calligraphy works are being digitized, the problem of retrieval becomes a new challenge. But, currently no OCR technique can convert calligraphy character images into text, nor can the existing Handwriting Character Recognition approach does not work for it. This paper proposes a novel approach to efficiently retrieving Chinese calligraphy characters on the basis of similarity： calligraphy character image is represented by a collection of discriminative features, and high retrieval speed with reasonable effectiveness is achieved. First, calligraphy characters that have no possibility similar to the query are filtered out step by step by comparing the character complexity, stroke density and stroke protrusion. Then, similar calligraphy characters axe retrieved and ranked according to their matching cost produced by approximate shape match. In order to speed up the retrieval, we employed high dimensional data structure - PK-tree. Finally, the efficiency of the algorithm is demonstrated by a preliminary experiment with 3012 calligraphy character images.展开更多
文摘A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.
基金supported by Macao FDCT(098/2012/A3)Research Grant of the University of Macao(UL017/08-Y4/MAT/QT01/FST)+1 种基金National Natural Science Funds for Young Scholars(10901166)Sun Yat-sen University Operating Costs of Basic ResearchProjects to Cultivate Young Teachers(11lgpy99)
文摘Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.
基金jointly supported by the National Key R&D Program of Chinathe National Natural Science Foundation of China (Grant Nos. 11902219 and 51721003)the Natural Science Foundation of Tianjin City (Grant No. 18JCJQJC46400)。
文摘Control parameter optimization is an efficient way to improve the endurance of underwater gliders(UGs),which influences their gliding efficiency and energy consumption.This paper analyzes the optimal matching between the net buoyancy and the pitching angle and proposes a segmented control strategy of Petrel-L.The optimization of this strategy is established based on the gliding range model of UG,which is solved based on the approximate model,and the variations of the optimal control parameters with the hotel load are obtained.The optimization results indicate that the segmented control strategy can significantly increase the gliding range when the optimal matching between the net buoyancy and the pitching angle is reached,and the increase rate is influenced by the hotel load.The gliding range of the underwater glider can be increased by 10.47%at a hotel load of 0.5 W.The optimal matching analysis adopted in this study can be applied to other UGs to realize endurance improvement.
基金This work is supported by the Scientific Research Foundation of Bijie University.
文摘In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type fixed point theorem are obtained.
基金supported by the National 111 Project of China(Grant No.B17050)China Ministry of Education Project of the Humanity and Social Science Research Foundation(Grant No.19YJC790150).
基金Supported by the National Natural Science Foundation of China(Grant Nos.60533090,60525108)the National Grand Fundamental Research 973 Program of China(Grant No.2002CB312101)+1 种基金the Science and Technology Project of Zhejiang Province(2005C13032,2005C11001-05)the China-US Million Book Digital Library Project(www.cadal.zju.edu.cn).
文摘As historical Chinese calligraphy works are being digitized, the problem of retrieval becomes a new challenge. But, currently no OCR technique can convert calligraphy character images into text, nor can the existing Handwriting Character Recognition approach does not work for it. This paper proposes a novel approach to efficiently retrieving Chinese calligraphy characters on the basis of similarity： calligraphy character image is represented by a collection of discriminative features, and high retrieval speed with reasonable effectiveness is achieved. First, calligraphy characters that have no possibility similar to the query are filtered out step by step by comparing the character complexity, stroke density and stroke protrusion. Then, similar calligraphy characters axe retrieved and ranked according to their matching cost produced by approximate shape match. In order to speed up the retrieval, we employed high dimensional data structure - PK-tree. Finally, the efficiency of the algorithm is demonstrated by a preliminary experiment with 3012 calligraphy character images.
