Excellence in Research and Innovation for Humanity

International Science Index


Select areas to restrict search in scientific publication database:
10009008
Quick Similarity Measurement of Binary Images via Probabilistic Pixel Mapping
Abstract:
In this paper we present a quick technique to measure the similarity between binary images. The technique is based on a probabilistic mapping approach and is fast because only a minute percentage of the image pixels need to be compared to measure the similarity, and not the whole image. We exploit the power of the Probabilistic Matching Model for Binary Images (PMMBI) to arrive at an estimate of the similarity. We show that the estimate is a good approximation of the actual value, and the quality of the estimate can be improved further with increased image mappings. Furthermore, the technique is image size invariant; the similarity between big images can be measured as fast as that for small images. Examples of trials conducted on real images are presented.
Digital Article Identifier (DAI):

References:

[1] A. A. Mustafa, “Probabilistic Model for Quick Detection of Dissimilar Binary Images”. Journal of Electronic Imaging, 24, 5, 2015, pp. 24-53.
[2] A. A. Mustafa, “A Probabilistic Model for Random Binary Image Mapping”. WSEAS Transactions on Systems and Control, Volume 12, 2017, Art. #34, pp. 317-331.
[3] P. Jaccard, “Distribution de la flore alpine dans le bassin des Dranses et dans quelques régions voisines”. Bulletin de la Société Vaudoise des Sciences Naturelles, 1901, 37, pp. 241-272.
[4] R. Sokal and C. Michener, “A statistical method for evaluating systematic relationships”, Bulletin of the Society of University of Kansas, 1958, 38, pp. 1409-1438.
[5] R. Hamming, “Error detecting and error correcting codes”. Bell System Technical Journal, 1950, 29, (2), pp. 147–160.
[6] G. Sidorov et al., “Soft similarity and soft cosine measure: Similarity of features in vector space model”. Computación y Sistemas, 2014, 18, (3), pp. 491-504.
[7] P. Anuta, “Spatial Registration of Multispectral and Multitemporal Digital Imagery Using Fast Fourier Transform Techniques”. IEEE Transactions on Geoscience Electronics, GE-8, N 4, 1970, pp. 353-368.
[8] D. Barnea and H. Silverman, “A Class of Algorithms for Fast Digital Image Registration”. IEEE Trans. on Computers, Vol. c-21, N 2, 1972, pp.179-186.
[9] J. Pluim, A. Maintz and M. Viergever, “Mutual-Information-Based Registration of Medical Images: A Survey”. IEEE Transactions on Medical Imaging, 22, 8, 2003.
[10] A. A. Mustafa, “A Modified Hamming Distance Measure for Quick Rejection of Dissimilar Binary Images”. International Conference on Computer Vision and Image Analysis, 2015.
[11] S. Choi, S. Cha, and C. Tappert, ‘A Survey of Binary Similarity and Distance Measures’. Journal of Systems, Cybernetics and Informatics, 2010, 8, (1), pp. 43-48.
[12] A. A. Mustafa, “Quick Probabilistic Binary Image Matching: Changing the Rules of the Game”. Proc. SPIE 9971, Applications of Digital Image Processing XXXIX, 997112 (September 27, 2016); doi:10.1117/12.2237552.
[13] A. A. Mustafa, “A Probabilistic Binary Similarity Distance for Quick Image Matching”. IET Journal on Image Processing, submitted for review.
Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007