Moment invariants for recognition under changing viewpoint and illumination

Generalised color moments combine shape and color information and put them on an equal footing. Rational expressions of such moments can be designed, that are invariant under both geometric deformations and photometric changes. These generalised color moment invariants are effective features for recognition under changing viewpoint and illumination. The paper gives a systematic overview of such moment invariants for several combinations of deformations and photometric changes. Their validity and potential is corroborated through a series of experiments. Both the cases of indoor and outdoor images are considered, as illumination changes tend to differ between these circumstances. Although the generalised color moment invariants are extracted from planar surface patches, it is argued that invariant neighbourhoods offer a concept through which they can also be used to deal with 3D objects and scenes.     

基于小波变换和去噪模型的光照不变人脸识别

针对正面光照人脸识别的难点,提出了一种应用小波变换和去噪模型的光照不变人脸识别算法。利用对图像的高频小波系数进行处理并运用去噪模型,提取光照人脸图像中的光照不变量,同时增强图像边缘特征,这有利于提取的光照不变量保持更多的人脸识别信息。在Yale B和CMU PIE人脸库上的实验结果表明,所提算法可以显著提高光照人脸图像的识别率。     

Illumination invariant feature extraction and mutual-information-based local matching for face recognition under illumination variation and occlusion

An efficient method for face recognition which is robust under illumination variations is proposed. The proposed method achieves the illumination invariants based on the illumination-reflection model employing local matching for best classification. Different filters have been tested to achieve the reflectance part of the image, which is illumination invariant, and maximum filter is suggested as the best method for this purpose. A set of adaptively weighted classifiers vote on different sub-images of each input image and a decision is made based on their votes. Image entropy and mutual information are used as weight factors. The proposed method does not need any prior information about the face shape or illumination and can be applied on each image separately. Unlike most available methods, our method does not need multiple images in training stage to get the illumination invariants. Support vector machines and k-nearest neighbors methods are used as classifier. Several experiments are performed on Yale B, Extended Yale B and CMU-PIE databases. Recognition results show that the proposed method is suitable for efficient face recognition under illumination variations.     

Implementation and analysis of an image-based global illuminationframework for animated environments

We describe a new framework for efficiently computing and storing global illumination effects for complex, animated environments. The new framework allows the rapid generation of sequences representing any arbitrary path in a “view space” within an environment in which both the viewer and objects move. The global illumination is stored as time sequences of range-images at base locations that span the view space. We present algorithms for determining locations for these base images, and the time steps required to adequately capture the effects of object motion. We also present algorithms for computing the global illumination in the base images that exploit spatial and temporal coherence by considering direct and indirect illumination separately. We discuss an initial implementation using the new framework. Results and analysis of our implementation demonstrate the effectiveness of the individual phases of the approach; we conclude with an application of the complete framework to a complex environment that includes object motion     

Integral invariants for shape matching

For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing integral operations. While such integral invariants enjoy some of the desirable properties of their differential counterparts, such as locality of computation (which allows matching under occlusions) and uniqueness of representation (asymptotically), they do not exhibit the noise sensitivity associated with differential quantities and, therefore, do not require presmoothing of the input shape. Our formulation allows the analysis of shapes at multiple scales. Based on integral invariants, we define a notion of distance between shapes. The proposed distance measure can be computed efficiently and allows warping the shape boundaries onto each other; its computation results in optimal point correspondence as an intermediate step. Numerical results on shape matching demonstrate that this framework can match shapes despite the deformation of subparts, missing parts and noise. As a quantitative analysis, we report matching scores for shape retrieval from a database.     

Joint Estimation of Shape and Reflectance using Multiple Images with Known Illumination Conditions

