Hoek–Brown failure criterion: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
 
en>Yobot
m WP:CHECKWIKI error fixes / special characters in sortkey fixed using AWB (9427)
 
Line 1: Line 1:
While this mindset is certainly understandable, it simply isn't practical at that price point. If you have toe clips on your pedals, you'll need to spend a little extra time with this exercise. The contemporary bikes for mountains are provided with stronger and lighter frame types in addition to pioneering form and design. There are more than 15 circuits in the sport of professional mountain biking. When you liked this short article along with you desire to acquire more details with regards to [http://hipsterpunk.com/u/raubx/ Here is your mountain bike sizing.] kindly go to our own web-site. There are many times you will need to grip the handle of your bike tightly when you negotiate difficult trails. <br><br>Cross Country and all mountain style riders will lean towards a folding bead tire because they are much lighter and that is a crucial factor in those 2 styles of riding. You want to be pedaling as hard as you can while other riders right next to you are doing the exact same thing. Here are the answers and meanings to each of the things you encountered in this dream walk. He or she doesn't have to get into an accident just to understand how important it is to be fully protected before riding a motorbike. However, that being said, many cross country riders prefer hardtail ones because the lighter and stiffer rear ends are better for acceleration and sprinting. <br><br>The steeper the angles, the more beneficial it would be for stability and high speed pedaling. It is just much easier to be a participant in a team and enter the race as a whole unit. Guided by the dolphin trainer, they will perform a series of tricks such as clapping, synchronized jumping, etc. Being humiliated by my buddies was not fun, but there were enough good things about skiing that I wanted to come back for more, just not with my buddies. -Del Plomo Hot Springs: Ideal for bikes, low traffic. <br><br>The price will naturally be higher during prime riding seasons in spring and summer. It is important for the rider to note that not all frames are compatible with every type of forks. Mountain biking is all about stretching your limits, enjoying the ambience, feel the mood swings of mountains weather and then reaching to the final destination. I'd been slowly coming to that conclusion over the course of about a year or so and that mutant nose hair pretty much confirmed it. In order to find the best triathlon bikes, the following are a few places you can look. <br><br>And there are some people who rightfully bring up the issue of the fuel costs and environmental impact of producing the electricty used to power the bike in the first place. The tires are wider that are designed for diverse terrains. I hope what you will have found in the article with respect to Mongoose mountain bike reviews, together with additionally the particular info  regarding mountain bikes, is going to be helpful for you. The price range of lightweight bicycles prices vary from $200. It's about the journey and all that it entails, learning about yourself, making friends, being helped, and of course, helping others along the way".
{{dablink|This article is about computer graphics, also see: [[Texture (disambiguation)]].}}
 
[[Image:ArtificalTexture.png|thumb|right|alt=Artificial texture example.|Artificial texture example.]]
[[Image:NaturalTexture.png|thumb|right|alt=Natural texture example.|Natural texture example.]]
 
An '''image texture''' is a set of metrics calculated in image processing designed to quantify the perceived texture of an image. Image Texture gives us information about the spatial arrangement of color or intensities in an image or selected region of an image.<ref>Linda G. Shapiro and George C. Stockman, ''Computer Vision'', Upper Saddle River: Prentice&ndash;Hall, 2001</ref>
 
Image textures can be artificially created or found in natural scenes captured in an image. Image textures are one way that can be used to help in [[Segmentation (image processing)]] or classification of images. To analyze an image texture in computer graphics, there are two ways to approach the issue: Structured Approach and Statistical Approach.
 
==Structured Approach==
A structured approach sees an image texture as a set of primitive [[Texel (graphics)|texels]] in some regular or repeated pattern. This works well when analyzing artificial textures.
 
To obtain a structured description a characterization of the spatial relationship of the texels is gathered by using [[Voronoi tessellation]] of the texels.
 
==Statistical Approach==
A statistical approach sees an image texture as a quantitative measure of the arrangement of intensities in a region. In general this approach is easier to compute and is more widely used, since natural textures are made of patterns of irregular subelements.
 
===Edge Detection===
The use of [[edge detection]] to determine the number of edge pixels in a specified region helps determine a characteristic of texture complexity. After edges have been found the direction of the edges can also be applied as a characteristic of texture and can be useful in determining patterns in the texture. These directions can be represented as an average or in a histogram.
 
Consider a region with N pixels. the gradient-based edge detector is applied to this region by producing two outputs for each pixel p: the gradient magnitude Mag(p) and the gradient direction Dir(p). The edgeness per unit area can be defined by <math>F_{edgeness}=\frac{|\{p | Mag(p) > T\}|}{N}</math> for some threshold T.
 
To include orientation with edgeness we can use histograms for both gradient magnitude and gradient direction. Let H<sub>mag</sub>(R) denote the normalized histogram of gradient magnitudes of region R, and let H<sub>dir</sub> denote the normalized histogram of gradient orientations of region R. Both are normalized according to the size N<sub>R</sub> Then <math>F_{mag dir}=(H_{mag}(R), H_{dir}(R))</math> is quantitative texture description of region R.
 
===Co-occurrence Matrices===
[[Co-occurrence matrix]] captures numerical features of a texture using spatial relations of similar gray tones.<ref>Robert M. Haralick, K. Shanmugam, and Its'hak Dinstein, "Textural Features for Image Classification", IEEE Transactions on Systems, Man, and Cybernetics, 1973, SMC-3 (6): 610–621</ref> Numerical features computed from the co-occurrence matrix can be used to represent, compare, and classify textures. The following are a subset of standard features derivable from a normalized co-occurrence matrix:
 
<math>
\begin{align}
Angular \text{ } 2nd \text{ } Moment &= \sum_{i} \sum_{j} p[i,j]^{2}\\
Contrast &= \sum_{n=0}^{Ng-1} n^{2} \left \{ \sum_{i=1}^{Ng} \sum_{j=1}^{Ng} p[i,j] \right \} \text{, where } |i-j|=n\\
Correlation &= \frac{\sum_{i=1}^{Ng} \sum_{j=1}^{Ng}(ij)p[i,j] - \mu_x \mu_y}{\sigma_x \sigma_y} \\
Entropy &= -\sum_{i}\sum_{j} p[i,j] log(p[i,j])\\
\end{align}
</math>
 
where <math>p[i,j]</math> is the <math>[i,j]</math>th entry in a gray-tone spatial dependence matrix, and Ng is the number of distinct gray-levels in the quantized image.
 
One negative aspect of the co-occurrence matrix is that the extracted features do not necessarily correspond to visual perception.
 
===Laws Texture Energy Measures===
Another approach to generate texture features is to use local masks to detect various types of textures. Convolution masks of  5x5 are used to compute the energy of texture which is then represented by a nine element vector for each pixel. The masks are generated from the following  vectors:<ref>K. Laws, "Textured Image Segmentation", Ph.D. Dissertation, University of Southern California, January 1980</ref>
 
<pre>
L5  =  [ +1  +4  6  +4  +1 ]  (Level)
E5  =  [ -1  -2  0  +2  +1 ]  (Edge)
S5  =  [ -1  0  2  0  -1 ]  (Spot)
W5  =  [ -1  +2  0  -2  +1 ]  (Wave)
R5  =  [ +1  -4  6  -4  +1 ]  (Ripple)
</pre>
 
===Autocorrelation and Power Spectrum===
The autocorrelation function of an image can be used to detect repetitive patterns of textures.
 
==Texture Segmentation==
The use of image texture can be used as a description for regions into segments. There are two main types of [[Segmentation (image processing)|segmentation]] based on image texture, region based and boundary based. Though image texture is not a perfect measure for [[Segmentation (image processing)|segmentation]] it is used along with other measures, such as color, that helps solve segmenting in image.
 
===Region Based===
Attempts to group or cluster pixels based on texture properties together.
 
===Boundary Based===
Attempts to group or cluster pixels based on edges between pixels that come from different texture properties.
 
==See also==
* [[Texel (graphics)]]
* [[Gabor filter]]
 
==Further reading==
[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.2904 Peter Howarth, Stefan Rüger, "Evaluation of texture features for content-based image retrieval", Proceedings of the International Conference on Image and Video Retrieval, Springer-Verlag, 2004]
 
==References==
{{reflist}}
 
{{DEFAULTSORT:Image Texture}}
[[Category:Computer graphics]]

Latest revision as of 17:22, 21 August 2013

Template:Dablink

Artificial texture example.
Artificial texture example.
Natural texture example.
Natural texture example.

An image texture is a set of metrics calculated in image processing designed to quantify the perceived texture of an image. Image Texture gives us information about the spatial arrangement of color or intensities in an image or selected region of an image.[1]

Image textures can be artificially created or found in natural scenes captured in an image. Image textures are one way that can be used to help in Segmentation (image processing) or classification of images. To analyze an image texture in computer graphics, there are two ways to approach the issue: Structured Approach and Statistical Approach.

Structured Approach

A structured approach sees an image texture as a set of primitive texels in some regular or repeated pattern. This works well when analyzing artificial textures.

To obtain a structured description a characterization of the spatial relationship of the texels is gathered by using Voronoi tessellation of the texels.

Statistical Approach

A statistical approach sees an image texture as a quantitative measure of the arrangement of intensities in a region. In general this approach is easier to compute and is more widely used, since natural textures are made of patterns of irregular subelements.

Edge Detection

The use of edge detection to determine the number of edge pixels in a specified region helps determine a characteristic of texture complexity. After edges have been found the direction of the edges can also be applied as a characteristic of texture and can be useful in determining patterns in the texture. These directions can be represented as an average or in a histogram.

Consider a region with N pixels. the gradient-based edge detector is applied to this region by producing two outputs for each pixel p: the gradient magnitude Mag(p) and the gradient direction Dir(p). The edgeness per unit area can be defined by Fedgeness=|{p|Mag(p)>T}|N for some threshold T.

To include orientation with edgeness we can use histograms for both gradient magnitude and gradient direction. Let Hmag(R) denote the normalized histogram of gradient magnitudes of region R, and let Hdir denote the normalized histogram of gradient orientations of region R. Both are normalized according to the size NR Then Fmagdir=(Hmag(R),Hdir(R)) is quantitative texture description of region R.

Co-occurrence Matrices

Co-occurrence matrix captures numerical features of a texture using spatial relations of similar gray tones.[2] Numerical features computed from the co-occurrence matrix can be used to represent, compare, and classify textures. The following are a subset of standard features derivable from a normalized co-occurrence matrix:

Angular 2nd Moment=ijp[i,j]2Contrast=n=0Ng1n2{i=1Ngj=1Ngp[i,j]}, where |ij|=nCorrelation=i=1Ngj=1Ng(ij)p[i,j]μxμyσxσyEntropy=ijp[i,j]log(p[i,j])

where p[i,j] is the [i,j]th entry in a gray-tone spatial dependence matrix, and Ng is the number of distinct gray-levels in the quantized image.

One negative aspect of the co-occurrence matrix is that the extracted features do not necessarily correspond to visual perception.

Laws Texture Energy Measures

Another approach to generate texture features is to use local masks to detect various types of textures. Convolution masks of 5x5 are used to compute the energy of texture which is then represented by a nine element vector for each pixel. The masks are generated from the following vectors:[3]

 L5  =  [ +1  +4  6  +4  +1 ]  (Level)
 E5  =  [ -1  -2  0  +2  +1 ]  (Edge)
 S5  =  [ -1   0  2   0  -1 ]  (Spot)
 W5  =  [ -1  +2  0  -2  +1 ]  (Wave)
 R5  =  [ +1  -4  6  -4  +1 ]  (Ripple)

Autocorrelation and Power Spectrum

The autocorrelation function of an image can be used to detect repetitive patterns of textures.

Texture Segmentation

The use of image texture can be used as a description for regions into segments. There are two main types of segmentation based on image texture, region based and boundary based. Though image texture is not a perfect measure for segmentation it is used along with other measures, such as color, that helps solve segmenting in image.

Region Based

Attempts to group or cluster pixels based on texture properties together.

Boundary Based

Attempts to group or cluster pixels based on edges between pixels that come from different texture properties.

See also

Further reading

Peter Howarth, Stefan Rüger, "Evaluation of texture features for content-based image retrieval", Proceedings of the International Conference on Image and Video Retrieval, Springer-Verlag, 2004

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. Linda G. Shapiro and George C. Stockman, Computer Vision, Upper Saddle River: Prentice–Hall, 2001
  2. Robert M. Haralick, K. Shanmugam, and Its'hak Dinstein, "Textural Features for Image Classification", IEEE Transactions on Systems, Man, and Cybernetics, 1973, SMC-3 (6): 610–621
  3. K. Laws, "Textured Image Segmentation", Ph.D. Dissertation, University of Southern California, January 1980