| Records |
| Author |
Azadeh S. Mozafari; David Vazquez; Mansour Jamzad; Antonio Lopez |
| Title |
Node-Adapt, Path-Adapt and Tree-Adapt:Model-Transfer Domain Adaptation for Random Forest |
Type |
Miscellaneous |
| Year |
2016 |
Publication |
Arxiv |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
Domain Adaptation; Pedestrian detection; Random Forest |
| Abstract |
Random Forest (RF) is a successful paradigm for learning classifiers due to its ability to learn from large feature spaces and seamlessly integrate multi-class classification, as well as the achieved accuracy and processing efficiency. However, as many other classifiers, RF requires domain adaptation (DA) provided that there is a mismatch between the training (source) and testing (target) domains which provokes classification degradation. Consequently, different RF-DA methods have been proposed, which not only require target-domain samples but revisiting the source-domain ones, too. As novelty, we propose three inherently different methods (Node-Adapt, Path-Adapt and Tree-Adapt) that only require the learned source-domain RF and a relatively few target-domain samples for DA, i.e. source-domain samples do not need to be available. To assess the performance of our proposals we focus on image-based object detection, using the pedestrian detection problem as challenging proof-of-concept. Moreover, we use the RF with expert nodes because it is a competitive patch-based pedestrian model. We test our Node-, Path- and Tree-Adapt methods in standard benchmarks, showing that DA is largely achieved. |
| 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 @ MVJ2016 |
Serial |
2868 |
| Permanent link to this record |
| |
|
| |
| Author |
Pau Riba; Josep Llados; Alicia Fornes |
| Title |
Error-tolerant coarse-to-fine matching model for hierarchical graphs |
Type |
Conference Article |
| Year |
2017 |
Publication |
11th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition |
Abbreviated Journal |
|
| Volume |
10310 |
Issue |
|
Pages |
107-117 |
| Keywords |
Graph matching; Hierarchical graph; Graph-based representation; Coarse-to-fine matching |
| Abstract |
Graph-based representations are effective tools to capture structural information from visual elements. However, retrieving a query graph from a large database of graphs implies a high computational complexity. Moreover, these representations are very sensitive to noise or small changes. In this work, a novel hierarchical graph representation is designed. Using graph clustering techniques adapted from graph-based social media analysis, we propose to generate a hierarchy able to deal with different levels of abstraction while keeping information about the topology. For the proposed representations, a coarse-to-fine matching method is defined. These approaches are validated using real scenarios such as classification of colour images and handwritten word spotting. |
| Address |
Anacapri; Italy; May 2017 |
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer International Publishing |
Place of Publication |
|
Editor |
Pasquale Foggia; Cheng-Lin Liu; Mario Vento |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
GbRPR |
| Notes |
DAG; 600.097; 601.302; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ RLF2017a |
Serial |
2951 |
| Permanent link to this record |
| |
|
| |
| Author |
Ariel Amato |
| Title |
Moving cast shadow detection |
Type |
Journal Article |
| Year |
2014 |
Publication |
Electronic letters on computer vision and image analysis |
Abbreviated Journal |
ELCVIA |
| Volume |
13 |
Issue |
2 |
Pages |
70-71 |
| Keywords |
|
| Abstract |
Motion perception is an amazing innate ability of the creatures on the planet. This adroitness entails a functional advantage that enables species to compete better in the wild. The motion perception ability is usually employed at different levels, allowing from the simplest interaction with the ’physis’ up to the most transcendental survival tasks. Among the five classical perception system , vision is the most widely used in the motion perception field. Millions years of evolution have led to a highly specialized visual system in humans, which is characterized by a tremendous accuracy as well as an extraordinary robustness. Although humans and an immense diversity of species can distinguish moving object with a seeming simplicity, it has proven to be a difficult and non trivial problem from a computational perspective. In the field of Computer Vision, the detection of moving objects is a challenging and fundamental research area. This can be referred to as the ’origin’ of vast and numerous vision-based research sub-areas. Nevertheless, from the bottom to the top of this hierarchical analysis, the foundations still relies on when and where motion has occurred in an image. Pixels corresponding to moving objects in image sequences can be identified by measuring changes in their values. However, a pixel’s value (representing a combination of color and brightness) could also vary due to other factors such as: variation in scene illumination, camera noise and nonlinear sensor responses among others. The challenge lies in detecting if the changes in pixels’ value are caused by a genuine object movement or not. An additional challenging aspect in motion detection is represented by moving cast shadows. The paradox arises because a moving object and its cast shadow share similar motion patterns. However, a moving cast shadow is not a moving object. In fact, a shadow represents a photometric illumination effect caused by the relative position of the object with respect to the light sources. Shadow detection methods are mainly divided in two domains depending on the application field. One normally consists of static images where shadows are casted by static objects, whereas the second one is referred to image sequences where shadows are casted by moving objects. For the first case, shadows can provide additional geometric and semantic cues about shape and position of its casting object as well as the localization of the light source. Although the previous information can be extracted from static images as well as video sequences, the main focus in the second area is usually change detection, scene matching or surveillance. In this context, a shadow can severely affect with the analysis and interpretation of the scene. The work done in the thesis is focused on the second case, thus it addresses the problem of detection and removal of moving cast shadows in video sequences in order to enhance the detection of moving object. |
| 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 |
ISE |
Approved |
no |
| Call Number |
Admin @ si @ Ama2014 |
Serial |
2870 |
| 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 |
Antonio Lopez; Jiaolong Xu; Jose Luis Gomez; David Vazquez; German Ros |
| Title |
From Virtual to Real World Visual Perception using Domain Adaptation -- The DPM as Example |
Type |
Book Chapter |
| Year |
2017 |
Publication |
Domain Adaptation in Computer Vision Applications |
Abbreviated Journal |
|
| Volume |
|
Issue |
13 |
Pages |
243-258 |
| Keywords |
Domain Adaptation |
| Abstract |
Supervised learning tends to produce more accurate classifiers than unsupervised learning in general. This implies that training data is preferred with annotations. When addressing visual perception challenges, such as localizing certain object classes within an image, the learning of the involved classifiers turns out to be a practical bottleneck. The reason is that, at least, we have to frame object examples with bounding boxes in thousands of images. A priori, the more complex the model is regarding its number of parameters, the more annotated examples are required. This annotation task is performed by human oracles, which ends up in inaccuracies and errors in the annotations (aka ground truth) since the task is inherently very cumbersome and sometimes ambiguous. As an alternative we have pioneered the use of virtual worlds for collecting such annotations automatically and with high precision. However, since the models learned with virtual data must operate in the real world, we still need to perform domain adaptation (DA). In this chapter we revisit the DA of a deformable part-based model (DPM) as an exemplifying case of virtual- to-real-world DA. As a use case, we address the challenge of vehicle detection for driver assistance, using different publicly available virtual-world data. While doing so, we investigate questions such as: how does the domain gap behave due to virtual-vs-real data with respect to dominant object appearance per domain, as well as the role of photo-realism in the virtual world. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer |
Place of Publication |
|
Editor |
Gabriela Csurka |
| 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; 600.085; 601.223; 600.076; 600.118 |
Approved |
no |
| Call Number |
ADAS @ adas @ LXG2017 |
Serial |
2872 |
| Permanent link to this record |
| |
|
| |
| Author |
Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta |
| Title |
Large-scale graph indexing using binary embeddings of node contexts for information spotting in document image databases |
Type |
Journal Article |
| Year |
2017 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
87 |
Issue |
|
Pages |
203-211 |
| Keywords |
|
| Abstract |
Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations. However, retrieving a query graph from a large dataset of graphs implies a high computational complexity. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. With this aim, in this paper we propose a graph indexation formalism applied to visual retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Then, each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in different real scenarios such as handwritten word spotting in images of historical documents or symbol spotting in architectural floor plans. |
| 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; 602.006; 603.053; 600.121 |
Approved |
no |
| Call Number |
RLF2017b |
Serial |
2873 |
| Permanent link to this record |
| |
|
| |
| Author |
Anjan Dutta; Umapada Pal; Josep Llados |
| Title |
Compact Correlated Features for Writer Independent Signature Verification |
Type |
Conference Article |
| Year |
2016 |
Publication |
23rd International Conference on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
This paper considers the offline signature verification problem which is considered to be an important research line in the field of pattern recognition. In this work we propose hybrid features that consider the local features and their global statistics in the signature image. This has been done by creating a vocabulary of histogram of oriented gradients (HOGs). We impose weights on these local features based on the height information of water reservoirs obtained from the signature. Spatial information between local features are thought to play a vital role in considering the geometry of the signatures which distinguishes the originals from the forged ones. Nevertheless, learning a condensed set of higher order neighbouring features based on visual words, e.g., doublets and triplets, continues to be a challenging problem as possible combinations of visual words grow exponentially. To avoid this explosion of size, we create a code of local pairwise features which are represented as joint descriptors. Local features are paired based on the edges of a graph representation built upon the Delaunay triangulation. We reveal the advantage of combining both type of visual codebooks (order one and pairwise) for signature verification task. This is validated through an encouraging result on two benchmark datasets viz. CEDAR and GPDS300. |
| Address |
Cancun; Mexico; December 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 |
ICPR |
| Notes |
DAG; 600.097 |
Approved |
no |
| Call Number |
Admin @ si @ DPL2016 |
Serial |
2875 |
| 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 |
Daniel Hernandez; Antonio Espinosa; David Vazquez; Antonio Lopez; Juan Carlos Moure |
| Title |
Embedded Real-time Stixel Computation |
Type |
Conference Article |
| Year |
2017 |
Publication |
GPU Technology Conference |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
GPU; CUDA; Stixels; Autonomous Driving |
| Abstract |
|
| Address |
Silicon Valley; USA; May 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 |
GTC |
| Notes |
ADAS; 600.118 |
Approved |
no |
| Call Number |
ADAS @ adas @ HEV2017a |
Serial |
2879 |
| Permanent link to this record |
| |
|
| |
| Author |
David Vazquez; Jorge Bernal; F. Javier Sanchez; Gloria Fernandez Esparrach; Antonio Lopez; Adriana Romero; Michal Drozdzal; Aaron Courville |
| Title |
A Benchmark for Endoluminal Scene Segmentation of Colonoscopy Images |
Type |
Conference Article |
| Year |
2017 |
Publication |
31st International Congress and Exhibition on Computer Assisted Radiology and Surgery |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
Deep Learning; Medical Imaging |
| Abstract |
Colorectal cancer (CRC) is the third cause of cancer death worldwide. Currently, the standard approach to reduce CRC-related mortality is to perform regular screening in search for polyps and colonoscopy is the screening tool of choice. The main limitations of this screening procedure are polyp miss-rate and inability to perform visual assessment of polyp malignancy. These drawbacks can be reduced by designing Decision Support Systems (DSS) aiming to help clinicians in the different stages of the procedure by providing endoluminal scene segmentation. Thus, in this paper, we introduce an extended benchmark of colonoscopy image, with the hope of establishing a new strong benchmark for colonoscopy image analysis research. We provide new baselines on this dataset by training standard fully convolutional networks (FCN) for semantic segmentation and significantly outperforming, without any further post-processing, prior results in endoluminal scene 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 |
CARS |
| Notes |
ADAS; MV; 600.075; 600.085; 600.076; 601.281; 600.118 |
Approved |
no |
| Call Number |
ADAS @ adas @ VBS2017a |
Serial |
2880 |
| Permanent link to this record |
| |
|
| |
| Author |
David Geronimo; David Vazquez; Arturo de la Escalera |
| Title |
Vision-Based Advanced Driver Assistance Systems |
Type |
Book Chapter |
| Year |
2017 |
Publication |
Computer Vision in Vehicle Technology: Land, Sea, and Air |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
ADAS; Autonomous Driving |
| 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 |
ADAS; 600.118 |
Approved |
no |
| Call Number |
ADAS @ adas @ GVE2017 |
Serial |
2881 |
| Permanent link to this record |
| |
|
| |
| Author |
German Ros; Laura Sellart; Gabriel Villalonga; Elias Maidanik; Francisco Molero; Marc Garcia; Adriana Cedeño; Francisco Perez; Didier Ramirez; Eduardo Escobar; Jose Luis Gomez; David Vazquez; Antonio Lopez |
| Title |
Semantic Segmentation of Urban Scenes via Domain Adaptation of SYNTHIA |
Type |
Book Chapter |
| Year |
2017 |
Publication |
Domain Adaptation in Computer Vision Applications |
Abbreviated Journal |
|
| Volume |
12 |
Issue |
|
Pages |
227-241 |
| Keywords |
SYNTHIA; Virtual worlds; Autonomous Driving |
| Abstract |
Vision-based semantic segmentation in urban scenarios is a key functionality for autonomous driving. Recent revolutionary results of deep convolutional neural networks (DCNNs) foreshadow the advent of reliable classifiers to perform such visual tasks. However, DCNNs require learning of many parameters from raw images; thus, having a sufficient amount of diverse images with class annotations is needed. These annotations are obtained via cumbersome, human labour which is particularly challenging for semantic segmentation since pixel-level annotations are required. In this chapter, we propose to use a combination of a virtual world to automatically generate realistic synthetic images with pixel-level annotations, and domain adaptation to transfer the models learnt to correctly operate in real scenarios. We address the question of how useful synthetic data can be for semantic segmentation – in particular, when using a DCNN paradigm. In order to answer this question we have generated a synthetic collection of diverse urban images, named SYNTHIA, with automatically generated class annotations and object identifiers. We use SYNTHIA in combination with publicly available real-world urban images with manually provided annotations. Then, we conduct experiments with DCNNs that show that combining SYNTHIA with simple domain adaptation techniques in the training stage significantly improves performance on semantic segmentation. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer |
Place of Publication |
|
Editor |
Gabriela Csurka |
| 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; 600.085; 600.082; 600.076; 600.118 |
Approved |
no |
| Call Number |
ADAS @ adas @ RSV2017 |
Serial |
2882 |
| Permanent link to this record |
| |
|
| |
| Author |
Antoni Gurgui; Debora Gil; Enric Marti; Vicente Grau |
| Title |
Left-Ventricle Basal Region Constrained Parametric Mapping to Unitary Domain |
Type |
Conference Article |
| Year |
2016 |
Publication |
7th International Workshop on Statistical Atlases & Computational Modelling of the Heart |
Abbreviated Journal |
|
| Volume |
10124 |
Issue |
|
Pages |
163-171 |
| Keywords |
Laplacian; Constrained maps; Parameterization; Basal ring |
| Abstract |
Due to its complex geometry, the basal ring is often omitted when putting different heart geometries into correspondence. In this paper, we present the first results on a new mapping of the left ventricle basal rings onto a normalized coordinate system using a fold-over free approach to the solution to the Laplacian. To guarantee correspondences between different basal rings, we imposed some internal constrained positions at anatomical landmarks in the normalized coordinate system. To prevent internal fold-overs, constraints are handled by cutting the volume into regions defined by anatomical features and mapping each piece of the volume separately. Initial results presented in this paper indicate that our method is able to handle internal constrains without introducing fold-overs and thus guarantees one-to-one mappings between different basal ring geometries. |
| Address |
Athens; October 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 |
STACOM |
| Notes |
IAM; |
Approved |
no |
| Call Number |
Admin @ si @ GGM2016 |
Serial |
2884 |
| Permanent link to this record |
| |
|
| |
| Author |
Carles Sanchez; Debora Gil; Jorge Bernal; F. Javier Sanchez; Marta Diez-Ferrer; Antoni Rosell |
| Title |
Navigation Path Retrieval from Videobronchoscopy using Bronchial Branches |
Type |
Conference Article |
| Year |
2016 |
Publication |
19th International Conference on Medical Image Computing and Computer Assisted Intervention Workshops |
Abbreviated Journal |
|
| Volume |
9401 |
Issue |
|
Pages |
62-70 |
| Keywords |
Bronchoscopy navigation; Lumen center; Brochial branches; Navigation path; Videobronchoscopy |
| Abstract |
Bronchoscopy biopsy can be used to diagnose lung cancer without risking complications of other interventions like transthoracic needle aspiration. During bronchoscopy, the clinician has to navigate through the bronchial tree to the target lesion. A main drawback is the difficulty to check whether the exploration is following the correct path. The usual guidance using fluoroscopy implies repeated radiation of the clinician, while alternative systems (like electromagnetic navigation) require specific equipment that increases intervention costs. We propose to compute the navigated path using anatomical landmarks extracted from the sole analysis of videobronchoscopy images. Such landmarks allow matching the current exploration to the path previously planned on a CT to indicate clinician whether the planning is being correctly followed or not. We present a feasibility study of our landmark based CT-video matching using bronchoscopic videos simulated on a virtual bronchoscopy interactive interface. |
| Address |
Quebec; Canada; September 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 |
MICCAIW |
| Notes |
IAM; MV; 600.060; 600.075 |
Approved |
no |
| Call Number |
Admin @ si @ SGB2016 |
Serial |
2885 |
| Permanent link to this record |
| |
|
| |
| Author |
Juan A. Carvajal Ayala; Dennis Romero; Angel Sappa |
| Title |
Fine-tuning based deep convolutional networks for lepidopterous genus recognition |
Type |
Conference Article |
| Year |
2016 |
Publication |
21st Ibero American Congress on Pattern Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
467-475 |
| Keywords |
|
| Abstract |
This paper describes an image classification approach oriented to identify specimens of lepidopterous insects at Ecuadorian ecological reserves. This work seeks to contribute to studies in the area of biology about genus of butterflies and also to facilitate the registration of unrecognized specimens. The proposed approach is based on the fine-tuning of three widely used pre-trained Convolutional Neural Networks (CNNs). This strategy is intended to overcome the reduced number of labeled images. Experimental results with a dataset labeled by expert biologists is presented, reaching a recognition accuracy above 92%. |
| Address |
Lima; Perú; November 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 |
CIARP |
| Notes |
ADAS; 600.086 |
Approved |
no |
| Call Number |
Admin @ si @ CRS2016 |
Serial |
2913 |
| Permanent link to this record |
