754,644 Hits in 3.3 sec

Facial expression recognition using Hough forest

Chi-Ting Hsu, Shih-Chung Hsu, Chung-Lin Huang
2013 2013 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference  
Finally, classification and localization of the center of the facial expression in the video sequences are performed by using a Hough forest.  ...  Our facial expression system analyzes the non-rigid morphing facial expressions and eliminates the person-specific effects through patch features extracted from facial motion due to different facial expressions  ...  EXPRESSION RECOGNITIO To recognize facial expression, we ex from the test video. These patches will b decision tree in Hough forest.  ... 
doi:10.1109/apsipa.2013.6694152 dblp:conf/apsipa/HsuHH13 fatcat:ndul5ox2wncifh2qzuzja2wcoa

Variable selection from random forests: application to gene expression data [article]

Ramon Diaz-Uriarte, Sara Alvarez de Andres
2005 arXiv   pre-print
We first show the effects of changes in parameters of random forest on the prediction error.  ...  Thus, it is important to understand the performance of random forest with microarray data and its use for gene selection.  ...  After fitting all forests, we examine the OOB error rates from all the fitted random forests.  ... 
arXiv:q-bio/0503025v2 fatcat:zmdkw7rqnfedflsd2fi2sbxoxa

Pairwise Conditional Random Forests for Facial Expression Recognition

Arnaud Dapogny, Kevin Bailly, Severine Dubuisson
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Those forests are conditioned on the expression label of the first frame to reduce the variability of the ongoing expression transitions.  ...  on several facial expression benchmarks.  ...  Random Forests for FER Facial expression prediction Random Forests (RFs) [2] is a popular learning framework introduced in the seminal work of Breiman [2] .  ... 
doi:10.1109/iccv.2015.431 dblp:conf/iccv/DapognyBD15 fatcat:72pnwt25h5exxfmb45phpscbei

Stability of transgene expression in poplar: A model forest tree species

Simon Hawkins, Jean-Charles Lepl�, Daniel Cornu, Lise Jouanin, Gilles Pilate
2003 Annals of Forest Science  
While important variations in expression levels occurred, the transgene appeared to be stably expressed throughout a 6-year period.  ...  We evaluated the stability of trangene expression in a hybrid poplar (Populus tremula ´ P. alba) clone transformed with constructs carrying a reporter gene (uidA) under the control of either a constitutive  ...  Consequently, one of the crucial issues related to the use of genetic transformation in forest tree improvement is the stability of transgene expression.  ... 
doi:10.1051/forest:2003035 fatcat:chmwnxurmjbqrgtyqdjhbztbu4

Modified Semliki Forest Virus Expression Vector that Facilitates Cloning

Jayesh Meanger, Irene Peroulis, John Mills
1997 BioTechniques  
Two mammalian expression systems have been reported to overcome the problems of these other expression systems, one based on Semliki forest virus (SFV) (6) and the other based on Sindbis virus (11)  ...  In addition, it has been reported that high-level expression of recombinant protein can be achieved by packaging the expression system (1).  ... 
doi:10.2144/97233bm18 pmid:9298213 fatcat:twlxyhrtg5ezlk5drdtietoiei

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions [chapter]

Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins
2021 Lecture Notes in Computer Science  
Experimental results show that Forest successfully returns the desired regular expression in 70% of the instances and outperforms Regel, a state-of-the-art regular expression synthesizer.  ...  However, writing these validators can pose a challenge to some users.We present Forest, a regular expression synthesizer for digital form validations.  ...  To find distinguishing inputs in regular expression synthesis, Forest uses Z3's theory of regular expressions [23] .  ... 
doi:10.1007/978-3-030-72016-2_9 fatcat:obq2x2mo3baohemytw2metvale

Hough Forest-Based Facial Expression Recognition from Video Sequences [chapter]

Gabriele Fanelli, Angela Yao, Pierre-Luc Noel, Juergen Gall, Luc Van Gool
2012 Lecture Notes in Computer Science  
Classification and localization of the center of the expression in the video sequences are performed using a Hough transform voting method based on randomized forests.  ...  This work presents a user-independent approach for the recognition of facial expressions from image sequences.  ...  As in [12] , the voting is performed by a forest of random trees, or Hough forest [9] , and a mapping is learnt between densely sampled spatio-temporal features and the center of the expression in the  ... 
doi:10.1007/978-3-642-35749-7_15 fatcat:mtdw4e5vobfnvpb6hcqchsho3i

Expression of Semliki Forest Virus E1 Protein inEscherichia coli

