Automatic creation of applique cutting data from machine embroidery data

Abstract

Using an existing embroidery design that has been created for applique, data is automatically created for a cutting machine, which will cut the applique. Currently, the user currently has to cut these by hand—a labor intensive process or use a custom die that can be expensive. The process only requires that the applique steps in the sewing sequence are labeled as such. Generally, the applique steps are so labeled in order for the design creator to be able to let the sewer know what they are doing.

What is claimed is: 
     
         1 . A method for producing a cutting data file from sewing data in an applique data file specifying an applique design wherein the applique data file is in an embroidery file format readable by an embroidery machine and wherein the cutting data file is in a cutting data format readable by a cutting machine, the method comprising:
 obtaining the applique data file, wherein the applique data file comprises sewing data comprising a series of sewing vectors, wherein the applique data file is interpretable by the embroidery machine to create a stitched outline, and wherein zero or more jump commands separate the sewing vectors into one or more subsection comprising a first subsection;   creating a first list of sewing vectors from the first subsection;   normalizing the first list by removing at least one sewing artifact;   analyzing the first list to determine if it describes a first closed path;   closing the first list if it does not describe the first closed path such that the first list does describe the first closed path; and   creating the cutting data file wherein the cutting data file is based at least in part on the first list.   
     
     
         2 . The method of  claim 1  further comprising:
 creating a second list of sewing vectors wherein the one or more subsection comprise a second subsection; 
 normalizing the second list by removing at least one sewing artifact; 
 analyzing the second list to determine if it describes a second closed path; 
 closing the second list if it does not describe the second closed path such that the second list does describe the second closed path; and 
 wherein the cutting data file is based at least in part on the second list. 
 
     
     
         3 . The method of  claim 2  further comprising:
 determining that the first closed path surrounds the second closed path; and 
 creating a first object comprising the first list and the second lsit. 
 
     
     
         4 . The method of  claim 3  further comprising inflating the first list by a positive value. 
     
     
         5 . The method of  claim 4  further comprising inflating the second list by a negative value. 
     
     
         6 . The method of  claim 5  further comprising:
 a step for simplifying the first list; and 
 a step for simplifying the second list. 
 
     
     
         7 . The method of  claim 6  comprising:
 obtaining a first bitmap and a second bitmap; 
 producing an image wherein the image is scaled to include the first object; 
 mapping the first object onto the image; 
 filling the image with the first bitmap; 
 filling those areas inside the first closed path and outside the second closed path with the second bitmap; and 
 displaying the image to a person. 
 
     
     
         8 . The method of  claim 7  further comprising:
 providing cloth to a Gutting machine; 
 providing the cutting data file to the cutting machine; 
 activating the cutting machine such that the cutting machine cuts the cloth in accordance with the cutting data file; and 
 wherein the sewing vectors comprise at least one of a movement, a stitch point, or a needle penetration. 
 
     
     
         9 . The method of  claim 6  further comprising:
 providing cloth to a cutting machine; 
 providing the cutting data file to the cutting machine; and 
 activating the cutting machine such that the cutting machine Guts the cloth in accordance with the cutting data file. 
 
     
     
         10 . A method for producing a cutting data file from sewing data in an applique data file specifying an applique design, wherein the applique data file is in an embroidery file format readable by an embroidery machine, wherein the sewing data specifies a plurality of stitches and wherein the cutting data file is in a cutting data format readable by a cutting machine, the method comprising:
 finding a shortest sewing vector in the applique data file;   creating bitmap comprising a plurality of pixels, wherein the pixels are all initially of a first color, wherein the bitmap is sized to include the applique design and wherein the bitmap is sized such that the shorted vector is at least two pixels in length;   drawing the stitches onto the bitmap in a second color to thereby draw an outline into the bitmap;   applying a step for conditioning the bitmap;   finding a first pixel of the second color:   generating cutting data by following the outline; and   producing the cutting data file wherein the cutting data file comprises the cutting data.   
     
     
         11 . The method of  claim 10  wherein the step for conditioning the bitmap comprises a thinning algorithm. 
     
     
         12 . The method of  claim 10  wherein the step for conditioning the bitmap comprises a skeletonizing algorithm. 
     
     
         13 . A non-transitory processor-readable medium storing computer program code representing instructions to cause a processor to perform a process for producing a cutting data file from sewing data in an applique data file specifying an applique design wherein the applique data file is in an embroidery file format readable by an embroidery machine and wherein the cutting data file is in a cutting data format readable by a cutting machine, the processor-readable program code comprising program instructions, the program instructions comprising:
 program instructions for obtaining the applique data file, wherein the applique data file comprises sewing data comprising a series of sewing vectors, wherein the applique data file is interpretable by the embroidery machine to create a stitched outline, and wherein zero or more jump commands separate the sewing vectors into one or more subsection comprising a first subsection;   program instructions for creating a first list of sewing vectors from the first subsection;   program instructions for normalizing the first list by removing at least one sewing artifact;   program instructions for analyzing the first list to determine if it describes a first closed path;   program instructions for closing the first list if it does not describe the first closed path such that the first list does describe the first closed path; and   program instructions for creating the cutting data file wherein the cutting data file is based at least in part on the first list.   
     
     
         14 . The non-transitory processor-readable medium of  claim 13  further comprising:
 program instructions for creating a second list of sewing vectors wherein the one or more subsection comprise a second subsection; 
 program instructions for normalizing the second list by removing at least one sewing artifact: 
 program instructions for analyzing the second list to determine if it describes a second closed path; 
 program instructions for closing the second list if it does not describe the second closed path such that the second list does describe the second closed path; and 
 wherein the cutting data file is based at least in part on the second list. 
 
     
     
         15 . The non-transitory processor-readable medium of  claim 14  further comprising:
 program instructions for determining that the first closed path surrounds the second closed path; and 
 program instructions for creating a first object comprising the first list and the second list. 
 
     
     
         16 . The non-transitory processor-readable medium of  claim 15  further comprising:
 program instructions for inflating the first list by a positive value; and 
 program instructions for inflating the second list by a negative value. 
 
     
     
         17 . The non-transitory processor-readable medium of  claim 16  further comprising:
 program instructions for simplifying the first list; and 
 program instructions for simplifying the second list. 
 
     
     
         18 . The non-transitory processor-readable medium of  claim 17  comprising:
 program instructions for obtaining a first bitmap and a second bitmap; 
 program instructions for producing an image wherein the image is scaled to include the first object; 
 program instructions for mapping the first object onto the image; 
 program instructions for filling the image with the first bitmap; 
 program instructions for filling those areas inside the first closed path and outside the second closed path with the second bitmap; and 
 program instructions for displaying the image to a person. 
 
     
     
         19 . The non-transitory processor-readable medium of  claim 18  further comprising:
 program instructions for providing cloth to a cutting machine; 
 program instructions for providing the cutting data file to the cutting machine; and 
 program instructions for activating the cutting machine such that the cutting machine cuts the cloth in accordance with the cutting data file. 
 
     
     
         20 . The non-transitory processor-readable medium of  claim 13  wherein normalizing the first step comprises producing series of points along and outline.