Shape Descriptor with Morphology Method for Color-based Tracking

Tracking images using shape descriptor can be more accurate than using other existing methods and it is most useful when the environment is complex. However the existing methods with shape descriptor get more labeled parts to compare and detect the object in an image, which makes the computation more complicated. Thus, we need a trade-off between the accuracy and efficiency requirements. This paper aims to bridge this gap between the accuracy and efficiency requirements by using morphology method. To improve the original monochromatic object detecting system, we propose a new color descriptor to preprocess the image with polychromatic object. Experiments have been conducted and shown the proposed method has made a great improvement in the time complexity minimization comparing with the performances of the original detection algorithm.

P^2: a robust and rotationally invariant shape descriptor with applications to mesh saliency

This work presents a robust and rotationally invariant shape descriptor, namely perception pronouncement （called p2）, to mathematically model the eye fixations, p2 takes two criteria - the local consideration of surface curvature and the global consideration of view- independent visibility - into account. Differing from existing works that often computed the intrinsic surface property of visibility in imaging space, a novel approach is proposed to approxi- mate the attribute in object space using Gauss map and Ray tracing. With the presented shape descriptor, mesh saliency detection, which refers to reasoning about which regions or points of a surface axe important, is more sensible, especially when 3D models fall into two categories： （1） the models possess significant interior/exterior structures; （2） the models contain regions where the contrast in visibility is high. For the models that are out of the categories, saliencies achieved by our approach are comparable to or even better than those of state-of-the-axt methods.

Data driven composite shape descriptor design for shape retrieval with a VoR-Tree

We develop a data driven method(probability model) to construct a composite shape descriptor by combining a pair of scale-based shape descriptors. The selection of a pair of scale-based shape descriptors is modeled as the computation of the union of two events, i.e.,retrieving similar shapes by using a single scale-based shape descriptor. The pair of scale-based shape descriptors with the highest probability forms the composite shape descriptor. Given a shape database, the composite shape descriptors for the shapes constitute a planar point set.A VoR-Tree of the planar point set is then used as an indexing structure for efficient query operation. Experiments and comparisons show the effectiveness and efficiency of the proposed composite shape descriptor.

Local voxelizer:A shape descriptor for surface registration

Surface registration brings multiple scans into a common coordinate system by aligning their overlapping components. This can be achieved by finding a few pairs of matched points on different scans using local shape descriptors and employing the matches to compute transformations to produce the alignment. By defining a unique local reference frame(LRF) and attaching an LRF to shape descriptors,the transformation can be computed using only one match based on aligning the LRFs. This paper proposes a local voxelizer descriptor,and the key ideas are to define a unique LRF using the support around a basis point,to perform voxelization for the local shape within a cubical volume aligned with the LRF,and to concatenate local features extracted from each voxel to construct the descriptor. An automatic rigid registration approach is given based on the local voxelizer and an expanding strategy that merges descriptor representations of aligned scans. Experiments show that our registration approach allows the acquisition of 3D models of various objects,and that the local voxelizer is robust to mesh noise and varying mesh resolution,in comparison to two state-of-the-art shape descriptors.

New shape clustering method based on contour DFT descriptor and modified SOFM neural network

A contour shape descriptor based on discrete Fourier transform （DFT） and a K-means al- gorithm modified self-organizing feature map （SOFM） neural network are established for shape clus- tering. The given shape is first sampled uniformly in the polar coordinate. Then the discrete series is transformed to frequency domain and constructed to a shape characteristics vector. Firstly, sample set is roughly clustered using SOFM neural network to reduce the scale of samples. K-means algo- rithm is then applied to improve the performance of SOFM neural network and process the accurate clustering. K-means algorithm also increases the controllability of the clustering. The K-means algo- rithm modified SOFM neural network is used to cluster the shape characteristics vectors which is previously constructed. With leaf shapes as an example, the simulation results show that this method is effective to cluster the contour shapes.

Particle shape characterisation and classification using automated microscopy and shape descriptors in batch manufacture of particulate solids

