元树

文中还解决了对n内节点二元树的计数问题。

In this paper the counting problem of n-internal-node binary trees are also solved .

最小r元树算法

The Algorithm of Minimal r - tree

线性四元树表示二值图像的围线追踪和Euler数的计算

Contour tracing and computing the Euler number of binary images represented by linear quadtree

计算线性四元树表示的二值图象Euler数的图论方法

A graphic approach to computations of the Euler number of images represented by linear quadtrees

然后对小波变换斑点噪声滤波方法进行分析，提出了基于二元树复小波变换的SAR图像滤波方法。

Owing to the advantages of shift-invariance and excellent spatial orientations , the dual-tree complex wavelet transform is used to reduce SAR speckle noise .

在图象数据库的存贮结构及图象的数据压缩等应用中，GD等这类线性四元树表示方法得到了大量的研究。

In the application of image database and data compression , the linear quadtree methods such as GD are studied very much .

实验比较表明，二元树复小波变换抑制SAR斑点噪声效果明显，较小波变换更具有优越性。

Experimental result shows that , comparing to the discrete wavelet transform ( DWT ), the dual-tree complex wavelet is more efficient in the area of reducing SAR speckle noise .

提出了一种将支持向量机（SVM）和二元树复小波变换（DT-CWT）相结合的纹理图像分类方法。

A novel classification method for texture images was proposed by combining support vector machines ( SVM ) with dual-tree complex wavelet transform ( DT-CWT ) .

在有限二元树的同构类集合生成的向量空间上，利用二元树的节序列定义一个余乘法，得到了一个分次、余交换Hopf代数。

We define a coproduct on the vector space which has as basis all finite binary trees by using their spine sequences , and construct a cocommutative graded connected Hopf algebra .

临界二元树CBT（CriticalBinaryTree）作为描述电路功能的一种方法，可以用于呆滞型故障模型的电路功能级测试生成。其基于知识的树结构特别适用于专家系统环境〔1〕。

Critical Binary Tree ( CBT ) is a functional representation scheme of circuits which may be used for circuit functional test generation based on stuck-at fault models , and its knowledge-based tree structure is especially fit for expert system environment [ 1 ] .

该文以HNC理论的概念基元树表和词语的HNC符号映射方法为依据，提出并实现了语义相关度计算的方法。

With the base of concept primitive tree tables and the mapping theory from words to HNC symbols , we find and realize an algorithm of computation .

在原有算法的基础上，引入了另外两种Laplacian矩阵，并通过实验验证了算法的有效性。第二，提出了基于双元树复小波变换的有监督的谱特征分析算法。

Another two Laplacian matrixes are introduced to get better performance , and experiments are done to verify its effectiveness . Secondly , supervised spectral analysis based on dual-tree complex wavelet transform is proposed .

本文从Ballot序列出发推广定义了广义Ballot序列，利用它来表示一类具有n内节点的二元树，并且给出了自动生成广义Ballot序列和n内节点二元树的有效算法。

On the basis of balloting sequences , the generalized balloting sequences are defined , and they are used to represent a class of binary trees with n internal nodes . The efficient algorithms are developed to construct the generalized balloting sequences and the correspondent n-internal-node binary trees .

二元树复小波变换（DTCWT）具备近似平移不变、多方向选择、完全重构和高效计算等优点，适合于人脸特征提取。

Approximate shift invariance , good directional selectivity , computational efficiency properties of Dual-tree Complex Wavelet Transform ( DTCWT ) make it a good candidate for representing the face features .

图像分层表示的最优分割和线性二元树

Optimal division and linear binary tree for hierarchical representations of images

线性四元树中轴变换提供一种非常紧凑的区域表示法，它导致区域分割成边长为2的幂之和的最大正方形集合。

Linear quadtree medial axis transforms provide a very compact region representation .

八元树的存储与恢复的一种优化算法

An Optimized Arithmetic of the Storage and Comeback of Octree

利用四元树结构计算黑白二值图像周长的方法

An Algorithm of Perimeter Calculation in Binary Image Using Quadtree Data Structure

基于二元树复小波变换的特征提取与识别

A Character Feature Extraction Based on Dual-tree Complex Wavelet Transform and Recognition

从线性四元树中轴变换重建线性四元树

Reconstruction of linear quadtrees from linear quadtree medial axis transforms

轮廓线图象的零交叉&二元树识别算法

Zero Crossing and Binary Tree Recognition Arithmetic for Contour Images

标准线性四元树在模式识别中的应用

The Application of Normalized Linear Quadtree to Pattern Recognition

二元树复小波域的局部高斯混合模型图像降噪

Image Denoising Based on Local Mixture Gaussian Model of Dual-tree Complex Wavelet Domain

提出一种基于二元树的稀疏分解算法。

A new dual-tree sparse decomposition algorithm is proposed .

八元树三维表示法的磁盘存储与恢复

Disk Storage and Restoration of Octree for 3D Representation

用二元树复小波变换法实现离焦图像的半盲复原

Semi-blind defocused image restoration with dual-tree complex wavelet transform

利用体积交由正交三轮廓图生成线性八元树

Generation of linear OCTTREES from three orthogonal views using the volume intersection technique

组合电路功能级测试生成的临界二元树方法

A Functional Level Test Generation Method of Combinational Circuit with Critical Binary Tree

二元树结构的容错分析

Fault - tolerant Analysis for the Binary Tree Configuration

二元树复小波变换及其在图象方向滤波中的应用

Dual-tree Complex Wavelet Transform and It 's Application to Directional Filtering of Image