We developed a content based retrieval scheme for texture by using text based description. The texture technique is based on our previous work which uses very simple texture primitives such as edges and plain regions ...
详细信息
We developed a content based retrieval scheme for texture by using text based description. The texture technique is based on our previous work which uses very simple texture primitives such as edges and plain regions to generate features. Other methods that apply complicated statistics can be difficult to transcribe into understandable forms for normal users. Unlike these other methods, with the simplicity of our features, we can express them in terms of simple language. Hence we can bridge the gap between semantics and computed features. A number of benefits can be achieved which opens a new horizon for content based retrieval with texture. For example, the user can request a texture image without necessarily knowing what types of textures are stored. In this paper we describe the method of translating such features and the partial weighted Euclidean distance matching which allows users to describe only the parts that they are interested in. This allows them to gradually refine their texture descriptions.
The Fractal Transform (FT) was originally introduced as a methodology for compressing digital images and representing them at different scales. The process of calculating an FT generates a great deal of information ab...
详细信息
The Fractal Transform (FT) was originally introduced as a methodology for compressing digital images and representing them at different scales. The process of calculating an FT generates a great deal of information about the affine similarities and dissimilarities of an image, most of which is discarded in compression applications. In this paper we introduce the concept of Fractal Transform Analysis and use it to derive new image descriptors. We present results of experiments in which description schemes comprised of some of these FT-based descriptors are applied to the problems of finding objects in an image similar to a given object, of indexing images, and of querying an image database consisting of about 17,000 images. Complexity and timing data are also presented.
Content Based imageretrieval has recently become one of the most active research areas, due to the massive increase in the amount and complexity of digitized data being stored, transmitted and accessed. We present he...
详细信息
ISBN:
(纸本)0819431273
Content Based imageretrieval has recently become one of the most active research areas, due to the massive increase in the amount and complexity of digitized data being stored, transmitted and accessed. We present here a prototype implementation of DRAWSEARCH, an imageretrieval by content system that uses color and shape (and texture in the near future) features to index and retrieve images. The system, currently being tested and improved, is designed to increase interactivity with users posing queries over the Internet and avails of a Java client for query by sketch. It also implements relevance feedback to allow users dynamically refine queries. Experiments show that the proposed approach can greatly reduce the user's effort to compose a query while capturing his/her information need with greater precision.
image search has been actively studied in recent years. On the other hands, image browsing has received little attention. image browsing refers to the process of presenting some forms of overview or summary of the ima...
详细信息
image search has been actively studied in recent years. On the other hands, image browsing has received little attention. image browsing refers to the process of presenting some forms of overview or summary of the image relationships, thus facilitating a user to navigate across the data set and find images of interests. In this paper, we present a new data structure built on the multi-linearization of image attributes for efficient organization of the data set and fast visual browsing of the images. We describe new techniques for multi-linearization based on multiple space-filling curves and hierarchical clustering techniques. In addition to providing fast navigation, our proposed data structure allows computationally efficient insertion and deletion of images from the data set. We then present a novel image navigator and browser built on dual-linearization data structure and intuitive presentation of image relevance and relationships, demonstrate the image navigation process, and report results on 1000 and 22,000 imagedatabases. We also discuss how our data structure can be extended to support fast image search.
Recent advances in visual data storage and retrieval technologies have made the creation of very large databases feasible. Color indexing is one of the crucial issues in the management of color image and video databas...
Recent advances in visual data storage and retrieval technologies have made the creation of very large databases feasible. Color indexing is one of the crucial issues in the management of color image and videodatabases. In this dissertation we investigate an approach based on the color feature extraction and indexing of images for the purpose of content-based color image and video database retrieval. Since the high computational complexity has been one of the main barriers towards the use of similarity measures, such as histogram intersection distance, in very large database, we present a hierarchical automatic color indexing scheme and used to subset images before more sophisticated techniques are applied for precise retrieval. The use of automatically indexed color contents of images as filtering and matching features in a hierarchical scheme is studied with full algorithm implementation procedure described in detail. In the meantime, we developed a set of programs to extract the color features from which the color vector complex of images is derived for accomplishing both color image database indexing and video sequence parsing. The discrimination between different image scenes based on color vector difference measurement is also studied. The experimental results demonstrate that our approach is the state-of-art of work with high efficiency and low computation complexity. Through applying it to visual data we can expect getting not only a way of color image discrimination but also a way of color video sequence segmentation or shot boundary detection based on color features.
This research explores the interaction of linguistic and photographic information in an integrated text/image database. By utilizing linguistic descriptions of a picture (speech and text input) coordinated with pointi...
详细信息
ISBN:
(纸本)081941767X
This research explores the interaction of linguistic and photographic information in an integrated text/image database. By utilizing linguistic descriptions of a picture (speech and text input) coordinated with pointing references to the picture, we extract information useful in two aspects: image interpretation and imageretrieval. In the image interpretation phase, objects and regions mentioned in the text are identified;the annotated image is stored in a database for future use. We incorporate techniques from our previous research on photo understanding using accompanying text: a system, PICTION, which identifies human faces in a newspaper photograph based on the caption. In the imageretrieval phase, images matching natural language queries are presented to a user in a ranked order. This phase combines the output of (1) the image interpretation/annotation phase, (2) statistical text retrieval methods, and (3) imageretrieval methods (e.g., color indexing). The system allows both point and click querying on a given image as well as intelligent querying across the entire text/image database.
The purpose of the work is to discuss the fundamental issues and solutions in managing compressed and uncompressed multimedia data, especially voluminous continuous mediatypes (video, audio) and text in a memory hiera...
详细信息
ISBN:
(纸本)0819429880
The purpose of the work is to discuss the fundamental issues and solutions in managing compressed and uncompressed multimedia data, especially voluminous continuous mediatypes (video, audio) and text in a memory hierarchy with four levels (main memory, magnetic disk, (optical or magnetic) on-line/near-line low-speed memory, and slow off-line memory, i.e. archive). We view the multimedia data in such a database to be generated, (compressed), and stored into the memory hierarchy (at the lowest non-archiving level), and subsequently retrieved, (decompressed), and presented. If unused, the data either travels down in the memory hierarchy or it is compressed and stored at the same level. We first discuss the general prerequisites of the memory hierarchy, like program locality and decreasing storage costs and performance of each deeper level. To discuss the issues in a greater depth a schematic four level memory hierarchy model is presented. Multimedia data poses, as compared to conventional data, three new requirements for a memory hierarchy. First, continuous multimedia data (e.g. audio and especially video) have real-time requirements for the retrieval time, not present in a conventional memory hierarchy supporting e.g. a virtual memory. Second, single multimedia objects are often very large, requiring hundreds of megabytes, even gigabytes of memory. From the memory hierarchy point of view the latter fact necessitates partial storage strategies at different levels. Third, the data is so voluminous that compression becomes an interesting alternative, because of considerable savings in storage capacity and I/O and network bandwith. Based on the real time requirements of continuous multimedia data one can set boundaries for the maximum retrieval time Tr-max Further, knowing the average retrieval speed S-i of the particular memory level i for an arbitrary object X one can determine the deepest possible (i.e. slowest) level the data can be placed on. The inequality Tr(O-j)
A key aspect of imageretrieval using color, is the creation of robust and efficient indices. In particular, the color histogram remains the most popular index, due primarily to its simplicity. However, the color hist...
详细信息
A key aspect of imageretrieval using color, is the creation of robust and efficient indices. In particular, the color histogram remains the most popular index, due primarily to its simplicity. However, the color histogram has a number of drawbacks. Specifically, histograms capture only global activity, they require quantization to reduce dimensionality, are highly dependent on the chosen color space, have no means to exclude a certain color from a query and can provide erroneous results due to gamma nonlinearity. In this paper we present a vector angular distance measure which is implemented as part of our database system. Our system does away with histogram techniques for color indexing and retrieval and instead implements color vector techniques. We use color segmentation to extract regions of prominent color and use representative vectors from these extracted regions in the image indices. This way we end up with a much smaller index which does not have the granularity of a histogram. Instead similarity is based on our vector angular distance measure between a query color vector and the indexed representative vectors.
We test the performance of a texture feature constructed from the variance of the first eight AC Discrete Cosine Transform (DCT) coefficients of JPEG compressed images. We break the image into sub-images, consisting o...
详细信息
ISBN:
(纸本)0819424331
We test the performance of a texture feature constructed from the variance of the first eight AC Discrete Cosine Transform (DCT) coefficients of JPEG compressed images. We break the image into sub-images, consisting of many 8*8 blocks, and then calculate the variance of each DCT coefficient across the sub-image. We evaluate the texture feature at two different image resolutions, and at three different quality factors. In our high resolution image a pixel covered a square of side 4 cm on the ground. Our low resolution image was generated by subsampling. Representative feature vectors were generated for five subjectively identified textures, by averaging a small training set. Each sub-image was then classified according to the representative feature vector closest in feature space. Compression ratio had little effect on the classification result in our study. However image resolution significantly altered the classification result. Classification correlated much more closely to a subjective classification for the low resolution image. Feature vectors also fell into much more clearly defined clusters at the lower resolution. Although more research is required across different photo-scales and sets of images, we conclude that texture features generated from compressed JPEG images have potential for content-based imageretrieval based on texture.
In this paper we present the application of the hypermedia system in a prototype that has new kinds of nodes and links for integration of plural multimedia databases. Usually, multimedia databases are independent of e...
详细信息
ISBN:
(纸本)081941767X
In this paper we present the application of the hypermedia system in a prototype that has new kinds of nodes and links for integration of plural multimedia databases. Usually, multimedia databases are independent of each other. They manage different contents and attributes of multimedia data by each different schema. Applications to retrieve from them have particular functions for efficient retrieval. In such a situation, a user would like to integrate the databases. For example, to retrieve a part number from a machine part database and to use the part number for ordering. It has been a difficult task without total reconstruction of the databases. To solve this problem, we propose hypermedia-based integration of plural multimedia databases, without changing the schema and interfaces of the already developed databases, but making linkage between them. The hypermedia system developed at our laboratory features integrating applications, and sharing the integrated applications. By using this system, it becomes possible that a node is what an application does and a link is a relation of what an application does to another one. Then, by linking these nodes, it becomes possible that a series of retrieval for multimedia databases is performed as one retrieval.
暂无评论