Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	91–105 of 3413 records found matching your query (RSS):

Search & Display Options

Select All Deselect All

<< 1 2 3 4 5 6 7 8 9 10 >> [11–20]

List View

Citations

Details

	Records
	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



	Author	Daniel Hernandez; Juan Carlos Moure; Toni Espinosa; Alejandro Chacon; David Vazquez; Antonio Lopez
	Title	Real-time 3D Reconstruction for Autonomous Driving via Semi-Global Matching			Type	Conference Article
	Year	2016	Publication	GPU Technology Conference	Abbreviated Journal
	Volume		Issue		Pages
	Keywords	Stereo; Autonomous Driving; GPU; 3d reconstruction
	Abstract	Robust and dense computation of depth information from stereo-camera systems is a computationally demanding requirement for real-time autonomous driving. Semi-Global Matching (SGM) [1] approximates heavy-computation global algorithms results but with lower computational complexity, therefore it is a good candidate for a real-time implementation. SGM minimizes energy along several 1D paths across the image. The aim of this work is to provide a real-time system producing reliable results on energy-efficient hardware. Our design runs on a NVIDIA Titan X GPU at 104.62 FPS and on a NVIDIA Drive PX at 6.7 FPS, promising for real-time platforms
	Address	Silicon Valley; San Francisco; USA; April 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	GTC
	Notes	ADAS; 600.085; 600.082; 600.076			Approved	no
	Call Number	ADAS @ adas @ HME2016			Serial	2738
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	Cristhian A. Aguilera-Carrasco; Cristhian Aguilera; Cristobal A. Navarro; Angel Sappa
	Title	Fast CNN Stereo Depth Estimation through Embedded GPU Devices			Type	Journal Article
	Year	2020	Publication	Sensors	Abbreviated Journal	SENS
	Volume	20	Issue	11	Pages	3249
	Keywords	stereo matching; deep learning; embedded GPU
	Abstract	Current CNN-based stereo depth estimation models can barely run under real-time constraints on embedded graphic processing unit (GPU) devices. Moreover, state-of-the-art evaluations usually do not consider model optimization techniques, being that it is unknown what is the current potential on embedded GPU devices. In this work, we evaluate two state-of-the-art models on three different embedded GPU devices, with and without optimization methods, presenting performance results that illustrate the actual capabilities of embedded GPU devices for stereo depth estimation. More importantly, based on our evaluation, we propose the use of a U-Net like architecture for postprocessing the cost-volume, instead of a typical sequence of 3D convolutions, drastically augmenting the runtime speed of current models. In our experiments, we achieve real-time inference speed, in the range of 5–32 ms, for 1216 × 368 input stereo images on the Jetson TX2, Jetson Xavier, and Jetson Nano embedded devices.
	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 @ AAN2020			Serial	3428
Permanent link to this record



	Author	Aura Hernandez-Sabate; Lluis Albarracin; F. Javier Sanchez
	Title	Graph-Based Problem Explorer: A Software Tool to Support Algorithm Design Learning While Solving the Salesperson Problem			Type	Journal
	Year	2020	Publication	Mathematics	Abbreviated Journal	MATH
	Volume	20	Issue	8(9)	Pages	1595
	Keywords	STEM education; Project-based learning; Coding; software tool
	Abstract	In this article, we present a sequence of activities in the form of a project in order to promote learning on design and analysis of algorithms. The project is based on the resolution of a real problem, the salesperson problem, and it is theoretically grounded on the fundamentals of mathematical modelling. In order to support the students’ work, a multimedia tool, called Graph-based Problem Explorer (GbPExplorer), has been designed and refined to promote the development of computer literacy in engineering and science university students. This tool incorporates several modules to allow coding different algorithmic techniques solving the salesman problem. Based on an educational design research along five years, we observe that working with GbPExplorer during the project provides students with the possibility of representing the situation to be studied in the form of graphs and analyze them from a computational point of view.
	Address	September 2020
	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	IAM; ISE			Approved	no
	Call Number	Admin @ si @			Serial	3722
