Results 1  10
of
87,613
Ieee Trans. On Uffc 1
"... It is well known that low frequency noises (flicker FM and random walk FM) are not stationary: it is not possible to define either the mean value or the (true) variance. Therefore, the use of a stationary approach yields convergence problems unless a low cutoff frequency is introduced, the physical ..."
Abstract
 Add to MetaCart
It is well known that low frequency noises (flicker FM and random walk FM) are not stationary: it is not possible to define either the mean value or the (true) variance. Therefore, the use of a stationary approach yields convergence problems unless a low cutoff frequency is introduced, the physical meaning of which is not clear. As an example, in the case of random walk FM, the mean frequency of an oscillator does not converge if the analysis duration tends toward infinity. On the other hand, linear drifts appear if a phase sequence of random walk FM is observed over a duration smaller than the inverse of its low cutoff frequency. Moreover, the estimators which are devoted to these non stationary processes (i.e. the Hadamard variance) are insensitive to linear frequency drifts and converge for lower frequency noises ( FM). The moment condition explains the link between insensitivity to drifts and convergence for low frequency noises in a stationary approach. This condition may be summarized by the following consideration : the divergence effect of a low frequency noise for the lowest frequencies induces a false drift with random drift coefficients; the lower the low cutoff frequency, the higher the variance of the coefficients of this drift. These variances may be known by theoretical calculations. The order of the drift is directly linked to the power law of the noise. The moment condition will be demonstrated and applied for creating new estimators (new variances) and for simulating low frequency noises with a very low cutoff frequency. I.
IEEE Trans. on Software Eng. 20,
"... ions Based on Software Specifications", J. of Software Testing, Verification and Reliability 1, 4 (1992), 3955. This paper shows how to adapt conventional whitebox strategies to test components specified in a RESOLVElike manner. The strategy then becomes specificationbased, rather than code ..."
Abstract
 Add to MetaCart
ions Based on Software Specifications", J. of Software Testing, Verification and Reliability 1, 4 (1992), 3955. This paper shows how to adapt conventional whitebox strategies to test components specified in a RESOLVElike manner. The strategy then becomes specificationbased, rather than codebased. Theoretical and empirical evaluations of this approach are discussed. [Zweben 94] Zweben, S.H., Edwards, S.H., Weide, B.W., and Hollingsworth, J.E., The Effects of Layering and Encapsulation on Software Development Cost and Quality, OSUCISRC4/94TR21, Dept. of Comp. and Inf. Sci., Ohio State Univ., Columbus, Apr. 1994. [OSUFTP]. Submitted for publication; currently in revision. This report discusses three controlled experiments designed to gather empirical evidence supporting the practice of layering newly written code on top of earlier encapsulated components, rather than simply adding code to old modules. The results of the experiments support the contention that layering significant...
To Appear: IEEE Trans. on Image Processing
"... Abstract—In this paper, we propose a novel contourbased shape descriptor, named Multiscale Distance Matrix (MDM), to capture shape geometry while being invariant to translation, rotation, scaling, and bilateral symmetry. The descriptor is further combined with dimensionality reduction to improve it ..."
Abstract
 Add to MetaCart
Abstract—In this paper, we propose a novel contourbased shape descriptor, named Multiscale Distance Matrix (MDM), to capture shape geometry while being invariant to translation, rotation, scaling, and bilateral symmetry. The descriptor is further combined with dimensionality reduction to improve its discriminative power. The proposed method avoids the timeconsuming pointwise matching used in most of the previous shape recognition algorithms. It is therefore fast and suitable for realtime applications. We applied the proposed method to the task of plan leaf recognition with experiments on two datasets: the Swedish Leaf dataset and the ICL Leaf dataset. The experimental results demonstrate clearly the effectiveness and efficiency of the proposed descriptor. Index Terms—Shape recognition, plant leaf, multiscale distance matrix, inner distance, cost matrix I.
IEEE TRANS. MED. IMAG. 1
"... Abstract—This paper introduces two realtime elastography techniques based on analytic minimization (AM) of regularized cost functions. The first method (1D AM) produces axial strain and integer lateral displacement, while the second method (2D AM) produces both axial and lateral strains. The cost f ..."
Abstract
 Add to MetaCart
Abstract—This paper introduces two realtime elastography techniques based on analytic minimization (AM) of regularized cost functions. The first method (1D AM) produces axial strain and integer lateral displacement, while the second method (2D AM) produces both axial and lateral strains. The cost functions incorporate similarity of RF data intensity and displacement continuity, making both AM methods robust to small decorrelations present throughout the image. We also exploit techniques from robust statistics to make the methods resistant to large local decorrelations. We further introduce Kalman filtering for calculating the strain field from the displacement field given by the AM methods. Simulation and phantom experiments show that both methods generate strain images with high SNR, CNR and resolution. Both methods work for strains as high as 10% and run in realtime. We also present invivo patient trials of ablation monitoring. An implementation of the 2D AM method as well as phantom and clinical RFdata can be downloaded from
spatial Green’s function for the thickmicrostrip substrate, ” IEEE Trans.
"... high frequency integrated circuits incorporating full wave analysis of microstrip discontinuities, ” IEEE Trans.Microw. Theory Tech., vol. 41, no. 5, pp. 848–854, May 1993. [12] R. A. Kipp and C. H. Chan, “Complex image method for sources in bounded regions of multilayer structures, ” IEEE Trans. Mi ..."
Abstract
 Add to MetaCart
high frequency integrated circuits incorporating full wave analysis of microstrip discontinuities, ” IEEE Trans.Microw. Theory Tech., vol. 41, no. 5, pp. 848–854, May 1993. [12] R. A. Kipp and C. H. Chan, “Complex image method for sources in bounded regions of multilayer structures, ” IEEE Trans
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 749 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
General tensor discriminant analysis and Gabor featuresforgaitrecognition,”IEEE Trans
 Pattern Anal. Mach. Intell
, 2007
"... Abstract — The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem (USP): the dimensionality of the feature space is much higher than the number of training samples. Motivated by ..."
Abstract

Cited by 101 (11 self)
 Add to MetaCart
Abstract — The traditional image representations are not suited to conventional classification methods, such as the linear discriminant analysis (LDA), because of the under sample problem (USP): the dimensionality of the feature space is much higher than the number of training samples. Motivated by the successes of the two dimensional LDA (2DLDA) for face recognition, we develop a general tensor discriminant analysis (GTDA) as a preprocessing step for LDA. The benefits of GTDA compared with existing preprocessing methods, e.g., principal component analysis (PCA) and 2DLDA, include 1) the USP is reduced in subsequent classification by, for example, LDA; 2) the discriminative information in the training tensors is preserved; and 3) GTDA provides stable recognition rates because the alternating projection optimization algorithm to obtain a solution of GTDA converges, while that of 2DLDA does not. We use human gait recognition to validate the proposed GTDA. The averaged gait images are utilized for gait representation. Given the popularity of Gabor function based image decompositions for image understanding and object recognition, we develop three different Gabor function based image representations: 1) the GaborD representation is the sum of Gabor filter responses over directions, 2) GaborS is the sum of Gabor filter responses over scales, and 3) GaborSD is the sum of
Results 1  10
of
87,613