It is known that size alone, which is often defined as the volume-equivalent diameter, is not sufficient to characterize many particulate products. The shape of crystalline products can be as important as size in many applications, Traditionally, particulate shape is often defined by several simple descriptors such as the maximum length and the aspect ratio. Although these descriptors are intuitive, they result in a loss of information about the original shape. This paper presents a method to use principal component analysis to derive simple latent shape descriptors from microscope images of particulate products made in batch processes, and the use of these descriptors to identify batch-to-batch variations. Data from batch runs of both a laboratory crystalliser and an industrial crystallisation reactor are analysed using the described approach. Qualitative and quantitative comparisons with the use of traditional shape descriptors that have nhwical meanings and Fourier shape descriptors are also made.

Shape matching and retrieval based on multiple feature descriptors

A lot of 3D shape descriptors for 3D shape retrieval have been presented so far. This paper proposes a new mechanism, which employs several existing global and local 3D shape descriptors as input. With the sparse theory, some descriptors which play the most important role in measuring similarity between query model and the model in the dataset are selected automatically and an affinity matrix is constructed. Spectral clustering method can be implemented to this affinity matrix. Spectral embedding of this affinity matrix can be applied to retrieval, which integrating almost all the advantages of selected descriptors. In order to verify the performance of our approach, we perform experimental comparisons on Princeton Shape Benchmark database. Test results show that our method is a pose-oblivious, efficient and robustness method for either complete or incomplete models.

Modified Fourier descriptor for shape feature extraction

A modified Fourier descriptor was presented. Information from a local space can be used more efficiently. After the boundary pixel set of an object was computed, centroid distance approach was used to compute shape signature in the local space. A pair of shape signature and boundary pixel gray was used as a point in a feature space. Then, Fourier transform was used for composition of point information in the feature space so that the shape features could be computed. It is proved theoretically that the shape features from modified Fourier descriptors are invariant to translation, rotation, scaling, and change of start point. It is also testified by measuring the retrieval performance of the systems that the shape features from modified Fourier descriptors are more discriminative than those from other Fourier descriptors.

Fourier Descriptors with Different Shape Signatures:a Comparative Study for Shape Based Retrieval of Kinematic Constraints

Fourier Descriptors（FD） has been widely used in image analysis and computer vision for shape recognition as they can be made independent of translation,rotation,as well as scaling.They have also been used for developing methods for the analysis and synthesis of four-bar linkages for path generation.This paper focuses on a comparative study of Fourier descriptors derived from various shape signatures of planar closed curves.This includes representations based on Cartesian coordinates,centroid distance,cumulative angle,and curvature.The comparison is conducted not only using commonly used criteria for shape representation and identification but also in the context of shape based retrieval of kinematic constraints for task centered mechanism design.Examples are provided to seek to extract geometric constraints such as circle,circular arc,ellipse and line-segment from a given motion.

基于形状描述符的滞回曲线相似性指标的形成

为了形成全面的相似度指标以评价滞回曲线的拟合程度,引入了已广泛用于图像特征提取的形状描述符,并提出了基于这些描述符形成计算数值模拟曲线相对于实验曲线的相似度指标的具体流程.根据该流程,形成了一个基于形状上下文的相似度指标.先计算两曲线滞回圈之间的相似度,再对这些相似度进行加权组合,形成整个滞回环的相似度.为了验证该指标,采用Bouc-Wen模型进行数值模拟研究.改变Bouc-Wen模型的5个参数,并形成51条数值模拟曲线,计算这些曲线相对于中值曲线的相似度与力峰值点、耗能、刚度误差.结果表明,相似度与误差之间的斯皮尔曼相关系数绝对值均大于0.78,有强烈的相关性,从而验证了该指标的可行性和指标形成流程的有效性.

Learning local shape descriptors for computing non-rigid dense correspondence

A discriminative local shape descriptor plays an important role in various applications.In this paper,we present a novel deep learning framework that derives discriminative local descriptors for deformable 3D shapes.We use local"geometry images"to encode the multi-scale local features of a point,via an intrinsic parameterization method based on geodesic polar coordinates.This new parameterization provides robust geometry images even for badly-shaped triangular meshes.Then a triplet network with shared architecture and parameters is used to perform deep metric learning;its aim is to distinguish between similar and dissimilar pairs of points.Additionally,a newly designed triplet loss function is minimized for improved,accurate training of the triplet network.To solve the dense correspondence problem,an efficient sampling approach is utilized to achieve a good compromise between training performance and descriptor quality.During testing,given a geometry image of a point of interest,our network outputs a discriminative local descriptor for it.Extensive testing of non-rigid dense shape matching on a variety of benchmarks demonstrates the superiority of the proposed descriptors over the state-of-the-art alternatives.

