%0 Conference Paper
%B Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on
%D 2004
%T Automatic position calibration of multiple microphones
%A Raykar,V.C.
%A Duraiswami, Ramani
%K approximations;
%K array
%K audio
%K AUTOMATIC
%K calibration;
%K closed
%K covariance;
%K dimensional
%K estimation;
%K form
%K function
%K implicit
%K least
%K likelihood
%K loudspeakers;
%K maximum
%K microphone
%K microphones;
%K minimisation;
%K minimization;
%K multiple
%K nonlinear
%K position
%K positions;
%K problem;
%K processing;
%K signal
%K solution;
%K squares
%K theorem;
%K three
%X We describe a method to determine automatically the relative three dimensional positions of multiple microphones using at least five loudspeakers in unknown positions. The only assumption we make is that there is a microphone which is very close to a loudspeaker. In our experimental setup, we attach one microphone to each loudspeaker. We derive the maximum likelihood estimator and the solution turns out to be a non-linear least squares problem. A closed form solution which can be used as the initial guess for the minimization routine is derived. We also derive an approximate expression for the covariance of the estimator using the implicit function theorem. Using this, we analyze the performance of the estimator with respect to the positions of the loudspeakers. The algorithm is validated using both Monte-Carlo simulations and a real-time experimental setup.
%B Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on
%V 4
%P iv-69 - iv-72 vol.4 - iv-69 - iv-72 vol.4
%8 2004/05//
%G eng
%R 10.1109/ICASSP.2004.1326765
%0 Conference Paper
%B Frontiers in Handwriting Recognition, 2002. Proceedings. Eighth International Workshop on
%D 2002
%T Hidden loop recovery for handwriting recognition
%A David Doermann
%A Intrator,N.
%A Rivin,E.
%A Steinherz,T.
%K analysis;
%K character
%K contour
%K cursive
%K detection;
%K distance
%K edge
%K ellipses;
%K form
%K handwritten
%K hidden
%K loop
%K measurements;
%K mutual
%K partitioning;
%K recognition;
%K recovery;
%K SHAPE
%K shape;
%K sophisticated
%K strokes;
%K symmetric
%K truncated
%K word
%X One significant challenge in the recognition of off-line handwriting is in the interpretation of loop structures. Although this information is readily available in online representation, close proximity of strokes often merges their centers making them difficult to identify. In this paper a novel approach to the recovery of hidden loops in off-line scanned document images is presented. The proposed algorithm seeks blobs that resemble truncated ellipses. We use a sophisticated form analysis method based on mutual distance measurements between the two sides of a symmetric shape. The experimental results are compared with the ground truth of the online representations of each off-line word image. More than 86% percent of the meaningful loops are handled correctly.
%B Frontiers in Handwriting Recognition, 2002. Proceedings. Eighth International Workshop on
%P 375 - 380
%8 2002///
%G eng
%R 10.1109/IWFHR.2002.1030939
%0 Conference Paper
%B Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on
%D 1995
%T Robust table-form structure analysis based on box-driven reasoning
%A Hori,O.
%A David Doermann
%K analysis;table
%K analysis;touching
%K BDR;box
%K characters;character
%K document
%K domain;robust
%K driven
%K form
%K image
%K images;document
%K lines;document
%K mechanisms;
%K PROCESSING
%K processing;inference
%K reasoning;broken
%K recognition;data
%K structure
%K structures;document
%K table
%X Table form document structure analysis is an important problem in the document processing domain. The paper presents a method called Box Driven Reasoning (BDR) to robustly analyze the structure of table form documents which include touching characters and broken lines. Most previous methods employ a line oriented approach. Real documents are copied repeatedly and overlaid with printed data, resulting in characters which touch cells and lines which are broken. BDR deals with regions directly, in contrast with other previous methods. Experimental tests show that BDR reliably recognizes cells and strings in document images with touching characters and broken lines
%B Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on
%V 1
%P 218 -221 vol.1 - 218 -221 vol.1
%8 1995/08//
%G eng
%R 10.1109/ICDAR.1995.598980
%0 Conference Paper
%B Document Analysis and Recognition, 1993., Proceedings of the Second International Conference on
%D 1993
%T The processing of form documents
%A David Doermann
%A Rosenfeld, A.
%K AUTOMATIC
%K business
%K detectors;
%K document
%K documents;
%K extraction;
%K feature
%K form
%K forms;
%K generation;
%K generic
%K handling;
%K known
%K markings;
%K model
%K modeling;
%K non-form
%K optimal
%K properties;
%K reconstruction;
%K set;
%K specialized
%K stroke
%K width
%X An overview of an approach to the generic modeling and processing of known forms is presented. The system provides a methodology by which models are generated from regions in the document based on their usage. Automatic extraction of an optimal set of features to be used for registration is proposed, and it is shown how specialized detectors can be designed for each feature based on their position, orientation and width properties. Registration of the form with the model is accomplished using probing to establish correspondence. Form components which are corrupted by markings are detected and isolated, the intersections are interpreted and the properties of the non-form markings are used to reconstruct the strokes through the intersections. The feasibility of these ideas is demonstrated through an implementation of key components of the system
%B Document Analysis and Recognition, 1993., Proceedings of the Second International Conference on
%P 497 - 501
%8 1993/10//
%G eng
%R 10.1109/ICDAR.1993.395687