Abstract
Algorithms to check whether a bit matrix is unambiguous or a sum set is unique are given. Let an unambiguous bit matrixZ be represented by its row sums and column sums. An efficient algorithm is developed to reconstruct only those rows ofZ satisfying the conditions specified by a given data retrieval descriptor. This algorithm illustrates that using unambiguous bit matrices as data files is desirable not only for the purpose of data compression but also for the purpose of fast data retrieval.
Similar content being viewed by others
References
A. B. J. Novikoff, “Integral geometry as a tool in pattern perception,” inPrinciples of Self-Organization (Pergamon Press, Elmsford, New York, 1962).
C. K. Chow, “An optimum character recognition system using decision functions,”IRE Trans. Elect. Comput. 6(4):247–253 (1957).
T. Pavilidis, “Computer recognition of figures through decomposition,”Information and Control 12 (May-June):526–537 (1968).
G. Nagy, “Classification algorithms in pattern recognition,”IEEE Trans. Audio and Electroacoustics 16(2):203–212 (1968).
A. Rosenfeld,Picture Processing by Computer (Academic Press, New York, 1969).
S. K. Chang and Y. R. Wang, “Three-dimensional object reconstruction from orthogonal projections,” submitted for publication.
R. Gordon and G. T. Herman, “Reconstruction of pictures from their projections,”Commun. ACM 14(12):759–768 (1971).
G. Frieder and G. T. Herman, “Resolution in reconstructing objects from electron micrographs,”J. Theo. Biol. 33:189–211 (1971).
R. A. Crowther, L. A. Amos, J. T. Finch, D. J. DeRosier, and A. Klug, “Three dimensional reconstruction of spherical viruses by Fourier synthesis from electron micrographs,”Nature 226:421–425 (1970).
R. Gordon and G. T. Herman, “Three dimensional reconstruction from projections: a review of algorithms,”International Review of Cytology (1973).
R. Gordon, “A bibliography on reconstruction from projections”; computer printout can be obtained from R. Gordon, National Institute of Health, Building 31, Room 9A17, Bethesda, Maryland.
C. L. Liu,Introduction to Combinatorial Mathematics (McGraw-Hill, New York, 1968).
N. Deo,Graph Theory with Applications to Engineering and Computer Science (PrenticeHall, Englewood Cliffs, New Jersey, 1974).
R. S. Garfinkel and G. L. Nemhauser,Integer Programming (John Wiley, New York, 1972).
C. M. Kortman, “Redundancy reduction—a practical method of data compression,”IEEE Proc. 55(3):253–262 (1967).
L. C. Wilkins, “Bibliography on data compression, picture properties, and picture coding,”IEEE Trans. Information Theory 17 (2):180–197 (1971).
S. S. Ruth and P. J. Kreutzer, “Data compression for large business files,”Datamation 1972 (September):62–66.
A. F. Cardenas, “Evaluation and selection of file organization—a model and system,”Commun. ACM 16 (9):540–548 (1973).
H. J. Ryser,Combinatorial Mathematics (John Wiley, New York, 1963).
S. K. Chang, “The reconstruction of binary patterns from their projections,”Commun. ACM 14(l):21–25 (1971).
Y. R. Wang, “Characterization algorithms of binary patterns,” Unpublished Research Report, Dept. of Computer Science, University of Nebraska at Lincoln, Lincoln, Nebraska (August 1973).
P. L. Ivanescu and S. Rudeanu,Pseudo-Boolean Methods for Bivalent Programming (Springer-Verlag Lecture Notes in Mathematics No. 23, 1966).
Z. Kohavi,Switching and Finite Automata Theory (McGraw-Hill, New York, 1970).
D. E. Knuth,The Art of Computer Programming, Vol. I (Addison-Wesley, Reading, Massachusetts, 1968).
Author information
Authors and Affiliations
Additional information
This is a revised version of a paper presented under the title, “A Data Retrieval Algorithm from Unambiguous Bit Matrices,” at the 1973 Princeton Conference on Systems and Information Sciences.
Rights and permissions
About this article
Cite this article
Wang, Y.R. On data retrieval from unambiguous bit matrices. International Journal of Computer and Information Sciences 4, 171–187 (1975). https://doi.org/10.1007/BF00976242
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00976242