Search results for "Computer Science::Graphics"

showing 10 items of 67 documents

Logarithmic bundles of deformed Weyl arrangements of type $A_2$

2016

We consider deformations of the Weyl arrangement of type $A_2$, which include the extended Shi and Catalan arrangements. These last ones are well-known to be free. We study their sheaves of logarithmic vector fields in all other cases, and show that they are Steiner bundles. Also, we determine explicitly their unstable lines. As a corollary, some counter-examples to the shift isomorphism problem are given.

Pure mathematicsLogarithmic sheavesLogarithmMSC: 52C35 14F05 32S22General Mathematics010102 general mathematicsType (model theory)Weyl arrangements01 natural sciences[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]Mathematics - Algebraic GeometryComputer Science::GraphicsCorollary0103 physical sciencesFOS: Mathematics010307 mathematical physicsIsomorphism[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]0101 mathematicsRoot systemsLine arrangementsMSC 52C35 14F05 32S22Algebraic Geometry (math.AG)Mathematics
researchProduct

Analytic Properties of Quasiconformal Mappings Between Metric Spaces

2012

We survey recent developments in the theory of quasiconformal mappings between metric spaces. We examine the various weak definitions of quasiconformality, and give conditions under which they are all equal and imply the strong classical properties of quasiconformal mappings in Euclidean spaces. We also discuss function spaces preserved by quasiconformal mappings.

Pure mathematicsQuasiconformal mappingMathematics::Dynamical SystemsExtremal lengthMathematics::Complex VariablesInjective metric spaceProduct metricTopologyTriebel–Lizorkin spaceConvex metric spaceMetric spaceComputer Science::GraphicsMetric mapMathematics
researchProduct

Real-time content-aware image resizing using reduced linear model

2010

In this paper an effective and efficient method for contentaware image resizing is proposed. It is based on the solution of a linear system where each pixel displacement (compression or expansion) is determined in dependence of the visual relevance of the pixel itself. The linear nature of the model allows real-time application of the method even for large images. This fully automatic approach can be also improved by interactively providing cues such as geometric constraints and/or manual relevant object labeling. The results have proven that the presented method achieves results comparable or superior to existent strategies, while improving efficiency.

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniPixelImage resizing Image retargeting linear optimization visual saliencyPhysics::Instrumentation and Detectorsbusiness.industryComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONLinear modelIterative reconstructionDisplacement (vector)Computer Science::GraphicsSeam carvingComputer Science::Computer Vision and Pattern RecognitionComputer Science::MultimediaComputer visionArtificial intelligencebusinessImage resolutionComputingMethodologies_COMPUTERGRAPHICS2010 IEEE International Conference on Image Processing
researchProduct

Cubic Local Splines on Non-uniform Grid

2015

In this chapter, two types of local cubic splines on non-uniform grids are described: 1. The simplest variation-diminishing splines and 2. The quasi-interpolating splines. The splines are computed by a simple fast computational algorithms that utilizes a relation between the splines and cubic interpolation polynomials. Those splines can serve as an efficient tool for real-time signal processing. As an input, they use either clean or noised arbitrarily-spaced samples. On the other hand, the capability to adapt the grid to the structure of an object and minimal requirements to the operating memory are great advantages for off-line processing of signals and multidimensional data arrays.

Signal processingBox splineRelation (database)Computer scienceMathematicsofComputing_NUMERICALANALYSISMonotone cubic interpolationGridMathematics::Numerical AnalysisComputer Science::GraphicsSimple (abstract algebra)Bicubic interpolationSpline interpolationAlgorithmComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Local Splines on Non-uniform Grid

2018

In this Chapter and in the next Chap. 7, we deal with continuous rather than discrete and discrete-time splines. In these and only these chapters, we abandon the assumption that the grid, on which the splines are constructed, is uniform and consider splines on arbitrary grids. Two types of local cubic and quadratic splines on non-uniform grids are described: 1. The simplest variation-diminishing splines and 2. The quasi-interpolating splines. The splines are computed by simple fast computational algorithms that utilize relations between the splines and interpolation polynomials. In addition, these relations provide sharp estimations of splines’ approximation accuracy. These splines can serv…

