| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–12] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | David Vazquez; Jiaolong Xu; Sebastian Ramos; Antonio Lopez; Daniel Ponsa | ||||
| Title | Weakly Supervised Automatic Annotation of Pedestrian Bounding Boxes | Type | Conference Article | ||
| Year | 2013 | Publication | CVPR Workshop on Ground Truth – What is a good dataset? | Abbreviated Journal | |
| Volume | Issue | Pages | 706 - 711 | ||
| Keywords | Pedestrian Detection; Domain Adaptation | ||||
| Abstract | Among the components of a pedestrian detector, its trained pedestrian classifier is crucial for achieving the desired performance. The initial task of the training process consists in collecting samples of pedestrians and background, which involves tiresome manual annotation of pedestrian bounding boxes (BBs). Thus, recent works have assessed the use of automatically collected samples from photo-realistic virtual worlds. However, learning from virtual-world samples and testing in real-world images may suffer the dataset shift problem. Accordingly, in this paper we assess an strategy to collect samples from the real world and retrain with them, thus avoiding the dataset shift, but in such a way that no BBs of real-world pedestrians have to be provided. In particular, we train a pedestrian classifier based on virtual-world samples (no human annotation required). Then, using such a classifier we collect pedestrian samples from real-world images by detection. After, a human oracle rejects the false detections efficiently (weak annotation). Finally, a new classifier is trained with the accepted detections. We show that this classifier is competitive with respect to the counterpart trained with samples collected by manually annotating hundreds of pedestrian BBs. | ||||
| Address | Portland; Oregon; June 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE | Place of Publication | Editor | ||
| Language | English | Summary Language | English | Original Title | |
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference  |
CVPRW | ||
| Notes | ADAS; 600.054; 600.057; 601.217 | Approved | no | ||
| Call Number | ADAS @ adas @ VXR2013a | Serial | 2219 | ||
| Permanent link to this record | |||||
| Author | Jiaolong Xu; David Vazquez; Sebastian Ramos; Antonio Lopez; Daniel Ponsa | ||||
| Title | Adapting a Pedestrian Detector by Boosting LDA Exemplar Classifiers | Type | Conference Article | ||
| Year | 2013 | Publication | CVPR Workshop on Ground Truth – What is a good dataset? | Abbreviated Journal | |
| Volume | Issue | Pages | 688 - 693 | ||
| Keywords | Pedestrian Detection; Domain Adaptation | ||||
| Abstract | Training vision-based pedestrian detectors using synthetic datasets (virtual world) is a useful technique to collect automatically the training examples with their pixel-wise ground truth. However, as it is often the case, these detectors must operate in real-world images, experiencing a significant drop of their performance. In fact, this effect also occurs among different real-world datasets, i.e. detectors' accuracy drops when the training data (source domain) and the application scenario (target domain) have inherent differences. Therefore, in order to avoid this problem, it is required to adapt the detector trained with synthetic data to operate in the real-world scenario. In this paper, we propose a domain adaptation approach based on boosting LDA exemplar classifiers from both virtual and real worlds. We evaluate our proposal on multiple real-world pedestrian detection datasets. The results show that our method can efficiently adapt the exemplar classifiers from virtual to real world, avoiding drops in average precision over the 15%. | ||||
| Address | Portland; oregon; June 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | English | Summary Language | English | Original Title | |
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference |
CVPRW | ||
| Notes | ADAS; 600.054; 600.057; 601.217 | Approved | yes | ||
| Call Number | XVR2013; ADAS @ adas @ xvr2013a | Serial | 2220 | ||
| Permanent link to this record | |||||
| Author | Patricia Marquez; Debora Gil; Aura Hernandez-Sabate | ||||
| Title | Evaluation of the Capabilities of Confidence Measures for Assessing Optical Flow Quality | Type | Conference Article | ||
| Year | 2013 | Publication | ICCV Workshop on Computer Vision in Vehicle Technology: From Earth to Mars | Abbreviated Journal | |
| Volume | Issue | Pages | 624-631 | ||
| Keywords | |||||
| Abstract | Assessing Optical Flow (OF) quality is essential for its further use in reliable decision support systems. The absence of ground truth in such situations leads to the computation of OF Confidence Measures (CM) obtained from either input or output data. A fair comparison across the capabilities of the different CM for bounding OF error is required in order to choose the best OF-CM pair for discarding points where OF computation is not reliable. This paper presents a statistical probabilistic framework for assessing the quality of a given CM. Our quality measure is given in terms of the percentage of pixels whose OF error bound can not be determined by CM values. We also provide statistical tools for the computation of CM values that ensures a given accuracy of the flow field. | ||||
| Address | Sydney; Australia; December 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
CVTT:E2M | ||
| Notes | IAM; ADAS; 600.044; 600.057; 601.145 | Approved | no | ||
| Call Number | Admin @ si @ MGH2013b | Serial | 2351 | ||
| Permanent link to this record | |||||
| Author | Jose Manuel Alvarez; Theo Gevers; Antonio Lopez | ||||
| Title | Evaluating Color Representation for Online Road Detection | Type | Conference Article | ||
| Year | 2013 | Publication | ICCV Workshop on Computer Vision in Vehicle Technology: From Earth to Mars | Abbreviated Journal | |
| Volume | Issue | Pages | 594-595 | ||
| Keywords | |||||
| Abstract | Detecting traversable road areas ahead a moving vehicle is a key process for modern autonomous driving systems. Most existing algorithms use color to classify pixels as road or background. These algorithms reduce the effect of lighting variations and weather conditions by exploiting the discriminant/invariant properties of different color representations. However, up to date, no comparison between these representations have been conducted. Therefore, in this paper, we perform an evaluation of existing color representations for road detection. More specifically, we focus on color planes derived from RGB data and their most com-
mon combinations. The evaluation is done on a set of 7000 road images acquired using an on-board camera in different real-driving situations. |
||||
| 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 |
CVVT:E2M | ||
| Notes | ADAS;ISE | Approved | no | ||
| Call Number | Admin @ si @ AGL2013 | Serial | 2794 | ||
| Permanent link to this record | |||||
| Author | Alex Pardo; Albert Clapes; Sergio Escalera; Oriol Pujol | ||||
| Title | Actions in Context: System for people with Dementia | Type | Conference Article | ||
| Year | 2013 | Publication | 2nd International Workshop on Citizen Sensor Networks (Citisen2013) at the European Conference on Complex Systems | Abbreviated Journal | |
| Volume | Issue | Pages | 3-14 | ||
| Keywords | Multi-modal data Fusion; Computer vision; Wearable sensors; Gesture recognition; Dementia | ||||
| Abstract | In the next forty years, the number of people living with dementia is expected to triple. In the last stages, people affected by this disease become dependent. This hinders the autonomy of the patient and has a huge social impact in time, money and effort. Given this scenario, we propose an ubiquitous system capable of recognizing daily specific actions. The system fuses and synchronizes data obtained from two complementary modalities – ambient and egocentric. The ambient approach consists in a fixed RGB-Depth camera for user and object recognition and user-object interaction, whereas the egocentric point of view is given by a personal area network (PAN) formed by a few wearable sensors and a smartphone, used for gesture recognition. The system processes multi-modal data in real-time, performing paralleled task recognition and modality synchronization, showing high performance recognizing subjects, objects, and interactions, showing its reliability to be applied in real case scenarios. | ||||
| Address | Barcelona; September 2013 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer International Publishing | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-319-04177-3 | Medium | |
| Area | Expedition | Conference |
ECCS | ||
| Notes | HUPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ PCE2013 | Serial | 2354 | ||
| Permanent link to this record | |||||
| Author | Onur Ferhat; Fernando Vilariño | ||||
| Title | A Cheap Portable Eye-Tracker Solution for Common Setups | Type | Conference Article | ||
| Year | 2013 | Publication | 17th European Conference on Eye Movements | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Low cost; eye-tracker; software; webcam; Raspberry Pi | ||||
| Abstract | We analyze the feasibility of a cheap eye-tracker where the hardware consists of a single webcam and a Raspberry Pi device. Our aim is to discover the limits of such a system and to see whether it provides an acceptable performance. We base our work on the open source Opengazer (Zielinski, 2013) and we propose several improvements to create a robust, real-time system. After assessing the accuracy of our eye-tracker in elaborated experiments involving 18 subjects under 4 different system setups, we developed a simple game to see how it performs in practice and we also installed it on a Raspberry Pi to create a portable stand-alone eye-tracker which achieves 1.62° horizontal accuracy with 3 fps refresh rate for a building cost of 70 Euros. | ||||
| Address | Lund; Sweden; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
ECEM | ||
| Notes | MV;SIAI | Approved | no | ||
| Call Number | Admin @ si @ FeV2013 | Serial | 2374 | ||
| Permanent link to this record | |||||
| Author | Jorge Bernal; F. Javier Sanchez; Fernando Vilariño | ||||
| Title | Impact of Image Preprocessing Methods on Polyp Localization in Colonoscopy Frames | Type | Conference Article | ||
| Year | 2013 | Publication | 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society | Abbreviated Journal | |
| Volume | Issue | Pages | 7350 - 7354 | ||
| Keywords | |||||
| Abstract | In this paper we present our image preprocessing methods as a key part of our automatic polyp localization scheme. These methods are used to assess the impact of different endoluminal scene elements when characterizing polyps. More precisely we tackle the influence of specular highlights, blood vessels and black mask surrounding the scene. Experimental results prove that the appropriate handling of these elements leads to a great improvement in polyp localization results. | ||||
| Address | Osaka; Japan; July 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 | 1557-170X | ISBN | Medium | ||
| Area | 800 | Expedition | Conference |
EMBC | |
| Notes | MV; 600.047; 600.060;SIAI | Approved | no | ||
| Call Number | Admin @ si @ BSV2013 | Serial | 2286 | ||
| Permanent link to this record | |||||
| Author | Andreas Fischer; Ching Y. Suen; Volkmar Frinken; Kaspar Riesen; Horst Bunke | ||||
| Title | A Fast Matching Algorithm for Graph-Based Handwriting Recognition | Type | Conference Article | ||
| Year | 2013 | Publication | 9th IAPR – TC15 Workshop on Graph-based Representation in Pattern Recognition | Abbreviated Journal | |
| Volume | 7877 | Issue | Pages | 194-203 | |
| Keywords | |||||
| Abstract | The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical classification by means of vector space embedding. This approach has shown a high performance in terms of accuracy but had shortcomings in terms of computational speed. The time complexity of the Hungarian algorithm that is used to approximate the edit distance between two handwriting graphs is demanding for a real-world scenario. In this paper, we propose a faster graph matching algorithm which is derived from the Hausdorff distance. On the historical Parzival database it is demonstrated that the proposed method achieves a speedup factor of 12.9 without significant loss in recognition accuracy. | ||||
| Address | Vienna; Austria; May 2013 | ||||
| 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-38220-8 | Medium | |
| Area | Expedition | Conference |
GBR | ||
| Notes | DAG; 600.045; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ FSF2013 | Serial | 2294 | ||
| Permanent link to this record | |||||
| Author | Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados | ||||
| Title | Plausibility-Graphs for Symbol Spotting in Graphical Documents | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Graph representation of graphical documents often suffers from noise viz. spurious nodes and spurios edges of graph and their discontinuity etc. 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 | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG; 600.045; 600.056; 600.061; 601.152 | Approved | no | ||
| Call Number | Admin @ si @ BDJ2013 | Serial | 2360 | ||
| 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 | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Product graph has been shown to be an efficient way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. This paper focuses on the two major limitations of the previous version of product graph: (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 graph representation on the original graph representing the graphical information and the product graph is computed between the dual graphs of the query graphs and the input graph.
The dual 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 similar path information of two graphs and exponentiating the adjacency matrix finds similar paths of greater lengths. Nodes joining similar paths between two graphs are found by combining different exponentials of adjacency matrices. An experimental investigation reveals that the recall obtained by this approach is quite encouraging. |
||||
| Address | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ DLB2013b | Serial | 2359 | ||
| Permanent link to this record | |||||
| Author | V.C.Kieu; Alicia Fornes; M. Visani; N.Journet ; Anjan Dutta | ||||
| Title | The ICDAR/GREC 2013 Music Scores Competition on Staff Removal | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Competition; Music scores; 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 both at staff removal and writer identification tasks. In this second edition, we propose a staff removal competition where we simulate old music scores. Thus, we have created a new set of images, which contain noise and 3D distortions. This paper describes the distortion methods, metrics, the participant’s methods and the obtained results. | ||||
| Address | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG; 600.045; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ KFV2013 | Serial | 2337 | ||
| 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 | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| 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 | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG; 600.056; 600.045; 605.203 | Approved | no | ||
| Call Number | Admin @ si @ | Serial | 2348 | ||
| 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 | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| 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 | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG; 600.045; 600.055; 600.061; 602.101 | Approved | no | ||
| Call Number | Admin @ si @ RKL2013 | Serial | 2347 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; David Fernandez; Alicia Fornes; Ernest Valveny; Gemma Sanchez;Josep Llados | ||||
| Title | Perceptual retrieval of architectural floor plans | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | This paper proposes a runlength histogram signature as a percetual 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. Preliminary results show the interest of the proposed approach and opens a challenging research line in graphics recognition. |
||||
| Address | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG; 600.045; 600.056; 600.061 | Approved | no | ||
| Call Number | Admin @ si @ HFF2013a | Serial | 2320 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; Ernest Valveny; Gemma Sanchez | ||||
| Title | Combining structural and statistical strategies for unsupervised wall detection in floor plans | Type | Conference Article | ||
| Year | 2013 | Publication | 10th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | This paper presents an evolution of the first unsupervised wall segmentation method in floor plans, that was presented by the authors in [1]. This first approach, contrarily to the existing ones, is able to segment walls independently to their notation and without the need of any pre-annotated data
to learn their visual appearance. Despite the good performance of the first approach, some specific cases, such as curved shaped walls, were not correctly segmented since they do not agree the strict structural assumptions that guide the whole methodology in order to be able to learn, in an unsupervised way, the structure of a wall. In this paper, we refine this strategy by dividing the process in two steps. In a first step, potential wall segments are extracted unsupervisedly using a modification of [1], by restricting even more the areas considered as walls in a first moment. In a second step, these segments are used to learn and spot lost instances based on a modified version of [2], also presented by the authors. The presented combined method have been tested on 4 datasets with different notations and compared with the stateof-the-art applyed on the same datasets. The results show its adaptability to different wall notations and shapes, significantly outperforming the original approach. |
||||
| Address | Bethlehem; PA; 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 | ISBN | Medium | |||
| Area | Expedition | Conference |
GREC | ||
| Notes | DAG; 600.045 | Approved | no | ||
| Call Number | Admin @ si @ HVS2013a | Serial | 2321 | ||
| Permanent link to this record | |||||