• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Rotation invariant texture characterization and retrieval using steerable wavelet-domain hidden markov models, (2002)

by M N Do, M Vetterli
Venue:IEEE Transactions On Multimedia
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 55
Next 10 →

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

by Alfred M. Bruckstein, David L. Donoho, Michael Elad , 2007
"... A full-rank matrix A ∈ IR n×m with n < m generates an underdetermined system of linear equations Ax = b having infinitely many solutions. Suppose we seek the sparsest solution, i.e., the one with the fewest nonzero entries: can it ever be unique? If so, when? As optimization of sparsity is combin ..."
Abstract - Cited by 427 (36 self) - Add to MetaCart
A full-rank matrix A ∈ IR n×m with n &lt; m generates an underdetermined system of linear equations Ax = b having infinitely many solutions. Suppose we seek the sparsest solution, i.e., the one with the fewest nonzero entries: can it ever be unique? If so, when? As optimization of sparsity is combinatorial in nature, are there efficient methods for finding the sparsest solution? These questions have been answered positively and constructively in recent years, exposing a wide variety of surprising phenomena; in particular, the existence of easily-verifiable conditions under which optimally-sparse solutions can be found by concrete, effective computational methods. Such theoretical results inspire a bold perspective on some important practical problems in signal and image processing. Several well-known signal and image processing problems can be cast as demanding solutions of undetermined systems of equations. Such problems have previously seemed, to many, intractable. There is considerable evidence that these problems often have sparse solutions. Hence, advances in finding sparse solutions to underdetermined systems energizes research on such signal and image processing problems – to striking effect. In this paper we review the theoretical results on sparse solutions of linear systems, empirical
(Show Context)

Citation Context

... A. How can we wisely choose A to perform well on the signals we have in mind? One line of work considered choosing preconstructed dictionaries, such as undecimated wavelets [149], steerable wavelets =-=[145, 37, 136]-=-, contourlets [38, 39, 40, 70, 71], curvelets [146, 12], and others [22, 123]. These are generally suitable for stylized “cartoon-like” image content, assumed to be piecewise smooth and with smooth bo...

Wavelet-Based Texture Retrieval Using Generalized Gaussian Density and Kullback-Leibler Distance

by Minh N. Do, Martin Vetterli - IEEE Trans. Image Processing , 2002
"... We present a statistical view of the texture retrieval problem by combining the two related tasks, namely feature extraction (FE) and similarity measurement (SM), into a joint modeling and classification scheme. We show that using a consistent estimator of texture model parameters for the FE step fo ..."
Abstract - Cited by 241 (4 self) - Add to MetaCart
We present a statistical view of the texture retrieval problem by combining the two related tasks, namely feature extraction (FE) and similarity measurement (SM), into a joint modeling and classification scheme. We show that using a consistent estimator of texture model parameters for the FE step followed by computing the Kullback--Leibler distance (KLD) between estimated models for the SM step is asymptotically optimal in term of retrieval error probability. The statistical scheme leads to a new wavelet-based texture retrieval method that is based on the accurate modeling of the marginal distribution of wavelet coefficients using generalized Gaussian density (GGD) and on the existence a closed form for the KLD between GGDs. The proposed method provides greater accuracy and flexibility in capturing texture information, while its simplified form has a close resemblance with the existing methods which uses energy distribution in the frequency domain to identify textures. Experimental results on a database of 640 texture images indicate that the new method significantly improves retrieval rates, e.g., from 65% to 77%, compared with traditional approaches, while it retains comparable levels of computational complexity.

Directional multiresolution image representations

by Minh N. Do , 2001
"... Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an object of interest in a small description. For ..."
Abstract - Cited by 131 (10 self) - Add to MetaCart
Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an object of interest in a small description. For practical applications, this representation has to be realized by structured transforms and fast algorithms. Recently, it has become evident that commonly used separable transforms (such as wavelets) are not necessarily best suited for images. Thus, there is a strong motivation to search for more powerful schemes that can capture the intrinsic geometrical structure of pictorial information. This thesis focuses on the development of new “true ” two-dimensional representations for images. The emphasis is on the discrete framework that can lead to algorithmic implementations. The first method constructs multiresolution, local and directional image expansions by using non-separable filter banks. This discrete transform is developed in connection with the continuous-space
(Show Context)

