基于局部轮廓特征的无人机头部检测跟踪算法

针对无人机的结构特点,提出了一种基于目标轮廓提取、轮廓自动分段、头部定位以及头部模板匹配四个模块的目标头部检测跟踪算法.首先对第一帧图像提取目标轮廓,并通过计算轮廓点的变化率,对轮廓进行自动分段,得到目标的4个局部轮廓点列,进而根据头部轮廓点列的特点,完成头部轮廓筛选,然后利用基于目标中轴的二次曲线拟合,实现头部顶点的...     

Recoupling in solid state NMR using γ prepared states and phase matching

The paper describes two-dimensional solid state NMR experiments that use powdered dephased antiphase coherence (γ preparation) to encode chemical shifts in the indirect dimension. Both components of this chemical shift encoded gamma-prepared states can be refocused into inphase coherence by a recoupling element. This helps to achieve sensitivity enhancement in 2D NMR experiments by quadrature detection. The powder dependence of the gamma-prepared states allows for manipulating them by suitable insertion of delays in the recoupling periods. This helps to design experiments that suppress diagonal peaks in 2D spectra, leading to improved resolution. We describe some new phase modulated heteronuclear and homonuclear recoupling pulse sequences that simplify the implementation of the described experiments based on γ prepared states. Recoupling in the heteronuclear spin system is achieved by matching the difference in the amplitude of the sine/cosine modulated phase on the two rf-channels to the spinning frequency while maintaining the same power on the two rf-channels.     

Frabicating hydroxyapatite nanorods using a biomacromolecule template

Rod-like hydroxyapatite (HAp) nanoparticles with various aspect ratios are synthesized by means of low-temperature hydrothermal method in the presence of a N-[(2-hydroxy-3-trimethylammonium) propyl]chitosan chloride (HTCC) template. The synthesized HAps were examined by X-ray diffraction (XRD), Fourier transform infrared spectrophotometer (FTIR) and transmission electron microscopy (TEM) techniques. The results reveal that HAps are rod-like monocrystals, where the size and morphology can be tailored by varying synthesis conditions, such as pH, hydrothermal synthesis temperature and the ratio of PO₄³⁻ to the quaternary ammonium in HTCC. The mechanism of HTCC template on HAp nanorod preparation is analyzed.     

Efficient exponential-time algorithms for edit distance between unordered trees

The edit distance problem for rooted unordered trees is known to be NP-hard. Based on this fact, this paper studies exponential-time algorithms for the problem. For a general case, an $O(\min ({1.26}^{n_1+n_2},2^{b_1+b_2}\cdot \text{<mi mathvariant="italic" is="true">poly</mi>}(n_1,n_2)))$ time algorithm is presented, where $n_1$ and $n_2$ are the numbers of nodes and $b_1$ and $b_2$ are the numbers of branching nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in $O({(1+ϵ)}^{n_1+n_2})$ time for any fixed $ϵ>0$. This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees.     

Large deviation properties for patterns

Deciding whether a given pattern is over- or under-represented according to a given background model is a key question in computational biology. Such a decision is usually made by computing some p-values reflecting the “exceptionality” of a pattern in a given sequence or set of sequences. In the simplest cases (short and simple patterns, simple background model, small number of sequences), an exact p-value can be computed with a tractable complexity. The realistic cases are in general too complicated to get such an exact p-value. Approximations are thus proposed (Gaussian, Poisson, Large deviation approximations). These approximations are applicable under some conditions: Gaussian approximations are valid in the central domain while Poisson and Large deviation approximations are valid for rare events. In the present paper, we prove a large deviation approximation to the double strands counting problem that refers to a counting of a given pattern in a set of sequences that arise from both strands of the genome. In that case, dependencies between a sequence and its reverse complement cannot be neglected. They are captured here for a Bernoulli model from general combinatorial properties of the pattern. A large deviation result is also provided for a set of small sequences.     

Analysis of orthogonal multi-matching pursuit under restricted isometry property

Orthogonal multi-matching pursuit(OMMP)is a natural extension of orthogonal matching pursuit(OMP)in the sense that N(N≥1)indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property(RIP)is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N+1+(K/N)~(1/2)θKN-N+1,N1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal.     

给定悬挂点数的双圈图中具有最小Hosoya指数的图

Let G be a graph. The Hosoya index Z（G） of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs.     

基于剪枝信任度传播的手写体目标形状匹配方法

手写体识别中,目标形状的匹配是较为重要的工作.为了提高手写体目标形状的匹配速度,提出一种新的匹配方法.由于手写体目标形状的几何先验知识已知,并可以采用少量的参数进行表示,新方法采用参数化可变形模板匹配目标形状,确定其后验概率模型,并定义剪枝信任度空间,依据信任度传播算法的特性,首次将剪枝信任度传播算法应用于求解可变形模板与目标形状之间的最佳匹配.实验结果显示,在灰度图像中,对手写体目标形状的轮廓检测与定位速度显著提高.提出将剪枝信任度传播方法应用于手写体目标形状的匹配工作,能够使得目标形状填补空白,应用于相关性较为稀疏的图模型中.