Publicacions CVC -- Query Results

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

Search & Display Options

Select All Deselect All

[91–100] << 101 102 103 104 105 106 107 108 109 110 >> [111–120]

List View

Citations

Details

	Records
	Author	Mohamed Ramzy Ibrahim; Robert Benavente; Daniel Ponsa; Felipe Lumbreras
	Title	Unveiling the Influence of Image Super-Resolution on Aerial Scene Classification			Type	Conference Article
	Year	2023	Publication	Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications	Abbreviated Journal
	Volume	14469	Issue		Pages	214–228
	Keywords
	Abstract	Deep learning has made significant advances in recent years, and as a result, it is now in a stage where it can achieve outstanding results in tasks requiring visual understanding of scenes. However, its performance tends to decline when dealing with low-quality images. The advent of super-resolution (SR) techniques has started to have an impact on the field of remote sensing by enabling the restoration of fine details and enhancing image quality, which could help to increase performance in other vision tasks. However, in previous works, contradictory results for scene visual understanding were achieved when SR techniques were applied. In this paper, we present an experimental study on the impact of SR on enhancing aerial scene classification. Through the analysis of different state-of-the-art SR algorithms, including traditional methods and deep learning-based approaches, we unveil the transformative potential of SR in overcoming the limitations of low-resolution (LR) aerial imagery. By enhancing spatial resolution, more fine details are captured, opening the door for an improvement in scene understanding. We also discuss the effect of different image scales on the quality of SR and its effect on aerial scene classification. Our experimental work demonstrates the significant impact of SR on enhancing aerial scene classification compared to LR images, opening new avenues for improved remote sensing applications.
	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	CIARP
	Notes	MSIAU			Approved	no
	Call Number	Admin @ si @ IBP2023			Serial	4008
Permanent link to this record



	Author	Chenshen Wu
	Title	Going beyond Classification Problems for the Continual Learning of Deep Neural Networks			Type	Book Whole
	Year	2023	Publication	PhD Thesis, Universitat Autonoma de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep learning has made tremendous progress in the last decade due to the explosion of training data and computational power. Through end-to-end training on a large dataset, image representations are more discriminative than the previously used hand-crafted features. However, for many real-world applications, training and testing on a single dataset is not realistic, as the test distribution may change over time. Continuous learning takes this situation into account, where the learner must adapt to a sequence of tasks, each with a different distribution. If you would naively continue training the model with a new task, the performance of the model would drop dramatically for the previously learned data. This phenomenon is known as catastrophic forgetting. Many approaches have been proposed to address this problem, which can be divided into three main categories: regularization-based approaches, rehearsal-based approaches, and parameter isolation-based approaches. However, most of the existing works focus on image classification tasks and many other computer vision tasks have not been well-explored in the continual learning setting. Therefore, in this thesis, we study continual learning for image generation, object re-identification, and object counting. For the image generation problem, since the model can generate images from the previously learned task, it is free to apply rehearsal without any limitation. We developed two methods based on generative replay. The first one uses the generated image for joint training together with the new data. The second one is based on output pixel-wise alignment. We extensively evaluate these methods on several benchmarks. Next, we study continual learning for object Re-Identification (ReID). Although most state-of-the-art methods of ReID and continual ReID use softmax-triplet loss, we found that it is better to solve the ReID problem from a meta-learning perspective because continual learning of reID can benefit a lot from the generalization of metalearning. We also propose a distillation loss and found that the removal of the positive pairs before the distillation loss is critical. Finally, we study continual learning for the counting problem. We study the mainstream method based on density maps and propose a new approach for density map distillation. We found that fixing the counter head is crucial for the continual learning of object counting. To further improve results, we propose an adaptor to adapt the changing feature extractor for the fixed counter head. Extensive evaluation shows that this results in improved continual learning performance.
	Address
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	IMPRIMA	Place of Publication		Editor	Joost Van de Weijer;Bogdan Raducanu
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-84-126409-0-8	Medium
	Area		Expedition		Conference
	Notes	LAMP			Approved	no
	Call Number	Admin @ si @ Wu2023			Serial	3960
