[PDF] Top 20 La violencia escolar a través del discurso periodístico

... The binary image is processed to extract the postal stamp and other graphics parts present in the image. There are many techniques for text/graphics separation. For removing the non text part( Postal seal and postal ... See full document

... image segmentation and smoothing method based on the M – S functional has been investigated in this ...contour length minimis- ...the algorithm in a noisy ...tion algorithm based on a ... See full document

... ‘snake’ algorithm for image segmentation based on the optimisation of a linear functional in which three terms were ...image segmentation known as ‘geodesic active contour’ model for single- and ... See full document

... Run Length Encoding, referred to as RLE algorithm, is a lossless data compression ...the length of the total byte string and achieving the purpose of ...the length of the original ... See full document

... Here, let‟s take the example of image and perform the run length encoding. There will be too much long runs of white pixels, and short runs of black pixels. Let us take a single scan line or row of image ... See full document

... upper bound, we mean the largest possible upper bound for s to gain statistical optimality. This result is established by directly computing (non-asymptotic) upper and lower bounds of mean squared error of ¯ f . These ... See full document

... by segmentation process in which wavelet transform is used to perform multi-resolution time frequency analysis by selecting different kernel resolutions and this makes wavelets an effective tool for performing ... See full document

... The Optimized Run Length Coding [17] uses a pair of (RUN, LEVELS) only when a pattern of consecutive zeros occur at the input of the encoder. The non-zero digits are encoded as their respective ... See full document

... An efficient RDH method is based on prediction error histogram. In PEE method we calculate the pixel value of each pixel, prediction value and complexity measurement then the histograms are generated by counting the ... See full document

... In wavelet analysis, the situation is quite subtle: Since neighboring points in time and scale are correlated (see Ap- pendix A), the wavelet periodogram looks smooth. However, fluctuations around the true WPS are not ... See full document

... By the above equations the FLBP converts a 3×3 window neighboring pixel values into the FLBP set, i.e., FLBP {0, 0.1, 0.2, 0.3, 0.4, . . . ,1}. The average membership values of FLBP neighboring pixels are useful for ... See full document

... Digital images are having a very significant role in sciences. Digital images (biometric images) are produced by the mechanism of digital imaging which is the process of creating images of the human body or parts of the ... See full document

... [8]’s algorithm is compara- ble to our algorithm. That algorithm has to deal with the term (ˆ k `) ˆ whereas our algorithm uses R to solve the same ...our algorithm outperforms Sakai ... See full document

... on run length count is proposed to remove the noise from the ...proposed algorithm. It is observed that the proposed algorithm outperforms the existing methods in removing the noise present in ... See full document

... hybrid algorithm obtained by merging deformable model with region growing techniques was presented ...based algorithm was proposed in[3], that incorporates a priori knowledge through Bayesian ...based ... See full document

... correct segmentation results of hepatic ...region-growing algorithm that has been widely used for hepatic vessel segmentation, fuzzy connectedness method has advan- tages in detecting vascular edge ... See full document

... lossless algorithm, while the non-ROI region is compressed using a lossy ...lossy algorithm that combines Discrete Wavelet Packet Transformation (DWPT), Singular Value Decomposition (SVD) and enhanced ... See full document

... Otsu algorithm is used to carry out high and low ...improved algorithm can detect the edge details more perfectly in the rail image edge detection, and can also suppress noise, and has strong ... See full document

... We follow the setup in BK04 as closely as possible, but several issues make a direct comparison difficult. Chief among these is their use of a physical ISM cooling prescription. We implement a similar algorithm ... See full document

... This algorithm could possibly cause problems with something like "mi" -- with a poorly scanned "m", the joined character could be broken in the middle of the "m", find an "n", and ... See full document