| |
Records |
Links |
|
Author |
Marçal Rusiñol; Josep Llados; Gemma Sanchez |
|
| |
Title |
Symbol Spotting in Vectorized Technical Drawings Through a Lookup Table of Region Strings |
Type  |
Journal Article |
| |
Year |
2010 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
|
| |
Volume |
13 |
Issue |
3 |
Pages |
321-331 |
|
| |
Keywords |
|
|
| |
Abstract |
In this paper, we address the problem of symbol spotting in technical document images applied to scanned and vectorized line drawings. Like any information spotting architecture, our approach has two components. First, symbols are decomposed in primitives which are compactly represented and second a primitive indexing structure aims to efficiently retrieve similar primitives. Primitives are encoded in terms of attributed strings representing closed regions. Similar strings are clustered in a lookup table so that the set median strings act as indexing keys. A voting scheme formulates hypothesis in certain locations of the line drawing image where there is a high presence of regions similar to the queried ones, and therefore, a high probability to find the queried graphical symbol. The proposed approach is illustrated in a framework consisting in spotting furniture symbols in architectural drawings. It has been proved to work even in the presence of noise and distortion introduced by the scanning and raster-to-vector processes. |
|
| |
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 |
1433-7541 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG |
Approved |
no |
|
| |
Call Number |
DAG @ dag @ RLS2010 |
Serial |
1165 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Eloi Puertas; Sergio Escalera; Oriol Pujol |
|
| |
Title |
Generalized Multi-scale Stacked Sequential Learning for Multi-class Classification |
Type |
Journal Article |
| |
Year |
2015 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
|
| |
Volume |
18 |
Issue |
2 |
Pages |
247-261 |
|
| |
Keywords |
Stacked sequential learning; Multi-scale; Error-correct output codes (ECOC); Contextual classification |
|
| |
Abstract |
In many classification problems, neighbor data labels have inherent sequential relationships. Sequential learning algorithms take benefit of these relationships in order to improve generalization. In this paper, we revise the multi-scale sequential learning approach (MSSL) for applying it in the multi-class case (MMSSL). We introduce the error-correcting output codesframework in the MSSL classifiers and propose a formulation for calculating confidence maps from the margins of the base classifiers. In addition, we propose a MMSSL compression approach which reduces the number of features in the extended data set without a loss in performance. The proposed methods are tested on several databases, showing significant performance improvement compared to classical approaches. |
|
| |
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 |
1433-7541 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
HuPBA;MILAB |
Approved |
no |
|
| |
Call Number |
Admin @ si @ PEP2013 |
Serial |
2251 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera |
|
| |
Title |
Combining Local and Global Learners in the Pairwise Multiclass Classification |
Type |
Journal Article |
| |
Year |
2015 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
|
| |
Volume |
18 |
Issue |
4 |
Pages |
845-860 |
|
| |
Keywords |
Multiclass classification; Pairwise approach; One-versus-one |
|
| |
Abstract |
Pairwise classification is a well-known class binarization technique that converts a multiclass problem into a number of two-class problems, one problem for each pair of classes. However, in the pairwise technique, nuisance votes of many irrelevant classifiers may result in a wrong class prediction. To overcome this problem, a simple, but efficient method is proposed and evaluated in this paper. The proposed method is based on excluding some classes and focusing on the most probable classes in the neighborhood space, named Local Crossing Off (LCO). This procedure is performed by employing a modified version of standard K-nearest neighbor and large margin nearest neighbor algorithms. The LCO method takes advantage of nearest neighbor classification algorithm because of its local learning behavior as well as the global behavior of powerful binary classifiers to discriminate between two classes. Combining these two properties in the proposed LCO technique will avoid the weaknesses of each method and will increase the efficiency of the whole classification system. On several benchmark datasets of varying size and difficulty, we found that the LCO approach leads to significant improvements using different base learners. The experimental results show that the proposed technique not only achieves better classification accuracy in comparison to other standard approaches, but also is computationally more efficient for tackling classification problems which have a relatively large number of target classes. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Springer London |
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
1433-7541 |
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
HuPBA;MILAB |
Approved |
no |
|
| |
Call Number |
Admin @ si @ BGE2014 |
Serial |
2441 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Alejandro Cartas; Juan Marin; Petia Radeva; Mariella Dimiccoli |
|
| |
Title |
Batch-based activity recognition from egocentric photo-streams revisited |
Type |
Journal Article |
| |
Year |
2018 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
|
| |
Volume |
21 |
Issue |
4 |
Pages |
953–965 |
|
| |
Keywords |
Egocentric vision; Lifelogging; Activity recognition; Deep learning; Recurrent neural networks |
|
| |
Abstract |
Wearable cameras can gather large amounts of image data that provide rich visual information about the daily activities of the wearer. Motivated by the large number of health applications that could be enabled by the automatic recognition of daily activities, such as lifestyle characterization for habit improvement, context-aware personal assistance and tele-rehabilitation services, we propose a system to classify 21 daily activities from photo-streams acquired by a wearable photo-camera. Our approach combines the advantages of a late fusion ensemble strategy relying on convolutional neural networks at image level with the ability of recurrent neural networks to account for the temporal evolution of high-level features in photo-streams without relying on event boundaries. The proposed batch-based approach achieved an overall accuracy of 89.85%, outperforming state-of-the-art end-to-end methodologies. These results were achieved on a dataset consists of 44,902 egocentric pictures from three persons captured during 26 days in average. |
|
| |
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 proj |
Approved |
no |
|
| |
Call Number |
Admin @ si @ CMR2018 |
Serial |
3186 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Thanh Ha Do; Oriol Ramos Terrades; Salvatore Tabbone |
|
| |
Title |
DSD: document sparse-based denoising algorithm |
Type |
Journal Article |
| |
Year |
2019 |
Publication |
Pattern Analysis and Applications |
Abbreviated Journal |
PAA |
|
| |
Volume |
22 |
Issue |
1 |
Pages |
177–186 |
|
| |
Keywords |
Document denoising; Sparse representations; Sparse dictionary learning; Document degradation models |
|
| |
Abstract |
In this paper, we present a sparse-based denoising algorithm for scanned documents. This method can be applied to any kind of scanned documents with satisfactory results. Unlike other approaches, the proposed approach encodes noise documents through sparse representation and visual dictionary learning techniques without any prior noise model. Moreover, we propose a precision parameter estimator. Experiments on several datasets demonstrate the robustness of the proposed approach compared to the state-of-the-art methods on document denoising. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
DAG; 600.097; 600.140; 600.121 |
Approved |
no |
|
| |
Call Number |
Admin @ si @ DRT2019 |
Serial |
3254 |
|
| Permanent link to this record |
