WO2006000217A2 - Procede et systeme d'exposition d'une zone en fonction de donnees d'images numeriques - Google Patents

Procede et systeme d'exposition d'une zone en fonction de donnees d'images numeriques Download PDF

Info

Publication number
WO2006000217A2
WO2006000217A2 PCT/DK2005/000410 DK2005000410W WO2006000217A2 WO 2006000217 A2 WO2006000217 A2 WO 2006000217A2 DK 2005000410 W DK2005000410 W DK 2005000410W WO 2006000217 A2 WO2006000217 A2 WO 2006000217A2
Authority
WO
WIPO (PCT)
Prior art keywords
exposure
pixels
sub
image
images
Prior art date
Application number
PCT/DK2005/000410
Other languages
English (en)
Other versions
WO2006000217A3 (fr
Inventor
Niels Dybdahl
Original Assignee
Esko-Graphics A/S
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Esko-Graphics A/S filed Critical Esko-Graphics A/S
Publication of WO2006000217A2 publication Critical patent/WO2006000217A2/fr
Publication of WO2006000217A3 publication Critical patent/WO2006000217A3/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K15/00—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
    • G06K15/02—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/04—Scanning arrangements, i.e. arrangements for the displacement of active reading or reproducing elements relative to the original or reproducing medium, or vice versa
    • H04N1/17—Scanning arrangements, i.e. arrangements for the displacement of active reading or reproducing elements relative to the original or reproducing medium, or vice versa the scanning speed being dependent on content of picture

Definitions

  • This invention relates to a method and a system for exposing an area according to digital image data representing an image.
  • Known exposure systems typically comprise an arrangement adapted for exposing a light sensitive material, e.g. a printing plate, a material adapted for rapid prototyping, a film, etc.
  • the exposing is performed for the purpose of obtaining certain changes of properties of the exposed material, e.g. resulting in the establishment of an image on the illuminated material or a certain structure.
  • the light is modulated according to image data, typically in the form of a two-dimensional array of pixels, where each pixel carries information as to whether that pixel is to be exposed. In e.g. grey-scale images, each pixel further carries information about the degree of exposure required for that pixel.
  • One prior art method of modulating light transmitted to an illumination surface applies a so-called spatial light modulator.
  • modulators include a digital micro-mirror device (DMD), a liquid crystal display (LCD), etc.
  • the spatial light modulator is adapted for modulating an incoming light beam into a number of individually modulated light beams.
  • Known types of exposure systems include the so-called flat-bed systems that expose a surface by moving an exposure head with a spatial light modulator across the surface to be exposed.
  • the spatial light modulator modulates the light according to image data that represents a sub-image of the image.
  • One known type of such devices comprises a light source, a light modulator with light modulating cells arranged in rows and columns.
  • the light modulator is imaged onto a light-sensitive material and a relative movement between the light modulator and the light-sensitive material is produced, perpendicular to the rows.
  • a data pattern is scrolled through the various columns of the light modulator at a rate that ensures that the image of any data pattern is held essentially stationary relative to the light-sensitive material during movement.
  • a surface is exposed by scanning successive longitudinal strips across the surface.
  • European patent EP 0 746 800 discloses an exposure and modulation device operating according to a step-and-repeat process.
  • the original image is broken down electronically into partial images which are displayed successively on a liquid crystal screen and reproduced on the area to be exposed such that the images recombine to form a total image of the original on the area.
  • the image content of each partial image is checked by an analyzer circuit or software to determine whether it contains image information, and the partial image is imaged on the area as a function of the results of this check. Hence, only partial images that require exposure are actually exposed, thereby avoiding unnecessary exposure steps.
  • a method of exposing an area according to digital image data representing an image comprising a plurality of image pixels, each pixel corresponding to a pixel value indicative of whether an exposure of said pixel is required, the method comprising - dividing the image into a number of sub-images; - generating a sequence of said sub-images; and - exposing a sequence of sub-areas of said area corresponding to the sequence of sub-images; wherein the dividing comprises - identifying respective groups of pixels that require an exposure, wherein the pixels of each group are located in a predetermined proximity from each other; - for each identified group of pixels, generating a corresponding sub- image to comprise that group of pixels.
  • each part-image includes image information and the sub-images are generated as to match the image content, thereby providing an improved division into sub-images.
  • the location of the sub-images within the image is optimised as to reduce the total required exposure time.
  • the method automatically ensures that the sub- images comprise image content. No sub-images are generated for areas above a certain size that do not require exposure. Hence, the combination of the generated sub-images does not necessarily correspond to the original image area, but it covers the image areas that require exposure. It is an advantage that a subsequent check of each partial image to determine whether it contains image information is not necessary, thereby further increasing the efficiency of the method.
  • the predetermined proximity is determined by an exposure model of an exposure head used to expose the area.
  • the exposure model provides functionality for calculating the required time for exposing a given area for a given set of exposure parameters, e.g. for a given exposure path, a given division of the area in exposure strips, etc.
  • the proximity is determined by the estimated exposure time, i.e. directly by the parameter to be optimised, thereby avoiding possible sub- optimisations caused by properties of the exposure system.
  • the exposing comprises scanning across the area along a predetermined scan direction as to expose a strip having a predetermined lateral strip width with respect to the scan direction, a particularly efficient exposure method is provided.
  • generating each of the sub-images comprises generating the sub- image to have a lateral dimension no larger than the lateral strip width. It is an advantage that the process allows the generation of strips of different widths, thereby providing an improved adaptation of the sub-images, i.e. their positions and sizes, to the actual image content.
  • the pixels are arranged in lines along the scan direction, and wherein identifying comprises - processing each line of pixels to identify linear groups of pixels in that line; wherein all pixels within a linear group of pixels have mutual distances smaller than a predetermined distance; and wherein pixels of different linear groups have distances larger than the predetermined distance; and - combining linear groups from different lines of pixels to respective groups of pixels. Consequently, the pixel clustering/grouping is performed in two stages: Firstly, pixels within one line/row along the primary scanning direction are grouped into line segments. Subsequently, the line segments of different lines are combined to sub-images. This two stage process has proven particularly efficient, in particular since it generates sub-images particularly suitable for a scanning/scrolling-based exposure method.
  • the dividing comprises - dividing the image into sub-images according to a first division algorithm resulting in a first sequence of sub-images; and - dividing the image into sub-images according to a second division algorithm resulting in a second sequence of sub-images; and - estimating exposure times for the respective first and second sequences based on an exposure model of an exposure head used for exposing the area; - selecting the sequence of sub-images corresponding to the smaller exposure time. Consequently, a computationally very efficient method is provided which results in a reduced exposure time without the need for a computationally very expensive exhaustive search for an optimal solution.
  • at least one algorithm is selected as to have a worst case behaviour that is at least as good as the un-optimised exposure of the entire area. It is understood that more than two alternative algorithm may be employed.
  • the invention further relates to an exposure system for exposing an area according to digital image data representing an image
  • the exposure system comprising an exposure head movable relative to an area to be exposed, and a control unit adapted to control movement of the exposure head relative to the area and to provide image data to the exposure head to be imaged; wherein the control unit is configured to - divide the image into a number of sub-images; - generate a sequence of said sub-images; and - control the exposure head to expose a sequence of sub-areas of said area corresponding to the sequence of sub-images; wherein the control unit is adapted to - identify respective groups of pixels that require an exposure, wherein the pixels of each group are located in a predetermined proximity from each other; and - for each identified group of pixels, to generate a corresponding sub- image to comprise that group of pixels.
  • the control unit may be a suitably programmed microprocessor, a suitably programmed computer, a dedicated control circuit, or any other suitable processing means.
  • processing means also comprises general- or special-purpose programmable microprocessors, Digital Signal Processors (DSP), Application Specific Integrated Circuits (ASIC), Programmable Logic Arrays (PLA), Field Programmable Gate Arrays (FPGA), special purpose electronic circuits, etc., or a combination thereof.
  • DSP Digital Signal Processor
  • ASIC Application Specific Integrated Circuits
  • PDA Programmable Logic Arrays
  • FPGA Field Programmable Gate Arrays
  • fig. 1 schematically shows an example of a flatbed printer
  • fig. 2 shows an example of a small portion of a ripped image at different stages of the optimisation process
  • fig. 3 shows an example of generated sub-images of a first algorithm for an image including six characters.
  • fig. 4 shows another exemplary image with exposure strips generated according to the first algorithm
  • fig. 5 shows the same exemplary image but with exposure strips generated according to a second algorithm
  • figs. 6a-d show the exposure area positioned at four possible starting points for the exposure of a strip
  • fig. 7 illustrates an example of a further optimisation step when defining exposure strips
  • fig. 8 illustrates an example of an exposure model.
  • Fig. 1a schematically shows a perspective view of a flatbed printer.
  • the flatbed printer of fig. 1 exposes a printing surface 119 of a printing plate 106 by scanning the printing surface with an exposure head 100 in longitudinal, transversally extending strips.
  • Fig. 1 b shows a schematic top view of the exposure head 100 and the printing surface 119 and illustrates the movement of the exposure head across the surface for an exemplary sequence of strips 121, 122, 123, and 124.
  • the strips extend in the longitudinal direction (y-direction), also referred to as the primary scanning direction.
  • the exposure head is moved to a starting position of another strip as indicated by the dotted arrows 125.
  • This movement may involve a movement in the longitudinal direction (y-direction) and/or a movement along the transversal direction (x-direction), or a combination thereof.
  • a scanning pattern involving fours strips is indicated.
  • the system allows a scanning in both the positive and negative y-direction as indicated by the arrows 126.
  • the scanning speed along the strips i.e. along the arrows 126) may be different from the speed at which the exposure head can be moved from an end position to the next start position (i.e. along arrows 125).
  • the exposure head has to be accelerated or slowed down.
  • the printer has an optical exposure head generally designated 100 that houses an optical system for directing a light beam towards the printing surface along an optical axis 104.
  • the light beam is modulated according to digital data representing the image/pattern to be printed.
  • the light beam is modulated by a spatial light modulator, thereby allowing simultaneous exposure of a certain exposure area.
  • An embodiment of an exposure head and a preferred modulation method that allows exposure of longitudinal strips by means of a scanning/scrolling operation are disclosed in WO 03/087915.
  • the exposure head 100 is movably mounted to a portal shaped support structure 101 such that the exposure head can be moved in a longitudinal direction 109 (the direction of the y-axis of the coordinate system 107) across the printing surface.
  • the support structure is further movably mounted on guides or threaded shafts 102 in a transversal direction 118, i.e. the direction along the x-axis of the coordinate system 107.
  • the exposure head is moved in the transversal and/or longitudinal direction allowing the exposure head to expose a new strip in the next longitudinal scan.
  • the longitudinal movement of the exposure head along the support structure and the transverse movement of the support structure are caused by suitable motors (not shown) such as step motors, or by another drive mechanism.
  • the scanning operation of the exposure head 100 and the modulation of the light beam are controlled by a control unit 114 via respective control signal connections 115, and 116, respectively.
  • the control unit 114 may be a suitably programmed microprocessor, a suitably programmed computer, a dedicated control circuit, or any other suitable processing means.
  • control unit 114 comprises a raster image processing unit (RIP) and an exposure head controller.
  • the RIP receives the original image and generates a sequence of scan strips to be exposed.
  • the RIP sends the generated scan strips including their start positions and the corresponding image data to an exposure head controller which controls the exposure head to expose the corresponding strip of the printing plate.
  • the process described in the following provides improved exposure efficiency for an exposure system with an exposure head using a light modulator such as a DMD or an LCD for exposing printing plates in strips along the Y-axis.
  • the exposure head can also be moved relative to the printing plate in the X-axis allowing the whole printing plate to be exposed.
  • a flatbed XY platemaker e.g. the system described in connection with fig. 1.
  • the whole area does not necessarily need exposure.
  • the image content is represented by image pixels arranged in rows and columns, each pixel has an associated value indicating whether or not that pixel is to be exposed (binary pixels) or even to what extend the pixel is to be exposed (e.g. for grey-scale images).
  • the exposure can be optimized as described herein by selecting the right strips to be exposed and the right sequence of these strips.
  • Step 1 The optimization process receives a model of the exposure unit/process.
  • the model of the exposing unit provides the following information about the exposing unit: - The maximum height of one exposure strip (i.e. its lateral dimension) - The time needed for exposing an area specified by its height and width - The time needed for moving from one position to a second position defined by the respective absolute positions. - The movement speed during exposure of a strip.
  • This model of the exposure unit takes into account the time needed for accelerating the exposure head up to the nominal speed and the fact that it is possible to simultaneously move both the exposure head in the Y-direction and the printing plate in the X-direction. It is understood that different exposure systems may correspond to different exposure models including additional and/or alternative parameters. For example, if an exposure head allows an efficient exposure of adjacent strips, this feature is preferably covered by the exposure model.
  • Step 2 A Raster Image Processor (RIP) generates the image to be exposed in the form of a matrix of binary values.
  • RIP Raster Image Processor
  • Fig. 2a shows an example of a small portion of a ripped image.
  • the image portion 200 is shown enlarged in order to make the individual pixels visible.
  • a single pixel may have size of a few micrometers, e.g. 10 ⁇ m.
  • the image 200 includes several dark areas which require exposure, while the white areas do not require exposure.
  • the dark area 201 comprises two pixels while area 202 comprises a larger number of pixels that require exposure.
  • Step 3 The optimisation process reads this matrix and, optionally, down- samples it, e.g. by a factor of 8 or 64, in order to reduce the amount of data.
  • the threshold is set so that the process can determine whether there is any data to be exposed within 8x8 or 64x64 pixels.
  • Fig. 2b shows the image 200 of fig. 2a after the down-sampling. Area 201 has been reduced to one pixel of the down-sampled image, while area 202 comprises four pixels.
  • Step 4 As the exposure head can expose long sequences of data in the Y- direction, the down-sampled data is joined to lines of data along the Y-axis: Pixels to be exposed that are immediately next to each other are joined. Pixels to be exposed, whose mutual distance is so short that it will be most efficient to expose both pixels in one exposure strip, are joined as well. How long this distance is allowed to be, is determined using the model of the exposure unit described in Step 1 :
  • the speed at which the exposure head can be moved in the scanning direction during exposure is considerably smaller than the speed at which the exposure head can be moved without exposure.
  • the exposure head also needs time to change between the two speeds and to initiate a new exposure.
  • the maximum distance between two pixels that are still joined depends on the above parameters. For some exposure systems, this distance is relatively large due to the time needed to accelerate and slow down the exposure head.
  • the maximum distance is determined by other parameters of the exposure model:
  • the increase in exposure time when not joining two pixels corresponds to the time needed to move the exposure head in x-direction, i.e. the movement time for a distance equal to the width of an exposure strip.
  • the predetermined maximum distance may be several centimetres, e.g. 106 mm, i.e. all pixels on the same X- coordinate with distances below 106 mm will be joined.
  • Fig. 2c shows an example of pixels 201 , 204, and 205 in one line that are joined to a linear group indicated by the box 203.
  • Step 5 The exposure head can expose a much wider area than the lines found above. For example, if the down-sampled pixels correspond to originally 8x8 pixels of 10 ⁇ m each, each of the lines of the down-sampled image is 0.08 mm wide. However, a typical exposure head may be able to expose a strip with a strip width of several mm, e.g. 11 mm, in one exposure strip. So the image area lines are preferably joined to larger image areas. This is not a trivial task to do. Actually it is computationally very intensive to compute the most efficient joining of the image line areas. In order to reduce the computational cost of the method, two fast algorithms are used, none of which necessarily ensures that the best possible joining is found. The algorithm achieving the lowest total time is used.
  • the first algorithm can achieve advanced results by creating overlapping image areas. However its worst case behaviour is not good. It might generate a set of image areas that would take longer to expose than if image areas were created over the whole plate area in a top-bottom manner.
  • the second algorithm is simpler, but defaults to the same result as if exposure strips were created over the whole plate area in a top-bottom manner.
  • Both algorithms join image areas to areas that can fit into one exposure strip, whose maximum width is determined by the exposure head. But the two algorithms have different limitations on how the exposure strips can be placed.
  • Step 6 The first algorithm can join any image areas that have overlapping Y- coordinates as long as they can fit into the same exposure strip. The resulting image areas might overlap.
  • Fig. 3 shows an image including six characters A, B, C, D, E, and F that are joined into two different exposure strips 301 and 302 that are overlapping.
  • the first algorithm runs in two passes: First it tries to join all image areas that overlap more than a predetermined constant, e.g. 50% of the length of the longer line segment, in the Y-direction in order to primarily join image areas that have similar extents.
  • a predetermined constant e.g. 50% of the length of the longer line segment
  • ⁇ x max is the maximum width of an exposure strip.
  • the process joins image areas that overlap with any amount in the Y-direction and that fit into the same exposure strip.
  • line segments that have not been joined in the first pass, because they do not overlap with another line segment with at least 50%, are joined in a second pass if they fit into an exposure strip.
  • Fig. 4 shows an exemplary image with exposure strips 31 , 32, 43, and 44. It is interesting to note that the exposure strip 44 is considerably shorter and narrower than the exposure strip 43 immediately below.
  • Step 7 The second algorithm sorts all the image areas according to their X- coordinates and places the first exposure strip at the image area with the lowest coordinate. All other image areas that are within the X-coordinates of that exposure strip are joined into that exposure strip or other exposure strips that are placed at exactly the same X-coordinates. This prevents any exposure strips from overlapping with other exposure strips which again ensures a worst case result that is at least as good as if exposure strips were created over the whole plate area in a top-bottom manner.
  • Fig. 5 shows an example of exposure strips 31 , 32, and 33 generated by this second algorithm. It is interesting to notice the difference to the previous algorithm:
  • the first exposure strip designated 31 has the maximum height and covers the whole width.
  • Step 8 The resulting exposure strips from both algorithms are examined, to determine if some of the exposure strips can be joined to lower the total exposure time, e.g. by comparing the respective exposure time determined according to the exposure model discussed in connection with step 1.
  • Step 10 The exposure sequence of the exposure strips is determined. This is done in two passes. The first sorts the exposure strips according to their position, so that exposure strips immediately above each other (i.e. adjacent in x-direction) are placed next to each other.
  • the second pass uses a "hill-climbing" algorithm, where one exposure strip is moved to a different position and then the total exposure and movement time is calculated according to the above exposure model. If the time is lower than the previous time, then the exposure strip is left at its new position.
  • the calculation of the total exposure and movement time is somewhat complicated as the exposure strips do not have a simple starting and ending point.
  • the exposure head moves equally well from the left side or the right side, and the height of an exposure strip is often lower than the maximum height determined by the exposure head, so there is some freedom to select the vertical starting position for the exposure head, as is illustrated in fig. 6.
  • Figs. 6a- d show the exposure area positioned at four possible starting points for the exposure of a strip 601.
  • the maximum height that can be exposed in one strip is designated 602. This height is larger than the height 603 of the strip 601.
  • Step 11 The total time for movement and exposure is calculated for the final sequences of exposure strips from the two algorithms of steps 6 and 7, respectively. The sequence with the lowest total time is used as best sequence.
  • Step 12 As shown above, two exposure strips might overlap and cover the same area. To prevent an area from being exposed twice, the image information from the overlapping area is removed from the first exposure strip and only included in the second.
  • Step 13 Each exposure strip is stored as a separate sub image inside one common TIFF file, so that the TIFF file contains multiple sub images.
  • Standard TIFF tags are used for the positions and a special tag is used for direction information.
  • the TIFF file is stored in a spooling system, so that the exposure optimization can be done in parallel with exposure of already optimized images. It is understood that other file formats may be used as well.
  • Step 14 The TIFF file is sent to the exposure system and the exposure system exposes each sub image as an exposure strip.
  • Fig. 7 illustrates an example of a further optimisation step when defining exposure strips.
  • Fig. 7a illustrates two overlapping areas 701 and 702, each of which may comprise a plurality of lines.
  • the process determines if two areas overlap (the overlap area is designated 703 in fig. 7a) and if the overlap extends in y-direction over the entire length of one of the areas (area 702 in the example of fig. 702). If the above conditions are fulfilled, the process removes the overlap area from that area (i.e. from area 702 in fig. 7), resulting in a reduced area with a smaller width. The result of this step is shown in fig. 7b, where the reduced area is designated 702'. Consequently, in subsequent steps, additional lines may be added to the now reduced area 702', thereby providing a more efficient definition of exposure strips.
  • Fig. 8 illustrates an example of an exposure model.
  • Fig. 8 illustrates the exposure model by means of an example of a movement pattern of an exposure head 100 across a printing surface 119, where strips 821 , 822, and 823 are exposed and wherein the exposure head 100 is moved between exposure strips along arrows 833 and 834.
  • This example of an implementation of the exposing unit model is based on an assumption that there are linear relations between the input parameters and the output parameters.
  • the input parameters and the output parameters.
  • the maximum height (x ma ⁇ ) of one exposure strip is set to a fixed value, as illustrated by exposure strip 821 in fig. 8.
  • the time needed for exposing an area is calculated based on a constant exposure speed S E .
  • a constant initial start-up time T E s is added to take into account a delay/penalty for each starting-up of an exposure step.
  • the needed number of exposure strips is calculated, and the required exposure time is determined as a sum of the individual exposing times for the individual strips. A single exposure startup time is added in this case. However, at the end of each exposure strip, the exposure head has to change its direction and a turn time constant Tt is added for each needed turn, as illustrated by the turn 833 between strips 821 and 822 in fig. 8.
  • the time needed for moving the exposure head) along arrow 834 from one position 831 to a second point 832 is calculated by assuming constant speeds SMY and SMX for each of the two motors responsible for the y- and x-axis movements, respectively, and by adding a constant movement startup time T M s-
  • T M s constant movement startup time
  • some exposure may be able to take advantage of scanning strips of equal width as it would not have to set up parameters for each strip.
  • the electronics of other exposures may be able to set up the parameters for each strip without performance loss, so there is no need to generate areas consisting of multiple strips all with the same width.
  • Such differences may, for example, be controlled by an additional penalty parameter (e.g. an additional delay time for exposing strips of different widths).
  • the parameters may depend on other parameters.
  • the exposure speed may depend upon the printing resolution and/or the plate type of the printing plate. The latter takes account of the fact that different plate types typically need different amount of light and the exposure speed is typically adjusted accordingly.
  • the startup times may in some embodiments be calculated from actual acceleration tables used for the stepper motors and from the needed printing speed.
  • the exposure startup time may depend upon the exposure speed, so in some embodiments the exposure startup time may be calculated depending upon the plate type.
  • the exposure model provides an estimate of the exposure time for the selected path.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Facsimile Scanning Arrangements (AREA)
  • Exposure And Positioning Against Photoresist Photosensitive Materials (AREA)

