CN1196544A

CN1196544A - Dynamic linking method for computer image

Info

Publication number: CN1196544A
Application number: CN 97110365
Authority: CN
Inventors: 张景嵩; 林光信; 刘恪
Original assignee: Inventec Corp
Current assignee: Inventec Corp
Priority date: 1997-04-15
Filing date: 1997-04-15
Publication date: 1998-10-21
Anticipated expiration: 2017-04-15
Also published as: CN1062362C

Abstract

A dynamick link method for computer image features that computer is used to cut more than one device-independent bitmap file stored in memory address, the cut images are copied to an address of newly created file, and after these images all are copied, the memory space seized by original bitmap file is released. As it is unnecessary to open and close the original bitmap files, operation speed, image processing speed and utilization rate of memory are increased and memory space is saved.

Description

A kind of dynamic linking method of computer picture

The present invention relates to a kind of dynamic linking method of computer picture, particularly relate to the method that a kind of image that carries out the picture editting after cutting out dynamically links.

General commonly used image processing software is carrying out the picture editting when handling, must by computing machine each source bitmap file be written in the different address of computer memory earlier, the user promptly carries out editing and processing at the image in these source bitmap files, at this moment, because each source bitmap file must occupy and be present in the different address of computer memory, when making the user carry out editing and processing, can utilize image wherein at any time, if the quantity huge (as: the source bitmap files more than 4 or 5) of source bitmap file, then these source bitmap files will occupy sizable computer memory space, so, very easily cause in order to edit the storage space deficiency of new bitmap file, the speed that the picture editting is handled is slowed down, especially, the user may face the predicament that can't proceed editing and processing in editing process, and must be with closing these source bitmap files, to transcribe out storage space, therefore cause user's inconvenience greatly in operation, in addition, open repeatedly at these source bitmap files, the action of closing archives also causes its operating efficiency not good.

The objective of the invention is carrying out the picture editting when handling at the aforementioned conventional image software, many shortcomings of being derived, a kind of dynamic linking method of computer picture is provided, so that can effectively increase the operating speed of user when carrying out Flame Image Process by the present invention, and can effectively save storage space, significantly improve the benefit of utilizing of storer.

For reaching fundamental purpose of the present invention, solution of the present invention is to utilize computing machine at (the DEVICE INDEPENDENTBITMAP of the device independent bit more than that is written in each storer address, hereinafter to be referred as bitmap) file, cut out, in the establishment file of again that these bitmap copy to one after cutting out are new storer address, after information for the treatment of these source bitmaps are copied to this establishment file fully, i.e. displayable image, and wherein said cutting out comprises the steps:

(1) at first, open a device independent bit file from memory storage, and come source file to be written into storer this, and obtain the storer address that this comes source file by computing machine;

(2) secondly, computing machine will be created a new file to a new memory address, and in the future the file gauge outfit of source file copies to the new storer address of this establishment file, and cuts out the image that is duplicated according to value of consult volume, comprises the information such as size of width, height and the image of image;

(3) this is come the colour disk of source file copy to the file gauge outfit of this establishment file, this step is with duplicating the colour disk information that this comes source file, and makes the file that is duplicated comprise source file complete file head;

(4) this is come the view data of source file, the requirement according to its value of consult volume copies in this establishment file one by one, finishes up to all duplicating;

(5) cut out finish after, promptly return the initial address of creating bitmap file, so, promptly finish and once cut out operation;

(6) judge whether also will cut out,, then repeat aforementioned second to six step up to finishing if also need come other image in the source file to cut out to this;

(7) otherwise, be about to these and come the shared storage space of source file to discharge, take unnecessary storage space with minimizing.

So, during user's operation, only need to create that formed bitmap carries out editing and processing in the file, and need not in addition to carry out extra pass shelves action, can effectively increase user's operating speed with regard to the source bitmap file of former unlatching, in addition, by the occupied storage space of these source bitmap files, will be automatically released, so, can effectively save storage space, make it to increase substantially the time of utilizing benefit and Flame Image Process of storer.

Below with reference to accompanying drawings the present invention is specifically described.

Description of drawings:

Fig. 1 is the step synoptic diagram of computer picture dynamic linking method of the present invention;

Fig. 2 is that the figure of computer picture dynamic linking method of the present invention is cut out schematic flow sheet;

Subordinate list 1 is the colour disk table of computer picture.

The present invention is under the computer operation system, as: under the Windows system of Microsoft, when carrying out Flame Image Process for the device independent bit more than, dynamic binding and treatment step thereof between these bitmaps, with reference to shown in Figure 1, mainly comprise following three parts: 1. be written into image:

(1.1) at first, computing machine is indicated according to the user, by in the memory storage (as: floppy disk, hard disk or other device) the device independent bit file more than directly being written in each storer address of computing machine.

