نتایج جستجو برای: tree texture

تعداد نتایج: 210905  

2000
Tati L. R. Mengko Antari Ardianti Ani Setyorini

The unique iris structures motivate the development of an automatic identification system based on iris characteristic. Texture analysis with multichannel filtering approach is meant to extract feature from iris texture images and encode them into a compact and unique information for each iris. One of the tools that can analyze texture image in multiresolution approach is wavelet transform. In ...

2012
Amandeep Kaur Savita Gupta

This paper presents the comparison of Texture classification algorithms based on Gabor Wavelets. The focus of this paper is on feature extraction scheme for texture classification. The texture feature for an image can be classified using texture descriptors. In this paper we have used Homogeneous texture descriptor that uses Gabor Wavelets concept. For texture classification, we have used onlin...

1999
Konstantin Baumann Jürgen Döllner Klaus H. Hinrichs Oliver Kersting

The approximation tree is a hybrid, hierarchical data structure for real-time terrain visualization which represents both geometry data and texture data of a terrain in a hierarchical manner. This framework can integrate different multiresolution modeling techniques operating on different types of data sets such as TINs, regular grids, and non-regular grids. An approximation tree recursively ag...

Journal: :CoRR 2010
P. Bhargavi S. Jyothi

This paper details the application of a genetic programming framework for classification of decision tree of Soil data to classify soil texture. The database contains measurements of soil profile data. We have applied GATree for generating classification decision tree. GATree is a decision tree builder that is based on Genetic Algorithms (GAs). The idea behind it is rather simple but powerful. ...

2007

In this study, we propose two descriptors on color and texture for content based segmentation. The descriptors are called “the most similar colors in the same neighborhood” and “the most similar textures in the same neighborhood“, respectively. These descriptors are applied on a multi-level segmentation algorithm proposed by the authors of this study [1]. The segmentation algorithm decomposes t...

2012
K. N. Prakash Satya Prasad

A new set of two-dimensional (2-D) M-band dual tree complex wavelet transform (M_band_DT_CWT) is designed to improve the texture retrieval performance. Unlike the standard dual tree complex wavelet transform (DT_CWT), which gives a logarithmic frequency resolution, the M-band decomposition gives a mixture of a logarithmic and linear frequency resolution. Most texture image retrieval systems are...

2000

In this study, we propose two descriptors on color and texture for content based segmentation. The descriptors are called “the most similar colors in the same neighborhood” and “the most similar textures in the same neighborhood“, respectively. These descriptors are applied on a multi-level segmentation algorithm proposed by the authors of this study [1]. The segmentation algorithm decomposes t...

2015
B. Shanmugapriya K. Rajakumar M. Kanimozhi G. Deepa

In this paper, a set of two-dimensional (2-D) rotated complex wavelet filters (RCWFs) are designed with coefficients complex wavelet filter, which gives texture information strongly oriented in six different directions. The 2-D RCWFs are non-separable and improve characterization of oriented textures. Most of the texture image retrieval systems are struggle providing retrieval result with high ...

2005
R. Baskaran M. Deivamani A. Kannan

Texture Analysis has been used in a range of studies for recognizing synthetic and natural textures. We propose a simple, novel and yet effective method for classifying and retrieving images based on texture descriptor. In our system, the information needed for classifying the different types of textures are extracted from the Gabor features, Co-occurrence matrices and Law’s Method. For Feature...

2008
Jia Pan

Before the final report, I gives a report about some progress after the presentation on November 20th. The first part is to optimize current algorithm’s time and space complexity. I am rewriting the KD-tree data structure used in patch match process. There are two main differences. First, in previous KD-tree implementation, dim-n vectors are stored in the KD-tree locally, which makes the space ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید