13547856
CT Image of Liver Cancer Enhancement Using Wavelet Transform
28940488
Wavelt Transform Application of Video Coding at Very Low Bit Rate
28062426
Radar Detection of Minimum Altitude Flying Targets Based on Wavelet Transforms
17770433
A generalized expansion matching based feature extractor
A novel and efficient generalized feature extraction method is presented based on the expansion matching (EXM) method and the Karhunen-Loueve (KL) transform. The EXM method is used to design optimal detectors for different features. The KL representation is used to define an optimal basis for representing these EXM feature detectors with minimum truncation error. Input images are then analyzed with the resulting KL basis set. The KL coefficients obtained from the analysis are used to efficiently reconstruct the response due to any combination of feature detectors. The method is applied to real images and successfully extracts a variety of arc and edge features as well as complex junction features formed by combining two or more arc or line features.
8322734
Good equidistant codes constructed from certain combinatorial designs
An (n,M,d;q) code is called equidistant code if the Hamming distance between any two codewords is d. It was proved that for any equidistant (n,M,d;q) code, d=
40556933
The solution of a nonlinear partial difference equation
Abstract In this paper we derive the solution of a nonlinear partial difference equation that arises in the recursive determination of the value of a multi-stage game called “Women and cats versus mice and men”. Using the solution we obtain the optimal strategies and optimal battle arrays of both players. Finally, we give some interpretations in terms of the game to our results.
122560994
Fast discrete sine transform algorithms
Abstract A novel type of algorithms for the discrete sine transform (DST) are introduced in this paper. By using a basic trigonometric identity, these algorithms realize a successive reduction of the summation size in a simple manner, and therefore cause a very simple structure. The indexing of this algorithm involves the Hadamard order, the generation of which is given in this paper. These algorithms use cosines and sines as multipliers. It will cause less computational error than those algorithms with secant multipliers. The multipliers can be generated recursively in a simple way, without the need of referring to any trigonometric functions. Fortran subroutines to compute various types of the DST are provided.
15697716
Walk to here: a voice driven animation system
We present a novel interface for directing the actions of computer animated characters and camera movements. Our system takes spoken input in combination with mouse pointing to generate desired character animation based on motion capture data. The aim is to achieve a more natural animation interface by supporting the types of dialogue and pointing that might be used when one person is explaining a desired motion to another person. We compare our voice-driven system with a button-driven animation interface that has equivalent capabilities. An informal user study indicates that for the test scenarios, the voice-user interface (VUI) is faster than an equivalent graphical user interface (GUI). Potential applications include storyboarding for film or theatre, directing characters in video games, and scene reconstruction.