Unfolding a face : from singular to manifold

Face recognition from a single image remains an important task in many practical applications and a significant research challenge. Some of the challenges are inherent to the problem, for example due to changing lighting conditions. Others, no less significant, are of a practical nature – face recognition algorithms cannot be assumed to operate on perfect data, but rather often on data that has already been subject to pre-processing errors (e.g. localization and registration errors). This paper introduces a novel method for face recognition that is both trained and queried using only a single image per subject. The key concept, motivated by abundant prior work on face appearance manifolds, is that of face part manifolds – it is shown that the appearance seen through a sliding window overlaid over an image of a face, traces a trajectory over a 2D manifold embedded in the image space. We present a theoretical argument for the use of this representation and demonstrate how it can be effectively exploited in the single image based recognition. It is shown that while inheriting the advantages of local feature methods, it also implicitly captures the geometric relationship between discriminative facial features and is naturally robust to face localization errors. Our theoretical arguments are verified in an experimental evaluation on the Yale Face Database.

Unfolding projects: Afghan and Australian artist’s books collaborations

In August 2009 an email was circulated to a number of Australian women artists with an offer to participate in a project of dialogue with women in Afghanistan. The project grew as a response to the dire situation of many women in Afghanistan, particularly in relation to education; many women are illiterate because they were and often still are, forbidden, restricted, or discouraged from attending school. By April 2010, 53 artists’ books by 14 women artists from various parts of Australia were delivered to Afghanistan, thereby beginning a process of creative collaboration between women situated in different places, cultures, and languages, attempting a productive connection through image and text. Each artist had created a small series of concertinas of imagery consistent with her current studio practice, which were then delivered to Afghanistan and distributed amongst women participating in literacy education. The women were asked to relate to the images by writing their own words directly within. The general intent was for the concertinas to be sent back to Australia, then bound and exhibited to raise public awareness, and possibly sold to raise funds. The artistic intent, however, was not the fundraising aspect as much as to take part in a process of support and dialogue with women in Afghanistan. It was a manoeuvre that said 'you are not alone'. The aim was to mobilise a conversation of sorts through the visuality and materiality of the artist’s book, despite the limitations of cultural, experiential, and physical distance. Just over six months from their delivery to Afghanistan, 36 of the 53 books returned to Australia, each marked with handwritten stories and poems in Dari and Pashto. This paper discusses the processes and considerations involved in the project, and the partnership formed with SAWA-Australia (Support Association for the Women of Afghanistan).

Implementação da rotina de unfolding para determinação de distribuição de tamanho de grãos esféricos via distribuição de interceptos lineares e de área de seção

Na unfolding method of linear intercept distributions and secction área distribution was implemented for structures with spherical grains. Although the unfolding routine depends on the grain shape, structures with spheroidal grains can also be treated by this routine. Grains of non-spheroidal shape can be treated only as approximation. A software was developed with two parts. The first part calculates the probability matrix. The second part uses this matrix and minimizes the chi-square. The results are presented with any number of size classes as required. The probability matrix was determined by means of the linear intercept and section area distributions created by computer simulation. Using curve fittings the probability matrix for spheres of any sizes could be determined. Two kinds of tests were carried out to prove the efficiency of the Technique. The theoretical tests represent ideal cases. The software was able to exactly find the proposed grain size distribution. In the second test, a structure was simulated in computer and images of its slices were used to produce the corresponding linear intercept the section area distributions. These distributions were then unfolded. This test simulates better reality. The results show deviations from the real size distribution. This deviations are caused by statistic fluctuation. The unfolding of the linear intercept distribution works perfectly, but the unfolding of section area distribution does not work due to a failure in the chi-square minimization. The minimization method uses a matrix inversion routine. The matrix generated by this procedure cannot be inverted. Other minimization method must be used

Unfolding of plasmon-polariton modes in one-dimensional layered systems containing anisotropic left-handed materials

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Urea-induced unfolding of Glossoscolex paulistus hemoglobin, in oxy- and cyanomet-forms: A dissociation model

