DOCSLIB.ORG

Examples of Filters

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Examples of Filters Examples of Filters Frequency domain Gaussian lowpass filter Gaussian highpass filter Spatial domain 1 Ideal Low Pass Filtering Low pass filter: Keep frequencies below a certain frequency Low pass filtering causes blurring After DFT, DC components and low frequency components are towards center May specify frequency cutoff as circle c Ideal Low Pass Filtering Multiply Image Fourier Transform F by some filter matrix m Shape of ILPF Frequency domain h(x,y) Spatial domain 4 Ideal low-pass filter (ILPF) 1 D(u,v) D0 H(u,v) 0 D(u,v) D0 D( u , v ) [( u M / 2)2 ( v N / 2) 2 ] 1/ 2 (M/2,N/2): center in frequency domain D0 is called the cutoff frequency. 5 Ideal Low Pass Filtering Low pass filtered image is inverse Fourier Transform of product of F and m Example: Consider the following image and its DFT Image DFT Ideal Low Pass Filtering Applying Image after low pass filter inversion to DFT Cutoff D = 15 low pass filter low pass filter Cutoff D = 5 Cutoff D = 30 Note: Sharp filter Cutoff causes ringing FT ringing and Ideal in frequency blurring domain means non-ideal in spatial domain, vice versa. 8 9 10 Butterworth Lowpass Filters (BLPF) • Smooth transfer function, 1 no sharp discontinuity, H (u,v) 2n D(u,v) no clear cutoff 1 D frequency. 0 1 2 11 Butterworth Lowpass Filters (BLPF) 1 H (u,v) 2n D(u,v) 1 D0 n=1 n=2 n=5 n=20 h(x) 12 No serious ringing artifacts 13 Top: Original image. Bottom: Image filtered with 5th order Butterworth lowpass filter. Gaussian Lowpass Filters (GLPF) • Smooth transfer function, D2 (u,v) smooth impulse 2 response, no ringing H(u,v) e 2D 0 15 GLPF Frequency domain Gaussian lowpass filter Spatial domain 16 No ringing artifacts 17 18 19 Examples of Lowpass Filtering 20 Examples of Lowpass Filtering Low-pass filter H(u,v) Original image and its FT Filtered image and its FT 21 Ideal High Pass Filtering Opposite of low pass filtering: eliminate center (low frequency values), keeping others High pass filtering causes image sharpening If we use circle as cutoff again, size affects results Large cutoff = More information removed DFT of Image after Resulting image high pass Filtering after inverse DFT High-pass Filters • Hhp(u,v)=1-Hlp(u,v) 1 D(u,v) D0 • HIdeal:(u,v) 0 D(u,v) D0 2 1 • Butterworth: | H (u,v) | 2n D0 1 D(u,v) D2 (u,v)/2D2 • Gaussian: H(u,v) 1e 0 23 Ideal High Pass Filtering: Effect of Cutoffs Low cutoff High pass filtering frequency removes of DFT with filter Only few lowest Cutoff D = 5 frequencies High cutoff High pass filtering frequency removes of DFT with filter many frequencies, Cutoff D = 30 leaving only edges Images taken from Gonzalez & Woods, Digital Image Processing (2002) emphasisHigh frequency Original result image Highpass Filtering Example result equalisation filtering Highpass histogram histogram After After 26 High-pass Filters h(x,y) 27 Ideal High-pass Filtering ringing artifacts 28 29 30 Butterworth Filtering Sharp cutoff leads to ringing To avoid ringing, can use circle with more gentle cutoff slope Butterworth filters have more gentle cutoff slopes Ideal low pass filter Butterworth low pass n = 2 n = 4 filter n called order of the filter, controls sharpness of cutoff Butterworth High Pass Filtering Ideal high pass filter Butterworth n = 2 n = 4 hig h pass filter Low Pass Butterworth Filtering Low pass filtering removes high frequencies, blurs image Gentler cutoff eliminates ringing artifact DFT of Image after low Resulting image pass Butterworth filtering after inverse DFT High Pass Butterworth Filtering DFT of Image after high Resulting image pass Butterworth filtering after inverse DFT Butterworth High-pass Filtering 35 • It is possible increase the sharpness of an image by boosting the power in the edges, which means boosting the power in the high frequencies. • This is easily done through a linear combination of the original image with the image resulting from a highpass filter. Top: Original image. Bottom: Image filtered with 3rd order Butterworth sharpening filter, normalized frequency .5, Gp = 1.1, Gs = .8 Gaussian High-pass Filtering Original image Gaussian filter H(u,v) Filtered image and its FT 38 Gaussian High-pass Filtering 39 40 41 42 43 5.4 Periodic Noise Reduction by Frequency Domain Filtering • Periodic noise is due to the electrical or electromechanical interference during image acquisition. • Can be estimated through the inspection of the Fourier spectrum of the image. 5.4 Periodic Noise Reduction by Frequency Domain Filtering • Bandreject filters – Remove or attenuate a band of frequencies. 1 if D(u,v) D0 W / 2 H (u,v) 0 if D0 W / 2 D(u,v) D0 W / 2 1 if D(u,v) D0 W / 2 • D0 is the radius. • D(u, v) is the distance from the origin, and • W is the width of the frequency band. Bandpass filter • Obtained form bandreject filter Hbp(u,v)=1-Hbr(u,v) • The goal of the bandpass filter is to isolate the noise pattern from the original image, which can help simplify the analysis of noise, reasonably independent of image content. Bandreject Filters Periodic Noise Reduction by Frequency Domain Filtering 2D Fourier Transform Examples: Scaling Stretching image => Spectrum contracts And vice versa 2D Fourier Transform Examples: Periodic Patterns Repetitive periodic patterns appear as distinct peaks at corresponding positions in spectrum Enlarging image ( c) causes Spectrum to contract (f) 2D Fourier Transform Examples: Oriented, elongated Structures Man‐made elongated regular patterns in image => appear dominant in spectrum 2D Fourier Transform Examples: Natural Images Repetitions in natural scenes => less dominant than man‐ made ones, less obvious in spectra 2D Fourier Transform Examples: Natural Images Natural scenes with repetitive patterns but no dominant orientation => do not stand out in spectra 2D Fourier Transform Examples: Printed Patterns Regular diagonal patterns caused by printing => Clearly visible/removable in frequency spectrum. Let’s Look at Some Real Images! In this image you have a bunch of cells that are all the This image for example looks ordered but I couldn’t same size but there is no order to their arrangement. tell you exactly what that order is. There are enough of them that they are pretty tightly packed in some regions. After taking a FT of the image it is very apparent This is reflected in the FT image because there is a what sort of order it has and one can determine all circle which represents the average distance they the distances between nearest neighbors just by are from each other but it also shows that there is taking the reciprocal of the distances between a no preferred long range order. dot and the center of the image. The power of FT is that it allows you to take a seemingly complicated image which has an apparent order that is difficult to determine see and break it up into its component sine waves. Fourier Transform Images are from: http://www.cs.unm.edu/~brayer/vision/fourier.html 5.4.3 Notch filters • Notch filter rejects (passes) frequencies in predefined neighborhoods about a center frequency. 0 if D1(u,v) D0 or D2 (u,v) D0 H(u,v) 1 otherwise where 2 2 1/ 2 D1(u,v) (u M / 2u0 ) (v N / 2v0 ) 2 2 1/ 2 D2 (u,v) (u M / 2u0 ) (v N / 2 v0 ) 5.4.3 Notch filters • Butterworth notch filter 1 H (u,v) 2 n D0 1 D1(u,v)D2 (u,v) • Gaussian notch filter 1 D (u,v)D (u,v) 1 2 2 2 H (u,v) 1 e D0 • Note that these notch filters will become highpass when u0=v0=0 Notch filters Example 5.8 Use 1-D Notch pass filter to find the horizontal ripple noise Laplacian in Frequency Domain 2 f (x, y) 2 f (x, y) [ ] (u2 v2)F (u,v) x2 y2 2 2 H1(u,v) (u v ) Frequency Spatial domain 2 2 domain 2 f f f 2 2 Laplacian operator x y 60 61 Subtract Laplacian from the Original Image to Enhance It enhanced Original Laplacian image image output Spatial g(x, y) f (x, y) 2 f (x, y) domain Frequency 2 2 G(u,v) F (u,v) (u v )F (u,v) domain new operator 2 2 H 2(u,v) 1 (u v ) 1 H 1(u,v) Laplacian 62 f 2 f f 2 f 63 64 Unsharp Masking, High-boost Filtering • Unsharp masking: fhp(x,y)=f(x,y)- flp(x,y) One more • H (u,v)=1-H (u,v) parameter to adjust hp lp the enhancement • High-boost filtering: fhb(x,y)=Af(x,y)-flp(x,y) • fhb(x,y)=(A-1)f(x,y)+fhp(x,y) 65• Hhb(u,v)=(A-1)+Hhp(u,v) 66 68 • Wiener filtering incorporates both the degradation function and statistical characteristics of noise into the restoration process • Images and noise are considered as random variables • The objective is to find an estimate ƒ such that the mean square error between them is minimized. • It is assumed that the noise and image are uncorrelated Wiener filtering • In signal processing, the Wiener filter is a filter proposed by Norbert Wiener during the 1940s and published in 1949. • Its purpose is to reduce the amount of noise present in a signal by comparison with an estimation of the desired noiseless signal. • The discrete-time equivalent of Wiener's work was derived independently by Kolmogorov and published in 1941.
Load more

