| Home | [121–130] << 131 132 133 134 135 136 137 138 139 140 >> [141–150] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Huamin Ren; Nattiya Kanhabua; Andreas Mogelmose; Weifeng Liu; Kaustubh Kulkarni; Sergio Escalera; Xavier Baro; Thomas B. Moeslund | ||||
| Title | Back-dropout Transfer Learning for Action Recognition | Type | Journal Article | ||
| Year | 2018 | Publication | IET Computer Vision | Abbreviated Journal | IETCV |
| Volume | 12 | Issue | 4 | Pages | 484-491 |
| Keywords | Learning (artificial intelligence); Pattern Recognition | ||||
| Abstract | Transfer learning aims at adapting a model learned from source dataset to target dataset. It is a beneficial approach especially when annotating on the target dataset is expensive or infeasible. Transfer learning has demonstrated its powerful learning capabilities in various vision tasks. Despite transfer learning being a promising approach, it is still an open question how to adapt the model learned from the source dataset to the target dataset. One big challenge is to prevent the impact of category bias on classification performance. Dataset bias exists when two images from the same category, but from different datasets, are not classified as the same. To address this problem, a transfer learning algorithm has been proposed, called negative back-dropout transfer learning (NB-TL), which utilizes images that have been misclassified and further performs back-dropout strategy on them to penalize errors. Experimental results demonstrate the effectiveness of the proposed algorithm. In particular, the authors evaluate the performance of the proposed NB-TL algorithm on UCF 101 action recognition dataset, achieving 88.9% recognition rate. | ||||
| 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 @ RKM2018 | Serial | 3071 | ||
| Permanent link to this record | |||||
| Author | Mark Philip Philipsen; Jacob Velling Dueholm; Anders Jorgensen; Sergio Escalera; Thomas B. Moeslund | ||||
| Title | Organ Segmentation in Poultry Viscera Using RGB-D | Type | Journal Article | ||
| Year | 2018 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 18 | Issue | 1 | Pages | 117 |
| Keywords | semantic segmentation; RGB-D; random forest; conditional random field; 2D; 3D; CNN | ||||
| Abstract | We present a pattern recognition framework for semantic segmentation of visual structures, that is, multi-class labelling at pixel level, and apply it to the task of segmenting organs in the eviscerated viscera from slaughtered poultry in RGB-D images. This is a step towards replacing the current strenuous manual inspection at poultry processing plants. Features are extracted from feature maps such as activation maps from a convolutional neural network (CNN). A random forest classifier assigns class probabilities, which are further refined by utilizing context in a conditional random field. The presented method is compatible with both 2D and 3D features, which allows us to explore the value of adding 3D and CNN-derived features. The dataset consists of 604 RGB-D images showing 151 unique sets of eviscerated viscera from four different perspectives. A mean Jaccard index of 78.11% is achieved across the four classes of organs by using features derived from 2D, 3D and a CNN, compared to 74.28% using only basic 2D image features. | ||||
| 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 @ PVJ2018 | Serial | 3072 | ||
| Permanent link to this record | |||||
| Author | Raul Gomez; Baoguang Shi; Lluis Gomez; Lukas Numann; Andreas Veit; Jiri Matas; Serge Belongie; Dimosthenis Karatzas | ||||
| Title | ICDAR2017 Robust Reading Challenge on COCO-Text | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Kyoto; Japan; November 2017 | ||||
| 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 | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ GSG2017 | Serial | 3076 | ||
| Permanent link to this record | |||||
| Author | Masakazu Iwamura; Naoyuki Morimoto; Keishi Tainaka; Dena Bazazian; Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | ICDAR2017 Robust Reading Challenge on Omnidirectional Video | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Results of ICDAR 2017 Robust Reading Challenge on Omnidirectional Video are presented. This competition uses Downtown Osaka Scene Text (DOST) Dataset that was captured in Osaka, Japan with an omnidirectional camera. Hence, it consists of sequential images (videos) of different view angles. Regarding the sequential images as videos (video mode), two tasks of localisation and end-to-end recognition are prepared. Regarding them as a set of still images (still image mode), three tasks of localisation, cropped word recognition and end-to-end recognition are prepared. As the dataset has been captured in Japan, the dataset contains Japanese text but also include text consisting of alphanumeric characters (Latin text). Hence, a submitted result for each task is evaluated in three ways: using Japanese only ground truth (GT), using Latin only GT and using combined GTs of both. Finally, by the submission deadline, we have received two submissions in the text localisation task of the still image mode. We intend to continue the competition in the open mode. Expecting further submissions, in this report we provide baseline results in all the tasks in addition to the submissions from the community. | ||||
| 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 | ICDAR | ||
| Notes | DAG; 600.084; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ IMT2017 | Serial | 3077 | ||
| Permanent link to this record | |||||
| Author | Laura Lopez-Fuentes; Claudio Rossi; Harald Skinnemoen | ||||
| Title | River segmentation for flood monitoring | Type | Conference Article | ||
| Year | 2017 | Publication | Data Science for Emergency Management at Big Data 2017 | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Floods are major natural disasters which cause deaths and material damages every year. Monitoring these events is crucial in order to reduce both the affected people and the economic losses. In this work we train and test three different Deep Learning segmentation algorithms to estimate the water area from river images, and compare their performances. We discuss the implementation of a novel data chain aimed to monitor river water levels by automatically process data collected from surveillance cameras, and to give alerts in case of high increases of the water level or flooding. We also create and openly publish the first image dataset for river water segmentation. | ||||
| 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.084; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ LRS2017 | Serial | 3078 | ||
| Permanent link to this record | |||||
| Author | Suman Ghosh; Ernest Valveny | ||||
| Title | R-PHOC: Segmentation-Free Word Spotting using CNN | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Convolutional neural network; Image segmentation; Artificial neural network; Nearest neighbor search | ||||
| Abstract | arXiv:1707.01294
This paper proposes a region based convolutional neural network for segmentation-free word spotting. Our network takes as input an image and a set of word candidate bound- ing boxes and embeds all bounding boxes into an embedding space, where word spotting can be casted as a simple nearest neighbour search between the query representation and each of the candidate bounding boxes. We make use of PHOC embedding as it has previously achieved significant success in segmentation- based word spotting. Word candidates are generated using a simple procedure based on grouping connected components using some spatial constraints. Experiments show that R-PHOC which operates on images directly can improve the current state-of- the-art in the standard GW dataset and performs as good as PHOCNET in some cases designed for segmentation based word spotting. |
||||
| 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 | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ GhV2017a | Serial | 3079 | ||
| Permanent link to this record | |||||
| Author | Suman Ghosh; Ernest Valveny | ||||
| Title | Visual attention models for scene text recognition | Type | Conference Article | ||
| Year | 2017 | Publication | 14th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | arXiv:1706.01487
In this paper we propose an approach to lexicon-free recognition of text in scene images. Our approach relies on a LSTM-based soft visual attention model learned from convolutional features. A set of feature vectors are derived from an intermediate convolutional layer corresponding to different areas of the image. This permits encoding of spatial information into the image representation. In this way, the framework is able to learn how to selectively focus on different parts of the image. At every time step the recognizer emits one character using a weighted combination of the convolutional feature vectors according to the learned attention model. Training can be done end-to-end using only word level annotations. In addition, we show that modifying the beam search algorithm by integrating an explicit language model leads to significantly better recognition results. We validate the performance of our approach on standard SVT and ICDAR'03 scene text datasets, showing state-of-the-art performance in unconstrained text recognition. |
||||
| 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 | ICDAR | ||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ GhV2017b | Serial | 3080 | ||
| Permanent link to this record | |||||
| Author | Konstantia Georgouli; Katerine Diaz; Jesus Martinez del Rincon; Anastasios Koidis | ||||
| Title | Building generic, easily-updatable chemometric models with harmonisation and augmentation features: The case of FTIR vegetable oils classification | Type | Conference Article | ||
| Year | 2017 | Publication | 3rd Ιnternational Conference Metrology Promoting Standardization and Harmonization in Food and Nutrition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Thessaloniki; Greece; October 2017 | ||||
| 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 | IMEKOFOODS | ||
| Notes | ADAS; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ GDM2017 | Serial | 3081 | ||
| Permanent link to this record | |||||
| Author | Sounak Dey; Anjan Dutta; Juan Ignacio Toledo; Suman Ghosh; Josep Llados; Umapada Pal | ||||
| Title | SigNet: Convolutional Siamese Network for Writer Independent Offline Signature Verification | Type | Miscellaneous | ||
| Year | 2018 | Publication | Arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Offline signature verification is one of the most challenging tasks in biometrics and document forensics. Unlike other verification problems, it needs to model minute but critical details between genuine and forged signatures, because a skilled falsification might often resembles the real signature with small deformation. This verification task is even harder in writer independent scenarios which is undeniably fiscal for realistic cases. In this paper, we model an offline writer independent signature verification task with a convolutional Siamese network. Siamese networks are twin networks with shared weights, which can be trained to learn a feature space where similar observations are placed in proximity. This is achieved by exposing the network to a pair of similar and dissimilar observations and minimizing the Euclidean distance between similar pairs while simultaneously maximizing it between dissimilar pairs. Experiments conducted on cross-domain datasets emphasize the capability of our network to model forgery in different languages (scripts) and handwriting styles. Moreover, our designed Siamese network, named SigNet, exceeds the state-of-the-art results on most of the benchmark signature datasets, which paves the way for further research in this direction. | ||||
| 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.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DDT2018 | Serial | 3085 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; Oriol Ramos Terrades; Josep Llados | ||||
| Title | Ontology-Based Understanding of Architectural Drawings | Type | Book Chapter | ||
| Year | 2017 | Publication | International Workshop on Graphics Recognition. GREC 2015.Graphic Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume | 9657 | Issue | Pages | 75-85 | |
| Keywords | Graphics recognition; Floor plan analysi; Domain ontology | ||||
| Abstract | In this paper we present a knowledge base of architectural documents aiming at improving existing methods of floor plan classification and understanding. It consists of an ontological definition of the domain and the inclusion of real instances coming from both, automatically interpreted and manually labeled documents. The knowledge base has proven to be an effective tool to structure our knowledge and to easily maintain and upgrade it. Moreover, it is an appropriate means to automatically check the consistency of relational data and a convenient complement of hard-coded knowledge interpretation systems. | ||||
| Address | |||||
| 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 | |||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ HRL2017 | Serial | 3086 | ||
| Permanent link to this record | |||||
| Author | Dena Bazazian; Dimosthenis Karatzas; Andrew Bagdanov | ||||
| Title | Soft-PHOC Descriptor for End-to-End Word Spotting in Egocentric Scene Images | Type | Conference Article | ||
| Year | 2018 | Publication | International Workshop on Egocentric Perception, Interaction and Computing at ECCV | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Word spotting in natural scene images has many applications in scene understanding and visual assistance. We propose Soft-PHOC, an intermediate representation of images based on character probability maps. Our representation extends the concept of the Pyramidal Histogram Of Characters (PHOC) by exploiting Fully Convolutional Networks to derive a pixel-wise mapping of the character distribution within candidate word regions. We show how to use our descriptors for word spotting tasks in egocentric camera streams through an efficient text line proposal algorithm. This is based on the Hough Transform over character attribute maps followed by scoring using Dynamic Time Warping (DTW). We evaluate our results on ICDAR 2015 Challenge 4 dataset of incidental scene text captured by an egocentric camera. | ||||
| Address | Munich; Alemanya; September 2018 | ||||
| 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 | ECCVW | ||
| Notes | DAG; 600.129; 600.121; | Approved | no | ||
| Call Number | Admin @ si @ BKB2018b | Serial | 3174 | ||
| Permanent link to this record | |||||
| Author | Lu Yu; Lichao Zhang; Joost Van de Weijer; Fahad Shahbaz Khan; Yongmei Cheng; C. Alejandro Parraga | ||||
| Title | Beyond Eleven Color Names for Image Understanding | Type | Journal Article | ||
| Year | 2018 | Publication | Machine Vision and Applications | Abbreviated Journal | MVAP |
| Volume | 29 | Issue | 2 | Pages | 361-373 |
| Keywords | Color name; Discriminative descriptors; Image classification; Re-identification; Tracking | ||||
| Abstract | Color description is one of the fundamental problems of image understanding. One of the popular ways to represent colors is by means of color names. Most existing work on color names focuses on only the eleven basic color terms of the English language. This could be limiting the discriminative power of these representations, and representations based on more color names are expected to perform better. However, there exists no clear strategy to choose additional color names. We collect a dataset of 28 additional color names. To ensure that the resulting color representation has high discriminative power we propose a method to order the additional color names according to their complementary nature with the basic color names. This allows us to compute color name representations with high discriminative power of arbitrary length. In the experiments we show that these new color name descriptors outperform the existing color name descriptor on the task of visual tracking, person re-identification and image classification. | ||||
| 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; NEUROBIT; 600.068; 600.109; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ YYW2018 | Serial | 3087 | ||
| Permanent link to this record | |||||
| Author | Xim Cerda-Company; C. Alejandro Parraga; Xavier Otazu | ||||
| Title | Which tone-mapping operator is the best? A comparative study of perceptual quality | Type | Journal Article | ||
| Year | 2018 | Publication | Journal of the Optical Society of America A | Abbreviated Journal | JOSA A |
| Volume | 35 | Issue | 4 | Pages | 626-638 |
| Keywords | |||||
| Abstract | Tone-mapping operators (TMO) are designed to generate perceptually similar low-dynamic range images from high-dynamic range ones. We studied the performance of fifteen TMOs in two psychophysical experiments where observers compared the digitally-generated tone-mapped images to their corresponding physical scenes. All experiments were performed in a controlled environment and the setups were
designed to emphasize different image properties: in the first experiment we evaluated the local relationships among intensity-levels, and in the second one we evaluated global visual appearance among physical scenes and tone-mapped images, which were presented side by side. We ranked the TMOs according to how well they reproduced the results obtained in the physical scene. Our results show that ranking position clearly depends on the adopted evaluation criteria, which implies that, in general, these tone-mapping algorithms consider either local or global image attributes but rarely both. Regarding the question of which TMO is the best, KimKautz [1] and Krawczyk [2] obtained the better results across the different experiments. We conclude that a more thorough and standardized evaluation criteria is needed to study all the characteristics of TMOs, as there is ample room for improvement in future developments. |
||||
| 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 | NEUROBIT; 600.120; 600.128 | Approved | no | ||
| Call Number | Admin @ si @ CPO2018 | Serial | 3088 | ||
| Permanent link to this record | |||||
| Author | Jorge Bernal; Aymeric Histace; Marc Masana; Quentin Angermann; Cristina Sanchez Montes; Cristina Rodriguez de Miguel; Maroua Hammami; Ana Garcia Rodriguez; Henry Cordova; Olivier Romain; Gloria Fernandez Esparrach; Xavier Dray; F. Javier Sanchez | ||||
| Title | Polyp Detection Benchmark in Colonoscopy Videos using GTCreator: A Novel Fully Configurable Tool for Easy and Fast Annotation of Image Databases | Type | Conference Article | ||
| Year | 2018 | Publication | 32nd International Congress and Exhibition on Computer Assisted Radiology & Surgery | 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 |
Medium | |||
| Area | Expedition | Conference | CARS | ||
| Notes | ISE; MV; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ BHM2018 | Serial | 3089 | ||
| Permanent link to this record | |||||
| Author | Katerine Diaz; Francesc J. Ferri; Aura Hernandez-Sabate | ||||
| Title | An overview of incremental feature extraction methods based on linear subspaces | Type | Journal Article | ||
| Year | 2018 | Publication | Knowledge-Based Systems | Abbreviated Journal | KBS |
| Volume | 145 | Issue | Pages | 219-235 | |
| Keywords | |||||
| Abstract | With the massive explosion of machine learning in our day-to-day life, incremental and adaptive learning has become a major topic, crucial to keep up-to-date and improve classification models and their corresponding feature extraction processes. This paper presents a categorized overview of incremental feature extraction based on linear subspace methods which aim at incorporating new information to the already acquired knowledge without accessing previous data. Specifically, this paper focuses on those linear dimensionality reduction methods with orthogonal matrix constraints based on global loss function, due to the extensive use of their batch approaches versus other linear alternatives. Thus, we cover the approaches derived from Principal Components Analysis, Linear Discriminative Analysis and Discriminative Common Vector methods. For each basic method, its incremental approaches are differentiated according to the subspace model and matrix decomposition involved in the updating process. Besides this categorization, several updating strategies are distinguished according to the amount of data used to update and to the fact of considering a static or dynamic number of classes. Moreover, the specific role of the size/dimension ratio in each method is considered. Finally, computational complexity, experimental setup and the accuracy rates according to published results are compiled and analyzed, and an empirical evaluation is done to compare the best approach of each kind. | ||||
| 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 | 0950-7051 | ISBN |
Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ DFH2018 | Serial | 3090 | ||
| Permanent link to this record | |||||