A parallel algorithm for generating chain code of objects in binary images

This paper addresses parallel execution of chain code generation on a linear array architecture. The contours in the proposed algorithm are viewed as a set of edges (or contour segments) that can be traced by a top-down contour tracing method to generate the chain codes for the outer and inner object contours. A parallel algorithm that contains the chain code generating rules and operations needed is also described, and the algorithm is mapped onto a one-dimensional systolic array containing processing elements (PEs) to devise this architecture. The architecture extracts the contours of objects and quickly generates the corresponding chain codes after the image data in all rows are inputted in a linear fashion. The total processing time for generating the chain codes in an N×N image is O(3N). By doing so, the real-time requirement is fulfilled and its execution time is independent of the image content. In addition, a partition method is developed to process an image when the parallel architecture has a fixed number of PEs; say two or more. The total execution time for an N×N image by employing a fixed number of PEs is N(N+1)/M+2(M−1), when M is the fixed number of PEs.     

A new and fast contour-filling algorithm

Contour filling is one of the most common problems in image and graphics processing. The executing speed of the contour filling is vital, especially for a real-time system. This paper studies the advantages and disadvantages of the conventional filling algorithms, analyzes their original ideas, and proposes a new filling algorithm. The new algorithm presents a very simple idea for finding seeds automatically, and limits the scan within the filling regions. Repeated experiments have proven that with the new algorithm, any complex inner and outer contours can be filled with higher speed.     

多模式3维视频形状编码

目的 具有立体感和高端真实感的3D视频正越来越受到学术界和产业界的关注和重视,未来在3D影视、机器视觉、远程医疗、军事航天等领域将有着广泛的应用前景。对象基3D视频是未来3D视频技术的重要发展趋势,其中高效形状编码是对象基3D视频应用中的关键问题。但现有形状编码方法主要针对图像和视频对象,面向3D视频的形状编码算法还很少。为此,基于对象基3D视频的应用需求,提出一种基于轮廓和链码表示的高效多模式3D视频形状编码方法。方法 对于给定的3D视频形状序列逐帧进行对象轮廓提取并预处理后,进行对象轮廓活动性分析,将形状图像分成帧内模式编码图像和帧间预测模式编码图像。对于帧内编码图像,基于轮廓内链码方向约束和线性特征进行高效编码。对于帧间编码图像,采用基于链码表示的轮廓基运动补偿预测、视差补偿预测、联合运动与视差补偿预测等多种模式进行编码,以充分利用视点内对象轮廓的帧间时域相关性和视点间对象轮廓的空域相关性,从而达到高效编码的目的。结果 实验仿真结果显示所提算法性能优于经典和现有的最新同类方法,压缩效率平均能提高9.3%到64.8%不等。结论 提出的多模式3D视频形状编码方法可以有效去除对象轮廓的帧间和视点间冗余,能够进行高效编码压缩,性能优于现有同类方法,可广泛应用于对象基编码、对象基检索、对象基内容分析与理解等。     

A motion compensated lifting wavelet codec for 3D video coding

A motion compensated lifting (MCLIFT) ramework for the 3D wavelet video coding is proposed in this paper,By using bi-directional motion compensation in each lifting step of the temporal direction,the video frames are effectively de-correlated,With the proper entropy coding and bit-stream packaging schemes,the MCLIFT wavelet video coder is scalable at frame rate and quality level .Experimental results show that the MCLIFT video coder outperforms the 3D wavelet video coder without motion by an average of 0.9-1.3dB,and outperforms MPEG-4 coder by an average of 0.2-0.6dB.     

Robust algorithm for tunnel closing in 3D volumetric objects based on topological characteristics of points

In this letter, we propose a robust, linear in time modification of Aktouf, Bertrand and Perroton’s algorithm for tunnel (3D hole) closing in 3D volumetric objects. Our algorithm is insensitive to small distortions and branches. The algorithm has been tested on various 3D images including very complicated 3D crack propagation images. The results of the tests, discussion of the algorithm properties and future research plans are also included in the paper.     

基于EXIT函数的自适应OFDM LDPC调制编码方案设计*

推导了瑞利衰落信道下,LDPC迭代译码的互信息公式,采用数值积分的方法计算校验节点外部信息,避免了信噪比较低时校验节点的LLR服从高斯分布的不精确假设带来的误差.分析了该编码系统的EXIT函数,以EXIT误差函数为代价函数,提出了自适应OFDM-LDPC编码方案.该方案与传统自适应方案相比,不需要确定切换门限,数值计算简单,而且避免了计算子信道信噪比带来的误差,适用于高速通信系统.最后在802.16e协议的仿真平台上进行了仿真验证.     

A class of quasi-cyclic LDPC codes from B_2 （mod m） sequences

A new class of binary low-density parity-check (LDPC) codes is proposed based on B 2 (mod m) sequences.The parity-check matrix of such a code has a column weight of three and a row weight of an arbitrary integer,and a quasi-cyclic structure.The parity-check matrix also has a girth at least 8,and corresponds to a code with minimal distance at least 12.When m is prime, an 8-cycles reduction method is presented to completely avoid the two types of 8-cycles within the total four types existed in the Tanner grap...     

A novel hybrid 3D video service algorithm based on scalable video coding (SVC) technology

A scalable video coding (SVC) server can simultaneously provide a single bitstream with a fixed maximum service layer for different kinds of devices having different memory capacity, network bandwidth, and CPU performance requirements. An efficient hybrid 3D video service scheme is proposed without violation of the SVC standard technology for multiple transmission paths. A dynamic local disparity vector estimation algorithm is used to reflect the motion shift component between stereo views in the inter-layer prediction stage of the SVC encoder. To improve the coding efficiency, an adaptive search scheme based on distortion rates (DRs) between corresponding and reference macroblocks is used. Based on experimental results, up to 1.41 dB of quality improvement using JSVM 9.19 reference software is verified.     