钙质砂特征形状分析及不排水剪切强度研究

钙质砂的形状是影响其宏观力学性质的重要因素。人工挑选出不同特征形状(块状、片状、条状)的钙质砂,通过显微图像采集与处理技术,定义并构建了一个形状参数(偏离度α),对钙质砂的特征形状进行三维定量描述,配制3种不同形状掺量的钙质砂试样进行三轴固结不排水剪切试验,研究钙质砂的特征形状对其剪切特性的影响。研究结果表明:(1)偏离度α能够较好地对钙质砂的形状进行描述及区分,可作为一种量化钙质砂形状的有效手段;(2)钙质砂的不排水剪切强度与偏离度α有较好的相关性:若增加片状钙质砂的含量(α增加),则试样的不排水剪切强度降低,若增加条状钙质砂的含量(α减小),不排水剪切强度增大。研究成果不但加深了对钙质砂特征形状的理解,还为准确评估钙质砂的抗剪强度提供了新思路。

Comparison of shape representation methods for dynamic cell analysis

To evaluate the performance of basic shape representation methods for the description of dynamic cellular morphology, several frequently-used shape descriptors are compared. The methods are examined by using 50 lymphocyte video clips including two kinds of lymphocyte cells. Our goal is to represent cell shape in each frame accurately, meanwhile precisely classify the two groups of cells based on the cellular morphological variations in the video clips. Experimental results illustrate that in general the region-based shape descriptors outperform the contour-based ones, since the contourbased methods are excessively sensitive and ignorant to cellular internal information. Due to their robustness to noise, the region-based shape descriptors are suitable for dynamic cell representation. Although region-based methods are more time-consuming, they analyze the entire cell area.

基于Shape Context和尺度不变特征变换的多模图像自动配准方法

提出了基于修正的尺度不变特征变换(SIFT)特征提取和Shape Context特征描述算子相结合的多模图像自动配准算法,该算法利用修正的SIFT算法提取多模图像中的特征点,然后采用Shape Context算子描述特征点,利用特征点周围区域边缘点的梯度方向形成特征向量。采用欧氏距离作为匹配标准对多模图像中特征点进行初始匹配,然后通过RANSAC算法消除误匹配的特征点对,并采用最小二乘法计算仿射变换参数,最后通过仿射变换和双线性插值实现图像配准。对红外图像和可见光图像的配准实验结果表明了本算法的有效性和稳定性。

Shape Retrieval Using ECPDH with Dynamic Programming

The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distribution Histogram), which is based on the distribution of the points on an object contour under the polar coordinates. ECPDH has the essential merits of invariance to scale and translation. Dynamic Programming (DP) algorithm is used to measure the distance between the ECPDHs. The effectiveness of the proposed method is demonstrated using some standard tests on MPEG-7 shape database. The results show the precision and recall of our method over other recent methods in the literature.

Multi-sensor image registration using multi-resolution shape analysis

Multi-sensor image registration has been widely used in remote sensing and medical image field, but registration performance is degenerated when heterogeneous images are involved. An image registration method based on multi-resolution shape analysis is proposed in this paper, to deal with the problem that the shape of similar objects is always invariant. The contours of shapes are first detected as visual features using an extended contour search algorithm in order to reduce effects of noise, and the multi-resolution shape descriptor is constructed through Fourier curvature representation of the contour’s chain code. Then a minimum distance function is used to judge the similarity between two contours. To avoid the effect of different resolution and intensity distribution, suitable resolution of each image is selected by maximizing the consistency of its pyramid shapes. Finally, the transformation parameters are estimated based on the matched control-point pairs which are the centers of gravity of the closed contours. Multi-sensor Landsat TM imagery and infrared imagery have been used as experimental data for comparison with the classical contour-based registration. Our results have been shown to be superior to the classical ones.

