1058945
A Classification-based Cocktail-party Processor
At a cocktail party, a listener can selectively attend to a single voice and filter out other acoustical interferences. How to simulate this perceptual ability remains a great challenge. This paper describes a novel supervised learning approach to speech segregation, in which a target speech signal is separated from interfering sounds using spatial location cues: interaural time differences (ITD) and interaural intensity differences (IID). Motivated by the auditory masking effect, we employ the notion of an ideal time-frequency binary mask, which selects the target if it is stronger than the interference in a local time-frequency unit. Within a narrow frequency band, modifications to the relative strength of the target source with respect to the interference trigger systematic changes for estimated ITD and IID. For a given spatial configuration, this interaction produces characteristic clustering in the binaural feature space. Consequently, we perform pattern classification in order to estimate ideal binary masks. A systematic evaluation in terms of signal-to-noise ratio as well as automatic speech recognition performance shows that the resulting system produces masks very close to ideal binary ones. A quantitative comparison shows that our model yields significant improvement in performance over an existing approach. Furthermore, under certain conditions the model produces large speech intelligibility improvements with normal listeners.
13039133
On Connectedness: A Solution Based on Oscillatory Correlation
A long-standing problem in neural computation has been the problem of connectedness, first identified by Minsky and Papert (1969). This problem served as the cornerstone for them to establish analytically that perceptrons are fundamentally limited in computing geometrical (topological) properties. A solution to this problem is offered by a different class of neural networks: oscillator networks. To solve the problem, the representation of oscillatory correlation is employed, whereby one pattern is represented as a synchronized block of oscillators and different patterns are represented by distinct blocks that desynchronize from each other. Oscillatory correlation emerges from LEGION (locally excitatory globally inhibitory oscillator network), whose architecture consists of local excitation and global inhibition among neural oscillators. It is further shown that these oscillator networks exhibit sensitivity to topological structure, which may lay a neurocomputational foundation for explaining the psychophysical phenomenon of topological perception.
648343
Texture classification using spectral histograms
Based on a local spatial/frequency representation,we employ a spectral histogram as a feature statistic for texture classification. The spectral histogram consists of marginal distributions of responses of a bank of filters and encodes implicitly the local structure of images through the filtering stage and the global appearance through the histogram stage. The distance between two spectral histograms is measured using chi(2)-statistic. The spectral histogram with the associated distance measure exhibits several properties that are necessary for texture classification. A filter selection algorithm is proposed to maximize classification performance of a given dataset. Our classification experiments using natural texture images reveal that the spectral histogram representation provides a robust feature statistic for textures and generalizes well. Comparisons show that our method produces a marked improvement in classification performance. Finally we point out the relationships between existing texture features and the spectral histogram, suggesting that the latter may provide a unified texture feature.
8221986
Image Segmentation Based on Oscillatory Correlation
We study image segmentation on the basis of locally excitatory, globally inhibitory oscillator networks (LEGION), whereby the phases of oscillators encode the binding of pixels. We introduce a lateral potential for each oscillator so that only oscillators with strong connections from their neighborhood can develop high potentials. Based on the concept of the lateral potential, a solution to remove noisy regions in an image is proposed for LEGION, so that it suppresses the oscillators corresponding to noisy regions but without affecting those corresponding to major regions. We show that the resulting oscillator network separates an image into several major regions, plus a background consisting of all noisy regions, and we illustrate network properties by computer simulation. The network exhibits a natural capacity in segmenting images. The oscillatory dynamics leads to a computer algorithm, which is applied successfully to segmenting real gray-level images. A number of issues regarding biological plausibility and perceptual organization are discussed. We argue that LEGION provides a novel and effective framework for image segmentation and figure-ground segregation.
5831762
Intrinsic generalization analysis of low dimensional representations
Low dimensional representations of images impose equivalence relations in the image space; the induced equivalence class of an image is named as its intrinsic generalization. The intrinsic generalization of a representation provides a novel way to measure its generalization and leads to more fundamental insights than the commonly used recognition performance, which is heavily influenced by the choice of training and test data. We demonstrate the limitations of linear subspace representations by sampling their intrinsic generalization, and propose a nonlinear representation that overcomes these limitations. The proposed representation projects images nonlinearly into the marginal densities of their filter responses, followed by linear projections of the marginals. We use experiments on large datasets to show that the representations that have better intrinsic generalization also lead to better recognition performance.
14516368
A schema-based model for phonemic restoration
Phonemic restoration is the perceptual synthesis of phonemes when masked by appropriate replacement sounds by utilizing linguistic context. Current models attempting to accomplish acoustic restoration of phonemes, however, use only temporal continuity and produce poor restoration of unvoiced phonemes, and are also limited in their ability to restore voiced phonemes. We present a schema-based model for phonemic restoration. The model employs a missing data speech recognition system to decode speech based on intact portions and activates word templates corresponding to the words containing the masked phonemes. An activated template is dynamically time warped to the noisy word and is then used to restore the speech frames corresponding to the masked phoneme, thereby synthesizing it. The model is able to restore both voiced and unvoiced phonemes with a high degree of naturalness. Systematic testing shows that this model outperforms a Kalman-filter based model.
34533255
Clifford Term Rewriting for Geometric Reasoning in 3D
Clifford algebra formalism has been used recently in combination with standard term-rewriting techniques for proving many non-trivial geometric theorems. The key issue in this approach consists in verifying whether two Clifford expressions are equal. This paper is concerned with the generalization of the work to 3D geometric problems. A rewriting system is proposed and its theoretical properties are investigated. Some examples and potential applications are also presented.
46198564
Reasoning about Surfaces Using Differential Zero and Ideal Decomposition
This paper presents methods for zero and ideal decomposition of partial differential polynomial systems and the application of these methods and their implementations to deal with problems from the local theory of surfaces. We show how to prove known geometric theorems and to derive unknown relations automatically. In particular, an algebraic relation between the first and the second fundamental coefficients in a very compact form has been derived, which is more general and has smaller degree than a relation discovered previously by Z. Li. Moreover, we provide symmetric expressions for Li's relation and clarify his statement. Some examples of theorem proving and computational difficulties encountered in our experiments are also discussed.
11091323
Learning Semantic Concepts from Visual Data Using Neural Networks
For content-based image retrieval techniques, query image is used to pick up and rank some relevant images from a database using some certain similarity metric. If semantic features are not involved in the modeling of visual data, the resulting system may demonstrate a disability of retrieving images likely associated with interesting semantic concepts of objects in the images. Therefore, issues on semantics representation, automatic extraction of semantic concepts from visual data, and effects of window size on the concepts recogni- tion are needed to study. This paper describes an approach towards these prob- lems. We first define a set of semantic concepts characterizing the outdoor im- ages. Then, a neural network is employed to memory the semantic concepts through pattern learning techniques. Lastly, the well-trained neural networks will perform as a classifier to identify the predefined semantics within an image. Empirical studies and comparison with decision tree techniques are carried out.
17484927
A structure-based approach for multimedia information filtering
While multimedia documents are sequentially presented to users, an information filtering (IF) system is useful to achieve a good retrieval performance in terms of both quality and efficiency. Conventional approaches for designing an IF system are based on the user's evaluation on information relevance degree (IRD), but ignore other attributes in system design such as relative importance of the data in a collection of multimedia documents. In this paper, we aim at developing a framework of designing structure-based multimedia IF systems, which incorporates the characteristics of the importance and relevance of multimedia documents. A method of calculating the values of relative importance degree of multimedia documents is proposed. Furthermore, these values are combined into the IRD of multimedia documents to improve the representation of user profiles. An illustrative example is given to demonstrate the proposed techniques.
2942056
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
We introduce a SAT based automatic abstraction refinement framework for model checking systems with several thousand state variables in the cone of influence of the specification. The abstract model is constructed by designating a large number of state variables as invisible. In contrast to previous work where invisible variables were treated as free inputs we describe a computationally more advantageous approach in which the abstract transition relation is approximated by pre-quantifying invisible variables during image computation. The abstract counterexamples obtained from model-checking the abstract model are symbolically simulated on the concrete system using a state-of-the-art SAT checker. If no concrete counterexample is found, a subset of the invisible variables is reintroduced into the system and the process is repeated. The main contribution of this paper are two new algorithms for identifying the relevant variables to be reintroduced. These algorithms monitor the SAT checking phase in order to analyze the impact of individual variables. Our method is complete for safety properties (AGp) in the sense that - performance permitting - a property is either verified or disproved by a concrete counterexample. Experimental results are given to demonstrate the power of our method on real-world designs.