The complexity of multimedia contents is significantly increasing in the current digital world.
This yields an exigent demand for develo** highly effective retrieval systems to satisfy …

This revised and updated second edition–now with two new chapters-is the only book to
give a comprehensive overview of computer algorithms for image reconstruction. It covers …

Dijkstra's algorithm (DA) is one of the most useful and efficient graph-search algorithms,
which can be modified to solve many different problems. It is usually presented as a tool for …

Image processing technology has grown significantly over the past decade. Its application
on low-power mobile devices has been the interest of a wide research group related to …

A deep theoretical analysis of the graph cut image segmentation framework presented in
this paper simultaneously translates into important contributions in several directions. The …

Wearable computing is a form of ubiquitous computing that offers flexible and useful tools for
users. Specifically, glove-based systems have been used in the last 30 years in a variety of …

Fuzzy connectedness (FC) constitutes an important class of image segmentation schemas.
Although affinity functions represent the core aspect (main variability parameter) of FC …

Affinity functions—the measure of how strongly pairs of adjacent spels in the image hang
together—represent the core aspect (main variability parameter) of the fuzzy connectedness …

Fuzzy segmentation is a technique that assigns to each element in an image (which may
have been corrupted by noise and/or shading) a grade of membership in an object (which is …

We present a general graph-cut segmentation framework GGC, in which the delineated
objects returned by the algorithms optimize the energy functions associated with the ℓ p …