A new method for representing and matching shapes of natural objects

A new method for the representation and comparison of irregular two-dimensional shapes is presented. This method uses a polar transformation of the contour points about the geometric centre of the object. The distinctive vertices of the shape are extracted and used as comparative parameters to minimize the difference of contour distance from the centre. Experiments are performed, more than 39 000 comparisons of database shapes, provided by Sebastian et al. (ICCV (2001) 755), are made and the results are compared to those obtained therein. In addition, 450 comparisons of leaf shape are made and leaves of very similar shape are accurately distinguished. The method is shown to be invariant to translation, rotation and scaling and highly accurate in shape distinction. The method shows more tolerance to scale variation than that of Sebastian et al. (ICCV (2001) 755) and is less computationally intense.     

A multi-scale 3D Otsu thresholding algorithm for medical image segmentation

Thresholding technique is one of the most imperative practices to accomplish image segmentation. In this paper, a novel thresholding algorithm based on 3D Otsu and multi-scale image representation is proposed for medical image segmentation. Considering the high time complexity of 3D Otsu algorithm, an acceleration variant is invented using dimension decomposition rule. In order to reduce the effects of noises and weak edges, multi-scale image representation is brought into the segmentation algorithm. The whole segmentation algorithm is designed as an iteration procedure. In each iteration, the image is segmented by the efficient 3D Otsu, and then it is filtered by a fast local Laplacian filtering to get a smoothed image which will be input into the next iteration. Finally, the segmentation results are pooled to get a final segmentation using majority voting rules. The attractive features of the algorithm are that its segmentation results are stable, it is robust to noises and it holds for both bi-level and multi-level thresholding cases. Experiments on medical MR brain images are conducted to demonstrate the effectiveness of the proposed method. The experimental results indicate that the proposed algorithm is superior to the other multilevel thresholding algorithms consistently.     

基于轮廓提取与深度筛选的双目三维重构技术

针对基于深度图融合三维重构方法获取的三维重构模型,易受到深度信息误差影响的情况,提出一种基于轮廓提取与深度筛选的双目立体视觉三维重构方法。采用标准棋盘校准双目三维重构系统,利用Canny算子对目标物体进行边界检测,综合采用形态学腐蚀与膨胀方法提取指定方向上的连续边界,用连续边界提取目标物体。在此基础上,对目标物体深度信息进行筛选、拟合插值以获取连续深度信息。结果表明,相对于常规三维重构算法,由本算法三维重构的目标物体表面完整度更高,且目标物体周围的背景环境噪声被去除。     

A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently.     

一种基于传输容量控制的DTN动态分段编码路由算法*

针对时延容忍网络（DTN）中基于动态分段编码的路由算法DSNC存在的数据冗余编码和节点投递成功率低的问题,提出了一种基于传输容量控制的DTN动态分段编码路由算法NC-TCC。在源节点处,采用AONT矩阵对分段中的数据包进行编码,以减少数据重复编码的次数;在中间节点处,利用构造的节点运动模型计算当前连接的传输容量,并在满足传输容量的前提下按照优先级从高到低的顺序选择合适数量的数据包进行编码,以提高节点投递成功率。仿真结果表明,提出的算法能够有效地减少数据冗余,提高传输效率。     

Automated cell analysis in 2D and 3D: A comparative study

Optical projection tomographic microscopy is a technique that allows 3D analysis of individual cells. Theoretically, 3D morphometry would more accurately capture cellular features than 2D morphometry. To evaluate this thesis, classifiers based on 3D reconstructions of cell nuclei were compared with 2D images from the same nuclei. Human adenocarcinoma and normal lung epithelium cells were used. Testing demonstrated a three-fold reduction in the false negative rate for adenocarcinoma detection in 3D versus 2D at the same high specificity. We conclude that 3D imaging will potentially expand the horizon for automated cell analysis with broad applications in the biological sciences.     

Neural networks for the recognition and pose estimation of 3D objects from a single 2D perspective view

In this paper we present a neural network (NN) based system for recognition and pose estimation of 3D objects from a single 2D perspective view. We develop an appearance based neural approach for this task. First the object is represented in a feature vector derived by a principal component network. Then a NN classifier trained with Resilient backpropagation (Rprop) algorithm is applied to identify it. Next pose parameters are obtained by four NN estimators trained on the same feature vector. Performance on recognition and pose estimation for real images under occlusions are shown. Comparative studies with two other approaches are carried out.     

2D到3D图像颜色空间层转换技术研究及实现

从3D相关技术入手,初步讨论了人类视觉及相关转换技术。接着重点描述基于3d红蓝立体原理的图像转换原理,从图像颜色空间角度,着重讨论2D转3D的相关技术及研究现状,并基于电视类节目图像给出一套完整系统设计及实现,并给出相应的实验结果。     

A data embedding scheme for color images based on genetic algorithm and absolute moment block truncation coding

Recently, embedding a large amount of secret data into gray-level and color images with low distortion has become an important research issue in steganography. In this paper, we propose a data embedding scheme by using a well-known genetic algorithm, block truncation code and modification direction techniques to embed secret data into compression codes of color images to expand the variety of cover media. In the scheme, the common bitmap generation procedure of GA-AMBTC has been modified to speed up the hiding procedure. Two embedding strategies are proposed to hide secret data into the common bitmap and the quantization values in each block of the cover image. Experimental results confirm that the proposed scheme can provide high data capacity with acceptable image quality of the stego-images. Moreover, the compression ratio of the scheme is exactly the same as that of GA-AMBTC so that attackers cannot detect any trace of hidden data from the size of the modified compressed result.