Permanent link to this record



	Author	Eduardo Aguilar; Bhalaji Nagarajan; Beatriz Remeseiro; Petia Radeva
	Title	Bayesian deep learning for semantic segmentation of food images			Type	Journal Article
	Year	2022	Publication	Computers and Electrical Engineering	Abbreviated Journal	CEE
	Volume	103	Issue		Pages	108380
	Keywords	Deep learning; Uncertainty quantification; Bayesian inference; Image segmentation; Food analysis
	Abstract	Deep learning has provided promising results in various applications; however, algorithms tend to be overconfident in their predictions, even though they may be entirely wrong. Particularly for critical applications, the model should provide answers only when it is very sure of them. This article presents a Bayesian version of two different state-of-the-art semantic segmentation methods to perform multi-class segmentation of foods and estimate the uncertainty about the given predictions. The proposed methods were evaluated on three public pixel-annotated food datasets. As a result, we can conclude that Bayesian methods improve the performance achieved by the baseline architectures and, in addition, provide information to improve decision-making. Furthermore, based on the extracted uncertainty map, we proposed three measures to rank the images according to the degree of noisy annotations they contained. Note that the top 135 images ranked by one of these measures include more than half of the worst-labeled food images.
	Address	October 2022
	Corporate Author				Thesis
	Publisher	Science Direct	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			Approved	no
	Call Number	Admin @ si @ ANR2022			Serial	3763
Permanent link to this record



	Author	Adriana Romero
	Title	Assisting the training of deep neural networks with applications to computer vision			Type	Book Whole
	Year	2015	Publication	PhD Thesis, Universitat de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep learning has recently been enjoying an increasing popularity due to its success in solving challenging tasks. In particular, deep learning has proven to be effective in a large variety of computer vision tasks, such as image classification, object recognition and image parsing. Contrary to previous research, which required engineered feature representations, designed by experts, in order to succeed, deep learning attempts to learn representation hierarchies automatically from data. More recently, the trend has been to go deeper with representation hierarchies. Learning (very) deep representation hierarchies is a challenging task, which involves the optimization of highly non-convex functions. Therefore, the search for algorithms to ease the learning of (very) deep representation hierarchies from data is extensive and ongoing. In this thesis, we tackle the challenging problem of easing the learning of (very) deep representation hierarchies. We present a hyper-parameter free, off-the-shelf, simple and fast unsupervised algorithm to discover hidden structure from the input data by enforcing a very strong form of sparsity. We study the applicability and potential of the algorithm to learn representations of varying depth in a handful of applications and domains, highlighting the ability of the algorithm to provide discriminative feature representations that are able to achieve top performance. Yet, while emphasizing the great value of unsupervised learning methods when labeled data is scarce, the recent industrial success of deep learning has revolved around supervised learning. Supervised learning is currently the focus of many recent research advances, which have shown to excel at many computer vision tasks. Top performing systems often involve very large and deep models, which are not well suited for applications with time or memory limitations. More in line with the current trends, we engage in making top performing models more efficient, by designing very deep and thin models. Since training such very deep models still appears to be a challenging task, we introduce a novel algorithm that guides the training of very thin and deep models by hinting their intermediate representations. Very deep and thin models trained by the proposed algorithm end up extracting feature representations that are comparable or even better performing than the ones extracted by large state-of-the-art models, while compellingly reducing the time and memory consumption of the model.
	Address	October 2015
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Carlo Gatta;Petia Radeva
	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			Approved	no
	Call Number	Admin @ si @ Rom2015			Serial	2707
