| Home | [191–200] << 201 202 203 204 205 206 207 208 209 210 >> [211–220] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Cristhian A. Aguilera-Carrasco; C. Aguilera; Angel Sappa | ||||
| Title | Melamine Faced Panels Defect Classification beyond the Visible Spectrum | Type | Journal Article | ||
| Year | 2018 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 18 | Issue | 11 | Pages | 1-10 |
| Keywords | industrial application; infrared; machine learning | ||||
| Abstract | In this work, we explore the use of images from different spectral bands to classify defects in melamine faced panels, which could appear through the production process. Through experimental evaluation, we evaluate the use of images from the visible (VS), near-infrared (NIR), and long wavelength infrared (LWIR), to classify the defects using a feature descriptor learning approach together with a support vector machine classifier. Two descriptors were evaluated, Extended Local Binary Patterns (E-LBP) and SURF using a Bag of Words (BoW) representation. The evaluation was carried on with an image set obtained during this work, which contained five different defect categories that currently occurs in the industry. Results show that using images from beyond the visual spectrum helps to improve classification performance in contrast with a single visible spectrum solution. | ||||
| 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 | MSIAU; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ AAS2018 | Serial | 3191 | ||
| Permanent link to this record | |||||
| Author | Razieh Rastgoo; Kourosh Kiani; Sergio Escalera | ||||
| Title | Multi-Modal Deep Hand Sign Language Recognition in Still Images Using Restricted Boltzmann Machine | Type | Journal Article | ||
| Year | 2018 | Publication | Entropy | Abbreviated Journal | ENTROPY |
| Volume | 20 | Issue | 11 | Pages | 809 |
| Keywords | hand sign language; deep learning; restricted Boltzmann machine (RBM); multi-modal; profoundly deaf; noisy image | ||||
| Abstract | In this paper, a deep learning approach, Restricted Boltzmann Machine (RBM), is used to perform automatic hand sign language recognition from visual data. We evaluate how RBM, as a deep generative model, is capable of generating the distribution of the input data for an enhanced recognition of unseen data. Two modalities, RGB and Depth, are considered in the model input in three forms: original image, cropped image, and noisy cropped image. Five crops of the input image are used and the hand of these cropped images are detected using Convolutional Neural Network (CNN). After that, three types of the detected hand images are generated for each modality and input to RBMs. The outputs of the RBMs for two modalities are fused in another RBM in order to recognize the output sign label of the input image. The proposed multi-modal model is trained on all and part of the American alphabet and digits of four publicly available datasets. We also evaluate the robustness of the proposal against noise. Experimental results show that the proposed multi-modal model, using crops and the RBM fusing methodology, achieves state-of-the-art results on Massey University Gesture Dataset 2012, American Sign Language (ASL). and Fingerspelling Dataset from the University of Surrey’s Center for Vision, Speech and Signal Processing, NYU, and ASL Fingerspelling A datasets. | ||||
| 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; no proj | Approved | no | ||
| Call Number | Admin @ si @ RKE2018 | Serial | 3198 | ||
| Permanent link to this record | |||||
| Author | Md. Mostafa Kamal Sarker; Hatem A. Rashwan; Farhan Akram; Vivek Kumar Singh; Syeda Furruka Banu; Forhad U H Chowdhury; Kabir Ahmed Choudhury; Sylvie Chambon; Petia Radeva; Domenec Puig; Mohamed Abdel-Nasser | ||||
| Title | SLSNet: Skin lesion segmentation using a lightweight generative adversarial network | Type | Journal Article | ||
| Year | 2021 | Publication | Expert Systems With Applications | Abbreviated Journal | ESWA |
| Volume | 183 | Issue | Pages | 115433 | |
| Keywords | |||||
| Abstract | The determination of precise skin lesion boundaries in dermoscopic images using automated methods faces many challenges, most importantly, the presence of hair, inconspicuous lesion edges and low contrast in dermoscopic images, and variability in the color, texture and shapes of skin lesions. Existing deep learning-based skin lesion segmentation algorithms are expensive in terms of computational time and memory. Consequently, running such segmentation algorithms requires a powerful GPU and high bandwidth memory, which are not available in dermoscopy devices. Thus, this article aims to achieve precise skin lesion segmentation with minimum resources: a lightweight, efficient generative adversarial network (GAN) model called SLSNet, which combines 1-D kernel factorized networks, position and channel attention, and multiscale aggregation mechanisms with a GAN model. The 1-D kernel factorized network reduces the computational cost of 2D filtering. The position and channel attention modules enhance the discriminative ability between the lesion and non-lesion feature representations in spatial and channel dimensions, respectively. A multiscale block is also used to aggregate the coarse-to-fine features of input skin images and reduce the effect of the artifacts. SLSNet is evaluated on two publicly available datasets: ISBI 2017 and the ISIC 2018. Although SLSNet has only 2.35 million parameters, the experimental results demonstrate that it achieves segmentation results on a par with the state-of-the-art skin lesion segmentation methods with an accuracy of 97.61%, and Dice and Jaccard similarity coefficients of 90.63% and 81.98%, respectively. SLSNet can run at more than 110 frames per second (FPS) in a single GTX1080Ti GPU, which is faster than well-known deep learning-based image segmentation models, such as FCN. Therefore, SLSNet can be used for practical dermoscopic applications. | ||||
| 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; no proj | Approved | no | ||
| Call Number | Admin @ si @ SRA2021 | Serial | 3633 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Markus Weimer; Mikhail Burtsev; Valentin Malykh; Varvara Logacheva; Ryan Lowe; Iulian Vlad Serban; Yoshua Bengio; Alexander Rudnicky; Alan W. Black; Shrimai Prabhumoye; Łukasz Kidzinski; Mohanty Sharada; Carmichael Ong; Jennifer Hicks; Sergey Levine; Marcel Salathe; Scott Delp; Iker Huerga; Alexander Grigorenko; Leifur Thorbergsson; Anasuya Das; Kyla Nemitz; Jenna Sandker; Stephen King; Alexander S. Ecker; Leon A. Gatys; Matthias Bethge; Jordan Boyd Graber; Shi Feng; Pedro Rodriguez; Mohit Iyyer; He He; Hal Daume III; Sean McGregor; Amir Banifatemi; Alexey Kurakin; Ian Goodfellow; Samy Bengio | ||||
| Title | Introduction to NIPS 2017 Competition Track | Type | Book Chapter | ||
| Year | 2018 | Publication | The NIPS ’17 Competition: Building Intelligent Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 1-23 | ||
| Keywords | |||||
| Abstract | Competitions have become a popular tool in the data science community to solve hard problems, assess the state of the art and spur new research directions. Companies like Kaggle and open source platforms like Codalab connect people with data and a data science problem to those with the skills and means to solve it. Hence, the question arises: What, if anything, could NIPS add to this rich ecosystem?
In 2017, we embarked to find out. We attracted 23 potential competitions, of which we selected five to be NIPS 2017 competitions. Our final selection features competitions advancing the state of the art in other sciences such as “Classifying Clinically Actionable Genetic Mutations” and “Learning to Run”. Others, like “The Conversational Intelligence Challenge” and “Adversarial Attacks and Defences” generated new data sets that we expect to impact the progress in their respective communities for years to come. And “Human-Computer Question Answering Competition” showed us just how far we as a field have come in ability and efficiency since the break-through performance of Watson in Jeopardy. Two additional competitions, DeepArt and AI XPRIZE Milestions, were also associated to the NIPS 2017 competition track, whose results are also presented within this chapter. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer | Place of Publication | Editor | Sergio Escalera; Markus Weimer | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-319-94042-7 | Medium | ||
| Area | Expedition | Conference |
|||
| Notes | HUPBA; no proj | Approved | no | ||
| Call Number | Admin @ si @ EWB2018 | Serial | 3200 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Lutz Goldmann; Oriol Ramos Terrades; Diede Rusticus; Alicia Fornes; Josep Llados | ||||
| Title | Table detection in business document images by message passing networks | Type | Journal Article | ||
| Year | 2022 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 127 | Issue | Pages | 108641 | |
| Keywords | |||||
| Abstract | Tabular structures in business documents offer a complementary dimension to the raw textual data. For instance, there is information about the relationships among pieces of information. Nowadays, digital mailroom applications have become a key service for workflow automation. Therefore, the detection and interpretation of tables is crucial. With the recent advances in information extraction, table detection and recognition has gained interest in document image analysis, in particular, with the absence of rule lines and unknown information about rows and columns. However, business documents usually contain sensitive contents limiting the amount of public benchmarking datasets. In this paper, we propose a graph-based approach for detecting tables in document images which do not require the raw content of the document. Hence, the sensitive content can be previously removed and, instead of using the raw image or textual content, we propose a purely structural approach to keep sensitive data anonymous. Our framework uses graph neural networks (GNNs) to describe the local repetitive structures that constitute a table. In particular, our main application domain are business documents. We have carefully validated our approach in two invoice datasets and a modern document benchmark. Our experiments demonstrate that tables can be detected by purely structural approaches. | ||||
| Address | July 2022 | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
|||
| Notes | DAG; 600.162; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RGR2022 | Serial | 3729 | ||
| Permanent link to this record | |||||
| Author | Meysam Madadi; Sergio Escalera; Alex Carruesco Llorens; Carlos Andujar; Xavier Baro; Jordi Gonzalez | ||||
| Title | Top-down model fitting for hand pose recovery in sequences of depth images | Type | Journal Article | ||
| Year | 2018 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 79 | Issue | Pages | 63-75 | |
| Keywords | |||||
| Abstract | State-of-the-art approaches on hand pose estimation from depth images have reported promising results under quite controlled considerations. In this paper we propose a two-step pipeline for recovering the hand pose from a sequence of depth images. The pipeline has been designed to deal with images taken from any viewpoint and exhibiting a high degree of finger occlusion. In a first step we initialize the hand pose using a part-based model, fitting a set of hand components in the depth images. In a second step we consider temporal data and estimate the parameters of a trained bilinear model consisting of shape and trajectory bases. We evaluate our approach on a new created synthetic hand dataset along with NYU and MSRA real datasets. Results demonstrate that the proposed method outperforms the most recent pose recovering approaches, including those based on CNNs. | ||||
| 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; 600.098 | Approved | no | ||
| Call Number | Admin @ si @ MEC2018 | Serial | 3203 | ||
| Permanent link to this record | |||||
| Author | Giuseppe Pezzano; Oliver Diaz; Vicent Ribas Ripoll; Petia Radeva | ||||
| Title | CoLe-CNN+: Context learning – Convolutional neural network for COVID-19-Ground-Glass-Opacities detection and segmentation | Type | Journal Article | ||
| Year | 2021 | Publication | Computers in Biology and Medicine | Abbreviated Journal | CBM |
| Volume | 136 | Issue | Pages | 104689 | |
| Keywords | |||||
| Abstract | The most common tool for population-wide COVID-19 identification is the Reverse Transcription-Polymerase Chain Reaction test that detects the presence of the virus in the throat (or sputum) in swab samples. This test has a sensitivity between 59% and 71%. However, this test does not provide precise information regarding the extension of the pulmonary infection. Moreover, it has been proven that through the reading of a computed tomography (CT) scan, a clinician can provide a more complete perspective of the severity of the disease. Therefore, we propose a comprehensive system for fully-automated COVID-19 detection and lesion segmentation from CT scans, powered by deep learning strategies to support decision-making process for the diagnosis of COVID-19. | ||||
| 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; no menciona | Approved | no | ||
| Call Number | Admin @ si @ PDR2021 | Serial | 3635 | ||
| Permanent link to this record | |||||
| Author | Yagmur Gucluturk; Umut Guclu; Xavier Baro; Hugo Jair Escalante; Isabelle Guyon; Sergio Escalera; Marcel A. J. van Gerven; Rob van Lier | ||||
| Title | Multimodal First Impression Analysis with Deep Residual Networks | Type | Journal Article | ||
| Year | 2018 | Publication | IEEE Transactions on Affective Computing | Abbreviated Journal | TAC |
| Volume | 8 | Issue | 3 | Pages | 316-329 |
| Keywords | |||||
| Abstract | People form first impressions about the personalities of unfamiliar individuals even after very brief interactions with them. In this study we present and evaluate several models that mimic this automatic social behavior. Specifically, we present several models trained on a large dataset of short YouTube video blog posts for predicting apparent Big Five personality traits of people and whether they seem suitable to be recommended to a job interview. Along with presenting our audiovisual approach and results that won the third place in the ChaLearn First Impressions Challenge, we investigate modeling in different modalities including audio only, visual only, language only, audiovisual, and combination of audiovisual and language. Our results demonstrate that the best performance could be obtained using a fusion of all data modalities. Finally, in order to promote explainability in machine learning and to provide an example for the upcoming ChaLearn challenges, we present a simple approach for explaining the predictions for job interview recommendations | ||||
| 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; no proj | Approved | no | ||
| Call Number | Admin @ si @ GGB2018 | Serial | 3210 | ||
| Permanent link to this record | |||||
| Author | Rain Eric Haamer; Eka Rusadze; Iiris Lusi; Tauseef Ahmed; Sergio Escalera; Gholamreza Anbarjafari | ||||
| Title | Review on Emotion Recognition Databases | Type | Book Chapter | ||
| Year | 2018 | Publication | Human-Robot Interaction: Theory and Application | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | emotion; computer vision; databases | ||||
| Abstract | Over the past few decades human-computer interaction has become more important in our daily lives and research has developed in many directions: memory research, depression detection, and behavioural deficiency detection, lie detection, (hidden) emotion recognition etc. Because of that, the number of generic emotion and face databases or those tailored to specific needs have grown immensely large. Thus, a comprehensive yet compact guide is needed to help researchers find the most suitable database and understand what types of databases already exist. In this paper, different elicitation methods are discussed and the databases are primarily organized into neat and informative tables based on the format. | ||||
| 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 | 978-1-78923-316-2 | Medium | ||
| Area | Expedition | Conference |
|||
| Notes | HUPBA; 602.133 | Approved | no | ||
| Call Number | Admin @ si @ HRL2018 | Serial | 3212 | ||
| Permanent link to this record | |||||
| Author | Reza Azad; Maryam Asadi-Aghbolaghi; Shohreh Kasaei; Sergio Escalera | ||||
| Title | Dynamic 3D Hand Gesture Recognition by Learning Weighted Depth Motion Maps | Type | Journal Article | ||
| Year | 2019 | Publication | IEEE Transactions on Circuits and Systems for Video Technology | Abbreviated Journal | TCSVT |
| Volume | 29 | Issue | 6 | Pages | 1729-1740 |
| Keywords | Hand gesture recognition; Multilevel temporal sampling; Weighted depth motion map; Spatio-temporal description; VLAD encoding | ||||
| Abstract | Hand gesture recognition from sequences of depth maps is a challenging computer vision task because of the low inter-class and high intra-class variability, different execution rates of each gesture, and the high articulated nature of human hand. In this paper, a multilevel temporal sampling (MTS) method is first proposed that is based on the motion energy of key-frames of depth sequences. As a result, long, middle, and short sequences are generated that contain the relevant gesture information. The MTS results in increasing the intra-class similarity while raising the inter-class dissimilarities. The weighted depth motion map (WDMM) is then proposed to extract the spatio-temporal information from generated summarized sequences by an accumulated weighted absolute difference of consecutive frames. The histogram of gradient (HOG) and local binary pattern (LBP) are exploited to extract features from WDMM. The obtained results define the current state-of-the-art on three public benchmark datasets of: MSR Gesture 3D, SKIG, and MSR Action 3D, for 3D hand gesture recognition. We also achieve competitive results on NTU action dataset. | ||||
| Address | June 2019, | ||||
| 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; no proj | Approved | no | ||
| Call Number | Admin @ si @ AAK2018 | Serial | 3213 | ||
| Permanent link to this record | |||||
| Author | Ester Fornells; Manuel De Armas; Maria Teresa Anguera; Sergio Escalera; Marcos Antonio Catalán; Josep Moya | ||||
| Title | Desarrollo del proyecto del Consell Comarcal del Baix Llobregat “Buen Trato a las personas mayores y aquellas en situación de fragilidad con sufrimiento emocional: Hacia un envejecimiento saludable” | Type | Journal | ||
| Year | 2018 | Publication | Informaciones Psiquiatricas | Abbreviated Journal | |
| Volume | 232 | Issue | Pages | 47-59 | |
| 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 | 0210-7279 | ISBN | Medium | ||
| Area | Expedition | Conference |
|||
| Notes | HUPBA; no menciona | Approved | no | ||
| Call Number | Admin @ si @ FAA2018 | Serial | 3214 | ||
| Permanent link to this record | |||||
| Author | Suman Ghosh | ||||
| Title | Word Spotting and Recognition in Images from Heterogeneous Sources A | Type | Book Whole | ||
| Year | 2018 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Text is the most common way of information sharing from ages. With recent development of personal images databases and handwritten historic manuscripts the demand for algorithms to make these databases accessible for browsing and indexing are in rise. Enabling search or understanding large collection of manuscripts or image databases needs fast and robust methods. Researchers have found different ways to represent cropped words for understanding and matching, which works well when words are already segmented. However there is no trivial way to extend these for non-segmented documents. In this thesis we explore different methods for text retrieval and recognition from unsegmented document and scene images. Two different ways of representation exist in literature, one uses a fixed length representation learned from cropped words and another a sequence of features of variable length. Throughout this thesis, we have studied both these representation for their suitability in segmentation free understanding of text. In the first part we are focused on segmentation free word spotting using a fixed length representation. We extended the use of the successful PHOC (Pyramidal Histogram of Character) representation to segmentation free retrieval. In the second part of the thesis, we explore sequence based features and finally, we propose a unified solution where the same framework can generate both kind of representations. | ||||
| Address | November 2018 | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Ernest Valveny | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-948531-0-4 | Medium | ||
| Area | Expedition | Conference |
|||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ Gho2018 | Serial | 3217 | ||
| Permanent link to this record | |||||
| Author | Gholamreza Anbarjafari; Sergio Escalera | ||||
| Title | Human-Robot Interaction: Theory and Application | Type | Book Whole | ||
| Year | 2018 | Publication | Human-Robot Interaction: Theory and Application | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| 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 | 978-1-78923-316-2 | Medium | ||
| Area | Expedition | Conference |
|||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ AnE2018 | Serial | 3216 | ||
| Permanent link to this record | |||||
| Author | Mikhail Mozerov; Joost Van de Weijer | ||||
| Title | One-view occlusion detection for stereo matching with a fully connected CRF model | Type | Journal Article | ||
| Year | 2019 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 28 | Issue | 6 | Pages | 2936-2947 |
| Keywords | Stereo matching; energy minimization; fully connected MRF model; geodesic distance filter | ||||
| Abstract | In this paper, we extend the standard belief propagation (BP) sequential technique proposed in the tree-reweighted sequential method [15] to the fully connected CRF models with the geodesic distance affinity. The proposed method has been applied to the stereo matching problem. Also a new approach to the BP marginal solution is proposed that we call one-view occlusion detection (OVOD). In contrast to the standard winner takes all (WTA) estimation, the proposed OVOD solution allows to find occluded regions in the disparity map and simultaneously improve the matching result. As a result we can perform only
one energy minimization process and avoid the cost calculation for the second view and the left-right check procedure. We show that the OVOD approach considerably improves results for cost augmentation and energy minimization techniques in comparison with the standard one-view affinity space implementation. We apply our method to the Middlebury data set and reach state-ofthe-art especially for median, average and mean squared error metrics. |
||||
| 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; 600.098; 600.109; 602.133; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ MoW2019 | Serial | 3221 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Hichem Sahbi | ||||
| Title | Stochastic Graphlet Embedding | Type | Journal Article | ||
| Year | 2018 | Publication | IEEE Transactions on Neural Networks and Learning Systems | Abbreviated Journal | TNNLS |
| Volume | Issue | Pages | 1-14 | ||
| Keywords | Stochastic graphlets; Graph embedding; Graph classification; Graph hashing; Betweenness centrality | ||||
| Abstract | Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments,
etc.) and edges characterize the relationships between these primitives. However, these non-vectorial graph data cannot be straightforwardly plugged into off-the-shelf machine learning algorithms without a preliminary step of – explicit/implicit –graph vectorization and embedding. This embedding process should be resilient to intra-class graph variations while being highly discriminant. In this paper, we propose a novel high-order stochastic graphlet embedding (SGE) that maps graphs into vector spaces. Our main contribution includes a new stochastic search procedure that efficiently parses a given graph and extracts/samples unlimitedly high-order graphlets. We consider these graphlets, with increasing orders, to model local primitives as well as their increasingly complex interactions. In order to build our graph representation, we measure the distribution of these graphlets into a given graph, using particular hash functions that efficiently assign sampled graphlets into isomorphic sets with a very low probability of collision. When combined with maximum margin classifiers, these graphlet-based representations have positive impact on the performance of pattern comparison and recognition as corroborated through extensive experiments using standard benchmark databases. |
||||
| 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; 602.167; 602.168; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DuS2018 | Serial | 3225 | ||
| Permanent link to this record | |||||