@article {18234,
	title = {Joint security and robustness enhancement for quantization based data embedding},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {13},
	year = {2003},
	month = {2003/08//},
	pages = {831 - 841},
	abstract = {The paper studies joint security and robustness enhancement of quantization-based data embedding for multimedia authentication applications. We present an analysis showing that through a nontrivial run lookup table (LUT) that maps quantized multimedia features randomly to binary data, the probability of detection error can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion-compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {(signal);, authentication;, binary, compensation;, data, data;, DETECTION, digital, distortion, distortion;, embedding;, encapsulation;, enhancement;, error, features;, hiding;, lookup, lookup;, LUT;, message, multimedia, nontrivial, probability;, quantisation, quantization, quantized, Robustness, run, Security, statistics;, systems;, table, table;, watermarking;},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2003.815951},
	author = {Wu,M.}
}
@conference {18235,
	title = {Joint security robustness enhancement for quantization embedding},
	booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {II - 483-6 vol.3 - II - 483-6 vol.3},
	abstract = {This paper studies joint security and robustness enhancement of quantization based data embedding for multimedia authentication applications. We present analysis showing that through a lookup table (LUT) of nontrivial run that maps quantized multimedia features randomly to binary data, the detection error probability can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {applications;, Authentication, authentication;, binary, communication;, data, data;, embedding;, error, joint, lookup, lookup;, message, multimedia, probability;, security;, statistics;, table, table;, watermarking;},
	doi = {10.1109/ICIP.2003.1246722},
	author = {Wu,M.}
}
@conference {13638,
	title = {Robust table-form structure analysis based on box-driven reasoning},
	booktitle = {Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on},
	volume = {1},
	year = {1995},
	month = {1995/08//},
	pages = {218 -221 vol.1 - 218 -221 vol.1},
	abstract = {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},
	keywords = {analysis;table, analysis;touching, BDR;box, characters;character, document, domain;robust, driven, form, image, images;document, lines;document, mechanisms;, PROCESSING, processing;inference, reasoning;broken, recognition;data, structure, structures;document, table},
	doi = {10.1109/ICDAR.1995.598980},
	author = {Hori,O. and David Doermann}
}