We propose a generative model based method for recovering both the shape and the reflectance of the surface(s) of a scene from multiple images, assuming that illumination conditions and cameras calibration are known in advance. Based on a variational framework and via gradient descents, the algorithm minimizes simultaneously and consistently a global cost functional with respect to both shape and reflectance. The motivations for our approach are threefold. (1) Contrary to previous works which mainly consider specific individual scenarios, our method applies indiscriminately to a number of classical scenarios; in particular it works for classical stereovision, multiview photometric stereo and multiview shape from shading. It works with changing as well as static illumination. (2) Our approach naturally combines stereo, silhouette and shading cues in a single framework. (3) Moreover, unlike most previous methods dealing with only Lambertian surfaces, the proposed method considers general dichromatic surfaces. We verify the method using various synthetic and real data sets.     

Color invariance

This paper presents the measurement of colored object reflectance, under different, general assumptions regarding the imaging conditions. We exploit the Gaussian scale-space paradigm for color images to define a framework for the robust measurement of object reflectance from color images. Object reflectance is derived from a physical reflectance model based on the Kubelka-Munk theory for colorant layers. Illumination and geometrical invariant properties are derived from the reflectance model. Invariance and discriminative power of the color invariants is experimentally investigated, showing the invariants to be successful in discounting shadow, illumination, highlights, and noise. Extensive experiments show the different invariants to be highly discriminative, while maintaining invariance properties. The presented framework for color measurement is well-founded in the physics of color as well as in measurement science. Hence, the proposed invariants are considered more adequate for the measurement of invariant color features than existing methods     

Projectively invariant decomposition and recognition of planar shapes

An algorithm is presented for computing a decomposition of planar shapes into convex subparts represented. by ellipses. The method is invariant to projective transformations of the shape, and thus the conic primitives can be used for matching and definition of invariants in the same way as points and lines. The method works for arbitrary planar shapes admitting at least four distinct tangents and it is based on finding ellipses with four points of contact to the given shape. The cross ratio computed from the four points on the ellipse can then be used as a projectively invariant index. It is demonstrated that a given shape has a unique parameter-free decomposition into a finite set of ellipses with unit cross ratio. For a given shape, each pair of ellipses can be used to compute two independent projective invariants. The set of invariants computed for each ellipse pair can be used as indexes to a hash table from which model hypothesis can be generated Examples of shape decomposition and recognition are given for synthetic shapes and shapes extracted from grey level images of real objects using edge detection.     

Negativity fonts, multiqubit invariants and four qubit maximally entangled states

Recently, we introduced negativity fonts as the basic units of multipartite entanglement in pure states. We show that the relation between global negativity of partial transpose of N?qubit state and linear entropy of reduced single qubit state yields an expression for global negativity in terms of determinants of negativity fonts. Transformation equations for determinants of negativity fonts under local unitaries (LU??s) are useful to construct LU invariants such as degree four and degree six invariants for four qubit states. The difference of squared negativity and N?tangle is an N qubit invariant which contains information on entanglement of the state caused by quantum coherences that are not annihilated by removing a single qubit. Four qubit invariants that detect the entanglement of specific parts in a four qubit state are expressed in terms of three qubit subsystem invariants. Numerical values of invariants bring out distinct features of several four qubit states which have been proposed to be the maximally entangled four qubit states.     

Elastic geodesic paths in shape space of parameterized surfaces

This paper presents a novel Riemannian framework for shape analysis of parameterized surfaces. In particular, it provides efficient algorithms for computing geodesic paths which, in turn, are important for comparing, matching, and deforming surfaces. The novelty of this framework is that geodesics are invariant to the parameterizations of surfaces and other shape-preserving transformations of surfaces. The basic idea is to formulate a space of embedded surfaces (surfaces seen as embeddings of a unit sphere in IR3) and impose a Riemannian metric on it in such a way that the reparameterization group acts on this space by isometries. Under this framework, we solve two optimization problems. One, given any two surfaces at arbitrary rotations and parameterizations, we use a path-straightening approach to find a geodesic path between them under the chosen metric. Second, by modifying a technique presented in [25], we solve for the optimal rotation and parameterization (registration) between surfaces. Their combined solution provides an efficient mechanism for computing geodesic paths in shape spaces of parameterized surfaces. We illustrate these ideas using examples from shape analysis of anatomical structures and other general surfaces.     

一种基于微分不变量的图像变化检测方法

配准误差、噪声干扰和照度变化是影响变化检测性能的主要因素,利用图像结构信息进行变化检测,可以有效地克服这些因素的影响.文中提出了一种利用微分不变量描述图像结构信息并进行变化检测的方法.微分不变量具有平移和旋转不变性,并且对噪声具有较强的鲁棒性.首先利用微分不变量构造特征描述子,然后在一个搜索窗内计算各描述子之间的Mahalanobis距离,取其最小值并与阈值相比作变化检测.实验证明,所提出的算法对噪声干扰和配准误差都有较强的鲁棒性.     

Class invariants as abstract interpretation of trace semantics

We present a generic framework for the automatic and modular inference of sound class invariants for class-based object-oriented languages. We define a trace-based semantics for classes which considers all possible orderings, with all possible arguments, of invocations of all the methods of a class. We prove a correspondence theorem between such a semantics and a generic, trace-based, semantics for complete object-oriented programs.We express state-based class invariants in a fixpoint form by considering an abstraction of the class semantics, and we show how class invariants can be automatically inferred exploiting a static analysis of the methods. Furthermore, we address the problem of inferring a subclass invariant without accessing to the parent code, but just to its invariant.     

基于幅值谱与不变矩的特征提取方法及应用

研究了傅立叶变换、不变矩的原理及特点,提出基于幅值谱与不变矩的特征提取方法,并应用于中厚板的表面缺陷自动分类.从现场在线采集中厚板的表面图像,将每幅表面图像划分成128×128大小的子图像,对子图像进行傅立叶变换得到子图像的幅值谱,再对幅值谱图像求Hu不变矩,将不变矩作为特征量,通过这种方法提取的特征向量不仅具有平移、旋转不变性,并且具有抗噪、抑制光照不均的优点.将本文方法得到的特征量作为基于LVQ神经网络的分类器输入,对缺陷样本进行学习和分类,结果表明,这些特征量适用于中厚板表面缺陷的分类,识别率达81.5％.     

Orthogonal variant moments features in image analysis

Moments are statistical measures used to obtain relevant information about a certain object under study (e.g., signals, images or waveforms), e.g., to describe the shape of an object to be recognized by a pattern recognition system. Invariant moments (e.g., the Hu invariant set) are a special kind of these statistical measures designed to remain constant after some transformations, such as object rotation, scaling, translation, or image illumination changes, in order to, e.g., improve the reliability of a pattern recognition system. The classical moment invariants methodology is based on the determination of a set of transformations (or perturbations) for which the system must remain unaltered. Although very well established, the classical moment invariants theory has been mainly used for processing single static images (i.e. snapshots) and the use of image moments to analyze images sequences or video, from a dynamic point of view, has not been sufficiently explored and is a subject of much interest nowadays. In this paper, we propose the use of variant moments as an alternative to the classical approach. This approach presents clear differences compared to the classical moment invariants approach, that in specific domains have important advantages. The difference between the classical invariant and the proposed variant approach is mainly (but not solely) conceptual: invariants are sensitive to any image change or perturbation for which they are not invariant, so any unexpected perturbation will affect the measurements (i.e. is subject to uncertainty); on the contrary, a variant moment is designed to be sensitive to a specific perturbation, i.e., to measure a transformation, not to be invariant to it, and thus if the specific perturbation occurs it will be measured; hence any unexpected disturbance will not affect the objective of the measurement confronting thus uncertainty. Furthermore, given the fact that the proposed variant moments are orthogonal (i.e. uncorrelated) it is possible to considerably reduce the total inherent uncertainty. The presented approach has been applied to interesting open problems in computer vision such as shape analysis, image segmentation, tracking object deformations and object motion tracking, obtaining encouraging results and proving the effectiveness of the proposed approach.