| Home | [131–140] << 141 142 143 144 145 146 147 148 149 150 >> [151–160] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Lei Li; Fuping Wu; Sihan Wang; Xinzhe Luo; Carlos Martin-Isla; Shuwei Zhai; Jianpeng Zhang; Yanfei Liu; Zhen Zhang; Markus J. Ankenbrand; Haochuan Jiang; Xiaoran Zhang; Linhong Wang; Tewodros Weldebirhan Arega; Elif Altunok; Zhou Zhao; Feiyan Li; Jun Ma; Xiaoping Yang; Elodie Puybareau; Ilkay Oksuz; Stephanie Bricq; Weisheng Li;Kumaradevan Punithakumar; Sotirios A. Tsaftaris; Laura M. Schreiber; Mingjing Yang; Guocai Liu; Yong Xia; Guotai Wang; Sergio Escalera; Xiahai Zhuag | ||||
Title  |
MyoPS: A benchmark of myocardial pathology segmentation combining three-sequence cardiac magnetic resonance images | Type | Journal Article | ||
| Year | 2023 | Publication | Medical Image Analysis | Abbreviated Journal | MIA |
| Volume | 87 | Issue | Pages | 102808 | |
| Keywords | |||||
| Abstract | Assessment of myocardial viability is essential in diagnosis and treatment management of patients suffering from myocardial infarction, and classification of pathology on the myocardium is the key to this assessment. This work defines a new task of medical image analysis, i.e., to perform myocardial pathology segmentation (MyoPS) combining three-sequence cardiac magnetic resonance (CMR) images, which was first proposed in the MyoPS challenge, in conjunction with MICCAI 2020. Note that MyoPS refers to both myocardial pathology segmentation and the challenge in this paper. The challenge provided 45 paired and pre-aligned CMR images, allowing algorithms to combine the complementary information from the three CMR sequences for pathology segmentation. In this article, we provide details of the challenge, survey the works from fifteen participants and interpret their methods according to five aspects, i.e., preprocessing, data augmentation, learning strategy, model architecture and post-processing. In addition, we analyze the results with respect to different factors, in order to examine the key obstacles and explore the potential of solutions, as well as to provide a benchmark for future research. The average Dice scores of submitted algorithms were and for myocardial scars and edema, respectively. We conclude that while promising results have been reported, the research is still in the early stage, and more in-depth exploration is needed before a successful application to the clinics. MyoPS data and evaluation tool continue to be publicly available upon registration via its homepage (www.sdspeople.fudan.edu.cn/zhuangxiahai/0/myops20/). | ||||
| 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 | Approved | no | ||
| Call Number | Admin @ si @ LWW2023a | Serial | 3878 | ||
| Permanent link to this record | |||||
| Author | Joan Serrat; Felipe Lumbreras; Francisco Blanco; Manuel Valiente; Montserrat Lopez-Mesas | ||||
| Title |
myStone: A system for automatic kidney stone classification | Type | Journal Article | ||
| Year | 2017 | Publication | Expert Systems with Applications | Abbreviated Journal | ESA |
| Volume | 89 | Issue | Pages | 41-51 | |
| Keywords | Kidney stone; Optical device; Computer vision; Image classification | ||||
| Abstract | Kidney stone formation is a common disease and the incidence rate is constantly increasing worldwide. It has been shown that the classification of kidney stones can lead to an important reduction of the recurrence rate. The classification of kidney stones by human experts on the basis of certain visual color and texture features is one of the most employed techniques. However, the knowledge of how to analyze kidney stones is not widespread, and the experts learn only after being trained on a large number of samples of the different classes. In this paper we describe a new device specifically designed for capturing images of expelled kidney stones, and a method to learn and apply the experts knowledge with regard to their classification. We show that with off the shelf components, a carefully selected set of features and a state of the art classifier it is possible to automate this difficult task to a good degree. We report results on a collection of 454 kidney stones, achieving an overall accuracy of 63% for a set of eight classes covering almost all of the kidney stones taxonomy. Moreover, for more than 80% of samples the real class is the first or the second most probable class according to the system, being then the patient recommendations for the two top classes similar. This is the first attempt towards the automatic visual classification of kidney stones, and based on the current results we foresee better accuracies with the increase of the dataset size. | ||||
| 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; MSIAU; 603.046; 600.122; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ SLB2017 | Serial | 3026 | ||
| Permanent link to this record | |||||
| Author | Eduard Vazquez; Francesc Tous; Ramon Baldrich; Maria Vanrell | ||||
| Title |
n-Dimensional Distribution Reduction Preserving its Structure | Type | Book Chapter | ||
| Year | 2006 | Publication | Artificial Intelligence Research and Development, M. Polit et al. (Eds.), 146: 167–175 | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | IOS Press | ||||
| 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 | CIC | Approved | no | ||
| Call Number | CAT @ cat @ VTB2006a | Serial | 681 | ||
| Permanent link to this record | |||||
| Author | Manuel Carbonell; Pau Riba; Mauricio Villegas; Alicia Fornes; Josep Llados | ||||
| Title |
Named Entity Recognition and Relation Extraction with Graph Neural Networks in Semi Structured Documents | Type | Conference Article | ||
| Year | 2020 | Publication | 25th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | The use of administrative documents to communicate and leave record of business information requires of methods
able to automatically extract and understand the content from such documents in a robust and efficient way. In addition, the semi-structured nature of these reports is specially suited for the use of graph-based representations which are flexible enough to adapt to the deformations from the different document templates. Moreover, Graph Neural Networks provide the proper methodology to learn relations among the data elements in these documents. In this work we study the use of Graph Neural Network architectures to tackle the problem of entity recognition and relation extraction in semi-structured documents. Our approach achieves state of the art results in the three tasks involved in the process. Additionally, the experimentation with two datasets of different nature demonstrates the good generalization ability of our approach. |
||||
| Address | Virtual; January 2021 | ||||
| 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.121 | Approved | no | ||
| Call Number | Admin @ si @ CRV2020 | Serial | 3509 | ||
| Permanent link to this record | |||||
| Author | Marc Serra; Olivier Penacchio; Robert Benavente; Maria Vanrell | ||||
| Title |
Names and Shades of Color for Intrinsic Image Estimation | Type | Conference Article | ||
| Year | 2012 | Publication | 25th IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 278-285 | ||
| Keywords | |||||
| Abstract | In the last years, intrinsic image decomposition has gained attention. Most of the state-of-the-art methods are based on the assumption that reflectance changes come along with strong image edges. Recently, user intervention in the recovery problem has proved to be a remarkable source of improvement. In this paper, we propose a novel approach that aims to overcome the shortcomings of pure edge-based methods by introducing strong surface descriptors, such as the color-name descriptor which introduces high-level considerations resembling top-down intervention. We also use a second surface descriptor, termed color-shade, which allows us to include physical considerations derived from the image formation model capturing gradual color surface variations. Both color cues are combined by means of a Markov Random Field. The method is quantitatively tested on the MIT ground truth dataset using different error metrics, achieving state-of-the-art performance. | ||||
| Address | Providence, Rhode Island | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE Xplore | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1063-6919 | ISBN | 978-1-4673-1226-4 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ SPB2012 | Serial | 2026 | ||
| Permanent link to this record | |||||
| Author | Javier Vazquez; Robert Benavente; Maria Vanrell | ||||
| Title |
Naming constraints constancy | Type | Conference Article | ||
| Year | 2012 | Publication | 2nd Joint AVA / BMVA Meeting on Biological and Machine Vision | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Different studies have shown that languages from industrialized cultures
share a set of 11 basic colour terms: red, green, blue, yellow, pink, purple, brown, orange, black, white, and grey (Berlin & Kay, 1969, Basic Color Terms, University of California Press)( Kay & Regier, 2003, PNAS, 100, 9085-9089). Some of these studies have also reported the best representatives or focal values of each colour (Boynton and Olson, 1990, Vision Res. 30,1311–1317), (Sturges and Whitfield, 1995, CRA, 20:6, 364–376). Some further studies have provided us with fuzzy datasets for color naming by asking human observers to rate colours in terms of membership values (Benavente -et al-, 2006, CRA. 31:1, 48–56,). Recently, a computational model based on these human ratings has been developed (Benavente -et al-, 2008, JOSA-A, 25:10, 2582-2593). This computational model follows a fuzzy approach to assign a colour name to a particular RGB value. For example, a pixel with a value (255,0,0) will be named 'red' with membership 1, while a cyan pixel with a RGB value of (0, 200, 200) will be considered to be 0.5 green and 0.5 blue. In this work, we show how this colour naming paradigm can be applied to different computer vision tasks. In particular, we report results in colour constancy (Vazquez-Corral -et al-, 2012, IEEE TIP, in press) showing that the classical constraints on either illumination or surface reflectance can be substituted by the statistical properties encoded in the colour names. [Supported by projects TIN2010-21771-C02-1, CSD2007-00018]. |
||||
| 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 | AV A | ||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ VBV2012 | Serial | 2131 | ||
| Permanent link to this record | |||||
| Author | A. Martinez; S. Gonzalez; Jordi Vitria; J. Lopez | ||||
| Title |
NAT: a robot that recognizes offices. | Type | Miscellaneous | ||
| Year | 1997 | Publication | Proceedings of CAEPIA–97. | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ MGV1997 | Serial | 46 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Fadi Dornaika | ||||
| Title |
Natural Facial Expression Recognition Using Dynamic and Static Schemes | Type | Conference Article | ||
| Year | 2009 | Publication | 5th International Symposium on Visual Computing | Abbreviated Journal | |
| Volume | 5875 | Issue | Pages | 730–739 | |
| Keywords | |||||
| Abstract | Affective computing is at the core of a new paradigm in HCI and AI represented by human-centered computing. Within this paradigm, it is expected that machines will be enabled with perceiving capabilities, making them aware about users’ affective state. The current paper addresses the problem of facial expression recognition from monocular videos sequences. We propose a dynamic facial expression recognition scheme, which is proven to be very efficient. Furthermore, it is conveniently compared with several static-based systems adopting different magnitude of facial expression. We provide evaluations of performance using Linear Discriminant Analysis (LDA), Non parametric Discriminant Analysis (NDA), and Support Vector Machines (SVM). We also provide performance evaluations using arbitrary test video sequences. | ||||
| Address | Las Vegas, USA | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-10330-8 | Medium | |
| Area | Expedition | Conference | ISVC | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ RaD2009 | Serial | 1257 | ||
| Permanent link to this record | |||||
| Author | Carles Fernandez; Pau Baiget; Xavier Roca; Jordi Gonzalez | ||||
| Title |
Natural Language Descriptions of Human Behavior from Video Sequences | Type | Conference Article | ||
| Year | 2007 | Publication | Advances in Artificial Intelligence, 30th Annual Conference on Artificial Intelligence | Abbreviated Journal | |
| Volume | 4667 | Issue | Pages | 279–292 | |
| Keywords | |||||
| Abstract | |||||
| 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 | KI | ||
| Notes | ISE | Approved | no | ||
| Call Number | ISE @ ise @ FBR2007b | Serial | 921 | ||
| Permanent link to this record | |||||
| Author | Carles Fernandez | ||||
| Title |
Natural Language for Human Behavior Evaluation in Video Sequences | Type | Report | ||
| Year | 2007 | Publication | CVC Technical Report #101 | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | CVC (UAB) | ||||
| 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 | Approved | no | |||
| Call Number | Admin @ si @ Fer2007 | Serial | 817 | ||
| Permanent link to this record | |||||
| Author | Olivier Penacchio; C. Alejandro Parraga; Maria Vanrell | ||||
| Title |
Natural Scene Statistics account for Human Cones Ratios | Type | Journal Article | ||
| Year | 2010 | Publication | Perception. ECVP Abstract Supplement | Abbreviated Journal | PER |
| Volume | 39 | Issue | Pages | 101 | |
| Keywords | |||||
| Abstract | In two previous experiments [Parraga et al, 2009 J. of Im. Sci. and Tech 53(3) 031106; Benavente et al,2009 Perception 38 ECVP Supplement, 36] the boundaries of basic colour categories were measured.
In the first experiment, samples were presented in isolation (ie on a dark background) and boundaries were measured using a yes/no paradigm. In the second, subjects adjusted the chromaticity of a sample presented on a random Mondrian background to find the boundary between pairs of adjacent colours. Results from these experiments showed significant di erences but it was not possible to conclude whether this discrepancy was due to the absence/presence of a colourful background or to the di erences in the paradigms used. In this work, we settle this question by repeating the first experiment (ie samples presented on a dark background) using the second paradigm. A comparison of results shows that although boundary locations are very similar, boundaries measured in context are significantly di erent(more di use) than those measured in isolation (confirmed by a Student’s t-test analysis on the subject’s answers statistical distributions). In addition, we completed the mapping of colour name space by measuring the boundaries between chromatic colours and the achromatic centre. With these results we completed our parametric fuzzy-sets model of colour naming space. |
||||
| 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 | CIC | Approved | no | ||
| Call Number | CAT @ cat @ PPV2010 | Serial | 1357 | ||
| 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 | Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal | ||||
| Title |
Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents | Type | Conference Article | ||
| Year | 2013 | Publication | 12th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1078-1082 | ||
| Keywords | |||||
| Abstract | This paper deals with a subgraph matching problem in Region Adjacency Graph (RAG) applied to symbol spotting in graphical documents. RAG is a very important, efficient and natural way of representing graphical information with a graph but this is limited to cases where the information is well defined with perfectly delineated regions. What if the information we are interested in is not confined within well defined regions? This paper addresses this particular problem and solves it by defining near convex grouping of oriented line segments which results in near convex regions. Pure convexity imposes hard constraints and can not handle all the cases efficiently. Hence to solve this problem we have defined a new type of convexity of regions, which allows convex regions to have concavity to some extend. We call this kind of regions Near Convex Regions (NCRs). These NCRs are then used to create the Near Convex Region Adjacency Graph (NCRAG) and with this representation we have formulated the problem of symbol spotting in graphical documents as a subgraph matching problem. For subgraph matching we have used the Approximate Edit Distance Algorithm (AEDA) on the neighborhood string, which starts working after finding a key node in the input or target graph and iteratively identifies similar nodes of the query graph in the neighborhood of the key node. The experiments are performed on artificial, real and distorted datasets. | ||||
| Address | Washington; USA; August 2013 | ||||
| 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 | 1520-5363 | ISBN | Medium | ||
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.045; 600.056; 600.061; 601.152 | Approved | no | ||
| Call Number | Admin @ si @ DLB2013a | Serial | 2358 | ||
| Permanent link to this record | |||||
| Author | Patricia Suarez; Angel Sappa; Boris X. Vintimilla; Riad I. Hammoud | ||||
| Title |
Near InfraRed Imagery Colorization | Type | Conference Article | ||
| Year | 2018 | Publication | 25th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 2237 - 2241 | ||
| Keywords | Convolutional Neural Networks (CNN), Generative Adversarial Network (GAN), Infrared Imagery colorization | ||||
| Abstract | This paper proposes a stacked conditional Generative Adversarial Network-based method for Near InfraRed (NIR) imagery colorization. We propose a variant architecture of Generative Adversarial Network (GAN) that uses multiple
loss functions over a conditional probabilistic generative model. We show that this new architecture/loss-function yields better generalization and representation of the generated colored IR images. The proposed approach is evaluated on a large test dataset and compared to recent state of the art methods using standard metrics. |
||||
| Address | Athens; Greece; October 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 | ICIP | ||
| Notes | MSIAU; 600.086; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ SSV2018b | Serial | 3195 | ||
| Permanent link to this record | |||||
| Author | Oriol Pujol; David Rotger; Petia Radeva; O. Rodriguez; J. Mauri | ||||
| Title |
Near Real Time Plaque Segmentation of IVUS | Type | Miscellaneous | ||
| Year | 2003 | Publication | Proceedings of Computers in Cardiology | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | |||||
| Address | Thessaloniki | ||||
| 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 @ PRR2003b | Serial | 401 | ||
| Permanent link to this record | |||||