The silk fabrics were matching dyed with three natural edible pigments(red rice red,ginger yellow and gardenia blue).By investigating the dyeing rates and lifting properties of these pigments,it was observed that thei...The silk fabrics were matching dyed with three natural edible pigments(red rice red,ginger yellow and gardenia blue).By investigating the dyeing rates and lifting properties of these pigments,it was observed that their compatibilities were excellent in the dyeing process:dye dosage 2.5%(omf),mordant alum dosage 2.0%(omf),dyeing temperature 80℃and dyeing time 40 min.The silk fabrics dyed with secondary colors exhibited vibrant and vivid color owing to the remarkable lightness and chroma of ginger yellow.However,gardenia blue exhibited multiple absorption peaks in the visible light range,resulting in significantly lower lightness and chroma for the silk fabrics dyed with tertiary colors,thus making it suitable only for matte-colored fabrics with low chroma levels.In addition,the silk fabrics dyed with these three pigments had a color fastness that exceeded grade 3 in resistance to perspiration,soap washing and light exposure,indicating acceptable wearing properties.The dyeing process described in this research exhibited a wide range of potential applications in matching dyeing of protein-based textiles with natural colorants.展开更多
Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are genera...Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are generally used to get SIFT descriptors in order to reduce the complexity. The regions which have a similar grayscale level but different hues tend to produce wrong matching results in this case. Therefore, the loss of color information may result in decreasing of matching ratio. An image matching algorithm based on SIFT is proposed, which adds a color offset and an exposure offset when converting color images to grayscale images in order to enhance the matching ratio. Experimental results show that the proposed algorithm can effectively differentiate the regions with different colors but the similar grayscale level, and increase the matching ratio of image matching based on SIFT. Furthermore, it does not introduce much complexity than the traditional SIFT.展开更多
Because of the special optical characters, the color matching of fluorescent dyes is quite complicated. In order to find the algorithm of the color matching of fluorescent dyes, some experiments and measurements of on...Because of the special optical characters, the color matching of fluorescent dyes is quite complicated. In order to find the algorithm of the color matching of fluorescent dyes, some experiments and measurements of one kind of fluorescent dye were carried out. An elementary probe into the method of color matching of fluorescent dyes has been made through the expression deduced by James S. Bonham and standard Kubelka-Munk theory. The results prove that the method has a great applicability for the color matching of fabric dyed with only one kind of fluorescent dye.展开更多
Some modifications of two-constant Kubelka-Munk theory has been made for the color matching of pre-colored fiber blends. The scattering coefficients of three primaries are averaged and taken as initial coefficients in...Some modifications of two-constant Kubelka-Munk theory has been made for the color matching of pre-colored fiber blends. The scattering coefficients of three primaries are averaged and taken as initial coefficients in each wavelength. The unit sums of concentration in E-Allen’s Algorithm were removed in the case of pre-colored fiber blends. Predicted blend ratios and reflectance curves agree very well with measured ones and color differences are within the tolerant limit, showing satisfactory matching results.展开更多
An expression of reflectance of fluorescent dyes in emission region was used in this article. Through the analysis of the spectral radiance factor of fluorescent whitening agents(FWA), the color matching of FWA was st...An expression of reflectance of fluorescent dyes in emission region was used in this article. Through the analysis of the spectral radiance factor of fluorescent whitening agents(FWA), the color matching of FWA was studied and the three-region method of color matching method was put forward. The method was proved to be reliable for the dyes used and was easy to apply for the color matching of FWAs.展开更多
Prediction of the formula for matching a given color standard by blending pro-dyed fibers is of considerable importance to the textile industry. This kind of formulation suffers from a lack of computer-aided tool to a...Prediction of the formula for matching a given color standard by blending pro-dyed fibers is of considerable importance to the textile industry. This kind of formulation suffers from a lack of computer-aided tool to assist the colorist attempting to find a good recipe to reproduce a target color. In this article a tristimulus color matching algorithm based on Stcarns-Noechel model is proposed. This algorithm was run to predict recipes for 36 viscose blends. The maximum color difference is 0.97 CIELAB units. It is demonstrated that the algorithm can be used in color matching of fiber blends.展开更多
A brief review of color matching technology and its application of printing RGB images by CMY or CMYK ink jet printers is presented, followed by an explanation to the conventional approaches that are commonly used in ...A brief review of color matching technology and its application of printing RGB images by CMY or CMYK ink jet printers is presented, followed by an explanation to the conventional approaches that are commonly used in color matching. Then, a four color matching method combining neural network with genetic algorithm is proposed. The initial weights and thresholds of the BP neural network for RGB to CMY color conversion are optimized by the new genetic algorithm based on evolutionarily stable strategy. The fourth component K is generated by using GCR (Gray Component Replacement) concept. Simulation experiments show that it is well behaved in both accuracy and generalization performance.展开更多
Color economy and market fashion trend have an increasing impact on clothing fabric color matching.Therefore,a smart clothing fabric color matching system with reference to popular colors is designed to realize the di...Color economy and market fashion trend have an increasing impact on clothing fabric color matching.Therefore,a smart clothing fabric color matching system with reference to popular colors is designed to realize the diversification of clothing color matching,which includes a palette generation module and a clothing fabrics-palette color matching network(CF-PCN).Firstly,palette generation module generates palettes referring popular colors while maintains color styles of clothing fabrics.Secondly,CF-PCN generates color matching images containing color information of palettes.The experimental results show that the color matching system has a higher average pixel ratio of palette colors and contains more palette color information.It demonstrates that the system achieves color matching innovation referring popular colors while retaining color style of clothing brands and provides designers with appropriate color matching solutions.展开更多
Through discussing the color matching technology and its application in printing industry the conventional approaches commonly used in color matching, and the difficulties in color matching, a nonlinear color matching...Through discussing the color matching technology and its application in printing industry the conventional approaches commonly used in color matching, and the difficulties in color matching, a nonlinear color matching model based on two step learning is established by finding a linear model by learning pure color data first and then a nonlinear modification model by learning mixed color data. Nonlinear multiple regression is used to fit the parameters of the modification model. Nonlinear modification function is discovered by BACON system by learning mixture data. Experiment results indicate that nonlinear color conversion by two step learning can further improve the accuracy when it is used for straightforward conversion from RGB to CMYK. An improved separation model based on GCR concept is proposed to solve the problem of gray balance and it can be used for three to four color conversion as well. The method proposed has better learning ability and faster printing speed than other historical approaches when it is applied to four color ink jet printing.展开更多
Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition (V 1, V 2, ..., V k) of V(G) such that for each i(1≤i≤k), G[V i] is 1-regular. This p...Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition (V 1, V 2, ..., V k) of V(G) such that for each i(1≤i≤k), G[V i] is 1-regular. This paper studies the computational complexity of this problem for graphs with small diameters. The main results are as follows: Induced matching 2-partition problem of graphs with diameter 6 and induced matching 3-partition problem of graphs with diameter 2 are NP-complete; induced matching 2-partition problem of graphs with diameter 2 is polynomially solvable.展开更多
A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This...A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This scheme builds normalized histogram and reference histogram from matching results,and uses clustering algorithm to process the two histograms.Region histogram statistical method is adopted to retrieve depth data to achieve final matching results.Regular stereo matching library is used to verify this scheme,and experiments reported in this paper support availability of this method for automatic image processing.This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results.The whole procedure can be executed automatically and improve the integration level of image analysis process.展开更多
The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition(V1,V2,…,Vk) of V(G)such that,for each i(1≤i≤k),G[Vi] is 1-regular.In this paper,we study the induced m...The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition(V1,V2,…,Vk) of V(G)such that,for each i(1≤i≤k),G[Vi] is 1-regular.In this paper,we study the induced matching partition number of product graphs.We provide a lower bound and an upper bound for the induced matching partition number of product graphs,and exact results are given for some special product graphs.展开更多
基金Fujian External Cooperation Project of Natural Science Foundation,China(No.2022I0042)。
文摘The silk fabrics were matching dyed with three natural edible pigments(red rice red,ginger yellow and gardenia blue).By investigating the dyeing rates and lifting properties of these pigments,it was observed that their compatibilities were excellent in the dyeing process:dye dosage 2.5%(omf),mordant alum dosage 2.0%(omf),dyeing temperature 80℃and dyeing time 40 min.The silk fabrics dyed with secondary colors exhibited vibrant and vivid color owing to the remarkable lightness and chroma of ginger yellow.However,gardenia blue exhibited multiple absorption peaks in the visible light range,resulting in significantly lower lightness and chroma for the silk fabrics dyed with tertiary colors,thus making it suitable only for matte-colored fabrics with low chroma levels.In addition,the silk fabrics dyed with these three pigments had a color fastness that exceeded grade 3 in resistance to perspiration,soap washing and light exposure,indicating acceptable wearing properties.The dyeing process described in this research exhibited a wide range of potential applications in matching dyeing of protein-based textiles with natural colorants.
基金supported by the National Natural Science Foundation of China(61271315)the State Scholarship Fund of China
文摘Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are generally used to get SIFT descriptors in order to reduce the complexity. The regions which have a similar grayscale level but different hues tend to produce wrong matching results in this case. Therefore, the loss of color information may result in decreasing of matching ratio. An image matching algorithm based on SIFT is proposed, which adds a color offset and an exposure offset when converting color images to grayscale images in order to enhance the matching ratio. Experimental results show that the proposed algorithm can effectively differentiate the regions with different colors but the similar grayscale level, and increase the matching ratio of image matching based on SIFT. Furthermore, it does not introduce much complexity than the traditional SIFT.
文摘Because of the special optical characters, the color matching of fluorescent dyes is quite complicated. In order to find the algorithm of the color matching of fluorescent dyes, some experiments and measurements of one kind of fluorescent dye were carried out. An elementary probe into the method of color matching of fluorescent dyes has been made through the expression deduced by James S. Bonham and standard Kubelka-Munk theory. The results prove that the method has a great applicability for the color matching of fabric dyed with only one kind of fluorescent dye.
文摘Some modifications of two-constant Kubelka-Munk theory has been made for the color matching of pre-colored fiber blends. The scattering coefficients of three primaries are averaged and taken as initial coefficients in each wavelength. The unit sums of concentration in E-Allen’s Algorithm were removed in the case of pre-colored fiber blends. Predicted blend ratios and reflectance curves agree very well with measured ones and color differences are within the tolerant limit, showing satisfactory matching results.
文摘An expression of reflectance of fluorescent dyes in emission region was used in this article. Through the analysis of the spectral radiance factor of fluorescent whitening agents(FWA), the color matching of FWA was studied and the three-region method of color matching method was put forward. The method was proved to be reliable for the dyes used and was easy to apply for the color matching of FWAs.
文摘Prediction of the formula for matching a given color standard by blending pro-dyed fibers is of considerable importance to the textile industry. This kind of formulation suffers from a lack of computer-aided tool to assist the colorist attempting to find a good recipe to reproduce a target color. In this article a tristimulus color matching algorithm based on Stcarns-Noechel model is proposed. This algorithm was run to predict recipes for 36 viscose blends. The maximum color difference is 0.97 CIELAB units. It is demonstrated that the algorithm can be used in color matching of fiber blends.
文摘A brief review of color matching technology and its application of printing RGB images by CMY or CMYK ink jet printers is presented, followed by an explanation to the conventional approaches that are commonly used in color matching. Then, a four color matching method combining neural network with genetic algorithm is proposed. The initial weights and thresholds of the BP neural network for RGB to CMY color conversion are optimized by the new genetic algorithm based on evolutionarily stable strategy. The fourth component K is generated by using GCR (Gray Component Replacement) concept. Simulation experiments show that it is well behaved in both accuracy and generalization performance.
基金National Natural Science Foundation of China(No.62001099)National Key Research&Development Program of China(No.2019YFC1521300)Fundamental Research Funds for the Central Universities,China(No.17D110408)。
文摘Color economy and market fashion trend have an increasing impact on clothing fabric color matching.Therefore,a smart clothing fabric color matching system with reference to popular colors is designed to realize the diversification of clothing color matching,which includes a palette generation module and a clothing fabrics-palette color matching network(CF-PCN).Firstly,palette generation module generates palettes referring popular colors while maintains color styles of clothing fabrics.Secondly,CF-PCN generates color matching images containing color information of palettes.The experimental results show that the color matching system has a higher average pixel ratio of palette colors and contains more palette color information.It demonstrates that the system achieves color matching innovation referring popular colors while retaining color style of clothing brands and provides designers with appropriate color matching solutions.
文摘Through discussing the color matching technology and its application in printing industry the conventional approaches commonly used in color matching, and the difficulties in color matching, a nonlinear color matching model based on two step learning is established by finding a linear model by learning pure color data first and then a nonlinear modification model by learning mixed color data. Nonlinear multiple regression is used to fit the parameters of the modification model. Nonlinear modification function is discovered by BACON system by learning mixture data. Experiment results indicate that nonlinear color conversion by two step learning can further improve the accuracy when it is used for straightforward conversion from RGB to CMYK. An improved separation model based on GCR concept is proposed to solve the problem of gray balance and it can be used for three to four color conversion as well. The method proposed has better learning ability and faster printing speed than other historical approaches when it is applied to four color ink jet printing.
基金Supported by the National Natural Science Foundation of China( 1 0 371 1 1 2 ) and the Natural ScienceFoundation of Henan( 0 4 1 1 0 1 1 2 0 0 )
文摘Given a simple graph G and a positive integer k, the induced matching k-partition problem asks whether there exists a k-partition (V 1, V 2, ..., V k) of V(G) such that for each i(1≤i≤k), G[V i] is 1-regular. This paper studies the computational complexity of this problem for graphs with small diameters. The main results are as follows: Induced matching 2-partition problem of graphs with diameter 6 and induced matching 3-partition problem of graphs with diameter 2 are NP-complete; induced matching 2-partition problem of graphs with diameter 2 is polynomially solvable.
基金Sponsored by"985"Second Procession Construction of Ministry of Education(3040012040101)
文摘A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This scheme builds normalized histogram and reference histogram from matching results,and uses clustering algorithm to process the two histograms.Region histogram statistical method is adopted to retrieve depth data to achieve final matching results.Regular stereo matching library is used to verify this scheme,and experiments reported in this paper support availability of this method for automatic image processing.This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results.The whole procedure can be executed automatically and improve the integration level of image analysis process.
文摘The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition(V1,V2,…,Vk) of V(G)such that,for each i(1≤i≤k),G[Vi] is 1-regular.In this paper,we study the induced matching partition number of product graphs.We provide a lower bound and an upper bound for the induced matching partition number of product graphs,and exact results are given for some special product graphs.