The urea effect on the giant extracellular hemoglobin of Glossoscolex paulistus (HbGp) stability was studied by analytical ultracentrifugation (AUC) and small angle X-ray scattering (SAXS). AUC data show that the sedimentation coefficient distributions curves c (S), at 1.0mol/L of urea, display a single peak at 57 S, associated to the undissociated protein. The increase in urea concentration, up to 4.0mol/L, induces the appearance of smaller species, due to oligomeric dissociation. The sedimentation coefficients and molecular masses are 9.2S and 204kDa for the dodecamer (abcd)3, 5.5S and 69kDa for the tetramer (abcd), 4.1S and 52kDa for the trimer (abc) and 2.0 S and 17kDa for the monomer d, respectively. SAXS data show initially a decrease in the I(0) values due to the oligomeric dissociation, and then, above 4.0mol/L of denaturant, for oxy-HbGp, and above 6.0mol/L for cyanomet-HbGp, an increase in the maximum dimension and gyration radius is observed, due to the unfolding process. According to AUC and SAXS data the HbGp unfolding is described by two phases: the first one, at low urea concentration, below 4.0mol/L, characterizes the oligomeric dissociation, while the second one, at higher urea concentration, is associated to the unfolding of dissociated species. Our results are complementary to a recent report based on spectroscopic observations. © 2012 Elsevier B.V.

Unfolding physics from the algebraic classification of spinor fields

After reviewing the Lounesto spinor field classification, according to the bilinear covariants associated to a spinor field, we call attention and unravel some prominent features involving unexpected properties about spinor fields under such classification. In particular, we pithily focus on the new aspects - as well as current concrete possibilities. They mainly arise when we deal with some non-standard spinor fields concerning, in particular, their applications in physics. © 2012 Elsevier B.V.

Inferring a weighted elastic network from partial unfolding with coarse-grained simulations

A number of studies have demonstrated that simple elastic network models can reproduce experimental B-factors, providing insights into the structure-function properties of proteins. Here, we report a study on how to improve an elastic network model and explore its performance by predicting the experimental B-factors. Elastic network models are built on the experimental C coordinates, and they only take the pairs of C atoms within a given cutoff distance r(c) into account. These models describe the interactions by elastic springs with the same force constant. We have developed a method based on numerical simulations with a simple coarse-grained force field, to attribute weights to these spring constants. This method considers the time that two C atoms remain connected in the network during partial unfolding, establishing a means of measuring the strength of each link. We examined two different coarse-grained force fields and explored the computation of these weights by unfolding the native structures. Proteins 2014; 82:119-129. (c) 2013 Wiley Periodicals, Inc.

Denaturation and unfolding of human anaphylatoxin C3a: an unusually low covalent stability of its native disulfide bonds.

The complement C3a anaphylatoxin is a major molecular mediator of innate immunity. It is a potent activator of mast cells, basophils and eosinophils and causes smooth muscle contraction. Structurally, C3a is a relatively small protein (77 amino acids) comprising a N-terminal domain connected by 3 native disulfide bonds and a helical C-terminal segment. The structural stability of C3a has been investigated here using three different methods: Disulfide scrambling; Differential CD spectroscopy; and Reductive unfolding. Two uncommon features regarding the stability of C3a and the structure of denatured C3a have been observed in this study. (a) There is an unusual disconnection between the conformational stability of C3a and the covalent stability of its three native disulfide bonds that is not seen with other disulfide proteins. As measured by both methods of disulfide scrambling and differential CD spectroscopy, the native C3a exhibits a global conformational stability that is comparable to numerous proteins with similar size and disulfide content, all with mid-point denaturation of [GdmCl](1/2) at 3.4-5M. These proteins include hirudin, tick anticoagulant protein and leech carboxypeptidase inhibitor. However, the native disulfide bonds of C3a is 150-1000 fold less stable than those proteins as evaluated by the method of reductive unfolding. The 3 native disulfide bonds of C3a can be collectively and quantitatively reduced with as low as 1mM of dithiothreitol within 5 min. The fragility of the native disulfide bonds of C3a has not yet been observed with other native disulfide proteins. (b) Using the method of disulfide scrambling, denatured C3a was shown to consist of diverse isomers adopting varied extent of unfolding. Among them, the most extensively unfolded isomer of denatured C3a is found to assume beads-form disulfide pattern, comprising Cys(36)-Cys(49) and two disulfide bonds formed by two pair of consecutive cysteines, Cys(22)-Cys(23) and Cys(56)-Cys(57), a unique disulfide structure of polypeptide that has not been documented previously.