Permanent link to this record



	Author	Ahmed M. A. Salih; Ilaria Boscolo Galazzo; Zahra Zahra Raisi-Estabragh; Steffen E. Petersen; Polyxeni Gkontra; Karim Lekadir; Gloria Menegaz; Petia Radeva
	Title	A new scheme for the assessment of the robustness of Explainable Methods Applied to Brain Age estimation			Type	Conference Article
	Year	2021	Publication	34th International Symposium on Computer-Based Medical Systems	Abbreviated Journal
	Volume		Issue		Pages	492-497
	Keywords
	Abstract	Deep learning methods show great promise in a range of settings including the biomedical field. Explainability of these models is important in these fields for building end-user trust and to facilitate their confident deployment. Although several Machine Learning Interpretability tools have been proposed so far, there is currently no recognized evaluation standard to transfer the explainability results into a quantitative score. Several measures have been proposed as proxies for quantitative assessment of explainability methods. However, the robustness of the list of significant features provided by the explainability methods has not been addressed. In this work, we propose a new proxy for assessing the robustness of the list of significant features provided by two explainability methods. Our validation is defined at functionality-grounded level based on the ranked correlation statistical index and demonstrates its successful application in the framework of brain aging estimation. We assessed our proxy to estimate brain age using neuroscience data. Our results indicate small variability and high robustness in the considered explainability methods using this new proxy.
	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	CBMS
	Notes	MILAB; no proj			Approved	no
	Call Number	Admin @ si @ SBZ2021			Serial	3629
Permanent link to this record



	Author	Felipe Codevilla; Matthias Muller; Antonio Lopez; Vladlen Koltun; Alexey Dosovitskiy
	Title	End-to-end Driving via Conditional Imitation Learning			Type	Conference Article
	Year	2018	Publication	IEEE International Conference on Robotics and Automation	Abbreviated Journal
	Volume		Issue		Pages	4693 - 4700
	Keywords
	Abstract	Deep networks trained on demonstrations of human driving have learned to follow roads and avoid obstacles. However, driving policies trained via imitation learning cannot be controlled at test time. A vehicle trained end-to-end to imitate an expert cannot be guided to take a specific turn at an upcoming intersection. This limits the utility of such systems. We propose to condition imitation learning on high-level command input. At test time, the learned driving policy functions as a chauffeur that handles sensorimotor coordination but continues to respond to navigational commands. We evaluate different architectures for conditional imitation learning in vision-based driving. We conduct experiments in realistic three-dimensional simulations of urban driving and on a 1/5 scale robotic truck that is trained to drive in a residential area. Both systems drive based on visual input yet remain responsive to high-level navigational commands. The supplementary video can be viewed at this https URL
	Address	Brisbane; Australia; May 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	ICRA
	Notes	ADAS; 600.116; 600.124; 600.118			Approved	no
	Call Number	Admin @ si @ CML2018			Serial	3108
Permanent link to this record



	Author	Bhalaji Nagarajan; Marc Bolaños; Eduardo Aguilar; Petia Radeva
	Title	Deep ensemble-based hard sample mining for food recognition			Type	Journal Article
	Year	2023	Publication	Journal of Visual Communication and Image Representation	Abbreviated Journal	JVCIR
	Volume	95	Issue		Pages	103905
	Keywords
	Abstract	Deep neural networks represent a compelling technique to tackle complex real-world problems, but are over-parameterized and often suffer from over- or under-confident estimates. Deep ensembles have shown better parameter estimations and often provide reliable uncertainty estimates that contribute to the robustness of the results. In this work, we propose a new metric to identify samples that are hard to classify. Our metric is defined as coincidence score for deep ensembles which measures the agreement of its individual models. The main hypothesis we rely on is that deep learning algorithms learn the low-loss samples better compared to large-loss samples. In order to compensate for this, we use controlled over-sampling on the identified ”hard” samples using proper data augmentation schemes to enable the models to learn those samples better. We validate the proposed metric using two public food datasets on different backbone architectures and show the improvements compared to the conventional deep neural network training using different performance 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	MILAB			Approved	no
	Call Number	Admin @ si @ NBA2023			Serial	3844
