Graphs in this paper are finite and undirected and may have loops or multiple edges. The vertexand edge-sets of a graph G are denoted by V(G) and E(G). If G, = ( V1, E,), G2 = ( V2, E2) are subgraphs of a graph G, we denote the graphs (V1n V2,E1nE,) and (V,u V2, EluEZ) by G,nG, and G, u GZ, respectively. A separation of a graph G is a pair (G,, G2) of subgraphs with G1 u G2 = G and E(G1 n G2) =...

Let f(2, 3, 4) denote the smallest integer n such that there exists a K4-free graph of order n for which any 2-coloring of its edges yields at least one monochromatic triangle. It is well-known that such a number must exist. For a long time the best known upper bound, provided by J. Spencer, said that f(2, 3, 4) < 3 · 10. Recently, L. Lu announced that f(2, 3, 4) < 10 000. In this note, we will...

A new method for generating x-y separable steerable scalable approximations offilter kemels is proposed which is based on a generalization of the Singular Value Decomposition (SVD) to 3 dimensions. This “pseudo-SVD ” impmves upon a p w w u s scheme due to Pemna in that it reduces convolution time and storage requirements. An adaptation of the pseudo-SVD is proposed to generate steerable and sca...

This paper describes a method that tries to improve the accuracy of a machine vision algorithm for frayed edge detection in coldrolled electrical grain oriented steel plate with usage of the Singular Value Decomposition. The algorithm being improved is based on preprocessing the image with the Multi Scale Retinex algorithm, application of the Sobel filter and additional evaluation logic.

Accurate recognition of sound patterns in spectrograms is important step for further recognition applications. However, background noise forms fundamental problem regardless the species under study. In this paper, crest factor feature was extracted from the limited dynamic range spectrogram. The developed crest factor image behaved as smoothed version of the spectrogram, at which edges of the i...

Target detection is an important issue in the HyperSpectral Image (HSI) processing field. However, current spectral-identificationbased target detection algorithms are sensitive to the noise and most denoising algorithms cannot preserve small targets, therefore it is necessary to design a robust detection algorithm that can preserve small targets. This paper utilizes the recently proposed multi...

We call H a minor of a graph G if H is obtainable from a subgraph of G by edge contractions. If g ≥ 2, the g-grid is the simple graph with vertices vij (1 ≤ i, j ≤ g) where vij and vi′j′ are adjacent if |i− i′|+ |j − j′| = 1; see Robertson and Seymour (1991). A tree-decomposition of a graph G , is a pair (T, S), where T is a tree and S = {St : t ∈ V (T )} is a family of subsets of V (G), called...

Singular spectrum analysis is developed as a nonparametric spectral decomposition of a time series. It can be easily extended to the decomposition of multidimensional lattice-like data through the filtering interpretation. In this viewpoint, the singular spectrum analysis can be understood as the adaptive and optimal generation of the filters and their two-step point-symmetric operation to the ...

Three-dimensional (3-D) video compression using wavelets decomposition along the temporal axis dictates that a number of video frames must be buffered to allow for the temporal decomposition. Buffering of frames allows for the temporal correlation to be made use of, and the larger the buffer the more effective the decomposition. One problem inherent in such a set up in interactive applications ...

The dual boundary element method is formulated for the analysis of linear elastic cracked plates. The dual boundary integral equations of the method are the displacement and the traction equations. When these equations are simultaneously applied along the crack boundaries, general crack problems can be solved in a single-region formulation, with both crack boundaries discretized with discontinu...