Abstract

L'invention concerne un procédé d'exposition d'une zone en fonction de données d'images numériques représentant une image, les données d'images numériques comprenant une pluralité de pixels d'images, chaque pixel correspondant à une valeur de pixel qui indique si une exposition dudit pixel est nécessaire. Le procédé de l'invention consiste : à diviser l'image en un certain nombre de sous-images ; à générer une séquence desdites sous-images ; et à exposer une séquence de sous-zones de ladite zone correspondant à la séquence des sous-images. L'étape de division consiste à identifier des groupes respectifs de pixels devant être exposés, les pixels de chaque groupe étant positionnés selon une proximité prédéterminée les uns par rapport aux autres ; et pour chaque groupe identifié de pixels, à générer une sous-image correspondante pour comprendre ce groupe de pixels.
PCT/DK2005/000410 2004-06-25 2005-06-20 Procede et systeme d'exposition d'une zone en fonction de donnees d'images numeriques WO2006000217A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DKPA200401001 2004-06-25
DKPA200401001 2004-06-25

Publications (2)

Publication Number Publication Date
WO2006000217A2 true WO2006000217A2 (fr) 2006-01-05
WO2006000217A3 WO2006000217A3 (fr) 2006-02-09

Family

ID=34973761

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DK2005/000410 WO2006000217A2 (fr) 2004-06-25 2005-06-20 Procede et systeme d'exposition d'une zone en fonction de donnees d'images numeriques

