以数字搜索树表示的二值图象的几何变换

本文介绍以数字搜索树表示的二值图象的一种几何变换算法，文中讨论了四分区与正四边区的基本关系，输出ＤＳＴ结点成立的充分条件，给出了完整的几何变换算法并对算法的复杂性作了分析。     

SAR复图像数据的CCSDS-IDC编码性能分析与四叉树编码

目的：CCSDS-IDC (国际空间数据系统咨询委员会-图像数据压缩) 是NASA制定的基于离散小波变换(DWT)尺度间衰减性的空间图像数据压缩标准,适用于合成孔径雷达(SAR)幅度图像及各类遥感图像的压缩。然而,与光学图像不同,常见的SAR图像都是复图像数据,其在干涉测高等许多场合具有广泛应用,分析研究CCSDS-IDC对SAR复图像数据的编码性能具有重要的应用价值。方法：由于SAR复图像数据不具有尺度间的衰减性,因此将其用于SAR复图像数据编码时性能较低。考虑到SAR复图像数据DWT系数呈现出聚类特性,提出将四叉树(QC)用于DWT域的SAR复图像数据编码,发现QC对SAR复图像数据具有高效的压缩性能。结果：实验结果表明,在同等码率下,对基于DWT的SAR复图像数据压缩, QC比CCSDS-IDC最多可提高幅度峰值信噪比4.4dB,平均相位误差最多可降低0.368;与基于方向提升小波变换（DLWT）的CCSDS-IDC相比,QC可提高峰值信噪比3.08dB,降低平均相位误差0.25;对其它类型的图像压缩,基于聚类的QC仍能获得很好的编码性能。结论：CCSDS-IDC对SAR复图像数据编码性能低下,而QC能获得很好的编码性能。对应于图像平滑分布的尺度间衰减性,其在某些特殊图像中可能不存在,而对应于图像结构分布的聚类特性总是存在的,故在基于DWT的图像编码算法设计中,应优先考虑利用小波系数的聚类特性,从而实现对更多种类图像的高效编码。     

一种空间查询高效的无线传感网络路由协议

在以数据为中心的大规模无线传感网络中,感知数据查询通常以空间查询为主,而感知节点携带能量极为有限,因此提高感知数据空间查询能量利用效率尤为重要。 GeoGrid协议是一种完全基于地理位置信息的路由协议,适用于大规模无线传感网络应用场景,但其空间查询效率较低。针对大规模空间查询应用场景,从成簇方式、簇首选举、网络拓扑层次构建及路由策略等方面对 GeoGrid 进行优化,提出一种基于四叉树结构的空间查询能量高效的无线传感网络路由协议———QuadGrid,并对 GeoGrid、QTBDC 及 QuadGrid 的空间查询能耗进行仿真分析。实验结果表明,与 GeoGrid、QTBDC 相比, QuadGrid网络能耗更均衡,网络生命周期更长,空间查询更高效。     

Efficient embedded wavelet codec based on list structure

A new efficient image codec called embedded wavelet coding based on list structure (EWCBL) is proposed in this paper. By combining the techniques of morphological representation and quadtree partitioning, EWCBL effectively exploits both within-subband clustering and cross-subband similarity of wavelet coefficients. Based on the list structure, a fine fractional bit-plane coding is employed to achieve excellent rate-distortion performance. The patterned morphological dilation is introduced to greatly reduce the redundant test operations. Experimental results show that the proposed EWCBL outperforms state-of-the-art embedded codecs for both lossy and lossless compression. Moreover, the good performance and features of embeddedness and scalability are achieved with relatively low complexity.     

改进的NAMK彩色图像表示算法

利用格雷码可以扩展或保持二值图像块状性的特点,提出一种改进的NAMK彩色图像表示算法NAMKG,给出算法的形式化描述及其存储结构,对其总数据量进行分析。理论分析和实验结果表明,相比NAMK算法和线性四元树算法,NAMKG可以有效减少子模式数,减小存储空间。     

一种对残养帧的四叉树分解编码算法

为了克服在低比特率下的块效应,并适应实时编、解码的需要,提出了一种对残差帧的四叉树编码算法,该算法首先采用OBMC的方法生成预测帧以有效消除块效应,并针对残差帧的统计与视觉特性,对每个2×2的小块取灰度平均值作为最小编码单位,然后用四叉树分解方法来大致标记均值大于某阈值的块的位置,并以标量量化和自适应算术编码器编码其灰度值.与基于变换的编码方法相比,该算法简单、高效,码率低,解码质量高,是一种实时的编、解码算法.     

基于四叉树的自适应门限分形图象IFS压缩方法

为了克服四叉树分块ＩＦＳ编码过程中,排列块与区域块的匹配误差不考虑输入图象特点这一缺点,提出了一种新的基于迭代函数系统（ＩＦＳ）进行静止灰度图象压缩的方法。该方法是根据当前排列块的方差来确定它与区域块的匹配门限。经分析证明,这种基于自适应门限的ＩＦＳ编码方法与人类视觉系统的特性基本相符,而且实验也证明,这一自适应门限的编码方法提高了ＩＦＳ图象压缩的适应性。     

Quadtree-based eigendecomposition for pose estimation in the presence of occlusion and background clutter

Eigendecomposition-based techniques are popular for a number of computer vision problems, e.g., object and pose estimation, because they are purely appearance based and they require few on-line computations. Unfortunately, they also typically require an unobstructed view of the object whose pose is being detected. The presence of occlusion and background clutter precludes the use of the normalizations that are typically applied and significantly alters the appearance of the object under detection. This work presents an algorithm that is based on applying eigendecomposition to a quadtree representation of the image dataset used to describe the appearance of an object. This allows decisions concerning the pose of an object to be based on only those portions of the image in which the algorithm has determined that the object is not occluded. The accuracy and computational efficiency of the proposed approach is evaluated on 16 different objects with up to 50% of the object being occluded and on images of ships in a dockyard.

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems

In this paper we investigate data structures obtained by a recursive partitioning of the multi- dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree . It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. We show that under the assumption that the input points have limited precision (i.e., are drawn from the integer grid of size u ) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant number of dimensions. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball. Received January 19, 1999; revised November 4, 1999.