Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target...Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target templates.However,the structure connecting these candidate regions is usually ignored.Lu proposed an NLSSC-tracker with non-local self-similarity sparse coding to address this issue,which has a high computational cost.In this study,we propose an Euclidean local-structure constraint based sparse coding tracker with a smoothed Euclidean local structure.With this tracker,the optimization procedure is transformed to a small-scale l1-optimization problem,significantly reducing the computational cost.Extensive experimental results on visual tracking demonstrate the eectiveness and efficiency of the proposed algorithm.展开更多
宽度窄、路面材质与农田差异性低是农村机耕路的特点,也是导致现有模板匹配方法自动化程度低的主要因素。本文针对这一问题,提出动态权重约束下的农村机耕路提取方法。该方法首先通过改进多尺度线段方向直方图(Multi-Scale Line Segment...宽度窄、路面材质与农田差异性低是农村机耕路的特点,也是导致现有模板匹配方法自动化程度低的主要因素。本文针对这一问题,提出动态权重约束下的农村机耕路提取方法。该方法首先通过改进多尺度线段方向直方图(Multi-Scale Line Segment Orientation Histogram, MLSOH)模型,对机耕路局部道路方向进行预测,能够降低由于田埂干扰所导致的道路方向错误预测几率;其次为明确表征机耕路线性特征,对影像进行线段提取。并将局部区域线段长度作为权重动态分配的主要因子,对不同道路预测方向进行动态权重分配,以此解决路面宽度窄导致的匹配准确度下降问题。最后,将HSL色彩空间相似性分析模型与动态权重因子进行结合,构成HSL动态匹配模型,以此提高机耕路与农田之间的对比性。本文以3幅不同地区、不同类型的高分辨率影像为实验数据,与其他多个模板匹配算法进行对比分析,结果表明,本文方法道路提取的完整度、正确率以及质量均在95%以上。同时相对于其他方法,在保证机耕路提取精度的基础上,本文提出的方法具有自动化程度高的优点,并且本文的方法也适用于其他农村区域道路。展开更多
This paper deals with nonlinear programming with linear constraints. where E^n is an n-dimensional Euclidean space, A is an m × n matrix (m ≤ n), its rank is m. b∈ E^m,E^m is an m-dimensional Euclidean space, f...This paper deals with nonlinear programming with linear constraints. where E^n is an n-dimensional Euclidean space, A is an m × n matrix (m ≤ n), its rank is m. b∈ E^m,E^m is an m-dimensional Euclidean space, f is a real valued function.展开更多
基金National Natural Foundation of China under Grant(61572085,61502058)
文摘Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target templates.However,the structure connecting these candidate regions is usually ignored.Lu proposed an NLSSC-tracker with non-local self-similarity sparse coding to address this issue,which has a high computational cost.In this study,we propose an Euclidean local-structure constraint based sparse coding tracker with a smoothed Euclidean local structure.With this tracker,the optimization procedure is transformed to a small-scale l1-optimization problem,significantly reducing the computational cost.Extensive experimental results on visual tracking demonstrate the eectiveness and efficiency of the proposed algorithm.
文摘This paper deals with nonlinear programming with linear constraints. where E^n is an n-dimensional Euclidean space, A is an m × n matrix (m ≤ n), its rank is m. b∈ E^m,E^m is an m-dimensional Euclidean space, f is a real valued function.
