Computerized synthesis of the structure of geared kinematic chains

The paper presents for the first time a fully computerized method for structural synthesis of geared kinematic chains which can be used to derive epicyclic gear drives. The method has been formulated on the basis of representing these chains by their graphs, the graphs being in turn represented algebraically by their vertex-vertex incidence matrices. It has thus been possible to make advantageous use of concepts and results from graph theory to develop a method amenable for implementation on a digital computer. The computerized method has been applied to the structural synthesis of single-freedom geared kinematic chains with up to four gear pairs, and the results obtained thereform are presented and discussed.

A computerized methodology for structural synthesis of kinematic chains: Part 1- Formulation

In an effort to develop a fully computerized approach for structural synthesis of kinematic chains the steps involved in the method of structural synthesis based on transformation of binary chains [38] have been recast in a format suitable for implementation on a digital computer. The methodology thus evolved has been combined with the algebraic procedures for structural analysis [44] to develop a unified computer program for structural synthesis and analysis of simple jointed kinematic chains with a degree of freedom 0. Applications of this program are presented in the succeeding parts of the paper.

A computerized methodology for structural synthesis of kinematic chains: Part 2 - Application to several fully or partially known cases

The reliability of the computer program for structural synthesis and analysis of simple-jointed kinematic chains developed in Part 1 has been established by applying it to several cases for whuch solutions are either fully or partially available in the literature, such as 7-link, zero-freedom chains; 8- and 10-link, single-freedom chains; 12-link, single-freedom binary chains; and 9-link, two-freedom chains. In the process some discrepancies in the results reported in previous literature have been brought to light.

A computerized methodology for structural synthesis of kinematic chains: Part 3 - application to the new case of 10-link, three- freedom chains

The unified computer program for structural synthesis and analysis developed in Part 1 has been employed to derive the new and complete collection of 97 10-link, three-freedom simple-jointed kinematic chains. The program shows that of these chains, 3 have total freedom, 70 have partial freedom and the remaining 24 have fractionated freedom and that the 97 chains yield a total of 676 distinct mechanisms.

Mesh Processing for Computerized Facial Anthropometry

Understanding of the shape and size of different features of the human body from scanned data is necessary for automated design and evaluation of product ergonomics. In this paper, a computational framework is presented for automatic detection and recognition of important facial feature regions, from scanned head and shoulder polyhedral models. A noise tolerant methodology is proposed using discrete curvature computations, band-pass filtering, and morphological operations for isolation of the primary feature regions of the face, namely, the eyes, nose, and mouth. Spatial disposition of the critical points of these isolated feature regions is analyzed for the recognition of these critical points as the standard landmarks associated with the primary facial features. A number of clinically identified landmarks lie on the facial midline. An efficient algorithm for detection and processing of the midline, using a point sampling technique, is also presented. The results obtained using data of more than 20 subjects are verified through visualization and physical measurements. A color based and triangle skewness based schemes for isolation of geometrically nonprominent features and ear region are also presented. [DOI: 10.1115/1.3330420]

Image reconstruction with laterally truncated projections in helical cone-beam CT: Linear prediction based projection completion techniques

Lateral or transaxial truncation of cone-beam data can occur either due to the field of view limitation of the scanning apparatus or iregion-of-interest tomography. In this paper, we Suggest two new methods to handle lateral truncation in helical scan CT. It is seen that reconstruction with laterally truncated projection data, assuming it to be complete, gives severe artifacts which even penetrates into the field of view. A row-by-row data completion approach using linear prediction is introduced for helical scan truncated data. An extension of this technique known as windowed linear prediction approach is introduced. Efficacy of the two techniques are shown using simulation with standard phantoms. A quantitative image quality measure of the resulting reconstructed images are used to evaluate the performance of the proposed methods against an extension of a standard existing technique.

In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains

The test based on comparison of the characteristic coefficients of the adjancency matrices of the corresponding graphs for detection of isomorphism in kinematic chains has been shown to fail in the case of two pairs of ten-link, simple-jointed chains, one pair corresponding to single-freedom chains and the other pair corresponding to three-freedom chains. An assessment of the merits and demerits of available methods for detection of isomorphism in graphs and kinematic chains is presented, keeping in view the suitability of the methods for use in computerized structural synthesis of kinematic chains. A new test based on the characteristic coefficients of the “degree” matrix of the corresponding graph is proposed for detection of isomorphism in kinematic chains. The new test is found to be successful in the case of a number of examples of graphs where the test based on characteristic coefficients of adjancency matrix fails. It has also been found to be successful in distinguishing the structures of all known simple-jointed kinematic chains in the categories of (a) single-freedom chains with up to 10 links, (b) two-freedom chains with up to 9 links and (c) three-freedom chains with up to 10 links.

New Concepts for PVC Detection

A new scheme is proposed for the detection of premature ventricular beats, which is a vital function in rhythm monitoring of cardiac patients. A transformation based on the first difference of the digitized electrocardiogram (ECG) signal is developed for the detection and delineation of QRS complexes. The method for classifying the abnormal complexes from the normal ones is based on the concepts of minimum phase and signal length. The parameters of a linear discriminant function obtained from a training feature vector set are used to classify the complexes. Results of application of the scheme to ECG of two arrhythmia patients are presented.