Country Status (1)

Country Link
WO (1) WO2006000217A2 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5485285A (en) * 1992-07-28 1996-01-16 Canon Kabushiki Kaisha Image recording apparatus
EP0746800A1 (fr) * 1994-02-21 1996-12-11 Lüllau, Friedrich Procede et dispositif de production photomecanique de surfaces structurees, plus particulierement pour l'exposition a la lumiere de plaques offset
US5689294A (en) * 1995-01-03 1997-11-18 Xerox Corporation Method and apparatus for skipping white spaces in marking devices
EP0905965A2 (fr) * 1997-08-22 1999-03-31 Xerox Corporation Copieur à jet d'encre avec prébalayage d'un original pour impression optimale

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5485285A (en) * 1992-07-28 1996-01-16 Canon Kabushiki Kaisha Image recording apparatus
EP0746800A1 (fr) * 1994-02-21 1996-12-11 Lüllau, Friedrich Procede et dispositif de production photomecanique de surfaces structurees, plus particulierement pour l'exposition a la lumiere de plaques offset
US5689294A (en) * 1995-01-03 1997-11-18 Xerox Corporation Method and apparatus for skipping white spaces in marking devices
EP0905965A2 (fr) * 1997-08-22 1999-03-31 Xerox Corporation Copieur à jet d'encre avec prébalayage d'un original pour impression optimale