Permanent link to this record



	Author	Carlo Gatta; Eloi Puertas; Oriol Pujol
	Title	Multi-Scale Stacked Sequential Learning			Type	Journal Article
	Year	2011	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	44	Issue	10-11	Pages	2414-2416
	Keywords	Stacked sequential learning; Multiscale; Multiresolution; Contextual classification
	Abstract	One of the most widely used assumptions in supervised learning is that data is independent and identically distributed. This assumption does not hold true in many real cases. Sequential learning is the discipline of machine learning that deals with dependent data such that neighboring examples exhibit some kind of relationship. In the literature, there are different approaches that try to capture and exploit this correlation, by means of different methodologies. In this paper we focus on meta-learning strategies and, in particular, the stacked sequential learning approach. The main contribution of this work is two-fold: first, we generalize the stacked sequential learning. This generalization reflects the key role of neighboring interactions modeling. Second, we propose an effective and efficient way of capturing and exploiting sequential correlations that takes into account long-range interactions by means of a multi-scale pyramidal decomposition of the predicted labels. Additionally, this new method subsumes the standard stacked sequential learning approach. We tested the proposed method on two different classification tasks: text lines classification in a FAQ data set and image classification. Results on these tasks clearly show that our approach outperforms the standard stacked sequential learning. Moreover, we show that the proposed method allows to control the trade-off between the detail and the desired range of the interactions.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier	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	MILAB;HuPBA			Approved	no
	Call Number	Admin @ si @ GPP2011			Serial	1802
Permanent link to this record



	Author	Eloi Puertas; Sergio Escalera; Oriol Pujol
	Title	Generalized Multi-scale Stacked Sequential Learning for Multi-class Classification			Type	Journal Article
	Year	2015	Publication	Pattern Analysis and Applications	Abbreviated Journal	PAA
	Volume	18	Issue	2	Pages	247-261
	Keywords	Stacked sequential learning; Multi-scale; Error-correct output codes (ECOC); Contextual classification
	Abstract	In many classification problems, neighbor data labels have inherent sequential relationships. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In this paper, we revise the multi-scale sequential learning approach (MSSL) for applying it in the multi-class case (MMSSL). We introduce the error-correcting output codesframework in the MSSL classifiers and propose a formulation for calculating confidence maps from the margins of the base classifiers. In addition, we propose a MMSSL compression approach which reduces the number of features in the extended data set without a loss in performance. The proposed methods are tested on several databases, showing significant performance improvement compared to classical approaches.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Verlag	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1433-7541	ISBN		Medium
	Area		Expedition		Conference
	Notes	HuPBA;MILAB			Approved	no
	Call Number	Admin @ si @ PEP2013			Serial	2251
Permanent link to this record



	Author	Alejandro Gonzalez Alzate; Sebastian Ramos; David Vazquez; Antonio Lopez; Jaume Amores
	Title	Spatiotemporal Stacked Sequential Learning for Pedestrian Detection			Type	Conference Article
	Year	2015	Publication	Pattern Recognition and Image Analysis, Proceedings of 7th Iberian Conference , ibPRIA 2015	Abbreviated Journal
	Volume		Issue		Pages	3-12
	Keywords	SSL; Pedestrian Detection
	Abstract	Pedestrian classifiers decide which image windows contain a pedestrian. In practice, such classifiers provide a relatively high response at neighbor windows overlapping a pedestrian, while the responses around potential false positives are expected to be lower. An analogous reasoning applies for image sequences. If there is a pedestrian located within a frame, the same pedestrian is expected to appear close to the same location in neighbor frames. Therefore, such a location has chances of receiving high classification scores during several frames, while false positives are expected to be more spurious. In this paper we propose to exploit such correlations for improving the accuracy of base pedestrian classifiers. In particular, we propose to use two-stage classifiers which not only rely on the image descriptors required by the base classifiers but also on the response of such base classifiers in a given spatiotemporal neighborhood. More specifically, we train pedestrian classifiers using a stacked sequential learning (SSL) paradigm. We use a new pedestrian dataset we have acquired from a car to evaluate our proposal at different frame rates. We also test on a well known dataset: Caltech. The obtained results show that our SSL proposal boosts detection accuracy significantly with a minimal impact on the computational cost. Interestingly, SSL improves more the accuracy at the most dangerous situations, i.e. when a pedestrian is close to the camera.
	Address	Santiago de Compostela; España; June 2015
	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	ACDC	Expedition		Conference	IbPRIA
	Notes	ADAS; 600.057; 600.054; 600.076			Approved	no
	Call Number	GRV2015; ADAS @ adas @ GRV2015			Serial	2454
Permanent link to this record



	Author	F. Javier Sanchez; Jorge Bernal; Cristina Sanchez Montes; Cristina Rodriguez de Miguel; Gloria Fernandez Esparrach
	Title	Bright spot regions segmentation and classification for specular highlights detection in colonoscopy videos			Type	Journal Article
	Year	2017	Publication	Machine Vision and Applications	Abbreviated Journal	MVAP
	Volume		Issue		Pages	1-20
	Keywords	Specular highlights; bright spot regions segmentation; region classification; colonoscopy
	Abstract	A novel specular highlights detection method in colonoscopy videos is presented. The method is based on a model of appearance dening specular highlights as bright spots which are highly contrasted with respect to adjacent regions. Our approach proposes two stages; segmentation, and then classication of bright spot regions. The former denes a set of candidate regions obtained through a region growing process with local maxima as initial region seeds. This process creates a tree structure which keeps track, at each growing iteration, of the region frontier contrast; nal regions provided depend on restrictions over contrast value. Non-specular regions are ltered through a classication stage performed by a linear SVM classier using model-based features from each region. We introduce a new validation database with more than 25; 000 regions along with their corresponding pixel-wise annotations. We perform a comparative study against other approaches. Results show that our method is superior to other approaches, with our segmented regions being closer to actual specular regions in the image. Finally, we also present how our methodology can also be used to obtain an accurate prediction of polyp histology.
	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	MV; 600.096; 600.175			Approved	no
	Call Number	Admin @ si @ SBS2017			Serial	2975
