Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the O...Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the OMP algorithm under the restricted isometry property （RIP） is presented. It is shown that 5K＋V/KOK,1 〈 1 is sufficient for the OMP algorithm to recover exactly the support of arbitrary /（-sparse signal if its nonzero components are large enough for both 12 bounded and lz~ bounded noises.展开更多
The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems c...The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi-algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and sufficient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and sufficient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex.展开更多
This paper proposes a new method for the construction of Bernstein-Bezier algebraic hypersurface on a simplex with prescribed topology. The method is based on the combinatorial patchworking of Viro method. The topolog...This paper proposes a new method for the construction of Bernstein-Bezier algebraic hypersurface on a simplex with prescribed topology. The method is based on the combinatorial patchworking of Viro method. The topology of the Viro Bernstein-Bezier algebraic hypersurface piece is also described.展开更多
基金supported by National Natural Science Foundation of China(Grant Nos.11271060,U0935004,U1135003,11071031,11290143 and 11101096)the Scientific Research Foundation for the Returned Overseas Chinese Scholars,State Education Ministry,National Engineering Research Center of Digital Lifethe Guangdong Natural Science Foundation(Grant No.S2012010010376)
文摘Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the OMP algorithm under the restricted isometry property （RIP） is presented. It is shown that 5K＋V/KOK,1 〈 1 is sufficient for the OMP algorithm to recover exactly the support of arbitrary /（-sparse signal if its nonzero components are large enough for both 12 bounded and lz~ bounded noises.
基金supported by National Natural Science Foundation of China (Grant Nos. 10271022, 60373093,60533060)the Natural Science Foundation of Zhejiang Province (Grant No. Y7080068)the Foundation of Department of Education of Zhejiang Province (Grant Nos. 20070628 and Y200802999)
文摘The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi-algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and sufficient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and sufficient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex.
基金supported by National Natural Science Foundation of China (Grant Nos.11071031,60533060,11101366,10771189)the NSFC-Guangdong Joint Fund (Grant No. U0935004)the Zhejiang Provincial Natural Science Foundation (Grant Nos. Y7080068,Y6100126)
文摘This paper proposes a new method for the construction of Bernstein-Bezier algebraic hypersurface on a simplex with prescribed topology. The method is based on the combinatorial patchworking of Viro method. The topology of the Viro Bernstein-Bezier algebraic hypersurface piece is also described.
