| Home | [121–130] << 131 132 133 134 135 136 137 138 139 140 >> [141–150] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Miguel Oliveira; Victor Santos; Angel Sappa | ||||
| Title | Multimodal Inverse Perspective Mapping | Type | Journal Article | ||
Year  |
2015 | Publication | Information Fusion | Abbreviated Journal | IF |
| Volume | 24 | Issue | Pages | 108–121 | |
| Keywords | Inverse perspective mapping; Multimodal sensor fusion; Intelligent vehicles | ||||
| Abstract | Over the past years, inverse perspective mapping has been successfully applied to several problems in the field of Intelligent Transportation Systems. In brief, the method consists of mapping images to a new coordinate system where perspective effects are removed. The removal of perspective associated effects facilitates road and obstacle detection and also assists in free space estimation. There is, however, a significant limitation in the inverse perspective mapping: the presence of obstacles on the road disrupts the effectiveness of the mapping. The current paper proposes a robust solution based on the use of multimodal sensor fusion. Data from a laser range finder is fused with images from the cameras, so that the mapping is not computed in the regions where obstacles are present. As shown in the results, this considerably improves the effectiveness of the algorithm and reduces computation time when compared with the classical inverse perspective mapping. Furthermore, the proposed approach is also able to cope with several cameras with different lenses or image resolutions, as well as dynamic viewpoints. | ||||
| 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.055; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ OSS2015c | Serial | 2532 | ||
| Permanent link to this record | |||||
| Author | T. Mouats; N. Aouf; Angel Sappa; Cristhian A. Aguilera-Carrasco; Ricardo Toledo | ||||
| Title | Multi-Spectral Stereo Odometry | Type | Journal Article | ||
| Year |
2015 | Publication | IEEE Transactions on Intelligent Transportation Systems | Abbreviated Journal | TITS |
| Volume | 16 | Issue | 3 | Pages | 1210-1224 |
| Keywords | Egomotion estimation; feature matching; multispectral odometry (MO); optical flow; stereo odometry; thermal imagery | ||||
| Abstract | In this paper, we investigate the problem of visual odometry for ground vehicles based on the simultaneous utilization of multispectral cameras. It encompasses a stereo rig composed of an optical (visible) and thermal sensors. The novelty resides in the localization of the cameras as a stereo setup rather
than two monocular cameras of different spectrums. To the best of our knowledge, this is the first time such task is attempted. Log-Gabor wavelets at different orientations and scales are used to extract interest points from both images. These are then described using a combination of frequency and spatial information within the local neighborhood. Matches between the pairs of multimodal images are computed using the cosine similarity function based on the descriptors. Pyramidal Lucas–Kanade tracker is also introduced to tackle temporal feature matching within challenging sequences of the data sets. The vehicle egomotion is computed from the triangulated 3-D points corresponding to the matched features. A windowed version of bundle adjustment incorporating Gauss–Newton optimization is utilized for motion estimation. An outlier removal scheme is also included within the framework to deal with outliers. Multispectral data sets were generated and used as test bed. They correspond to real outdoor scenarios captured using our multimodal setup. Finally, detailed results validating the proposed strategy are illustrated. |
||||
| 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 | 1524-9050 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.055; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ MAS2015a | Serial | 2533 | ||
| Permanent link to this record | |||||
| Author | Mohammad Rouhani; Angel Sappa; E. Boyer | ||||
| Title | Implicit B-Spline Surface Reconstruction | Type | Journal Article | ||
| Year |
2015 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 24 | Issue | 1 | Pages | 22 - 32 |
| Keywords | |||||
| Abstract | This paper presents a fast and flexible curve, and surface reconstruction technique based on implicit B-spline. This representation does not require any parameterization and it is locally supported. This fact has been exploited in this paper to propose a reconstruction technique through solving a sparse system of equations. This method is further accelerated to reduce the dimension to the active control lattice. Moreover, the surface smoothness and user interaction are allowed for controlling the surface. Finally, a novel weighting technique has been introduced in order to blend small patches and smooth them in the overlapping regions. The whole framework is very fast and efficient and can handle large cloud of points with very low computational cost. The experimental results show the flexibility and accuracy of the proposed algorithm to describe objects with complex topologies. Comparisons with other fitting methods highlight the superiority of the proposed approach in the presence of noise and missing 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 | 1057-7149 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ RSB2015 | Serial | 2541 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; David Aldavert; Ricardo Toledo; Josep Llados | ||||
| Title | Efficient segmentation-free keyword spotting in historical document collections | Type | Journal Article | ||
| Year |
2015 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 48 | Issue | 2 | Pages | 545–555 |
| Keywords | Historical documents; Keyword spotting; Segmentation-free; Dense SIFT features; Latent semantic analysis; Product quantization | ||||
| Abstract | In this paper we present an efficient segmentation-free word spotting method, applied in the context of historical document collections, that follows the query-by-example paradigm. We use a patch-based framework where local patches are described by a bag-of-visual-words model powered by SIFT descriptors. By projecting the patch descriptors to a topic space with the latent semantic analysis technique and compressing the descriptors with the product quantization method, we are able to efficiently index the document information both in terms of memory and time. The proposed method is evaluated using four different collections of historical documents achieving good performances on both handwritten and typewritten scenarios. The yielded performances outperform the recent state-of-the-art keyword spotting 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 | DAG; ADAS; 600.076; 600.077; 600.061; 601.223; 602.006; 600.055 | Approved | no | ||
| Call Number | Admin @ si @ RAT2015a | Serial | 2544 | ||
| Permanent link to this record | |||||
| Author | Katerine Diaz; Francesc J. Ferri; W. Diaz | ||||
| Title | Incremental Generalized Discriminative Common Vectors for Image Classification | Type | Journal Article | ||
| Year |
2015 | Publication | IEEE Transactions on Neural Networks and Learning Systems | Abbreviated Journal | TNNLS |
| Volume | 26 | Issue | 8 | Pages | 1761 - 1775 |
| Keywords | |||||
| Abstract | Subspace-based methods have become popular due to their ability to appropriately represent complex data in such a way that both dimensionality is reduced and discriminativeness is enhanced. Several recent works have concentrated on the discriminative common vector (DCV) method and other closely related algorithms also based on the concept of null space. In this paper, we present a generalized incremental formulation of the DCV methods, which allows the update of a given model by considering the addition of new examples even from unseen classes. Having efficient incremental formulations of well-behaved batch algorithms allows us to conveniently adapt previously trained classifiers without the need of recomputing them from scratch. The proposed generalized incremental method has been empirically validated in different case studies from different application domains (faces, objects, and handwritten digits) considering several different scenarios in which new data are continuously added at different rates starting from an initial 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 | 2162-237X | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ DFD2015 | Serial | 2547 | ||
| Permanent link to this record | |||||
| Author | Alvaro Cepero; Albert Clapes; Sergio Escalera | ||||
| Title | Automatic non-verbal communication skills analysis: a quantitative evaluation | Type | Journal Article | ||
| Year |
2015 | Publication | AI Communications | Abbreviated Journal | AIC |
| Volume | 28 | Issue | 1 | Pages | 87-101 |
| Keywords | Social signal processing; human behavior analysis; multi-modal data description; multi-modal data fusion; non-verbal communication analysis; e-Learning | ||||
| Abstract | The oral communication competence is defined on the top of the most relevant skills for one's professional and personal life. Because of the importance of communication in our activities of daily living, it is crucial to study methods to evaluate and provide the necessary feedback that can be used in order to improve these communication capabilities and, therefore, learn how to express ourselves better. In this work, we propose a system capable of evaluating quantitatively the quality of oral presentations in an automatic fashion. The system is based on a multi-modal RGB, depth, and audio data description and a fusion approach in order to recognize behavioral cues and train classifiers able to eventually predict communication quality levels. The performance of the proposed system is tested on a novel dataset containing Bachelor thesis' real defenses, presentations from an 8th semester Bachelor courses, and Master courses' presentations at Universitat de Barcelona. Using as groundtruth the marks assigned by actual instructors, our system achieves high performance categorizing and ranking presentations by their quality, and also making real-valued mark predictions. | ||||
| 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 | 0921-7126 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HUPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ CCE2015 | Serial | 2549 | ||
| Permanent link to this record | |||||
| Author | Frederic Sampedro; Sergio Escalera | ||||
| Title | Spatial codification of label predictions in Multi-scale Stacked Sequential Learning: A case study on multi-class medical volume segmentation | Type | Journal Article | ||
| Year |
2015 | Publication | IET Computer Vision | Abbreviated Journal | IETCV |
| Volume | 9 | Issue | 3 | Pages | 439 - 446 |
| Keywords | |||||
| Abstract | In this study, the authors propose the spatial codification of label predictions within the multi-scale stacked sequential learning (MSSL) framework, a successful learning scheme to deal with non-independent identically distributed data entries. After providing a motivation for this objective, they describe its theoretical framework based on the introduction of the blurred shape model as a smart descriptor to codify the spatial distribution of the predicted labels and define the new extended feature set for the second stacked classifier. They then particularise this scheme to be applied in volume segmentation applications. Finally, they test the implementation of the proposed framework in two medical volume segmentation datasets, obtaining significant performance improvements (with a 95% of confidence) in comparison to standard Adaboost classifier and classical MSSL 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 | 1751-9632 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ SaE2015 | Serial | 2551 | ||
| Permanent link to this record | |||||
| Author | Daniel Sanchez; Miguel Angel Bautista; Sergio Escalera | ||||
| Title | HuPBA 8k+: Dataset and ECOC-GraphCut based Segmentation of Human Limbs | Type | Journal Article | ||
| Year |
2015 | Publication | Neurocomputing | Abbreviated Journal | NEUCOM |
| Volume | 150 | Issue | A | Pages | 173–188 |
| Keywords | Human limb segmentation; ECOC; Graph-Cuts | ||||
| Abstract | Human multi-limb segmentation in RGB images has attracted a lot of interest in the research community because of the huge amount of possible applications in fields like Human-Computer Interaction, Surveillance, eHealth, or Gaming. Nevertheless, human multi-limb segmentation is a very hard task because of the changes in appearance produced by different points of view, clothing, lighting conditions, occlusions, and number of articulations of the human body. Furthermore, this huge pose variability makes the availability of large annotated datasets difficult. In this paper, we introduce the HuPBA8k+ dataset. The dataset contains more than 8000 labeled frames at pixel precision, including more than 120000 manually labeled samples of 14 different limbs. For completeness, the dataset is also labeled at frame-level with action annotations drawn from an 11 action dictionary which includes both single person actions and person-person interactive actions. Furthermore, we also propose a two-stage approach for the segmentation of human limbs. In a first stage, human limbs are trained using cascades of classifiers to be split in a tree-structure way, which is included in an Error-Correcting Output Codes (ECOC) framework to define a body-like probability map. This map is used to obtain a binary mask of the subject by means of GMM color modelling and GraphCuts theory. In a second stage, we embed a similar tree-structure in an ECOC framework to build a more accurate set of limb-like probability maps within the segmented user mask, that are fed to a multi-label GraphCut procedure to obtain final multi-limb segmentation. The methodology is tested on the novel HuPBA8k+ dataset, showing performance improvements in comparison to state-of-the-art approaches. In addition, a baseline of standard action recognition methods for the 11 actions categories of the novel dataset is also provided. | ||||
| 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 | Approved | no | ||
| Call Number | Admin @ si @ SBE2015 | Serial | 2552 | ||
| Permanent link to this record | |||||
| Author | M. Olivera; Angel Sappa; Victor Santos | ||||
| Title | A probabilistic approach for color correction in image mosaicking applications | Type | Journal Article | ||
| Year |
2015 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 14 | Issue | 2 | Pages | 508 - 523 |
| Keywords | Color correction; image mosaicking; color transfer; color palette mapping functions | ||||
| Abstract | Image mosaicking applications require both geometrical and photometrical registrations between the images that compose the mosaic. This paper proposes a probabilistic color correction algorithm for correcting the photometrical disparities. First, the image to be color corrected is segmented into several regions using mean shift. Then, connected regions are extracted using a region fusion algorithm. Local joint image histograms of each region are modeled as collections of truncated Gaussians using a maximum likelihood estimation procedure. Then, local color palette mapping functions are computed using these sets of Gaussians. The color correction is performed by applying those functions to all the regions of the image. An extensive comparison with ten other state of the art color correction algorithms is presented, using two different image pair data sets. Results show that the proposed approach obtains the best average scores in both data sets and evaluation metrics and is also the most robust to failures. | ||||
| 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 | 1057-7149 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.076 | Approved | no | ||
| Call Number | Admin @ si @ OSS2015b | Serial | 2554 | ||
| Permanent link to this record | |||||
| Author | G. Zahnd; Simone Balocco; A. Serusclat; P. Moulin; M. Orkisz; D. Vray | ||||
| Title | Progressive attenuation of the longitudinal kinetics in the common carotid artery: preliminary in vivo assessment Ultrasound in Medicine and Biology | Type | Journal Article | ||
| Year |
2015 | Publication | Ultrasound in Medicine and Biology | Abbreviated Journal | UMB |
| Volume | 41 | Issue | 1 | Pages | 339-345 |
| Keywords | Arterial stiffness; Atherosclerosis; Common carotid artery; Longitudinal kinetics; Motion tracking; Ultrasound imaging | ||||
| Abstract | Longitudinal kinetics (LOKI) of the arterial wall consists of the shearing motion of the intima-media complex over the adventitia layer in the direction parallel to the blood flow during the cardiac cycle. The aim of this study was to investigate the local variability of LOKI amplitude along the length of the vessel. By use of a previously validated motion-estimation framework, 35 in vivo longitudinal B-mode ultrasound cine loops of healthy common carotid arteries were analyzed. Results indicated that LOKI amplitude is progressively attenuated along the length of the artery, as it is larger in regions located on the proximal side of the image (i.e., toward the heart) and smaller in regions located on the distal side of the image (i.e., toward the head), with an average attenuation coefficient of -2.5 ± 2.0%/mm. Reported for the first time in this study, this phenomenon is likely to be of great importance in improving understanding of atherosclerosis mechanisms, and has the potential to be a novel index of arterial stiffness. | ||||
| 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 | Approved | no | ||
| Call Number | Admin @ si @ ZBS2014 | Serial | 2556 | ||
| Permanent link to this record | |||||
| Author | G. Lisanti; I. Masi; Andrew Bagdanov; Alberto del Bimbo | ||||
| Title | Person Re-identification by Iterative Re-weighted Sparse Ranking | Type | Journal Article | ||
| Year |
2015 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 37 | Issue | 8 | Pages | 1629 - 1642 |
| Keywords | |||||
| Abstract | In this paper we introduce a method for person re-identification based on discriminative, sparse basis expansions of targets in terms of a labeled gallery of known individuals. We propose an iterative extension to sparse discriminative classifiers capable of ranking many candidate targets. The approach makes use of soft- and hard- re-weighting to redistribute energy among the most relevant contributing elements and to ensure that the best candidates are ranked at each iteration. Our approach also leverages a novel visual descriptor which we show to be discriminative while remaining robust to pose and illumination variations. An extensive comparative evaluation is given demonstrating that our approach achieves state-of-the-art performance on single- and multi-shot person re-identification scenarios on the VIPeR, i-LIDS, ETHZ, and CAVIAR4REID datasets. The combination of our descriptor and iterative sparse basis expansion improves state-of-the-art rank-1 performance by six percentage points on VIPeR and by 20 on CAVIAR4REID compared to other methods with a single gallery image per person. With multiple gallery and probe images per person our approach improves by 17 percentage points the state-of-the-art on i-LIDS and by 72 on CAVIAR4REID at rank-1. The approach is also quite efficient, capable of single-shot person re-identification over galleries containing hundreds of individuals at about 30 re-identifications per second. | ||||
| 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 | LAMP; 601.240; 600.079 | Approved | no | ||
| Call Number | Admin @ si @ LMB2015 | Serial | 2557 | ||
| 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 | Alejandro Gonzalez Alzate; Gabriel Villalonga; Jiaolong Xu; David Vazquez; Jaume Amores; Antonio Lopez | ||||
| Title | Multiview Random Forest of Local Experts Combining RGB and LIDAR data for Pedestrian Detection | Type | Conference Article | ||
| Year |
2015 | Publication | IEEE Intelligent Vehicles Symposium IV2015 | Abbreviated Journal | |
| Volume | Issue | Pages | 356-361 | ||
| Keywords | Pedestrian Detection | ||||
| Abstract | Despite recent significant advances, pedestrian detection continues to be an extremely challenging problem in real scenarios. In order to develop a detector that successfully operates under these conditions, it becomes critical to leverage upon multiple cues, multiple imaging modalities and a strong multi-view classifier that accounts for different pedestrian views and poses. In this paper we provide an extensive evaluation that gives insight into how each of these aspects (multi-cue, multimodality and strong multi-view classifier) affect performance both individually and when integrated together. In the multimodality component we explore the fusion of RGB and depth maps obtained by high-definition LIDAR, a type of modality that is only recently starting to receive attention. As our analysis reveals, although all the aforementioned aspects significantly help in improving the performance, the fusion of visible spectrum and depth information allows to boost the accuracy by a much larger margin. The resulting detector not only ranks among the top best performers in the challenging KITTI benchmark, but it is built upon very simple blocks that are easy to implement and computationally efficient. These simple blocks can be easily replaced with more sophisticated ones recently proposed, such as the use of convolutional neural networks for feature representation, to further improve the accuracy. | ||||
| Address | Seoul; Corea; June 2015 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | ACDC | Expedition | Conference | IV | |
| Notes | ADAS; 600.076; 600.057; 600.054 | Approved | no | ||
| Call Number | ADAS @ adas @ GVX2015 | Serial | 2625 | ||
| Permanent link to this record | |||||
| Author | Lluis Pere de las Heras; Oriol Ramos Terrades; Sergi Robles; Gemma Sanchez | ||||
| Title | CVC-FP and SGT: a new database for structural floor plan analysis and its groundtruthing tool | Type | Journal Article | ||
| Year |
2015 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 18 | Issue | 1 | Pages | 15-30 |
| Keywords | |||||
| Abstract | Recent results on structured learning methods have shown the impact of structural information in a wide range of pattern recognition tasks. In the field of document image analysis, there is a long experience on structural methods for the analysis and information extraction of multiple types of documents. Yet, the lack of conveniently annotated and free access databases has not benefited the progress in some areas such as technical drawing understanding. In this paper, we present a floor plan database, named CVC-FP, that is annotated for the architectural objects and their structural relations. To construct this database, we have implemented a groundtruthing tool, the SGT tool, that allows to make specific this sort of information in a natural manner. This tool has been made for general purpose groundtruthing: It allows to define own object classes and properties, multiple labeling options are possible, grants the cooperative work, and provides user and version control. We finally have collected some of the recent work on floor plan interpretation and present a quantitative benchmark for this database. Both CVC-FP database and the SGT tool are freely released to the research community to ease comparisons between methods and boost reproducible research. | ||||
| 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 | 1433-2833 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; ADAS; 600.061; 600.076; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ HRR2015 | Serial | 2567 | ||
| Permanent link to this record | |||||
| Author | Mikhail Mozerov; Joost Van de Weijer | ||||
| Title | Accurate stereo matching by two step global optimization | Type | Journal Article | ||
| Year |
2015 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 24 | Issue | 3 | Pages | 1153-1163 |
| Keywords | |||||
| Abstract | In stereo matching cost filtering methods and energy minimization algorithms are considered as two different techniques. Due to their global extend energy minimization methods obtain good stereo matching results. However, they tend to fail in occluded regions, in which cost filtering approaches obtain better results. In this paper we intend to combine both approaches with the aim to improve overall stereo matching results. We show that a global optimization with a fully connected model can be solved by cost fil tering methods. Based on this observation we propose to perform stereo matching as a two-step energy minimization algorithm. We consider two MRF models: a fully connected model defined on the complete set of pixels in an image and a conventional locally connected model. We solve the energy minimization problem for the fully connected model, after which the marginal function of the solution is used as the unary potential in the locally connected MRF model. Experiments on the Middlebury stereo datasets show that the proposed method achieves state-of-the-arts results. | ||||
| 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 | 1057-7149 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE; LAMP; 600.079; 600.078 | Approved | no | ||
| Call Number | Admin @ si @ MoW2015a | Serial | 2568 | ||
| Permanent link to this record | |||||