In this paper, we present topics related to tracking of video objects in compressed videodatabases in the context of videoretrieval applications. We developed a videoretrieval and tracking system (VORTEX) to enable...
详细信息
ISBN:
(纸本)0819431273
In this paper, we present topics related to tracking of video objects in compressed videodatabases in the context of videoretrieval applications. We developed a videoretrieval and tracking system (VORTEX) to enable operation directly on compressed video data. the structure of the video compression standards is exploited in order to avoid the costly decompression operation. this is achieved by utilizing motion compensation-a critical prediction filter embedded in video compression standards-to estimate and interpolate the desired method for template matching. Occlusion analysis, filtering and motion analysis are used to implement fast tracking of objects of interest on the compressed video data. Being presented with a query in the form of template images of objects, the system operates on the compressed video in order to find the images or video sequences where those objects are present and their positions in the image. this enables the retrieval and display of the query-relevant sequences.
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.
In this paper, we propose a new image feature extraction method for MPEG compressed video. To minimize the MPEG decoding process, we use only DC values for Y, Cr, and Cb components for each macroblock. then, we can ob...
详细信息
In this paper, we propose a new image feature extraction method for MPEG compressed video. To minimize the MPEG decoding process, we use only DC values for Y, Cr, and Cb components for each macroblock. then, we can obtain a feature vector using the decoded DC values of Y, Cr, and Cb components for all macroblocks in an I frame. the feature vector consists of histograms for various colors, luminance, and edge types. In obtaining histograms for colors and luminance features, we consider the ratio of contributing pure colors and luminance to the chroma DC values for each macroblock. then, we update all contributing colors and/or luminance histograms accordingly. Otherwise, if the macro block is classified as an edge block, then we update the corresponding edge type histogram. To demonstrate the performance of the proposed feature extraction method, we apply it to a scene change detection problem.
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.
the color histogram of an image has been widely used as a feature descriptor for the image in content-based retrieval applications. In this paper, some results from our investigation efforts into the usage are reporte...
详细信息
ISBN:
(纸本)0819431273
the color histogram of an image has been widely used as a feature descriptor for the image in content-based retrieval applications. In this paper, some results from our investigation efforts into the usage are reported. We outline three typical color space quantization schemes used in our experiments and introduce the soft-decision histogramming method to eliminate the discontinuity problem in traditional color histogram population process. then, to improve the effectiveness of color histogram based retrieval algorithms, several similarity metrics are proposed for comparing color histograms, including three special forms of the Kantorovich metric.
We have developed a wide-area-distributed storage system for multimedia databasesthat minimizes the possibility of simultaneous failure of multiple disks in the event of a major disaster. It features a RAID system wh...
详细信息
We have developed a wide-area-distributed storage system for multimedia databasesthat minimizes the possibility of simultaneous failure of multiple disks in the event of a major disaster. It features a RAID system whose member disks are spatially distributed over a wide area. Each node has a device that includes the controller of the RAID and the controller of the member disks controlled by other nodes. the devices in the node are connected to a computer using fiber optic cables and communicate using Fibre-Channel technology. Any computer at a node can utilize multiple devices connected by optical fibers as a single 'virtual disk'. the advantage of this system structure is that devices and fiber optic cables are shared by the computers. In this report, we first describe our proposed system and a prototype we used for testing. then we discuss its performance, i.e., how the read and write throughputs are affected by data-access delay, the RAID level, and queuing.
imageretrieval systems that compare the query image exhaustively with each individual image in the database are not scalable to large databases. A scalable search system should ensure that the search time does not in...
详细信息
ISBN:
(纸本)0819431273
imageretrieval systems that compare the query image exhaustively with each individual image in the database are not scalable to large databases. A scalable search system should ensure that the search time does not increase linearly withthe number of images in the database. We present a clustering based indexing technique, where the images in the database are grouped into clusters of images with similar color content using a hierarchical clustering algorithm. At search time the query image is not compared with all the images in the database, but only with a small subset. Experiments show that this clustering based approach offers a superior response time with a high retrieval accuracy. Experiments with different database sizes indicate that for a given retrieval accuracy the search time does not increase linearly withthe database size.
Various methods of automatic shot boundary detection have been proposed and claimed to perform reliably. Although the detection of edits is fundamental to any kind of video analysis since it segments a video into its ...
详细信息
Various methods of automatic shot boundary detection have been proposed and claimed to perform reliably. Although the detection of edits is fundamental to any kind of video analysis since it segments a video into its basic components, the shots, only few comparative investigations on early shot boundary detection algorithms have been published. these investigations mainly concentrate on measuring the edit detection performance, however, do not consider the algorithms' ability to classify the types and to locate the boundaries of the edits correctly. this paper extends these comparative investigations. More recent algorithms designed explicitly to detect specific complex editing operations such as fades and dissolves are taken into account, and their ability to classify the types and locate the boundaries of such edits are examined. the algorithms' performance is measured in terms of hit rate, number of false hits, and miss rate for hard cuts, fades, and dissolves over a large and diverse set of video sequences. the experiments show that while hard cuts and fades can be detected reliably, dissolves are still an open research issue. the false hit rate for dissolves is usually unacceptably high, ranging from 50% up to over 400%. Moreover, all algorithms seem to fail under roughly the same conditions.
this paper introduces a model of spatio-temporal database that we are developing to query interesting events in video sequences. the database that we are designing is pushing the state of the art for a number of field...
详细信息
ISBN:
(纸本)0819431273
this paper introduces a model of spatio-temporal database that we are developing to query interesting events in video sequences. the database that we are designing is pushing the state of the art for a number of fields, and there are many issues that are still waiting a satisfactory solution. In this paper we present our (albeit still partial) answer to some of these problems, and the future directions of our work. Our design is divided in two layers: a Logbook which operates as a short time repository of unsummarized and unprocessed data, and a long term spatio-temporal database which stores and queries sumamrized data.
Illumination invariance is of paramount importance to annotate video sequences stored in large videodatabases consistently. Yet, popular texture analysis methods such as multichannel filtering techniques do not yield ...
详细信息
Illumination invariance is of paramount importance to annotate video sequences stored in large videodatabases consistently. Yet, popular texture analysis methods such as multichannel filtering techniques do not yield illumination-invariant texture representations. In this paper, we assess the effectiveness of three illumination normalisation schemes for texture representations derived from Gabor filter outputs. the schemes aim at overcoming intensity scaling effects due to changes in ilumination conditions. A theoretical analysis and experimental results enable us to select one scheme as the most promising one. In this scheme, a normalising factor is derived at each pixel by combining the energy responses of different filters at that pixel. the scheme overcomes illumination variations well, while still preserving discriminatory textural information. Further statistical analysis may shed light on other interesting properties or limitations of the scheme.
暂无评论