image enhancement for breast cancer screening

... (in either the image domain or the transform domain) It is possible to derive a condition for the minimum average number of bits required for encoding the transform coe cients for a given total ... for large numbers of bits for quantization of the transform coe cients Regardless, the discrete nature of most images at the outset could be used to advantage in lossless recovery from transform ... be used for e cient computation of the DCT 11.6.2 The Karhunen{Loeve transform The KLT, also known as the principal-component transform, the Hotelling transform, or the eigenvector transform 9,...

Ngày tải lên: 27/05/2016, 15:50

... choice for all these parameters can be found experimentally to achieve the best possible modeling performance (example values are given in Section for the particular waveforms we used for testing ... signals using the reference signals, without any additional information Here we propose using some additional information for each microphone for achieving good-quality resynthesis (above 3.0 perceptual ... encoded for transmission, based on previous work of [18] derived for coding of speech LSF parameters In Section 5, objective and subjective results are provided for both the model and coding performance...

Ngày tải lên: 22/06/2014, 00:20

... received image (e.g., a minimum tolerated PSNR between the original and the forged image is allowed), it is possible to transmit the hash without the need of a feedback channel, performing rate ... Therefore, we can perform lossy encoding with side information at the decoder, where the source to be encoded is y and the “noisy” random projections y = Ax play the role of the side information ... bit-rate for the hash are shown in Tables (for 200 bps) and (for 400 bps) The bit rate depends on the number of measurements m (given in Table 1) and on the number of bitplanes per measurement J For...

Ngày tải lên: 22/06/2014, 00:20

... bit-plane EYi will be used as side information for decoding For each bit-plane, the conditional entropy (b) Hc,i = H(EXi | EY(b) ) is assumed to be known i (b) For each bit-plane EXi , the encoder ... algorithm for Cuprite, Lunar, and Jasper images as well as the average value relating to the three scenes, while Figure depicts the computing times per band, averaged over the three images for both ... average compression performance of DSC-CALIC is similar to that of s-DSC The vector extension has improved performance, but also improved complexity Therefore, it turns out that, for the application...

Ngày tải lên: 22/06/2014, 23:20

... coding performance at rate rs Using different k’s, there is no performance difference4 at very low Es /N0 (since Pb (k) for all k), however, since rs is higher for larger k, the system performance ... /N0 performance of using our JSCC system for transmitting the SPIHT compressed 512 ¢ 512 Lena image using 65,536 symbols Figure 4: PSNR versus Es /N0 performance of our adaptive TCM system for transmitting ... D(rs ) of SPIHT for the 512 ¢ 512 Lena image (with L = 5122 ), which is monotonically nonincreasing As the source image is progressively compressed by the SPIHT Since the SPIHT image coder is...

Ngày tải lên: 22/06/2014, 23:20

... suggestion the work was undertaken), for his interest and advice; and to Arthur Wadsworth, Esq., Chief Librarian for the Parliament of the Commonwealth, for his courteous assistance GWENDOLEN ... his search for fresh fields for trade, he came upon Tasmania and New Zealand Journal or description drawn up by me, ABEL JAN TASMAN, of a Voyage made from the town of Batavia in E India for the ... between these rocks and the land We came before a way which seemed likely to afford a good anchorage upon which we resolved to run into it We again made for the shore, the wind and current having...

Ngày tải lên: 06/03/2014, 03:21

... problems for this case will be described in detail Because eq 3b will generate a poorer fit to the data than eq 3a, the error estimate for eq 3b, σ′ , must be (much) larger ij than that for eq ... for the data in this study was from 08/20/00 to 09/08/00, and the most sampling frequencies were about 1/4-6 min-1, but the frequencies for some periods were min-1 All the samples were used for ... the detection limit Therefore, it may not be possible to make any quantitative attributions for this compound Because of the same reason, the scaled residual errors for c13-benzenes in Figure...

Ngày tải lên: 22/03/2014, 14:20

... perturbation of the misfit function for the modified subfault, reducing the computation time for the simulated annealing process Moreover, we perform the forward problem very efficiently because ... of data, we could complicate the model that we use for the forward problem For example, it is possible to consider a different rise-time value for each subfault STF, or a non-constant rupture velocity ... especially A Rigo, for accurate focal mechanism determinations, C Wajeman for moment calculations and H Lyon-Caen for her help in retrieving data We would also like to thank Scotti for a critical...

Ngày tải lên: 23/03/2014, 13:20

... used to estimate the optimal DCM order P for each sequence of K LSF vectors For this, a performance criterion for the overall process is first defined This performance criterion is the usual Average ... we go towards lower bit rates For instance, at 2.4 dB, we have about 346 bits/s for the LT coding, 456 bits/s for the KLT, 476 bits/s for the 2DDCT, and 630 bits/s for the frame-by-frame quantization ... the two 2D-transform coding techniques At 375 bits/s this gain reaches respectively 15.8% and 18.1% (2.30 dB for the LT coding, 2.73 dB for the KLT, and 2.81 dB for the 2D-DCT) For unvoiced sections,...

Ngày tải lên: 21/06/2014, 16:20

... compared Performances between the algorithms are quite similar for the MR images SPIHT-RARS outperforms JPEG2000 on the CT images, but JPEG2000 gives a lower bit rate for hyperspectral images It ... original 5/3 wavelet transform gives better results for the medical images while the modified transform performs better on hyperspectral images Table compares the lossy performances of the two algorithms ... scalability is necessary for the full image, we need to provide the most significant bits for one block before finishing the previous one This could be obtained by cutting the bitstream for all blocks and...

Ngày tải lên: 22/06/2014, 00:20

... guided envelope shaping mode of the MPS coder that performs best as to audio quality for applause signals and uses about kbps for parameters [14] For coding the stereo down-mix signal, a state-of-the-art ... implementation that achieved a high audio quality in informal listening experiments for the multichannel applause signals at our disposal For each of these signals, its five input channels sounded ... spatial image or the timbre, so that listeners might be a too small number for a truly representative listening test In the listening test, we observed that the MUSHRA score dropped by 15 points for...

Ngày tải lên: 22/06/2014, 19:20

... evaluation was performed as will be explained in Section Before performing the subjective evaluation, the signal has to be reconstructed The reconstruction process is a straight forward process ... though in existence for quite some time for audio and speech coding, received much attention recently with its inclusion in the MPEG-4 audio standard for low-bitrate applications The formal verification ... Hence, the masking curve obtained for kHz was used as the lookup table for the first 20 critical bands The remaining critical bands use the masking curve obtained for the critical band with a centre...

Ngày tải lên: 22/06/2014, 19:20

... the original image and the reconstructed image; for 3D images, typically an SNR is used where 2552 in (1) is replaced by the Figure 5: Rate-distortion performance for the 2D “barbara” image comparing ... in terms of bits per pixel (bpp) for 2D images and typically bits per voxel (bpv) for 3D imagery (equivalently bits per pixel per band (bpppb) for hyperspectral imagery consisting of multiple spectral ... place without the need for “side information” between the forward and inverse transforms Although explicitly describing the adaption decisions made at the forward transform permits easy implementation...

Ngày tải lên: 22/06/2014, 19:20

... row-columnframe (RCF) transform require [N + 1/2N + 1/4N ] = 1.75N DCTs for one cube The same is true for the inverse transform The encoder needs only the lowest coefficients of 1DDCT For this reason, we ... block 3D transform The transform coefficients are uniformly quantized with the quantization step Qr and split between two descriptions in a pattern shown in Figure 2(b) Two different transforms are ... hybrid transform is used for coding the residual As LOT is by definition an orthogonal transform, mean-squared error distortion in spatial domain is equal to the distortion in the transform domain...

Ngày tải lên: 22/06/2014, 22:20

... been coded This corresponds to 24 bits (1 for the most significant bit and 23 for the magnitude refinement bits) for untransformed data For wavelet transformed data, an extra pass is included to ... bit-plane-1 values for the wavelet transformed data Therefore untransformed data has active bits in less than 9% (24/278 × 100) of the total bit planes Thus it is expected for floating-point data, ... case emphasized in the literature for floating-point compression The results of the proposed algorithm are for the two cases of untransformed and wavelet transformed image data, labeled nowave and...

Ngày tải lên: 22/06/2014, 22:20

... applied in the image domain and improve the side information in the transform domain For our experiments, the camera positions are unaltered in time Therefore, the disparity information is estimated ... correlated image sequences, we mention related works of applied research on distributed image coding For example, [27] enhances analog image transmission systems using digital side information, ... with side information, and enhancing the side information by disparity compensation Section studies the efficiency of video coding with video side information Based on a model for transform coded...

Ngày tải lên: 22/06/2014, 23:20

... possible since the wavelet transform compacts the important information in a few blocks (subbands) of transform coefficients This strategy seems to be naturally more suitable for MD coding since it allows ... layers for the nth bitplane are transmitted immediately after the transmission of significance layers for the same bitplane Note that each layer contains significant or refinement information for a ... = max{l ∈ I : li=1 Ri ≤ RB /2} (smallest value for L∗ ) L2 = max{l ∈ I : li=1 Ri ≤ RB } (largest value for L∗ ) L∩ = L1 (initial value for L∩ ) for L = L1 , , L2 (all possible values of L...

Ngày tải lên: 22/06/2014, 23:20

... (5), and then perform a scaling adjustment to minimize the windowing error described in Section 4.2 before multiplying a Hanning window for the spectral smoothing We measured SIRs for three permutation ... we propose a method for localizing source signals by using the ICA solution with nearfield and far-field models The geometric information obtained with our method is useful for solving the permutation ... = H j i( f ) W−1 ( f )D−1 ( f ) 2.2 Solutions for permutation problem There are various methods for solving the permutation problem Geometric information, such as beam patterns [17, 19, 20],...

Ngày tải lên: 22/06/2014, 23:20

... with 230 time frames for different numbers of sources and sensors The simulations for Figure were performed on a 2.4 GHz PC based on random data and mixing matrices One reason for the big difference ... applying a short-time Fourier transform (STFT) While a wideband approach would be desirable, extension of the proposed method is not as straightforward as described for example in [18] This is because ... other mixing vectors stemming from other sources Therefore the mixtures will be spread around the mixing vectors but still form clusters for each source 3.1 Hierarchical clustering To avoid the...

Ngày tải lên: 22/06/2014, 23:20

... algorithms for image denoising [7], image compression [27], and preprocessing for image recognition This suggests that using sparse coding on spectrotemporal data might well lead to better algorithms for ... however, the first 200 components that are used for learning account for more than 90% of the total variance of the data We previously reported that the form of the lowest components is also robust ... selectivity for specific modulations along the temporal or the spectral axis Figure 3b quantifies this selectivity for the spectral domain and shows how the spectral characteristics of the Fourier transform...

Ngày tải lên: 23/06/2014, 01:20