(1.2) secondly, again at the image in the bitmap file that is written into this storer respectively, cut out, to be divided into some little memory blocks, and indicate its storer address with different pointers, some are applied to the habitual Flame Image Process instrument under the Windows operating system at present, as: Mediaknife etc., all less than as the present invention when different bitmap files are written into, earlier provide the function of cutting out, only can carry out the picture editting when handling, cut out at the image in these bitmap files by the user the user at image wherein, so, habitual Flame Image Process instrument moves because of opening shelves repeatedly and close shelves at each loaded bitmap file in use, and it is numerous and diverse to cause its job procedure, speed when causing Flame Image Process is slow, and the present invention, owing to when each bitmap file is written into, promptly by computing machine the image cutting-out in each bitmap file has been finished, speed when therefore, having accelerated Flame Image Process.2. establishment image:

Subsequently, computing machine is created a file (promptly creating file) again in another new storer address, make the image after cutting out in aforementioned each bitmap file, be copied to one by one in this establishment file, use during for the successive image editor, this establishment file comprises creates a sightless background, makes this background can be used to carry out the picture editting thereon, as: the excessive effects of generation different images, transparent effect etc.3. picture editting:

The present invention is directed to aforementioned image after cutting out when dynamically linking, its practice is as follows:

(3.1) computing machine can copy to the image through cutting out in aforementioned loaded each bitmap file on this establishment file one by one.

(3.2) computing machine can be with the image after cutting out in these loaded bitmap files, copy to one by one on this establishment file with transparent mode, these so-called transparent modes, be meant with the Transparent color of a certain color as these bitmap files, this Transparent color can not cover original part on this establishment file in the time of on copying to this establishment file, thereby produces transparent effect.

(3.3) computing machine can at random amplify these loaded bitmap files or dwindle in proportion, and will be through the result of transparent processing, duplicate or transparent replication to this establishment file.4. display image:

(4.1) this establishment file after will editing all is presented on the display screen.

(4.2) this establishment file after will editing is shown partially on the display screen.

(4.3) carry out the processing of palette at the image that is presented on the screen, to reach special-effects such as exempting from the dish circulation.

Characteristic of the present invention mainly is that the part of image cutting-out is elaborated to the step of image cutting-out referring now to Fig. 2 when handling the dynamic binding of image.

1. at first, the present invention opens a device independent bit file by computing machine from memory storage, and this document is written into storer, and obtains the storer address of this bitmap file, and this document is assumed to be file 1.

2. secondly, computing machine will be created a new file (promptly creating file) in a new memory address, and the file gauge outfit of file 1 copied to this new storer address, and according to parameter modification related content, the information such as size that comprise width, height and the image of image, this establishment file is assumed to be file X.

Generally, the file of the irrelevant bitmap of aforementioned device can be following form:

1) file header: the fileinfo and 256 that comprises 42 bytes (byte) ^*The colour disk table of 4 bytes (byte).

2) view data: i.e. the index value (more than or equal to 0, smaller or equal to 255) of the corresponding colour disk table of each pixel (Pixel) (shown in subordinate list 1), now with 1 ^*11 content of image files are example, are described as follows:

The actual image data of this image file (actual storage is to store according to the row order):

87?87?87?87?87?87?87?87?87?87?87

87?87?87?87?32?32?32?87?87?87?87

87?87?32?32?32?32?32?32?32?87?87

87?32?32?32?32?32?32?32?32?32?87

87?87?32?32?32?32?32?32?32?87?87

87?87?87?87?32?32?32?87?87?87?87

87 87 87 87 87 87 87 87 87 87 87, wherein this view data 87 is to correspond to represent green index value in the colour disk table, so its background that is presented is for green, in like manner, view data 32 is the circle in this formed redness above green background.

3. the colour disk of file is copied to the file gauge outfit of file X, this step is to use to duplicate the colour disk information of source file, and makes the file that is duplicated comprise source file complete file head.

4. with the view data of file 1, the requirement according to its value of consult volume (as: information such as starting point coordinate, width, height) copies among the file X one by one, finishes up to all duplicating.The concrete practice of this step can be in the following example shown in:

At first, suppose the source bitmap file view data be 1 ^*The image of 5 sizes (being that width is 8, highly is 5):

1?3?5?2?6?7?9?1

2?4?6?8?2?5?7?2

3?5?7?9?4?6?1?5

2?4?6?8?9?0?1?4

72414905, if the bitmap coordinate that must cut out is (2,2), width is 4, highly is 3, computing machine promptly one by one in the future the view data of source file be copied to the purpose address of establishment file, its data are:

4682 ← once duplicate

5794 ← secondary duplicates

Duplicating the above practice 4689 ← three times, is to cut out for standard rectangular (comprising square).

