| Records |
| Author |
Miquel Ferrer; Ernest Valveny; F. Serratosa |
| Title |
Median graph: A new exact algorithm using a distance based on the maximum common subgraph |
Type |
Journal Article |
| Year |
2009 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
30 |
Issue |
5 |
Pages |
579–588 |
| Keywords |
|
| Abstract |
Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Elsevier Science Inc. |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0167-8655 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
Call Number  |
DAG @ dag @ FVS2009a |
Serial |
1114 |
| Permanent link to this record |
| |
|
| |
| Author |
Oriol Ramos Terrades; Ernest Valveny |
| Title |
A new use of the ridgelets transform for describing linear singularities in images |
Type |
Journal Article |
| Year |
2006 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
27 |
Issue |
6 |
Pages |
587–596 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ RaV2006a |
Serial |
635 |
| 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 |
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 |
Gemma Sanchez; Josep Llados; K. Tombre |
| Title |
A mean string algorithm to compute the average among a set of 2D shapes |
Type |
Journal Article |
| Year |
2002 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
23 |
Issue |
1-3 |
Pages |
203–214 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG; IF: 0.409 |
Approved |
no |
| Call Number |
DAG @ dag @ SLT2002 |
Serial |
275 |
| Permanent link to this record |
| |
|
| |
| Author |
Debora Gil; Petia Radeva |
| Title |
Inhibition of false landmarks |
Type |
Journal Article |
| Year |
2006 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
27 |
Issue |
9 |
Pages |
1022-1030 |
| Keywords |
|
| Abstract |
Corners and junctions are landmarks characterized by the lack of differentiability in the unit tangent to the image level curve. Detectors based on differential operators are not, by their own definition, the best posed as they require a higher degree of differentiability to yield a reliable response. We argue that a corner detector should be based on the degree of continuity of the tangent vector to the image level sets, work on the image domain and need no assumptions on neither the image local structure nor the particular geometry of the corner/junction. An operator measuring the degree of differentiability of the projection matrix on the image gradient fulfills the above requirements. Because using smoothing kernels leads to corner misplacement, we suggest an alternative fake response remover based on the receptive field inhibition of spurious details. The combination of both orientation discontinuity detection and noise inhibition produce our inhibition orientation energy (IOE) landmark locator. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Elsevier Science Inc. |
Place of Publication |
New York, NY, USA |
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0167-8655 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
IAM;MILAB |
Approved |
no |
| Call Number |
IAM @ iam @ GiR2006 |
Serial |
1529 |
| Permanent link to this record |
| |
|
| |
| Author |
Josep Llados; Horst Bunke; Enric Marti |
| Title |
Finding rotational symmetries by cyclic string matching |
Type |
Journal Article |
| Year |
1997 |
Publication |
Pattern recognition letters |
Abbreviated Journal |
PRL |
| Volume |
18 |
Issue |
14 |
Pages |
1435-1442 |
| Keywords |
Rotational symmetry; Reflectional symmetry; String matching |
| Abstract |
Symmetry is an important shape feature. In this paper, a simple and fast method to detect perfect and distorted rotational symmetries of 2D objects is described. The boundary of a shape is polygonally approximated and represented as a string. Rotational symmetries are found by cyclic string matching between two identical copies of the shape string. The set of minimum cost edit sequences that transform the shape string to a cyclically shifted version of itself define the rotational symmetry and its order. Finally, a modification of the algorithm is proposed to detect reflectional symmetries. Some experimental results are presented to show the reliability of the proposed algorithm |
| 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;IAM; |
Approved |
no |
| Call Number |
IAM @ iam @ LBM1997a |
Serial |
1562 |
| Permanent link to this record |
| |
|
| |
| Author |
Ernest Valveny; Enric Marti |
| Title |
A model for image generation and symbol recognition through the deformation of lineal shapes |
Type |
Journal Article |
| Year |
2003 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
24 |
Issue |
15 |
Pages |
2857-2867 |
| Keywords |
|
| Abstract |
We describe a general framework for the recognition of distorted images of lineal shapes, which relies on three items: a model to represent lineal shapes and their deformations, a model for the generation of distorted binary images and the combination of both models in a common probabilistic framework, where the generation of deformations is related to an internal energy, and the generation of binary images to an external energy. Then, recognition consists in the minimization of a global energy function, performed by using the EM algorithm. This general framework has been applied to the recognition of hand-drawn lineal symbols in graphic documents. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Elsevier Science Inc. |
Place of Publication |
New York, NY, USA |
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0167-8655 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG; IAM |
Approved |
no |
| Call Number |
IAM @ iam @ VAM2003 |
Serial |
1653 |
| Permanent link to this record |
| |
|
| |
| Author |
A. Sanfeliu; Juan J. Villanueva |
| Title |
An approach of visual motion analysis |
Type |
Journal Article |
| Year |
2005 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
26 |
Issue |
3 |
Pages |
355–368 |
| Keywords |
|
| Abstract |
IF: 1.138 |
| 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 |
|
Approved |
no |
| Call Number |
ISE @ ise @ SaV2005 |
Serial |
561 |
| Permanent link to this record |
| |
|
| |
| Author |
Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta |
| Title |
Large-scale graph indexing using binary embeddings of node contexts for information spotting in document image databases |
Type |
Journal Article |
| Year |
2017 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
87 |
Issue |
|
Pages |
203-211 |
| Keywords |
|
| Abstract |
Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations. However, retrieving a query graph from a large dataset of graphs implies a high computational complexity. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. With this aim, in this paper we propose a graph indexation formalism applied to visual retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Then, each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in different real scenarios such as handwritten word spotting in images of historical documents or symbol spotting in architectural floor plans. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG; 600.097; 602.006; 603.053; 600.121 |
Approved |
no |
| Call Number |
RLF2017b |
Serial |
2873 |
| Permanent link to this record |
