| Home | [121–130] << 131 132 133 134 135 136 137 138 139 140 >> [141–150] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Suman Ghosh; Ernest Valveny | ||||
| Title | Query by String word spotting based on character bi-gram indexing | Type | Conference Article | ||
| Year | 2015 | Publication | 13th International Conference on Document Analysis and Recognition ICDAR2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 881-885 | ||
| Keywords | |||||
Abstract  |
In this paper we propose a segmentation-free query by string word spotting method. Both the documents and query strings are encoded using a recently proposed word representa- tion that projects images and strings into a common atribute space based on a pyramidal histogram of characters(PHOC). These attribute models are learned using linear SVMs over the Fisher Vector representation of the images along with the PHOC labels of the corresponding strings. In order to search through the whole page, document regions are indexed per character bi- gram using a similar attribute representation. On top of that, we propose an integral image representation of the document using a simplified version of the attribute model for efficient computation. Finally we introduce a re-ranking step in order to boost retrieval performance. We show state-of-the-art results for segmentation-free query by string word spotting in single-writer and multi-writer standard datasets | ||||
| Address | Nancy; France; August 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 | Expedition | Conference | ICDAR | ||
| Notes | DAG; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ GhV2015a | Serial | 2715 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Umapada Pal | ||||
| Title | A symbol spotting approach in graphical documents by hashing serialized graphs | Type | Journal Article | ||
| Year | 2013 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 46 | Issue | 3 | Pages | 752-768 |
| Keywords | Symbol spotting; Graphics recognition; Graph matching; Graph serialization; Graph factorization; Graph paths; Hashing | ||||
| Abstract |
In this paper we propose a symbol spotting technique in graphical documents. Graphs are used to represent the documents and a (sub)graph matching technique is used to detect the symbols in them. We propose a graph serialization to reduce the usual computational complexity of graph matching. Serialization of graphs is performed by computing acyclic graph paths between each pair of connected nodes. Graph paths are one-dimensional structures of graphs which are less expensive in terms of computation. At the same time they enable robust localization even in the presence of noise and distortion. Indexing in large graph databases involves a computational burden as well. We propose a graph factorization approach to tackle this problem. Factorization is intended to create a unified indexed structure over the database of graphical documents. Once graph paths are extracted, the entire database of graphical documents is indexed in hash tables by locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. We have performed detailed experiments with various datasets of line drawings and compared our method with the state-of-the-art works. The results demonstrate the effectiveness and efficiency of our technique. | ||||
| 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 | 0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.042; 600.045; 605.203; 601.152 | Approved | no | ||
| Call Number | Admin @ si @ DLP2012 | Serial | 2127 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Umapada Pal | ||||
| Title | Symbol Spotting in Line Drawings Through Graph Paths Hashing | Type | Conference Article | ||
| Year | 2011 | Publication | 11th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 982-986 | ||
| Keywords | |||||
| Abstract |
In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can be efficiently represented by graphs, which ease the accurate localization of the model symbol. Graph paths are the factorized substructures of graphs which enable robust recognition even in the presence of noise and distortion. In our framework, the entire database of the graphical documents is indexed in hash tables by the locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. The spotting method is formulated by a spatial voting scheme to the list of locations of the paths that are decided during the hash table lookup process. We perform detailed experiments with various dataset of line drawings and the results demonstrate the effectiveness and efficiency of the technique. | ||||
| 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 | 1520-5363 | ISBN | 978-1-4577-1350-7 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DLP2011b | Serial | 1791 | ||
| Permanent link to this record | |||||
| Author | Sounak Dey; Anjan Dutta; Suman Ghosh; Ernest Valveny; Josep Llados | ||||
| Title | Aligning Salient Objects to Queries: A Multi-modal and Multi-object Image Retrieval Framework | Type | Conference Article | ||
| Year | 2018 | Publication | 14th Asian Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract |
In this paper we propose an approach for multi-modal image retrieval in multi-labelled images. A multi-modal deep network architecture is formulated to jointly model sketches and text as input query modalities into a common embedding space, which is then further aligned with the image feature space. Our architecture also relies on a salient object detection through a supervised LSTM-based visual attention model learned from convolutional features. Both the alignment between the queries and the image and the supervision of the attention on the images are obtained by generalizing the Hungarian Algorithm using different loss functions. This permits encoding the object-based features and its alignment with the query irrespective of the availability of the co-occurrence of different objects in the training set. We validate the performance of our approach on standard single/multi-object datasets, showing state-of-the art performance in every dataset. | ||||
| Address | Perth; Australia; December 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 | ACCV | ||
| Notes | DAG; 600.097; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ DDG2018a | Serial | 3151 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; David Fernandez; Alicia Fornes; Josep Llados; Ernest Valveny | ||||
| Title | A Coarse-to-Fine Approach for Handwritten Word Spotting in Large Scale Historical Documents Collection | Type | Conference Article | ||
| Year | 2012 | Publication | 13th International Conference on Frontiers in Handwriting Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 453-458 | ||
| Keywords | |||||
| Abstract |
In this paper we propose an approach for word spotting in handwritten document images. We state the problem from a focused retrieval perspective, i.e. locating instances of a query word in a large scale dataset of digitized manuscripts. We combine two approaches, namely one based on word segmentation and another one segmentation-free. The first approach uses a hashing strategy to coarsely prune word images that are unlikely to be instances of the query word. This process is fast but has a low precision due to the errors introduced in the segmentation step. The regions containing candidate words are sent to the second process based on a state of the art technique from the visual object detection field. This discriminative model represents the appearance of the query word and computes a similarity score. In this way we propose a coarse-to-fine approach achieving a compromise between efficiency and accuracy. The validation of the model is shown using a collection of old handwritten manuscripts. We appreciate a substantial improvement in terms of precision regarding the previous proposed method with a low computational cost increase. | ||||
| 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 | 978-1-4673-2262-1 | Medium | ||
| Area | Expedition | Conference | ICFHR | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ AFF2012 | Serial | 1983 | ||
| Permanent link to this record | |||||
| Author | Xialei Liu; Marc Masana; Luis Herranz; Joost Van de Weijer; Antonio Lopez; Andrew Bagdanov | ||||
| Title | Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgetting | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2262-2268 | ||
| Keywords | |||||
| Abstract |
In this paper we propose an approach to avoiding catastrophic forgetting in sequential task learning scenarios. Our technique is based on a network reparameterization that approximately diagonalizes the Fisher Information Matrix of the network parameters. This reparameterization takes the form of
a factorized rotation of parameter space which, when used in conjunction with Elastic Weight Consolidation (which assumes a diagonal Fisher Information Matrix), leads to significantly better performance on lifelong learning of sequential tasks. Experimental results on the MNIST, CIFAR-100, CUB-200 and Stanford-40 datasets demonstrate that we significantly improve the results of standard elastic weight consolidation, and that we obtain competitive results when compared to the state-of-the-art in lifelong learning without forgetting. |
||||
| 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 | ICPR | ||
| Notes | LAMP; ADAS; 601.305; 601.109; 600.124; 600.106; 602.200; 600.120; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ LMH2018 | Serial | 3160 | ||
| Permanent link to this record | |||||
| Author | J. Chazalon; Marçal Rusiñol; Jean-Marc Ogier | ||||
| Title | Improving Document Matching Performance by Local Descriptor Filtering | Type | Conference Article | ||
| Year | 2015 | Publication | 6th IAPR International Workshop on Camera Based Document Analysis and Recognition CBDAR2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 1216 - 1220 | ||
| Keywords | |||||
| Abstract |
In this paper we propose an effective method aimed at reducing the amount of local descriptors to be indexed in a document matching framework. In an off-line training stage, the matching between the model document and incoming images is computed retaining the local descriptors from the model that steadily produce good matches. We have evaluated this approach by using the ICDAR2015 SmartDOC dataset containing near 25 000 images from documents to be captured by a mobile device. We have tested the performance of this filtering step by using
ORB and SIFT local detectors and descriptors. The results show an important gain both in quality of the final matching as well as in time and space requirements. |
||||
| Address | Nancy; France; August 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 | Expedition | Conference | CBDAR | ||
| Notes | DAG; 600.077; 601.223; 600.084 | Approved | no | ||
| Call Number | Admin @ si @ CRO2015a | Serial | 2680 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; J. Chazalon; Jean-Marc Ogier | ||||
| Title | Filtrage de descripteurs locaux pour l'amélioration de la détection de documents | Type | Conference Article | ||
| Year | 2016 | Publication | Colloque International Francophone sur l'Écrit et le Document | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Local descriptors; mobile capture; document matching; keypoint selection | ||||
| Abstract |
In this paper we propose an effective method aimed at reducing the amount of local descriptors to be indexed in a document matching framework.In an off-line training stage, the matching between the model document and incoming images is computed retaining the local descriptors from the model that steadily produce good matches. We have evaluated this approach by using the ICDAR2015 SmartDOC dataset containing near 25000 images from documents to be captured by a mobile device. We have tested the performance of this filtering step by using ORB and SIFT local detectors and descriptors. The results show an important gain both in quality of the final matching as well as in time and space requirements. | ||||
| Address | Toulouse; France; March 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 | CIFED | ||
| Notes | DAG; 600.084; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ RCO2016 | Serial | 2755 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; David Aldavert; Dimosthenis Karatzas; Ricardo Toledo; Josep Llados | ||||
| Title | Interactive Trademark Image Retrieval by Fusing Semantic and Visual Content. Advances in Information Retrieval | Type | Conference Article | ||
| Year | 2011 | Publication | 33rd European Conference on Information Retrieval | Abbreviated Journal | |
| Volume | 6611 | Issue | Pages | 314-325 | |
| Keywords | |||||
| Abstract |
In this paper we propose an efficient queried-by-example retrieval system which is able to retrieve trademark images by similarity from patent and trademark offices' digital libraries. Logo images are described by both their semantic content, by means of the Vienna codes, and their visual contents, by using shape and color as visual cues. The trademark descriptors are then indexed by a locality-sensitive hashing data structure aiming to perform approximate k-NN search in high dimensional spaces in sub-linear time. The resulting ranked lists are combined by using the Condorcet method and a relevance feedback step helps to iteratively revise the query and refine the obtained results. The experiments demonstrate the effectiveness and efficiency of this system on a realistic and large dataset. | ||||
| Address | Dublin, Ireland | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer | Place of Publication | Berlin | Editor | P. Clough; C. Foley; C. Gurrin; G.J.F. Jones; W. Kraaij; H. Lee; V. Murdoch |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-3-642-20160-8 | Medium | ||
| Area | Expedition | Conference | ECIR | ||
| Notes | DAG; RV;ADAS | Approved | no | ||
| Call Number | Admin @ si @ RAK2011 | Serial | 1737 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Umapada Pal | ||||
| Title | A Bag-of-Paths Based Serialized Subgraph Matching for Symbol Spotting in Line Drawings | Type | Conference Article | ||
| Year | 2011 | Publication | 5th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 6669 | Issue | Pages | 620-627 | |
| Keywords | |||||
| Abstract |
In this paper we propose an error tolerant subgraph matching algorithm based on bag-of-paths for solving the problem of symbol spotting in line drawings. Bag-of-paths is a factorized representation of graphs where the factorization is done by considering all the acyclic paths between each pair of connected nodes. Similar paths within the whole collection of documents are clustered and organized in a lookup table for efficient indexing. The lookup table contains the index key of each cluster and the corresponding list of locations as a single entry. The mean path of each of the clusters serves as the index key for each table entry. The spotting method is then formulated by a spatial voting scheme to the list of locations of the paths that are decided in terms of search of similar paths that compose the query symbol. Efficient indexing of common substructures helps to reduce the computational burden of usual graph based methods. The proposed method can also be seen as a way to serialize graphs which allows to reduce the complexity of the subgraph isomorphism. We have encoded the paths in terms of both attributed strings and turning functions, and presented a comparative results between them within the symbol spotting framework. Experimentations for matching different shape silhouettes are also reported and the method has been proved to work in noisy environment also. | ||||
| Address | Las Palmas de Gran Canaria. Spain | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Berlin | Editor | Jordi Vitria; Joao Miguel Raposo; Mario Hernandez |
| 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-21256-7 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DLP2011a | Serial | 1738 | ||
| Permanent link to this record | |||||
| Author | Thanh Ha Do; Salvatore Tabbone; Oriol Ramos Terrades | ||||
| Title | Sparse representation over learned dictionary for symbol recognition | Type | Journal Article | ||
| Year | 2016 | Publication | Signal Processing | Abbreviated Journal | SP |
| Volume | 125 | Issue | Pages | 36-47 | |
| Keywords | Symbol Recognition; Sparse Representation; Learned Dictionary; Shape Context; Interest Points | ||||
| Abstract |
In this paper we propose an original sparse vector model for symbol retrieval task. More speci cally, we apply the K-SVD algorithm for learning a visual dictionary based on symbol descriptors locally computed around interest points. Results on benchmark datasets show that the obtained sparse representation is competitive related to state-of-the-art methods. Moreover, our sparse representation is invariant to rotation and scale transforms and also robust to degraded images and distorted symbols. Thereby, the learned visual dictionary is able to represent instances of unseen classes of symbols. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.061; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ DTR2016 | Serial | 2946 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny | ||||
| Title | Efficient Exemplar Word Spotting | Type | Conference Article | ||
| Year | 2012 | Publication | 23rd British Machine Vision Conference | Abbreviated Journal | |
| Volume | Issue | Pages | 67.1- 67.11 | ||
| Keywords | |||||
| Abstract |
In this paper we propose an unsupervised segmentation-free method for word spotting in document images.
Documents are represented with a grid of HOG descriptors, and a sliding window approach is used to locate the document regions that are most similar to the query. We use the exemplar SVM framework to produce a better representation of the query in an unsupervised way. Finally, the document descriptors are precomputed and compressed with Product Quantization. This offers two advantages: first, a large number of documents can be kept in RAM memory at the same time. Second, the sliding window becomes significantly faster since distances between quantized HOG descriptors can be precomputed. Our results significantly outperform other segmentation-free methods in the literature, both in accuracy and in speed and memory usage. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 1-901725-46-4 | Medium | ||
| Area | Expedition | Conference | BMVC | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ AGF2012 | Serial | 1984 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Albert Gordo; Alicia Fornes; Ernest Valveny | ||||
| Title | Segmentation-free Word Spotting with Exemplar SVMs | Type | Journal Article | ||
| Year | 2014 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 47 | Issue | 12 | Pages | 3967–3978 |
| Keywords | Word spotting; Segmentation-free; Unsupervised learning; Reranking; Query expansion; Compression | ||||
| Abstract |
In this paper we propose an unsupervised segmentation-free method for word spotting in document images. Documents are represented with a grid of HOG descriptors, and a sliding-window approach is used to locate the document regions that are most similar to the query. We use the Exemplar SVM framework to produce a better representation of the query in an unsupervised way. Then, we use a more discriminative representation based on Fisher Vector to rerank the best regions retrieved, and the most promising ones are used to expand the Exemplar SVM training set and improve the query representation. Finally, the document descriptors are precomputed and compressed with Product Quantization. This offers two advantages: first, a large number of documents can be kept in RAM memory at the same time. Second, the sliding window becomes significantly faster since distances between quantized HOG descriptors can be precomputed. Our results significantly outperform other segmentation-free methods in the literature, both in accuracy and in speed and memory usage. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.045; 600.056; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ AGF2014b | Serial | 2485 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Ernest Valveny; F. Serratosa; I. Bardaji; Horst Bunke | ||||
| Title | Graph-based k-means clustering: A comparison of the set versus the generalized median graph | Type | Conference Article | ||
| Year | 2009 | Publication | 13th International Conference on Computer Analysis of Images and Patterns | Abbreviated Journal | |
| Volume | 5702 | Issue | Pages | 342–350 | |
| Keywords | |||||
| Abstract |
In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented using the set median graph. We propose an approximate method for the generalized median graph computation that allows to use it to represent the centers of the clusters. Experiments on three databases show that using the generalized median graph as the clusters representative yields better results than the set median graph. | ||||
| Address | Münster, Germany | ||||
| 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-03766-5 | Medium | |
| Area | Expedition | Conference | CAIP | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ FVS2009d | Serial | 1219 | ||
| Permanent link to this record | |||||
| Author | Xavier Baro; Sergio Escalera; Petia Radeva; Jordi Vitria | ||||
| Title | Generic Object Recognition in Urban Image Databases | Type | Conference Article | ||
| Year | 2009 | Publication | 12th International Conference of the Catalan Association for Artificial Intelligence | Abbreviated Journal | |
| Volume | 202 | Issue | Pages | 27-34 | |
| Keywords | |||||
| Abstract |
In this paper we propose the construction of a visual content layer which describes the visual appearance of geographic locations in a city. We captured, by means of a Mobile Mapping system, a huge set of georeferenced images (>500K) which cover the whole city of Barcelona. For each image, hundreds of region descriptions are computed off-line and described as a hash code. All this information is extracted without an object of reference, which allows to search for any type of objects using their visual appearance. A new Visual Content layer is built over Google Maps, allowing the object recognition information to be organized and fused with other content, like satellite images, street maps, and business locations. | ||||
| Address | Cardona (Spain) | ||||
| 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 | 978-1-60750-061-2 | Medium | ||
| Area | Expedition | Conference | CCIA | ||
| Notes | OR;MILAB;HuPBA;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ VER2009 | Serial | 1183 | ||
| Permanent link to this record | |||||