Also Published As

Publication number Publication date
WO2006000217A3 (fr) 2006-02-09

Similar Documents

Publication Publication Date Title
US5345870A (en) "Direct-to-press" positive lithographic printing plate and method for making same
US5475475A (en) Image forming apparatus and method in which image of a plurality of originals are formed at different positions of one recording sheet
US7336391B2 (en) Multi-exposure drawing method and apparatus therefor
JP4114184B2 (ja) 多重露光描画装置および多重露光描画方法
US7248333B2 (en) Apparatus with light-modulating unit for forming pattern
KR970007511A (ko) 주사노광장치 및 이것을 사용한 디바이스 제조방법
JP4324645B2 (ja) 多重露光描画装置および多重露光描画方法
JP2003084444A (ja) 多重露光描画方法及び多重露光描画装置
TWI641922B (zh) 圖案曝光裝置、曝光頭、及圖案曝光方法
TWI688830B (zh) 曝光裝置及曝光方法
CN112764324B (zh) 光刻系统的扫描方法和光刻系统
US20060091323A1 (en) Exposure apparatus and exposure method for performing high-speed and efficient direct exposure
WO2006000217A2 (fr) Procede et systeme d'exposition d'une zone en fonction de donnees d'images numeriques
JP3819985B2 (ja) レーザ描画装置
US8547592B2 (en) Device and method for digital exposure
JP4362847B2 (ja) 描画装置
KR20070114629A (ko) 묘화 시스템
JP2005010468A (ja) パターン描画装置およびパターン描画方法
JP7432418B2 (ja) 露光装置および露光方法
JP2024042874A (ja) 露光方法および露光装置
JP4712517B2 (ja) テンプレートデータ作成方法および装置、テンプレートマッチング方法および装置並びに描画方法および装置
JP3726945B2 (ja) 蛍光ビーム式露光装置
JP2005300807A (ja) 描画装置
US4704021A (en) Apparatus for the exposure of a recording carrier including alpha numberic characters of faces having a foreground pattern contrasting relative to a background pattern
CN113448175A (zh) 曝光装置和曝光方法

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KM KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NG NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase in:

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

122 Ep: pct application non-entry in european phase