Permanent link to this record



	Author	Naveen Onkarappa; Angel Sappa
	Title	A Novel Space Variant Image Representation			Type	Journal Article
	Year	2013	Publication	Journal of Mathematical Imaging and Vision	Abbreviated Journal	JMIV
	Volume	47	Issue	1-2	Pages	48-59
	Keywords	Space-variant representation; Log-polar mapping; Onboard vision applications
	Abstract	Traditionally, in machine vision images are represented using cartesian coordinates with uniform sampling along the axes. On the contrary, biological vision systems represent images using polar coordinates with non-uniform sampling. For various advantages provided by space-variant representations many researchers are interested in space-variant computer vision. In this direction the current work proposes a novel and simple space variant representation of images. The proposed representation is compared with the classical log-polar mapping. The log-polar representation is motivated by biological vision having the characteristic of higher resolution at the fovea and reduced resolution at the periphery. On the contrary to the log-polar, the proposed new representation has higher resolution at the periphery and lower resolution at the fovea. Our proposal is proved to be a better representation in navigational scenarios such as driver assistance systems and robotics. The experimental results involve analysis of optical flow fields computed on both proposed and log-polar representations. Additionally, an egomotion estimation application is also shown as an illustrative example. The experimental analysis comprises results from synthetic as well as real sequences.
	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	0924-9907	ISBN		Medium
	Area		Expedition		Conference
	Notes	ADAS; 600.055; 605.203; 601.215			Approved	no
	Call Number	Admin @ si @ OnS2013a			Serial	2243
Permanent link to this record



	Author	Alvaro Cepero; Albert Clapes; Sergio Escalera
	Title	Automatic non-verbal communication skills analysis: a quantitative evaluation			Type	Journal Article
	Year	2015	Publication	AI Communications	Abbreviated Journal	AIC
	Volume	28	Issue	1	Pages	87-101
	Keywords	Social signal processing; human behavior analysis; multi-modal data description; multi-modal data fusion; non-verbal communication analysis; e-Learning
	Abstract	The oral communication competence is defined on the top of the most relevant skills for one's professional and personal life. Because of the importance of communication in our activities of daily living, it is crucial to study methods to evaluate and provide the necessary feedback that can be used in order to improve these communication capabilities and, therefore, learn how to express ourselves better. In this work, we propose a system capable of evaluating quantitatively the quality of oral presentations in an automatic fashion. The system is based on a multi-modal RGB, depth, and audio data description and a fusion approach in order to recognize behavioral cues and train classifiers able to eventually predict communication quality levels. The performance of the proposed system is tested on a novel dataset containing Bachelor thesis' real defenses, presentations from an 8th semester Bachelor courses, and Master courses' presentations at Universitat de Barcelona. Using as groundtruth the marks assigned by actual instructors, our system achieves high performance categorizing and ranking presentations by their quality, and also making real-valued mark predictions.
	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	0921-7126	ISBN		Medium
	Area		Expedition		Conference
	Notes	HUPBA;MILAB			Approved	no
	Call Number	Admin @ si @ CCE2015			Serial	2549
Permanent link to this record



	Author	Maedeh Aghaei; Mariella Dimiccoli; C. Canton-Ferrer; Petia Radeva
	Title	Towards social pattern characterization from egocentric photo-streams			Type	Journal Article
	Year	2018	Publication	Computer Vision and Image Understanding	Abbreviated Journal	CVIU
	Volume	171	Issue		Pages	104-117
	Keywords	Social pattern characterization; Social signal extraction; Lifelogging; Convolutional and recurrent neural networks
	Abstract	Following the increasingly popular trend of social interaction analysis in egocentric vision, this article presents a comprehensive pipeline for automatic social pattern characterization of a wearable photo-camera user. The proposed framework relies merely on the visual analysis of egocentric photo-streams and consists of three major steps. The first step is to detect social interactions of the user where the impact of several social signals on the task is explored. The detected social events are inspected in the second step for categorization into different social meetings. These two steps act at event-level where each potential social event is modeled as a multi-dimensional time-series, whose dimensions correspond to a set of relevant features for each task; finally, LSTM is employed to classify the time-series. The last step of the framework is to characterize social patterns of the user. Our goal is to quantify the duration, the diversity and the frequency of the user social relations in various social situations. This goal is achieved by the discovery of recurrences of the same people across the whole set of social events related to the user. Experimental evaluation over EgoSocialStyle – the proposed dataset in this work, and EGO-GROUP demonstrates promising results on the task of social pattern characterization from egocentric photo-streams.
	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 @ ADC2018			Serial	3022
Permanent link to this record



	Author	Sergio Escalera; Petia Radeva; Jordi Vitria; Xavier Baro; Bogdan Raducanu
	Title	Modelling and Analyzing Multimodal Dyadic Interactions Using Social Networks			Type	Conference Article
	Year	2010	Publication	12th International Conference on Multimodal Interfaces and 7th Workshop on Machine Learning for Multimodal Interaction.	Abbreviated Journal
	Volume		Issue		Pages
	Keywords	Social interaction; Multimodal fusion, Influence model; Social network analysis
	Abstract	Social network analysis became a common technique used to model and quantify the properties of social interactions. In this paper, we propose an integrated framework to explore the characteristics of a social network extracted from multimodal dyadic interactions. First, speech detection is performed through an audio/visual fusion scheme based on stacked sequential learning. In the audio domain, speech is detected through clusterization of audio features. Clusters are modelled by means of an One-state Hidden Markov Model containing a diagonal covariance Gaussian Mixture Model. In the visual domain, speech detection is performed through differential-based feature extraction from the segmented mouth region, and a dynamic programming matching procedure. Second, in order to model the dyadic interactions, we employed the Influence Model whose states encode the previous integrated audio/visual data. Third, the social network is extracted based on the estimated influences. For our study, we used a set of videos belonging to New York Times’ Blogging Heads opinion blog. The results are reported both in terms of accuracy of the audio/visual data fusion and centrality measures used to characterize the social network.
	Address	Beijing (China)
	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	ICMI-MLI
	Notes	OR;MILAB;HUPBA;MV			Approved	no
	Call Number	BCNPCL @ bcnpcl @ ERV2010			Serial	1427
Permanent link to this record



	Author	Petia Radeva; Joan Serrat; Enric Marti
	Title	A snake for model-based segmentation			Type	Conference Article
	Year	1995	Publication	Proc. Conf. Fifth Int Computer Vision	Abbreviated Journal
	Volume		Issue		Pages	816-821
	Keywords	snakes; elastic matching; model-based segmenta tion
	Abstract	Despite the promising results of numerous applications, the hitherto proposed snake techniques share some common problems: snake attraction by spurious edge points, snake degeneration (shrinking and attening), convergence and stability of the deformation process, snake initialization and local determination of the parameters of elasticity. We argue here that these problems can be solved only when all the snake aspects are considered. The snakes proposed here implement a new potential eld and external force in order to provide a deformation convergence, attraction by both near and far edges as well as snake behaviour selective according to the edge orientation. Furthermore, we conclude that in the case of model-based seg mentation, the internal force should include structural information about the expected snake shape. Experiments using this kind of snakes for segmenting bones in complex hand radiographs show a signicant improvement.
	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;ADAS;IAM			Approved	no
	Call Number	IAM @ iam @ RSM1995			Serial	1634
Permanent link to this record



	Author	Michal Drozdzal; Santiago Segui; Petia Radeva; Carolina Malagelada; Fernando Azpiroz; Jordi Vitria
	Title	Motility bar: a new tool for motility analysis of endoluminal videos			Type	Journal Article
	Year	2015	Publication	Computers in Biology and Medicine	Abbreviated Journal	CBM
	Volume	65	Issue		Pages	320-330
	Keywords	Small intestine; Motility; WCE; Computer vision; Image classification
	Abstract	Wireless Capsule Endoscopy (WCE) provides a new perspective of the small intestine, since it enables, for the first time, visualization of the entire organ. However, the long visual video analysis time, due to the large number of data in a single WCE study, was an important factor impeding the widespread use of the capsule as a tool for intestinal abnormalities detection. Therefore, the introduction of WCE triggered a new field for the application of computational methods, and in particular, of computer vision. In this paper, we follow the computational approach and come up with a new perspective on the small intestine motility problem. Our approach consists of three steps: first, we review a tool for the visualization of the motility information contained in WCE video; second, we propose algorithms for the characterization of two motility building-blocks: contraction detector and lumen size estimation; finally, we introduce an approach to detect segments of stable motility behavior. Our claims are supported by an evaluation performed with 10 WCE videos, suggesting that our methods ably capture the intestinal motility information.
	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;MV			Approved	no
	Call Number	Admin @ si @ DSR2015			Serial	2635
Permanent link to this record