search

meitarc / FinalProject

1 stars 3 forks source link

Need to go over the attached papers #11

Open GuyOhayon opened 5 years ago

GuyOhayon commented 5 years ago
GuyOhayon commented 5 years ago

mm2004-pcasift-rahuls.pdf

This is the most important paper to read, need to send an email to the writers of the paper and ask for the algorithms. need to go over it to know what to ask specifically. 10.1.1.397.3921.pdf

Image hashing with OpenCV and Python Image hashing with OpenCV and Python.pdf

GuyOhayon commented 5 years ago

[10.1.1.397.3921.pdf]

To study from the paper:

GuyOhayon commented 5 years ago

REFERENCES to go over

[10.1.1.397.3921.pdf]

[1] J. Saghri, A. Tescher, and J. Reagan, “Practical transform coding of multispectral imagery,” 2005, pp. 32–43. [2] J. Lee, “Optimized quadtree for karhunen-loeve transform in multispectral image coding,” Image Processing, IEEE Transactions on, vol. 8, pp. 453–461, 1999. [3] Q. Du and C.-I. Chang, “Linear mixture analysis-based compression for hyperspectral image analysis,” Geoscience and Remote Sensing, IEEE Transactions on, vol. 42, pp. 875–891, 2004. [4] L. Torres and E. Delp, “New trends in image and video compression,” Proceedings of the European Signal Processing Conference (EUSIPCO), pp. 5–8. [5] M. Kramm, “Compression of image clusters using Karhunen Loeve transformations,” in Electronic Imaging, Human Vision, vol. XII, no. 6492, 2007, pp. 101–106. [6] M. Barnsley and A. Sloan, “A better way to compress images.” Byte, vol. 13, no. 1, pp. 215–223, 1988. [7] M. Lazar and L. Bruton, “Fractal block coding of digital video,” Circuits and Systems for Video Technology, IEEE Transactions on, vol. 4, no. 3, pp. 297–308, 1994. [8] K. Barthel and T. Voye, “Three-dimensional fractal video coding,” Image Processing, 1995. Proceedings., International Conference on, vol. 3, 1995. [9] C. Tong and M. Wong, “Adaptive approximate nearest neighbor search for fractal image compression,” Image Processing, IEEE Transactions on, vol. 11, no. 6, pp. 605–615, 2002. [10] S. Furao and O. Hasegawa, “A fast and less loss fractal image coding method using simulated annealing,” Proceedings of Seventh Joint Conference on Information Sciences, 2003. [11] M. Nelson, The data compression book. M&T Books. [12] S. Furao and O. Hasegawa, “A fast no search fractal image coding method,” Signal Processing: Image Communication, vol. 19, no. 5, pp. 393–404, 2004. [13] H. Hartenstein and D. Saupe, “Lossless acceleration of fractal image encoding via the fast Fourier transform,” Signal Processing: Image Communication, vol. 16, no. 4, pp. 383–394, 2000. [14] R. Cilibrasi and P. Vitani, “Clustering by Compression,” Information Theory, IEEE Transactions on, vol. 51, no. 4, pp. 1523–1545, 2005. [15] D. Squire, W. M¨uller, H. M¨uller, and T. Pun, “Content-based query of image databases: inspirations from text retrieval,” Pattern Recognition Letters, vol. 21, no. 13-14, pp. 1193–1198, 2000. [16] “GiFT - Gnu Image Finding Tool,” http://www.gnu.org/software/gift/. [17] Y. Xu, V. Olman, and D. Xu, “Minimum Spanning Trees for Gene Expression Data Clustering,” Genome Informatics, vol. 12, pp. 24–33, 2001. [18] A. Jain, M. Murty, and P. Flynn, “Data clustering: A review,” ACM Computing Surveys, vol. 31, 1999. [19] J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000. [20] W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” Journal of Classification, vol. 1, no. 1, pp. 7–24, 1984. [21] D. Keim and A. Hinneburg, “Clustering techniques for large data sets — from the past to the future,” Conference on Knowledge Discovery in Data, pp. 141–181, 1999. [22] A. Hlaoui and S. Wang, “Median graph computation for graph clustering,” Soft Computing-A Fusion of Foundations, Methodologies and Applications, vol. 10, no. 1, pp. 47–53, 2006. [23] M. Rummukainen, J. Laaksonen, and M. Koskela, “An efficiency comparison of two content-based image retrieval systems, GiFT and PicSOM,” Proceedings of international conference on image and video retrieval (CIVR 2003), Urbana, IL, USA, pp. 500–509, 2003. [24] M. Ruhl, H. Hartenstein, and D. Saupe, “Adaptive partitionings for fractal image compression,” Proc. IEEE Int. Conf. Image Processing, vol. 3, pp. 310–313, 1997. [25] N. Tran, “The normalized compression distance and image distinguishability,” Proceedings of SPIE, vol. 6492, p. 64921D, 2007.