@conference {13188,
	title = {Detecting rotational symmetries},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/10//},
	pages = {954 - 961 Vol. 2 - 954 - 961 Vol. 2},
	abstract = {We present an algorithm for detecting multiple rotational symmetries in natural images. Given an image, its gradient magnitude field is computed, and information from the gradients is spread using a diffusion process in the form of a gradient vector flow (GVF) field. We construct a graph whose nodes correspond to pixels in tire image, connecting points that are likely to be rotated versions of one another The n-cycles present in tire graph are made to vote for C<sub>n</sub> symmetries, their votes being weighted by the errors in transformation between GVF in the neighborhood of the voting points, and the irregularity of the n-sided polygons formed by the voters. The votes are accumulated at tire centroids of possible rotational symmetries, generating a confidence map for each order of symmetry. We tested the method with several natural images.},
	keywords = {axial, computational, detection;, field;, flow;, geometry;, gradient, graph, graph;, image, image;, magnitude, methods;, multiple, n-sided, object, polygons;, recognition;, rotational, symmetries;, symmetry;, theory;, tire, tyres;, vector},
	doi = {10.1109/ICCV.2005.71},
	author = {Shiv Naga Prasad,V. and Davis, Larry S.}
}
@conference {13618,
	title = {Page classification through logical labelling},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {477 - 480 vol.3 - 477 - 480 vol.3},
	abstract = {We propose an integrated approach to page classification and logical labelling. Layout is represented by a fully connected attributed relational graph that is matched to the graph of an unknown document, achieving classification and labelling simultaneously. By incorporating global constraints in an integrated fashion, ambiguity at the zone level can be reduced, providing robustness to noise and variation. Models are automatically trained from sample documents. Experimental results show promise for the classification and labelling of technical article title pages, and supports the idea of a hierarchical model base.},
	keywords = {article, attributed, base;, character, classification;, constraints;, document, document;, experimental, global, graph, graph;, hierarchical, image, images;, labelling;, logical, model, noise;, OCR;, optical, page, pages;, processing;, recognition;, relational, results;, technical, theory;, title, unknown},
	doi = {10.1109/ICPR.2002.1047980},
	author = {Liang,Jian and David Doermann and Ma,M. and Guo,J. K}
}
@conference {15577,
	title = {Algorithms for fast vector quantization},
	booktitle = {Data Compression Conference, 1993. DCC {\textquoteright}93.},
	year = {1993},
	month = {1993///},
	pages = {381 - 390},
	abstract = {This paper shows that if one is willing to relax the requirement of finding the true nearest neighbor, it is possible to achieve significant improvements in running time and at only a very small loss in the performance of the vector quantizer. The authors present three algorithms for nearest neighbor searching: standard and priority <e1>k </e1>-<e1>d</e1> tree search algorithms and a neighborhood graph search algorithm in which a directed graph is constructed for the point set and edges join neighboring points},
	keywords = {algorithm;, algorithms;, directed, fast, graph, graph;, graphs;, Neighborhood, performance;, problems;, quantisation;, quantization;, running, search, time;, tree, vector},
	doi = {10.1109/DCC.1993.253111},
	author = {Arya,S. and Mount, Dave}
}