Permanent link to this record



	Author	Marc Masana; Joost Van de Weijer; Luis Herranz;Andrew Bagdanov; Jose Manuel Alvarez
	Title	Domain-adaptive deep network compression			Type	Conference Article
	Year	2017	Publication	17th IEEE International Conference on Computer Vision	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep Neural Networks trained on large datasets can be easily transferred to new domains with far fewer labeled examples by a process called fine-tuning. This has the advantage that representations learned in the large source domain can be exploited on smaller target domains. However, networks designed to be optimal for the source task are often prohibitively large for the target task. In this work we address the compression of networks after domain transfer. We focus on compression algorithms based on low-rank matrix decomposition. Existing methods base compression solely on learned network weights and ignore the statistics of network activations. We show that domain transfer leads to large shifts in network activations and that it is desirable to take this into account when compressing. We demonstrate that considering activation statistics when compressing weights leads to a rank-constrained regression problem with a closed-form solution. Because our method takes into account the target domain, it can more optimally remove the redundancy in the weights. Experiments show that our Domain Adaptive Low Rank (DALR) method significantly outperforms existing low-rank compression techniques. With our approach, the fc6 layer of VGG19 can be compressed more than 4x more than using truncated SVD alone – with only a minor or no loss in accuracy. When applied to domain-transferred networks it allows for compression down to only 5-20% of the original number of parameters with only a minor drop in performance.
	Address	Venice; Italy; 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	ICCV
	Notes	LAMP; 601.305; 600.106; 600.120			Approved	no
	Call Number	Admin @ si @			Serial	3034
Permanent link to this record



	Author	Alberto Hidalgo; Ferran Poveda; Enric Marti;Debora Gil;Albert Andaluz; Francesc Carreras; Manuel Ballester
	Title	Evidence of continuous helical structure of the cardiac ventricular anatomy assessed by diffusion tensor imaging magnetic resonance multiresolution tractography			Type	Journal Article
	Year	2012	Publication	European Radiology	Abbreviated Journal	ECR
	Volume	3	Issue	1	Pages	361-362
	Keywords
	Abstract	Deep understanding of myocardial structure linking morphology and func- tion of the heart would unravel crucial knowledge for medical and surgical clinical procedures and studies. Diffusion tensor MRI provides a discrete measurement of the 3D arrangement of myocardial fibres by the observation of local anisotropic diffusion of water molecules in biological tissues. In this work, we present a multi- scale visualisation technique based on DT-MRI streamlining capable of uncovering additional properties of the architectural organisation of the heart. Methods and Materials: We selected the John Hopkins University (JHU) Canine Heart Dataset, where the long axis cardiac plane is aligned with the scanner’s Z- axis. Their equipment included a 4-element passed array coil emitting a 1.5 T. For DTI acquisition, a 3D-FSE sequence is apply. We used 200 seeds for full-scale tractography, while we applied a MIP mapping technique for simplified tractographic reconstruction. In this case, we reduced each DTI 3D volume dimensions by order- two magnitude before streamlining. Our simplified tractographic reconstruction method keeps the main geometric features of fibres, allowing for an easier identification of their global morphological disposition, including the ventricular basal ring. Moreover, we noticed a clearly visible helical disposition of the myocardial fibres, in line with the helical myocardial band ventricular structure described by Torrent-Guasp. Finally, our simplified visualisation with single tracts identifies the main segments of the helical ventricular architecture. DT-MRI makes possible the identification of a continuous helical architecture of the myocardial fibres, which validates Torrent-Guasp’s helical myocardial band ventricular anatomical model.
	Address	Viena, Austria
	Corporate Author				Thesis
	Publisher	Springer Link	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	1869-4101	ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ HPM2012			Serial	1858
