Objective assessment of pilling of nonwoven fabrics using the two dimensional discrete wavelet transform

Fabric pilling is a serious problem for the apparel industry, causing an unsightly appearance and premature wear. Woolen products are particularly prone to pilling. Recently, a process for production of woolen nonwoven apparel fabrics has been commercialized in Australia, and may lead to new markets for Australian wool. However, the success of such nonwoven fabrics will partly rely on their propensity to pill. A key element in the control of fabric pilling is the evaluation of resistance to pilling by testing. Resistance to pilling is normally tested in the laboratory by processes that simulate accelerated wear, followed by a manual assessment of the degree of pilling by an expert based on a visual comparison of the sample to a set of test images. To bring more objectivity into the pilling rating process, a number of automated systems based on image analysis have been developed. The authors previously proposed a new method of image analysis based on the two-dimensional discrete wavelet transform to objectively measure the pilling intensity for woven fabrics. This paper presents preliminary work in extending this method to nonwoven fabrics.

H∞ observer-based control for discrete-time one-sided Lipschitz systems with unknown inputs

This paper investigates the problem of robust observer-based stabilization for a class of one-sided nonlinear discrete-time systems subjected to unknown inputs. We propose a simple simultaneous state and input estimator. A nonlinear controller is then proposed to compensate for the effects of unknown inputs and to ensure asymptotic stability in a closed loop. Several mathematical artifacts are used to deduce stability conditions expressed in terms of linear matrix inequalities. To show high performances of the proposed technique, a relevant example is provided with comparisons to recent results.

Discrete Wirtinger-based inequality and its application

In this paper, we derive a new inequality, which encompasses the discrete Jensen inequality. The new inequality is applied to analyze stability of linear discrete systems with an interval time-varying delay and a less conservative stability condition is obtained. Two numerical examples are given to show the effectiveness of the obtained stability condition.

Discrete approximations for strict convex continuous time problems and duality

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Peirce's mathematical-logical approach to discrete collections and the premonition of continuity

According to Peirce one of the most important philosophical problems is continuity. Consequently, he set forth an innovative and peculiar approach in order to elucidate at once its mathematical and metaphysical challenges through proper non-classical logical reasoning. I will restrain my argument to the definition of the different types of discrete collections according to Peirce, with a special regard to the phenomenon called premonition of continuity (Peirce, 1976, Vol. 3, p. 87, c. 1897). © 2012 Copyright Taylor and Francis Group, LLC.

On computational aspects of discrete Sobolev inner products on the unit circle

In this paper, we show how to compute in O(n2) steps the Fourier coefficients associated with the Gelfand-Levitan approach for discrete Sobolev orthogonal polynomials on the unit circle when the support of the discrete component involving derivatives is located outside the closed unit disk. As a consequence, we deduce the outer relative asymptotics of these polynomials in terms of those associated with the original orthogonality measure. Moreover, we show how to recover the discrete part of our Sobolev inner product. © 2013 Elsevier Inc. All rights reserved.

Zeros of classical orthogonal polynomials of a discrete variable

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Stieltjes functions and discrete classical orthogonal polynomials

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Riemannian Submersions with Discrete Spectrum

We prove some estimates on the spectrum of the Laplacian of the total space of a Riemannian submersion in terms of the spectrum of the Laplacian of the base and the geometry of the fibers. When the fibers of the submersions are compact and minimal, we prove that the spectrum of the Laplacian of the total space is discrete if and only if the spectrum of the Laplacian of the base is discrete. When the fibers are not minimal, we prove a discreteness criterion for the total space in terms of the relative growth of the mean curvature of the fibers and the mean curvature of the geodesic spheres in the base. We discuss in particular the case of warped products.

How far is C-0(Gamma, X) with Gamma discrete from C-0(K, X) spaces?

For a locally compact Hausdorff space K and a Banach space X we denote by C-0(K, X) the space of X-valued continuous functions on K which vanish at infinity, provided with the supremum norm. Let n be a positive integer, Gamma an infinite set with the discrete topology, and X a Banach space having non-trivial cotype. We first prove that if the nth derived set of K is not empty, then the Banach-Mazur distance between C-0(Gamma, X) and C-0(K, X) is greater than or equal to 2n + 1. We also show that the Banach-Mazur distance between C-0(N, X) and C([1, omega(n)k], X) is exactly 2n + 1, for any positive integers n and k. These results extend and provide a vector-valued version of some 1970 Cambern theorems, concerning the cases where n = 1 and X is the scalar field.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Computation of discrete cosine transform using Clenshaw's recurence formula

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.

Efficient implementation of discrete Pascal transform using difference operators

An alternative way is provided to define the discrete Pascal transform using difference operators to reveal the fundamental concept of the transform, in both one- and two-dimensional cases, which is extended to cover non-square two-dimensional applications. Efficient modularised implementations are proposed.

Digital signal processing and digital system design using discrete cosine transform [student course]

The discrete cosine transform (DCT) is an important functional block for image processing applications. The implementation of a DCT has been viewed as a specialized research task. We apply a micro-architecture based methodology to the hardware implementation of an efficient DCT algorithm in a digital design course. Several circuit optimization and design space exploration techniques at the register-transfer and logic levels are introduced in class for generating the final design. The students not only learn how the algorithm can be implemented, but also receive insights about how other signal processing algorithms can be translated into a hardware implementation. Since signal processing has very broad applications, the study and implementation of an extensively used signal processing algorithm in a digital design course significantly enhances the learning experience in both digital signal processing and digital design areas for the students.

Oscillatory regulation of hes1: Discrete stochastic delay modelling and simulation

Discrete stochastic simulations are a powerful tool for understanding the dynamics of chemical kinetics when there are small-to-moderate numbers of certain molecular species. In this paper we introduce delays into the stochastic simulation algorithm, thus mimicking delays associated with transcription and translation. We then show that this process may well explain more faithfully than continuous deterministic models the observed sustained oscillations in expression levels of hes1 mRNA and Hes1 protein.