| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–11] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Arash Akbarinia; Karl R. Gegenfurtner | ||||
| Title | Metameric Mismatching in Natural and Artificial Reflectances | Type | Journal Article | ||
| Year | 2017 | Publication | Journal of Vision | Abbreviated Journal  |
JV |
| Volume | 17 | Issue | 10 | Pages | 390-390 |
| Keywords | Metamer; colour perception; spectral discrimination; photoreceptors | ||||
| Abstract | The human visual system and most digital cameras sample the continuous spectral power distribution through three classes of receptors. This implies that two distinct spectral reflectances can result in identical tristimulus values under one illuminant and differ under another – the problem of metamer mismatching. It is still debated how frequent this issue arises in the real world, using naturally occurring reflectance functions and common illuminants.
We gathered more than ten thousand spectral reflectance samples from various sources, covering a wide range of environments (e.g., flowers, plants, Munsell chips) and evaluated their responses under a number of natural and artificial source of lights. For each pair of reflectance functions, we estimated the perceived difference using the CIE-defined distance ΔE2000 metric in Lab color space. The degree of metamer mismatching depended on the lower threshold value l when two samples would be considered to lead to equal sensor excitations (ΔE < l), and on the higher threshold value h when they would be considered different. For example, for l=h=1, we found that 43.129 comparisons out of a total of 6×107 pairs would be considered metameric (1 in 104). For l=1 and h=5, this number reduced to 705 metameric pairs (2 in 106). Extreme metamers, for instance l=1 and h=10, were rare (22 pairs or 6 in 108), as were instances where the two members of a metameric pair would be assigned to different color categories. Not unexpectedly, we observed variations among different reflectance databases and illuminant spectra with more frequency under artificial illuminants than natural ones. Overall, our numbers are not very different from those obtained earlier (Foster et al, JOSA A, 2006). However, our results also show that the degree of metamerism is typically not very strong and that category switches hardly ever occur. |
||||
| Address | Florida, USA; May 2017 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | NEUROBIT; no menciona | Approved | no | ||
| Call Number | Admin @ si @ AkG2017 | Serial | 2899 | ||
| Permanent link to this record | |||||
| Author | Katerine Diaz; Jesus Martinez del Rincon; Aura Hernandez-Sabate | ||||
| Title | Decremental generalized discriminative common vectors applied to images classification | Type | Journal Article | ||
| Year | 2017 | Publication | Knowledge-Based Systems | Abbreviated Journal |
KBS |
| Volume | 131 | Issue | Pages | 46-57 | |
| Keywords | Decremental learning; Generalized Discriminative Common Vectors; Feature extraction; Linear subspace methods; Classification | ||||
| Abstract | In this paper, a novel decremental subspace-based learning method called Decremental Generalized Discriminative Common Vectors method (DGDCV) is presented. The method makes use of the concept of decremental learning, which we introduce in the field of supervised feature extraction and classification. By efficiently removing unnecessary data and/or classes for a knowledge base, our methodology is able to update the model without recalculating the full projection or accessing to the previously processed training data, while retaining the previously acquired knowledge. The proposed method has been validated in 6 standard face recognition datasets, showing a considerable computational gain without compromising the accuracy of the model. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.118; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DMH2017a | Serial | 3003 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; Sergio Vera; Agnes Borras; Albert Andaluz; Miguel Angel Gonzalez Ballester | ||||
| Title | Anatomical Medial Surfaces with Efficient Resolution of Branches Singularities | Type | Journal Article | ||
| Year | 2017 | Publication | Medical Image Analysis | Abbreviated Journal |
MIA |
| Volume | 35 | Issue | Pages | 390-402 | |
| Keywords | Medial Representations; Shape Recognition; Medial Branching Stability ; Singular Points | ||||
| Abstract | Medial surfaces are powerful tools for shape description, but their use has been limited due to the sensibility existing methods to branching artifacts. Medial branching artifacts are associated to perturbations of the object boundary rather than to geometric features. Such instability is a main obstacle for a con dent application in shape recognition and description. Medial branches correspond to singularities of the medial surface and, thus, they are problematic for existing morphological and energy-based algorithms. In this paper, we use algebraic geometry concepts in an energy-based approach to compute a medial surface presenting a stable branching topology. We also present an ecient GPU-CPU implementation using standard image processing tools. We show the method computational eciency and quality on a custom made synthetic database. Finally, we present some results on a medical imaging application for localization of abdominal pathologies. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier B.V. | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | IAM; 600.060; 600.096; 600.075; 600.145 | Approved | no | ||
| Call Number | Admin @ si @ GVB2017 | Serial | 2775 | ||
| Permanent link to this record | |||||
| Author | F. Javier Sanchez; Jorge Bernal; Cristina Sanchez Montes; Cristina Rodriguez de Miguel; Gloria Fernandez Esparrach | ||||
| Title | Bright spot regions segmentation and classification for specular highlights detection in colonoscopy videos | Type | Journal Article | ||
| Year | 2017 | Publication | Machine Vision and Applications | Abbreviated Journal |
MVAP |
| Volume | Issue | Pages | 1-20 | ||
| Keywords | Specular highlights; bright spot regions segmentation; region classification; colonoscopy | ||||
| Abstract | A novel specular highlights detection method in colonoscopy videos is presented. The method is based on a model of appearance de ning specular
highlights as bright spots which are highly contrasted with respect to adjacent regions. Our approach proposes two stages; segmentation, and then classi cation of bright spot regions. The former de nes a set of candidate regions obtained through a region growing process with local maxima as initial region seeds. This process creates a tree structure which keeps track, at each growing iteration, of the region frontier contrast; nal regions provided depend on restrictions over contrast value. Non-specular regions are ltered through a classi cation stage performed by a linear SVM classi er using model-based features from each region. We introduce a new validation database with more than 25; 000 regions along with their corresponding pixel-wise annotations. We perform a comparative study against other approaches. Results show that our method is superior to other approaches, with our segmented regions being closer to actual specular regions in the image. Finally, we also present how our methodology can also be used to obtain an accurate prediction of polyp histology. |
||||
| 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 | MV; 600.096; 600.175 | Approved | no | ||
| Call Number | Admin @ si @ SBS2017 | Serial | 2975 | ||
| Permanent link to this record | |||||
| Author | Sounak Dey; Palaiahnakote Shivakumara; K.S. Raghunanda; Umapada Pal; Tong Lu; G. Hemantha Kumar; Chee Seng Chan | ||||
| Title | Script independent approach for multi-oriented text detection in scene image | Type | Journal Article | ||
| Year | 2017 | Publication | Neurocomputing | Abbreviated Journal |
NEUCOM |
| Volume | 242 | Issue | Pages | 96-112 | |
| Keywords | |||||
| Abstract | Developing a text detection method which is invariant to scripts in natural scene images is a challeng- ing task due to different geometrical structures of various scripts. Besides, multi-oriented of text lines in natural scene images make the problem more challenging. This paper proposes to explore ring radius transform (RRT) for text detection in multi-oriented and multi-script environments. The method finds component regions based on convex hull to generate radius matrices using RRT. It is a fact that RRT pro- vides low radius values for the pixels that are near to edges, constant radius values for the pixels that represent stroke width, and high radius values that represent holes created in background and convex hull because of the regular structures of text components. We apply k -means clustering on the radius matrices to group such spatially coherent regions into individual clusters. Then the proposed method studies the radius values of such cluster components that are close to the centroid and far from the cen- troid to detect text components. Furthermore, we have developed a Bangla dataset (named as ISI-UM dataset) and propose a semi-automatic system for generating its ground truth for text detection of arbi- trary orientations, which can be used by the researchers for text detection and recognition in the future. The ground truth will be released to public. Experimental results on our ISI-UM data and other standard datasets, namely, ICDAR 2013 scene, SVT and MSRA data, show that the proposed method outperforms the existing methods in terms of multi-lingual and multi-oriented text detection ability. | ||||
| 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.121 | Approved | no | ||
| Call Number | Admin @ si @ DSR2017 | Serial | 3260 | ||
| Permanent link to this record | |||||
| Author | Hugo Jair Escalante; Victor Ponce; Sergio Escalera; Xavier Baro; Alicia Morales-Reyes; Jose Martinez-Carranza | ||||
| Title | Evolving weighting schemes for the Bag of Visual Words | Type | Journal Article | ||
| Year | 2017 | Publication | Neural Computing and Applications | Abbreviated Journal |
Neural Computing and Applications |
| Volume | 28 | Issue | 5 | Pages | 925–939 |
| Keywords | Bag of Visual Words; Bag of features; Genetic programming; Term-weighting schemes; Computer vision | ||||
| Abstract | The Bag of Visual Words (BoVW) is an established representation in computer vision. Taking inspiration from text mining, this representation has proved
to be very effective in many domains. However, in most cases, standard term-weighting schemes are adopted (e.g.,term-frequency or TF-IDF). It remains open the question of whether alternative weighting schemes could boost the performance of methods based on BoVW. More importantly, it is unknown whether it is possible to automatically learn and determine effective weighting schemes from scratch. This paper brings some light into both of these unknowns. On the one hand, we report an evaluation of the most common weighting schemes used in text mining, but rarely used in computer vision tasks. Besides, we propose an evolutionary algorithm capable of automatically learning weighting schemes for computer vision problems. We report empirical results of an extensive study in several computer vision problems. Results show the usefulness of the proposed method. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | Springer | ||
| 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;MV; no menciona | Approved | no | ||
| Call Number | Admin @ si @ EPE2017 | Serial | 2743 | ||
| Permanent link to this record | |||||
| Author | Jose Garcia-Rodriguez; Isabelle Guyon; Sergio Escalera; Alexandra Psarrou; Andrew Lewis; Miguel Cazorla | ||||
| Title | Editorial: Special Issue on Computational Intelligence for Vision and Robotics | Type | Journal Article | ||
| Year | 2017 | Publication | Neural Computing and Applications | Abbreviated Journal |
Neural Computing and Applications |
| Volume | 28 | Issue | 5 | Pages | 853–854 |
| 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 | HuPBA;MILAB; no menciona | Approved | no | ||
| Call Number | Admin @ si @ GGE2017 | Serial | 2845 | ||
| Permanent link to this record | |||||
| Author | C. Alejandro Parraga | ||||
| Title | Colours and Colour Vision: An Introductory Survey | Type | Journal Article | ||
| Year | 2017 | Publication | Perception | Abbreviated Journal |
PER |
| Volume | 46 | Issue | 5 | Pages | 640-641 |
| 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 | NEUROBIT; no menciona | Approved | no | ||
| Call Number | Par2017 | Serial | 3101 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez; Dimosthenis Karatzas | ||||
| Title | TextProposals: a Text‐specific Selective Search Algorithm for Word Spotting in the Wild | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition | Abbreviated Journal |
PR |
| Volume | 70 | Issue | Pages | 60-74 | |
| Keywords | |||||
| Abstract | Motivated by the success of powerful while expensive techniques to recognize words in a holistic way (Goel et al., 2013; Almazán et al., 2014; Jaderberg et al., 2016) object proposals techniques emerge as an alternative to the traditional text detectors. In this paper we introduce a novel object proposals method that is specifically designed for text. We rely on a similarity based region grouping algorithm that generates a hierarchy of word hypotheses. Over the nodes of this hierarchy it is possible to apply a holistic word recognition method in an efficient way.
Our experiments demonstrate that the presented method is superior in its ability of producing good quality word proposals when compared with class-independent algorithms. We show impressive recall rates with a few thousand proposals in different standard benchmarks, including focused or incidental text datasets, and multi-language scenarios. Moreover, the combination of our object proposals with existing whole-word recognizers (Almazán et al., 2014; Jaderberg et al., 2016) shows competitive performance in end-to-end word spotting, and, in some benchmarks, outperforms previously published results. Concretely, in the challenging ICDAR2015 Incidental Text dataset, we overcome in more than 10% F-score the best-performing method in the last ICDAR Robust Reading Competition (Karatzas, 2015). Source code of the complete end-to-end system is available at https://github.com/lluisgomez/TextProposals. |
||||
| 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.084; 601.197; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ GoK2017 | Serial | 2886 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez; Anguelos Nicolaou; Dimosthenis Karatzas | ||||
| Title | Improving patch‐based scene text script identification with ensembles of conjoined networks | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition | Abbreviated Journal |
PR |
| Volume | 67 | Issue | Pages | 85-96 | |
| 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 | DAG; 600.084; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ GNK2017 | Serial | 2887 | ||
| Permanent link to this record | |||||
| Author | Pau Rodriguez; Guillem Cucurull; Josep M. Gonfaus; Xavier Roca; Jordi Gonzalez | ||||
| Title | Age and gender recognition in the wild with deep attention | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition | Abbreviated Journal |
PR |
| Volume | 72 | Issue | Pages | 563-571 | |
| Keywords | Age recognition; Gender recognition; Deep neural networks; Attention mechanisms | ||||
| Abstract | Face analysis in images in the wild still pose a challenge for automatic age and gender recognition tasks, mainly due to their high variability in resolution, deformation, and occlusion. Although the performance has highly increased thanks to Convolutional Neural Networks (CNNs), it is still far from optimal when compared to other image recognition tasks, mainly because of the high sensitiveness of CNNs to facial variations. In this paper, inspired by biology and the recent success of attention mechanisms on visual question answering and fine-grained recognition, we propose a novel feedforward attention mechanism that is able to discover the most informative and reliable parts of a given face for improving age and gender classification. In particular, given a downsampled facial image, the proposed model is trained based on a novel end-to-end learning framework to extract the most discriminative patches from the original high-resolution image. Experimental validation on the standard Adience, Images of Groups, and MORPH II benchmarks show that including attention mechanisms enhances the performance of CNNs in terms of robustness and accuracy. | ||||
| 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 | ISE; 600.098; 602.133; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ RCG2017b | Serial | 2962 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta | ||||
| Title | Large-scale graph indexing using binary embeddings of node contexts for information spotting in document image databases | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition Letters | Abbreviated Journal |
PRL |
| Volume | 87 | Issue | Pages | 203-211 | |
| Keywords | |||||
| Abstract | Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations. However, retrieving a query graph from a large dataset of graphs implies a high computational complexity. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. With this aim, in this paper we propose a graph indexation formalism applied to visual retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Then, each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in different real scenarios such as handwritten word spotting in images of historical documents or symbol spotting in architectural floor plans. | ||||
| 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.097; 602.006; 603.053; 600.121 | Approved | no | ||
| Call Number | RLF2017b | Serial | 2873 | ||
| Permanent link to this record | |||||
| Author | Mireia Forns-Nadal; Federico Sem; Anna Mane; Laura Igual; Dani Guinart; Oscar Vilarroya | ||||
| Title | Increased Nucleus Accumbens Volume in First-Episode Psychosis | Type | Journal Article | ||
| Year | 2017 | Publication | Psychiatry Research-Neuroimaging | Abbreviated Journal |
PRN |
| Volume | 263 | Issue | Pages | 57-60 | |
| Keywords | |||||
| Abstract | Nucleus accumbens has been reported as a key structure in the neurobiology of schizophrenia. Studies analyzing structural abnormalities have shown conflicting results, possibly related to confounding factors. We investigated the nucleus accumbens volume using manual delimitation in first-episode psychosis (FEP) controlling for age, cannabis use and medication. Thirty-one FEP subjects who were naive or minimally exposed to antipsychotics and a control group were MRI scanned and clinically assessed from baseline to 6 months of follow-up. FEP showed increased relative and total accumbens volumes. Clinical correlations with negative symptoms, duration of untreated psychosis and cannabis use were not significant. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB; no menciona | Approved | no | ||
| Call Number | Admin @ si @ FSM2017 | Serial | 3028 | ||
| Permanent link to this record | |||||
| Author | Frederic Sampedro; Anna Domenech; Sergio Escalera; Ignasi Carrio | ||||
| Title | Computing quantitative indicators of structural renal damage in pediatric DMSA scans | Type | Journal Article | ||
| Year | 2017 | Publication | Revista Española de Medicina Nuclear e Imagen Molecular | Abbreviated Journal |
REMNIM |
| Volume | 36 | Issue | 2 | Pages | 72-77 |
| Keywords | |||||
| Abstract | OBJECTIVES:
The proposal and implementation of a computational framework for the quantification of structural renal damage from 99mTc-dimercaptosuccinic acid (DMSA) scans. The aim of this work is to propose, implement, and validate a computational framework for the quantification of structural renal damage from DMSA scans and in an observer-independent manner. MATERIALS AND METHODS: From a set of 16 pediatric DMSA-positive scans and 16 matched controls and using both expert-guided and automatic approaches, a set of image-derived quantitative indicators was computed based on the relative size, intensity and histogram distribution of the lesion. A correlation analysis was conducted in order to investigate the association of these indicators with other clinical data of interest in this scenario, including C-reactive protein (CRP), white cell count, vesicoureteral reflux, fever, relative perfusion, and the presence of renal sequelae in a 6-month follow-up DMSA scan. RESULTS: A fully automatic lesion detection and segmentation system was able to successfully classify DMSA-positive from negative scans (AUC=0.92, sensitivity=81% and specificity=94%). The image-computed relative size of the lesion correlated with the presence of fever and CRP levels (p<0.05), and a measurement derived from the distribution histogram of the lesion obtained significant performance results in the detection of permanent renal damage (AUC=0.86, sensitivity=100% and specificity=75%). CONCLUSIONS: The proposal and implementation of a computational framework for the quantification of structural renal damage from DMSA scans showed a promising potential to complement visual diagnosis and non-imaging indicators. |
||||
| 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;MILAB; no menciona | Approved | no | ||
| Call Number | Admin @ si @ SDE2017 | Serial | 2842 | ||
| Permanent link to this record | |||||
| Author | Cristhian A. Aguilera-Carrasco; Angel Sappa; Cristhian Aguilera; Ricardo Toledo | ||||
| Title | Cross-Spectral Local Descriptors via Quadruplet Network | Type | Journal Article | ||
| Year | 2017 | Publication | Sensors | Abbreviated Journal |
SENS |
| Volume | 17 | Issue | 4 | Pages | 873 |
| Keywords | |||||
| Abstract | This paper presents a novel CNN-based architecture, referred to as Q-Net, to learn local feature descriptors that are useful for matching image patches from two different spectral bands. Given correctly matched and non-matching cross-spectral image pairs, a quadruplet network is trained to map input image patches to a common Euclidean space, regardless of the input spectral band. Our approach is inspired by the recent success of triplet networks in the visible spectrum, but adapted for cross-spectral scenarios, where, for each matching pair, there are always two possible non-matching patches: one for each spectrum. Experimental evaluations on a public cross-spectral VIS-NIR dataset shows that the proposed approach improves the state-of-the-art. Moreover, the proposed technique can also be used in mono-spectral settings, obtaining a similar performance to triplet network descriptors, but requiring less training data. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.086; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ ASA2017 | Serial | 2914 | ||
| Permanent link to this record | |||||