Permanent link to this record



	Author	Ferran Poveda; Debora Gil; Enric Marti; Albert Andaluz; Manel Ballester;Francesc Carreras Costa
	Title	Helical structure of the cardiac ventricular anatomy assessed by Diffusion Tensor Magnetic Resonance Imaging multi-resolution tractography			Type	Journal Article
	Year	2013	Publication	Revista Española de Cardiología	Abbreviated Journal	REC
	Volume	66	Issue	10	Pages	782-790
	Keywords	Heart;Diffusion magnetic resonance imaging;Diffusion tractography;Helical heart;Myocardial ventricular band.
	Abstract	Deep understanding of myocardial structure linking morphology and function of the heart would unravel crucial knowledge for medical and surgical clinical procedures and studies. Several conceptual models of myocardial fiber organization have been proposed but the lack of an automatic and objective methodology prevented an agreement. We sought to deepen in this knowledge through advanced computer graphic representations of the myocardial fiber architecture by diffusion tensor magnetic resonance imaging (DT-MRI). We performed automatic tractography reconstruction of unsegmented DT-MRI canine heart datasets coming from the public database of the Johns Hopkins University. Full scale tractographies have been build with 200 seeds and are composed by streamlines computed on the vectorial field of primary eigenvectors given at the diffusion tensor volumes. Also, we introduced a novel multi-scale visualization technique in order to obtain a simplified tractography. This methodology allowed to keep the main geometric features of the fiber tracts, making easier to decipher the main properties of the architectural organization of the heart. On the analysis of the output from our tractographic representations we found exact correlation with low-level details of myocardial architecture, but also with the more abstract conceptualization of a continuous helical ventricular myocardial fiber array. Objective analysis of myocardial architecture by an automated method, including the entire myocardium and using several 3D levels of complexity, reveals a continuous helical myocardial fiber arrangement of both right and left ventricles, supporting the anatomical model of the helical ventricular myocardial band described by Torrent-Guasp.
	Address
	Corporate Author				Thesis
	Publisher	Elsevier	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	IAM; 600.044; 600.060			Approved	no
	Call Number	IAM @ iam @ PGM2013			Serial	2194
Permanent link to this record



	Author	Ferran Poveda; Jaume Garcia; Enric Marti; Debora Gil
	Title	Validation of the myocardial architecture in DT-MRI tractography			Type	Conference Article
	Year	2010	Publication	Medical Image Computing in Catalunya: Graduate Student Workshop	Abbreviated Journal
	Volume		Issue		Pages	29-30
	Keywords
	Abstract	Deep understanding of myocardial structure may help to link form and funcion of the heart unraveling crucial knowledge for medical and surgical clinical procedures and studies. In this work we introduce two visualization techniques based on DT-MRI streamlining able to decipher interesting properties of the architectural organization of the heart.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication	Girona (Spain)	Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	MICCAT
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ PGM2010			Serial	1626
Permanent link to this record



	Author	Debora Gil; Agnes Borras; Manuel Ballester; Francesc Carreras; Ruth Aris; Manuel Vazquez; Enric Marti; Ferran Poveda
	Title	MIOCARDIA: Integrating cardiac function and muscular architecture for a better diagnosis			Type	Conference Article
	Year	2011	Publication	14th International Symposium on Applied Sciences in Biomedical and Communication Technologies	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deep understanding of myocardial structure of the heart would unravel crucial knowledge for clinical and medical procedures. The MIOCARDIA project is a multidisciplinary project in cooperation with l'Hospital de la Santa Creu i de Sant Pau, Clinica la Creu Blanca and Barcelona Supercomputing Center. The ultimate goal of this project is defining a computational model of the myocardium. The model takes into account the deep interrelation between the anatomy and the mechanics of the heart. The paper explains the workflow of the MIOCARDIA project. It also introduces a multiresolution reconstruction technique based on DT-MRI streamlining for simplified global myocardial model generation. Our reconstructions can restore the most complex myocardial structures and provides evidences of a global helical organization.
	Address	Barcelona; Spain
	Corporate Author	Association for Computing Machinery			Thesis
	Publisher		Place of Publication	Barcelona, Spain	Editor	Association for Computing Machinery
	Language	english	Summary Language	english	Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-1-4503-0913-4	Medium
	Area		Expedition		Conference	ISABEL
	Notes	IAM			Approved	no
	Call Number	IAM @ iam @ GGB2011			Serial	1691
Permanent link to this record



	Author	Cesar de Souza; Adrien Gaidon; Yohann Cabon; Naila Murray; Antonio Lopez
	Title	Generating Human Action Videos by Coupling 3D Game Engines and Probabilistic Graphical Models			Type	Journal Article
	Year	2020	Publication	International Journal of Computer Vision	Abbreviated Journal	IJCV
	Volume	128	Issue		Pages	1505–1536
	Keywords	Procedural generation; Human action recognition; Synthetic data; Physics
	Abstract	Deep video action recognition models have been highly successful in recent years but require large quantities of manually-annotated data, which are expensive and laborious to obtain. In this work, we investigate the generation of synthetic training data for video action recognition, as synthetic data have been successfully used to supervise models for a variety of other computer vision tasks. We propose an interpretable parametric generative model of human action videos that relies on procedural generation, physics models and other components of modern game engines. With this model we generate a diverse, realistic, and physically plausible dataset of human action videos, called PHAV for “Procedural Human Action Videos”. PHAV contains a total of 39,982 videos, with more than 1000 examples for each of 35 action categories. Our video generation approach is not limited to existing motion capture sequences: 14 of these 35 categories are procedurally-defined synthetic actions. In addition, each video is represented with 6 different data modalities, including RGB, optical flow and pixel-level semantic labels. These modalities are generated almost simultaneously using the Multiple Render Targets feature of modern GPUs. In order to leverage PHAV, we introduce a deep multi-task (i.e. that considers action classes from multiple datasets) representation learning architecture that is able to simultaneously learn from synthetic and real video datasets, even when their action categories differ. Our experiments on the UCF-101 and HMDB-51 benchmarks suggest that combining our large set of synthetic videos with small real-world datasets can boost recognition performance. Our approach also significantly outperforms video representations produced by fine-tuning state-of-the-art unsupervised generative models of videos.
	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.124; 600.118			Approved	no
	Call Number	Admin @ si @ SGC2019			Serial	3303
Permanent link to this record



	Author	Oriol Pujol; Petia Radeva
	Title	Texture Segmentation by Statistical Deformable Models			Type	Journal
	Year	2004	Publication	International Journal of Image and Graphics	Abbreviated Journal	IJIG
	Volume	4	Issue	3	Pages	433-452
	Keywords	Texture segmentation, parametric active contours, statistic snakes
	Abstract	Deformable models have received much popularity due to their ability to include high-level knowledge on the application domain into low-level image processing. Still, most proposed active contour models do not sufficiently profit from the application information and they are too generalized, leading to non-optimal final results of segmentation, tracking or 3D reconstruction processes. In this paper we propose a new deformable model defined in a statistical framework to segment objects of natural scenes. We perform a supervised learning of local appearance of the textured objects and construct a feature space using a set of co-occurrence matrix measures. Linear Discriminant Analysis allows us to obtain an optimal reduced feature space where a mixture model is applied to construct a likelihood map. Instead of using a heuristic potential field, our active model is deformed on a regularized version of the likelihood map in order to segment objects characterized by the same texture pattern. Different tests on synthetic images, natural scene and medical images show the advantages of our statistic deformable model.
	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;HuPBA			Approved	no
	Call Number	BCNPCL @ bcnpcl @ PuR2004a			Serial	505
Permanent link to this record



	Author	Petia Radeva; Enric Marti
	Title	Facial Features Segmentation by Model-Based Snakes			Type	Conference Article
	Year	1995	Publication	International Conference on Computing Analysis and Image Processing	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Deformable models have recently been accepted as a standard technique to segment different features in facial images. Despite they give a good approximation of the salient features in a facial image, the resulting shapes of the segmentation process seem somewhat artificial with respect to the natural feature shapes. In this paper we show that active contour models (in particular, rubber snakes) give more close and natural representation of the detected feature shape. Besides, using snakes for facial segmentation frees us from the problem of determination of the numerous weigths of deformable models. Another advantage of rubber snakes is their reduced computational cost. Our experiments using rubber snakes for segmentation of facial snapshots have shown a significant improvement compared to deformable models.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication	Bellaterra (Barcelona), Spain	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;IAM			Approved	no
	Call Number	IAM @ iam @ RAM1995a			Serial	1633
Permanent link to this record