| Home | [201–210] << 211 212 213 214 215 216 217 218 219 220 >> [221–228] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Naveen Onkarappa; Angel Sappa | ||||
| Title | A Novel Space Variant Image Representation | Type | Journal Article | ||
| Year | 2013 | Publication | Journal of Mathematical Imaging and Vision | Abbreviated Journal | JMIV |
| Volume | 47 | Issue | 1-2 | Pages | 48-59 |
| Keywords | Space-variant representation; Log-polar mapping; Onboard vision applications | ||||
| Abstract | Traditionally, in machine vision images are represented using cartesian coordinates with uniform sampling along the axes. On the contrary, biological vision systems represent images using polar coordinates with non-uniform sampling. For various advantages provided by space-variant representations many researchers are interested in space-variant computer vision. In this direction the current work proposes a novel and simple space variant representation of images. The proposed representation is compared with the classical log-polar mapping. The log-polar representation is motivated by biological vision having the characteristic of higher resolution at the fovea and reduced resolution at the periphery. On the contrary to the log-polar, the proposed new representation has higher resolution at the periphery and lower resolution at the fovea. Our proposal is proved to be a better representation in navigational scenarios such as driver assistance systems and robotics. The experimental results involve analysis of optical flow fields computed on both proposed and log-polar representations. Additionally, an egomotion estimation application is also shown as an illustrative example. The experimental analysis comprises results from synthetic as well as real sequences. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
ISSN  |
0924-9907 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.055; 605.203; 601.215 | Approved | no | ||
| Call Number | Admin @ si @ OnS2013a | Serial | 2243 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera | ||||
| Title | Multi-Modal Human Behaviour Analysis from Visual Data Sources | Type | Journal | ||
| Year | 2013 | Publication | ERCIM News journal | Abbreviated Journal | ERCIM |
| Volume | 95 | Issue | Pages | 21-22 | |
| Keywords | |||||
| Abstract | The Human Pose Recovery and Behaviour Analysis group (HuPBA), University of Barcelona, is developing a line of research on multi-modal analysis of humans in visual data. The novel technology is being applied in several scenarios with high social impact, including sign language recognition, assisted technology and supported diagnosis for the elderly and people with mental/physical disabilities, fitness conditioning, and Human Computer Interaction. | ||||
| 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 |
0926-4981 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ Esc2013 | Serial | 2361 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; David Roche; Agnes Borras; Jesus Giraldo | ||||
| Title | Terminating Evolutionary Algorithms at their Steady State | Type | Journal Article | ||
| Year | 2015 | Publication | Computational Optimization and Applications | Abbreviated Journal | COA |
| Volume | 61 | Issue | 2 | Pages | 489-515 |
| Keywords | Evolutionary algorithms; Termination condition; Steady state; Differential evolution | ||||
| Abstract | Assessing the reliability of termination conditions for evolutionary algorithms (EAs) is of prime importance. An erroneous or weak stop criterion can negatively affect both the computational effort and the final result. We introduce a statistical framework for assessing whether a termination condition is able to stop an EA at its steady state, so that its results can not be improved anymore. We use a regression model in order to determine the requirements ensuring that a measure derived from EA evolving population is related to the distance to the optimum in decision variable space. Our framework is analyzed across 24 benchmark test functions and two standard termination criteria based on function fitness value in objective function space and EA population decision variable space distribution for the differential evolution (DE) paradigm. Results validate our framework as a powerful tool for determining the capability of a measure for terminating EA and the results also identify the decision variable space distribution as the best-suited for accurately terminating DE in real-world applications. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer US | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0926-6003 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | IAM; 600.044; 605.203; 600.060; 600.075 | Approved | no | ||
| Call Number | Admin @ si @ GRB2015 | Serial | 2560 | ||
| Permanent link to this record | |||||
| Author | Arnau Ramisa; Adriana Tapus; David Aldavert; Ricardo Toledo; Ramon Lopez de Mantaras | ||||
| Title | Robust Vision-Based Localization using Combinations of Local Feature Regions Detectors | Type | Journal Article | ||
| Year | 2009 | Publication | Autonomous Robots | Abbreviated Journal | AR |
| Volume | 27 | Issue | 4 | Pages | 373-385 |
| Keywords | |||||
| Abstract | This paper presents a vision-based approach for mobile robot localization. The model of the environment is topological. The new approach characterizes a place using a signature. This signature consists of a constellation of descriptors computed over different types of local affine covariant regions extracted from an omnidirectional image acquired rotating a standard camera with a pan-tilt unit. This type of representation permits a reliable and distinctive environment modelling. Our objectives were to validate the proposed method in indoor environments and, also, to find out if the combination of complementary local feature region detectors improves the localization versus using a single region detector. Our experimental results show that if false matches are effectively rejected, the combination of different covariant affine region detectors increases notably the performance of the approach by combining the different strengths of the individual detectors. In order to reduce the localization time, two strategies are evaluated: re-ranking the map nodes using a global similarity measure and using standard perspective view field of 45°.
In order to systematically test topological localization methods, another contribution proposed in this work is a novel method to see the degradation in localization performance as the robot moves away from the point where the original signature was acquired. This allows to know the robustness of the proposed signature. In order for this to be effective, it must be done in several, variated, environments that test all the possible situations in which the robot may have to perform localization. |
||||
| 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 |
0929-5593 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RTA2009 | Serial | 1245 | ||
| Permanent link to this record | |||||
| Author | Dani Rowe; Jordi Gonzalez; Marco Pedersoli; Juan J. Villanueva | ||||
| Title | On Tracking Inside Groups | Type | Journal Article | ||
| Year | 2010 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 21 | Issue | 2 | Pages | 113–127 |
| Keywords | |||||
| Abstract | This work develops a new architecture for multiple-target tracking in unconstrained dynamic scenes, which consists of a detection level which feeds a two-stage tracking system. A remarkable characteristic of the system is its ability to track several targets while they group and split, without using 3D information. Thus, special attention is given to the feature-selection and appearance-computation modules, and to those modules involved in tracking through groups. The system aims to work as a stand-alone application in complex and dynamic scenarios. No a-priori knowledge about either the scene or the targets, based on a previous training period, is used. Hence, the scenario is completely unknown beforehand. Successful tracking has been demonstrated in well-known databases of both indoor and outdoor scenarios. Accurate and robust localisations have been yielded during long-term target merging and occlusions. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | ISE @ ise @ RGP2010 | Serial | 1158 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | Traffic sign recognition system with β -correction | Type | Journal Article | ||
| Year | 2010 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 21 | Issue | 2 | Pages | 99–111 |
| Keywords | |||||
| Abstract | Traffic sign classification represents a classical application of multi-object recognition processing in uncontrolled adverse environments. Lack of visibility, illumination changes, and partial occlusions are just a few problems. In this paper, we introduce a novel system for multi-class classification of traffic signs based on error correcting output codes (ECOC). ECOC is based on an ensemble of binary classifiers that are trained on bi-partition of classes. We classify a wide set of traffic signs types using robust error correcting codings. Moreover, we introduce the novel β-correction decoding strategy that outperforms the state-of-the-art decoding techniques, classifying a high number of classes with great success. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010a | Serial | 1276 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Fadi Dornaika | ||||
| Title | Texture-independent recognition of facial expressions in image snapshots and videos | Type | Journal Article | ||
| Year | 2013 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 24 | Issue | 4 | Pages | 811-820 |
| Keywords | |||||
| Abstract | This paper addresses the static and dynamic recognition of basic facial expressions. It has two main contributions. First, we introduce a view- and texture-independent scheme that exploits facial action parameters estimated by an appearance-based 3D face tracker. We represent the learned facial actions associated with different facial expressions by time series. Second, we compare this dynamic scheme with a static one based on analyzing individual snapshots and show that the former performs better than the latter. We provide evaluations of performance using three subspace learning techniques: linear discriminant analysis, non-parametric discriminant analysis and support vector machines. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR; 600.046; 605.203;MV | Approved | no | ||
| Call Number | Admin @ si @ RaD2013 | Serial | 2230 | ||
| Permanent link to this record | |||||
| Author | Sergio Vera; Debora Gil; Agnes Borras; Marius George Linguraru; Miguel Angel Gonzalez Ballester | ||||
| Title | Geometric Steerable Medial Maps | Type | Journal Article | ||
| Year | 2013 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 24 | Issue | 6 | Pages | 1255-1266 |
| Keywords | Medial Representations ,Medial Manifolds Comparation , Surface , Reconstruction | ||||
| Abstract | In order to provide more intuitive and easily interpretable representations of complex shapes/organs, medial manifolds should reach a compromise between simplicity in geometry and capability for restoring the anatomy/shape of the organ/volume. Existing morphological methods show excellent results when applied to 2D objects, but their quality drops across dimensions.
This paper contributes to the computation of medial manifolds in two aspects. First, we provide a standard scheme for the computation of medial manifolds that avoids degenerated medial axis segments. Second, we introduce a continuous operator for accurate and efficient computation of medial structures of arbitrary dimension. We evaluate quantitatively the performance of our method with respect to existing approaches, by applying them to syn- thetic shapes of known medial geometry. We also show its higher performance for medical imaging applications in terms of simplicity of medial structures and capability for reconstructing the anatomical volume. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | Mubarak Shah | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | IAM; 605.203; 600.060; 600.044 | Approved | no | ||
| Call Number | IAM @ iam @ VGB2013 | Serial | 2192 | ||
| Permanent link to this record | |||||
| Author | Thierry Brouard; Jordi Gonzalez; Caifeng Shan; Massimo Piccardi; Larry S. Davis | ||||
| Title | Special issue on background modeling for foreground detection in real-world dynamic scenes | Type | Journal Article | ||
| Year | 2014 | Publication | Machine Vision and Applications | Abbreviated Journal | MVAP |
| Volume | 25 | Issue | 5 | Pages | 1101-1103 |
| Keywords | |||||
| Abstract | Although background modeling and foreground detection are not mandatory steps for computer vision applications, they may prove useful as they separate the primal objects usually called “foreground” from the remaining part of the scene called “background”, and permits different algorithmic treatment in the video processing field such as video surveillance, optical motion capture, multimedia applications, teleconferencing and human–computer interfaces. Conventional background modeling methods exploit the temporal variation of each pixel to model the background, and the foreground detection is made using change detection. The last decade witnessed very significant publications on background modeling but recently new applications in which background is not static, such as recordings taken from mobile devices or Internet videos, need new developments to detect robustly moving objects in challenging environments. Thus, effective methods for robustness to deal both with dynamic backgrounds, i | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE; 600.078 | Approved | no | ||
| Call Number | BGS2014a | Serial | 2411 | ||
| Permanent link to this record | |||||
| Author | Fahad Shahbaz Khan; Shida Beigpour; Joost Van de Weijer; Michael Felsberg | ||||
| Title | Painting-91: A Large Scale Database for Computational Painting Categorization | Type | Journal Article | ||
| Year | 2014 | Publication | Machine Vision and Applications | Abbreviated Journal | MVAP |
| Volume | 25 | Issue | 6 | Pages | 1385-1397 |
| Keywords | |||||
| Abstract | Computer analysis of visual art, especially paintings, is an interesting cross-disciplinary research domain. Most of the research in the analysis of paintings involve medium to small range datasets with own specific settings. Interestingly, significant progress has been made in the field of object and scene recognition lately. A key factor in this success is the introduction and availability of benchmark datasets for evaluation. Surprisingly, such a benchmark setup is still missing in the area of computational painting categorization. In this work, we propose a novel large scale dataset of digital paintings. The dataset consists of paintings from 91 different painters. We further show three applications of our dataset namely: artist categorization, style classification and saliency detection. We investigate how local and global features popular in image classification perform for the tasks of artist and style categorization. For both categorization tasks, our experimental results suggest that combining multiple features significantly improves the final performance. We show that state-of-the-art computer vision methods can correctly classify 50 % of unseen paintings to its painter in a large dataset and correctly attribute its artistic style in over 60 % of the cases. Additionally, we explore the task of saliency detection on paintings and show experimental findings using state-of-the-art saliency estimation algorithms. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC; LAMP; 600.074; 600.079 | Approved | no | ||
| Call Number | Admin @ si @ KBW2014 | Serial | 2510 | ||
| Permanent link to this record | |||||
| Author | Katerine Diaz; Francesc J. Ferri; Aura Hernandez-Sabate | ||||
| Title | An overview of incremental feature extraction methods based on linear subspaces | Type | Journal Article | ||
| Year | 2018 | Publication | Knowledge-Based Systems | Abbreviated Journal | KBS |
| Volume | 145 | Issue | Pages | 219-235 | |
| Keywords | |||||
| Abstract | With the massive explosion of machine learning in our day-to-day life, incremental and adaptive learning has become a major topic, crucial to keep up-to-date and improve classification models and their corresponding feature extraction processes. This paper presents a categorized overview of incremental feature extraction based on linear subspace methods which aim at incorporating new information to the already acquired knowledge without accessing previous data. Specifically, this paper focuses on those linear dimensionality reduction methods with orthogonal matrix constraints based on global loss function, due to the extensive use of their batch approaches versus other linear alternatives. Thus, we cover the approaches derived from Principal Components Analysis, Linear Discriminative Analysis and Discriminative Common Vector methods. For each basic method, its incremental approaches are differentiated according to the subspace model and matrix decomposition involved in the updating process. Besides this categorization, several updating strategies are distinguished according to the amount of data used to update and to the fact of considering a static or dynamic number of classes. Moreover, the specific role of the size/dimension ratio in each method is considered. Finally, computational complexity, experimental setup and the accuracy rates according to published results are compiled and analyzed, and an empirical evaluation is done to compare the best approach of each kind. | ||||
| 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 |
0950-7051 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ DFH2018 | Serial | 3090 | ||
| Permanent link to this record | |||||
| Author | J.S. Cope; P.Remagnino; S.Mannan; Katerine Diaz; Francesc J. Ferri; P.Wilkin | ||||
| Title | Reverse Engineering Expert Visual Observations: From Fixations To The Learning Of Spatial Filters With A Neural-Gas Algorithm | Type | Journal Article | ||
| Year | 2013 | Publication | Expert Systems with Applications | Abbreviated Journal | EXWA |
| Volume | 40 | Issue | 17 | Pages | 6707-6712 |
| Keywords | Neural gas; Expert vision; Eye-tracking; Fixations | ||||
| Abstract | Human beings can become experts in performing specific vision tasks, for example, doctors analysing medical images, or botanists studying leaves. With sufficient knowledge and experience, people can become very efficient at such tasks. When attempting to perform these tasks with a machine vision system, it would be highly beneficial to be able to replicate the process which the expert undergoes. Advances in eye-tracking technology can provide data to allow us to discover the manner in which an expert studies an image. This paper presents a first step towards utilizing these data for computer vision purposes. A growing-neural-gas algorithm is used to learn a set of Gabor filters which give high responses to image regions which a human expert fixated on. These filters can then be used to identify regions in other images which are likely to be useful for a given vision task. The algorithm is evaluated by learning filters for locating specific areas of plant leaves. | ||||
| 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 |
0957-4174 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ CRM2013 | Serial | 2438 | ||
| Permanent link to this record | |||||
| Author | Volkmar Frinken; Markus Baumgartner; Andreas Fischer; Horst Bunke | ||||
| Title | Semi-Supervised Learning for Cursive Handwriting Recognition using Keyword Spotting | Type | Conference Article | ||
| Year | 2012 | Publication | 13th International Conference on Frontiers in Handwriting Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 49-54 | ||
| Keywords | |||||
| Abstract | State-of-the-art handwriting recognition systems are learning-based systems that require large sets of training data. The creation of training data, and consequently the creation of a well-performing recognition system, requires therefore a substantial amount of human work. This can be reduced with semi-supervised learning, which uses unlabeled text lines for training as well. Current approaches estimate the correct transcription of the unlabeled data via handwriting recognition which is not only extremely demanding as far as computational costs are concerned but also requires a good model of the target language. In this paper, we propose a different approach that makes use of keyword spotting, which is significantly faster and does not need any language model. In a set of experiments we demonstrate its superiority over existing approaches. | ||||
| Address | Bari, Italy | ||||
| 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 |
10.1109/ICFHR.2012.268 | ISBN | 978-1-4673-2262-1 | Medium | |
| Area | Expedition | Conference | ICFHR | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ FBF2012 | Serial | 2055 | ||
| Permanent link to this record | |||||
| Author | Maria Salamo; Sergio Escalera | ||||
| Title | Increasing Retrieval Quality in Conversational Recommenders | Type | Journal Article | ||
| Year | 2011 | Publication | IEEE Transactions on Knowledge and Data Engineering | Abbreviated Journal | TKDE |
| Volume | 99 | Issue | Pages | 1-1 | |
| Keywords | |||||
| Abstract | IF JCR CCIA 2.286 2009 24/103
JCR Impact Factor 2010: 1.851 A major task of research in conversational recommender systems is personalization. Critiquing is a common and powerful form of feedback, where a user can express her feature preferences by applying a series of directional critiques over the recommendations instead of providing specific preference values. Incremental Critiquing is a conversational recommender system that uses critiquing as a feedback to efficiently personalize products. The expectation is that in each cycle the system retrieves the products that best satisfy the user’s soft product preferences from a minimal information input. In this paper, we present a novel technique that increases retrieval quality based on a combination of compatibility and similarity scores. Under the hypothesis that a user learns Turing the recommendation process, we propose two novel exponential reinforcement learning approaches for compatibility that take into account both the instant at which the user makes a critique and the number of satisfied critiques. Moreover, we consider that the impact of features on the similarity differs according to the preferences manifested by the user. We propose a global weighting approach that uses a common weight for nearest cases in order to focus on groups of relevant products. We show that our methodology significantly improves recommendation efficiency in four data sets of different sizes in terms of session length in comparison with state-of-the-art approaches. Moreover, our recommender shows higher robustness against noisy user data when compared to classical approaches |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | IEEE | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
1041-4347 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB; HuPBA | Approved | no | ||
| Call Number | Admin @ si @ SaE2011 | Serial | 1713 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; Jose Maria-Carazo; Roberto Marabini | ||||
| Title | On the nature of 2D crystal unbending | Type | Journal Article | ||
| Year | 2006 | Publication | Journal of Structural Biology | Abbreviated Journal | |
| Volume | 156 | Issue | 3 | Pages | 546-555 |
| Keywords | Electron microscopy | ||||
| Abstract | Crystal unbending, the process that aims to recover a perfect crystal from experimental data, is one of the more important steps in electron crystallography image processing. The unbending process involves three steps: estimation of the unit cell displacements from their ideal positions, extension of the deformation field to the whole image and transformation of the image in order to recover an ideal crystal. In this work, we present a systematic analysis of the second step oriented to address two issues. First, whether the unit cells remain undistorted and only the distance between them should be changed (rigid case) or should be modified with the same deformation suffered by the whole crystal (elastic case). Second, the performance of different extension algorithms (interpolation versus approximation) is explored. Our experiments show that there is no difference between elastic and rigid cases or among the extension algorithms. This implies that the deformation fields are constant over large areas. Furthermore, our results indicate that the main source of error is the transformation of the crystal image. | ||||
| 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 |
1047-8477 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | IAM; | Approved | no | ||
| Call Number | IAM @ iam @ GCM2006 | Serial | 1519 | ||
| Permanent link to this record | |||||