Susanne Nyfeler, Karin Senn, Christoph Kempf
2001 Journal of Biological Chemistry  
The ability to form a pore has been ascribed to the ectodomain of the Semliki Forest virus (SFV) E1 spike protein.  ...  As a model for the entry of enveloped animal viruses into cells, the ␣ virus Semliki Forest virus has been extensively studied (1).  ...  The ability to form a pore has been ascribed to the ectodomain of the Semliki Forest virus (SFV) E1 spike protein.  ... 
doi:10.1074/jbc.m011061200 pmid:11278826 fatcat:usrc6d2bmvccxnezwasslbk4vi

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions [article]

Margarida Ferreira and Miguel Terra-Neves and Miguel Ventura and Inês Lynce and Ruben Martins
2020 arXiv   pre-print
We present FOREST, a regular expression synthesizer for digital form validations.  ...  We evaluated FOREST on real-world form-validation instances using regular expressions.  ...  To find distinguishing inputs in regular expression synthesis, Forest uses Z3's theory of regular expressions (part of the theory of strings [2] ).  ... 
arXiv:2012.14235v1 fatcat:2rddq6wkingk7leopwsnknk2sq

Deep Learning and Random Forest-Based Augmentation of sRNA Expression Profiles [chapter]

Jelena Fiosina, Maksims Fiosins, Stefan Bonn
2019 Lecture Notes in Computer Science  
We formulate an automatic augmentation of small RNA-seq expression data as a classification problem and investigate deep learning (DL) and random forest (RF) approaches to solve it.  ...  We validate our approach on 4243 annotated small RNA-seq samples from the Small RNA Expression Atlas (SEA) database.  ...  Random Forest (RF) classifier is being widely used for classification of expression data, especially in disease diagnostics [13] .  ... 
doi:10.1007/978-3-030-20242-2_14 fatcat:ea2firpzdjberj3ue3hcwn4pt4

Facial Expressions of Visitors in Forests along the Urbanization Gradient: What Can We Learn from Selfies on Social Networking Services?

Wei, Hauer, Chen, He
2019 Forests  
Female visitors showed positive emotional expressions to urban forests while male visitors showed no response.  ...  Visitors in downtown-forests showed fewer negative expressions at the most northern city than at the southern most one.  ...  This methodology enabled us to compare the difference of facial expressions between forests at urban and rural areas.  ... 
doi:10.3390/f10121049 fatcat:7qcfgq3leffwnmoibpnrg6prvq

Study on Gene Differential Expression in Tetraploid Populus Leaves

Ying Zhang, Yongyu Ren, Xiangyang Kang
2020 Forests  
The results showed that the high expression of GATA and PORA in tetraploid leaves was the reason for the higher chlorophyll content in the leaves than in diploid and triploid leaves.  ...  Populus triploid by doubling the chromosomes of the female gamete, in the triploid by doubling the chromosomes of somatic cells and the diploid with the parent were compared to reveal the patterns of gene expression  ...  Forests 2020, 11 , x FOR PEER REVIEW 6 of 17 28,444, 27,954, and 29,263 genes from diploid, triploid, and tetraploid poplar leaves, respectively.  ... 
doi:10.3390/f11111233 fatcat:a2qotl6eyncszbi655tqplkhoi

Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material) [article]

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
2020 arXiv   pre-print
We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels.  ...  Though both operators are second-order in nature, we show that ML(|) is as expressive as the graded modal logic GML (on finite trees) whereas ML(*) lies strictly between ML and GML.  ...  Expressive power.  ... 
arXiv:2007.08598v1 fatcat:56wgfhohmnfqjanbtie3gavxx4

Dynamic Pose-Robust Facial Expression Recognition by Multi-View Pairwise Conditional Random Forests [article]

Arnaud Dapogny, Kévin Bailly, Séverine Dubuisson
2016 arXiv   pre-print
In this paper, we use Conditional Random Forests to capture low-level expression transition patterns.  ...  Automatic facial expression classification (FER) from videos is a critical problem for the development of intelligent human-computer interaction systems.  ...  The resulting forest thus outputs an expression probability for a specific pair of images.  ... 
arXiv:1607.06250v1 fatcat:t5ms3bbnjvev5mwfsivucxif74

Modal Logics with Composition on Finite Forests

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
2020 Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science  
A pointed forest (M,w ) is a finite forest M = (W ,R,V ) together with a world w ∈ W .  ...  Expressive power.  ... 
doi:10.1145/3373718.3394787 dblp:conf/lics/BednarczykDFM20 fatcat:xc5xesh7ejawbmuyihcwnf4qxe
« Previous Showing results 1 — 15 out of 754,644 results