Signal processingComputer Science::GraphicsQuadratic equationSimple (abstract algebra)Computer scienceStructure (category theory)Multidimensional dataObject (computer science)GridAlgorithmInterpolation
researchProduct

Analytic capacity and quasiconformal mappings with $W^{1,2}$ Beltrami coefficient

2008

We show that if $\phi$ is a quasiconformal mapping with compactly supported Beltrami coefficient in the Sobolev space $W^{1,2}$, then $\phi$ preserves sets with vanishing analytic capacity. It then follows that a compact set $E$ is removable for bounded analytic functions if and only if it is removable for bounded quasiregular mappings with compactly supported Beltrami coefficient in $W^{1,2}$.

Sobolev spaceQuasiconformal mappingComputer Science::GraphicsCompact spaceMathematics::Complex VariablesGeneral MathematicsBounded functionMathematical analysisAnalytic capacityAnalytic functionMathematicsMathematical Research Letters
researchProduct

Periodic Discrete and Discrete-Time Splines

2018

Periodic discrete splines with different periods and spans are introduced in Sect. 3.4 of Volume I (Averbuch, Neittaanmaki and Zheludev, Spline and Spline Wavelet Methods with Applications to Signal and Image Processing, Springer, Berlin, 2014) [2]. In this chapter, we regard periodic discrete splines as a base for the design of periodic discrete-time wavelets, wavelet packets and wavelet frames. Therefore, only the discrete splines whose spans are 2 are outlined. These discrete splines are linear combinations of the discrete B-splines. So also, the so-called discrete-time splines are discussed in the chapter that are linear combinations of the discrete-time B-splines. The discrete-time B-s…

Spline (mathematics)Computer Science::GraphicsWaveletDiscrete time and continuous timeComputer scienceSpline waveletFast Fourier transformApplied mathematicsImage processingLinear combinationMathematics::Numerical AnalysisWavelet packet decomposition
researchProduct

Quasi-interpolating and Smoothing Local Splines

2015

In this chapter, local quasi-interpolating and smoothing splines are described. Although approximation properties of local spline are similar to properties of the global interpolating and smoothing splines, their design does not require the IIR filtering of the whole data array. The computation of a local spline value at some point utilizes only a few adjacent grid samples. Therefore, local splines can be used for real-time processing of signals and for the design of FIR filter banks generating wavelets and wavelet frames (Chaps. 12 and 14). In the chapter, local splines of different orders are designed and their approximation properties are established which are compared with the propertie…

Spline (mathematics)Smoothing splineComputer Science::GraphicsWaveletFinite impulse responseComputer scienceApproximation propertyComputationApplied mathematicsArray data typeSmoothingMathematics::Numerical Analysis
researchProduct

A new method for linear affine self-calibration of stationary zooming stereo cameras

2012

This paper presents a simple, yet effective, method to recover the affine structure of a scene from a (stereo) pair of stationary zooming cameras. The proposed method solely relies on point correspondences across images and no knowledge about the scene whatsoever is required. Our method exploits implicit properties of the projective camera matrices of zooming cameras and allows to estimate the affine structure of a scene by solving a linear system of equations. The 3D reconstruction results obtained by using our method, on both real and simulated data, have remarkably validated its feasibility.

Stereo camerasbusiness.industry3D reconstructionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONIterative reconstructionAffine shape adaptationComputer Science::GraphicsComputer Science::Computer Vision and Pattern RecognitionLinear algebraComputer visionAffine transformationArtificial intelligenceZoombusinessStereo cameraComputingMethodologies_COMPUTERGRAPHICSMathematics2012 19th IEEE International Conference on Image Processing
researchProduct

Bézier surfaces of minimal area

2002

There are minimal surfaces admitting a Bezier form. We study the properties that the associated net of control points must satisfy. We show that in the bicubical case all minimal surfaces are, up to an affine transformation, pieces of the Enneper's surface.

Surface (mathematics)Computer Science::GraphicsMinimal surfaceNet (polyhedron)Bézier curveGeometryAffine transformationMathematics
researchProduct