Call for Paper - October 2019 Edition
IJCA solicits original research papers for the October 2019 Edition. Last date of manuscript submission is September 20, 2019. Read More

Knowledge Discovery in Databases (KDD) with Images: A Novel Approach toward Image Mining and Processing

Print
PDF
International Journal of Computer Applications
© 2011 by IJCA Journal
Number 6 - Article 2
Year of Publication: 2011
Authors:
Pardeep Kumar
Vivek Kumar Sehgal
Durg Singh Chauhan
10.5120/3307-4531

Pardeep Kumar, Vivek Kumar Sehgal and Durg Singh Chauhan. Article: Knowledge Discovery in Databases (KDD) with Images: A Novel Approach toward Image Mining and Processing. International Journal of Computer Applications 27(6):10-13, August 2011. Full text available. BibTeX

@article{key:article,
	author = {Pardeep Kumar and Vivek Kumar Sehgal and Durg Singh Chauhan},
	title = {Article: Knowledge Discovery in Databases (KDD) with Images: A Novel Approach toward Image Mining and Processing},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {27},
	number = {6},
	pages = {10-13},
	month = {August},
	note = {Full text available}
}

Abstract

We are in an age often referred to as the information age. In this information age, because we believe that information leads to power and success, from the technologies such as computers, satellites, etc., we have been collecting tremendous amounts of information. Our ability to analyze and understand massive datasets lags far behind our ability to gather and store data. Image and video data contains abundant, rich information for data miners to explore. On one hand, the rich literature on image and video data analysis will naturally provide many advanced methods that may help mining other kinds of data. On the other hand, recent research on data mining will also provide some new, interesting methods that may benefit image and video data retrieval and analysis. Today, a lot of data is available everywhere but the ability to understand and make use of that data is very less. Whether the context is business, medicine, science or government, the datasets themselves are of little value. What is of value is the knowledge that can be inferred from the data and put to use. We need systems which would analyze the data for us. This paper basically aims to find out important pixels of an image using one of the classification technique named as decision tree (ID-3). Our aim is to separate the important and unimportant pixels of an image using simple rules. Further one of the compression techniques named as Huffman algorithm is applied for image compression. Finally, resultant image is stored with lesser space complexity.

Reference

  • Jiawei Han. 2008. Data Mining for Image/Video Processing: A promising research frontier.Department of Computer Science, University of Illinois at Urbana-Champaign.
  • U.M. Fayyad, G. P. Shapiro and P. Smyth. 1996. The KDD process for extracting useful knowledge from volumes from data. Communication of ACM, Vol. 39(11), pp.27 – 34
  • U. Fayyad, D. Haussler, and P. Stolorz.1996. Mining scientific data. Communications of the ACM, Vol. 39 pp. 51-57.
  • C.Ordonez and E. Omiecinski. 1998. Image mining: A new approach for data mining. Technical Report GIT-CC-98-12, College of Computing, Georgia Institute of Technology.
  • Kun-Che Lu and Don-Lin Yang. 2009. Image processing and image mining using decision trees. Journal of Information Science and Engineering, vol 25,pp. 989-1003
  • J.Han and M. Kamber. 2006. Data Mining: Concepts and Techniques (2nd Ed.). Morgan Kaufmann.
  • Jiawei Han. 2009. Research challenges for data mining in science and engineering.Department of Computer Science and Engineering, University of Illinois at Urbana-Champaign.
  • J.Gray and A.Szalay. 2002. The world wide telescope: An archetype for online science. Comm. ACM, pp50-54.
  • Fayyad, U., Piatetsky-Shapiro, G., and Smyth, P. 1996. From data mining to knowledge discovery: An overview. In Advances in Knowledge Discovery and Data Mining, Eds. AAAI/MIT Press, Cambridge, Mass.
  • Huffman, D.A. 1952. A Method for the construction of Minimum Redundancy Codes, Proceedings of the IRE, pp1098-1110.
  • Rcnato M. Capocelli, Alfredo De Santis. 1991. A Note on D-ary Huffman Codes, IEEE Transaction of Information Theory, Vol 17. No I.
  • J.R.Quinlan.2003.Induction in decision trees.Journal of Machine Learning, Vol.1, Issue 1, pp81 –106.
  • M. Ankerst, C. Elsen, M. Ester, and H.-P. Kriegel.1999. Visual classification: An interactive approach to decision tree construction. In Proc. Int. Conf. Knowledge Discovery and Data Mining (KDD'99), pp 392-396, San Diego, CA.
  • Langley, P., and Simon, H.A. 1995. Applications of machine learning and rule induction. Commun. ACM 38, Issue11, pp55-64.
  • M.S.Chen, J. Han, and P. S. Yu. 1996. Data mining: An overview from a database perspective. IEEE Trans. Knowledge and Data Engineering, pp 866-883.