Unfolding Feasible Arithmetic and Weak Truth

In this paper we continue Feferman’s unfolding program initiated in (Feferman, vol. 6 of Lecture Notes in Logic, 1996) which uses the concept of the unfolding U(S) of a schematic system S in order to describe those operations, predicates and principles concerning them, which are implicit in the acceptance of S. The program has been carried through for a schematic system of non-finitist arithmetic NFA in Feferman and Strahm (Ann Pure Appl Log, 104(1–3):75–96, 2000) and for a system FA (with and without Bar rule) in Feferman and Strahm (Rev Symb Log, 3(4):665–689, 2010). The present contribution elucidates the concept of unfolding for a basic schematic system FEA of feasible arithmetic. Apart from the operational unfolding U0(FEA) of FEA, we study two full unfolding notions, namely the predicate unfolding U(FEA) and a more general truth unfolding UT(FEA) of FEA, the latter making use of a truth predicate added to the language of the operational unfolding. The main results obtained are that the provably convergent functions on binary words for all three unfolding systems are precisely those being computable in polynomial time. The upper bound computations make essential use of a specific theory of truth TPT over combinatory logic, which has recently been introduced in Eberhard and Strahm (Bull Symb Log, 18(3):474–475, 2012) and Eberhard (A feasible theory of truth over combinatory logic, 2014) and whose involved proof-theoretic analysis is due to Eberhard (A feasible theory of truth over combinatory logic, 2014). The results of this paper were first announced in (Eberhard and Strahm, Bull Symb Log 18(3):474–475, 2012).

Efficient local unfolding with ancestor stacks

The most successful unfolding rules used nowadays in the partial evaluation of logic programs are based on well quasi orders (wqo) applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Ancestor (sub)sequences are used to increase the specialization power of unfolding while still guaranteeing termination and also to reduce the number of atoms for which the wqo has to be checked. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with a wqo and allows a stack-based implementation without losing any opportunities for specialization. Using our technique, certain non-leftmost unfoldings are allowed as long as local unfolding is performed, i.e., we cover depth-first strategies. To deal with practical programs, we propose assertion-based techniques which allow our approach to treat programs that include (Prolog) built-ins and external predicates in a very extensible manner, for the case of leftmost unfolding. Finally, we report on our mplementation of these techniques embedded in a practical partial evaluator, which shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations. To appear in Theory and Practice of Logic Programming (TPLP).

Efficient local unfolding with ancestor stacks for full prolog

The integration of powerful partial evaluation methods into practical compilers for logic programs is still far from reality. This is related both to 1) efficiency issues and to 2) the complications of dealing with practical programs. Regarding efnciency, the most successful unfolding rules used nowadays are based on structural orders applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with any structural order and allows a stack-based implementation without losing any opportunities for specialization. Regarding the second issue, we propose assertion-based techniques which allow our approach to deal with real programs that include (Prolog) built-ins and external predicates in a very extensible manner. Finally, we report on our implementation of these techniques in a practical partial evaluator, embedded in a state of the art compiler which uses global analysis extensively (the Ciao compiler and, specifically, its preprocessor CiaoPP). The performance analysis of the resulting system shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations.

Performance of artificial neural networks and genetical evolved artificial neural networks unfolding techniques

With the Bonner spheres spectrometer neutron spectrum is obtained through an unfolding procedure. Monte Carlo methods, Regularization, Parametrization, Least-squares, and Maximum Entropy are some of the techniques utilized for unfolding. In the last decade methods based on Artificial Intelligence Technology have been used. Approaches based on Genetic Algorithms and Artificial Neural Networks have been developed in order to overcome the drawbacks of previous techniques. Nevertheless the advantages of Artificial Neural Networks still it has some drawbacks mainly in the design process of the network, vg the optimum selection of the architectural and learning ANN parameters. In recent years the use of hybrid technologies, combining Artificial Neural Networks and Genetic Algorithms, has been utilized to. In this work, several ANN topologies were trained and tested using Artificial Neural Networks and Genetically Evolved Artificial Neural Networks in the aim to unfold neutron spectra using the count rates of a Bonner sphere spectrometer. Here, a comparative study of both procedures has been carried out.