基于聚类和shape context的人体姿态估计

二维图片的人体姿态估计是计算机视觉中一个非常重要并且热门的研究课题,并被广泛应用于人机交互、监控以及图片检索等方面.基于部件的模型是解决这一问题的经典方法,但当人体姿态变化较大时,传统部件模型不能精确地刻画和表达这种形变,因此使用范围受到很大限制.为了克服这一缺点,采用分治的思想细分了人体姿态的类型,并用shape context改进了原始部件模型中的父子部件相对位置的描述方式.首先在训练集上基于shape context特征对人体姿态进行聚类,然后在每一个聚类结果上训练一个基于部件的姿态估计模型.用HOG特征刻画部件的外观,用shape context特征来刻画部件之间的联系.相比传统的基于两个部件之间位置关系的刻画方式,考虑到全局信息的shape context特征可以弥补树模型结构过于单一的问题.这种改进的空间位置约束方式使得部件模型的整体性能得到提高.结果表明,本文提出的方法在实验中取得了令人满意的结果,与其它若干姿态估计方法相比具有一定优势.

A DESCRIPTION METHOD FOR ARBITRARILY SHAPED AND SIZED GRANULES IN 2D IMAGE

An alternative method is proposed in this letter for describing the arbitrary shape and size for granules in 2D image.After image binarization, the edge points on contour are detected, by which the centroid of the shape in question is sought using the moment calculation.Using Principal Component Analysis(PCA), the major and minor diameters are computed.Based on the signature curve-fitting, the first-order derivative is taken so as to seek all the characteristic vertices.By connecting the vertices found, the simplified polygon is formed and utilized for shape and size descriptive purposes.The developed algorithm is run on two given real particle images, and the execution results indicate that the computed parameters can technically well describe the shape and size for the original particles, being able to provide a ready-to-use database for machine vision system to perform related data processing tasks.

An anisotropic Chebyshev descriptor and its optimization for deformable shape correspondence

Shape descriptors have recently gained popularity in shape matching,statistical shape modeling,etc.Their discriminative ability and efficiency play a decisive role in these tasks.In this paper,we first propose a novel handcrafted anisotropic spectral descriptor using Chebyshev polynomials,called the anisotropic Chebyshev descriptor(ACD);it can effectively capture shape features in multiple directions.The ACD inherits many good characteristics of spectral descriptors,such as being intrinsic,robust to changes in surface discretization,etc.Furthermore,due to the orthogonality of Chebyshev polynomials,the ACD is compact and can disambiguate intrinsic symmetry sinces everal directions are considered.To improve the ACD’s discrimination ability,we construct a Chebyshev spectral manifold convolutional neural network(CSMCNN)that optimizes the ACD and produces a learned ACD.Our experimental results show that the ACD outperforms existing state-of-the-art handcrafted descriptors.The combination of the ACD and the CSMCNN is better than other state-of-the-art learned descriptors in terms of discrimination,efficiency,and robustness to changes in shape resolution and discretization.

Survey of lightweighting methods of huge 3D models for online Web3D visualization

Background With the rapid development of Web3D technologies, the online Web3D visualization, particularly for complex models or scenes, has been in a great demand. Owing to the major conflict between the Web3D system load and resource consumption in the processing of these huge models, the huge 3D model lightweighting methods for online Web3D visualization are reviewed in this paper. Methods By observing the geometry redundancy introduced by man-made operations in the modeling procedure, several categories of light-weighting related work that aim at reducing the amount of data and resource consumption are elaborated for Web3D visualization. Results By comparing perspectives, the characteristics of each method are summarized, and among the reviewed methods, the geometric redundancy removal that achieves the lightweight goal by detecting and removing the repeated components is an appropriate method for current online Web3D visualization. Meanwhile, the learning algorithm, still in improvement period at present, is our expected future research topic. Conclusions Various aspects should be considered in an efficient lightweight method for online Web3D visualization, such as characteristics of original data, combination or extension of existing methods, scheduling strategy, cache man-agement, and rendering mechanism. Meanwhile, innovation methods, particularly the learning algorithm, are worth exploring.