Results 1 - 10 of 4,746

The decimation-Hadamard transform of two-level autocorrelation sequences

by Guang Gong, Solomon W. Golomb - IEEE Trans. Inform. Theory , 2002
"... Abstract—A new method to study and search for two-level autocorrelation sequences for both binary and nonbinary cases is developed. This method iteratively applies two operations: deci-mation and the Hadamard transform based on general orthogonal functions, referred to as the decimation-Hadamard tra ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
Abstract—A new method to study and search for two-level autocorrelation sequences for both binary and nonbinary cases is developed. This method iteratively applies two operations: deci-mation and the Hadamard transform based on general orthogonal functions, referred to as the decimation-Hadamard

New Ternary and Quaternary Sequences with Two-Level Autocorrelation

by Honggang Hu, Guang Gong
"... Pseudorandom sequences with good correlation properties are widely used in communications and cryptography. The search of new sequences with two-level autocorrelation has been a very interesting problem for decades. In 2002, Gong and Golomb proposed the iterative decimation-Hadamard transform (DHT) ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Pseudorandom sequences with good correlation properties are widely used in communications and cryptography. The search of new sequences with two-level autocorrelation has been a very interesting problem for decades. In 2002, Gong and Golomb proposed the iterative decimation-Hadamard transform (DHT

The Contourlet Transform: An Efficient Directional Multiresolution Image Representation

by Minh N. Do, Martin Vetterli - IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” two-dimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract - Cited by 513 (20 self) - Add to MetaCart
flexible multiresolution, local, and directional image expansion using contour segments, and thus it is named the contourlet transform. The discrete contourlet transform has a fast iterated filter bank algorithm that requires an order N operations for N-pixel images. Furthermore, we establish a precise

Mean shift, mode seeking, and clustering

by Yizong Cheng - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1995
"... Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking proce ..."
Abstract - Cited by 624 (0 self) - Add to MetaCart
Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode

Factor Graphs and the Sum-Product Algorithm

by Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger - IEEE TRANSACTIONS ON INFORMATION THEORY , 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract - Cited by 1791 (69 self) - Add to MetaCart
be derived as specific instances of the sum-product algorithm, including the forward/backward algorithm, the Viterbi algorithm, the iterative "turbo" decoding algorithm, Pearl's belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform algorithms.

An affine invariant interest point detector

by Krystian Mikolajczyk, Cordelia Schmid - In Proceedings of the 7th European Conference on Computer Vision , 2002
"... Abstract. This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such transformations introduce significant changes in the point location as well as in the scale and the shape of ..."
Abstract - Cited by 1467 (55 self) - Add to MetaCart
Abstract. This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such transformations introduce significant changes in the point location as well as in the scale and the shape

K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

by Michal Aharon, et al. , 2006
"... In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and inc ..."
Abstract - Cited by 935 (41 self) - Add to MetaCart
by either selecting one from a prespecified set of linear transforms or adapting the dictionary to a set of training signals. Both of these techniques have been considered, but this topic is largely still open. In this paper we propose a novel algorithm for adapting dictionaries in order to achieve sparse

The Proof of Lin’s Conjecture via the Decimation-Hadamard Transform

by Honggang Hu, Shuai Shao, Guang Gong, Tor Helleseth
"... In 1998, Lin presented a conjecture on a class of ternary sequences with ideal 2-level autocor-relation in his Ph.D thesis. Those sequences have a very simple structure, i.e., their trace repre-sentation has two trace monomial terms. In this paper, we present a proof for the conjecture. The mathemat ..."
Abstract - Add to MetaCart
. The mathematical tools employed are the second-order multiplexing decimation-Hadamard transform, Stickelberger’s theorem, the Teichmüller character, and combinatorial techniques for enumerating the Hamming weights of ternary numbers. As a by-product, we also prove that the Lin conjectured ternary sequences

A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients

by Javier Portilla, Eero P. Simoncelli - INTERNATIONAL JOURNAL OF COMPUTER VISION , 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract - Cited by 424 (13 self) - Add to MetaCart
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We

Image coding based on a fractal theory of iterated contractive image transformations

by Arnaud E. Jacquin - IEEE Trans. Image Process , 1992
"... Abstract-The conception of digital image coding techniques is of great interest in various areas concerned with the storage or transmission of images. For the past few years, there has been a tendency to combine different classical coding tech-niques in order to obtain greater coding efficiency. In ..."
Abstract - Cited by 331 (0 self) - Add to MetaCart
. In this paper, we propose an independent and novel ap-proach to image coding, based on a fractal theory of iterated transformations. The main characteristics of this approach are that i) it relies on the assumption that image redundancy can be efficiently exploited through self-transformability on a block
Results 1 - 10 of 4,746