Indexing and integrating multiple features for WWW images

In this paper, we present a novel indexing technique called Multi-scale Similarity Indexing (MSI) to index image's multi-features into a single one-dimensional structure. Both for text and visual feature spaces, the similarity between a point and a local partition's center in individual space is used as the indexing key, where similarity values in different features are distinguished by different scale. Then a single indexing tree can be built on these keys. Based on the property that relevant images have similar similarity values from the center of the same local partition in any feature space, certain number of irrelevant images can be fast pruned based on the triangle inequity on indexing keys. To remove the dimensionality curse existing in high dimensional structure, we propose a new technique called Local Bit Stream (LBS). LBS transforms image's text and visual feature representations into simple, uniform and effective bit stream (BS) representations based on local partition's center. Such BS representations are small in size and fast for comparison since only bit operation are involved. By comparing common bits existing in two BSs, most of irrelevant images can be immediately filtered. To effectively integrate multi-features, we also investigated the following evidence combination techniques-Certainty Factor, Dempster Shafer Theory, Compound Probability, and Linear Combination. Our extensive experiment showed that single one-dimensional index on multi-features improves multi-indices on multi-features greatly. Our LBS method outperforms sequential scan on high dimensional space by an order of magnitude. And Certainty Factor and Dempster Shafer Theory perform best in combining multiple similarities from corresponding multiple features.

Characterisation of the three-dimensional structure of earthworm burrow systems using image analysis and mathematical morphology

The aim of this work was to exemplify the specific contribution of both two- and three-dimensional (31)) X-ray computed tomography to characterise earthworm burrow systems. To achieve this purpose we used 3D mathematical morphology operators to characterise burrow systems resulting from the activity of an anecic (Aporrectodea noctunia), and an endogeic species (Allolobophora chlorotica), when both species were introduced either separately or together into artificial soil cores. Images of these soil cores were obtained using a medical X-ray tomography scanner. Three-dimensional reconstructions of burrow systems were obtained using a specifically developed segmentation algorithm. To study the differences between burrow systems, a set of classical tools of mathematical morphology (granulometries) were used. So-called granulometries based on different structuring elements clearly separated the different burrow systems. They enabled us to show that burrows made by the anecic species were fatter, longer, more vertical, more continuous but less sinuous than burrows of the endogeic species. The granulometry transform of the soil matrix showed that burrows made by A. nocturna were more evenly distributed than those of A. chlorotica. Although a good discrimination was possible when only one species was introduced into the soil cores, it was not possible to separate burrows of the two species from each other in cases where species were introduced into the same soil core. This limitation, partly due to the insufficient spatial resolution of the medical scanner, precluded the use of the morphological operators to study putative interactions between the two species.

Brain activity during the encoding, retention, and retrieval of stimulus representations

Studies of delayed nonmatching-to-sample (DNMS) performance following lesions of the monkey cortex have revealed a critical circuit of brain regions involved in forming memories and retaining and retrieving stimulus representations. Using event-related functional magnetic resonance imaging (fMRI), we measured brain activity in 10 healthy human participants during performance of a trial-unique visual DNMS task using novel barcode stimuli. The event-related design enabled the identification of activity during the different phases of the task (encoding, retention, and retrieval). Several brain regions identified by monkey studies as being important for successful DNMS performance showed selective activity during the different phases, including the mediodorsal thalamic nucleus (encoding), ventrolateral prefrontal cortex (retention), and perirhinal cortex (retrieval). Regions showing sustained activity within trials included the ventromedial and dorsal prefrontal cortices and occipital cortex. The present study shows the utility of investigating performance on tasks derived from animal models to assist in the identification of brain regions involved in human recognition memory.

Destination image, romance and place experience - an application of intimacy theory in tourism

In some forms of tourism, and perhaps particularly in the case of special interest tourism, it can be argued that tourism encounters are service relationships with emotional attachment through the special interest focus and a level of enduring involvement on the part of participants. This involvement is two-fold. First, an interest with the activity; second, a sharing with like-minded people in a social world that extends from home to tourist destination and return. Intimacies in tourism can thus be interpreted through the model of the relationship cycle that comprises the stages A. Aquaintance, B, Buildup, C, Continuation and D, Dissolution. The paper builds upon this concept by utilising ideas of other-centred and self-centredness in personal relationships, and extends the concept of other-centredness to host environments. It also suggests that, in the academic literature about place, location may be secondary in that the quality of experience is primarily determined by the intimacies that exist between people at that place, especially that existing between visitors. © 2004 Published by Elsevier Ltd.

A comparison of body-image dissatisfaction and eating disturbance among Australian and Hong Kong women

The current cross-cultural study was designed to test the validity of a biopsychosocial mediation model which hypothesized that a variety of biological, psychological and social variables would have their mode of action upon eating disturbance through the mediation of body-image dissatisfaction. The biopsychosocial variables examined were body mass, self-esteem, weight-related teasing, previous dieting and sociocultural influences. Forty-eight Hong Kong and 100 Australian females aged 17-28 years were assessed. Results revealed no significant difference between the groups of women in levels of body dissatisfaction and eating disturbance; however, different variables in the biopsychosocial model appeared to have contributed to their predisposition to these conditions. The findings suggest that there appear to exist important cultural differences in various aspects of dieting and body image in young women. Implications for prevention, treatment and future research are discussed. Copyright (c) 2005 John Wiley & Sons, Ltd and Eating Disorders Association.

