| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–20] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | A. Martinez; Jordi Vitria | ||||
Title  |
A Development Plataform for Autonomous Agents. | Type | Journal Article | ||
| Year | 1995 | Publication | ASI–AA–95 – Practice and Future of Autonomous Agents. | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Monte Verita, Switzerland. | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ MaV1995b | Serial | 123 | ||
| Permanent link to this record | |||||
| Author | Carme Julia; Felipe Lumbreras; Angel Sappa | ||||
| Title |
A Factorization-based Approach to Photometric Stereo | Type | Journal Article | ||
| Year | 2011 | Publication | International Journal of Imaging Systems and Technology | Abbreviated Journal | IJIST |
| Volume | 21 | Issue | 1 | Pages | 115-119 |
| Keywords | |||||
| Abstract | This article presents an adaptation of a factorization technique to tackle the photometric stereo problem. That is to recover the surface normals and reflectance of an object from a set of images obtained under different lighting conditions. The main contribution of the proposed approach is to consider pixels in shadow and saturated regions as missing data, in order to reduce their influence to the result. Concretely, an adapted Alternation technique is used to deal with missing data. Experimental results considering both synthetic and real images show the viability of the proposed factorization-based strategy. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 115–119, 2011. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ JLS2011; ADAS @ adas @ | Serial | 1711 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez; Dimosthenis Karatzas | ||||
| Title |
A fast hierarchical method for multi‐script and arbitrary oriented scene text extraction | Type | Journal Article | ||
| Year | 2016 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 19 | Issue | 4 | Pages | 335-349 |
| Keywords | scene text; segmentation; detection; hierarchical grouping; perceptual organisation | ||||
| Abstract | Typography and layout lead to the hierarchical organisation of text in words, text lines, paragraphs. This inherent structure is a key property of text in any script and language, which has nonetheless been minimally leveraged by existing text detection methods. This paper addresses the problem of text
segmentation in natural scenes from a hierarchical perspective. Contrary to existing methods, we make explicit use of text structure, aiming directly to the detection of region groupings corresponding to text within a hierarchy produced by an agglomerative similarity clustering process over individual regions. We propose an optimal way to construct such an hierarchy introducing a feature space designed to produce text group hypotheses with high recall and a novel stopping rule combining a discriminative classifier and a probabilistic measure of group meaningfulness based in perceptual organization. Results obtained over four standard datasets, covering text in variable orientations and different languages, demonstrate that our algorithm, while being trained in a single mixed dataset, outperforms state of the art methods in unconstrained scenarios. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.056; 601.197 | Approved | no | ||
| Call Number | Admin @ si @ GoK2016a | Serial | 2862 | ||
| Permanent link to this record | |||||
| Author | Fadi Dornaika; Angel Sappa | ||||
| Title |
A Featureless and Stochastic Approach to On-board Stereo Vision System Pose | Type | Journal Article | ||
| Year | 2009 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 27 | Issue | 9 | Pages | 1382–1393 |
| Keywords | On-board stereo vision system; Pose estimation; Featureless approach; Particle filtering; Image warping | ||||
| Abstract | This paper presents a direct and stochastic technique for real-time estimation of on-board stereo head’s position and orientation. Unlike existing works which rely on feature extraction either in the image domain or in 3D space, our proposed approach directly estimates the unknown parameters from the stream of stereo pairs’ brightness. The pose parameters are tracked using the particle filtering framework which implicitly enforces the smoothness constraints on the estimated parameters. The proposed technique can be used with a driver assistance applications as well as with augmented reality applications. Extended experiments on urban environments with different road geometries are presented. Comparisons with a 3D data-based approach are presented. Moreover, we provide a performance study aiming at evaluating the accuracy of the proposed approach. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ DoS2009b | Serial | 1152 | ||
| Permanent link to this record | |||||
| Author | Oriol Ramos Terrades; Albert Berenguel; Debora Gil | ||||
| Title |
A Flexible Outlier Detector Based on a Topology Given by Graph Communities | Type | Journal Article | ||
| Year | 2022 | Publication | Big Data Research | Abbreviated Journal | BDR |
| Volume | 29 | Issue | Pages | 100332 | |
| Keywords | Classification algorithms; Detection algorithms; Description of feature space local structure; Graph communities; Machine learning algorithms; Outlier detectors | ||||
| Abstract | Outlier detection is essential for optimal performance of machine learning methods and statistical predictive models. Their detection is especially determinant in small sample size unbalanced problems, since in such settings outliers become highly influential and significantly bias models. This particular experimental settings are usual in medical applications, like diagnosis of rare pathologies, outcome of experimental personalized treatments or pandemic emergencies. In contrast to population-based methods, neighborhood based local approaches compute an outlier score from the neighbors of each sample, are simple flexible methods that have the potential to perform well in small sample size unbalanced problems. A main concern of local approaches is the impact that the computation of each sample neighborhood has on the method performance. Most approaches use a distance in the feature space to define a single neighborhood that requires careful selection of several parameters, like the number of neighbors.
This work presents a local approach based on a local measure of the heterogeneity of sample labels in the feature space considered as a topological manifold. Topology is computed using the communities of a weighted graph codifying mutual nearest neighbors in the feature space. This way, we provide with a set of multiple neighborhoods able to describe the structure of complex spaces without parameter fine tuning. The extensive experiments on real-world and synthetic data sets show that our approach outperforms, both, local and global strategies in multi and single view settings. |
||||
| Address | August 28, 2022 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG; IAM; 600.140; 600.121; 600.139; 600.145; 600.159 | Approved | no | ||
| Call Number | Admin @ si @ RBG2022a | Serial | 3718 | ||
| Permanent link to this record | |||||
| Author | P. Canals; Simone Balocco; O. Diaz; J. Li; A. Garcia Tornel; M. Olive Gadea; M. Ribo | ||||
| Title |
A fully automatic method for vascular tortuosity feature extraction in the supra-aortic region: unraveling possibilities in stroke treatment planning | Type | Journal Article | ||
| Year | 2023 | Publication | Computerized Medical Imaging and Graphics | Abbreviated Journal | CMIG |
| Volume | 104 | Issue | 102170 | Pages | |
| Keywords | Artificial intelligence; Deep learning; Stroke; Thrombectomy; Vascular feature extraction; Vascular tortuosity | ||||
| Abstract | Vascular tortuosity of supra-aortic vessels is widely considered one of the main reasons for failure and delays in endovascular treatment of large vessel occlusion in patients with acute ischemic stroke. Characterization of tortuosity is a challenging task due to the lack of objective, robust and effective analysis tools. We present a fully automatic method for arterial segmentation, vessel labelling and tortuosity feature extraction applied to the supra-aortic region. A sample of 566 computed tomography angiography scans from acute ischemic stroke patients (aged 74.8 ± 12.9, 51.0% females) were used for training, validation and testing of a segmentation module based on a U-Net architecture (162 cases) and a vessel labelling module powered by a graph U-Net (566 cases). Successively, 30 cases were processed for testing of a tortuosity feature extraction module. Measurements obtained through automatic processing were compared to manual annotations from two observers for a thorough validation of the method. The proposed feature extraction method presented similar performance to the inter-rater variability observed in the measurement of 33 geometrical and morphological features of the arterial anatomy in the supra-aortic region. This system will contribute to the development of more complex models to advance the treatment of stroke by adding immediate automation, objectivity, repeatability and robustness to the vascular tortuosity characterization of patients. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB | Approved | no | ||
| Call Number | Admin @ si @ CBD2023 | Serial | 4005 | ||
| Permanent link to this record | |||||
| Author | Laura Igual; Joan Carles Soliva; Antonio Hernandez; Sergio Escalera; Xavier Jimenez ; Oscar Vilarroya; Petia Radeva | ||||
| Title |
A fully-automatic caudate nucleus segmentation of brain MRI: Application in volumetric analysis of pediatric attention-deficit/hyperactivity disorder | Type | Journal Article | ||
| Year | 2011 | Publication | BioMedical Engineering Online | Abbreviated Journal | BEO |
| Volume | 10 | Issue | 105 | Pages | 1-23 |
| Keywords | Brain caudate nucleus; segmentation; MRI; atlas-based strategy; Graph Cut framework | ||||
| Abstract | Background
Accurate automatic segmentation of the caudate nucleus in magnetic resonance images (MRI) of the brain is of great interest in the analysis of developmental disorders. Segmentation methods based on a single atlas or on multiple atlases have been shown to suitably localize caudate structure. However, the atlas prior information may not represent the structure of interest correctly. It may therefore be useful to introduce a more flexible technique for accurate segmentations. Method We present Cau-dateCut: a new fully-automatic method of segmenting the caudate nucleus in MRI. CaudateCut combines an atlas-based segmentation strategy with the Graph Cut energy-minimization framework. We adapt the Graph Cut model to make it suitable for segmenting small, low-contrast structures, such as the caudate nucleus, by defining new energy function data and boundary potentials. In particular, we exploit information concerning the intensity and geometry, and we add supervised energies based on contextual brain structures. Furthermore, we reinforce boundary detection using a new multi-scale edgeness measure. Results We apply the novel CaudateCut method to the segmentation of the caudate nucleus to a new set of 39 pediatric attention-deficit/hyperactivity disorder (ADHD) patients and 40 control children, as well as to a public database of 18 subjects. We evaluate the quality of the segmentation using several volumetric and voxel by voxel measures. Our results show improved performance in terms of segmentation compared to state-of-the-art approaches, obtaining a mean overlap of 80.75%. Moreover, we present a quantitative volumetric analysis of caudate abnormalities in pediatric ADHD, the results of which show strong correlation with expert manual analysis. Conclusion CaudateCut generates segmentation results that are comparable to gold-standard segmentations and which are reliable in the analysis of differentiating neuroanatomical abnormalities between healthy controls and pediatric ADHD. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1475-925X | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ ISH2011 | Serial | 1882 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; I. Bardaji; Horst Bunke | ||||
| Title |
A Generic Framework for Median Graph Computation based on a Recursive Embedding Approach | Type | Journal Article | ||
| Year | 2011 | Publication | Computer Vision and Image Understanding | Abbreviated Journal | CVIU |
| Volume | 115 | Issue | 7 | Pages | 919-928 |
| Keywords | Median Graph, Graph Embedding, Graph Matching, Structural Pattern Recognition | ||||
| Abstract | The median graph has been shown to be a good choice to obtain a represen- tative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of this paper is the generalization of this previ- ous method, proposing a generic recursive procedure that permits to recover the graph corresponding to a point in the vector space, introducing only the amount of approximation inherent to the use of graph matching algorithms. In order to evaluate the proposed method, we compare it with the set me- dian and with the other state-of-the-art embedding-based methods for the median graph computation. The experiments are carried out using four dif- ferent databases (one semi-artificial and three containing real-world data). Results show that with the proposed approach we can obtain better medi- ans, in terms of the sum of distances to the training graphs, than with the previous existing methods. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | IAM @ iam @ FKV2011 | Serial | 1831 | ||
| Permanent link to this record | |||||
| Author | Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera | ||||
| Title |
A Genetic-based Subspace Analysis Method for Improving Error-Correcting Output Coding | Type | Journal Article | ||
| Year | 2013 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 46 | Issue | 10 | Pages | 2830-2839 |
| Keywords | Error Correcting Output Codes; Evolutionary computation; Multiclass classification; Feature subspace; Ensemble classification | ||||
| Abstract | Two key factors affecting the performance of Error Correcting Output Codes (ECOC) in multiclass classification problems are the independence of binary classifiers and the problem-dependent coding design. In this paper, we propose an evolutionary algorithm-based approach to the design of an application-dependent codematrix in the ECOC framework. The central idea of this work is to design a three-dimensional codematrix, where the third dimension is the feature space of the problem domain. In order to do that, we consider the feature space in the design process of the codematrix with the aim of improving the independence and accuracy of binary classifiers. The proposed method takes advantage of some basic concepts of ensemble classification, such as diversity of classifiers, and also benefits from the evolutionary approach for optimizing the three-dimensional codematrix, taking into account the problem domain. We provide a set of experimental results using a set of benchmark datasets from the UCI Machine Learning Repository, as well as two real multiclass Computer Vision problems. Both sets of experiments are conducted using two different base learners: Neural Networks and Decision Trees. The results show that the proposed method increases the classification accuracy in comparison with the state-of-the-art ECOC coding techniques. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ BGE2013a | Serial | 2247 | ||
| Permanent link to this record | |||||
| Author | Miguel Angel Bautista; Antonio Hernandez; Sergio Escalera; Laura Igual; Oriol Pujol; Josep Moya; Veronica Violant; Maria Teresa Anguera | ||||
| Title |
A Gesture Recognition System for Detecting Behavioral Patterns of ADHD | Type | Journal Article | ||
| Year | 2016 | Publication | IEEE Transactions on System, Man and Cybernetics, Part B | Abbreviated Journal | TSMCB |
| Volume | 46 | Issue | 1 | Pages | 136-147 |
| Keywords | Gesture Recognition; ADHD; Gaussian Mixture Models; Convex Hulls; Dynamic Time Warping; Multi-modal RGB-Depth data | ||||
| Abstract | We present an application of gesture recognition using an extension of Dynamic Time Warping (DTW) to recognize behavioural patterns of Attention Deficit Hyperactivity Disorder (ADHD). We propose an extension of DTW using one-class classifiers in order to be able to encode the variability of a gesture category, and thus, perform an alignment between a gesture sample and a gesture class. We model the set of gesture samples of a certain gesture category using either GMMs or an approximation of Convex Hulls. Thus, we add a theoretical contribution to classical warping path in DTW by including local modeling of intra-class gesture variability. This methodology is applied in a clinical context, detecting a group of ADHD behavioural patterns defined by experts in psychology/psychiatry, to provide support to clinicians in the diagnose procedure. The proposed methodology is tested on a novel multi-modal dataset (RGB plus Depth) of ADHD children recordings with behavioural patterns. We obtain satisfying results when compared to standard state-of-the-art approaches in the DTW context. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | HuPBA; MILAB; | Approved | no | ||
| Call Number | Admin @ si @ BHE2016 | Serial | 2566 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; Josep Llados; Alicia Fornes | ||||
| Title |
A graph-based approach for segmenting touching lines in historical handwritten documents | Type | Journal Article | ||
| Year | 2014 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 17 | Issue | 3 | Pages | 293-312 |
| Keywords | Text line segmentation; Handwritten documents; Document image processing; Historical document analysis | ||||
| Abstract | Text line segmentation in handwritten documents is an important task in the recognition of historical documents. Handwritten document images contain text lines with multiple orientations, touching and overlapping characters between consecutive text lines and different document structures, making line segmentation a difficult task. In this paper, we present a new approach for handwritten text line segmentation solving the problems of touching components, curvilinear text lines and horizontally overlapping components. The proposed algorithm formulates line segmentation as finding the central path in the area between two consecutive lines. This is solved as a graph traversal problem. A graph is constructed using the skeleton of the image. Then, a path-finding algorithm is used to find the optimum path between text lines. The proposed algorithm has been evaluated on a comprehensive dataset consisting of five databases: ICDAR2009, ICDAR2013, UMD, the George Washington and the Barcelona Marriages Database. The proposed method outperforms the state-of-the-art considering the different types and difficulties of the benchmarking data. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1433-2833 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.056; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FLF2014 | Serial | 2459 | ||
| Permanent link to this record | |||||
| Author | Josep Llados; Enric Marti | ||||
| Title |
A graph-edit algorithm for hand-drawn graphical document recognition and their automatic introduction into CAD systems | Type | Journal Article | ||
| Year | 1999 | Publication | Machine Graphics & Vision | Abbreviated Journal | |
| Volume | 8 | Issue | Pages | 195-211 | |
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG;IAM; | Approved | no | ||
| Call Number | IAM @ iam @ LIM1999 | Serial | 1568 | ||
| Permanent link to this record | |||||
| Author | Cristhian A. Aguilera-Carrasco; Luis Felipe Gonzalez-Böhme; Francisco Valdes; Francisco Javier Quitral Zapata; Bogdan Raducanu | ||||
| Title |
A Hand-Drawn Language for Human–Robot Collaboration in Wood Stereotomy | Type | Journal Article | ||
| Year | 2023 | Publication | IEEE Access | Abbreviated Journal | ACCESS |
| Volume | 11 | Issue | Pages | 100975 - 100985 | |
| Keywords | |||||
| Abstract | This study introduces a novel, hand-drawn language designed to foster human-robot collaboration in wood stereotomy, central to carpentry and joinery professions. Based on skilled carpenters’ line and symbol etchings on timber, this language signifies the location, geometry of woodworking joints, and timber placement within a framework. A proof-of-concept prototype has been developed, integrating object detectors, keypoint regression, and traditional computer vision techniques to interpret this language and enable an extensive repertoire of actions. Empirical data attests to the language’s efficacy, with the successful identification of a specific set of symbols on various wood species’ sawn surfaces, achieving a mean average precision (mAP) exceeding 90%. Concurrently, the system can accurately pinpoint critical positions that facilitate robotic comprehension of carpenter-indicated woodworking joint geometry. The positioning error, approximately 3 pixels, meets industry standards. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | LAMP | Approved | no | ||
| Call Number | Admin @ si @ AGV2023 | Serial | 3969 | ||
| Permanent link to this record | |||||
| Author | Michael Holte; Bhaskar Chakraborty; Jordi Gonzalez; Thomas B. Moeslund | ||||
| Title |
A Local 3D Motion Descriptor for Multi-View Human Action Recognition from 4D Spatio-Temporal Interest Points | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Journal of Selected Topics in Signal Processing | Abbreviated Journal | J-STSP |
| Volume | 6 | Issue | 5 | Pages | 553-565 |
| Keywords | |||||
| Abstract | In this paper, we address the problem of human action recognition in reconstructed 3-D data acquired by multi-camera systems. We contribute to this field by introducing a novel 3-D action recognition approach based on detection of 4-D (3-D space $+$ time) spatio-temporal interest points (STIPs) and local description of 3-D motion features. STIPs are detected in multi-view images and extended to 4-D using 3-D reconstructions of the actors and pixel-to-vertex correspondences of the multi-camera setup. Local 3-D motion descriptors, histogram of optical 3-D flow (HOF3D), are extracted from estimated 3-D optical flow in the neighborhood of each 4-D STIP and made view-invariant. The local HOF3D descriptors are divided using 3-D spatial pyramids to capture and improve the discrimination between arm- and leg-based actions. Based on these pyramids of HOF3D descriptors we build a bag-of-words (BoW) vocabulary of human actions, which is compressed and classified using agglomerative information bottleneck (AIB) and support vector machines (SVMs), respectively. Experiments on the publicly available i3DPost and IXMAS datasets show promising state-of-the-art results and validate the performance and view-invariance of the approach. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1932-4553 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ HCG2012 | Serial | 1994 | ||
| Permanent link to this record | |||||
| Author | Mariano Vazquez; Ruth Aris; Guillaume Hozeaux; R.Aubry; P.Villar;Jaume Garcia ; Debora Gil; Francesc Carreras | ||||
| Title |
A massively parallel computational electrophysiology model of the heart | Type | Journal Article | ||
| Year | 2011 | Publication | International Journal for Numerical Methods in Biomedical Engineering | Abbreviated Journal | IJNMBE |
| Volume | 27 | Issue | Pages | 1911-1929 | |
| Keywords | computational electrophysiology; parallelization; finite element methods | ||||
| Abstract | This paper presents a patient-sensitive simulation strategy capable of using the most efficient way the high-performance computational resources. The proposed strategy directly involves three different players: Computational Mechanics Scientists (CMS), Image Processing Scientists and Cardiologists, each one mastering its own expertise area within the project. This paper describes the general integrative scheme but focusing on the CMS side presents a massively parallel implementation of computational electrophysiology applied to cardiac tissue simulation. The paper covers different angles of the computational problem: equations, numerical issues, the algorithm and parallel implementation. The proposed methodology is illustrated with numerical simulations testing all the different possibilities, ranging from small domains up to very large ones. A key issue is the almost ideal scalability not only for large and complex problems but also for medium-size meshes. The explicit formulation is particularly well suited for solving this highly transient problems, with very short time-scale. | ||||
| Address | Swansea (UK) | ||||
| Corporate Author | John Wiley & Sons, Ltd. | Thesis | |||
| Publisher | John Wiley & Sons, Ltd. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ VAH2011 | Serial | 1198 | ||
| Permanent link to this record | |||||