17269099
Edge detection in ultrasound speckle noise
Presents a statistical approach to edge detection in ultrasound speckle, and uses actual noise statistics to derive an expression for an optimal detection rule. The authors compute the optimal detector for the special case of uncorrelated speckle, and an approximation to the optimal detector for the case when signal-to-noise ratio (SNR) is high. They also discuss a simple sub-optimal detection scheme, and show that its performance is close to that of the optimal uncorrelated speckle detection rule, and surpasses that of the high-SNR approximation except in the case of extremely high SNR, in which case they both perform equally well.<<ETX>>
6816511
Joint source channel matching for a wireless communications link
Summary form only given. With the rapid growth of wireless communications systems there is an increasing demand for efficient image and video transmission. Significant performance gains can be obtained from joint source channel matching where system resources are assigned based on the tradeoff between data and redundancy. We develop a more general approach for joint source channel matching based on a parametric distortion model that incorporates the flexibility and constraints of both the source and the channel. We use parametric models describing source and channel. We use parametric models describing source and channel characteristics that can be accurately applied to most classes of source and channel coders. To show the generality of our approach, we applied it to the familiar Said-Pearlman progressive image coder with two types of channel coders, a coder with orthogonal symbols of different power, and fixed-rate BPSK modulation overlaid with Reed Solomon codes.
6177362
Line and boundary detection in speckle images
This paper considers the problem of detecting lines in speckle imagery, such as that produced by synthetic aperture radar (SAR) or ultrasound techniques. Using the physical principles that account for the speckle phenomenon, we derive the optimal detector for lines in fully developed speckle, and we compare the optimal detector to several suboptimal detection rules that are more computationally efficient. We show that when the noise is uncorrelated, a very simple suboptimal detection rule is nearly optimal, and that even in colored speckle, a related class of detectors can approach optimal performance. Finally, we also discuss the application of this technique to medical ultrasonic images, where the detection of tissue boundaries is considered as a problem of line detection.
12684339
Frequency-shift-invariant orthonormal wavelet packet representations
It is commonly known that wavelet expansions are very sensitive to translation of an input signal due to their dyadic structure. Without proper time alignment of the signal to the decomposition basis vectors, a compact expansion may be unattainable. Recently, work has been done to combat translation sensitivity by determining the best translation-invariant expansion of a signal with respect to a set of bases. However, the dyadic structure of wavelet expansions also results in frequency alignment sensitivity. In this work, we introduce a frequency-shifted wavelet packet library as well as an efficient best basis algorithm for determining the best signal representation among all frequency shifts of a signal.
2859083
A general joint source-channel matching method for wireless video transmission
With the rapid growth of multimedia content in wireless communication, there is an increasing demand for efficient image and video transmission systems. We present a joint source-channel matching scheme for wireless video transmission which jointly optimizes the source and channel coder to yield the optimal transmission quality while satisfying real-time delay and buffer constraints. We utilize a parametric model approach which avoids the necessity of having detailed a priori knowledge of the coders, thus making the scheme applicable to a wide variety of source and channel coder pairs. Simulations show that the scheme yields excellent results and works for several different types of source and channel coders.
36682359
Ultrasound speckle reduction by directional median filtering
This paper presents a novel adaptation of the median filter to the problem of boundary-preserving speckle reduction in ultrasonic imaging. The technique involves applying a bank of oriented one-dimensional median filters to the image, and retaining at each point the largest value among all the filter bank outputs. The result is an operator which suppresses speckle noise while retaining the structure of the image, particularly the thin bright streaks, which tend to occur along boundaries between tissue layers. The technique is compared to a block median filter and an algorithm discussed by Loupas et al. (1989), and is shown to be far superior to the median filter, and noticeably better than the Loupas filter at enhancing thin lines.
14144660
Systematic protection mechanism design
This work describes an attempt to systematically design a hardware resource protection mechanism when given the requirements of a particular language as a target. The design process is formalized as a structured walk through the multidimensional computer design space towards a hypothetical class of optimal machines. Each step in this walk involves a change in the distribution of work between the compiler and run-time system but no change in the source language semantics. The starting point for this walk is the result of a semantic analysis of the language to be implemented; typically, this produces a very high level machine where the compiler, if any, is trivial. The walk ends when no changes result in a net improvement. This does not guarantee that the result is even locally optimal, since the changes tried depend on the ingenuity and persistence of the designer.
 This design approach has been used to arrive at a practical, general purpose protection mechanism oriented towards the needs of the Ada language (preliminary version). This architecture was evaluated by comparing it with the PDP-11/45. For the purpose of this comparison, the protection mechanism was incorporated into a partially specified PDP-11 like instruction set. The number of bits making up the processor state and the number of operations involved in address computation were evaluated. On this basis, the result appears to be competitive and worth further investigation.
11334584
The rapid generation of mutation data matrices from protein sequences
An efficient means for generating mutation data matrices from large numbers of protein sequences is presented here. By means of an approximate peptide-based sequence comparison algorithm, the set sequences are clustered at the 85% identity level. The closest relating pairs of sequences are aligned, and observed amino acid exchanges tallied in a matrix. The raw mutation frequency matrix is processed in a similar way to that described by Dayhoff et al. (1978), and so the resulting matrices may be easily used in current sequence analysis applications, in place of the standard mutation data matrices, which have not been updated for 13 years. The method is fast enough to process the entire SWISS-PROT databank in 20 h on a Sun SPARCstation 1, and is fast enough to generate a matrix from a specific family or class of proteins in minutes. Differences observed between our 250 PAM mutation data matrix and the matrix calculated by Dayhoff et al. are briefly discussed.
9402109
Toward a Scoring Function for Quality-Driven Machine Translation
We describe how we constructed an automatic scoring function for machine translation quality; this function makes use of arbitrarily many pieces of natural language processing software that has been designed to process English language text. By machine-learning values of functions available inside the software and by constructing functions that yield values based upon the software output, we are able to achieve preliminary, positive results in machine-learning the difference between human-produced English and machine-translation English. We suggest how the scoring function may be used for MT system development.
31768671
Protein fold recognition
SummaryAn important, yet seemingly unattainable, goal in structural molecular biology is to be able to predict the native three-dimensional structure of a protein entirely from its amino acid sequence. Prediction methods based on rigorous energy calculations have not yet been successful, and best results have been obtained from homology modelling and statistical secondary structure prediction. Homology modelling is limited to cases where significant sequence similarity is shared between a protein of known structure and the unknown. Secondary structure prediction methods are not only unreliable, but also do not offer any obvious route to the full tertiary structure. Recently, methods have been developed whereby entire protein folds are recognized from sequence, even where little or no sequence similarity is shared between the proteins under consideration. In this paper we review the current methods, including our own, and in particular offer a historical background to their development. In addition, we also discuss the future of these methods and outline the developments under investigation in our laboratory.
38666741
On Matchings in Graphs