5200887
Damage pattern mining in hurricane image databases
We present a damage pattern mining framework for hurricane data on residential houses using aerial photographs with 1:3000 based scale. The vertical photographs are normally collected for an overview of a disaster area or for more detailed assessment. Damage on roof, especially for shingles torn off, is expected to be discovered in a more efficient and automatic way instead of going through the high-resolution aerial photograph for numerous details. The discovered damage patterns can then be used for hurricane damage assessment and impacts on different geographical areas. Our methodology is: (1) applying a novel and effective segmentation method on each residential house on the aerial photograph of one community, (2) using the segmentation results to obtain a set of indexing parameters for each house representing the damage level of roof cladding as well as the patterns of damage, (3) using these parameters to select several templates representing the damage patterns so that users can issue query-by-example (QBE) queries. The proposed segmentation method is an unsupervised simultaneous partition and class parameter estimation algorithm that considers the problem of segmentation as a joint estimation of the partition and class parameter variables. By utilizing this segmentation method, the indexing parameters can be obtained automatically. The QBE capability can assist in finding similar damage patterns on the roof of the residential houses in different locations in the image databases. Experiments based on the aerial photographs of Hurricane Andrew in 1992 are conducted and analyzed to show the effectiveness of the proposed hurricane damage pattern mining framework.
5113927
An unsupervised segmentation framework for texture image queries
In this paper a novel unsupervised segmentation framework for texture image queries is presented. The proposed framework consists of an unsupervised segmentation method for texture images, and a multi-filter query strategy. By applying the unsupervised segmentation method on each texture image, a set of texture feature parameters for that texture image can be extracted automatically. Based upon these parameters, an effective multi-filter query strategy which allows the users to issue texture-based image queries is developed The test results of the proposed framework on 318 texture images obtained from the MIT VisTex and Brodatz database are presented to show its effectiveness.
10875476
Affinity relation discovery in image database clustering and content-based retrieval
In this paper, we propose a unified framework, called <i>Markov Model Mediator</i> (MMM), to facilitate image database clustering and to improve the query performance. The structure of the MMM framework consists of two hierarchical levels: local MMMs and integrated MMMs, which model the affinity relations among the images within a single image database and within a set of image databases, respectively, via an effective data mining process. The effectiveness and efficiency of the MMM framework for database clustering and image retrieval are demonstrated over a set of image databases which contain various numbers of images with different dimensions and concept categories.
5598037
Supporting Information Reuse for Video Data Indexing by Using Color Information
In this paper, an object tracking framework assisted by image segmentation and color indexing techniques to support information reuse for video data is proposed. In order to obtain more accurate results of object tracking, a color indexing method called Color Label Criteria (CLC) is adopted to relax some of the restrictions and assumptions in object tracking in our previous work with low additional cost. Our experiment results on a real video sequence show that the CLC color indexing method is very helpful to achieve more robust object tracking.
9847925
A multimedia semantic model for RTSP-based multimedia presentation systems
An abstract multimedia semantic model called the multimedia augmented transition network (MATN) model is proposed to model the RTSP-based (real-time streaming protocol) multimedia presentation systems. RTSP provides a set of methods to support the functionality of "VCR-like" remote control on the client side so that users are allowed to control playback of the streaming media. The MATN model is used to model RTSP actions as well as temporal relations and synchronization control of the media streams. The advantages of using the MATN model are its simplicity, effectiveness, and ease of modification. Furthermore, a formal definition of the MATN model and modeling of RTSP actions using the MATN model are presented in detail.
1252952
Information reuse and system integration in the development of a hurricane simulation system
This paper presents our effort in designing and implementing an advanced hurricane simulation system on the platform of the World Wide Web for the purpose of supporting decisional processes and hazard mitigation. The development of the system is based on amalgamated methodologies which come from diverse disciplines and is an integration of a variety of techniques. Superior to other similar systems in hurricane study, our system assembles and utilizes information and techniques in a more flexible and robust manner by taking advantage of system layering technique, component modeling strategy and database technologies. Preliminary experiments have been conducted to demonstrate the performance of the system.
1748998
Minimum Register Instruction Scheduling: A New Approach for Dynamic Instruction Issue Processors
Modern superscalar architectures with dynamic scheduling and register renaming capabilities have introduced subtle but important changes into the tradeoffs between compile-time register allocation and instruction scheduling. In particular, it is perhaps not wise to increase the degree of parallelism of the static instruction schedule at the expense of excessive register pressure which may result in additional spill code. To the contrary, it may even be beneficial to reduce the register pressure at the expense of constraining the degree of parallelism of the static instruction schedule. This leads to the following interesting problem: given a data dependence graph (DDG) G, can we derive a schedule S for G that uses the least number of registers ? 
 
In this paper, we present a heuristic approach to compute the near-optimal number of registers required for a DDG G (under all possible legal schedules). We propose an extended list-scheduling algorithm which uses the above number of required registers as a guide to derive a schedule for G that uses as few registers as possible. Based on such an algorithm, an integrated approach for register allocation and instruction scheduling for modern superscalar architectures can be developed.
30275744
Robust Active Shape Model Construction and Fitting for Facial Feature Localization
Active Shape Model (ASM) has proved to be a powerful tool for interpreting face images. However, it may fail in the presence of non-Gaussian noise, or outliers. In this paper, we present a framework for both automatic model construction and efficient model fitting with outliers. In model construction, the training face samples are automatically labeled by local image search using Gabor wavelet features. Then robust principle component analysis (RPCA) is applied to capture the statistics of shape variations. In model fitting, an error function is introduced to deal with the outlier problem, which provides a connection to robust M-estimation. Gauss-Newton algorithm is adopted to efficiently optimize the robust energy function. Extensive experiments demonstrate the efficiency and robustness of our approach over previous methods.
6853058
Markov chain correlation based clustering of gene expression data
An efficient Markov chain correlation based clustering method (MCC) has been proposed for clustering gene expression data. The gene expression data is first normalized and Markov chains (MC) are constructed from the dynamics of the gene expressions, in which the behavior of the genes at each step of the experiment can be taken into account. Based on the correlation of one-step Markov chain transition probabilities, an agglomerative method is employed to group the series that have similar behavior at each point. The proposed MCC clustering method has been applied to four gene expression datasets to obtain a number of clusters. The results show that the MCC method outperforms the commonly used K-means method and produces clusters that are more meaningful in terms of the similarity of the grouped genes. Another advantage of the proposed method over the existing clustering methods is that the knowledge of the group number is not required.
15005856
Security analysis for key generation systems using face images
In this paper, we analyze the security problem of user information associated key generation (UIAKG) systems. We consider three kinds of attacks from the hacker: the exhaustive search attack, the authentic key statistics attack and the device key statistics attack. Under each attack, we give the estimate of the number of guesses the hacker has to make in order to access the system. Such analysis provides useful guidelines in designing a UIAKG system. The analysis also suggests that a user-dependent UIAKG is more secure than a user-independent one. Two UIAKG systems using face images as inputs are designed and compared to support the above theoretical analysis.
40273501
Pattern Discovery in Probabilistic Databases
Modeling probabilistic data is one of important issues in databases due to the fact that data is often uncertainty in real-world applications. So, it is necessary to identify potentially useful patterns in probabilistic databases. Because probabilistic data in 1NF relations is redundant, previous mining techniques don't work well on probabilistic databases. For this reason, this paper proposes a new model for mining probabilistic databases. A partition is thus developed for preprocessing probabilistic data in a probabilistic databases. We evaluated the proposed technique, and the experimental results demonstrate that our approach is effective and efficient.