DOCSLIB.ORG

International Conference WAVELETS and APPLICATIONS

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
International Conference WAVELETS and APPLICATIONS Министерство образования и науки РФ Санкт-Петербургское отделение математического института им. В.А. Стеклова РАН Воронежский государственный университет International Conference WAVELETS AND APPLICATIONS June 14-20. 2009, St.Petersburg, Russia ABSTRACTS Санкт-Петербург 2009 УДК 517.5 Международная конференция "Всплески и приложения, 14-20 июня 2009 г. Санкт-Петербург, Россия". Тезисы докладов ОРГКОМИТЕТ Председатель: И.Я. Новиков (проф. математического факультета Воронежского госуниверситета) Ученый секретарь: П.Г. Северов (преподаватель математи- ческого факультета Воронежского госуниверситета) Члены оргкомитета: Л.В. Новиков (ведущий науч. сотрудник Института аналитического приборостроения РАН) В.В. Капустин (старший науч. сотрудник лаборатории математического анализа Санкт-Петербургского отделения математического института им. В.А.Стеклова) М.А. Скопина (проф. факультета прикладной математики - процессов управления Санкт-Петербургского госуниверситета) С.А. Гарьковская (аспирант математического факультета Воронежского госуниверситета) Издание осуществлено при поддержке Российского фонда фун- даментальных исследований (проект № 09-01-06036-г) Компьютерная верстка и подготовка оригинал-макета: Северов П.Г. WAVELETS AND APPLICATIONS 3 CONTINUOUS WAVELET TRANSFORM ON THE ONE-SHEETED HYPERBOLOID A. Askari Hemmat, Z. Yazdani Fard Department of Mathematics, Shahid Bahonar University of Kerman, Kerman, Iran [email protected] 1;1 2 2 The one-sheeted hyperboloid H with Cartesian equation x0 ¡ x1 ¡ 2 x2 = ¡1 may be parametrized as x = (sinh Â; cosh  cos '; cosh  sin '); where  2 R; 0 · ' < 2¼: The motions on H1;1 are of two types: (i) rotations: x(Â; ') 7! (Â; ' + '0); and (ii) displacements: x(Â; ') 7! (Â+Â0;'): They constitute the group SO0(1; 2). To define 1;1 dilation on H , project it onto the cone C = f» = (»0;»1;»2) 2 3 2 2 2 R : »0 ¡ »1 ¡ »2 = 0g; with dilatin » 7! a»: In polar coordinates, the dilation oprator acts on a point x(Â; ') by Da(Â; ') = (Âa;'), with sinhÂa = asinhÂ: For all test functions f on H1;1 introduce the following pair of transforms ^ § + f§(º; ») = hf(x);"º; »(x)i; where º 2 R ;» varies on the half cone + § C = f» 2 C : »0 > 0g and the kernels "º; »(x) are hyperbolic plane waves. This transformation is called the Fourier-Helgason transform. Let à 2 L2(H1;1) be a symmetric and rotation invariant function, + a 7! ®(a) a positive function on R¤ , we say that à is admissible if there exists constants m and M such that0 < m ·AÃ(º) := Z 1 c 2 1;1 j(Ãa)§(º)j ®(a)da · M < 1: Given an admissible H -wavelet Ã, 0 1;1 2 1;1 the H -continuousZ wavelet transform of f 2 L (H ) is Wf (a; g) := ¡1 hÃa; g; fi = Ãa(g x)f(x)d¹(x); g 2 SO0(1; 2); a > 0 where H1;1 1 Ãa(x) = ¸(a; x) 2 Ã(D 1 x) such that ¸(a; x) is the Radon-Nikodym a derivative. We show that a symmetric and rotation invariant function à 2 L2(H1;1) is admissible if ®(a)da be a homogeneous maesure of ¡¯ the formZ® da with ¯ > 3 and the following zero-mean condition is satisfied Ã(Â; ')d¹(Â; ') = 0: H1;1 References 1. S.T. Ali, J-P. Antoine, and J-P. Gazeau, Coherent States, Wavelets and Their Generalizations, Springer-Verlag, New York, Berlin, 4 International Conference Heidelberg, 2000. 2. J. Bros and U. Moschella, Fourier analysis and holomorphic decomposition on the one-sheeted hyperboloid, (2003) [arXiv: math-ph/0311052v1]. DECONVOLUTION BY MATCHING PURSUIT USING SPLINE WAVELET PACKETS DICTIONARIES Amir Z. Averbuch, Valery A. Zheludev School of Computer Science, Tel Aviv University, Israel [email protected] We present an efficient method that restores signals from strongly noised blurred discrete data. The method can be characterized as a regularized matching pursuit (MP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis, theory of ill-posed problems and greedy algorithms. The computational engine, which enables to construct versatile libraries of spline wavelet packet dictionaries and fast implementation of the algorithm, is the Spline Harmonic Analysis (SHA). SHA imposes harmonic analysis methodology onto spline spaces. It is especially applicable to convolution operations. The use of splines enables to map the discrete noised data into spaces of continuous functions, which approximate the sought after solution in the proper smoothed class. The main distinction from the conventional MP is that the different dictionaries are used to test data and to approximate the solution. In addition, the regularized correlation coefficients instead of the conventional ones are used. The regularizing parameters and the stopping rule for the algorithm are determined automatically. Experimental results exhibit a highly efficient algorithm. The coherent structure of the signals, which were subjected to the strong blurring and immersed into deep noise, were extracted. WAVELETS AND APPLICATIONS 5 AN HYBRID ALGORITHM FOR DATA COMPRESSION Amir Z. Averbuch1, Valery A. Zheludev1, Moshe Guttmann1, Dan D. Kosloff2 1School of Computer Science Tel Aviv University, Israel 2Department of Earth and Planetary Sciences Tel Aviv University, Israel [email protected] We present an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data have this mixed structure. The transform part of the compression process is an algorithm that combines wavelet and the local cosine transform (LCT). The quantization and the entropy coding parts of the compression were taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. This algorithm outperforms other algorithms that are based only on the 2D wavelets transforms. Its compression capabilities are also demonstrated on multimedia images that have a fine texture. The wavelet part in the mixed transform of the hybrid algorithm utilizes the library of Butterworth wavelet transforms. TO ONE ADDITIONAL EXTREMAL PROPERTY OF REGULAR SIMPLEX V.F. Babenko1, Yu.V. Babenko2, N.V. Parfinovych1, D.S. Skorokhodov1 1 Dnepropetrovsk National University, UKRAINE, 2 Sam Houston State University, Huntsville, TX, USA [email protected], [email protected], nparfi[email protected], [email protected] For a d-dimensional simplex T , let Lp(T ), 1 · p · 1, be the space of functions f : T! R endowed with the usual norm k ¢ kLp(T ). Denote d g§(x) = maxfg(x); 0g, x 2 R . Let ®; ¯ > 0 be given. For f 2 Lp(T ), the asymmetric Lp-norm is defined as follows kfkLp;®;¯(T ) := k®f+ + ¯f¡kLp(T ): 6 International Conference t d Let S1(T ) := fg(x) = ax + c : a 2 R ; c 2 R; x 2 T g. For f 2 Lp(T ), set E(f; S1(T ))Lp;®;¯(T ) := inffkf ¡ ukLp;®;¯(T ) : u 2 S1(T )g: Note that E(f; S1(T ))Lp;1;1(T ) is the usual best approximation of f by d P 2 linear functions on T in the Lp-metric. Let Q(x) = xj . We solve the j=1 following extremal problem: E(Q; S1(T ))Lp;®;¯(T ) ! inf; jT j = 1; (1) where jT j stands for the volume of simplex T . To the best of our knowledge, problem (1) was solved only in the case of one-sided approximation (interpolation) and in the case ® = ¯ = 1, p = 2 and d = 2. Problem (1) is important for many questions in Conves Geometry, approximation of convex bodies by polytopes and approximation of surfaces by splines. Let T0 be the regular simplex of unit volume in Rd. We obtained the following result. Theorem. Let ®; ¯ > 0, d 2 N and 1 · p · 1. Then E(Q; S1(T0))L (T ) = inf E(Q; S1(T ))L (T ): p;®;¯ 0 T : jT j=1 p;®;¯ EXACT ASYMPTOTICS OF THE OPTIMAL Lp-ERROR OF ASYMMETRIC LINEAR SPLINE APPROXIMATION V.F. Babenko1, Yu.V. Babenko2, N.V. Parfinovych1, D.S. Skorokhodov1 1 Dnepropetrovsk National University, UKRAINE, 2 Sam Houston State University, Huntsville, TX, USA [email protected], [email protected], nparfi[email protected], [email protected] 2 Let D = [0; 1] . By Lp, 1 · p · 1, denote the space of functions f : D ! R endowed with the usual norm k ¢ kp. Let ® and ¯ be positive continuous on D functions, and let f 2 Lp. Then, asymmetric Lp-norm is defined as follows kfkLp;®;¯(D) := k®f+ + ¯f¡kp; WAVELETS AND APPLICATIONS 7 where g§(¢) = maxfg(¢); 0g. N A collection 4N = 4N (D) = fTigi=1 of N triangles, N 2 N, in the plane is called a triangulation of a set D provided that: any pair of triangles from 4N intersects at most at a common vertex or along a SN common edge, and D = Ti. i=1 Given a triangulation 4N , let S(4N ) be the space of continuous on D functions, which are linear on every triangle Ti 2 4N . Now set RN (f; Lp;®;¯) := inf inf kf ¡ skLp;®;¯(D); 4N s2S(4N ) where the first inf is taken over all triangulations with N triangles. 2 Let T0 be the equilateral triangle. For f 2 C (D), set H(f; ¢) := ³ ´2 @2f @2f @2f @x2 (¢) @y2 (¢) ¡ @xy (¢) . Let 2 2 Cp;®;¯(x; y) := inf ku + v ¡ au ¡ bv ¡ ckL (T ): a;b;c2R p;®(x;y);¯(x;y) 0 Theorem. Let f 2 C2(D); H(f; x; y) ¸ C+ > 0 for all (x; y) 2 D. Let positive continuous on D functions ® and ¯ also be given. Then for all 1 · p < 1, µZ ¶ p+1 p p p 2(p+1) p+1 lim N ¢ RN (f; Lp;®;¯) = H (f; x; y)Cp;®;¯(x; y) dxdy : N!1 D ESTIMATES OF MODULUS OF CONTINUITY FOR FUNCTION FROM BESOV-TYPE SPACE Eugeny Berezhnoi Yaroslavl State University, Yaroslavl, Russia [email protected] Let X be a symmetric function space on I = [0; 1]n, Ã(X; t) = kÂ([0; t1=n]n)jXk - is a fundamental function of X and !(f; h; X) = sup kf(: + ±) ¡ f(:)jXk 0·j±j·h 8 International Conference ® is a modulus of continuity of function f.
Load more

Recommended publications
  • A Gallery of De Rham Curves
    A Gallery of de Rham Curves Linas Vepstas <[email protected]> 20 August 2006 Abstract The de Rham curves are a set of fairly generic fractal curves exhibiting dyadic symmetry. Described by Georges de Rham in 1957[3], this set includes a number of the famous classical fractals, including the Koch snowflake, the Peano space- filling curve, the Cesàro-Faber curves, the Takagi-Landsberg[4] or blancmange curve, and the Lévy C-curve. This paper gives a brief review of the construction of these curves, demonstrates that the complete collection of linear affine deRham curves is a five-dimensional space, and then presents a collection of four dozen images exploring this space. These curves are interesting because they exhibit dyadic symmetry, with the dyadic symmetry monoid being an interesting subset of the group GL(2,Z). This is a companion article to several others[5][6] exploring the nature of this monoid in greater detail. 1 Introduction In a classic 1957 paper[3], Georges de Rham constructs a class of curves, and proves that these curves are everywhere continuous but are nowhere differentiable (more pre- cisely, are not differentiable at the rationals). In addition, he shows how the curves may be parameterized by a real number in the unit interval. The construction is simple. This section illustrates some of these curves. 2 2 2 2 Consider a pair of contracting maps of the plane d0 : R → R and d1 : R → R . By the Banach fixed point theorem, such contracting maps should have fixed points p0 and p1. Assume that each fixed point lies in the basin of attraction of the other map, and furthermore, that the one map applied to the fixed point of the other yields the same point, that is, d1(p0) = d0(p1) (1) These maps can then be used to construct a certain continuous curve between p0and p1.
    [Show full text]
  • On the Beta Transformation
    On the Beta Transformation Linas Vepstas December 2017 (Updated Feb 2018 and Dec 2018) [email protected] doi:10.13140/RG.2.2.17132.26248 Abstract The beta transformation is the iterated map bx mod 1. The special case of b = 2 is known as the Bernoulli map, and is exactly solvable. The Bernoulli map provides a model for pure, unrestrained chaotic (ergodic) behavior: it is the full invariant shift on the Cantor space f0;1gw . The Cantor space consists of infinite strings of binary digits; it is notable for many properties, including that it can represent the real number line. The beta transformation defines a subshift: iterated on the unit interval, it sin- gles out a subspace of the Cantor space that is invariant under the action of the left-shift operator. That is, lopping off one bit at a time gives back the same sub- space. The beta transform seems to capture something basic about the multiplication of two real numbers: b and x. It offers insight into the nature of multiplication. Iterating on multiplication, one would get b nx – that is, exponentiation; the mod 1 of the beta transform contorts this in strange ways. Analyzing the beta transform is difficult. The work presented here is more-or- less a research diary: a pastiche of observations and some shallow insights. One is that chaos seems to be rooted in how the carry bit behaves during multiplication. Another is that one can surgically insert “islands of stability” into chaotic (ergodic) systems, and have some fair amount of control over how those islands of stability behave.
    [Show full text]
  • Pointwise Regularity of Parametrized Affine Zipper Fractal Curves
    POINTWISE REGULARITY OF PARAMETERIZED AFFINE ZIPPER FRACTAL CURVES BALAZS´ BAR´ ANY,´ GERGELY KISS, AND ISTVAN´ KOLOSSVARY´ Abstract. We study the pointwise regularity of zipper fractal curves generated by affine mappings. Under the assumption of dominated splitting of index-1, we calculate the Hausdorff dimension of the level sets of the pointwise H¨olderexpo- nent for a subinterval of the spectrum. We give an equivalent characterization for the existence of regular pointwise H¨olderexponent for Lebesgue almost every point. In this case, we extend the multifractal analysis to the full spectrum. In particular, we apply our results for de Rham's curve. 1. Introduction and Statements Let us begin by recalling the general definition of fractal curves from Hutchin- son [22] and Barnsley [3]. d Definition 1.1. A system S = ff0; : : : ; fN−1g of contracting mappings of R to itself is called a zipper with vertices Z = fz0; : : : ; zN g and signature " = ("0;:::;"N−1), "i 2 f0; 1g, if the cross-condition fi(z0) = zi+"i and fi(zN ) = zi+1−"i holds for every i = 0;:::;N − 1. We call the system a self-affine zipper if the functions fi are affine contractive mappings of the form fi(x) = Aix + ti; for every i 2 f0; 1;:::;N − 1g; d×d d where Ai 2 R invertible and ti 2 R . The fractal curve generated from S is the unique non-empty compact set Γ, for which N−1 [ Γ = fi(Γ): i=0 If S is an affine zipper then we call Γ a self-affine curve.
    [Show full text]
  • Computer Graphics
    CS6504-Computer Graphics M.I.E.T. ENGINEERING COLLEGE (Approved by AICTE and Affiliated to Anna University Chennai) TRICHY – PUDUKKOTTAI ROAD, TIRUCHIRAPPALLI – 620 007 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING COURSE MATERIAL CS6504 - COMPUTER GRAPHICS III YEAR - V SEMESTER M.I.E.T./CSE/III/Computer Graphics CS6504-Computer Graphics M.I.E.T. ENGINEERING COLLEGE DEPARTMENT OF CSE (Approved by AICTE and Affiliated to Anna University Chennai) TRICHY – PUDUKKOTTAISYLLABUS (THEORY) ROAD, TIRUCHIRAPPALLI – 620 007 Sub. Code :CS6504 Branch / Year / Sem : CSE / III / V Sub.Name : COMPUTER GRAPHICS Staff Name :B.RAMA L T P C 3 0 0 3 UNIT I INTRODUCTION 9 Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object geometry, filled area primitives. UNIT II TWO DIMENSIONAL GRAPHICS 9 Two dimensional geometric transformations – Matrix representations and homogeneous coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference frame; widow-to- viewport coordinate transformation, Two dimensional viewing functions; clipping operations – point, line, and polygon clipping algorithms. UNIT III THREE DIMENSIONAL GRAPHICS 10 Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygon tables- Plane equations - Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby objects; Spline representations – Bezier curves and surfaces -B-Spline curves and surfaces. TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling transformations – Translation, Rotation, Scaling, composite transformations; Three dimensional viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection methods.
    [Show full text]
  • Fractals in Dimension Theory and Complex Networks
    BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS DOCTORAL THESIS BOOKLET Fractals in dimension theory and complex networks Author: Supervisor: István KOLOSSVÁRY Dr. Károly SIMON Doctoral School of Mathematics and Computer Science Faculty of Natural Sciences 2019 1 Introduction The word "fractal" comes from the Latin fractus¯ meaning "broken" or "fractured". Since the 1970s, 80s, fractal geometry has become an important area of mathematics with many connections to theory and practice alike. The main aim of the Thesis is to demonstrate the diverse applicability of fractals in different areas of mathematics. Namely, 1. widen the class of planar self-affine carpets for which we can calculate the dif- ferent dimensions especially in the presence of overlapping cylinders, 2. perform multifractal analysis for the pointwise Hölder exponent of a family of continuous parameterized fractal curves in Rd including deRham’s curve, 3. show how hierarchical structure can be used to determine the asymptotic growth of the distance between two vertices and the diameter of a random graph model, which can be derived from the Apollonian circle packing problem. Chapter 1 of the thesis gives an introduction to these topics and informally ex- plains the contributions made in an accessible way to a wider mathematical audience. Chapters 2, 3 and 4 contain the precise definitions and rigorous formulations of our re- sults, together with the proofs. They are based on the papers [KS18; BKK18; KKV16], respectively. 1 Self-affine planar carpets A self-affine Iterated Function System (IFS) F consists of a finite collection of maps d d fi : R ! R of the form fi(x) = Aix + ti, d×d for i 2 [N] := f1, 2, .
    [Show full text]
  • Fractals in Dimension Theory and Complex Networks
    BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS DOCTORAL THESIS Fractals in dimension theory and complex networks Author: Supervisor: István KOLOSSVÁRY Dr. Károly SIMON Doctoral School of Mathematics and Computer Science Faculty of Natural Sciences 2019 iii Acknowledgements It is a great pleasure to thank the many people who have had a direct impact on my academic life in the past years. Foremost, I thank my supervisor Károly Simon. Beyond his deep knowledge of the field, his enthusiasm for mathematics and the unique way he gives it on has truly had a great influence on how I think about math and the world around us; Secondly, I thank my co-authors Balázs Bárány, Gergely Kiss, Júlia Komjáthy and Lajos Vágó. I gained valuable experience from each and every joint project; I thank the referees of my home defense for their thorough work. In particular, the comments of István Fazekas, which greatly improved the clarity of one of the chapters. Moreover, I thank the support and generous hospitality of all the colleagues at the Department of Stochastics. I feel very fortunate to have landed here after my bachelor years, thanks to Doma Szász. The atmosphere is inspiring for research and at the same time very friendly; and last but not least all the support I get from all my family and friends, who are in some way part of my life, even though many don’t know much about what I actually do on a daily basis. I acknowledge the financial support of different grants and scholarships without which all my travels, meeting many new colleagues, presenting results at conferences and learning many interesting topics would not have been possible.
    [Show full text]
  • Istoria Matematicii
    IstoriaMatematicii file:///C:/Programele%20Mele/IstoriaMatematicii/IstoriaMatematicii.html Istoria Matematicii Cuprins: Introducere Numere și reprezentarea lor Aritmetică Algebră Geometrie Analiză matematică Logică Matematică aplicată Matematică computațională Programarea calculatoarelor Repere istorice Introducere Din totdeauna, matematica a făcut apanajul potentaților vremii, a fost un instrument cu ajutorul căruia oamenii și-au măsurat bogăția, strălucirea sau puterea. Acest material nu își propune o înșiruire de date istorice sau nume ale unor matematicieni aranjate cronologic, ci mai degrabă o călătorie în timp prin universul matematicii, pentru a redescoperi ordinea în care s-au formulat principalele probleme și soluțiile lor. Dintre personalitățile matematicii, atenția se va abate mai mult asupra celor care au avut ceva de socotit, decât asupra acelora care au făcut socotelile. Oricare dintre realizările lor poate fi astăzi un bun exercițiu pentru scrie proiectul cu mijloace moderne, sau pentru calculul necesarului. Cel care poate alcătui proiectul și caietul de sarcini pentru Piramida lui Keops, sau pentru Zidul Chinezesc, va putea proiecta mai ușor o locuință modernă sau o anexă. Poate fi un exercițiu bun și calculația pentru un proiect ce utilizează doar tehnologia și resursele existente la vremea respectivă. Fiecare dintre subiectele propuse poate face subiectul unei disertații, al unui eseu sau al unei ore de curs facultativ. Nedorind a amalgama prea mult noțiunile și așa destul de complexe, șirul povestirii este deșirat în mai multe capitole, structurate pentru diferitele ramuri ale matematicii. Textul nu are caracter didactic dar poate inspira viitorii profesori de matematică. Este bun un pretext pentru o călătorie în timp, un fel de temă de casă a unui elev mai întârziat ca vârstă.
    [Show full text]
  • WO 2015/140157 Al 24 September 2015 (24.09.2015) P O P C T
    (12) INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT) (19) World Intellectual Property Organization International Bureau (10) International Publication Number (43) International Publication Date WO 2015/140157 Al 24 September 2015 (24.09.2015) P O P C T (51) International Patent Classification: (72) Inventor: BARTELS, Rudolf; c/o Agfa Graphics NV, IP G06K 7/10 (2006.01) G06K 19/06 (2006.01) Department 3622, Septestraat 27, B-2640 Mortsel (BE). (21) International Application Number: (74) Agent: STRIJCKERS, Hans; Agfa Graphics NV, IP De PCT/EP2015/055536 partment 3622, Septestraat 27, B-2640 Mortsel (BE). (22) International Filing Date: (81) Designated States (unless otherwise indicated, for every 17 March 2015 (17.03.2015) kind of national protection available): AE, AG, AL, AM, AO, AT, AU, AZ, BA, BB, BG, BH, BN, BR, BW, BY, English (25) Filing Language: BZ, CA, CH, CL, CN, CO, CR, CU, CZ, DE, DK, DM, (26) Publication Language: English DO, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, GT, HN, HR, HU, ID, IL, IN, IR, IS, JP, KE, KG, KN, KP, KR, (30) Priority Data: KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, MG, 14160243.3 17 March 2014 (17.03.2014) EP MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, OM, (71) Applicant: AGFA GRAPHICS NV [BE/BE]; IP Depart PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, ment 3622, Septestraat 27, B-2640 Mortsel (BE). SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW.
    [Show full text]
  • The Minkowski Question Mark, Gl(2,Z) and the Modular Group (Expository)
    THE MINKOWSKI QUESTION MARK, GL(2,Z) AND THE MODULAR GROUP (EXPOSITORY) LINAS VEPSTAS ABSTRACT. Fractals and continued fractions seem to be deeply related in many ways. Farey fractions appear naturally in both. Much of this relationship can be explained through the fact that a certain subset of the general linear group GL(2,Z) over the integers; called the “dyadic monoid”, “dyadic groupoid”, or “dyadic lattice”, is the natural symmetry of many fractals, including those associated with period-doubling maps, with phase-locking maps, and with various dynamical systems in general. The aim of this text is to provide a simple exposition of the symmetry and its articulation. The core underlying idea is that many fractals can be represented as an infinite binary tree. Aside from fractals, binary numbers (or “dyadic numbers”) can also be represented as a binary tree. A string of 1’s and 0’s can be understood to be a choice of left and right movements through the branches of a tree; which gives it the structure of the Cantor set. The rational numbers also may be arranged into a binary tree, which is variously called a Farey tree or a Stern-Brocot tree. The Minkowski question mark function arises as the isomorphism between the tree of dyadic numbers, and the tree of rational numbers. Fractal self-similarity arises naturally, with the observation that a subtree of a binary tree is isomorphic to the tree itself. This paper is written at an expository level, and should be readily accessible to ad- vanced undergraduates and all graduate students.
    [Show full text]
  • Symmetries of Period-Doubling Maps
    Symmetries of Period-Doubling Maps Linas Vepstas <[email protected]> 12 October 2004 (revised 1 September 2006) Abstract The concept of self-similarity is central to the notion of a fractal, but the actual symmetry group that generates that self-similarity is rarely named, and it seems fractals are almost never studied according to their symmetries. Yet, in other branches of mathematics and physics, it is well understood that symmetry pro- vides a powerful mechanism for understanding systems. In this paper, we identify the symmetry group of period-doubling maps as being a monoid (semigroup) of the modular group PSL(2;Z). To anchor this assertion, we work out an explicit, exactly-solvable fractal curve, the Takagi or Blancmange Curve, as transforming under the three-dimensional representation of the (monoid of the) modular group. By replacing the triangular shape that generates the Blanc- mange curve with a polynomial, we find that the resulting curve transforms under the n + 2 dimensional representation of the monoid, where n is the degree of the polynomial. We also find that the (ill-defined) derivative of the Blancmange curve is essentially the (inverse of the) Cantor function, thus demonstrating the semi- group symmetry on the Cantor Set as well. In fact, any topologically conjugate map will transform under the three-dimensional representation. We then show how all period-doubling maps can demonstrate the monoid symmetry, which is essentially an outcome of the dyadic representation of the monoid. This paper also includes a review of Georges deRham’s 1958 construction of the Koch snowflake, the Levy C-curve, the Peano space-filling curve and the Minkowski Question Mark function as special cases of a curve with the monoid symmetry.
    [Show full text]
  • Bundle Block Adjustment with 3D Natural Cubic Splines
    BUNDLE BLOCK ADJUSTMENT WITH 3D NATURAL CUBIC SPLINES DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Won Hee Lee, B.S., M.S. ***** The Ohio State University 2008 Dissertation Committee: Approved by Prof. Anton F. Schenk, Adviser Prof. Alper Yilmaz, Co-Adviser Adviser Prof. Ralph von Frese Graduate Program in Geodetic Science & Surveying c Copyright by Won Hee Lee 2008 ABSTRACT One of the major tasks in digital photogrammetry is to determine the orienta- tion parameters of aerial imageries correctly and quickly, which involves two primary steps of interior orientation and exterior orientation. Interior orientation defines a transformation to a 3D image coordinate system with respect to the camera’s per- spective center, while a pixel coordinate system is the reference system for a digital image, using the geometric relationship between the photo coordinate system and the instrument coordinate system. While the aerial photography provides the interior orientation parameters, the problem is reduced to determine the exterior orientation with respect to the object coordinate system. Exterior orientation establishes the position of the camera projection center in the ground coordinate system and three rotation angles of the camera axis to represent the transformation between the image and the object coordinate system. Exterior orientation parameters (EOPs) of the stereo model consisting of two aerial imageries can be obtained using relative and absolute orientation. EOPs of multiple overlapping aerial imageries can be computed using bundle block adjustment. Bundle block adjustment reduces the cost of field surveying in difficult areas and verifies the accuracy of field surveying during the process of bundle block adjustment.
    [Show full text]
  • Some Results for Conjugate Equations
    SOME RESULTS FOR CONJUGATE EQUATIONS KAZUKI OKAMURA Abstract. In this paper we consider a class of conjugate equations, which generalizes de Rham’s functional equations. We give sufficient conditions for existence and uniqueness of solutions under two differ- ent series of assumptions. We consider regularity of solutions. In our framework, two iterated function systems are associated with a series of conjugate equations. We state local regularity by using the invariant measures of the two iterated function systems with a common probabil- ity vector. We give several examples, especially an example such that infinitely many solutions exists, and a new class of fractal functions on the two-dimensional standard Sierpi´nski gasket which are not harmonic functions or fractal interpolation functions. We also consider a certain kind of stability. Contents 1. Introduction 1 2. Existence and uniqueness 3 3. Regularity 6 4. Examples for existence and uniqueness 14 5. Examples for regularity 19 6. Stability 23 7. Open problems 26 References 27 1. Introduction In this paper we consider the following functional equation. Let X and Y be non-empty sets. Let I be a finite set. Assume that for i I, a subset ∈ Xi X, and two maps fi : Xi X and gi : X Y Y are given. Now arXiv:1806.06197v2 [math.CA] 17 Dec 2018 consider⊂ the solution ϕ : X Y→satisfying that × → → ϕ(f (x)) = g (x, ϕ(x)), x X , i I. (1.1) i i ∈ i ∈ The functional equation above is a generalization of de Rham’s functional equation [dR57] and in the framework of iterative functional equations (cf.
    [Show full text]