Citation Context

...e “9-7” filters from [31, 174]. Another interesting example is based on the original LP filter suggested in [18], which is especially popular for applications in vision, together with its dual filter =-=[5]-=-. Tables 2.1 and 2.2 list the filter coefficients. Note that these filters are symmetric and very close to being orthogonal. As a result, the proposed reconstruction in Figure 2.3 is very close to the...

Why simple shrinkage is still relevant for redundant representations

by Michael Elad - IEEE Trans. Inf. Theory , 2006
"... General Description • Problem statement: Shrinkage is a well known and appealing denoising technique, introduced originally by Donoho and Johnstone in 1994. The use of shrinkage for denoising is known to be optimal for Gaussian white noise, provided that the sparsity on the signal's representa ..."
Abstract - Cited by 115 (12 self) - Add to MetaCart
General Description • Problem statement: Shrinkage is a well known and appealing denoising technique, introduced originally by Donoho and Johnstone in 1994. The use of shrinkage for denoising is known to be optimal for Gaussian white noise, provided that the sparsity on the signal&apos;s representation is enforced using a unitary transform. Still, shrinkage is also practiced with non-unitary, and even redundant representations, typically leading to satisfactory results. In this paper we shed some light on this behavior. • Originality of the work: The main argument in this paper is that such simple shrinkage could be interpreted as the first iteration of an algorithm that solves the basis pursuit denoising (BPDN) problem. While the desired solution of BPDN is hard to obtain in general, a simple iterative procedure that amounts to step-wise shrinkage can be employed with quite successful performance. • New results: We demonstrate how the simple shrinkage emerges as the first iteration of such algorithm. Furthermore, we show how shrinkage can be iterated, turning into an effective algorithm that minimizes the BPDN via simple shrinkage steps, in order to further strengthen the denoising effect. Lastly, the emerging algorithm stands in between the basis and the matching pursuit as a novel and appealing pursuit technique for atom decomposition in the presence of noise.
(Show Context)

Citation Context

