Close category search window
 

Image Mining by Data Compactness and Manifold Learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yuqing Song ; Sch. of Automotive & Transp., Tianjin Univ. of Technol. & Educ., Tianjin, China ; Yaohui Li

One important issue in image mining is how to analyze the compactness of image data and apply it to image mining. In this paper we study the class compactness and boundary compactness of image data, which are used in image classification and data confining. The data confining results in relevance graph, which is used in calculating the distances between images. Manifold learning techniques are applied in the computation of distances between images and manifolds of images. Image retrieval is based on these distances. Experiments are reported to show the effectiveness of our approach.

Published in:
Intelligent Networks and Intelligent Systems (ICINIS), 2012 Fifth International Conference on

Date of Conference: 1-3 Nov. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.