You are on page 1of 3

SHADE SORTING Color is the most important aspect of any garment.

It would not be an exaggeration to say that to many consumers color is quality and the decision whether or not to buy a garment rests on its color. Also, in fabric form the marketability of any fabric depends on its color, which again depends on dyeing and its preparatory processes. Therefore, good color and excellent color/shade matching, for suits or coordinates, and even between panels within a garment, are extremely important for profitability. The shade of a color may vary from lot to lot or from bolt(a roll of fabric) to bolt. Such variation may be due to one or more of the following factors: 1. Variation in maturity of cotton fibers. 2.Changes in merges of synthetic fibers. 3. Variation in sizing formula. 4. Inconsistent bleaching. 5. Varying absorbency of the fabric due to a variation in the process variables in mercerization. 6. Variation in the pressure, temperature, and/or chemical concentrations of dyes in the dyeing process. These are just few factors that affect shade uniformity. Sorting methods are appropriate for use when the normal color variation within a process is greater than a visible amount of difference and this difference is unacceptable to a customer. The dyeing of textile is a good example. Variation in temperature, humidity, dye strength, and the dye uptake characteristics of cloth can result in color variation that is visible and unacceptable between cloth pieces used in a cut and sew shirt product. Shade numbering, sorting, and tapering are used in many industries, but particularly the textile industry. Shade Numbering: The shade numbering feature performs calculations on the sample data and assigns each sample a shade number based on how close its color is to the standard. The Shade Sorting: The Shade sorting is the process of assigning samples of the same nominal color into groups having no significant color variation. Use of modern spectrophotometers and color measurement technology make it possible to obtain precise color differences between samples. shade sorting feature calculates a shade number for each sample based on how close its color is to the standard, but ALSO has the ability to sort all samples into shade groups and provide data on which samples belong to each shade number. A shade coding to each sample read based on how close it is to the product standard. One of popular shade sorting system is the Simon method, known as the 555 system. In this system each color is given a three digit numeric shade sort code. Using the CIE L*C*h* color space as an example, the first digit shows lightness of the color as compared to the standard color. If the color is

lighter than the standard this digit will be above 5, and below 5 if it is darker. If the color is more saturate than the standard color the second digit will be above 5 and below 5 if it is duller than the standard. Similarly, the third digit in the shade sort code indicates the hue variation from the standard. SSS SHADE SORTING SYSTEM: In a color matching is a very reliable system and it is based upon modification of shade with reference to bare color. The SSS code sis assigned for standard sample and its value started from 111-999. This code is assigned for a sample The shade tapering: The shade tapering feature is also known as color sequencing. The software performs calculations that arrange the samples from lightest to darkest or dullest to brightest and report them in this order so that each sample is as close as possible in shade to the samples next to it. %% PUTTING AN VECTOR OF NUMBERS IN AN ASCENDING ORDER? % Language : Matlab 2007a % Authors : Autar Kaw % Last Revised : November 8, 2009 % Abstract: This program shows you how to put a vector % of numbers in an ascending order using the bubble sort method clc clear all disp( This program shows the bubble sort method ) disp( to put a vector of numbers in an ) disp( ascending order ) disp( Matlab 2007a ) disp( Authors : Autar Kaw ) disp( Last Revised : November 8, 2009') disp( http://numericalmethods.eng.usf.edu ) disp( ) %% INPUTS % The vector of numbers disp ( INPUTS ) disp( Input the vector of numbers ) A=[18 7 6 15 4 13]; disp(A) %% SOLUTION % Number of entries, n n=length(A); % making (n-1) passes for j=1:1:n-1 % comparing each number with the next and swapping for i=1:1:n-1 if A(i)>A(i+1); % temp is a variable where the numbers are kept % temporarily for the switch temp=A(i); A(i)=A(i+1); A(i+1)=temp; end end end

%% OUTPUT disp( ) disp ( OUTPUT ) disp ( The ascending matrix is ) disp(A) unsorted_list = input('Enter List: '); while(loop == 1); loop = 0; len = length(unsorted_list) For K-1: len - 1 If unsorted_list(k) > unsorted_list(k + 1); Temp = unsorted_list(k); unsorted_list(k) = unsorted_list(k + 1); unsorted_list(k + 1) = Temp; loop = 1; end; origonal_list = unsorted_list end; end; for i=1:(n-1) % n is the length of the vector V if V(i)>V(i+1) s = V(i); V(i) = V(i+1); V(i+1) = s; end end B = sort(A) B = sort(A,dim) B = sort(...,mode) [B,IX] = sort(A,...) If A has complex entries r and s, sort orders them according to the following ru le: r appears before s in sort(A) if either of the following hold: * abs(r) < abs(s) * abs(r) = abs(s) and angle(r)<angle(s) where -p < angle(r) = p For example, v = [1 -1 i -i]; angle(v) ans = 0 sort(v) ans = 0 - 1.0000i 1.0000 0 + 1.0000i -1.0000 3.1416 1.5708 -1.5708