7138459
Comparison of Feature Extraction Techniques for Watermark Synchronization
This paper evaluates feature extraction techniques in aspect of watermark synchronization. Most watermarking algorithms suffer from geometric distortion attacks that desynchronize the location of the inserted watermark. The process of synchronizing the location for watermark insertion and detection is crucial to design robust watermarking. One solution for watermark synchronization is to use features. This paper reviews feature extraction techniques in feature-based watermarking: the Harris corner detector and the Mexican Hat wavelet scale interaction method. We evaluate the scale-invariant keypoint extractor in comparison with others. After feature extraction, the set of triangles is generated by Delaunay tessellation. These triangles are the location for watermarking. Redetection ratio of triangles is measured against geometric distortion attacks and signal processing attacks. Experimental results show that the scale–invariant keypoint extractor is appropriate for robust watermarking.
7718842
Averaging attack resilient video fingerprinting
This paper addresses an effective technique for digital fingerprinting for video. The code modulation technique, that uses an averaging collusion resilient fingerprint code derived from BIBD, is a robust method against averaging attacks. In this paper, we propose a new fingerprint code based on GD-PBIBD theory that is efficient in designing the fingerprint code and describe an effective method to embed and detect the fingerprint code, in which the merits of orthogonal modulation and coded modulation techniques are combined. To analyze the performance, we apply our method to video applications using a spread-spectrum watermarking technique in the spatial domain and the results show the proposed method is effective for fingerprint code embedding and detection.
16122349
Feature-Based Image Watermarking Method Using Scale-Invariant Keypoints
This paper addresses feature-based image watermarking methods for digital contents. Most previous watermarking algorithms suffer from geometric distortion attacks that desynchronize the location of the inserted watermark. In order to synchronize the watermark location, watermark synchronization should be performed. One solution for watermark synchronization is to use image features. This paper describes a feature-based watermarking method based on scale-invariant keypoints. We extract feature points from the scale-invariant keypoint extractor and then decompose feature points into a set of disjoint triangles. These triangles are watermarked by an additive spread-spectrum method on the spatial domain. We perform an intensive simulation in comparison with other feature-based watermarking methods using 100 test images. Results show that the proposed method is considerably robust against both geometric distortion attacks and signal processing attacks listed in Stirmark 3.1.
15070330
Towards knowledge-based extraction of roads from 1 m-resolution satellite images
As the IKONOS satellite with 1 m-resolution camera was launched in 1999, mapping using spaceborne images will be an important issue in the computer vision area as well as photogrammetry, mainly because most major man-made objects of interest can be identifiable. One of the automatically identifiable objects of importance may be roads. Detecting roads using edge detection approaches may be very difficult because a number of edge elements from such as buildings, etc., can be generated from edge detector. In this paper, we propose a method for the extraction of approximated road regions based on region segmentation that utilizes region information. Our method consists of the following three steps. First, an image is segmented using the modified hierarchical multi-scale gradient watershed transformation. Then, the road candidates are identified using information about road gray level, elongatedness and connectedness. The identified road candidates are expanded by connecting the close-by roads knowing that roads are connected objects. Our method was tested on the simulated spaceborne images and the result shows that the automation of road extraction is quite promising.
5620319
Extraction of digital elevation models from satellite stereo images through stereo matching based on epipolarity and scene geometry
This paper addresses the problem of generating digital elevation models from satellite images taken by linear pushbroom cameras. Since there exist unique geometric properties for linear pushbroom images, we argue that the conventional DEM generation schemes developed for perspective images are not suitable for satellite images. Using the geometric properties of linear pushbroom images, we design a new matching strategy optimized for linear pushbroom image in three aspects: conjugate search method, correlation patch design and match sequence determination. We will discuss in what aspect conventional approaches and our new approach differ and show how performance has improved by hiring proper techniques. A series of experiments using SPOT panchromatic stereo pairs showed that our approach outperformed conventional approaches in terms of accuracy and processing time. q 2003 Elsevier B.V. All rights reserved.
46208894
Evaluation of Feature Extraction Techniques for Robust Watermarking
This paper addresses feature extraction techniques for robust watermarking. Geometric distortion attacks desynchronize the location of the inserted watermark and hence prevent watermark detection. Watermark synchronization, which is a process of finding the location for watermark insertion and detection, is crucial to design robust watermarking. One solution is to use image features. This paper reviews feature extraction techniques that have been used in featurebased watermarking: the Harris corner detector and the Mexican Hat wavelet scale interaction method. We also evaluate the scale-invariant keypoint extractor in comparison with other techniques in aspect of watermarking. After feature extraction, the set of triangles is generated by Delaunay tessellation. These triangles are the location for watermark insertion and detection. Redetection ratio of triangles is evaluated against geometric distortion attacks as well as signal processing attacks. Experimental results show that the scale-invariant keypoint extractor is appropriate for robust watermarking.
39638713
Robust H∞ fuzzy static output feedback control of T-S fuzzy systems with parametric uncertainties
This paper addresses robust H"~ fuzzy static output feedback control problem for T-S fuzzy systems with time-varying norm-bounded uncertainties. Sufficient conditions for synthesis of a fuzzy static output feedback controller for T-S fuzzy systems are derived in terms of a set of linear matrix inequalities (LMIs). In comparison with the existing literatures, the proposed approach not only simplifies the design procedure but also achieves a better H"~ performance. Three drawbacks existing in the previous papers such as coordinate transformation, same output matrices and BMI problem have been eliminated. The effectiveness of the proposed design method is demonstrated by an example for the control of a truck-trailer system.
18817570
Long-term location data management for distributed moving object databases
To handle the extreme situation that must manage positional information of a very large volume, at least millions, of moving objects, a cluster-based scalable distributed computing system architecture, called the GALIS, which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone, was proposed. In this paper, we propose a valid time management and time-zone shifting scheme, which are essential in realizing the long-term location data subsystem of GALIS, but missed in our previous prototype development. We explain how to manage valid time of moving objects to avoid ambiguity of location information. We also describe time-zone shifting algorithm, with three variations, such as RT-TZS, B-TZS and TPB-TZS. Through experiments related with query processing time and CPU utilization, we show the efficiency of the proposed time-zone shifting schemes
2326376
Dublin City University Video Track Experiments for TREC 2002
Dublin City University participated in the Feature Extraction task and the Search task of the TREC-2002 Video Track. In the Feature Extraction task, we submitted 3 features: Face, Speech, and Music. In the Search task, we developed an interactive video retrieval system, which incorporated the 40 hours of the video search test collection and supported user searching using our own feature extraction data along with the donated feature data and ASR transcript from other Video Track groups. This video retrieval system allows a user to specify a query based on the 10 features and ASR transcript, and the query result is a ranked list of videos that can be further browsed at the shot level. To evaluate the usefulness of the feature-based query, we have developed a second system interface that provides only ASR transcript-based querying, and we conducted an experiment with 12 test users to compare these 2 systems. Results were submitted to NIST and we are currently conducting further analysis of user performance with these 2 systems.
6784159
Randomized registers and iterative algorithms
Abstract.We present three different specifications of a read-write register that may occasionally return out-of-date values - namely, a (basic) random register, a P-random register, and a monotone random register. We show that these specifications are implemented by the probabilistic quorum algorithm of Malkhi, Reiter, Wool, and Wright, and we illustrate how to program with such registers in the framework of Bertsekas, using the notation of Üresin and Dubois. Consequently, existing iterative algorithms for a significant class of problems (including solving systems of linear equations, finding shortest paths, constraint satisfaction, and transitive closure) will converge with high probability if executed in a system in which the shared data is implemented with registers satisfying the new specifications. Furthermore, the algorithms in this framework will inherit positive attributes concerning load and fault-tolerance from the underlying register implementation. The expected convergence time for iterative algorithms using the monotone implementation is analyzed and shown experimentally to improve on that of the original implementation. The message complexity for iterative algorithms using the monotone probabilistic quorum implementation is shown to improve on that of non-probabilistic implementations in a quantifiable situation.
8884680
Using Segmented Objects in Ostensive Video Shot Retrieval
This paper presents a system for video shot retrieval in which shots are retrieved based on matching video objects using a combination of colour, shape and texture. Rather than matching on individual objects, our system supports sets of query objects which in total reflect the user's object-based information need. Our work also adapts to a shifting user information need by initiating the partitioning of a user's search into two or more distinct search threads, which can be followed by the user in sequence. This is an automatic process which maps neatly to the ostensive model for information retrieval in that it allows a user to place a virtual checkpoint on their search, explore one thread or aspect of their information need and then return to that checkpoint to then explore an alternative thread. Our system is fully functional and operational and in this paper we illustrate several design decisions we have made in building it.