Texture analysis using deterministic partially self-avoiding walk with thresholds
نویسندگان
چکیده
In this paper, we propose a new texture analysis method using the deterministic partially selfavoiding walk performed on maps modified with thresholds. In this method, two pixels of the map are neighbors if the Euclidean distance between them is less than √ 2 and the weight (difference between its intensities) is less than a given threshold. The maps obtained by using different thresholds highlight several properties of the image that are extracted by the deterministic walk. To compose the feature vector, deterministic walks are performed with different thresholds and its statistics are concatenated. Thus, this approach can be considered as a multi-scale analysis. We validate our method on the Brodatz database, which is very well known public image database and widely used by texture analysis methods. Experimental results indicate that the proposed method presents a good texture discrimination, overcoming traditional texture methods.
منابع مشابه
Texture analysis using graphs generated by deterministic partially self-avoiding walks
Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present a...
متن کاملTexture descriptor based on partially self-avoiding deterministic walker on networks
Texture image analysis is an important field of investigation that has attracted the attention from computer vision community in the last decades. In this paper, a novel approach for texture image analysis is proposed by using a combination of graph theory and partially self-avoiding deterministic walks. From the image, we build a regular graph where each vertex represents a pixel and it is con...
متن کاملComplex network classification using partially self-avoiding deterministic walks
Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex network classification relies on the use of representative measurements that describe topological structures. Although there are a large number of measuremen...
متن کاملTwo dimensional self-avoiding walk with hydrogen-like bonding: Phase diagram and critical behaviour
The phase diagram for a two-dimensional self-avoiding walk model on the square lattice incorporating attractive short-ranged interactions between parallel sections of walk is derived using numerical transfer matrix techniques. The model displays a collapse transition. In contrast to the standard θ-point model, the transition is first order. The phase diagram in the full fugacity-temperature pla...
متن کاملTexture analysis based on maximum contrast walker
22 Recently, the deterministic tourist walk has emerged as a novel approach for texture analysis. This 23 method employs a traveler visiting image pixels using a deterministic walk rule. Resulting trajectories 24 provide clues about pixel interaction in the image that can be used for image classification and identifi25 cation tasks. This paper proposes a new walk rule for the tourist which is b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.08629 شماره
صفحات -
تاریخ انتشار 2016