| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–15] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Arnau Baro; Pau Riba; Jorge Calvo-Zaragoza; Alicia Fornes | ||||
| Title | Optical Music Recognition by Long Short-Term Memory Networks | Type | Book Chapter | ||
| Year | 2018 | Publication | Graphics Recognition. Current Trends and Evolutions | Abbreviated Journal | |
Volume  |
11009 | Issue | Pages | 81-95 | |
| Keywords | Optical Music Recognition; Recurrent Neural Network; Long ShortTerm Memory | ||||
| Abstract | Optical Music Recognition refers to the task of transcribing the image of a music score into a machine-readable format. Many music scores are written in a single staff, and therefore, they could be treated as a sequence. Therefore, this work explores the use of Long Short-Term Memory (LSTM) Recurrent Neural Networks for reading the music score sequentially, where the LSTM helps in keeping the context. For training, we have used a synthetic dataset of more than 40000 images, labeled at primitive level. The experimental results are promising, showing the benefits of our approach. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer | Place of Publication | Editor | A. Fornes, B. Lamiroy | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-030-02283-9 | Medium | ||
| Area | Expedition | Conference | GREC | ||
| Notes | DAG; 600.097; 601.302; 601.330; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ BRC2018 | Serial | 3227 | ||
| Permanent link to this record | |||||
| Author | Hana Jarraya; Muhammad Muzzamil Luqman; Jean-Yves Ramel | ||||
| Title | Improving Fuzzy Multilevel Graph Embedding Technique by Employing Topological Node Features: An Application to Graphics Recognition | Type | Book Chapter | ||
| Year | 2017 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
9657 | Issue | Pages | ||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer | Place of Publication | Editor | B. Lamiroy; R Dueire Lins | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | GREC | ||
| Notes | DAG; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ JLR2017 | Serial | 2928 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Alicia Fornes; Josep Llados | ||||
| Title | Towards the Alignment of Handwritten Music Scores | Type | Book Chapter | ||
| Year | 2017 | Publication | International Workshop on Graphics Recognition. GREC 2015.Graphic Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
9657 | Issue | Pages | 103-116 | |
| Keywords | Optical Music Recognition; Handwritten Music Scores; Dynamic Time Warping alignment | ||||
| Abstract | It is very common to nd di erent versions of the same music work in archives of Opera Theaters. These di erences correspond to modi cations and annotations from the musicians. From the musicologist point of view, these variations are very interesting and deserve study.
This paper explores the alignment of music scores as a tool for automatically detecting the passages that contain such di erences. Given the diculties in the recognition of handwritten music scores, our goal is to align the music scores and at the same time, avoid the recognition of music elements as much as possible. After removing the sta lines, braces and ties, the bar lines are detected. Then, the bar units are described as a whole using the Blurred Shape Model. The bar units alignment is performed by using Dynamic Time Warping. The analysis of the alignment path is used to detect the variations in the music scores. The method has been evaluated on a subset of the CVC-MUSCIMA dataset, showing encouraging results. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | Bart Lamiroy; R Dueire Lins | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-319-52158-9 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.097; 602.006; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RFL2017 | Serial | 2955 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; Oriol Ramos Terrades; Josep Llados | ||||
| Title | Ontology-Based Understanding of Architectural Drawings | Type | Book Chapter | ||
| Year | 2017 | Publication | International Workshop on Graphics Recognition. GREC 2015.Graphic Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
9657 | Issue | Pages | 75-85 | |
| Keywords | Graphics recognition; Floor plan analysi; Domain ontology | ||||
| Abstract | In this paper we present a knowledge base of architectural documents aiming at improving existing methods of floor plan classification and understanding. It consists of an ontological definition of the domain and the inclusion of real instances coming from both, automatically interpreted and manually labeled documents. The knowledge base has proven to be an effective tool to structure our knowledge and to easily maintain and upgrade it. Moreover, it is an appropriate means to automatically check the consistency of relational data and a convenient complement of hard-coded knowledge interpretation systems. | ||||
| 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 | |||
| Notes | DAG; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ HRL2017 | Serial | 3086 | ||
| Permanent link to this record | |||||
| Author | Hanne Kause; Aura Hernandez-Sabate; Patricia Marquez; Andrea Fuster; Luc Florack; Hans van Assen; Debora Gil | ||||
| Title | Confidence Measures for Assessing the HARP Algorithm in Tagged Magnetic Resonance Imaging | Type | Book Chapter | ||
| Year | 2015 | Publication | Statistical Atlases and Computational Models of the Heart. Revised selected papers of Imaging and Modelling Challenges 6th International Workshop, STACOM 2015, Held in Conjunction with MICCAI 2015 | Abbreviated Journal | |
| Volume |
9534 | Issue | Pages | 69-79 | |
| Keywords | |||||
| Abstract | Cardiac deformation and changes therein have been linked to pathologies. Both can be extracted in detail from tagged Magnetic Resonance Imaging (tMRI) using harmonic phase (HARP) images. Although point tracking algorithms have shown to have high accuracies on HARP images, these vary with position. Detecting and discarding areas with unreliable results is crucial for use in clinical support systems. This paper assesses the capability of two confidence measures (CMs), based on energy and image structure, for detecting locations with reduced accuracy in motion tracking results. These CMs were tested on a database of simulated tMRI images containing the most common artifacts that may affect tracking accuracy. CM performance is assessed based on its capability for HARP tracking error bounding and compared in terms of significant differences detected using a multi comparison analysis of variance that takes into account the most influential factors on HARP tracking performance. Results showed that the CM based on image structure was better suited to detect unreliable optical flow vectors. In addition, it was shown that CMs can be used to detect optical flow vectors with large errors in order to improve the optical flow obtained with the HARP tracking algorithm. | ||||
| Address | Munich; Germany; January 2015 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | 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-319-28711-9 | Medium | |
| Area | Expedition | Conference | STACOM | ||
| Notes | ADAS; IAM; 600.075; 600.076; 600.060; 601.145 | Approved | no | ||
| Call Number | Admin @ si @ KHM2015 | Serial | 2734 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; F. Javier Sanchez; Gloria Fernandez Esparrach; Jorge Bernal | ||||
| Title | 3D Stable Spatio-temporal Polyp Localization in Colonoscopy Videos | Type | Book Chapter | ||
| Year | 2015 | Publication | Computer-Assisted and Robotic Endoscopy. Revised selected papers of Second International Workshop, CARE 2015, Held in Conjunction with MICCAI 2015 | Abbreviated Journal | |
| Volume |
9515 | Issue | Pages | 140-152 | |
| Keywords | Colonoscopy, Polyp Detection, Polyp Localization, Region Extraction, Watersheds | ||||
| Abstract | Computational intelligent systems could reduce polyp miss rate in colonoscopy for colon cancer diagnosis and, thus, increase the efficiency of the procedure. One of the main problems of existing polyp localization methods is a lack of spatio-temporal stability in their response. We propose to explore the response of a given polyp localization across temporal windows in order to select
those image regions presenting the highest stable spatio-temporal response. Spatio-temporal stability is achieved by extracting 3D watershed regions on the temporal window. Stability in localization response is statistically determined by analysis of the variance of the output of the localization method inside each 3D region. We have explored the benefits of considering spatio-temporal stability in two different tasks: polyp localization and polyp detection. Experimental results indicate an average improvement of 21:5% in polyp localization and 43:78% in polyp detection. |
||||
| 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 | CARE | ||
| Notes | IAM; MV; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ GSF2015 | Serial | 2733 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal | ||||
| Title | A Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 7-11 | |
| Keywords | Product graph; Dual edge graph; Subgraph matching; Random walks; Graph kernel | ||||
| Abstract | Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal with noisy information of vectorized graphical documents, we consider a dual edge graph representation on the original graph representing the graphical information and the product graph is computed between the dual edge graphs of the pattern graph and the target graph. The dual edge graph with redundant edges is helpful for efficient and tolerating encoding of the structural information of the graphical documents. The adjacency matrix of the product graph locates the pair of similar edges of two operand graphs and exponentiating the adjacency matrix finds similar random walks of greater lengths. Nodes joining similar random walks between two graphs are found by combining different weighted exponentials of adjacency matrices. An experimental investigation reveals that the recall obtained by this approach is quite encouraging. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Bart Lamiroy; Jean-Marc Ogier | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ DLB2014 | Serial | 2698 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; Ernest Valveny; Gemma Sanchez | ||||
| Title | Unsupervised and Notation-Independent Wall Segmentation in Floor Plans Using a Combination of Statistical and Structural Strategies | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 109-121 | |
| Keywords | Graphics recognition; Floor plan analysis; Object segmentation | ||||
| Abstract | In this paper we present a wall segmentation approach in floor plans that is able to work independently to the graphical notation, does not need any pre-annotated data for learning, and is able to segment multiple-shaped walls such as beams and curved-walls. This method results from the combination of the wall segmentation approaches [3, 5] presented recently by the authors. Firstly, potential straight wall segments are extracted in an unsupervised way similar to [3], but restricting even more the wall candidates considered in the original approach. Then, based on [5], these segments are used to learn the texture pattern of walls and spot the lost instances. The presented combination of both methods has been tested on 4 available datasets with different notations and compared qualitatively and quantitatively to the state-of-the-art applied on these collections. Additionally, some qualitative results on floor plans directly downloaded from the Internet are reported in the paper. The overall performance of the method demonstrates either its adaptability to different wall notations and shapes, and to document qualities and resolutions. | ||||
| Address | |||||
| 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-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; ADAS; 600.076; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ HVS2014 | Serial | 2535 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; David Fernandez; Alicia Fornes; Ernest Valveny; Gemma Sanchez; Josep Llados | ||||
| Title | Runlength Histogram Image Signature for Perceptual Retrieval of Architectural Floor Plans | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 135-146 | |
| Keywords | Graphics recognition; Graphics retrieval; Image classification | ||||
| Abstract | This paper proposes a runlength histogram signature as a perceptual descriptor of architectural plans in a retrieval scenario. The style of an architectural drawing is characterized by the perception of lines, shapes and texture. Such visual stimuli are the basis for defining semantic concepts as space properties, symmetry, density, etc. We propose runlength histograms extracted in vertical, horizontal and diagonal directions as a characterization of line and space properties in floorplans, so it can be roughly associated to a description of walls and room structure. A retrieval application illustrates the performance of the proposed approach, where given a plan as a query, similar ones are obtained from a database. A ground truth based on human observation has been constructed to validate the hypothesis. Additional retrieval results on sketched building’s facades are reported qualitatively in this paper. Its good description and its adaptability to two different sketch drawings despite its simplicity shows the interest of the proposed approach and opens a challenging research line in graphics recognition. | ||||
| Address | |||||
| 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-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; ADAS; 600.045; 600.056; 600.061; 600.076; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ HFF2014 | Serial | 2536 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; V.C.Kieu; M. Visani; N.Journet; Anjan Dutta | ||||
| Title | The ICDAR/GREC 2013 Music Scores Competition: Staff Removal | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 207-220 | |
| Keywords | Competition; Graphics recognition; Music scores; Writer identification; Staff removal | ||||
| Abstract | The first competition on music scores that was organized at ICDAR and GREC in 2011 awoke the interest of researchers, who participated in both staff removal and writer identification tasks. In this second edition, we focus on the staff removal task and simulate a real case scenario concerning old and degraded music scores. For this purpose, we have generated a new set of semi-synthetic images using two degradation models that we previously introduced: local noise and 3D distortions. In this extended paper we provide an extended description of the dataset, degradation models, evaluation metrics, the participant’s methods and the obtained results that could not be presented at ICDAR and GREC proceedings due to page limitations. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | B.Lamiroy; J.-M. Ogier | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; 600.077; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ FKV2014 | Serial | 2581 | ||
| Permanent link to this record | |||||
| Author | Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados | ||||
| Title | Hierarchical Plausibility-Graphs for Symbol Spotting in Graphical Documents | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 25-37 | |
| Keywords | |||||
| Abstract | Graph representation of graphical documents often suffers from noise such as spurious nodes and edges, and their discontinuity. In general these errors occur during the low-level image processing viz. binarization, skeletonization, vectorization etc. Hierarchical graph representation is a nice and efficient way to solve this kind of problem by hierarchically merging node-node and node-edge depending on the distance. But the creation of hierarchical graph representing the graphical information often uses hard thresholds on the distance to create the hierarchical nodes (next state) of the lower nodes (or states) of a graph. As a result, the representation often loses useful information. This paper introduces plausibilities to the nodes of hierarchical graph as a function of distance and proposes a modified algorithm for matching subgraphs of the hierarchical graphs. The plausibility-annotated nodes help to improve the performance of the matching algorithm on two hierarchical structures. To show the potential of this approach, we conduct an experiment with the SESYD dataset. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Bart Lamiroy; Jean-Marc Ogier | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; 600.045; 600.056; 600.061; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ BDJ2014 | Serial | 2699 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Dimosthenis Karatzas; Josep Llados | ||||
| Title | Spotting Graphical Symbols in Camera-Acquired Documents in Real Time | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 3-10 | |
| Keywords | |||||
| Abstract | In this paper we present a system devoted to spot graphical symbols in camera-acquired document images. The system is based on the extraction and further matching of ORB compact local features computed over interest key-points. Then, the FLANN indexing framework based on approximate nearest neighbor search allows to efficiently match local descriptors between the captured scene and the graphical models. Finally, the RANSAC algorithm is used in order to compute the homography between the spotted symbol and its appearance in the document image. The proposed approach is efficient and is able to work in real time. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Bart Lamiroy; Jean-Marc Ogier | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; 600.045; 600.055; 600.061; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RKL2014 | Serial | 2700 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; V. Poulain d'Andecy; Dimosthenis Karatzas; Josep Llados | ||||
| Title | Classification of Administrative Document Images by Logo Identification | Type | Book Chapter | ||
| Year | 2014 | Publication | Graphics Recognition. Current Trends and Challenges | Abbreviated Journal | |
| Volume |
8746 | Issue | Pages | 49-58 | |
| Keywords | Administrative Document Classification; Logo Recognition; Logo Spotting | ||||
| Abstract | This paper is focused on the categorization of administrative document images (such as invoices) based on the recognition of the supplier’s graphical logo. Two different methods are proposed, the first one uses a bag-of-visual-words model whereas the second one tries to locate logo images described by the blurred shape model descriptor within documents by a sliding-window technique. Preliminar results are reported with a dataset of real administrative documents. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Bart Lamiroy; Jean-Marc Ogier | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-662-44853-3 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG; 600.056; 600.045; 605.203; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RPK2014 | Serial | 2701 | ||
| Permanent link to this record | |||||
| Author | Juan Ramon Terven Salinas; Joaquin Salas; Bogdan Raducanu | ||||
| Title | Robust Head Gestures Recognition for Assistive Technology | Type | Book Chapter | ||
| Year | 2014 | Publication | Pattern Recognition | Abbreviated Journal | |
| Volume |
8495 | Issue | Pages | 152-161 | |
| Keywords | |||||
| Abstract | This paper presents a system capable of recognizing six head gestures: nodding, shaking, turning right, turning left, looking up, and looking down. The main difference of our system compared to other methods is that the Hidden Markov Models presented in this paper, are fully connected and consider all possible states in any given order, providing the following advantages to the system: (1) allows unconstrained movement of the head and (2) it can be easily integrated into a wearable device (e.g. glasses, neck-hung devices), in which case it can robustly recognize gestures in the presence of ego-motion. Experimental results show that this approach outperforms common methods that use restricted HMMs for each gesture. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | 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-319-07490-0 | Medium | |
| Area | Expedition | Conference | |||
| Notes | LAMP; | Approved | no | ||
| Call Number | Admin @ si @ TSR2014b | Serial | 2505 | ||
| Permanent link to this record | |||||
| Author | Sergio Vera; Miguel Angel Gonzalez Ballester; Debora Gil | ||||
| Title | Optimal Medial Surface Generation for Anatomical Volume Representations | Type | Book Chapter | ||
| Year | 2012 | Publication | Abdominal Imaging. Computational and Clinical Applications | Abbreviated Journal | LNCS |
| Volume |
7601 | Issue | Pages | 265-273 | |
| Keywords | Medial surface representation; volume reconstruction | ||||
| Abstract | Medial representations are a widely used technique in abdominal organ shape representation and parametrization. Those methods require good medial manifolds as a starting point. Any medial
surface used to parametrize a volume should be simple enough to allow an easy manipulation and complete enough to allow an accurate reconstruction of the volume. Obtaining good quality medial surfaces is still a problem with current iterative thinning methods. This forces the usage of generic, pre-calculated medial templates that are adapted to the final shape at the cost of a drop in volume reconstruction. This paper describes an operator for generation of medial structures that generates clean and complete manifolds well suited for their further use in medial representations of abdominal organ volumes. While being simpler than thinning surfaces, experiments show its high performance in volume reconstruction and preservation of medial surface main branching topology. |
||||
| Address | Nice, France | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Yoshida, Hiroyuki and Hawkes, David and Vannier, MichaelW. | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-33611-9 | Medium | |
| Area | Expedition | Conference | STACOM | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ VGG2012b | Serial | 1988 | ||
| Permanent link to this record | |||||