Miguel Reyes, Gabriel Dominguez, & Sergio Escalera. (2011). Feature Weighting in Dynamic Time Warping for Gesture Recognition in Depth Data. In 1st IEEE Workshop on Consumer Depth Cameras for Computer Vision (pp. 1182–1188).
Abstract: We present a gesture recognition approach for depth video data based on a novel Feature Weighting approach within the Dynamic Time Warping framework. Depth features from human joints are compared through video sequences using Dynamic Time Warping, and weights are assigned to features based on inter-intra class gesture variability. Feature Weighting in Dynamic Time Warping is then applied for recognizing begin-end of gestures in data sequences. The obtained results recognizing several gestures in depth data show high performance compared with classical Dynamic Time Warping approach.
|
|
M. Bressan, & Jordi Vitria. (2002). Feature Subset Selection in an ICA Space.
|
|
Xavier Baro, & Jordi Vitria. (2005). Feature Selection with Non-Parametric Mutual Information for Adaboost Learning.
|
|
Xavier Baro, & Jordi Vitria. (2005). Feature Selection with Non-Parametric Mutual Information for Adaboost Learning. In Frontiers in Artificial Intelligence and Applications / Artificial intelligence Research and Development, 131:131–138, Eds: B. Lopez, J. Melendez, P. Radeva, J. Vitria, IOS Press, ISBN: 1–58603–560–6.
|
Jaume Gibert, Ernest Valveny, & Horst Bunke. (2012). Feature Selection on Node Statistics Based Embedding of Graphs. PRL - Pattern Recognition Letters, 33(15), 1980–1990.
Abstract: Representing a graph with a feature vector is a common way of making statistical machine learning algorithms applicable to the domain of graphs. Such a transition from graphs to vectors is known as graphembedding. A key issue in graphembedding is to select a proper set of features in order to make the vectorial representation of graphs as strong and discriminative as possible. In this article, we propose features that are constructed out of frequencies of node label representatives. We first build a large set of features and then select the most discriminative ones according to different ranking criteria and feature transformation algorithms. On different classification tasks, we experimentally show that only a small significant subset of these features is needed to achieve the same classification rates as competing to state-of-the-art methods.
Keywords: Structural pattern recognition; Graph embedding; Feature ranking; PCA; Graph classification
|
|
H. Chouaib, Oriol Ramos Terrades, Salvatore Tabbone, F. Cloppet, & N. Vincent. (2008). Feature Selection Combining Genetic Algorithm and Adaboost Classifiers. In 19th International Conference on Pattern Recognition (pp. 1–4).
|
|
Monica Piñol, Angel Sappa, Angeles Lopez, & Ricardo Toledo. (2012). Feature Selection Based on Reinforcement Learning for Object Recognition. In Adaptive Learning Agents Workshop (pp. 33–39).
|
|
Daniel Ponsa, & Antonio Lopez. (2007). Feature Selection Based on a New Formulation of the Minimal-Redundancy-Maximal-Relevance Criterion. In 3rd Iberian Conference on Pattern Recognition and Image Analysis, LNCS 4477 (pp. 47–54).
|
P. Ricaurte, C. Chilan, Cristhian A. Aguilera-Carrasco, Boris X. Vintimilla, & Angel Sappa. (2014). Feature Point Descriptors: Infrared and Visible Spectra. SENS - Sensors, 14(2), 3690–3701.
Abstract: This manuscript evaluates the behavior of classical feature point descriptors when they are used in images from long-wave infrared spectral band and compare them with the results obtained in the visible spectrum. Robustness to changes in rotation, scaling, blur, and additive noise are analyzed using a state of the art framework. Experimental results using a cross-spectral outdoor image data set are presented and conclusions from these experiments are given.
|
|
David Masip, M. Bressan, & Jordi Vitria. (2005). Feature extraction methods for real-time face detection and classification. Eurasip Journal on Applied Signal Processing, 13: 2061–2071.
|
|
David Masip, & Jordi Vitria. (2005). Feature Extraction for Nearest Neighbor Classification. Application to Gender Recognition. International Journal of Intelligent Systems, 20(5): 561–576 (IF: 0.657).
|
Katerine Diaz, Jesus Martinez del Rincon, Marçal Rusiñol, & Aura Hernandez-Sabate. (2019). Feature Extraction by Using Dual-Generalized Discriminative Common Vectors. JMIV - Journal of Mathematical Imaging and Vision, 61(3), 331–351.
Abstract: In this paper, a dual online subspace-based learning method called dual-generalized discriminative common vectors (Dual-GDCV) is presented. The method extends incremental GDCV by exploiting simultaneously both the concepts of incremental and decremental learning for supervised feature extraction and classification. Our methodology is able to update the feature representation space without recalculating the full projection or accessing the previously processed training data. It allows both adding information and removing unnecessary data from a knowledge base in an efficient way, while retaining the previously acquired knowledge. The proposed method has been theoretically proved and empirically validated in six standard face recognition and classification datasets, under two scenarios: (1) removing and adding samples of existent classes, and (2) removing and adding new classes to a classification problem. Results show a considerable computational gain without compromising the accuracy of the model in comparison with both batch methodologies and other state-of-art adaptive methods.
Keywords: Online feature extraction; Generalized discriminative common vectors; Dual learning; Incremental learning; Decremental learning
|
Jorge Bernal, Fernando Vilariño, & F. Javier Sanchez. (2010). Feature Detectors and Feature Descriptors: Where We Are Now (Vol. 154).
Abstract: Feature Detection and Feature Description are clearly nowadays topics. Many Computer Vision applications rely on the use of several of these techniques in order to extract the most significant aspects of an image so they can help in some tasks such as image retrieval, image registration, object recognition, object categorization and texture classification, among others. In this paper we define what Feature Detection and Description are and then we present an extensive collection of several methods in order to show the different techniques that are being used right now. The aim of this report is to provide a glimpse of what is being used currently in these fields and to serve as a starting point for future endeavours.
|
Simone Balocco, O. Camara, E. Vivas, T. Sola, L. Guimaraens, H. A. van Andel, et al. (2010). Feasibility of Estimating Regional Mechanical Properties of Cerebral Aneurysms In Vivo. MEDPHYS - Medical Physics, 37(4), 1689–1706.
Abstract: PURPOSE:
In this article, the authors studied the feasibility of estimating regional mechanical properties in cerebral aneurysms, integrating information extracted from imaging and physiological data with generic computational models of the arterial wall behavior.
METHODS:
A data assimilation framework was developed to incorporate patient-specific geometries into a given biomechanical model, whereas wall motion estimates were obtained from applying registration techniques to a pair of simulated MR images and guided the mechanical parameter estimation. A simple incompressible linear and isotropic Hookean model coupled with computational fluid-dynamics was employed as a first approximation for computational purposes. Additionally, an automatic clustering technique was developed to reduce the number of parameters to assimilate at the optimization stage and it considerably accelerated the convergence of the simulations. Several in silico experiments were designed to assess the influence of aneurysm geometrical characteristics and the accuracy of wall motion estimates on the mechanical property estimates. Hence, the proposed methodology was applied to six real cerebral aneurysms and tested against a varying number of regions with different elasticity, different mesh discretization, imaging resolution, and registration configurations.
RESULTS:
Several in silico experiments were conducted to investigate the feasibility of the proposed workflow, results found suggesting that the estimation of the mechanical properties was mainly influenced by the image spatial resolution and the chosen registration configuration. According to the in silico experiments, the minimal spatial resolution needed to extract wall pulsation measurements with enough accuracy to guide the proposed data assimilation framework was of 0.1 mm.
CONCLUSIONS:
Current routine imaging modalities do not have such a high spatial resolution and therefore the proposed data assimilation framework cannot currently be used on in vivo data to reliably estimate regional properties in cerebral aneurysms. Besides, it was observed that the incorporation of fluid-structure interaction in a biomechanical model with linear and isotropic material properties did not have a substantial influence in the final results.
|
Dena Bazazian, Raul Gomez, Anguelos Nicolaou, Lluis Gomez, Dimosthenis Karatzas, & Andrew Bagdanov. (2019). Fast: Facilitated and accurate scene text proposals through fcn guided pruning. PRL - Pattern Recognition Letters, 119, 112–120.
Abstract: Class-specific text proposal algorithms can efficiently reduce the search space for possible text object locations in an image. In this paper we combine the Text Proposals algorithm with Fully Convolutional Networks to efficiently reduce the number of proposals while maintaining the same recall level and thus gaining a significant speed up. Our experiments demonstrate that such text proposal approaches yield significantly higher recall rates than state-of-the-art text localization techniques, while also producing better-quality localizations. Our results on the ICDAR 2015 Robust Reading Competition (Challenge 4) and the COCO-text datasets show that, when combined with strong word classifiers, this recall margin leads to state-of-the-art results in end-to-end scene text recognition.
|