Image scoring and cooperation in a cleaner fish mutualism

Humans are highly social animals and often help unrelated individuals that may never reciprocate the altruist's favour(1-5). This apparent evolutionary puzzle may be explained by the altruist's gain in social image: image-scoring bystanders, also known as eavesdroppers, notice the altruistic act and therefore are more likely to help the altruist in the future(5-7). Such complex indirect reciprocity based on altruistic acts may evolve only after simple indirect reciprocity has been established, which requires two steps. First, image scoring evolves when bystanders gain personal benefits from information gathered, for example, by finding cooperative partners(8-10). Second, altruistic behaviour in the presence of such bystanders may evolve if altruists benefit from access to the bystanders. Here, we provide experimental evidence for both of the requirements in a cleaning mutualism involving the cleaner fish Labroides dimidiatus. These cleaners may cooperate and remove ectoparasites from clients or they may cheat by feeding on client mucus(11,12). As mucus may be preferred over typical client ectoparasites(13), clients must make cleaners feed against their preference to obtain a cooperative service. We found that eavesdropping clients spent more time next to 'cooperative' than 'unknown cooperative level' cleaners, which shows that clients engage in image-scoring behaviour. Furthermore, trained cleaners learned to feed more cooperatively when in an `image-scoring' than in a 'non-image-scoring' situation.

Dynamic breast MRI: Image registration and its impact on enhancement curve estimation

A novel algorithm for performing registration of dynamic contrast-enhanced (DCE) MRI data of the breast is presented. It is based on an algorithm known as iterated dynamic programming originally devised to solve the stereo matching problem. Using artificially distorted DCE-MRI breast images it is shown that the proposed algorithm is able to correct for movement and distortions over a larger range than is likely to occur during routine clinical examination. In addition, using a clinical DCE-MRI data set with an expertly labeled suspicious region, it is shown that the proposed algorithm significantly reduces the variability of the enhancement curves at the pixel level yielding more pronounced uptake and washout phases.

Efficient update and retrieval of objects in a multiresolution geospatial database

Many emerging applications benefit from the extraction of geospatial data specified at different resolutions for viewing purposes. Data must also be topologically accurate and up-to-date as it often represents real-world changing phenomena. Current multiresolution schemes use complex opaque data types, which limit the capacity for in-database object manipulation. By using z-values and B+trees to support multiresolution retrieval, objects are fragmented in such a way that updates to objects or object parts are executed using standard SQL (Structured Query Language) statements as opposed to procedural functions. Our approach is compared to a current model, using complex data types indexed under a 3D (three-dimensional) R-tree, and shows better performance for retrieval over realistic window sizes and data loads. Updates with the R-tree are slower and preclude the feasibility of its use in time-critical applications whereas, predictably, projecting the issue to a one-dimensional index allows constant updates using z-values to be implemented more efficiently.

Hierarchical indexing structure for efficient similarity search in video retrieval

With the rapid increase in both centralized video archives and distributed WWW video resources, content-based video retrieval is gaining its importance. To support such applications efficiently, content-based video indexing must be addressed. Typically, each video is represented by a sequence of frames. Due to the high dimensionality of frame representation and the large number of frames, video indexing introduces an additional degree of complexity. In this paper, we address the problem of content-based video indexing and propose an efficient solution, called the Ordered VA-File (OVA-File) based on the VA-file. OVA-File is a hierarchical structure and has two novel features: 1) partitioning the whole file into slices such that only a small number of slices are accessed and checked during k Nearest Neighbor (kNN) search and 2) efficient handling of insertions of new vectors into the OVA-File, such that the average distance between the new vectors and those approximations near that position is minimized. To facilitate a search, we present an efficient approximate kNN algorithm named Ordered VA-LOW (OVA-LOW) based on the proposed OVA-File. OVA-LOW first chooses possible OVA-Slices by ranking the distances between their corresponding centers and the query vector, and then visits all approximations in the selected OVA-Slices to work out approximate kNN. The number of possible OVA-Slices is controlled by a user-defined parameter delta. By adjusting delta, OVA-LOW provides a trade-off between the query cost and the result quality. Query by video clip consisting of multiple frames is also discussed. Extensive experimental studies using real video data sets were conducted and the results showed that our methods can yield a significant speed-up over an existing VA-file-based method and iDistance with high query result quality. Furthermore, by incorporating temporal correlation of video content, our methods achieved much more efficient performance.

Dynamic multi-resolution spatial object derivation for mobile and WWW applications

Online geographic information systems provide the means to extract a subset of desired spatial information from a larger remote repository. Data retrieved representing real-world geographic phenomena are then manipulated to suit the specific needs of an end-user. Often this extraction requires the derivation of representations of objects specific to a particular resolution or scale from a single original stored version. Currently standard spatial data handling techniques cannot support the multi-resolution representation of such features in a database. In this paper a methodology to store and retrieve versions of spatial objects at, different resolutions with respect to scale using standard database primitives and SQL is presented. The technique involves heavy fragmentation of spatial features that allows dynamic simplification into scale-specific object representations customised to the display resolution of the end-user's device. Experimental results comparing the new approach to traditional R-Tree indexing and external object simplification reveal the former performs notably better for mobile and WWW applications where client-side resources are limited and retrieved data loads are kept relatively small.