Ideal binary time-frequency masking is a signal separation technique that retains mixture energy in time-frequency units where local signal-to-noise ratio exceeds a certain threshold and rejects mixture energy in other time-frequency units. Two experiments were designed to assess the effects of ideal binary masking on speech intelligibility of both normal-hearing (NH) and hearing-impaired (HI) ...

SUMMARY We investigate binary sequence pairs with two-level correlation in terms of their corresponding cyclic difference pairs (CDPs). We define multipliers of a cyclic difference pair and present an existence theorem for multipliers, which could be applied to check the exis-tence/nonexistence of certain hypothetical cyclic difference pairs. Then, we focus on the ideal case where all the out-o...

Time-frequency mask estimation has shown considerable success recently. In this paper, we demonstrate its utility as a feature enhancement frontend for large vocabulary conversational speech recognition. Additionally, we investigate how masking compares with feature denoising, which directly reconstructs clean features from noisy ones. We train a mask estimator that predicts ideal ratio masks. ...

Missing feature methods of noise compensation for speech recognition operate by first identifying components of a spectrographic representation of speech that are considered to be corrupt. Recognition is then performed either using only the remaining reliable components, or the corrupt components are reconstructed prior to recognition. These methods require a spectrographic mask which accuratel...

The association of algebraic objects to forms has had many important applications in number theory. Gauss, over two centuries ago, studied quadratic rings and ideals associated to binary quadratic forms, and found that ideal classes of quadratic rings are exactly parametrized by equivalence classes of integral binary quadratic forms. Delone and Faddeev, in 1940, showed that cubic rings are para...

Uniformly Redundant Arrays (URA’s) are two–dimensional binary arrays with constant sidelobes of their periodic autocorrelation function. They are widely agreed upon to be optimum mask patterns for coded aperture imaging, particularly in imaging systems with a cyclic coded mask. In this paper, a survey of all currently known construction methods for URA’s is given and the sizes and open fraction...

This paper relates computational commutative algebra to tree classification with binary covariates. With a single classification variable, properties of uniqueness of a tree polynomial are established. In a binary multivariate context, it is shown how trees for many response variables can be made into a single ideal of polynomials for computations. Finally, a new sequential algorithm is propose...

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph. If the binary matroid avo...

In this paper, we prepare segmenting the brain portion Magnetic Resonance Image (MRI). In our method, we first find the threshold using Riddler’s method and convert gray image to binary image. The head boundaries are detected by using contour of the head. By subtracting, we detect the scalp and remove it. We perform morphological operation to disconnect the non-brain region. Finally, by applyin...

Fabrication of fine features of smaller 0.15um is vital for future ultra-large scale integrated (ULSI) devices. An area of particular concern is whether and how optical lithography can delineate such feature sizes, i.e., smaller than the exposure wavelength. Resolution enhancement techniques for achieving subwavelength optical lithography are presented. Various types of phase shift mask (PSM) t...