... S{Wy}, and finally, an inverse wavelet transform to produce the outcome x. Such a direct solution stands as a refreshing alternative to the iterative and slow methods mentioned above. This shrinkage algorithm becomes indeed the optimal solver of (1). This optimality depends strongly on the `2-norm used in evaluating the distance x−y, and this has direct roots in the white Gaussianity assumptions on the noise. Also, crucial to the optimality of this method is the orthogonality of W. A new trend of recent years is the use of overcomplete transforms, replacing the traditional unitary ones (see [9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] as representative works). This trend was partly motivated by the growing realization that orthogonal wavelets are weak in describing the singularities found in images. Another driving force in the introduction of redundant representations is the sparsity in the representation it can provide, which many applications find desirable. Finally, we should mention the desire to obtain shift-invariant transforms, again calling for redundancy in the representation. In these methods the transform is defined via a non-square full rank matrix T ∈ IRL×N , with L > N . Such redundant methods, like the un-d...

Design of steerable filters for feature detection using Canny-like criteria

by Mathews Jacob, Michael Unser - and Ph.D. degrees in electrical engineering from the Swiss Federal Institute of Technology (EPFL , 2004
"... Abstract—We propose a general approach for the design of 2D feature detectors from a class of steerable functions based on the optimization of a Canny-like criterion. In contrast with previous computational designs, our approach is truly 2D and provides filters that have closed-form expressions. It ..."
Abstract - Cited by 69 (11 self) - Add to MetaCart
Abstract—We propose a general approach for the design of 2D feature detectors from a class of steerable functions based on the optimization of a Canny-like criterion. In contrast with previous computational designs, our approach is truly 2D and provides filters that have closed-form expressions. It also yields operators that have a better orientation selectivity than the classical gradient or Hessian-based detectors. We illustrate the method with the design of operators for edge and ridge detection. We present some experimental results that demonstrate the performance improvement of these new feature detectors. We propose computationally efficient local optimization algorithms for the estimation of feature orientation. We also introduce the notion of shape-adaptable feature detection and use it for the detection of image corners.
(Show Context)

Citation Context

...ximate and design orientation-selective feature detectors [5], [6], [7], [8]. The concept of steerablity was also applied successfully in other areas of image processing such as texture analysis [9], =-=[10]-=- and image denoising [11]. In this paper, we propose to reconcile the two methodologies—computational approach and steerable filterbanks—by presenting a general strategy for the design of 2D steerable...

SHRINKAGE FOR REDUNDANT REPRESENTATIONS

by Michael Elad
"... Shrinkage is a well known and appealing denoising technique. The use of shrinkage is known to be optimal for Gaussian white noise, provided that the sparsity on the signal’s representation is enforced using a unitary transform. Still, shrinkage is also practiced successfully with non-unitary, and ev ..."
Abstract - Cited by 48 (0 self) - Add to MetaCart
Shrinkage is a well known and appealing denoising technique. The use of shrinkage is known to be optimal for Gaussian white noise, provided that the sparsity on the signal’s representation is enforced using a unitary transform. Still, shrinkage is also practiced successfully with non-unitary, and even redundant representations. In this paper we shed some light on this behavior. We show that simple shrinkage could be interpreted as the first iteration of an algorithm that solves the basis pursuit denoising (BPDN) problem. Thus, this work leads to a sequential shrinkage algorithm that can be considered as a novel and effective pursuit method. 1.
(Show Context)

Citation Context

...on the noise. Also, crucial to the optimality of this method is the orthogonality of W. A new trend of recent years is the use of overcomplete transforms, replacing the traditional unitary ones – see =-=[7, 8, 9, 10, 11, 12]-=- for representative works. This trend was partly motivated by the growing realization that orthogonal wavelets are weak in describing the singularities found in images. Another driving force in the in...

Rotation-invariant texture retrieval with Gaussianized steerable pyramids

by George Tzagkarakis, Baltasar Beferull-lozano, Panagiotis Tsakalides - IEEE Trans. Image Processing , 2006
"... Abstract—This paper presents a novel rotation-invariant image retrieval scheme based on a transformation of the texture information via a steerable pyramid. First, we fit the distribution of the subband coefficients using a joint alpha-stable sub-Gaussian model to capture their non-Gaussian behavior ..."
Abstract - Cited by 21 (4 self) - Add to MetaCart
Abstract—This paper presents a novel rotation-invariant image retrieval scheme based on a transformation of the texture information via a steerable pyramid. First, we fit the distribution of the subband coefficients using a joint alpha-stable sub-Gaussian model to capture their non-Gaussian behavior. Then, we apply a normalization process in order to Gaussianize the coefficients. As a result, the feature extraction step consists of estimating the covariances between the normalized pyramid coefficients. The similarity between two distinct texture images is measured by minimizing a rotation-invariant version of the Kullback–Leibler Divergence between their corresponding multivariate Gaussian distributions, where the minimization is performed over a set of rotation angles. Index Terms—Fractional lower-order moments (FLOMs), rotation-invariant Kullback–Leibler divergence (KLD), statistical image retrieval, steerable model, sub-Gaussian distribution. I.
(Show Context)

Citation Context

...acterized by statistical interactions within local neighborhoods [23]. Recently, a new framework for statistical signal processing based on wavelet-domain hidden Markov models has been proposed [24], =-=[25]-=-. It provides an attractive modeling of both the non-Gaussian statistics and the property of persistence across scales in a wavelet decomposition. In this paper, we proceed by grouping the wavelet sub...

Wavelet-based texture analysis and synthesis using hidden Markov models

by Guoliang Fan, Xiang-gen Xia, Senior Member - IEEE Trans. Circuits Syst. I , 2003
"... Wavelet-domain hidden Markov models (HMMs), in particular hidden Markov tree (HMT), were recently proposed and applied to image processing, where it was usually assumed that three subbands of the 2-D discrete wavelet transform (DWT), i.e. HL, LH, and HH, are independent. In this paper, we study wave ..."
Abstract - Cited by 21 (2 self) - Add to MetaCart
Wavelet-domain hidden Markov models (HMMs), in particular hidden Markov tree (HMT), were recently proposed and applied to image processing, where it was usually assumed that three subbands of the 2-D discrete wavelet transform (DWT), i.e. HL, LH, and HH, are independent. In this paper, we study wavelet-based texture analysis and synthesis using HMMs. Particularly, we develop a new HMM, called HMT-3S, for statistical texture characterization in the wavelet-domain. In addition to the joint statistics captured by HMT, the new HMT-3S can also exploit the crosscorrelation across DWT subbands. Meanwhile, HMT-3S can be characterized by using the graphical grouping technique, and has the same tree structure as HMT. The proposed HMT-3S is applied to texture analysis, including classification and segmentation, and texture synthesis with improved performance over HMT. Specifically, for texture classification, we study four wavelet-based methods, and experimental results show that HMT-3S provides the highest percentage of correct classification of over 95 % upon a set of 55 Brodatz textures. For texture segmentation, we demonstrate that more accurate texture characterization from HMT-3S allows the significant improvements in terms of both classification accuracy and boundary localization. For texture synthesis, we develop an iterative
(Show Context)

Citation Context

...y result in certain dependencies across the three DWT subbands. It was also shown in [15] that the dependencies across subbands are useful for wavelet-based texture characterization. Specifically, in =-=[36, 37]-=-, a vector wavelet-domain HMM was proposed which 3sincorporates multivariate Gaussian densities. The statistical dependencies across DWT subbands can be captured by the non-diagonal entries in the cov...

Using phase and magnitude information of the complex directional filter bank for texture image retrieval

by An P. N. Vo, Soontorn Oraintara, Truong T. Nguyen - in Proc. IEEE ICIP 2007
"... This paper discusses how to utilize both magnitude and phase in-formation obtained from the complex directional ſlter bank (CDFB) for the purpose of texture image retrieval. The relative phase, which is the difference of phases between adjacent CDFB coefſcients, has a linear relationship with the an ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
This paper discusses how to utilize both magnitude and phase in-formation obtained from the complex directional ſlter bank (CDFB) for the purpose of texture image retrieval. The relative phase, which is the difference of phases between adjacent CDFB coefſcients, has a linear relationship with the angle of dominant orientation within a subband. This information is incorporated to form a new feature vector called CDFB-RP. Texture retrieval performance of the pro-posed CDFB-RP is compared to those of the conventional trans-forms including the Gabor wavelet, the contourlet transform, the steerable pyramid and the CDFB.With the same number of features, the CDFB-RP method outperforms all other transforms in texture image retrieval, while keeping lower complexity and computational time. Index Terms — Directional Filter Bank, Dual-tree, relative phase, texture classiſcation, texture retrieval.
(Show Context)

Citation Context

...tions and rotations of a single function, and a ſlter at any orientation can be computed as a linear combination of the basis ſlters. This property can be used in rotation invariant texture retrieval =-=[9]-=-. The main advantage of the complex wavelet decomposition is that it can produce texture features which are more robust to translation of the image [8]. Recently, the complex directional ſlter bank is...

A unified framework for image database clustering and content-based retrieval

by Mei-ling Shyu, Shu-ching Chen, Min Chen - in Proc. of the Second ACM International Workshop on Multimedia Databases (ACM MMDB , 2004
"... With the proliferation of image data, the need to search and retrieve images efficiently and accurately from a large image database or a collection of image databases has drastically increased. To address such a demand, a unified framework called Markov Model Mediators (MMMs) is proposed in this pap ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
With the proliferation of image data, the need to search and retrieve images efficiently and accurately from a large image database or a collection of image databases has drastically increased. To address such a demand, a unified framework called Markov Model Mediators (MMMs) is proposed in this paper to facilitate conceptual database clustering and to improve the query processing performance by analyzing the summarized knowledge. The unique characteristics of MMMs are that it provides the capabilities of exploring the affinity relations among the images at the database level and among the databases at the cluster level respectively, using an effective data mining process. At the database level, each database is modeled by an intra-database MMM which enables accurate image retrieval within the database. Then the conceptual database clustering is performed and cluster-level knowledge summarization is conducted to reduce the cost of retrieving images across the databases. This framework has been tested using a set of image databases, which contain various numbers of images with different dimensions and concept categories. The experimental results demonstrate that our framework achieves better retrieval accuracy via inter-cluster retrieval than that of intra-cluster retrieval with minimal extra effort.
(Show Context)

Citation Context

...e images based on their visual contents. Earlier efforts in CBIR research have been focused on effective feature representations for images. The visual features of images, such as color [32], texture =-=[5]-=-[9], and shape features [18][38] have been extensively explored to represent and index image contents, resulting in a collection of research prototypes and commercial systems [6][7]. There are also so...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University