|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Refimprove|date=December 2009}}
| | Have we been thinking "how do I accelerate my computer" lately? Well possibilities are in the event you are reading this article; then you are experiencing 1 of various computer issues that thousands of individuals discover which they face regularly.<br><br>Registry is not additionally important to quick computer boot up, nevertheless also important to the performance of the computer. If you have a registry error, we might face blue screen, freezing or crash. It's required to regularly clean up the invalid, lost, junk registry keys to keep the computer healthy and running fast.<br><br>So, this advanced dual scan is not just among the greater, nevertheless it's furthermore freeware. And as of all of this which numerous respect CCleaner among the better registry cleaners inside the market now. I would add that I personally prefer Regcure for the simple reason which it has a greater interface and I recognize for a truth it is ad-ware without charge.<br><br>There are tricks to make a slow computer function efficient plus quickly. In this article, I can tell we only 3 most effective strategies or techniques to avoid a computer of being slow plus instead of which create it faster plus function even better than before.<br><br>There are actually several [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities 2014] software pieces inside the web plus truly the only thing that we should do is to download them. Unfortunately, you cannot expect that all of these are as efficient because they claim to be. And due to this, it is actually important for we to check when a vendor is absolutely reliable plus credible.<br><br>Another key element whenever we compare registry cleaners is having a facility to manage the start-up jobs. This just signifies which you can choose what programs you'd like to begin when you commence your PC. If you have unnecessary programs starting whenever you boot up your PC this usually lead to a slow running computer.<br><br>When the registry is corrupt or full of mistakes, the signs will be felt by the computer owner. The slow performance, the frequent system crashes and the nightmare of all computer owners, the blue screen of death.<br><br>What I would suggest is to look on your for registry cleaners. You are able to do this with a Google look. If you find products, look for critiques and testimonials about the product. Next you are able to see how others like the product, plus how effectively it functions. |
| {{Lowercase|title=rg chromaticity}}
| |
| | |
| The '''rg chromaticity''' space, two dimensions of the ''normalized RGB'' space,<ref>
| |
| {{cite book
| |
| | chapter = Facial Skin Color Modeling
| |
| | title = Handbook of face recognition
| |
| | editor = S. Z. Li and Anil K. Jain
| |
| | author = J. B. Martinkauppa and M. Piettikäinen
| |
| | publisher = Springer Science & Business
| |
| | year = 2005
| |
| | isbn = 978-0-387-40595-7
| |
| | page = 117
| |
| | url = http://books.google.com/books?id=amVDaTdgKYcC&pg=PA117&dq=%22normalized+RGB%22+rg#v=onepage&q=%22normalized%20RGB%22%20rg&f=false
| |
| }}</ref>
| |
| is a [[chromaticity space]], a two-dimensional [[color space]] in which there is no intensity information. | |
| | |
| In the [[RGB color space]] a pixel is identified by the intensity of red, green, and blue [[primary color]]s. Therefore a bright red can be represented as (R,G,B) (255,0,0), while a dark red may be (40,0,0). In the normalized rgb space or rg space, a color is represented by the proportion of red, green, and blue in the color, rather than by the intensity of each. Since these proportions must always add up to a total of 1, we are able to quote just the red and green proportions of the color, and can calculate the blue value if necessary.
| |
| | |
| ==Conversion between RGB and rg chromaticity==
| |
| Given a color (R,G,B) where R, G, B = intensity of Red, Green and Blue, this can be converted to color <math>(r,g,b)</math> where <math> r, g, b </math> imply the proportion of red, green and blue in the original color:<ref>
| |
| {{cite book
| |
| | chapter = Color Television and Colorimetry
| |
| | title = Selected Papers on Colorimetry Fundamentals
| |
| | editor = D L. MacAdam
| |
| | author = W. T. Wintringhum
| |
| | publisher = SPIE - The International Society for Optical Enginnering
| |
| | year = 1951
| |
| | isbn = 0-8194-1296-1
| |
| | page = 343
| |
| }}</ref>
| |
| | |
| <center>
| |
| <math> r = \frac{R}{R+G+B}</math>
| |
| | |
| <math> g = \frac{G}{R+G+B}</math> | |
| | |
| <math> b = \frac{B}{R+G+B}</math>
| |
| | |
| <math> r+g+b = 1</math>
| |
| </center>
| |
| | |
| The sum of rgb will always equal one, because of this property the b dimension can be thrown away without causing any loss in information. The reverse conversion is not possible with only two dimensions, as the intensity information is lost during the conversion to rg chromaticity, e.g. (1/3, 1/3, 1/3) has equal proportions of each color, but it is not possible to determine whether this corresponds to dark gray, light gray, or white. If R, G, B, is normalized to r, g, G color space the conversion can be computed by the following:
| |
| | |
| <center>
| |
| <math> R = \frac{rG}{g}</math>
| |
| | |
| <math> G = G</math>
| |
| | |
| <math> B =\frac{(1-r-g)G}{g}</math>
| |
| </center>
| |
| | |
| The conversion from rgG to RGB, is the same as the conversion from xyY to XYZ.<ref>
| |
| {{cite web
| |
| |url = http://www.brucelindbloom.com/index.html?Eqn_xyY_to_XYZ.html
| |
| |title = xyY to XYZ
| |
| |last = Lindloom
| |
| |first = Bruce
| |
| |date = 13 March 2009
| |
| |website = http://www.brucelindbloom.com/
| |
| |accessdate = 7 December 2013
| |
| }}</ref> The conversion requires at least some information relative to the intensity of the scene. For this reason if the G is persevered then the inverse is possible.
| |
| | |
| ==Pixel-Based Photometric Invariance==
| |
| Although rg chromaticity contains less information than RGB or [[HSV color space|HSV]] color spaces, it has a number of useful properties for [[computer vision]] applications. Notably, where a scene viewed by a camera is not lit evenly – for example if lit by a spotlight – then an object of a given color will change in apparent color as it moves across the scene. Where color is being used to track an object in an RGB image, this can cause problems. The lack of intensity information in rg chromaticity images removes this problem, and the apparent color remains constant. Note that in the case where different parts of the image are lit by different colored light sources, problems can still emerge.
| |
| | |
| Computer vision algorithms tend to suffer from varying imaging conditions. To make more robust computer vision algorithms it is important to use a color invariant color space. Color invariant color spaces are desensitized to disturbances in the image. One common problem in computer vision is varying light source (color and intensity) between multiple images and within a single image.<ref>
| |
| {{cite book
| |
| | chapter = Pixel-Based Photometric Invariance
| |
| | title = Color in Computer Vision Fundamentals and Applications
| |
| | editor = M. A. Kriss
| |
| | author = T. Gevers, A. Gijsenji, J. van de Weijer, and J. Geusebroek
| |
| | publisher = Wiley - IS&T Series
| |
| | year = 2012
| |
| | isbn = 978-0-470-89084-4
| |
| | page = 50
| |
| }}</ref> To properly perform image segmentation and object detection requires an increased need for images that are stable to variations in imaging conditions. Normalizing RGB color space to rgb color system performs a linear transform. Normalized rgb space eliminates the effect of varying intensities from the light source. Uniform surfaces of color with varying geometric features are affected by the angle and intensity of the light source. Where a uniform red surface with a uniform green object placed on top, should easily be segmented. Due to the shape of the 3D object shades are formed preventing uniform fields of color. Normalizing intensity out removes the shadow. A lambertian reflector under a white illumination is defined by the equation below:
| |
| | |
| <center>
| |
| <math>f^c(x) = m^b(x)\int_{\omega} s(\lambda,x)\rho^c(\lambda)d\lambda</math>
| |
| </center> | |
| When the r,g,b normalized equations are substituted into the equation above the equations below are derived, which define the invariant properties of the rgb color system.
| |
| <center>
| |
| <math>r = \frac{m^b(x)k_R}{m^b(x)(k_R+k_G+k_B)} = \frac{k_R}{k_R+k_G+k_B}</math>
| |
| | |
| <math>g = \frac{m^b(x)k_G}{m^b(x)(k_R+k_G+k_B)} = \frac{k_G}{k_R+k_G+k_B}</math>
| |
| | |
| <math>b = \frac{m^b(x)k_B}{m^b(x)(k_R+k_G+k_B)} = \frac{k_B}{k_R+k_G+k_B}</math>
| |
| </center>
| |
| | |
| Where <math>k_c = \int_{\omega}s(\lambda,x)\rho^c(\lambda)d\lambda</math> and <math>c \in {\{R,G,B\}}</math>. The <math>m^b(x)</math> coefficient which denotes the relationship between the white light source and the surface reflectance. This coefficient is cancelled out, assuming a lambertian reflection and white illumination the rgb color space only depends on <math>k_c</math>. The normalized image is free from shadow and shading effects. The rgb color space is dependent on the color of the light source. The color space is only dependent on <math>k_c</math> which is made up of <math>\rho^c(\lambda)</math> and <math>s(\lambda,x)</math>, <math>\rho</math> and <math>s</math> are determined by the sensor and surface of object.
| |
| | |
| ===Illustration===
| |
| | |
| {{multiple image
| |
| | align = center
| |
| | direction = horizontal
| |
| | height = 200
| |
| | |
| | image1 = Elkhorn_Slough.jpg
| |
| | caption1 = A photograph with varying illumination levels.
| |
| | |
| | image2 = RG_Chromaticity_Example.png
| |
| | caption2 = A visual representation of the chromaticity of the image. Each pixel has been scaled so the total red, green, and blue coordinates sum to 1. Notice the effect on the foliage and shadowed regions.
| |
| | |
| | image3 = Image_without_chromaticity.png
| |
| | caption3 = A visual representation of the average value of red, green, and blue coordinates for each pixel in the original image. This information can be combined with the rg chromaticity information to reconstruct the original image.
| |
| }}
| |
| {{-}}
| |
| | |
| ===rg color space===
| |
| | |
| [[File:Normalized color coordinate.jpg|right|200px|thumb|Normalized rg Color Space]]
| |
| | |
| r, g, and b chromaticity coordinates are ratios of the of one tristimulus value over the sum the all three tristimulus values. A neutral object infers equal values of red, green and blue stimulus. The lack of luminance information in rg prevents having more than 1 neutral point where all three coordinates are of equal value. The white point of the rg chromaticity diagram is defined by the point (1/3,1/3). The white point has one third red, one third green and the final third blue. On an rg chromaticity diagram the first quadrant where all values of r and r are positive forms a right triangle. With max r equals 1 unit along the x and max g equals 1 unit along the y axis. Connecting a line from the max r (1,0) to max g (0,1) from a straight line with slope of negative 1. Any sample that falls on this line has no blue. Moving along the line from max r to max g, shows a decrease in red and an increase of green in the sample, without blue changing. The further a sample moves from this line the more blue is present in the sample trying to be matched.
| |
| | |
| ==RGB Color specification System==
| |
| | |
| [[File:CIE1931 RGBCMF.svg|250px|right|thumb|The CIE 1931 RGB Color matching functions. The color matching functions are the amounts of primaries needed to match the monochromatic test primary at the wavelength shown on the horizontal scale.]]
| |
| | |
| [[RGB color space|RGB]] is a color mixture system. Once the color matching function are determined the tristimulus values can be determined easily. Since, standardization is required to compare results, CIE established standards for determine color matching function.<ref>{{cite book
| |
| | chapter = CIE Standard Colorimetric System
| |
| | title = Colorimetry Fundamentals and Applications
| |
| | editor = M. A. Kriss
| |
| | author = N. Ohto and A. R. Robertson
| |
| | publisher = Wiley - IS&T Series
| |
| | year = 2005
| |
| | isbn = 978-0-470-09472-3
| |
| | page = 65
| |
| }}</ref>
| |
| | |
| <ol start="1"> | |
| <li>The reference stimuli must be monochromatic lights R, G, B. With wavelengths <math>\lambda_R=700.0nm, \lambda_G=546.1nm, \lambda_B=435.8nm </math> respectively.</li>
| |
| <li>The basic stimulus is white with equal energy spectrum. Require a ratio of 1.000:4.5907:0.0601 (RGB) to match white point.</li>
| |
| </ol>
| |
| | |
| Therefore a white with equi-energy lights of 1.000 + 4.5907 + 0.0601 = 5.6508 lm can be matched by mixing together R, G and B. Guild and Wright used 17 subjects to determine RGB color matching functions.<ref>
| |
| {{cite book
| |
| | chapter = The Colour Triangle
| |
| | title = The Reproduction of Colour
| |
| | editor = M. A. Kriss
| |
| | author = R. W. G. Hunt
| |
| | publisher = Wiley - IS&T Series
| |
| | year = 2004
| |
| | isbn = 0-470-02425-9
| |
| | page = 71
| |
| }}</ref> RGB color matching serve as the base for rg chromaticity. The RGB color matching functions are used to determine the trisitmulus RGB values for a spectrum. Normalizing the RGB tristimulus values converts the tristimulus into rgb. Normalized RGB tristimulus value can be plotted on an rg chromaticity diagram.
| |
| | |
| An example of color matching function below. <math>[F_{\lambda}]</math> is any monochromatic. Any monochromatic can be matched by adding reference stimuli <math>R[R], G[G] </math> and <math>B[B]</math>. The test light is also to bright to account for this reference stimuli is added to the target to dull the saturation. Thus <math>R</math> is negative. <math>[R], [G]</math> and <math>[B]</math> can be defined as a vector in a three dimensional space. This three dimensional space is defined as the color space. Any color <math>[F]</math> can be reached by matching a given amount of <math>[R], [G]</math> and <math>[B]</math>.
| |
| | |
| <center>
| |
| <math>[F_{\lambda}]+R[R] =G[G]+B[B]</math>
| |
| | |
| <math>[F_{\lambda}]=-R[R]+ G[G]+B[B]</math>
| |
| </center>
| |
| | |
| The negative<math>[R]</math> calls for color matching functions that are negative at certain wavelengths. This is evidence of why the <math>\overline{r}</math> color matching function appears to have negative tristimulus values.
| |
| | |
| ===rg Chromaticity Diagram===
| |
| | |
| [[File:CIE rg Diagram.jpg|right|200px|thumb|rg Chromaticity Diagram]]
| |
| | |
| The figure to the side is a plotted rg chromaticity diagram. Noting the importance of the E which is defined as the white point where rg are equal and have a value of 1/3 . Next notice the straight line from (0,1) to (1,0), follows the expression y = -x + 1. As the x (red) increases the y (green) decreases by the same amount. Any point on the line represents the limit in rg, and can be defined by a point that has no b information and formed by some combination of r and g. Moving of the linear line towards E represents a decrease in r and g and an increase in b. In computer vision and digital imagery only use the first quadrant because a computer cannot display negative RGB values. The range of RGB is 0-255 for most displays. But when trying to form color matches using real stimuli negative values are need according to Grassmann’s Laws to match all possible colors. This is why the rg chromaticity diagram extends in the negative r direction.
| |
| | |
| ==Conversion xyY color system==
| |
| | |
| Avoid negative color coordinate values prompted the change from to rg to xy. Negative coordinates are used in rg space because when making a spectral sample match can be created by adding stimulus to the sample. The color match- ing functions r, g, and b are negative at certain wavelengths to allow for any monochromatic sample to be matched. This is why in the rg chromaticity diagram the spectral locus extents into the negative r direction and ever so slightly into the negative g direction. On an xy chromaticity diagram the spectral locus if formed by all positive values of x and y.
| |
| | |
| ==See also==
| |
| | |
| * [[RG color space]]
| |
| * [[RGB color space]]
| |
| * [[Color space]]
| |
| * [[CIE 1931 color space]]
| |
| * [[Trichromacy]]
| |
| * [[Imaginary color]]
| |
| * [[Grassmann's law]]
| |
| * [[Chromaticity]]
| |
| * [[Chrominance]]
| |
| * [[Image segmentation]]
| |
| * [[Computer vision]]
| |
| | |
| ==References==
| |
| | |
| {{Reflist}}
| |
| | |
| {{DEFAULTSORT:Rg Chromaticity}}
| |
| [[Category:Color space]]
| |
Have we been thinking "how do I accelerate my computer" lately? Well possibilities are in the event you are reading this article; then you are experiencing 1 of various computer issues that thousands of individuals discover which they face regularly.
Registry is not additionally important to quick computer boot up, nevertheless also important to the performance of the computer. If you have a registry error, we might face blue screen, freezing or crash. It's required to regularly clean up the invalid, lost, junk registry keys to keep the computer healthy and running fast.
So, this advanced dual scan is not just among the greater, nevertheless it's furthermore freeware. And as of all of this which numerous respect CCleaner among the better registry cleaners inside the market now. I would add that I personally prefer Regcure for the simple reason which it has a greater interface and I recognize for a truth it is ad-ware without charge.
There are tricks to make a slow computer function efficient plus quickly. In this article, I can tell we only 3 most effective strategies or techniques to avoid a computer of being slow plus instead of which create it faster plus function even better than before.
There are actually several tuneup utilities 2014 software pieces inside the web plus truly the only thing that we should do is to download them. Unfortunately, you cannot expect that all of these are as efficient because they claim to be. And due to this, it is actually important for we to check when a vendor is absolutely reliable plus credible.
Another key element whenever we compare registry cleaners is having a facility to manage the start-up jobs. This just signifies which you can choose what programs you'd like to begin when you commence your PC. If you have unnecessary programs starting whenever you boot up your PC this usually lead to a slow running computer.
When the registry is corrupt or full of mistakes, the signs will be felt by the computer owner. The slow performance, the frequent system crashes and the nightmare of all computer owners, the blue screen of death.
What I would suggest is to look on your for registry cleaners. You are able to do this with a Google look. If you find products, look for critiques and testimonials about the product. Next you are able to see how others like the product, plus how effectively it functions.