Homomorphic Analysis and Modeling of ECG Signals

Homomorphic analysis and pole-zero modeling of electrocardiogram (ECG) signals are presented in this paper. Four typical ECG signals are considered and deconvolved into their minimum and maximum phase components through cepstral filtering, with a view to study the possibility of more efficient feature selection from the component signals for diagnostic purposes. The complex cepstra of the signals are linearly filtered to extract the basic wavelet and the excitation function. The ECG signals are, in general, mixed phase and hence, exponential weighting is done to aid deconvolution of the signals. The basic wavelet for normal ECG approximates the action potential of the muscle fiber of the heart and the excitation function corresponds to the excitation pattern of the heart muscles during a cardiac cycle. The ECG signals and their components are pole-zero modeled and the pole-zero pattern of the models can give a clue to classify the normal and abnormal signals. Besides, storing only the parameters of the model can result in a data reduction of more than 3:1 for normal signals sampled at a moderate 128 samples/s

Detection of edges from projections

In a number of applications of computerized tomography, the ultimate goal is to detect and characterize objects within a cross section. Detection of edges of different contrast regions yields the required information. The problem of detecting edges from projection data is addressed. It is shown that the class of linear edge detection operators used on images can be used for detection of edges directly from projection data. This not only reduces the computational burden but also avoids the difficulties of postprocessing a reconstructed image. This is accomplished by a convolution backprojection operation. For example, with the Marr-Hildreth edge detection operator, the filtering function that is to be used on the projection data is the Radon transform of the Laplacian of the 2-D Gaussian function which is combined with the reconstruction filter. Simulation results showing the efficacy of the proposed method and a comparison with edges detected from the reconstructed image are presented

ECG component delineation by Prony's method

A simple, non-iterative method for component wave delineation from the electrocardiogram (ECG) is derived by modelling its discrete cosine transform (DCT) as a sum of damped cosinusoids. Amplitude, phase, damping factor and frequency parameters of each of the cosinusoids are estimated by the extended Prony method. Different component waves are represented by non-overlapping clusters of model poles in the z plane and thus a component wave is derived by the addition of the inverse transformed (IDCT) impulse responses of the poles in the cluster. Akaike's information criterion (AIC) is used to determine the model order. The method performed satisfactory even in the presence of artifacts. The efficacy of the method is illustrated by analysis of continuous strips of ECG data.

Digital simulation of galvanostatic current-potential data for gas-diffusion electrodes and estimation of electrodekinetic parameters

A computerized non-linear-least-squares regression procedure to analyse the galvanostatic current-potential data for kinetically hindered reactions on porous gas-diffusion electrodes is reported. The simulated data fit well with the corresponding measured values. The analytical estimates of electrode-kinetic parameters and uncompensated resistance are found to be in good agreement with their respective values obtained from Tafel plots and the current-interrupter method. The procedure circumvents the need to collect the data in the limiting-current region where the polarization values are usually prone to errors. The polarization data for two typical cases, namely, methanol oxidation on a carbon-supported platinum-tin electrode and oxygen reduction on a Nafion-coated platinized carbon electrode, are successfully analysed.

Image reconstruction from incomplete projections data: A multiresolution modeling approach

Computerized tomography is an imaging technique which produces cross sectional map of an object from its line integrals. Image reconstruction algorithms require collection of line integrals covering the whole measurement range. However, in many practical situations part of projection data is inaccurately measured or not measured at all. In such incomplete projection data situations, conventional image reconstruction algorithms like the convolution back projection algorithm (CBP) and the Fourier reconstruction algorithm, assuming the projection data to be complete, produce degraded images. In this paper, a multiresolution multiscale modeling using the wavelet transform coefficients of projections is proposed for projection completion. The missing coefficients are then predicted based on these models at each scale followed by inverse wavelet transform to obtain the estimated projection data.

Optimal local polynomial regression of noisy time varying signals

We address the problem of local-polynomial modeling of smooth time-varying signals with unknown functional form, in the presence of additive noise. The problem formulation is in the time domain and the polynomial coefficients are estimated in the pointwise minimum mean square error (PMMSE) sense. The choice of the window length for local modeling introduces a bias-variance tradeoff, which we solve optimally by using the intersection-of-confidence-intervals (ICI) technique. The combination of the local polynomial model and the ICI technique gives rise to an adaptive signal model equipped with a time-varying PMMSE-optimal window length whose performance is superior to that obtained by using a fixed window length. We also evaluate the sensitivity of the ICI technique with respect to the confidence interval width. Simulation results on electrocardiogram (ECG) signals show that at 0dB signal-to-noise ratio (SNR), one can achieve about 12dB improvement in SNR. Monte-Carlo performance analysis shows that the performance is comparable to the basic wavelet techniques. For 0 dB SNR, the adaptive window technique yields about 2-3dB higher SNR than wavelet regression techniques and for SNRs greater than 12dB, the wavelet techniques yield about 2dB higher SNR.