Records |
Author |
David Masip; Michael S. North ; Alexander Todorov; Daniel N. Osherson |
Title |
Automated Prediction of Preferences Using Facial Expressions |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
PloS one |
Abbreviated Journal |
Plos |
Volume |
9 |
Issue |
2 |
Pages |
e87434 |
Keywords |
|
Abstract |
We introduce a computer vision problem from social cognition, namely, the automated detection of attitudes from a person's spontaneous facial expressions. To illustrate the challenges, we introduce two simple algorithms designed to predict observers’ preferences between images (e.g., of celebrities) based on covert videos of the observers’ faces. The two algorithms are almost as accurate as human judges performing the same task but nonetheless far from perfect. Our approach is to locate facial landmarks, then predict preference on the basis of their temporal dynamics. The database contains 768 videos involving four different kinds of preferences. We make it publically available. |
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 |
OR;MV |
Approved |
no |
Call Number |
Admin @ si @ MNT2014 |
Serial |
2453 |
Permanent link to this record |
|
|
|
Author |
David Fernandez; Josep Llados; Alicia Fornes |
Title |
A graph-based approach for segmenting touching lines in historical handwritten documents |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
International Journal on Document Analysis and Recognition |
Abbreviated Journal |
IJDAR |
Volume |
17 |
Issue |
3 |
Pages |
293-312 |
Keywords |
Text line segmentation; Handwritten documents; Document image processing; Historical document analysis |
Abstract |
Text line segmentation in handwritten documents is an important task in the recognition of historical documents. Handwritten document images contain text lines with multiple orientations, touching and overlapping characters between consecutive text lines and different document structures, making line segmentation a difficult task. In this paper, we present a new approach for handwritten text line segmentation solving the problems of touching components, curvilinear text lines and horizontally overlapping components. The proposed algorithm formulates line segmentation as finding the central path in the area between two consecutive lines. This is solved as a graph traversal problem. A graph is constructed using the skeleton of the image. Then, a path-finding algorithm is used to find the optimum path between text lines. The proposed algorithm has been evaluated on a comprehensive dataset consisting of five databases: ICDAR2009, ICDAR2013, UMD, the George Washington and the Barcelona Marriages Database. The proposed method outperforms the state-of-the-art considering the different types and difficulties of the benchmarking data. |
Address |
|
Corporate Author |
|
Thesis |
|
Publisher |
Springer Berlin Heidelberg |
Place of Publication |
|
Editor |
|
Language |
|
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
1433-2833 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
DAG; 600.056; 600.061; 602.006; 600.077 |
Approved |
no |
Call Number |
Admin @ si @ FLF2014 |
Serial |
2459 |
Permanent link to this record |
|
|
|
Author |
Carlo Gatta; Francesco Ciompi |
Title |
Stacked Sequential Scale-Space Taylor Context |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
IEEE Transactions on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
TPAMI |
Volume |
36 |
Issue |
8 |
Pages |
1694-1700 |
Keywords |
|
Abstract |
We analyze sequential image labeling methods that sample the posterior label field in order to gather contextual information. We propose an effective method that extracts local Taylor coefficients from the posterior at different scales. Results show that our proposal outperforms state-of-the-art methods on MSRC-21, CAMVID, eTRIMS8 and KAIST2 data sets. |
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 |
0162-8828 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
LAMP; MILAB; 601.160; 600.079 |
Approved |
no |
Call Number |
Admin @ si @ GaC2014 |
Serial |
2466 |
Permanent link to this record |
|
|
|
Author |
Pedro Martins; Paulo Carvalho; Carlo Gatta |
Title |
Context-aware features and robust image representations |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Journal of Visual Communication and Image Representation |
Abbreviated Journal |
JVCIR |
Volume |
25 |
Issue |
2 |
Pages |
339-348 |
Keywords |
|
Abstract |
Local image features are often used to efficiently represent image content. The limited number of types of features that a local feature extractor responds to might be insufficient to provide a robust image representation. To overcome this limitation, we propose a context-aware feature extraction formulated under an information theoretic framework. The algorithm does not respond to a specific type of features; the idea is to retrieve complementary features which are relevant within the image context. We empirically validate the method by investigating the repeatability, the completeness, and the complementarity of context-aware features on standard benchmarks. In a comparison with strictly local features, we show that our context-aware features produce more robust image representations. Furthermore, we study the complementarity between strictly local features and context-aware ones to produce an even more robust representation. |
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.079;MILAB |
Approved |
no |
Call Number |
Admin @ si @ MCG2014 |
Serial |
2467 |
Permanent link to this record |
|
|
|
Author |
Simeon Petkov; Xavier Carrillo; Petia Radeva; Carlo Gatta |
Title |
Diaphragm border detection in coronary X-ray angiographies: New method and applications |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Computerized Medical Imaging and Graphics |
Abbreviated Journal |
CMIG |
Volume |
38 |
Issue |
4 |
Pages |
296-305 |
Keywords |
|
Abstract |
X-ray angiography is widely used in cardiac disease diagnosis during or prior to intravascular interventions. The diaphragm motion and the heart beating induce gray-level changes, which are one of the main obstacles in quantitative analysis of myocardial perfusion. In this paper we focus on detecting the diaphragm border in both single images or whole X-ray angiography sequences. We show that the proposed method outperforms state of the art approaches. We extend a previous publicly available data set, adding new ground truth data. We also compose another set of more challenging images, thus having two separate data sets of increasing difficulty. Finally, we show three applications of our method: (1) a strategy to reduce false positives in vessel enhanced images; (2) a digital diaphragm removal algorithm; (3) an improvement in Myocardial Blush Grade semi-automatic estimation. |
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; LAMP; 600.079 |
Approved |
no |
Call Number |
Admin @ si @ PCR2014 |
Serial |
2468 |
Permanent link to this record |
|
|
|
Author |
Pierluigi Casale; Oriol Pujol; Petia Radeva |
Title |
Approximate polytope ensemble for one-class classification |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
Volume |
47 |
Issue |
2 |
Pages |
854-864 |
Keywords |
One-class classification; Convex hull; High-dimensionality; Random projections; Ensemble learning |
Abstract |
In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, the decision whether a point belongs to the convex hull model in high dimensional spaces is approximated by means of random projections and an ensemble decision process. Finally, a tiling strategy is proposed in order to model non-convex structures. Experimental results show that the proposed strategy is significantly better than state of the art one-class classification methods on over 200 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 |
MILAB; 605.203 |
Approved |
no |
Call Number |
Admin @ si @ CPR2014a |
Serial |
2469 |
Permanent link to this record |
|
|
|
Author |
Francesco Ciompi; Oriol Pujol; Petia Radeva |
Title |
ECOC-DRF: Discriminative random fields based on error correcting output codes |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
Volume |
47 |
Issue |
6 |
Pages |
2193-2204 |
Keywords |
Discriminative random fields; Error-correcting output codes; Multi-class classification; Graphical models |
Abstract |
We present ECOC-DRF, a framework where potential functions for Discriminative Random Fields are formulated as an ensemble of classifiers. We introduce the label trick, a technique to express transitions in the pairwise potential as meta-classes. This allows to independently learn any possible transition between labels without assuming any pre-defined model. The Error Correcting Output Codes matrix is used as ensemble framework for the combination of margin classifiers. We apply ECOC-DRF to a large set of classification problems, covering synthetic, natural and medical images for binary and multi-class cases, outperforming state-of-the art in almost all the experiments. |
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; HuPBA; MILAB; 605.203; 600.046; 601.043; 600.079 |
Approved |
no |
Call Number |
Admin @ si @ CPR2014b |
Serial |
2470 |
Permanent link to this record |
|
|
|
Author |
Naveen Onkarappa; Angel Sappa |
Title |
Synthetic sequences and ground-truth flow field generation for algorithm validation |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2015 |
Publication |
Multimedia Tools and Applications |
Abbreviated Journal |
MTAP |
Volume |
74 |
Issue |
9 |
Pages |
3121-3135 |
Keywords |
Ground-truth optical flow; Synthetic sequence; Algorithm validation |
Abstract |
Research in computer vision is advancing by the availability of good datasets that help to improve algorithms, validate results and obtain comparative analysis. The datasets can be real or synthetic. For some of the computer vision problems such as optical flow it is not possible to obtain ground-truth optical flow with high accuracy in natural outdoor real scenarios directly by any sensor, although it is possible to obtain ground-truth data of real scenarios in a laboratory setup with limited motion. In this difficult situation computer graphics offers a viable option for creating realistic virtual scenarios. In the current work we present a framework to design virtual scenes and generate sequences as well as ground-truth flow fields. Particularly, we generate a dataset containing sequences of driving scenarios. The sequences in the dataset vary in different speeds of the on-board vision system, different road textures, complex motion of vehicle and independent moving vehicles in the scene. This dataset enables analyzing and adaptation of existing optical flow methods, and leads to invention of new approaches particularly for driver assistance systems. |
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 |
1380-7501 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
ADAS; 600.055; 601.215; 600.076 |
Approved |
no |
Call Number |
Admin @ si @ OnS2014b |
Serial |
2472 |
Permanent link to this record |
|
|
|
Author |
Monica Piñol; Angel Sappa; Ricardo Toledo |
Title |
Adaptive Feature Descriptor Selection based on a Multi-Table Reinforcement Learning Strategy |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2015 |
Publication |
Neurocomputing |
Abbreviated Journal |
NEUCOM |
Volume |
150 |
Issue |
A |
Pages |
106–115 |
Keywords |
Reinforcement learning; Q-learning; Bag of features; Descriptors |
Abstract |
This paper presents and evaluates a framework to improve the performance of visual object classification methods, which are based on the usage of image feature descriptors as inputs. The goal of the proposed framework is to learn the best descriptor for each image in a given database. This goal is reached by means of a reinforcement learning process using the minimum information. The visual classification system used to demonstrate the proposed framework is based on a bag of features scheme, and the reinforcement learning technique is implemented through the Q-learning approach. The behavior of the reinforcement learning with different state definitions is evaluated. Additionally, a method that combines all these states is formulated in order to select the optimal state. Finally, the chosen actions are obtained from the best set of image descriptors in the literature: PHOW, SIFT, C-SIFT, SURF and Spin. Experimental results using two public databases (ETH and COIL) are provided showing both the validity of the proposed approach and comparisons with state of the art. In all the cases the best results are obtained with the proposed approach. |
Address |
|
Corporate Author |
|
Thesis |
|
Publisher |
|
Place of Publication |
|
Editor |
|
Language |
|
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
|
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
ADAS; 600.055; 600.076 |
Approved |
no |
Call Number |
Admin @ si @ PST2015 |
Serial |
2473 |
Permanent link to this record |
|
|
|
Author |
P. Ricaurte ; C. Chilan; Cristhian A. Aguilera-Carrasco; Boris X. Vintimilla; Angel Sappa |
Title |
Feature Point Descriptors: Infrared and Visible Spectra |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Sensors |
Abbreviated Journal |
SENS |
Volume |
14 |
Issue |
2 |
Pages |
3690-3701 |
Keywords |
|
Abstract |
This manuscript evaluates the behavior of classical feature point descriptors when they are used in images from long-wave infrared spectral band and compare them with the results obtained in the visible spectrum. Robustness to changes in rotation, scaling, blur, and additive noise are analyzed using a state of the art framework. Experimental results using a cross-spectral outdoor image data set are presented and conclusions from these experiments are given. |
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.055; 600.076 |
Approved |
no |
Call Number |
Admin @ si @ RCA2014a |
Serial |
2474 |
Permanent link to this record |
|
|
|
Author |
Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny |
Title |
Word Spotting and Recognition with Embedded Attributes |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
IEEE Transactions on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
TPAMI |
Volume |
36 |
Issue |
12 |
Pages |
2552 - 2566 |
Keywords |
|
Abstract |
This article addresses the problems of word spotting and word recognition on images. In word spotting, the goal is to find all instances of a query word in a dataset of images. In recognition, the goal is to recognize the content of the word image, usually aided by a dictionary or lexicon. We describe an approach in which both word images and text strings are embedded in a common vectorial subspace. This is achieved by a combination of label embedding and attributes learning, and a common subspace regression. In this subspace, images and strings that represent the same word are close together, allowing one to cast recognition and retrieval tasks as a nearest neighbor problem. Contrary to most other existing methods, our representation has a fixed length, is low dimensional, and is very fast to compute and, especially, to compare. We test our approach on four public datasets of both handwritten documents and natural images showing results comparable or better than the state-of-the-art on spotting and recognition tasks. |
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 |
0162-8828 |
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
DAG; 600.056; 600.045; 600.061; 602.006; 600.077 |
Approved |
no |
Call Number |
Admin @ si @ AGF2014a |
Serial |
2483 |
Permanent link to this record |
|
|
|
Author |
Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny |
Title |
Segmentation-free Word Spotting with Exemplar SVMs |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
Volume |
47 |
Issue |
12 |
Pages |
3967–3978 |
Keywords |
Word spotting; Segmentation-free; Unsupervised learning; Reranking; Query expansion; Compression |
Abstract |
In this paper we propose an unsupervised segmentation-free method for word spotting in document images. Documents are represented with a grid of HOG descriptors, and a sliding-window approach is used to locate the document regions that are most similar to the query. We use the Exemplar SVM framework to produce a better representation of the query in an unsupervised way. Then, we use a more discriminative representation based on Fisher Vector to rerank the best regions retrieved, and the most promising ones are used to expand the Exemplar SVM training set and improve the query representation. Finally, the document descriptors are precomputed and compressed with Product Quantization. This offers two advantages: first, a large number of documents can be kept in RAM memory at the same time. Second, the sliding window becomes significantly faster since distances between quantized HOG descriptors can be precomputed. Our results significantly outperform other segmentation-free methods in the literature, both in accuracy and in speed and memory usage. |
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.045; 600.056; 600.061; 602.006; 600.077 |
Approved |
no |
Call Number |
Admin @ si @ AGF2014b |
Serial |
2485 |
Permanent link to this record |
|
|
|
Author |
Jorge Bernal |
Title |
Polyp Localization and Segmentation in Colonoscopy Images by Means of a Model of Appearance for Polyps |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2014 |
Publication |
Electronic Letters on Computer Vision and Image Analysis |
Abbreviated Journal |
ELCVIA |
Volume |
13 |
Issue |
2 |
Pages |
9-10 |
Keywords |
Colonoscopy; polyp localization; polyp segmentation; Eye-tracking |
Abstract |
Colorectal cancer is the fourth most common cause of cancer death worldwide and its survival rate depends on the stage in which it is detected on hence the necessity for an early colon screening. There are several screening techniques but colonoscopy is still nowadays the gold standard, although it has some drawbacks such as the miss rate. Our contribution, in the field of intelligent systems for colonoscopy, aims at providing a polyp localization and a polyp segmentation system based on a model of appearance for polyps. To develop both methods we define a model of appearance for polyps, which describes a polyp as enclosed by intensity valleys. The novelty of our contribution resides on the fact that we include in our model aspects of the image formation and we also consider the presence of other elements from the endoluminal scene such as specular highlights and blood vessels, which have an impact on the performance of our methods. In order to develop our polyp localization method we accumulate valley information in order to generate energy maps, which are also used to guide the polyp segmentation. Our methods achieve promising results in polyp localization and segmentation. As we want to explore the usability of our methods we present a comparative analysis between physicians fixations obtained via an eye tracking device and our polyp localization method. The results show that our method is indistinguishable to novice physicians although it is far from expert physicians. |
Address |
|
Corporate Author |
|
Thesis |
|
Publisher |
|
Place of Publication |
|
Editor |
Alicia Fornes; Volkmar Frinken |
Language |
|
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
|
ISBN |
|
Medium |
|
Area |
|
Expedition |
|
Conference |
|
Notes |
MV |
Approved |
no |
Call Number |
Admin @ si @ Ber2014 |
Serial |
2487 |
Permanent link to this record |
|
|
|
Author |
Victor Ponce; Sergio Escalera; Marc Perez; Oriol Janes; Xavier Baro |
Title |
Non-Verbal Communication Analysis in Victim-Offender Mediations |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2015 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
Volume |
67 |
Issue |
1 |
Pages |
19-27 |
Keywords |
Victim–Offender Mediation; Multi-modal human behavior analysis; Face and gesture recognition; Social signal processing; Computer vision; Machine learning |
Abstract |
We present a non-invasive ambient intelligence framework for the semi-automatic analysis of non-verbal communication applied to the restorative justice field. We propose the use of computer vision and social signal processing technologies in real scenarios of Victim–Offender Mediations, applying feature extraction techniques to multi-modal audio-RGB-depth data. We compute a set of behavioral indicators that define communicative cues from the fields of psychology and observational methodology. We test our methodology on data captured in real Victim–Offender Mediation sessions in Catalonia. We define the ground truth based on expert opinions when annotating the observed social responses. Using different state of the art binary classification approaches, our system achieves recognition accuracies of 86% when predicting satisfaction, and 79% when predicting both agreement and receptivity. Applying a regression strategy, we obtain a mean deviation for the predictions between 0.5 and 0.7 in the range [1–5] for the computed social signals. |
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;MV |
Approved |
no |
Call Number |
Admin @ si @ PEP2015 |
Serial |
2583 |
Permanent link to this record |
|
|
|
Author |
Frederic Sampedro; Sergio Escalera; Anna Domenech; Ignasi Carrio |
Title |
Automatic Tumor Volume Segmentation in Whole-Body PET/CT Scans: A Supervised Learning Approach Source |
Type ![sorted by Type field, ascending order (up)](img/sort_asc.gif) |
Journal Article |
Year |
2015 |
Publication |
Journal of Medical Imaging and Health Informatics |
Abbreviated Journal |
JMIHI |
Volume |
5 |
Issue |
2 |
Pages |
192-201 |
Keywords |
CONTEXTUAL CLASSIFICATION; PET/CT; SUPERVISED LEARNING; TUMOR SEGMENTATION; WHOLE BODY |
Abstract |
Whole-body 3D PET/CT tumoral volume segmentation provides relevant diagnostic and prognostic information in clinical oncology and nuclear medicine. Carrying out this procedure manually by a medical expert is time consuming and suffers from inter- and intra-observer variabilities. In this paper, a completely automatic approach to this task is presented. First, the problem is stated and described both in clinical and technological terms. Then, a novel supervised learning segmentation framework is introduced. The segmentation by learning approach is defined within a Cascade of Adaboost classifiers and a 3D contextual proposal of Multiscale Stacked Sequential Learning. Segmentation accuracy results on 200 Breast Cancer whole body PET/CT volumes show mean 49% sensitivity, 99.993% specificity and 39% Jaccard overlap Index, which represent good performance results both at the clinical and technological level. |
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 @ SED2015 |
Serial |
2584 |
Permanent link to this record |