Recommended publications
  • Automatic Detection of Perceived Ringing Regions in Compressed Images
    International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 4, Number 5 (2011), pp. 491-516 © International Research Publication House http://www.irphouse.com Automatic Detection of Perceived Ringing Regions in Compressed Images D. Minola Davids Research Scholar, Singhania University, Rajasthan, India Abstract An efficient approach toward a no-reference ringing metric intrinsically exists of two steps: first detecting regions in an image where ringing might occur, and second quantifying the ringing annoyance in these regions. This paper presents a novel approach toward the first step: the automatic detection of regions visually impaired by ringing artifacts in compressed images. It is a no- reference approach, taking into account the specific physical structure of ringing artifacts combined with properties of the human visual system (HVS). To maintain low complexity for real-time applications, the proposed approach adopts a perceptually relevant edge detector to capture regions in the image susceptible to ringing, and a simple yet efficient model of visual masking to determine ringing visibility. Index Terms: Luminance masking, per-ceptual edge, ringing artifact, texture masking. Introduction In current visual communication systems, the most essential task is to fit a large amount of visual information into the narrow bandwidth of transmission channels or into a limited storage space, while maintaining the best possible perceived quality for the viewer. A variety of compression algorithms, for example, such as JPEG[1] and MPEG/H.26xhave been widely adopted in image and video coding trying to achieve high compression efficiency at high quality. These lossy compression techniques, however, inevitably result in various coding artifacts, which by now are known and classified as blockiness, ringing, blur, etc.
    [Show full text]
  • Analysis of Ringing Artifact in Image Fusion Using Directional Wavelet
    Special Issue - 2021 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 NTASU - 2020 Conference Proceedings Analysis of Ringing Artifact in Image Fusion Using Directional Wavelet Transforms y z x Ashish V. Vanmali Tushar Kataria , Samrudhha G. Kelkar , Vikram M. Gadre Dept. of Information Technology Dept. of Electrical Engineering Vidyavardhini’s C.O.E. & Tech. Indian Institute of Technology, Bombay Vasai, Mumbai, India – 401202 Powai, Mumbai, India – 400076 Abstract—In the field of multi-data analysis and fusion, image • Images taken from multiple sensors. Examples include fusion plays a vital role for many applications. With inventions near infrared (NIR) images, IR images, CT, MRI, PET, of new sensors, the demand of high quality image fusion fMRI etc. algorithms has seen tremendous growth. Wavelet based fusion is a popular choice for many image fusion algorithms, because of its We can broadly classify the image fusion techniques into four ability to decouple different features of information. However, categories: it suffers from ringing artifacts generated in the output. This 1) Component substitution based fusion algorithms [1]–[5] paper presents an analysis of ringing artifacts in application of 2) Optimization based fusion algorithms [6]–[10] image fusion using directional wavelets (curvelets, contourlets, non-subsampled contourlets etc.). We compare the performance 3) Multi-resolution (wavelets and others) based fusion algo- of various fusion rules for directional wavelets available in rithms [11]–[15] and literature. The experimental results suggest that the ringing 4) Neural network based fusion algorithms [16]–[19]. artifacts are present in all types of wavelets with the extent of Wavelet based multi-resolution analysis decouples data into artifact varying with type of the wavelet, fusion rule used and levels of decomposition.
    [Show full text]
  • 2D Signal Processing (III): 2D Filtering
    6.003 Signal Processing Week 11, Lecture A: 2D Signal Processing (III): 2D Filtering 6.003 Fall 2020 Filtering and Convolution Time domain: Frequency domain: 푋[푘푟, 푘푐] ∙ 퐻[푘푟, 푘푐] = 푌[푘푟, 푘푐] Today: More detailed look and further understanding about 2D filtering. 2D Low Pass Filtering Given the following image, what happens if we apply a filter that zeros out all the high frequencies in the image? Where did the ripples come from? 2D Low Pass Filtering The operation we did is equivalent to filtering: 푌 푘푟, 푘푐 = 푋 푘푟, 푘푐 ∙ 퐻퐿 푘푟, 푘푐 , where 2 2 1 푓 푘푟 + 푘푐 ≤ 25 퐻퐿 푘푟, 푘푐 = ቊ 0 표푡ℎ푒푟푤푠푒 2D Low Pass Filtering 2 2 1 푓 푘푟 + 푘푐 ≤ 25 Find the 2D unit-sample response of the 2D LPF. 퐻퐿 푘푟, 푘푐 = ቊ 0 표푡ℎ푒푟푤푠푒 퐻 푘 , 푘 퐿 푟 푐 ℎ퐿 푟, 푐 (Rec 8A): 푠푛 Ω 푛 ℎ 푛 = 푐 퐿 휋푛 Ω푐 Ω푐 The step changes in 퐻퐿 푘푟, 푘푐 generated overshoot: Gibb’s phenomenon. 2D Convolution Multiplying by the LPF is equivalent to circular convolution with its spatial-domain representation. ⊛ = 2D Low Pass Filtering Consider using the following filter, which is a circularly symmetric version of the Hann window. 2 2 1 1 푘푟 + 푘푐 2 2 + 푐표푠 휋 ∙ 푓 푘푟 + 푘푐 ≤ 25 퐻퐿2 푘푟, 푘푐 = 2 2 25 0 표푡ℎ푒푟푤푠푒 2 2 1 푓 푘푟 + 푘푐 ≤ 25 퐻퐿1 푘푟, 푘푐 = ቐ Now the ripples are gone. 0 표푡ℎ푒푟푤푠푒 But image more blurred when compare to the one with LPF1: With the same base-width, Hann window filter cut off more high freq.
    [Show full text]
  • Handout 04 Filtering in the Frequency Domain
    Digital Image Processing (420137), SSE, Tongji University, Spring 2013, given by Lin ZHANG Handout 04 Filtering in the Frequency Domain 1. Basic Concepts (1) Any periodic functions, no matter how complex it is, can be represented as the sum of a series of sine and cosine functions with different frequencies. (2) The signal’s frequency components can be clearly observed in the frequency domain. (3) Fourier transform is invertible. That means after the Fourier transform and the inverse Fourier transform, no information will be lost. (4) Usually, the Fourier transform F(u) is a complex number, from which we can define its magnitude, power spectrum, and the phase angle. (5) The impulse function, or Dirac function, is widely used in theoretical analysis of linear systems. It can be considered as an infinitely high, infinitely thin spike at the origin, with total area one under the spike. (6) Dirac function has a sift property, defined as f ()tttdtft (00 ) ( ). (7) The basic theorem linking the spatial domain to the frequency domain is the convolution theorem, ft()*() ht F ( ) H ( ). (8) The Fourier transform of a Gaussian function is also of a Gaussian shape in the frequency domain. (9) For visualization purpose, we often use fftshift to shift the origin of an image’s Fourier transform to its center position. (10) The basic steps for frequency filtering comprise the following, (11) Edges and other sharp intensity transitions, such as noise, in an image contribute significantly to the high frequency content of its Fourier transform. (12) The drawback of the ideal low-pass filter is that the filtering result has obvious ringing artifacts.
    [Show full text]
  • Video Compression Optimized for Racing Drones
    Video compression optimized for racing drones Henrik Theolin Computer Science and Engineering, master's level 2018 Luleå University of Technology Department of Computer Science, Electrical and Space Engineering Video compression optimized for racing drones November 10, 2018 Preface To my wife and son always! Without you I'd never try to become smarter. Thanks to my supervisor Staffan Johansson at Neava for providing room, tools and the guidance needed to perform this thesis. To my examiner Rickard Nilsson for helping me focus on the task and reminding me of the time-limit to complete the report. i of ii Video compression optimized for racing drones November 10, 2018 Abstract This thesis is a report on the findings of different video coding tech- niques and their suitability for a low powered lightweight system mounted on a racing drone. Low latency, high consistency and a robust video stream is of the utmost importance. The literature consists of multiple comparisons and reports on the efficiency for the most commonly used video compression algorithms. These reports and findings are mainly not used on a low latency system but are testing in a laboratory environment with settings unusable for a real-time system. The literature that deals with low latency video streaming and network instability shows that only a limited set of each compression algorithms are available to ensure low complexity and no added delay to the coding process. The findings re- sulted in that AVC/H.264 was the most suited compression algorithm and more precise the x264 implementation was the most optimized to be able to perform well on the low powered system.
    [Show full text]
  • Filter Effects and Filter Artifacts in the Analysis of Electrophysiological Data
    GENERAL COMMENTARY published: 09 July 2012 doi: 10.3389/fpsyg.2012.00233 Filter effects and filter artifacts in the analysis of electrophysiological data Andreas Widmann* and Erich Schröger Institute of Psychology, University of Leipzig, Leipzig, Germany *Correspondence: [email protected] Edited by: Guillaume A. Rousselet, University of Glasgow, UK Reviewed by: Rufin VanRullen, Centre de Recherche Cerveau et Cognition, France Lucas C. Parra, City College of New York, USA A commentary on unity gain at DC (the step response never FILTER EFFECTS VS. FILTER ARTIFACTS returns to one). These artifacts are due to a We also recommend to distinguish between Four conceptual fallacies in mapping the known misconception in FIR filter design in filter effects, that is, the obligatory effects time course of recognition EEGLAB1. The artifacts are further ampli- any filter with equivalent properties – cutoff by VanRullen, R. (2011). Front. Psychol. fied by filtering twice, forward and back- frequency, roll-off, ripple, and attenuation 2:365. doi: 10.3389/fpsyg.2011.00365 ward, to achieve zero-phase. – would have on the data (e.g., smoothing With more appropriate filters the under- of transients as demonstrated by the filter’s Does filtering preclude us from studying estimation of signal onset latency due to step response), and filter artifacts, that is, ERP time-courses? the smoothing effect of low-pass filtering effects which can be minimized by selection by Rousselet, G. A. (2012). Front. Psychol. could be narrowed down to about 4–12 ms of filter type and parameters (e.g., ringing). 3:131. doi: 10.3389/fpsyg.2012.00131 in the simulated dataset (see Figure 1 and Appendix for a simulation), that is, about an CAUSAL FILTERING In a recent review, VanRullen (2011) con- order of magnitude smaller than assumed.
    [Show full text]
  • Destriping of Landsat MSS Images by Filtering Techniques
    Destriping of Landsat MSS Images by Filtering Techniques Jeng-Jong Panl TGS Technology, Inc., EROS Data Center, Sioux Falls, SD 57198 Chein-I Chang ., Department of Electrical Engineering, University of Maryland, Balhmore County Campus, Balhmore, MD 21228-5398 ABSTRACT: The removal of striping noise encountered in the Landsat Multispectral Scanner (MSS) images can be gen­ erally done by using frequency filtering techniques. Frequency do~ain filteri~g has, how~ver, se,:era~ prob~ems~ such as storage limitation of data required for fast Fourier transforms, nngmg artl~acts appe~nng at hlgh-mt,enslty.dlscon­ tinuities, and edge effects between adjacent filtered data sets. One way for clrcu~,,:entmg the above difficulties IS, to design a spatial filter to convolve with the images. Because it is known that the,stnpmg a.lways appears at frequencies of 1/6, 1/3, and 1/2 cycles per line, it is possible to design a simple one-dimensIOnal spat~a~ fll,ter to take advantage of this a priori knowledge to cope with the above problems. The desired filter is the type of ~mlte Impuls~ response which can be designed by a linear programming and Remez's exchange algorithm coupled ~lth an adaptIve tec,hmque. In addition, a four-step spatial filtering technique with an appropriate adaptive approach IS also presented which may be particularly useful for geometrically rectified MSS images. INTRODUCTION striping lines, it still suffers from several common probleI?s such as a large amount of data storage needed, for .a fast ~our~er HE STRIPING THAT OCCURS IN THE Landsat Multispectral.
    [Show full text]
  • Locally-Adaptive Image Contrast Enhancement Without Noise and Ringing Artifacts
    Locally-adaptive image contrast enhancement without noise and ringing artifacts Citation for published version (APA): Cvetkovic, S. D., Schirris, J., & With, de, P. H. N. (2009). Locally-adaptive image contrast enhancement without noise and ringing artifacts. In Proceedings of the IEEE International Conference on Image Processing (ICIP 2007), October 16-19, 2007, San Antonio, Texas (pp. 557-560). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICIP.2007.4379370 DOI: 10.1109/ICIP.2007.4379370 Document status and date: Published: 01/01/2009 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research.
    [Show full text]
  • Performance Comparison of Ringing Artifact for the Resized Images Using Gaussian Filter and OR Filter
    ISSN: 2278 – 909X International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 2, Issue 3, March 2013 Performance Comparison of Ringing Artifact for the Resized images Using Gaussian Filter and OR Filter Jinu Mathew, Shanty Chacko, Neethu Kuriakose developed for image sizing. Simple method for image resizing Abstract — This paper compares the performances of two approaches which are used to reduce the ringing artifact of the digital image. The first method uses an OR filter for the is the downsizing and upsizing of the image. Image identification of blocks with ringing artifact. There are two OR downsizing can be done by truncating zeros from the high filters which have been designed to reduce ripples and overshoot of image. An OR filter is applied to these blocks in frequency side and upsizing can be done by padding so that DCT domain to reduce the ringing artifact. Generating mask ringing artifact near the real edges of the image [1]-[3]. map using OD filter is used to detect overshoot region, and then In this paper, the OR filtering method reduces ringing apply the OR filter which has been designed to reduce artifact caused by image resizing operations. Comparison overshoot. Finally combine the overshoot and ripple reduced between Gaussian filter is also done. The proposed method is images to obtain the ringing artifact reduced image. In second computationally faster and it produces visually finer images method, the weighted averaging of all the pixels within a without blurring the details and edges of the images. Ringing window of 3 × 3 is used to replace each pixel of the image.
    [Show full text]
  • Signal Processor, Window Provider, Encoded Media Signal, Method for Processing a Signal and Method for Providing a Window
    (19) & (11) EP 2 372 703 A1 (12) EUROPEAN PATENT APPLICATION (43) Date of publication: (51) Int Cl.: 05.10.2011 Bulletin 2011/40 G10L 19/02 (2006.01) (21) Application number: 10175141.0 (22) Date of filing: 02.09.2010 (84) Designated Contracting States: (72) Inventors: AL AT BE BG CH CY CZ DE DK EE ES FI FR GB • Helmrich, Christian GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO 91054, Erlangen (DE) PL PT RO SE SI SK SM TR • Geiger, Ralf Designated Extension States: 90409, Nürnberg (DE) BA ME RS (74) Representative: Burger, Markus et al (30) Priority: 11.03.2010 US 312775 P Schoppe, Zimmermann, Stöckeler & Zinkler Patentanwälte (71) Applicant: Fraunhofer-Gesellschaftzur Förderung Postfach 246 der 82043 Pullach bei München (DE) Angewandten Forschung e.V. 80686 München (DE) (54) Signal processor, window provider, encoded media signal, method for processing a signal and method for providing a window (57) A signal processor for providing a processed rality of window value index values, in order to obtain the version of an input signal in dependence on the input processed version of the input signal. The signal proc- signal comprises a windower configured to window a por- essor also comprises a window provider for providing the tion of the input signal, or of a pre-processed version signal processing window values for a plurality of window thereof, in dependence on a signal processing window value index values in dependence on one or more win- described by signal processing window values for a plu- dow shape parameters.
    [Show full text]
  • Image Deconvolution Ringing Artifact Detection and Removal Via PSF Frequency Analysis
    Image Deconvolution Ringing Artifact Detection and Removal via PSF Frequency Analysis Ali Mosleh1, J.M. Pierre Langlois1, and Paul Green2 1 Ecole´ Polytechnique de Montr´eal, Canada 2 Algolux, Canada {ali.mosleh,pierre.langlois}@polymtl.ca, [email protected] Abstract. We present a new method to detect and remove ringing artifacts produced by the deconvolution process in image deblurring tech- niques. The method takes into account non-invertible frequency com- ponents of the blur kernel used in the deconvolution. Efficient Gabor wavelets are produced for each non-invertible frequency and applied on the deblurred image to generate a set of filter responses that reveal ex- isting ringing artifacts. The set of Gabor filters is then employed in a regularization scheme to remove the corresponding artifacts from the deblurred image. The regularization scheme minimizes the responses of the reconstructed image to these Gabor filters through an alternating algorithm in order to suppress the artifacts. As a result of these steps we are able to significantly enhance the quality of the deblurred images produced by deconvolution algorithms. Our numerical evaluations us- ing a ringing artifact metric indicate the effectiveness of the proposed deringing method. Keywords: deconvolution, image deblurring, point spread function, ringing artifacts, zero-magnitude frequency. 1 Introduction Despite considerable advancements in camera lens stabilizers and shake reduc- tion hardware, blurry images are still often generated due to the camera motion during the exposure time. Hence, effective restoration is required to deblur cap- tured images. Assuming that the imaging system is shift invariant, it can be modeled as b = l ⊕ k + ω, (1) where b ∈ RMN is the blurred captured image, l ∈ RMN is the latent sharp image, k ∈ RMN×MN is the point spread function (PSF) that describes the degree of blurring of the point object captured by the camera, ω ∈ RMN is the additive noise, and ⊕ denotes the 2D convolution operator.
    [Show full text]
  • Arxiv:1602.05975V3 [Cs.MM] 28 Oct 2017 CDEF Works by Identifying the Direction [4] of Each Block Ed =  (Xp − Μd,K) 
    THE AV1 CONSTRAINED DIRECTIONAL ENHANCEMENT FILTER (CDEF) Steinar Midtskogen Jean-Marc Valin Cisco Systems Inc. Mozilla Corporation Lysaker, Norway Mountain View, CA, USA [email protected] [email protected] 0 1 2 3 4 5 6 7 0 0 1 1 2 2 3 3 0 0 0 0 0 0 0 0 3 3 2 2 1 1 0 0 ABSTRACT 1 2 3 4 5 6 7 8 1 1 2 2 3 3 4 4 1 1 1 1 1 1 1 1 4 4 3 3 2 2 1 1 2 3 4 5 6 7 8 9 2 2 3 3 4 4 5 5 2 2 2 2 2 2 2 2 5 5 4 4 3 3 2 2 This paper presents the constrained directional enhancement filter 3 4 5 6 7 8 9 10 3 3 4 4 5 5 6 6 3 3 3 3 3 3 3 3 6 6 5 5 4 4 3 3 4 5 6 7 8 9 10 11 4 4 5 5 6 6 7 7 4 4 4 4 4 4 4 4 7 7 6 6 5 5 4 4 designed for the AV1 royalty-free video codec. The in-loop filter 5 6 7 8 9 10 11 12 5 5 6 6 7 7 8 8 5 5 5 5 5 5 5 5 8 8 7 7 6 6 5 5 is based on a non-linear low-pass filter and is designed for vector- 6 7 8 9 10 11 12 13 6 6 7 7 8 8 9 9 6 6 6 6 6 6 6 6 9 9 8 8 7 7 6 6 7 8 9 10 11 12 13 14 7 7 8 8 9 9 10 10 7 7 7 7 7 7 7 7 10 10 9 9 8 8 7 7 ization efficiency.
    [Show full text]