Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
This letter presents a novel Motion Vector (MV) recovery method which is based on Mean Shift (MS) procedure. According to motion continuity, MVs in local area should be similar. If projecting MV into 2-D feature space...This letter presents a novel Motion Vector (MV) recovery method which is based on Mean Shift (MS) procedure. According to motion continuity, MVs in local area should be similar. If projecting MV into 2-D feature space, local MVs in the feature space tend to cluster closely. To estimate the lost MVs in local area, recovery of lost MVs is modeled as clustering operation. MS procedure is applied to enforce each lost MV in the feature space to shift to the position where dominant MVs are gathered. Meanwhile, bandwidth estimation is statistically characterized by the variation of local standard de-viations; weighted value calculation is determined by estimation of overall standard deviation. Simu-lation results demonstrate their better performance when compared with other MV recovery ap-proaches and low computation cost.展开更多
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
基金Supported by the National Natural Science Foundation of China (No. 60672134)
文摘This letter presents a novel Motion Vector (MV) recovery method which is based on Mean Shift (MS) procedure. According to motion continuity, MVs in local area should be similar. If projecting MV into 2-D feature space, local MVs in the feature space tend to cluster closely. To estimate the lost MVs in local area, recovery of lost MVs is modeled as clustering operation. MS procedure is applied to enforce each lost MV in the feature space to shift to the position where dominant MVs are gathered. Meanwhile, bandwidth estimation is statistically characterized by the variation of local standard de-viations; weighted value calculation is determined by estimation of overall standard deviation. Simu-lation results demonstrate their better performance when compared with other MV recovery ap-proaches and low computation cost.
