| Home | << 1 2 3 4 5 6 7 8 9 10 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Tadashi Araki; Sumit K. Banchhor; Narendra D. Londhe; Nobutaka Ikeda; Petia Radeva; Devarshi Shukla; Luca Saba; Antonella Balestrieri; Andrew Nicolaides; Shoaib Shafique; John R. Laird; Jasjit S. Suri | ||||
| Title | Reliable and Accurate Calcium Volume Measurement in Coronary Artery Using Intravascular Ultrasound Videos | Type | Journal Article | ||
| Year | 2016 | Publication  |
Journal of Medical Systems | Abbreviated Journal | JMS |
| Volume | 40 | Issue | 3 | Pages | 51:1-51:20 |
| Keywords | Interventional cardiology; Atherosclerosis; Coronary arteries; IVUS; calcium volume; Soft computing; Performance Reliability; Accuracy | ||||
| Abstract | Quantitative assessment of calcified atherosclerotic volume within the coronary artery wall is vital for cardiac interventional procedures. The goal of this study is to automatically measure the calcium volume, given the borders of coronary vessel wall for all the frames of the intravascular ultrasound (IVUS) video. Three soft computing fuzzy classification techniques were adapted namely Fuzzy c-Means (FCM), K-means, and Hidden Markov Random Field (HMRF) for automated segmentation of calcium regions and volume computation. These methods were benchmarked against previously developed threshold-based method. IVUS image data sets (around 30,600 IVUS frames) from 15 patients were collected using 40 MHz IVUS catheter (Atlantis® SR Pro, Boston Scientific®, pullback speed of 0.5 mm/s). Calcium mean volume for FCM, K-means, HMRF and threshold-based method were 37.84 ± 17.38 mm3, 27.79 ± 10.94 mm3, 46.44 ± 19.13 mm3 and 35.92 ± 16.44 mm3 respectively. Cross-correlation, Jaccard Index and Dice Similarity were highest between FCM and threshold-based method: 0.99, 0.92 ± 0.02 and 0.95 + 0.02 respectively. Student’s t-test, z-test and Wilcoxon-test are also performed to demonstrate consistency, reliability and accuracy of the results. Given the vessel wall region, the system reliably and automatically measures the calcium volume in IVUS videos. Further, we validated our system against a trained expert using scoring: K-means showed the best performance with an accuracy of 92.80 %. Out procedure and protocol is along the line with method previously published clinically. | ||||
| 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 @ ABL2016 | Serial | 2729 | ||
| Permanent link to this record | |||||
| Author | Maria Oliver; G. Haro; Mariella Dimiccoli; B. Mazin; C. Ballester | ||||
| Title | A Computational Model for Amodal Completion | Type | Journal Article | ||
| Year | 2016 | Publication |
Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
| Volume | 56 | Issue | 3 | Pages | 511–534 |
| Keywords | Perception; visual completion; disocclusion; Bayesian model;relatability; Euler elastica | ||||
| Abstract | This paper presents a computational model to recover the most likely interpretation
of the 3D scene structure from a planar image, where some objects may occlude others. The estimated scene interpretation is obtained by integrating some global and local cues and provides both the complete disoccluded objects that form the scene and their ordering according to depth. Our method first computes several distal scenes which are compatible with the proximal planar image. To compute these different hypothesized scenes, we propose a perceptually inspired object disocclusion method, which works by minimizing the Euler's elastica as well as by incorporating the relatability of partially occluded contours and the convexity of the disoccluded objects. Then, to estimate the preferred scene we rely on a Bayesian model and define probabilities taking into account the global complexity of the objects in the hypothesized scenes as well as the effort of bringing these objects in their relative position in the planar image, which is also measured by an Euler's elastica-based quantity. The model is illustrated with numerical experiments on, both, synthetic and real images showing the ability of our model to reconstruct the occluded objects and the preferred perceptual order among them. We also present results on images of the Berkeley dataset with provided figure-ground ground-truth labeling. |
||||
| 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; 601.235 | Approved | no | ||
| Call Number | Admin @ si @ OHD2016b | Serial | 2745 | ||
| Permanent link to this record | |||||
| Author | Mariella Dimiccoli; Jean-Pascal Jacob; Lionel Moisan | ||||
| Title | Particle detection and tracking in fluorescence time-lapse imaging: a contrario approach | Type | Journal Article | ||
| Year | 2016 | Publication |
Journal of Machine Vision and Applications | Abbreviated Journal | MVAP |
| Volume | 27 | Issue | Pages | 511-527 | |
| Keywords | particle detection; particle tracking; a-contrario approach; time-lapse fluorescence imaging | ||||
| Abstract | In this work, we propose a probabilistic approach for the detection and the
tracking of particles on biological images. In presence of very noised and poor quality data, particles and trajectories can be characterized by an a-contrario model, that estimates the probability of observing the structures of interest in random data. This approach, first introduced in the modeling of human visual perception and then successfully applied in many image processing tasks, leads to algorithms that do not require a previous learning stage, nor a tedious parameter tuning and are very robust to noise. Comparative evaluations against a well established baseline show that the proposed approach outperforms the state of the art. |
||||
| 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 @ DJM2016 | Serial | 2735 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Vassilis Athitsos; Isabelle Guyon | ||||
| Title | Challenges in multimodal gesture recognition | Type | Journal Article | ||
| Year | 2016 | Publication |
Journal of Machine Learning Research | Abbreviated Journal | JMLR |
| Volume | 17 | Issue | Pages | 1-54 | |
| Keywords | Gesture Recognition; Time Series Analysis; Multimodal Data Analysis; Computer Vision; Pattern Recognition; Wearable sensors; Infrared Cameras; KinectTM | ||||
| Abstract | This paper surveys the state of the art on multimodal gesture recognition and introduces the JMLR special topic on gesture recognition 2011-2015. We began right at the start of the KinectTMrevolution when inexpensive infrared cameras providing image depth recordings became available. We published papers using this technology and other more conventional methods, including regular video cameras, to record data, thus providing a good overview of uses of machine learning and computer vision using multimodal data in this area of application. Notably, we organized a series of challenges and made available several datasets we recorded for that purpose, including tens of thousands
of videos, which are available to conduct further research. We also overview recent state of the art works on gesture recognition based on a proposed taxonomy for gesture recognition, discussing challenges and future lines of research. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | Zhuowen Tu | ||
| 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 @ EAG2016 | Serial | 2764 | ||
| Permanent link to this record | |||||
| Author | Youssef El Rhabi; Simon Loic; Brun Luc; Josep Llados; Felipe Lumbreras | ||||
| Title | Information Theoretic Rotationwise Robust Binary Descriptor Learning | Type | Conference Article | ||
| Year | 2016 | Publication |
Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) | Abbreviated Journal | |
| Volume | Issue | Pages | 368-378 | ||
| Keywords | |||||
| Abstract | In this paper, we propose a new data-driven approach for binary descriptor selection. In order to draw a clear analysis of common designs, we present a general information-theoretic selection paradigm. It encompasses several standard binary descriptor construction schemes, including a recent state-of-the-art one named BOLD. We pursue the same endeavor to increase the stability of the produced descriptors with respect to rotations. To achieve this goal, we have designed a novel offline selection criterion which is better adapted to the online matching procedure. The effectiveness of our approach is demonstrated on two standard datasets, where our descriptor is compared to BOLD and to several classical descriptors. In particular, it emerges that our approach can reproduce equivalent if not better performance as BOLD while relying on twice shorter descriptors. Such an improvement can be influential for real-time applications. | ||||
| Address | Mérida; Mexico; November 2016 | ||||
| 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 | S+SSPR | ||
| Notes | DAG; ADAS; 600.097; 600.086 | Approved | no | ||
| Call Number | Admin @ si @ RLL2016 | Serial | 2871 | ||
| Permanent link to this record | |||||
| Author | Sounak Dey; Anguelos Nicolaou; Josep Llados; Umapada Pal | ||||
| Title | Local Binary Pattern for Word Spotting in Handwritten Historical Document | Type | Conference Article | ||
| Year | 2016 | Publication |
Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) | Abbreviated Journal | |
| Volume | Issue | Pages | 574-583 | ||
| Keywords | Local binary patterns; Spatial sampling; Learning-free; Word spotting; Handwritten; Historical document analysis; Large-scale data | ||||
| Abstract | Digital libraries store images which can be highly degraded and to index this kind of images we resort to word spotting as our information retrieval system. Information retrieval for handwritten document images is more challenging due to the difficulties in complex layout analysis, large variations of writing styles, and degradation or low quality of historical manuscripts. This paper presents a simple innovative learning-free method for word spotting from large scale historical documents combining Local Binary Pattern (LBP) and spatial sampling. This method offers three advantages: firstly, it operates in completely learning free paradigm which is very different from unsupervised learning methods, secondly, the computational time is significantly low because of the LBP features, which are very fast to compute, and thirdly, the method can be used in scenarios where annotations are not available. Finally, we compare the results of our proposed retrieval method with other methods in the literature and we obtain the best results in the learning free paradigm. | ||||
| Address | Merida; Mexico; December 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | S+SSPR | ||
| Notes | DAG; 600.097; 602.006; 603.053 | Approved | no | ||
| Call Number | Admin @ si @ DNL2016 | Serial | 2876 | ||
| Permanent link to this record | |||||
| Author | Juan Ignacio Toledo; Sebastian Sudholt; Alicia Fornes; Jordi Cucurull; A. Fink; Josep Llados | ||||
| Title | Handwritten Word Image Categorization with Convolutional Neural Networks and Spatial Pyramid Pooling | Type | Conference Article | ||
| Year | 2016 | Publication |
Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) | Abbreviated Journal | |
| Volume | 10029 | Issue | Pages | 543-552 | |
| Keywords | Document image analysis; Word image categorization; Convolutional neural networks; Named entity detection | ||||
| Abstract | The extraction of relevant information from historical document collections is one of the key steps in order to make these documents available for access and searches. The usual approach combines transcription and grammars in order to extract semantically meaningful entities. In this paper, we describe a new method to obtain word categories directly from non-preprocessed handwritten word images. The method can be used to directly extract information, being an alternative to the transcription. Thus it can be used as a first step in any kind of syntactical analysis. The approach is based on Convolutional Neural Networks with a Spatial Pyramid Pooling layer to deal with the different shapes of the input images. We performed the experiments on a historical marriage record dataset, obtaining promising results. | ||||
| Address | Merida; Mexico; December 2016 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-319-49054-0 | Medium | ||
| Area | Expedition | Conference | S+SSPR | ||
| Notes | DAG; 600.097; 602.006 | Approved | no | ||
| Call Number | Admin @ si @ TSF2016 | Serial | 2877 | ||
| Permanent link to this record | |||||
| Author | Fernando Vilariño | ||||
| Title | Dissemination, creation and education from archives: Case study of the collection of Digitized Visual Poems from Joan Brossa Foundation | Type | Conference Article | ||
| Year | 2016 | Publication |
International Workshop on Poetry: Archives, Poetries and Receptions | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Barcelona; Spain; October 2016 | ||||
| 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 | POETRY | ||
| Notes | MV; 600.097;SIAI | Approved | no | ||
| Call Number | Admin @ si @Vil2016b | Serial | 2805 | ||
| 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 | Jiaolong Xu; Sebastian Ramos; David Vazquez; Antonio Lopez | ||||
| Title | Hierarchical Adaptive Structural SVM for Domain Adaptation | Type | Journal Article | ||
| Year | 2016 | Publication |
International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 119 | Issue | 2 | Pages | 159-178 |
| Keywords | Domain Adaptation; Pedestrian Detection | ||||
| Abstract | A key topic in classification is the accuracy loss produced when the data distribution in the training (source) domain differs from that in the testing (target) domain. This is being recognized as a very relevant problem for many
computer vision tasks such as image classification, object detection, and object category recognition. In this paper, we present a novel domain adaptation method that leverages multiple target domains (or sub-domains) in a hierarchical adaptation tree. The core idea is to exploit the commonalities and differences of the jointly considered target domains. Given the relevance of structural SVM (SSVM) classifiers, we apply our idea to the adaptive SSVM (A-SSVM), which only requires the target domain samples together with the existing source-domain classifier for performing the desired adaptation. Altogether, we term our proposal as hierarchical A-SSVM (HA-SSVM). As proof of concept we use HA-SSVM for pedestrian detection, object category recognition and face recognition. In the former we apply HA-SSVM to the deformable partbased model (DPM) while in the rest HA-SSVM is applied to multi-category classifiers. We will show how HA-SSVM is effective in increasing the detection/recognition accuracy with respect to adaptation strategies that ignore the structure of the target data. Since, the sub-domains of the target data are not always known a priori, we shown how HA-SSVM can incorporate sub-domain discovery for object category recognition. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.085; 600.082; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ XRV2016 | Serial | 2669 | ||
| Permanent link to this record | |||||
| Author | Antonio Hernandez; Sergio Escalera; Stan Sclaroff | ||||
| Title | Poselet-basedContextual Rescoring for Human Pose Estimation via Pictorial Structures | Type | Journal Article | ||
| Year | 2016 | Publication |
International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 118 | Issue | 1 | Pages | 49–64 |
| Keywords | Contextual rescoring; Poselets; Human pose estimation | ||||
| Abstract | In this paper we propose a contextual rescoring method for predicting the position of body parts in a human pose estimation framework. A set of poselets is incorporated in the model, and their detections are used to extract spatial and score-related features relative to other body part hypotheses. A method is proposed for the automatic discovery of a compact subset of poselets that covers the different poses in a set of validation images while maximizing precision. A rescoring mechanism is defined as a set-based boosting classifier that computes a new score for each body joint detection, given its relationship to detections of other body joints and mid-level parts in the image. This new score is incorporated in the pictorial structure model as an additional unary potential, following the recent work of Pishchulin et al. Experiments on two benchmarks show comparable results to Pishchulin et al. while reducing the size of the mid-level representation by an order of magnitude, reducing the execution time by 68 % accordingly. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB; | Approved | no | ||
| Call Number | Admin @ si @ HES2016 | Serial | 2719 | ||
| Permanent link to this record | |||||
| Author | Cristina Palmero; Albert Clapes; Chris Bahnsen; Andreas Møgelmose; Thomas B. Moeslund; Sergio Escalera | ||||
| Title | Multi-modal RGB-Depth-Thermal Human Body Segmentation | Type | Journal Article | ||
| Year | 2016 | Publication |
International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 118 | Issue | 2 | Pages | 217-239 |
| Keywords | Human body segmentation; RGB ; Depth Thermal | ||||
| Abstract | This work addresses the problem of human body segmentation from multi-modal visual cues as a first stage of automatic human behavior analysis. We propose a novel RGB–depth–thermal dataset along with a multi-modal segmentation baseline. The several modalities are registered using a calibration device and a registration algorithm. Our baseline extracts regions of interest using background subtraction, defines a partitioning of the foreground regions into cells, computes a set of image features on those cells using different state-of-the-art feature extractions, and models the distribution of the descriptors per cell using probabilistic models. A supervised learning algorithm then fuses the output likelihoods over cells in a stacked feature vector representation. The baseline, using Gaussian mixture models for the probabilistic modeling and Random Forest for the stacked learning, is superior to other state-of-the-art methods, obtaining an overlap above 75 % on the novel dataset when compared to the manually annotated ground-truth of human segmentations. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | 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 @ PCB2016 | Serial | 2767 | ||
| Permanent link to this record | |||||
| Author | Marc Masana; Joost Van de Weijer; Andrew Bagdanov | ||||
| Title | On-the-fly Network pruning for object detection | Type | Conference Article | ||
| Year | 2016 | Publication |
International conference on learning representations | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Object detection with deep neural networks is often performed by passing a few
thousand candidate bounding boxes through a deep neural network for each image. These bounding boxes are highly correlated since they originate from the same image. In this paper we investigate how to exploit feature occurrence at the image scale to prune the neural network which is subsequently applied to all bounding boxes. We show that removing units which have near-zero activation in the image allows us to significantly reduce the number of parameters in the network. Results on the PASCAL 2007 Object Detection Challenge demonstrate that up to 40% of units in some fully-connected layers can be entirely eliminated with little change in the detection result. |
||||
| Address | Puerto Rico; May 2016 | ||||
| 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 | ICLR | ||
| Notes | LAMP; 600.068; 600.106; 600.079 | Approved | no | ||
| Call Number | Admin @ si @MWB2016 | Serial | 2758 | ||
| Permanent link to this record | |||||
| Author | Marc Oliu; Ciprian Corneanu; Kamal Nasrollahi; Olegs Nikisins; Sergio Escalera; Yunlian Sun; Haiqing Li; Zhenan Sun; Thomas B. Moeslund; Modris Greitans | ||||
| Title | Improved RGB-D-T based Face Recognition | Type | Journal Article | ||
| Year | 2016 | Publication |
IET Biometrics | Abbreviated Journal | BIO |
| Volume | 5 | Issue | 4 | Pages | 297 - 303 |
| Keywords | |||||
| Abstract | Reliable facial recognition systems are of crucial importance in various applications from entertainment to security. Thanks to the deep-learning concepts introduced in the field, a significant improvement in the performance of the unimodal facial recognition systems has been observed in the recent years. At the same time a multimodal facial recognition is a promising approach. This study combines the latest successes in both directions by applying deep learning convolutional neural networks (CNN) to the multimodal RGB, depth, and thermal (RGB-D-T) based facial recognition problem outperforming previously published results. Furthermore, a late fusion of the CNN-based recognition block with various hand-crafted features (local binary patterns, histograms of oriented gradients, Haar-like rectangular features, histograms of Gabor ordinal measures) is introduced, demonstrating even better recognition performance on a benchmark RGB-D-T database. The obtained results in this study show that the classical engineered features and CNN-based features can complement each other for recognition purposes. | ||||
| 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 @ OCN2016 | Serial | 2854 | ||
| Permanent link to this record | |||||
| Author | Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera | ||||
| Title | Support Vector Machines with Time Series Distance Kernels for Action Classification | Type | Conference Article | ||
| Year | 2016 | Publication |
IEEE Winter Conference on Applications of Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | 1-7 | ||
| Keywords | |||||
| Abstract | Despite the outperformance of Support Vector Machine (SVM) on many practical classification problems, the algorithm is not directly applicable to multi-dimensional trajectories having different lengths. In this paper, a new class of SVM that is applicable to trajectory classification, such as action recognition, is developed by incorporating two efficient time-series distances measures into the kernel function.
Dynamic Time Warping and Longest Common Subsequence distance measures along with their derivatives are employed as the SVM kernel. In addition, the pairwise proximity learning strategy is utilized in order to make use of non-positive semi-definite kernels in the SVM formulation. The proposed method is employed for a challenging classification problem: action recognition by depth cameras using only skeleton data; and evaluated on three benchmark action datasets. Experimental results demonstrate the outperformance of our methodology compared to the state-ofthe-art on the considered datasets. |
||||
| Address | Lake Placid; NY (USA); March 2016 | ||||
| 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 | WACV | ||
| Notes | HuPBA;MILAB; | Approved | no | ||
| Call Number | Admin @ si @ BGE2016a | Serial | 2773 | ||
| Permanent link to this record | |||||