toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
  Records Links
Author Josep Llados; Enric Marti edit  openurl
  Title A graph-edit algorithm for hand-drawn graphical document recognition and their automatic introduction into CAD systems Type Journal Article
  Year 1999 Publication Machine Graphics & Vision Abbreviated Journal  
  Volume 8 Issue Pages 195-211  
  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 (up) ISBN Medium  
  Area Expedition Conference  
  Notes DAG;IAM; Approved no  
  Call Number IAM @ iam @ LIM1999 Serial 1568  
Permanent link to this record
 

 
Author Josep Llados; Enric Marti edit  openurl
  Title Graph-edit algorithms for hand-drawn graphical document recognition and their automatic introduction Type Journal Article
  Year 1999 Publication Machine Graphics & Vision journal, special issue on Graph transformation Abbreviated Journal  
  Volume Issue Pages  
  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 (up) ISBN Medium  
  Area Expedition Conference  
  Notes DAG;IAM Approved no  
  Call Number IAM @ iam @ LIM1999c Serial 1569  
Permanent link to this record
 

 
Author Josep Llados; Enric Marti; Juan J.Villanueva edit  doi
openurl 
  Title Symbol recognition by error-tolerant subgraph matching between region adjacency graphs Type Journal Article
  Year 2001 Publication IEEE Transactions on Pattern Analysis and Machine Intelligence Abbreviated Journal  
  Volume 23 Issue 10 Pages 1137-1143  
  Keywords  
  Abstract The recognition of symbols in graphic documents is an intensive research activity in the community of pattern recognition and document analysis. A key issue in the interpretation of maps, engineering drawings, diagrams, etc. is the recognition of domain dependent symbols according to a symbol database. In this work we first review the most outstanding symbol recognition methods from two different points of view: application domains and pattern recognition methods. In the second part of the paper, open and unaddressed problems involved in symbol recognition are described, analyzing their current state of art and discussing future research challenges. Thus, issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work. Finally, we discuss the perspectives of symbol recognition concerning to new paradigms such as user interfaces in handheld computers or document database and WWW indexing by graphical content.  
  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 (up) ISBN Medium  
  Area Expedition Conference  
  Notes DAG;IAM;ISE; Approved no  
  Call Number IAM @ iam @ LMV2001 Serial 1581  
Permanent link to this record
 

 
Author Ernest Valveny; Enric Marti edit   pdf
doi  openurl
  Title Deformable Template Matching within a Bayesian Framework for Hand-Written Graphic Symbol Recognition Type Journal Article
  Year 2000 Publication Graphics Recognition Recent Advances Abbreviated Journal  
  Volume 1941 Issue Pages 193-208  
  Keywords  
  Abstract We describe a method for hand-drawn symbol recognition based on deformable template matching able to handle uncertainty and imprecision inherent to hand-drawing. Symbols are represented as a set of straight lines and their deformations as geometric transformations of these lines. Matching, however, is done over the original binary image to avoid loss of information during line detection. It is defined as an energy minimization problem, using a Bayesian framework which allows to combine fidelity to ideal shape of the symbol and flexibility to modify the symbol in order to get the best fit to the binary input image. Prior to matching, we find the best global transformation of the symbol to start the recognition process, based on the distance between symbol lines and image lines. We have applied this method to the recognition of dimensions and symbols in architectural floor plans and we show its flexibility to recognize distorted symbols.  
  Address  
  Corporate Author Springer Verlag 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 (up) ISBN Medium  
  Area Expedition Conference  
  Notes DAG;IAM; Approved no  
  Call Number IAM @ iam @ MVA2000 Serial 1655  
Permanent link to this record
 

 
Author Palaiahnakote Shivakumara; Anjan Dutta; Trung Quy Phan; Chew Lim Tan; Umapada Pal edit  doi
openurl 
  Title A Novel Mutual Nearest Neighbor based Symmetry for Text Frame Classification in Video Type Journal Article
  Year 2011 Publication Pattern Recognition Abbreviated Journal PR  
  Volume 44 Issue 8 Pages 1671-1683  
  Keywords  
  Abstract In the field of multimedia retrieval in video, text frame classification is essential for text detection, event detection, event boundary detection, etc. We propose a new text frame classification method that introduces a combination of wavelet and median moment with k-means clustering to select probable text blocks among 16 equally sized blocks of a video frame. The same feature combination is used with a new Max–Min clustering at the pixel level to choose probable dominant text pixels in the selected probable text blocks. For the probable text pixels, a so-called mutual nearest neighbor based symmetry is explored with a four-quadrant formation centered at the centroid of the probable dominant text pixels to know whether a block is a true text block or not. If a frame produces at least one true text block then it is considered as a text frame otherwise it is a non-text frame. Experimental results on different text and non-text datasets including two public datasets and our own created data show that the proposed method gives promising results in terms of recall and precision at the block and frame levels. Further, we also show how existing text detection methods tend to misclassify non-text frames as text frames in term of recall and precision at both the block and frame levels.  
  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 (up) ISBN Medium  
  Area Expedition Conference  
  Notes DAG Approved no  
  Call Number Admin @ si @ SDP2011 Serial 1727  
Permanent link to this record
Select All    Deselect All
 |   | 
Details

Save Citations:
Export Records: