Invertible Orientation Bundles on 2D Scalar Images

Size: px
Start display at page:

Download "Invertible Orientation Bundles on 2D Scalar Images"

Transcription

1 Invertible Orientation Bundles on 2D Scalar Images Stiliyan N. Kalitzin, Bart M ter Haar Romeny, Max A Viergever Image Science Institute, Utrecht University Abstract. A general approach for multiscale orientation analysis of 2D scalar images is proposed. A scale-dependent orientation bundle (map of the visual space into function of two arguments: position and orientation) is constructed from the local Gaussian-derivatives jet of a scalar image in 2D. It is shown that there exists a class of orientation filters exhibiting an invertible relation between the orientation bundle and the original image in space domain. This invertible transformation is used to regain the original acuity in the spatial domain after analyzing orientation features at any given scale. The approach turns out to be highly effective for the detection of elongated structures. Keywords" Integral Transformations; Orientation Analysis; Scale Space; 1 Introduction Local (differential) multi-scale analysis of image structure has now been well understood within the frameworks of the linear scale-space theory [2, 4]. Point neighborhoods can be studied at a given scale by the local jet of Gaussian derivatives of a scalar image. On the other hand, for the detection of extended, e.g. elongated structures the analysis can appropriately include orientation parameter [91. The goal of this paper is to link the local Gaussian jet with the concept of oriented filtering. Therefore, we construct an orientation bundle over the visual space of a scalar image. Such a bundle is a function of the couple (position,orientation) defined over the space of the original image field. At every spatial point this bundle carries information about the orientation features of the original image in the given neighborhood. Orientation is clearly a multi-scale concept, which we will fully exploit in this paper. Also, it is well known that the human visual front-end has a pronounced and precisely mapped orientation selectivity in the cortical column structure of the primary visual cortex. Recently, much attention has been given to steerable filters to include the orientation parameter in the analysis [6, 1, 8]. In these approaches, however, the field dependence on the local orientation angle is limited. The construction of the orientation bundle is achieved by a linear integral transformation with an oriented filter of finite aperture. It includes also a scale parameter which measures the linear size of the region around a given point that contributes to the orientation function. The larger the scale parameter, the larger are the "receptive fields" of the bundle points. Multi-scale orientation analysis has been introduced before by different authors [7, 5].

2 78 An important result is that a class of invertible orientation filters can be constructed. This means that the system of all position and orientation values can be used to reconstruct the original image, despite the amount of spaceblur caused by the aperture filters to construct the orientation bundle. In effect, the spatial information is encoded into the orientation dimension and can be retrieved with an inverse projection. This type of orientation "encoding" might contribute to understand both the role of orientation columns and the hyperacuity phenomenon in biological visual systems. If the visual system needs some amount of blurring in order to provide a mechanism for sensory grouping or object segmentation, it has to include a way to restore (at least approximately) the original acuity. The inverting property of our transformation puts it in a close association with the wavelet methods, and especially with the 2D Gabor wavelet model [3] (see also the extended reference list there). The last model addresses the same fundamental questions about the exchange between spatial and angular information. An essential difference between our approach and the wavelet one is that the last uses all scales to invert the filter, while in our case we can invert the local bundle for each scale separately. Multi-scale analysis provides a systematic way to explore global, i.e. nonlocal structures in images while still using local techniques applied at larger scale. The introduction of proper orientation degrees into the image provides a way to detect and possibly segment extended structures as curves, ends, curve bifurcations etc. Nonlinear differential invariants defined on both spatial and angular derivatives highlight information for the neighborhood around given image points at the desired scale, which may in cases turn out to be large. Invertibility, on the other hand, can be used to restore the original spatial configuration of the detected structures. In the paper we first give a general definition of linear orientation bundles and introduce a class of invertible orientation filters. Section 3 focuses on the special multi-scale orientation bundle as derived from the local Gaussian derivative jet. In section 4, the invertible Gaussian bundle is applied to the task of segmenting a thin Catheter in a noisy medical fluoroscopy image. In the last section we discuss some practical and conceptual issues concerning the use of our approach. The notations and conventions used in the paper are summarized in the Appendix. 2 Local orientation bundle. Invertibilityo 2.1 Orientation filtering. An orientation bundle defined on R d is a function (see also the Appendix) F(x,8) : R d S d-1 -~ R (1) where x indicates all spatial coordinates and 8 indicates all angular parameters defining a local orientation in R d. In addition, we will require that the bundle is a (infinitely dimensional) representation of the SO(d) rotational group in R d

3 79 acting both on the spatial arguments x --+ R(a)x, where R(a) is a d d matrix from the vector representation of SO(d), and on the angular arguments 0 -+ O-a when rotating over an angle a. In this work we consider only the two dimensional case. Let L(xi), i = 1, 2 be a gray scale image defined on R u, then we can define a general orientation linear bundle with the help of an oriented aperture function (filter) ~b(x, 0). Such functions, especially the so-called steerable filters [6, 1, 8], have been used for local orientation analysis. An oriented filter is constructed from a given scalar function r and its rotations over all angles 0. Explicitly, if we decompose r into SO(2) irreducible representations r 1 v~r n (2) we have for the rotated function r 1 ~r (3) r o) - v~ n We call this last construction (3) orientation covariance. Now we can define the linear orientation bundle F(x, 9) derived from the image L(x) as: F(x, O) = JR 2 d2x'r ', O)L(x + x'). (4) If we decompose the so constructed bundle F(x, O) into harmonic modes as (for notations and normalization conventions see the Appendix): F(x, ~9) - 1 F,,(x)d% (5) --j then Fn(x) = f d2x'+n(x')l(x + x'). (6) where (see also (3)) ~=(x) -- r -'=~ (7) are the angular momenta of the oriented filters. It is clear that all possible linear orientation bundles associated with an image L(x) are parameterized by the (in general infinite) set of of radial functions r ncz. Note that the covariance condition (7) implies in complex notations (see the Appendix) the following generic form of the filter harmonic momenta: where r~(z=)llzll ij<l --- r 9 r e) = e'~v,~(z~), r e) = znv_n(z~), n > 0 (8)

