Article navigation

Nowadays, applications dealing with information extracted from images are commonplace. The widespread use of multimedia information (images, video, audio etc.) makes necessary applications capable of storing, and therefore retrieving, it. Information extracted from images is usually complex and high dimensional. The extraction of non‐textual low‐level indexing features from images is now a research field, and this process principally suffers because of the computational cost of the high dimensionality of those features. A new way to classify and match low‐level features extracted from images, for retrieval purposes, is presented in this paper. M‐tree and R‐tree structures are used, as well as an incremental version of the k‐means classification alogrithm. This set of alogrithms is used to solve the problem of low performance when retrieving previously catalogued images.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$41.00
Rental

or Create an Account

Close Modal
Close Modal