An experimental video server for middle-scale video-on-demand services that uses a 'redundant double-layered disk array' can read out 100 MPEG-1 1.5-Mbps video streams simultaneously with a response time of un...
详细信息
ISBN:
(纸本)0819420441
An experimental video server for middle-scale video-on-demand services that uses a 'redundant double-layered disk array' can read out 100 MPEG-1 1.5-Mbps video streams simultaneously with a response time of under one second through an FDDI-LAN. An exclusive data method that switches between normal data and fast data and a skip-search method are used to provide fast visual search. The gateway connecting the video server LAN to a 6.312-Mbps constant bit-rate line allows broadcast services to be integrated with on- demand services. The protocol implemented in this gateway controls the visual search rate, corrects errors in downloaded data, and accelerates the playback mode changes.
With the advance of multimedia technologies and the explosive expansion of the World Wide Web, the volume of image and video data increases rapidly. An efficient and effective multimedia data retrieval technique is ne...
详细信息
ISBN:
(纸本)0819439932
With the advance of multimedia technologies and the explosive expansion of the World Wide Web, the volume of image and video data increases rapidly. An efficient and effective multimedia data retrieval technique is needed. In this paper, we propose an approach based on feature points for the content-based imageretrieval. The feature points extracted from the multiresolution representation of the query image and database image are first matched to determine the matching pairs. Then, the matching pairs are classified into groups, finally, two similarity measurements based on different similarity requirements are proposed to compute the similarity degree. We perform a series of experiments to study. the characteristics of this approach, and compare with the region-based approach on similar-shot sequence retrieval. The comparison shows the superiority of this approach.
We propose anew simple image coder based on Discrete Wavelet Transform (DWT). The DWT coefficients are coded in bitplanes. We use a variable order Markovian model to code the DWT coefficient bitplanes. Recently, we ha...
详细信息
ISBN:
(纸本)0819424331
We propose anew simple image coder based on Discrete Wavelet Transform (DWT). The DWT coefficients are coded in bitplanes. We use a variable order Markovian model to code the DWT coefficient bitplanes. Recently, we have developed this method that used 65 contexts(7). In this paper, the number of contexts is reduced to 34. We show the experimental results, both in terms of distortion measurement and visual comparison, and compare them to well-known methods.
作者:
Luo, MBai, XSXu, GYTsinghua Univ
Dept Comp Sci & Technol State Key Lab Intelligent Technol & Syst Beijing 100084 Peoples R China
An explosion of on-line image and video data in digital form is already well underway. With the exponential rise in interactive information exploration and dissemination through the World-Wide Web, the major inhibitor...
详细信息
ISBN:
(纸本)0819444162
An explosion of on-line image and video data in digital form is already well underway. With the exponential rise in interactive information exploration and dissemination through the World-Wide Web, the major inhibitors of rapid access to on-line video data are the management of capture and storage, and content-based intelligent search and indexing techniques. This paper proposes an approach for content-based analysis and event-based indexing of sports video. It includes a novel method to organize shots-classifying shots as close shots and far shots, an original idea of blur extent-based event detection, and an innovative local mutation-based algorithm for caption detection and retrieval. Results on extensive real TV programs demonstrate the applicability of our approach.
Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation, and MPEG-7 standard require the storage and management of well-defined objects....
详细信息
Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation, and MPEG-7 standard require the storage and management of well-defined objects. These object databases are then queried and searched for different purposes. A sample query might be "find all the scenes that contain a certain object." Shape of an object is an important feature for image and multimedia similarity retrievals. Therefore, in this study we focus on shape-based object retrieval and conduct a comparison study on four of such techniques (i.e., Fourier descriptors, grid based, Delaunay triangulation, and our proposed MBC-based methods (e.g., MBC-TPVAS)). We measure the effectiveness of the similarity retrieval of the four different shape representation methods in terms of recall and precision. Our results show that the similarity retrieval accuracy of our method (MBC-TPVAS) is as good as that of the other methods, while it observes the lowest computation cost to generate the shape signatures of the objects. Moreover, it has low storage requirement, and a comparable computation cost to compute the similarity between two shape signatures. In addition, MBC-TPVAS requires no normalization of the objects, and is the only method that has direct support for S-RST query types. In this paper, we also propose a new shape description taxonomy.
In past decades, many storage schemes for large images on parallel computers have been proposed to provide simultaneous access to various subsets of the pixels. The existing storage schemes have the following limitati...
详细信息
ISBN:
(纸本)0819411418
In past decades, many storage schemes for large images on parallel computers have been proposed to provide simultaneous access to various subsets of the pixels. The existing storage schemes have the following limitations: (1) The address generation mechanism is dependent on the size of the image to be processed. (2) Many schemes have limitations on the machine size and image size (N X N, such as N must be an even power of 2). (3) As more and more frequently used data patterns have been recognized, most schemes can only provide parallel access to a limited range of data patterns. (4) The data alignment (connecting each memory module to a proper processor) may require special hardware. In this study, we investigate the combination of several storage schemes. They mainly employ exclusive-or operations for address generation which can be completed in constant time. The address generation mechanism is independent of the image size so that different sized images can be processed efficiently on a fixed-size machine. The system uses N memory modules where N is any (even or odd) power of two. With schemes combined together, this system covers more data patterns than any single scheme yet proposed.
Ire introduce a simple image coding method, the block truncation coding (BTC) technique, as a novel approach to the construction of colour imagedatabases. It is shown that BTC cars riot only be used to compress the i...
详细信息
ISBN:
(纸本)9628576623
Ire introduce a simple image coding method, the block truncation coding (BTC) technique, as a novel approach to the construction of colour imagedatabases. It is shown that BTC cars riot only be used to compress the images thus achieving storage efficiency, the BTC codes cart also be used directly, to construct image features for effective imageretrieval. From the BTC code we have developed an image feature termed the BTC colour co-occurrence matrix (BCCM) as an effective measure of image contents. Experimental results are presented to show that BCCM is comparable to state of the art techniques, such as color correlogram, in imageretrieval.
Queries referring to content embedded within images are an essential component of content-based search, browse, or summarize operations in imagedatabases. Localization of such queries under changes in appearance, occ...
详细信息
Queries referring to content embedded within images are an essential component of content-based search, browse, or summarize operations in imagedatabases. Localization of such queries under changes in appearance, occlusions and background clutter, is a difficult problem, for which current spatial access structures in databases are not suitable. In this paper we present a new method of indexing imagedatabases called location hashing that uses a special data structure called the location hash tree (LHT) for organizing feature information from images of a database. Location hashing is based on the principle of geometric hashing and determines simultaneously, the relevant images in the database and the regions within them that are most likely to contain a 2d pattern query without incurring detailed search of either. The location hash tree being a red-black tree, allows for efficient search for candidate locations using pose-invariant feature information derived from the query.
Development of various multimedia applications hinges on the availability of fast and efficient storage, brews browsing, indexing, and retrieval techniques. Given that video is typically stored efficiently in a compre...
详细信息
ISBN:
(纸本)0819424331
Development of various multimedia applications hinges on the availability of fast and efficient storage, brews browsing, indexing, and retrieval techniques. Given that video is typically stored efficiently in a compressed format, if we can analyze the compressed representation directly, we can avoid the costly overhead of decompressing and operating at the pixel level. Compressed domain parsing of video has been presented in earlier work where a video clip is divided into shots, subshots, and scenes.(9,11) In this paper, we describe key frame selection, feature extraction, and indexing and retrieval techniques that are directly applicable to MPEG compressed video. We develop a frame-type independent representation of the various types of frames present in an MPEG video in which all frames can be considered equivalent. Features are derived from the available DCT, macroblock, and motion vector information and mapped to a low-dimensional space where they can be accessed with standard database techniques. The spatial information is used as primacy index while the temporal information is used to enhance the robustness of the system during the retrieval process. The techniques presented enable fast archiving, indexing, and retrieval of video. Our operational prototype typically takes a fraction of a second to retrieve similar video scenes from our database, with over 95% success.
This paper investigates clustering techniques as a method of organizing imagedatabases to support popular visual management functions such as searching, browsing and navigation. Different types of hierarchical agglom...
详细信息
ISBN:
(纸本)0819429880
This paper investigates clustering techniques as a method of organizing imagedatabases to support popular visual management functions such as searching, browsing and navigation. Different types of hierarchical agglomerative clustering techniques are studied as a method of organizing features spaces as well as summarizing image groups by the selection of a few appropriate representatives. retrieval performance using both single and multiple level hierarchies are experimented with and the algorithms show an interesting relationship between the top k correct retrievals and the number of comparisons required. Some arguments are given to support the use of such cluster-based techniques for managing distributed imagedatabases.
暂无评论