4 80 Alternatively, we can consider the integral transformation (4) in the frequency domain. Then for the Fourier amplitudes, using the convolution properties of the Fourier integrals we have (see the Appendix for the definitions and the normalization conventions): For the (Fourier transformed) angular momenta, we get: (9) ~,~(~) -- 2~,~,~(-~)/_,(~). (10) Here ~,,(w) are the angular momenta of the aperture functions in the frequency representation. It is easy to show that the covariance condition (7) holds also in the frequency domain: ~,~(~o) = ~n(llo, lt)e -~'~~ I1~oll ~ ~'Odl 2 -I- 0J22; 0 w ~--- Arg(wl, co2), (11) where $.(11~Ii) are arbitrary radial-frequency functions. The last can serve as an alternative set of filter-generating functions. 2.2 Restoration of the image from the bundle. Invertibility of the construction (4) means existence of a transformation of the orientation bundle F(x, 0) to the space of ordinary functions in R2: M(x) = / d2x'dor ', O)F(x + x', 0 + 7r). (12) such that it restores the original image M(x) =_ L(x). (13) Here ~b(x, 0) is an oriented aperture function defined in the same way as r 0) in (2). We can look at eq. (12) as an inverse transform of (4) and therefore we have introduced the +Tr angular shift in the last term in (12). This choice is purely conventional. From the harmonic expansions (3) and (5) we can express the field M(x) alternatively as M(x) = ~ / d2x'(-1)n~_,~(x')fn(x + x'), (14) where ~(x) - Cn(px)exp(-inO~) are the harmonic momenta of the aperture function r 0) as in (7). The factor (-1) n comes from the r replacement in (12). Invertibility condition (13) imposes a constraint on the set of functions r (p) and Cn (p). The simplest way to obtain this constraint is to consider a 2D Fourier transform of all 2D fields. Then formula (14) takes the form:

5 81 /~/(w) = 27rE(-1)n~_n(-w)Fn(W). (15) n From (15), (10) and the conventions from the Appendix we obtain the invertibility condition in the frequency domain: 1 = (27r) 2 E (-1)n~-~(-w)~n(-w)" (16) n This equation must hold for all w. Equation (16) contains the Fourier spectral components of the aperture harmonic functions ~bn(x) and k~(x). In terms of the "filter generators" Cn([IW]J) and (bn(ilwll) defined in (11) the condition (16) becomes: 1 = (2r 2 E (17') n 3 Gaussian orientation bundle 3.1 Definitions and construction. An important example of an orientation bundle with scaling properties can be obtained from (8) by taking rn(z, = an (18) where constants an = a:n are still arbitrary and the Gaussian kernel g(z, 2, a) is defined in (32). This choice provides a local orientation bundle constructed entirely from the components of the Gaussian derivative jet. Indeed, according to the definitions and notations of the Appendix, we have t Z z5 z~ ~n(x,g) = an(-~)ne -~--~ ~ an(--grc~z)ne -7 (19) for n > 0, and the complex conjugates for n < 0. We can substitute (19) in equation (6) and then introduce L(z, 2, G) as the convolution of the original image L(x) = L(z, 2) with the Gaussian kernel g(z, 2, cr). After partial integration of the derivatives we get: Fn(x, = an( bzp L(z, 2, (20) for n > 0, and the complex conjugates for n < 0. The n = 0 term in (20) is the original image blurred with a Gaussian kernel of scale G. Thus, for any choice of the numerical coefficients a,, for which the formal series make sense, we obtain a local orientation bundle that can be expressed entirely in terms of Gaussian derivatives of the original image at scale a.