The present invention is when cutting out rectangle, the value of consult volume that computing machine provided is upper left corner coordinate, rectangle width and the rectangle height etc. of rectangle, for general device don't-care bit map file, file begin to comprise the certain bitmap of length (Bitmap) information (as: size of the width of bitmap, height and file etc.), be the colour disk information of bitmap then, be only the data of bitmap at last.

If must cut out the non-rectangle image, then need a value of consult volume, record the starting point coordinate of each horizontal scan line of composition diagram picture and the width of sweep trace in this table.The present invention will be wide according to the wideest value of sweep trace in this table when cutting out, and the number of sweep trace is high, carry out rectangle and cut out, and after cutting out, non-sweep trace part then replaces (representing Transparent color as No. 0 look) with Transparent color.So, when its scan-line data is following:

X Y Width

4 1 1

3 2 3

235 its real data are:

5

468

35794 cut out after, this bitmap is a triangle, other non-sweep trace part then replaces (represent Transparent color as No. 0 look) with Transparent color, and with this bitmap copy in this establishment file, its data value is:

0?0?5?0?0

0?4?6?8?0

3?5?7?9?4

The fundamental purpose that in the present invention image of non-rectangle is given rectangleization is for making things convenient for image manipulation, because this image only needs can indicate entire image with 4 data, as for, the part of other sky is then filled with Transparent color, makes among the successive image editor and uses transparent processing.

The dynamic binding of computer picture of the present invention, mainly be in storer, to open up a new storage space (promptly creating file) to deposit bitmap through cutting out, and the file header of source file copies to this address space in the future, then, revise the file header content of being duplicated according to the parameter that comes source file again, as: the bitmap size through cutting out, wide, high.

The so-called parameter of the present invention, be meant the part that must cut out at the starting point coordinate of source bitmap and the width that need cut out, highly, and its X coordinate must be less than the width of source bitmap, the Y coordinate is less than the height of source bitmap, meaning promptly:

The width of width+X＜source bitmap

Highly+width of X＜source bitmap for example:

X Y Width?Height

The actual numerical value of 0055 bitmaps is:

87?87?87?87?87

87?87?87?87?32

87?87?32?32?32

87?32?32?32?32

Cut out for non-rectangle, coordinate and width that the required value of consult volume that provides is a sweep trace, as: scan-line data is:

X Y?Length

2 5 3

3 3 7

4 3 7

5 1 9

6 1 9

7 1 9

8 3 7

9 3 7

10 53 it cut out the result and be:

00?00?00?32?32?32?00?00?00

00?32?32?32?32?32?32?32?00

32?32?32?32?32?32?32?32?32

00?32?32?32?32?32?32?32?00

00?00?00?32?32?32?00?00?00

5. cut out finish after, promptly return the initial address of creating bitmap file X, so, promptly finish and once cut out operation.

6. judge whether also will cut out? if also need cut out other image in this bitmap file, then repeated execution of steps 2-6 is up to finishing.

Otherwise, be about to the shared storage space of these bitmap files 1 (i.e. source file) and discharge, take unnecessary storage space with minimizing.

The above; it only is a preferred embodiment of the present invention; and claim of the present invention scope required for protection; be not limited thereto; all those skilled in the art; according to the disclosed technology contents of the present invention, the variation that can expect easily and equivalent all should belong to and not break away from protection category of the present invention.

Subordinate list 1

Colour disk table: Index R G B

0 00 00 00

1 00 00 00

2 00 AA 00

3 00 AA AA

4 AA 00 00

5 AA 00 AA

6 AA 55 00

7 AA AA AA

8 55 55 55

9 55 55 FF 10 55 FF 55 · 55 FF FF · FF 55 55 · FF 55 FF · FF FF 55

FF FF FF

EF EF EF

DF DF DF

D3 D3 D3

C3 C3 C3

B7 B7 B7

AB AB AB

9B 9B 9B

8F 8F 8F

7F 7F 7F

73 73 73

67 67 67

57 57 57

4B 4B 4B

3B 3B 3B

2F 2F 2F

23 23 2332 FF 00 00

EF 00 00

E3 00 00

D7 00 00

CB 00 00

BF 00 00

B3 00 00

A7 00 00

9B 00 00

8B 00 00

7F 00 00

73 00 00

67 00 00

5B 00 00

4F 00 00

40 00 00

FF DA DA

FF BA BA

FF 9F 9F

FF 7F 7F

FF 5F 5F

FF 40 40

FF 20 20

FF 00 00

FC A8 5C

FC 98 40

FC 88 20

FC 78 00

E4 6C 00

CC 60 00

B4 54 00

9C 4C 00

FC FC D8

FC FC B8

FC FC 9C

FC FC 7C

FC F8 5C

FC F4 40

