| Home | [41–50] << 51 52 53 54 55 56 57 58 59 60 >> [61–70] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | S.Grau; Ana Puig; Sergio Escalera; Maria Salamo | ||||
| Title | Intelligent Interactive Volume Classification | Type | Conference Article | ||
| Year | 2013 | Publication | Pacific Graphics | Abbreviated Journal | |
Volume  |
32 | Issue | 7 | Pages | 23-28 |
| Keywords | |||||
| Abstract | This paper defines an intelligent and interactive framework to classify multiple regions of interest from the original data on demand, without requiring any preprocessing or previous segmentation. The proposed intelligent and interactive approach is divided in three stages: visualize, training and testing. First, users visualize and label some samples directly on slices of the volume. Training and testing are based on a framework of Error Correcting Output Codes and Adaboost classifiers that learn to classify each region the user has painted. Later, at the testing stage, each classifier is directly applied on the rest of samples and combined to perform multi-class labeling, being used in the final rendering. We also parallelized the training stage using a GPU-based implementation for
obtaining a rapid interaction and classification. |
||||
| 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-3-905674-50-7 | Medium | ||
| Area | Expedition | Conference | PG | ||
| Notes | HuPBA; 600.046;MILAB | Approved | no | ||
| Call Number | Admin @ si @ GPE2013b | Serial | 2355 | ||
| Permanent link to this record | |||||
| Author | Koen E.A. van de Sande; Theo Gevers; C.G.M. Snoek | ||||
| Title | Evaluating Color Descriptors for Object and Scene Recognition | Type | Journal Article | ||
| Year | 2010 | Publication | IEEE Transaction on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume |
32 | Issue | 9 | Pages | 1582 - 1596 |
| Keywords | |||||
| Abstract | Impact factor: 5.308
Image category recognition is important to access visual information on the level of objects and scene types. So far, intensity-based descriptors have been widely used for feature extraction at salient points. To increase illumination invariance and discriminative power, color descriptors have been proposed. Because many different descriptors exist, a structured overview is required of color invariant descriptors in the context of image category recognition. Therefore, this paper studies the invariance properties and the distinctiveness of color descriptors (software to compute the color descriptors from this paper is available from http://www.colordescriptors.com) in a structured way. The analytical invariance properties of color descriptors are explored, using a taxonomy based on invariance properties with respect to photometric transformations, and tested experimentally using a data set with known illumination conditions. In addition, the distinctiveness of color descriptors is assessed experimentally using two benchmarks, one from the image domain and one from the video domain. From the theoretical and experimental results, it can be derived that invariance to light intensity changes and light color changes affects category recognition. The results further reveal that, for light intensity shifts, the usefulness of invariance is category-specific. Overall, when choosing a single descriptor and no prior knowledge about the data set and object and scene categories is available, the OpponentSIFT is recommended. Furthermore, a combined set of color descriptors outperforms intensity-based SIFT and improves category recognition by 8 percent on the PASCAL VOC 2007 and by 7 percent on the Mediamill Challenge. |
||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ALTRES;ISE | Approved | no | ||
| Call Number | Admin @ si @ SGS2010 | Serial | 1846 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Pau Riba; Josep Llados; Alicia Fornes | ||||
| Title | Hierarchical Stochastic Graphlet Embedding for Graph-based Pattern Recognition | Type | Journal Article | ||
| Year | 2020 | Publication | Neural Computing and Applications | Abbreviated Journal | NEUCOMA |
| Volume |
32 | Issue | Pages | 11579–11596 | |
| Keywords | |||||
| Abstract | Despite being very successful within the pattern recognition and machine learning community, graph-based methods are often unusable because of the lack of mathematical operations defined in graph domain. Graph embedding, which maps graphs to a vectorial space, has been proposed as a way to tackle these difficulties enabling the use of standard machine learning techniques. However, it is well known that graph embedding functions usually suffer from the loss of structural information. In this paper, we consider the hierarchical structure of a graph as a way to mitigate this loss of information. The hierarchical structure is constructed by topologically clustering the graph nodes and considering each cluster as a node in the upper hierarchical level. Once this hierarchical structure is constructed, we consider several configurations to define the mapping into a vector space given a classical graph embedding, in particular, we propose to make use of the stochastic graphlet embedding (SGE). Broadly speaking, SGE produces a distribution of uniformly sampled low-to-high-order graphlets as a way to embed graphs into the vector space. In what follows, the coarse-to-fine structure of a graph hierarchy and the statistics fetched by the SGE complements each other and includes important structural information with varied contexts. Altogether, these two techniques substantially cope with the usual information loss involved in graph embedding techniques, obtaining a more robust graph representation. This fact has been corroborated through a detailed experimental evaluation on various benchmark graph datasets, where we outperform the state-of-the-art methods. | ||||
| 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.140; 600.121; 600.141 | Approved | no | ||
| Call Number | Admin @ si @ DRL2020 | Serial | 3348 | ||
| Permanent link to this record | |||||
| Author | Daniel Hernandez; Antonio Espinosa; David Vazquez; Antonio Lopez; Juan C. Moure | ||||
| Title | 3D Perception With Slanted Stixels on GPU | Type | Journal Article | ||
| Year | 2021 | Publication | IEEE Transactions on Parallel and Distributed Systems | Abbreviated Journal | TPDS |
| Volume |
32 | Issue | 10 | Pages | 2434-2447 |
| Keywords | Daniel Hernandez-Juarez; Antonio Espinosa; David Vazquez; Antonio M. Lopez; Juan C. Moure | ||||
| Abstract | This article presents a GPU-accelerated software design of the recently proposed model of Slanted Stixels, which represents the geometric and semantic information of a scene in a compact and accurate way. We reformulate the measurement depth model to reduce the computational complexity of the algorithm, relying on the confidence of the depth estimation and the identification of invalid values to handle outliers. The proposed massively parallel scheme and data layout for the irregular computation pattern that corresponds to a Dynamic Programming paradigm is described and carefully analyzed in performance terms. Performance is shown to scale gracefully on current generation embedded GPUs. We assess the proposed methods in terms of semantic and geometric accuracy as well as run-time performance on three publicly available benchmark datasets. Our approach achieves real-time performance with high accuracy for 2048 × 1024 image sizes and 4 × 4 Stixel resolution on the low-power embedded GPU of an NVIDIA Tegra Xavier. | ||||
| 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.124; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ HEV2021 | Serial | 3561 | ||
| Permanent link to this record | |||||
| Author | Javier Vazquez; Graham D. Finlayson; Luis Herranz | ||||
| Title | Improving the perception of low-light enhanced images | Type | Journal Article | ||
| Year | 2024 | Publication | Optics Express | Abbreviated Journal | |
| Volume |
32 | Issue | 4 | Pages | 5174-5190 |
| Keywords | |||||
| Abstract | Improving images captured under low-light conditions has become an important topic in computational color imaging, as it has a wide range of applications. Most current methods are either based on handcrafted features or on end-to-end training of deep neural networks that mostly focus on minimizing some distortion metric —such as PSNR or SSIM— on a set of training images. However, the minimization of distortion metrics does not mean that the results are optimal in terms of perception (i.e. perceptual quality). As an example, the perception-distortion trade-off states that, close to the optimal results, improving distortion results in worsening perception. This means that current low-light image enhancement methods —that focus on distortion minimization— cannot be optimal in the sense of obtaining a good image in terms of perception errors. In this paper, we propose a post-processing approach in which, given the original low-light image and the result of a specific method, we are able to obtain a result that resembles as much as possible that of the original method, but, at the same time, giving an improvement in the perception of the final image. More in detail, our method follows the hypothesis that in order to minimally modify the perception of an input image, any modification should be a combination of a local change in the shading across a scene and a global change in illumination color. We demonstrate the ability of our method quantitatively using perceptual blind image metrics such as BRISQUE, NIQE, or UNIQUE, and through user preference tests. | ||||
| 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 | MACO | Approved | no | ||
| Call Number | Admin @ si @ VFH2024 | Serial | 4018 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Agnes Borras; Josep Llados | ||||
| Title | Relational Indexing of Vectorial Primitives for Symbol Spotting in Line-Drawing Images | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume |
31 | Issue | 3 | Pages | 188–201 |
| Keywords | Document image analysis and recognition, Graphics recognition, Symbol spotting ,Vectorial representations, Line-drawings | ||||
| Abstract | This paper presents a symbol spotting approach for indexing by content a database of line-drawing images. As line-drawings are digital-born documents designed by vectorial softwares, instead of using a pixel-based approach, we present a spotting method based on vector primitives. Graphical symbols are represented by a set of vectorial primitives which are described by an off-the-shelf shape descriptor. A relational indexing strategy aims to retrieve symbol locations into the target documents by using a combined numerical-relational description of 2D structures. The zones which are likely to contain the queried symbol are validated by a Hough-like voting scheme. In addition, a performance evaluation framework for symbol spotting in graphical documents is proposed. The presented methodology has been evaluated with a benchmarking set of architectural documents achieving good performance results. | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RBL2010 | Serial | 1177 | ||
| Permanent link to this record | |||||
| Author | Oriol Ramos Terrades; Ernest Valveny; Salvatore Tabbone | ||||
| Title | Optimal Classifier Fusion in a Non-Bayesian Probabilistic Framework | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume |
31 | Issue | 9 | Pages | 1630–1644 |
| Keywords | |||||
| Abstract | The combination of the output of classifiers has been one of the strategies used to improve classification rates in general purpose classification systems. Some of the most common approaches can be explained using the Bayes' formula. In this paper, we tackle the problem of the combination of classifiers using a non-Bayesian probabilistic framework. This approach permits us to derive two linear combination rules that minimize misclassification rates under some constraints on the distribution of classifiers. In order to show the validity of this approach we have compared it with other popular combination rules from a theoretical viewpoint using a synthetic data set, and experimentally using two standard databases: the MNIST handwritten digit database and the GREC symbol database. Results on the synthetic data set show the validity of the theoretical approach. Indeed, results on real data show that the proposed methods outperform other common combination schemes. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RVT2009 | Serial | 1220 | ||
| Permanent link to this record | |||||
| Author | Oriol Pujol; David Masip | ||||
| Title | Geometry-Based Ensembles: Toward a Structural Characterization of the Classification Boundary | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume |
31 | Issue | 6 | Pages | 1140–1146 |
| Keywords | |||||
| Abstract | This article introduces a novel binary discriminative learning technique based on the approximation of the non-linear decision boundary by a piece-wise linear smooth additive model. The decision border is geometrically defined by means of the characterizing boundary points – points that belong to the optimal boundary under a certain notion of robustness. Based on these points, a set of locally robust linear classifiers is defined and assembled by means of a Tikhonov regularized optimization procedure in an additive model to create a final lambda-smooth decision rule. As a result, a very simple and robust classifier with a strong geometrical meaning and non-linear behavior is obtained. The simplicity of the method allows its extension to cope with some of nowadays machine learning challenges, such as online learning, large scale learning or parallelization, with linear computational complexity. We validate our approach on the UCI database. Finally, we apply our technique in online and large scale scenarios, and in six real life computer vision and pattern recognition problems: gender recognition, intravascular ultrasound tissue classification, speed traffic sign detection, Chagas' disease severity detection, clef classification and action recognition using a 3D accelerometer data. The results are promising and this paper opens a line of research that deserves further attention | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | OR;HuPBA;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ PuM2009 | Serial | 1252 | ||
| Permanent link to this record | |||||
| Author | Jose Antonio Rodriguez; Florent Perronnin; Gemma Sanchez; Josep Llados | ||||
| Title | Unsupervised writer adaptation of whole-word HMMs with application to word-spotting | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume |
31 | Issue | 8 | Pages | 742–749 |
| Keywords | Word-spotting; Handwriting recognition; Writer adaptation; Hidden Markov model; Document analysis | ||||
| Abstract | In this paper we propose a novel approach for writer adaptation in a handwritten word-spotting task. The method exploits the fact that the semi-continuous hidden Markov model separates the word model parameters into (i) a codebook of shapes and (ii) a set of word-specific parameters.
Our main contribution is to employ this property to derive writer-specific word models by statistically adapting an initial universal codebook to each document. This process is unsupervised and does not even require the appearance of the keyword(s) in the searched document. Experimental results show an increase in performance when this adaptation technique is applied. To the best of our knowledge, this is the first work dealing with adaptation for word-spotting. The preliminary version of this paper obtained an IBM Best Student Paper Award at the 19th International Conference on Pattern Recognition. |
||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RPS2010 | Serial | 1290 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | Re-coding ECOCs without retraining | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume |
31 | Issue | 7 | Pages | 555–562 |
| Keywords | |||||
| Abstract | A standard way to deal with multi-class categorization problems is by the combination of binary classifiers in a pairwise voting procedure. Recently, this classical approach has been formalized in the Error-Correcting Output Codes (ECOC) framework. In the ECOC framework, the one-versus-one coding demonstrates to achieve higher performance than the rest of coding designs. The binary problems that we train in the one-versus-one strategy are significantly smaller than in the rest of designs, and usually easier to be learnt, taking into account the smaller overlapping between classes. However, a high percentage of the positions coded by zero of the coding matrix, which implies a high sparseness degree, does not codify meta-class membership information. In this paper, we show that using the training data we can redefine without re-training, in a problem-dependent way, the one-versus-one coding matrix so that the new coded information helps the system to increase its generalization capability. Moreover, the new re-coding strategy is generalized to be applied over any binary code. The results over several UCI Machine Learning repository data sets and two real multi-class problems show that performance improvements can be obtained re-coding the classical one-versus-one and Sparse random designs compared to different state-of-the-art ECOC configurations. | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010e | Serial | 1338 | ||
| Permanent link to this record | |||||
| Author | Aura Hernandez-Sabate; Debora Gil; Petia Radeva; E.N.Nofrerias | ||||
| Title | Anisotropic processing of image structures for adventitia detection in intravascular ultrasound images | Type | Conference Article | ||
| Year | 2004 | Publication | Proc. Computers in Cardiology | Abbreviated Journal | |
| Volume |
31 | Issue | Pages | 229-232 | |
| Keywords | |||||
| Abstract | The adventitia layer appears as a weak edge in IVUS images with a non-uniform grey level, which difficulties its detection. In order to enhance edges, we apply an anisotropic filter that homogenizes the grey level along the image significant structures (ridges, valleys and edges). A standard edge detector applied to the filtered image yields a set of candidate points prone to be unconnected. The final model is obtained by interpolating the former line segments along the tangent direction to the level curves of the filtered image with an anisotropic contour closing technique based on functional extension principles | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Chicago (USA) | 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; MILAB | Approved | no | ||
| Call Number | IAM @ iam @ HGR2004 | Serial | 1555 | ||
| Permanent link to this record | |||||
| Author | Francisco Javier Orozco; Ognjen Rudovic; Jordi Gonzalez; Maja Pantic | ||||
| Title | Hierarchical On-line Appearance-Based Tracking for 3D Head Pose, Eyebrows, Lips, Eyelids and Irises | Type | Journal Article | ||
| Year | 2013 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume |
31 | Issue | 4 | Pages | 322-340 |
| Keywords | On-line appearance models; Levenberg–Marquardt algorithm; Line-search optimization; 3D face tracking; Facial action tracking; Eyelid tracking; Iris tracking | ||||
| Abstract | In this paper, we propose an On-line Appearance-Based Tracker (OABT) for simultaneous tracking of 3D head pose, lips, eyebrows, eyelids and irises in monocular video sequences. In contrast to previously proposed tracking approaches, which deal with face and gaze tracking separately, our OABT can also be used for eyelid and iris tracking, as well as 3D head pose, lips and eyebrows facial actions tracking. Furthermore, our approach applies an on-line learning of changes in the appearance of the tracked target. Hence, the prior training of appearance models, which usually requires a large amount of labeled facial images, is avoided. Moreover, the proposed method is built upon a hierarchical combination of three OABTs, which are optimized using a Levenberg–Marquardt Algorithm (LMA) enhanced with line-search procedures. This, in turn, makes the proposed method robust to changes in lighting conditions, occlusions and translucent textures, as evidenced by our experiments. Finally, the proposed method achieves head and facial actions tracking in real-time. | ||||
| 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 | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ISE; 605.203; 302.012; 302.018; 600.049 | Approved | no | ||
| Call Number | ORG2013 | Serial | 2221 | ||
| Permanent link to this record | |||||
| Author | G.Blasco; Simone Balocco; J.Puig; J.Sanchez-Gonzalez; W.Ricart; J.Daunis-I-Estadella; X.Molina; S.Pedraza; J.M.Fernandez-Real | ||||
| Title | Carotid pulse wave velocity by magnetic resonance imaging is increased in middle-aged subjects with the metabolic syndrome | Type | Journal Article | ||
| Year | 2015 | Publication | International Journal of Cardiovascular Imaging | Abbreviated Journal | ICJI |
| Volume |
31 | Issue | 3 | Pages | 603-612 |
| Keywords | Metabolic syndrome; Arterial stiffness; Pulse wave velocity; Carotid artery; Magnetic resonance | ||||
| Abstract | Arterial pulse wave velocity (PWV), an independent predictor of cardiovascular disease, physiologically increases with age; however, growing evidence suggests metabolic syndrome (MetS) accelerates this increase. Magnetic resonance imaging (MRI) enables reliable noninvasive assessment of arterial stiffness by measuring arterial PWV in specific vascular segments. We investigated the association between the presence of MetS and its components with carotid PWV (cPWV) in asymptomatic subjects without diabetes. We assessed cPWV by MRI in 61 individuals (mean age, 55.3 ± 14.1 years; median age, 55 years): 30 with MetS and 31 controls with similar age, sex, body mass index, and LDL-cholesterol levels. The study population was dichotomized by the median age. To remove the physiological association between PWV and age, unpaired t tests and multiple regression analyses were performed using the residuals of the regression between PWV and age. cPWV was higher in middle-aged subjects with MetS than in those without (p = 0.001), but no differences were found in elder subjects (p = 0.313). cPWV was associated with diastolic blood pressure (r = 0.276, p = 0.033) and waist circumference (r = 0.268, p = 0.038). The presence of MetS was associated with increased cPWV regardless of age, sex, blood pressure, and waist (p = 0.007). The MetS components contributing independently to an increased cPWV were hypertension (p = 0.018) and hypertriglyceridemia (p = 0.002). The presence of MetS is associated with an increased cPWV in middle-aged subjects. In particular, hypertension and hypertriglyceridemia may contribute to early progression of carotid stiffness. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Netherlands | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1569-5794 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB | Approved | no | ||
| Call Number | Admin @ si @ BBP2015 | Serial | 2670 | ||
| Permanent link to this record | |||||
| Author | Rada Deeb; Joost Van de Weijer; Damien Muselet; Mathieu Hebert; Alain Tremeau | ||||
| Title | Deep spectral reflectance and illuminant estimation from self-interreflections | Type | Journal Article | ||
| Year | 2019 | Publication | Journal of the Optical Society of America A | Abbreviated Journal | JOSA A |
| Volume |
31 | Issue | 1 | Pages | 105-114 |
| Keywords | |||||
| Abstract | In this work, we propose a convolutional neural network based approach to estimate the spectral reflectance of a surface and spectral power distribution of light from a single RGB image of a V-shaped surface. Interreflections happening in a concave surface lead to gradients of RGB values over its area. These gradients carry a lot of information concerning the physical properties of the surface and the illuminant. Our network is trained with only simulated data constructed using a physics-based interreflection model. Coupling interreflection effects with deep learning helps to retrieve the spectral reflectance under an unknown light and to estimate spectral power distribution of this light as well. In addition, it is more robust to the presence of image noise than classical approaches. Our results show that the proposed approach outperforms state-of-the-art learning-based approaches on simulated data. In addition, it gives better results on real data compared to other interreflection-based approaches. | ||||
| 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 | LAMP; 600.120 | Approved | no | ||
| Call Number | Admin @ si @ DWM2019 | Serial | 3362 | ||
| Permanent link to this record | |||||
| Author | Manisha Das; Deep Gupta; Petia Radeva; Ashwini M. Bakde | ||||
| Title | Multi-scale decomposition-based CT-MR neurological image fusion using optimized bio-inspired spiking neural model with meta-heuristic optimization | Type | Journal Article | ||
| Year | 2021 | Publication | International Journal of Imaging Systems and Technology | Abbreviated Journal | IMA |
| Volume |
31 | Issue | 4 | Pages | 2170-2188 |
| Keywords | |||||
| Abstract | Multi-modal medical image fusion plays an important role in clinical diagnosis and works as an assistance model for clinicians. In this paper, a computed tomography-magnetic resonance (CT-MR) image fusion model is proposed using an optimized bio-inspired spiking feedforward neural network in different decomposition domains. First, source images are decomposed into base (low-frequency) and detail (high-frequency) layer components. Low-frequency subbands are fused using texture energy measures to capture the local energy, contrast, and small edges in the fused image. High-frequency coefficients are fused using firing maps obtained by pixel-activated neural model with the optimized parameters using three different optimization techniques such as differential evolution, cuckoo search, and gray wolf optimization, individually. In the optimization model, a fitness function is computed based on the edge index of resultant fused images, which helps to extract and preserve sharp edges available in the source CT and MR images. To validate the fusion performance, a detailed comparative analysis is presented among the proposed and state-of-the-art methods in terms of quantitative and qualitative measures along with computational complexity. Experimental results show that the proposed method produces a significantly better visual quality of fused images meanwhile outperforms the existing methods. | ||||
| 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 @ DGR2021a | Serial | 3630 | ||
| Permanent link to this record | |||||