6 82 We turn now to the question of inverting the transformation (20). In other words we want to reconstruct the original image L(x) from its orientation Gaussian bundle. Let us assume that the candidate for the inverse transform (12) is defined by functions ~n(x, ~) similar to (19): -- z2 z~ en(x,a) = bn(-~)ne ~ =- b~(-o'oz)ne -~ (21) Here bn are complex constants, in general different from an. Given the definition of the harmonic coefficients (19) and (21) as Gaussian derivatives, we can substitute (34) into the condition (16). Assuming that the forward and inverse transformation are taken with two different scale parameters (~1 and a2 correspondingly, we obtain: 1 = (aobo + ~ (anbn + gnbn)(ala2"~')n)e -vf'(~+~). (22) n>0 Let us now consider the choice for the parameters an and bn so that M(x) = L(x) when al = ~2. One (symmetric) option is a0=b0=l;an=bn=v 21hi-1 ~-Tn-~.T 'n<>~ (23) Indeed, with the chose (23) for the numbers an, bu we obtain by summing the powers of up 1 = e2~l~2"pe -'p(~+~) - e -(~1-~2)2"p (24) when ~1 = a2. Note that equation (24) implies: M(x, o'1, a2) = L(x, ),) (25) where ), = Itr - a211- Accordingly, for any or2 < ~1 a deblurring effect will be present. This effect is maximal when the two scales are equal and (if all harmonic frequencies are used) the initial image will be reconstructed. The symmetric choice of the coefficients (23) corresponds to a self-invertible bundle. From (25) we also see that )~ _> 0 for any choice of the two scales. Therefore, a "deblurring" beyond the original acuity is impossible which is in accord with the well-posedness arguments. 3.2 Examples. In figure 1 we present the aperture function r defined by (18) and (23). The orientation bundle (1) is obtained from a single bright spot (frame 1 in fig. 1). The resulting field (or the "impulse response function") r 45 ~ is shown in the second frame in fig.1 for angle 0 = 45 ~ In frames 3 and 4 we present the power spectra for the original image and the aperture function. The picture shows clearly the idea of spatial versus angular exchange of information that is realized. In terms of 2D frequency amplitudes, the oriented bundle taken for a fixed angle

7 83 performs a band-pass filtering in the spatial direction aligned with this angle. In other words, if we define "longitudinal" and "transversal" coordinates as xe = xlcos(o) + x2sin(o) and x~ = -xlsin(o) + x2cos(o) correspondingly, then for large scales we have O~eF(xe, x~, 0, ~) ~ O. In figure 2 the invertibility property is illustrated for four different scales (al = a2) taken for the Gaussian invertible bundle. We see that even when the zero-mode blur becomes significant with increasing scale (second row in figure 2), the invertibility of the orientation bundle ensures the proper restoration of the original image (third row in the same figure). Fig. 1. Frame 1:128x128 image with a bright spot of size of two pixels. Frame 2: Gaussian orientation filter response to the image of frame 1 and simulated for scale G = 2.0 and angle 0-45 ~ Frame 3,4: 2D power spectra for the images in frames 1 and 2 respectively. 4 Applications The main motivation for our analysis has been a specific class of visual tasks that are difficult to approach with other schemes. These tasks involve detection and segmentation of extended, i.e non-local sub-dimensional structures. Such structures are, for example, curves in two-dimensional images and curves and surfaces in 3D images. In some cases these objects are defined as borders between two (or more) volumes (or areas in 2D cases). Other images may contain thin, elongated structures that do not separate any distinctive volumes. Such a case is shown in figure 3, frame I where a catheter guide is visible as a thin (on places fuzzy) long structure. To solve the problem of finding extended objects, we must bring in topological knowledge in order to identify the features of these objects. Such feature identification can conveniently be accomplished by a nonlinear local detector (invariant) over the orientation bundle. We can proceed according to the following scheme. - Compute the field F(x, 0, or) from (4), (8),(18),(23) and for the selected scale O'.

8 84 Fig. 2. Frame 1: Image with two vertical bright bars of dimension 30xl pixels. Second row frames (2-5): zero harmonic mode (n=0) of the orientation bundle at scales 0.5, 1.0,2.0 and 3.0 and the angular resolution (number of sectors taken on the circle) is 256. Third row of frames (6-9): restored images at the four scales. - Compute an appropriate non-linear local detector over the orientation bundle. For detecting long, string-like structures we used o I(x, 0, ~) = r(x, 0, ~)(-sin(0)btx~ + cos(0) )~F(x, O, ~)ggf(x, O, ~). (26) The two second derivatives terms in this product take high values near thin, elongated structures. - Project the bundle I(x, O, ~r) back by (12) with functions (21) and the same scale parameter. The back projection is necessary in order to restore the original spatial resolution. In fig. 3 we compare the results without inverting (second frame) and those after inverting (third frame). The non-inverted image is taken as integral of I(x, O, or) over all angles. In the last frame of fig.3 we superimpose the detected structures on the original image and we verify their exact location as a result of the inverse transform. One of the features of the above method is that it can be used at any scale. The invertability constraint (16,22) is valid for any (r and therefore we can use our scheme at several spatial scales independently. This enables us to detect structures of different thickness as shown in figure 4. o2

9 85 Fig. 3. Frame 1: Noisy (low dose) fluoroscopy image (128x256 pxls) of a thin catheter guide wire. In the lower left corner a broader vessel can be seen. Frame 2: Orientation analysis with the non-linear invariant (26) (scale a = 3.0, angular resolution of 256 sectors) and summed over all orientations (sectors). Frame 3: Inverse projection of the bundle defined by the invariant. Frame 4: Original image is superimposed with the result from frame 3. Fig. 4. Frame 1: Noisy (low dose) fluoroscopy image (512x512 pxls.) of a thin catheter guide wire. Frames 2 and 3: High-lightened elongated structures as in figure 1, frame 3 but for scales cr = 0.8 and cr = 3.0 correspondingly. 5 Discussion. Our construction provide s a geometrical interpretation of the local derivative jet of a scalar image by organizing its components into a local orientation bundle. This bundle contains a scale parameter which measures the extent to which we collect the neighboring information in a given direction around every point. It is clear that with increasing value of the scale parameter, the spatial resolution will decrease. In our construction this is compensated by an increase of the angular resolution. Indeed, Fn '~ a '~ so higher harmonics increase stronger with increasing scale. The example with the Gaussian orientation bundle involves an infinite num-

10 86 ber of angular momenta (the sum over n in (15)) in order for the inverse transformation to be exact. Truncation of the harmonic expansions, however, has a mild effect on the property (13). Indeed, it is easy to show that the "departure" from the exact invertibility in the truncated case has a leading term: (-1) N+I M(x,(y,(y)- L(x) - (N + I)! (~r2a)n+il(x, V~a)-t -... (27) 1. where A _= _ z0~ is the Laplaeian operator and N is the highest harmonic component considered. To illustrate this truncation sensitivity, we consider in figure 4 the same example as in figure 2 and restore the original image for different values of the truncation parameter N. Fig. 5. For the same original image as the first frame in figure 2, the restored images for four different harmonic truncations with N=8, 16, 32 and 64 (corresponding to angular resolutions of 16, 32, 64 and 128 sectors) and fixed scale a = 2.0 are shown from left to right. A more practical approach can be based on a finite-dimensional representation of the rotational group, e.g. on steerable filters. Equation (16) can be solved in terms of a finite number of radial aperture functions. The price paid for this finite number is worse than the Gaussian low-pass filtering properties. Finally, we discuss the choice (26) for a non-linear detector of elongated structures. It is clear that if a test-point is positioned on a high-luminosity ridge, the oriented response will be maximal in the direction of the ridge. This, however, is not sufficient to filter only the elongated, or ridge-type of structures. What we need in addition is a term that suppresses "massive" objects and enhances structures with only sub-dimensional support. The two second derivatives in (26) do exactly the required function. They measure "ridgeness" in the angular and transversal direction and give therefore a proper multiplieative modulation to the orientation bundle. The non-linear character of the invariant (26) should be considered as a filtering capacity that is added to the linear transformation (4). 6 Appendix: Notations and conventions. In this Appendix we give some definitions and conventions concerning the formulas in the previous sections. We use below the terms "orientation" and "direction" indiscriminately.

11 87 - Euclidean rotational groups and direction parameters In a d-dimensional Euclidean space R d the (connected) orthogonal rotational group is SO(d). The unit sphere S d-1 represents the set of all spatial SO(d) directions and is isomorphic to the factor-space ~. Any function on the spatial directions is therefore a (infinite-dimensional) representation of SO(d) with stationary subgroup SO(d - 1). - Two-dimensional direction functions and harmonic decompositions. In two spatial dimensions, SO(l) ~- 1 and, therefore, a function on the local direction is just a function on the SO(2) -= U(1) group. As the last is an Abelian group parameterized with a single cyclic parameter, the following decomposition is valid: 1 ~,, in6 1 f~ f(o) ~ ~-- ~ ]ne,fn- j_ dof(~) -ine (28) V ATg n=--cx~ ~ ~: where fn = f-n are the complex harmonic coefficients. The sum over n in (28) is a sum over the irreducible U(1) representations contained in the function f(o). - Local orientation bundle By local orientation bundle we indicate in this paper a fiber bundle with a base manifold the space where the original image is defined and with a standard fiber the infinite-dimensional functional representation of the local rotation group as given in 2D by (28). In higher dimensional cases, the representation is defined as a function on the factor-space ~. The structural group of the fiber bundle is SO(d). - Fourier transformations and complex coordinate conventions. We assume the symmetric normalization conventions for Fourier transforms: 1 f f(x) - (27r)d/2 ] d f( )e 1 / dxf(x)e -~ (29) as well as for the complex vector notations: Z-~- -~(Xl "~ix2),1/' ~- ~(W 1 -Jr-i~2),0 z ~ 0z -- %,~(01 --i02) (30) and their complex conjugates. - Gaussian kernel and its derivatives. We assume the following parameterization for the Gaussian kernel in two spatial dimensions: 1 (~+~) 1 ~ -- g(x, 0") = 2~.o.2 e 2a 2 27ro.2 e = g(z, (31)

12 88 with the complex notations from (31). The n th complex Gaussian derivative is thus: g,~(x, o`) - Oz~g(x,o`) = (-k)~g(z,~,o`) (32) o-2 and an analogous formula holds for its complex conjugate. Finally, in the Fourier domain, the notations and conventions (30,31) lead to the following form of the Gaussian kernel and its derivatives (33): k ( tz/2r 2~ 2~T ~(~, p, o`) _ (ip)n~(~, ~, o`). (33) Acknowledgments: This work is carried out in the framework of the research program Imaging Science, supported by the industrial companies Phillips Medical Systems, KLMA, Shell International Exploration and Production, and ADAC Europe. References 1. William T. Freeman and Edward H. Adelson. The design and use of steerable filters. IEEE Trans. Pattern Analysis and Machine Intelligence, 13(9): , September J. J. Koenderink. The structure of images. Biol. Cybern., 50: , Tai Sing Lee. Image representation using 2D Gabor wavelets. IEEE Trans. Pattern Analysis and Machine Intelligence, 18(10): , October T. Lindeberg. Scale-Space Theory in Computer Vision. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Dordrecht, the Netherlands, M. Michalis. Low level image processing using steerable filters. Institute for Medical Informatics, Munich, PhD thesis. 6. P. Perona. Deformable kernels for early vision. In IEEE CVPR, pages , June E. P. Simoncelli. A rotation invariant pattern signature. In Proc. of the 3rd IEEE Int. Conf. on Image Processing. IEEE, to appear. 8. E. P. Simoncelli and H. Farid. Steerable wedge filters for local orientation analysis. IEEE Transactions on Image Processing, July to appear in. 9. Eero Simoncelli. A rotation-invariant pattern signature. In International Conference on Image Pproeessing, pages , 1996.

Invertible Apertured Orientation Filters in Image Analysis

Invertible Apertured Orientation Filters in Image Analysis International Journal of Computer Vision 31(2/3), 145 158 (1999) c 1999 Kluwer Academic Publishers. Manufactured in The Netherlands. Invertible Apertured Orientation Filters in Image Analysis STILIYAN

More information

Multiscale Image Transforms

Multiscale Image Transforms Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract

More information

Orientation Estimation in Ambiguous Neighbourhoods Mats T. Andersson & Hans Knutsson Computer Vision Laboratory Linköping University 581 83 Linköping, Sweden Abstract This paper describes a new algorithm

More information

Scale Space Analysis by Stabilized Inverse Diffusion Equations

Scale Space Analysis by Stabilized Inverse Diffusion Equations Scale Space Analysis by Stabilized Inverse Diffusion Equations Ilya Pollak, Alan S. Willsky and Hamid Krim Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts

More information

Steerable Wedge Filters for Local Orientation Analysis

Steerable Wedge Filters for Local Orientation Analysis IEEE Transactions on Image Processing, 5(9): 377-382, 996 Steerable Wedge Filters for Local Orientation Analysis Eero P Simoncelli and Hany Farid GRASP Laboratory, Dept of Computer & Information Science

More information

arxiv: v1 [cs.cv] 10 Feb 2016

arxiv: v1 [cs.cv] 10 Feb 2016 GABOR WAVELETS IN IMAGE PROCESSING David Bařina Doctoral Degree Programme (2), FIT BUT E-mail: xbarin2@stud.fit.vutbr.cz Supervised by: Pavel Zemčík E-mail: zemcik@fit.vutbr.cz arxiv:162.338v1 [cs.cv]

More information

DESIGN OF MULTI-DIMENSIONAL DERIVATIVE FILTERS. Eero P. Simoncelli

DESIGN OF MULTI-DIMENSIONAL DERIVATIVE FILTERS. Eero P. Simoncelli Published in: First IEEE Int l Conf on Image Processing, Austin Texas, vol I, pages 790--793, November 1994. DESIGN OF MULTI-DIMENSIONAL DERIVATIVE FILTERS Eero P. Simoncelli GRASP Laboratory, Room 335C

More information

Differential Geometry for Image Processing

Differential Geometry for Image Processing MSc TU/e Course: Differential Geometry for Image Processing Teachers: R. Duits MF 7.072 (responsible teacher, lecturer) E.J. Bekkers MF 7.074 (teacher, instructor) Course Description: This MSc course aims

More information

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Last Lecture : Edge Detection Preprocessing of image is desired to eliminate or at least minimize noise effects There is always tradeoff

More information

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms ITK Filters Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms ITCS 6010:Biomedical Imaging and Visualization 1 ITK Filters:

More information

Where is the bark, the tree and the forest, mathematical foundations of multi-scale analysis

Where is the bark, the tree and the forest, mathematical foundations of multi-scale analysis Where is the bark, the tree and the forest, mathematical foundations of multi-scale analysis What we observe is not nature itself, but nature exposed to our method of questioning. -Werner Heisenberg M.

More information

Steerable Wedge Filters for Local Orientation Analysis

Steerable Wedge Filters for Local Orientation Analysis ppears in: IEEE Transactions on Image Processing, September 996 Steerable Wedge Filters for Local Orientation nalysis Eero P Simoncelli and Hany Farid GRSP Laboratory, Dept of omputer & Information Science

More information

Feature Vector Similarity Based on Local Structure

Feature Vector Similarity Based on Local Structure Feature Vector Similarity Based on Local Structure Evgeniya Balmachnova, Luc Florack, and Bart ter Haar Romeny Eindhoven University of Technology, P.O. Box 53, 5600 MB Eindhoven, The Netherlands {E.Balmachnova,L.M.J.Florack,B.M.terHaarRomeny}@tue.nl

More information

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Review of Edge Detectors #2 Today s Lecture Interest Points Detection What do we mean with Interest Point Detection in an Image Goal:

More information

A UNIFIED THEORY FOR STEERABLE AND QUADRATURE FILTERS

A UNIFIED THEORY FOR STEERABLE AND QUADRATURE FILTERS A UNIFIED THEORY FOR STEERABLE AND QUADRATURE FILTERS Kai Krajsek J. W. Goethe University, Visual Sensorics and Information Processing Lab Robert Mayer Str.2-4, D-60054 Frankfurt am Main, Germany krajsek@vsi.cs.uni-frankfurt.de

More information

General Theory of Equivariant CNNs

General Theory of Equivariant CNNs General Theory of Equivariant CNNs Taco Cohen July 13, 2018 Collaborators Mario Geiger Maurice Weiler Jonas Koehler Marysia Winkels Max Welling Emiel Hoogeboom Jorn Peters Bas Veeling Jim Winkens Jasper

More information

6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018

6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018 6.869 Advances in Computer Vision Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018 1 Sampling Sampling Pixels Continuous world 3 Sampling 4 Sampling 5 Continuous image f (x, y) Sampling

More information

5. LIGHT MICROSCOPY Abbe s theory of imaging

5. LIGHT MICROSCOPY Abbe s theory of imaging 5. LIGHT MICROSCOPY. We use Fourier optics to describe coherent image formation, imaging obtained by illuminating the specimen with spatially coherent light. We define resolution, contrast, and phase-sensitive

More information

Linear Operators and Fourier Transform

Linear Operators and Fourier Transform Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013

More information

The GET Operator. LiTH-ISY-R-2633

The GET Operator. LiTH-ISY-R-2633 The GET Operator Michael Felsberg Linköping University, Computer Vision Laboratory, SE-58183 Linköping, Sweden, mfe@isy.liu.se, http://www.isy.liu.se/cvl/ October 4, 004 LiTH-ISY-R-633 Abstract In this

More information

Computer Vision & Digital Image Processing

Computer Vision & Digital Image Processing Computer Vision & Digital Image Processing Image Restoration and Reconstruction I Dr. D. J. Jackson Lecture 11-1 Image restoration Restoration is an objective process that attempts to recover an image

More information

Discriminative Direction for Kernel Classifiers

Discriminative Direction for Kernel Classifiers Discriminative Direction for Kernel Classifiers Polina Golland Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139 polina@ai.mit.edu Abstract In many scientific and engineering

More information

Erkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5.

Erkut Erdem. Hacettepe University February 24 th, Linear Diffusion 1. 2 Appendix - The Calculus of Variations 5. LINEAR DIFFUSION Erkut Erdem Hacettepe University February 24 th, 2012 CONTENTS 1 Linear Diffusion 1 2 Appendix - The Calculus of Variations 5 References 6 1 LINEAR DIFFUSION The linear diffusion (heat)

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

Multiresolution schemes

Multiresolution schemes Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Multi-dimensional signal processing Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione

More information

Riesz-Transforms vs. Derivatives: On the Relationship Between the Boundary Tensor and the Energy Tensor

Riesz-Transforms vs. Derivatives: On the Relationship Between the Boundary Tensor and the Energy Tensor Riesz-Transforms vs. Derivatives: On the Relationship Between the Boundary Tensor and the Energy Tensor Ullrich Köthe 1 and Michael Felsberg 1 Cognitive Systems Group, University of Hamburg koethe@informatik.uni-hamburg.de

More information

Multiresolution schemes

Multiresolution schemes Multiresolution schemes Fondamenti di elaborazione del segnale multi-dimensionale Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione dei Segnali Multi-dimensionali e

More information

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding

Image enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding 13 Why image enhancement? Image enhancement Example of artifacts caused by image encoding Computer Vision, Lecture 14 Michael Felsberg Computer Vision Laboratory Department of Electrical Engineering 12

More information

DESIGNING CNN GENES. Received January 23, 2003; Revised April 2, 2003

DESIGNING CNN GENES. Received January 23, 2003; Revised April 2, 2003 Tutorials and Reviews International Journal of Bifurcation and Chaos, Vol. 13, No. 10 (2003 2739 2824 c World Scientific Publishing Company DESIGNING CNN GENES MAKOTO ITOH Department of Information and

More information

FILTERING IN THE FREQUENCY DOMAIN

FILTERING IN THE FREQUENCY DOMAIN 1 FILTERING IN THE FREQUENCY DOMAIN Lecture 4 Spatial Vs Frequency domain 2 Spatial Domain (I) Normal image space Changes in pixel positions correspond to changes in the scene Distances in I correspond

More information

PDE Based Image Diffusion and AOS

PDE Based Image Diffusion and AOS PDE Based Image Diffusion and AOS by Jarno Ralli April 27, 204 Abstract This technical paper shows how AOS Additive Operator Splitting scheme, together with TDMA Tri-Diagonal Matrix Algorithm, can be used

More information

SIMPLE GABOR FEATURE SPACE FOR INVARIANT OBJECT RECOGNITION

SIMPLE GABOR FEATURE SPACE FOR INVARIANT OBJECT RECOGNITION SIMPLE GABOR FEATURE SPACE FOR INVARIANT OBJECT RECOGNITION Ville Kyrki Joni-Kristian Kamarainen Laboratory of Information Processing, Department of Information Technology, Lappeenranta University of Technology,

More information

The Helically Reduced Wave Equation as a Symmetric Positive System

The Helically Reduced Wave Equation as a Symmetric Positive System Utah State University DigitalCommons@USU All Physics Faculty Publications Physics 2003 The Helically Reduced Wave Equation as a Symmetric Positive System Charles G. Torre Utah State University Follow this

More information

Machine Learning. A Bayesian and Optimization Perspective. Academic Press, Sergios Theodoridis 1. of Athens, Athens, Greece.

Machine Learning. A Bayesian and Optimization Perspective. Academic Press, Sergios Theodoridis 1. of Athens, Athens, Greece. Machine Learning A Bayesian and Optimization Perspective Academic Press, 2015 Sergios Theodoridis 1 1 Dept. of Informatics and Telecommunications, National and Kapodistrian University of Athens, Athens,

More information

Linear Diffusion and Image Processing. Outline

Linear Diffusion and Image Processing. Outline Outline Linear Diffusion and Image Processing Fourier Transform Convolution Image Restoration: Linear Filtering Diffusion Processes for Noise Filtering linear scale space theory Gauss-Laplace pyramid for

More information

Consistent Positive Directional Splitting of Anisotropic Diffusion

Consistent Positive Directional Splitting of Anisotropic Diffusion In: Boštjan Likar (ed.): Proc. of Computer Vision Winter Workshop, Bled, Slovenia, Feb. 7-9, 2001, pp. 37-48. Consistent Positive Directional Splitting of Anisotropic Diffusion Pavel Mrázek and Mirko Navara

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

Introduction to Linear Image Processing

Introduction to Linear Image Processing Introduction to Linear Image Processing 1 IPAM - UCLA July 22, 2013 Iasonas Kokkinos Center for Visual Computing Ecole Centrale Paris / INRIA Saclay Image Sciences in a nutshell 2 Image Processing Image

More information

Introduction to Group Theory

Introduction to Group Theory Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)

More information

Abstract. 1 Introduction. 2 Idempotent filters. Idempotent Nonlinear Filters

Abstract. 1 Introduction. 2 Idempotent filters. Idempotent Nonlinear Filters Idempotent Nonlinear Filters R.K. Pearson and M. Gabbouj Tampere International Center for Signal Processing Tampere University of Technology P.O. Box 553, FIN-33101 Tampere, Finland E-mail: {pearson,gabbouj}@cs.tut.fi

More information

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise Edges and Scale Image Features From Sandlot Science Slides revised from S. Seitz, R. Szeliski, S. Lazebnik, etc. Origin of Edges surface normal discontinuity depth discontinuity surface color discontinuity

More information

The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space

The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space Robert Jenssen, Deniz Erdogmus 2, Jose Principe 2, Torbjørn Eltoft Department of Physics, University of Tromsø, Norway

More information

Nonlinear reverse-correlation with synthesized naturalistic noise

Nonlinear reverse-correlation with synthesized naturalistic noise Cognitive Science Online, Vol1, pp1 7, 2003 http://cogsci-onlineucsdedu Nonlinear reverse-correlation with synthesized naturalistic noise Hsin-Hao Yu Department of Cognitive Science University of California

More information

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

L(x; 0) = f(x) This family is equivalent to that obtained by the heat or diffusion equation: L t = 1 2 L

L(x; 0) = f(x) This family is equivalent to that obtained by the heat or diffusion equation: L t = 1 2 L Figure 1: Fine To Coarse Scales. The parameter t is often associated with the generation of a scale-space family, where t = 0 denotes the original image and t > 0 increasing (coarser) scales. Scale-Space

More information

How might we evaluate this? Suppose that, by some good luck, we knew that. x 2 5. x 2 dx 5

How might we evaluate this? Suppose that, by some good luck, we knew that. x 2 5. x 2 dx 5 8.4 1 8.4 Partial Fractions Consider the following integral. 13 2x (1) x 2 x 2 dx How might we evaluate this? Suppose that, by some good luck, we knew that 13 2x (2) x 2 x 2 = 3 x 2 5 x + 1 We could then

More information

Generalized Laplacian as Focus Measure

Generalized Laplacian as Focus Measure Generalized Laplacian as Focus Measure Muhammad Riaz 1, Seungjin Park, Muhammad Bilal Ahmad 1, Waqas Rasheed 1, and Jongan Park 1 1 School of Information & Communications Engineering, Chosun University,

More information

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. VI - System Identification Using Wavelets - Daniel Coca and Stephen A. Billings

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. VI - System Identification Using Wavelets - Daniel Coca and Stephen A. Billings SYSTEM IDENTIFICATION USING WAVELETS Daniel Coca Department of Electrical Engineering and Electronics, University of Liverpool, UK Department of Automatic Control and Systems Engineering, University of

More information

Topics in Harmonic Analysis, Sparse Representations, and Data Analysis

Topics in Harmonic Analysis, Sparse Representations, and Data Analysis Topics in Harmonic Analysis, Sparse Representations, and Data Analysis Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu Thesis Defense,

More information

Vlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems

Vlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems 1 Vlad Estivill-Castro (2016) Robots for People --- A project for intelligent integrated systems V. Estivill-Castro 2 Perception Concepts Vision Chapter 4 (textbook) Sections 4.3 to 4.5 What is the course

More information

A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer. Christian{Albrechts{Universitat zu Kiel

A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer. Christian{Albrechts{Universitat zu Kiel A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer Christian{Albrechts{Universitat zu Kiel Institute of Computer Science, Cognitive Systems Preuerstrae 1{9, 24105 Kiel Tel:+49 431

More information

What is Image Deblurring?

What is Image Deblurring? What is Image Deblurring? When we use a camera, we want the recorded image to be a faithful representation of the scene that we see but every image is more or less blurry, depending on the circumstances.

More information

A quantative comparison of two restoration methods as applied to confocal microscopy

A quantative comparison of two restoration methods as applied to confocal microscopy A quantative comparison of two restoration methods as applied to confocal microscopy Geert M.P. van Kempen 1, Hans T.M. van der Voort, Lucas J. van Vliet 1 1 Pattern Recognition Group, Delft University

More information

On the FPA infrared camera transfer function calculation

On the FPA infrared camera transfer function calculation On the FPA infrared camera transfer function calculation (1) CERTES, Université Paris XII Val de Marne, Créteil, France (2) LTM, Université de Bourgogne, Le Creusot, France by S. Datcu 1, L. Ibos 1,Y.

More information

SCALE-SPACE - Theory and Applications

SCALE-SPACE - Theory and Applications SCALE-SPACE - Theory and Applications Scale is embedded in the task: do you want only coins or TREASURE? SCALE-SPACE Theory and Applications - Scale-space theory is a framework of multiscale image/signal

More information

Optical Flow Estimation from Monogenic Phase

Optical Flow Estimation from Monogenic Phase Optical Flow Estimation from Monogenic Phase Michael Felsberg Linköping University, Computer Vision Laboratory, SE-58183 Linköping, Sweden, mfe@isy.liu.se, http://www.isy.liu.se/cvl/ Abstract. The optical

More information

A Novel Method for Generating Scale Space Kernels Based on Wavelet Theory

A Novel Method for Generating Scale Space Kernels Based on Wavelet Theory A Novel Method for Generating Scale Space Kernels Based on Wavelet Theory Dionísio Doering1 Adalberto Schuck Júnior Abstract: The linear scale-space kernel is a Gaussian or Poisson function. These functions

More information

Using Skew Gabor Filter in Source Signal Separation and Local Spectral Multi-Orientation Analysis

Using Skew Gabor Filter in Source Signal Separation and Local Spectral Multi-Orientation Analysis Using Skew Gabor Filter in Source Signal Separation and Local Spectral Multi-Orientation Analysis Weichuan Yu Gerald Sommer Kostas Daniilidis 3 Dept. of Diagnostic Radiology Institut für Informatik 3 GRASP

More information

TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection

TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection Technischen Universität München Winter Semester 0/0 TRACKING and DETECTION in COMPUTER VISION Filtering and edge detection Slobodan Ilić Overview Image formation Convolution Non-liner filtering: Median

More information

EXAMPLES OF PROOFS BY INDUCTION

EXAMPLES OF PROOFS BY INDUCTION EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming

More information

Summary of free theory: one particle state: vacuum state is annihilated by all a s: then, one particle state has normalization:

Summary of free theory: one particle state: vacuum state is annihilated by all a s: then, one particle state has normalization: The LSZ reduction formula based on S-5 In order to describe scattering experiments we need to construct appropriate initial and final states and calculate scattering amplitude. Summary of free theory:

More information

1 Assignment 1: Nonlinear dynamics (due September

1 Assignment 1: Nonlinear dynamics (due September Assignment : Nonlinear dynamics (due September 4, 28). Consider the ordinary differential equation du/dt = cos(u). Sketch the equilibria and indicate by arrows the increase or decrease of the solutions.

More information

The Spinor Representation

The Spinor Representation The Spinor Representation Math G4344, Spring 2012 As we have seen, the groups Spin(n) have a representation on R n given by identifying v R n as an element of the Clifford algebra C(n) and having g Spin(n)

More information

A REVIEW ON DIRECTIONAL FILTER BANK FOR THEIR APPLICATION IN BLOOD VESSEL DETECTION IN IMAGES

A REVIEW ON DIRECTIONAL FILTER BANK FOR THEIR APPLICATION IN BLOOD VESSEL DETECTION IN IMAGES A REVIEW ON DIRECTIONAL FILTER BANK FOR THEIR APPLICATION IN BLOOD VESSEL DETECTION IN IMAGES ABSTRACT: Department of Electronics Engineering, G. H. Raisoni College of Engineering, Nagpur, India Vessel

More information

A Generative Perspective on MRFs in Low-Level Vision Supplemental Material

A Generative Perspective on MRFs in Low-Level Vision Supplemental Material A Generative Perspective on MRFs in Low-Level Vision Supplemental Material Uwe Schmidt Qi Gao Stefan Roth Department of Computer Science, TU Darmstadt 1. Derivations 1.1. Sampling the Prior We first rewrite

More information

Low-level Image Processing

Low-level Image Processing Low-level Image Processing In-Place Covariance Operators for Computer Vision Terry Caelli and Mark Ollila School of Computing, Curtin University of Technology, Perth, Western Australia, Box U 1987, Emaihtmc@cs.mu.oz.au

More information

Machine Learning: Basis and Wavelet 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 Haar DWT in 2 levels

Machine Learning: Basis and Wavelet 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 Haar DWT in 2 levels Machine Learning: Basis and Wavelet 32 157 146 204 + + + + + - + - 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 7 22 38 191 17 83 188 211 71 167 194 207 135 46 40-17 18 42 20 44 31 7 13-32 + + - - +

More information

On Information Maximization and Blind Signal Deconvolution

On Information Maximization and Blind Signal Deconvolution On Information Maximization and Blind Signal Deconvolution A Röbel Technical University of Berlin, Institute of Communication Sciences email: roebel@kgwtu-berlinde Abstract: In the following paper we investigate

More information

Representing Group Codes as Permutation Codes

Representing Group Codes as Permutation Codes Representing Group Codes as Permutation Codes Ezio Biglieri John K. Karlof Emanuele Viterbo November 19, 001 Abstract Given an abstract group G, an N dimensional orthogonal matrix representation G of G,

More information

A Flexible Framework for Local Phase Coherence Computation

A Flexible Framework for Local Phase Coherence Computation A Flexible Framework for Local Phase Coherence Computation Rania Hassen, Zhou Wang, and Magdy Salama Department of Electrical and Computer Engineering, University of Waterloo, 200 University Avenue West,

More information

10. Smooth Varieties. 82 Andreas Gathmann

10. Smooth Varieties. 82 Andreas Gathmann 82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It

More information

Two-Dimensional Orthogonal Filter Banks with Directional Vanishing Moments

Two-Dimensional Orthogonal Filter Banks with Directional Vanishing Moments Two-imensional Orthogonal Filter Banks with irectional Vanishing Moments Jianping Zhou and Minh N. o epartment of Electrical and Computer Engineering University of Illinois at Urbana-Champaign, Urbana,

More information

Filtering and Edge Detection

Filtering and Edge Detection Filtering and Edge Detection Local Neighborhoods Hard to tell anything from a single pixel Example: you see a reddish pixel. Is this the object s color? Illumination? Noise? The next step in order of complexity

More information

Twistors and Conformal Higher-Spin. Theory. Tristan Mc Loughlin Trinity College Dublin

Twistors and Conformal Higher-Spin. Theory. Tristan Mc Loughlin Trinity College Dublin Twistors and Conformal Higher-Spin Tristan Mc Loughlin Trinity College Dublin Theory Based on work with Philipp Hähnel & Tim Adamo 1604.08209, 1611.06200. Given the deep connections between twistors, the

More information

On Mean Curvature Diusion in Nonlinear Image Filtering. Adel I. El-Fallah and Gary E. Ford. University of California, Davis. Davis, CA

On Mean Curvature Diusion in Nonlinear Image Filtering. Adel I. El-Fallah and Gary E. Ford. University of California, Davis. Davis, CA On Mean Curvature Diusion in Nonlinear Image Filtering Adel I. El-Fallah and Gary E. Ford CIPIC, Center for Image Processing and Integrated Computing University of California, Davis Davis, CA 95616 Abstract

More information

Karhunen Loéve Expansion of a Set of Rotated Templates

Karhunen Loéve Expansion of a Set of Rotated Templates IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 12, NO. 7, JULY 2003 817 Karhunen Loéve Expansion of a Set of Rotated Templates Matjaž Jogan, Student Member, IEEE, Emil Žagar, and Aleš Leonardis, Member, IEEE

More information

Index. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96

Index. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 B 1,94-96 M,94-96 B oro!' 94-96 BIro!' 94-96 I/r, 79 2D linear system, 56 2D FFT, 119 2D Fourier transform, 1, 12, 18,91 2D sinc, 107, 112

More information

Chapter 11. Special Relativity

Chapter 11. Special Relativity Chapter 11 Special Relativity Note: Please also consult the fifth) problem list associated with this chapter In this chapter, Latin indices are used for space coordinates only eg, i = 1,2,3, etc), while

More information

The New Graphic Description of the Haar Wavelet Transform

The New Graphic Description of the Haar Wavelet Transform he New Graphic Description of the Haar Wavelet ransform Piotr Porwik and Agnieszka Lisowska Institute of Informatics, Silesian University, ul.b dzi ska 39, 4-00 Sosnowiec, Poland porwik@us.edu.pl Institute

More information

Approximation Theory on Manifolds

Approximation Theory on Manifolds ATHEATICAL and COPUTATIONAL ETHODS Approximation Theory on anifolds JOSE ARTINEZ-ORALES Universidad Nacional Autónoma de éxico Instituto de atemáticas A.P. 273, Admon. de correos #3C.P. 62251 Cuernavaca,

More information

Deep Learning: Approximation of Functions by Composition

Deep Learning: Approximation of Functions by Composition Deep Learning: Approximation of Functions by Composition Zuowei Shen Department of Mathematics National University of Singapore Outline 1 A brief introduction of approximation theory 2 Deep learning: approximation

More information

Total Variation Blind Deconvolution: The Devil is in the Details Technical Report

Total Variation Blind Deconvolution: The Devil is in the Details Technical Report Total Variation Blind Deconvolution: The Devil is in the Details Technical Report Daniele Perrone University of Bern Bern, Switzerland perrone@iam.unibe.ch Paolo Favaro University of Bern Bern, Switzerland

More information

RECONSTRUCTION AND PATTERN RECOGNITION VIA THE CITTI- PETITOT-SARTI MODEL

RECONSTRUCTION AND PATTERN RECOGNITION VIA THE CITTI- PETITOT-SARTI MODEL RECONSTRUCTION AND PATTERN RECOGNITION VIA THE CITTI- PETITOT-SARTI MODEL DARIO PRANDI, J.P. GAUTHIER, U. BOSCAIN LSIS, UNIVERSITÉ DE TOULON & ÉCOLE POLYTECHNIQUE, PARIS SÉMINAIRE STATISTIQUE ET IMAGERIE

More information

Analysis of Fractals, Image Compression and Entropy Encoding

Analysis of Fractals, Image Compression and Entropy Encoding Analysis of Fractals, Image Compression and Entropy Encoding Myung-Sin Song Southern Illinois University Edwardsville Jul 10, 2009 Joint work with Palle Jorgensen. Outline 1. Signal and Image processing,

More information

Scale-Invariance of Support Vector Machines based on the Triangular Kernel. Abstract

Scale-Invariance of Support Vector Machines based on the Triangular Kernel. Abstract Scale-Invariance of Support Vector Machines based on the Triangular Kernel François Fleuret Hichem Sahbi IMEDIA Research Group INRIA Domaine de Voluceau 78150 Le Chesnay, France Abstract This paper focuses

More information

I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University. Computer Vision: 4. Filtering

I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University. Computer Vision: 4. Filtering I Chen Lin, Assistant Professor Dept. of CS, National Chiao Tung University Computer Vision: 4. Filtering Outline Impulse response and convolution. Linear filter and image pyramid. Textbook: David A. Forsyth

More information

Shape of Gaussians as Feature Descriptors

Shape of Gaussians as Feature Descriptors Shape of Gaussians as Feature Descriptors Liyu Gong, Tianjiang Wang and Fang Liu Intelligent and Distributed Computing Lab, School of Computer Science and Technology Huazhong University of Science and

More information

Image representation with multi-scale gradients

Image representation with multi-scale gradients Image representation with multi-scale gradients Eero P Simoncelli Center for Neural Science, and Courant Institute of Mathematical Sciences New York University http://www.cns.nyu.edu/~eero Visual image

More information

Best apertures from entropy minimization

Best apertures from entropy minimization Best apertures from entropy minimization Bart M. ter Haar Romeny, PhD Eindhoven University of Technology Excerpt from the book "Front-End Vision & Multi-Scale Image Analysis", Kluwer Academic Publishers,

More information

Multiresolution analysis & wavelets (quick tutorial)

Multiresolution analysis & wavelets (quick tutorial) Multiresolution analysis & wavelets (quick tutorial) Application : image modeling André Jalobeanu Multiresolution analysis Set of closed nested subspaces of j = scale, resolution = 2 -j (dyadic wavelets)

More information

A BAYESIAN APPROACH TO NONLINEAR DIFFUSION BASED ON A LAPLACIAN PRIOR FOR IDEAL IMAGE GRADIENT

A BAYESIAN APPROACH TO NONLINEAR DIFFUSION BASED ON A LAPLACIAN PRIOR FOR IDEAL IMAGE GRADIENT A BAYESIAN APPROACH TO NONLINEAR DIFFUSION BASED ON A LAPLACIAN PRIOR FOR IDEAL IMAGE GRADIENT Aleksandra Pižurica, Iris Vanhamel, Hichem Sahli, Wilfried Philips and Antonis Katartzis Ghent University,

More information

Maximum variance formulation

Maximum variance formulation 12.1. Principal Component Analysis 561 Figure 12.2 Principal component analysis seeks a space of lower dimensionality, known as the principal subspace and denoted by the magenta line, such that the orthogonal

More information

Stability of Recursive Gaussian Filtering for Piecewise Linear Bilateral Filtering

Stability of Recursive Gaussian Filtering for Piecewise Linear Bilateral Filtering Stability of Recursive Gaussian Filtering for Piecewise Linear Bilateral Filtering Koichiro Watanabe, Yoshihiro Maeda, and Norishige Fukushima Nagoya Institute of Technology, Nagoya, Japan fukushima@nitech.ac.jp

More information

T-duality & noncommutative geometry

T-duality & noncommutative geometry T-duality & noncommutative geometry Type IIA Type IIB duality rephrased Higher Structures in String Theory and Quantum Field Theory Instructional workshop for students and junior researchers Mathai Varghese

More information

Image Processing /6.865 Frédo Durand A bunch of slides by Bill Freeman (MIT) & Alyosha Efros (CMU)

Image Processing /6.865 Frédo Durand A bunch of slides by Bill Freeman (MIT) & Alyosha Efros (CMU) Image Processing 6.815/6.865 Frédo Durand A bunch of slides by Bill Freeman (MIT) & Alyosha Efros (CMU) define cumulative histogram work on hist eq proof rearrange Fourier order discuss complex exponentials

More information

Representations of Sp(6,R) and SU(3) carried by homogeneous polynomials

Representations of Sp(6,R) and SU(3) carried by homogeneous polynomials Representations of Sp(6,R) and SU(3) carried by homogeneous polynomials Govindan Rangarajan a) Department of Mathematics and Centre for Theoretical Studies, Indian Institute of Science, Bangalore 560 012,

More information

Fourier Transform. sin(n# x)), where! = 2" / L and

Fourier Transform. sin(n# x)), where! = 2 / L and Fourier Transform Henning Stahlberg Introduction The tools provided by the Fourier transform are helpful for the analysis of 1D signals (time and frequency (or Fourier) domains), as well as 2D/3D signals

More information

Single-Image-Based Rain and Snow Removal Using Multi-guided Filter

Single-Image-Based Rain and Snow Removal Using Multi-guided Filter Single-Image-Based Rain and Snow Removal Using Multi-guided Filter Xianhui Zheng 1, Yinghao Liao 1,,WeiGuo 2, Xueyang Fu 2, and Xinghao Ding 2 1 Department of Electronic Engineering, Xiamen University,

More information

Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem

Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem 1 Fourier Analysis, a review We ll begin with a short review of simple facts about Fourier analysis, before going on to interpret

More information

BLIND SOURCE SEPARATION TECHNIQUES ANOTHER WAY OF DOING OPERATIONAL MODAL ANALYSIS

BLIND SOURCE SEPARATION TECHNIQUES ANOTHER WAY OF DOING OPERATIONAL MODAL ANALYSIS BLIND SOURCE SEPARATION TECHNIQUES ANOTHER WAY OF DOING OPERATIONAL MODAL ANALYSIS F. Poncelet, Aerospace and Mech. Eng. Dept., University of Liege, Belgium G. Kerschen, Aerospace and Mech. Eng. Dept.,

More information