FC F4 20

FC F4 00

E4 D8 00

CC C4 00

B4 AC 00

9C 9C 00

84 84 00

70 6C 00

58 54 00

40 40 00

D0 FC 5C

C4 FC 40

B4 FC 20

A0 FC 00

90 E4 00

80 CC 00

74 B4 0087 60 9C 00

D8 FC D8

BC FC B8

9C FC 9C

80 FC 7C

60 FC 5C

40 FC 40

20 FC 20

00 FC 00

00 FF 00

00 EF 00

00 E3 00

00 D7 00

7C B0 0

7B F0 0

7B 30 0

7A 70 0

79 B0 0

78 B0 0

77 F0 0

77 30 0

76 70 0

75 B0 0

74 F0 0

44 00 0

DA FF FF

B8 FC FC

9C FC FC

7C FC F8

5C FC FC

40 FC FC

20 FC FC

00 FC FC

00 E4 E4

00 CC CC

00 B4 B4

00 9C 9C

00 84 84

00 70 70

00 58 58

00 40 40

5C BC FC

40 B0 FC

20 A8 FC

0 9C FC

0 8C E4

0 7C CC

0 6C B4

0 5C 9C

DA DA FF

BA BF FF

9F 9F FF

7F 80 FF

5F 60 FF

40 40 FF

20 25 FF

00 5F 0F

00 00 FF

00 00 EF

00 00 E3

00 00 D7

00 00 CB

00 00 BF

00 00 B3

00 00 A7

00 00 9B

00 00 8B

00 00 7F

00 00 73

00 00 67

00 00 5B

00 00 4F

00 00 40

F0 DA FF

E5 BA FF

DA 9F FF

D0 7F FF

CA 5F FF

BF 40 FF

B5 20 FF

AA 00 FF

9A 00 E5

80 00 CF

75 00 B5

60 00 9F

50 00 85

45 00 70

35 00 5A

2A 00 40

FF DA FF

FF BA FF

FF 9F FF

FF 7F FF

FF 5F FF

FF 40 FF

FF 20 FF

FF 00 FF

E0 00 E5

CA 00 CF

B5 00 B5

9F 00 9F

85 00 85

6F 00 70

5A 00 5A

40 00 40

FF EA DF

FF E0 D0

FF DA C5

FF D5 BF

FF CF B0

FF C5 A5

FF BF 9F

FF BA 90

FF B0 80

FF A5 70

FF 9F 60

F0 95 5F

EA 8F 5A

DF 8A 55

D0 80 50

CA 7F 4F

BF 7A 4A

B5 70 45

AA 6A 40

A0 65 3F

9F 60 3A

90 5F 35

8A 5A 30

80 50 2F

75 4F 2A

6F 4A 25

5F 40 20

55 3F 1F

4A 3A 1A

40 30 1A

3A 2F 15

2A 20 0F

0 0 0

C7 2B 2B

C7 4F 2B

C7 77 2B

C7 9F 2B

C7 C7 2B

9F C7 2B

77 C7 2B

4F C7 2B

2B C7 33

2B C7 5F

2B C7 8B

2B C7 B7

2B AB C7

2B 7F C7

2B 53 C7

2F 2B C7

5B 2B C7

87 2B C7

B3 2B C7

C7 2B AF

C7 2B 83

C7 2B 57

C7 2B 2B255?FF FF FF

Claims

1. the dynamic linking method of a computer picture, its step comprises:

The device independent bit file is written in the storer address of computing machine; Cut out; Bitmap copy that will be after cutting out is in the establishment file of new storer address; Display image is wherein saidly cut out step and is comprised the steps:

2. the dynamic linking method of a kind of computer picture as claimed in claim 1, wherein computing machine is when coming source file to cut out with rectangular image, be the value of consult volume that provides according to computing machine, this value of consult volume is upper left corner coordinate, rectangle width and the rectangle height of rectangle.

3. the dynamic linking method of a kind of computer picture as claimed in claim 1, wherein, computing machine is the value of consult volume that provides according to computing machine when coming source file with the non-rectangle image cutting-out, records the starting point coordinate of each horizontal scan line of composition diagram picture and the width of sweep trace in this value of consult volume, when cutting out, to be wide according to the wideest value of sweep trace in this table, the number of sweep trace be high, carries out non-rectangle and cuts out, after cutting out, non-sweep trace part then replaces with Transparent color.

4. the dynamic linking method of a kind of computer picture as claimed in claim 1, wherein this value of consult volume be meant the part that must cut out at the starting point coordinate of source bitmap and the width that need cut out, highly, and its X coordinate must be less than the width of source bitmap, the Y coordinate is less than the height of source bitmap, anticipates promptly:

The width of width+X＜source bitmap

Highly+width of X＜source bitmap