JP3740283B2 - Polyhedron generation method, information processing method, and recording medium - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a method for obtaining a color gamut of point sequence data indicating a sequence of points scattered in a color coordinate space.
[0002]
[Prior art]
It is widely known that there are three attributes (brightness, hue, and saturation) as elements constituting a color. As an example of assigning these three attributes to orthogonal coordinates and expressing them in a three-dimensional Euclidean space, the RGB color space, the XYZ color space, and the like are widely used.
[0003]
Among various color spaces, there is a uniform perceptual color space as a combination of distance and color difference in the space. Among them, the CIE 1976-Lab space (hereinafter simply referred to as “Lab color space”) is one of uniform perceptual color spaces often used for analyzing the color mapping state and the color reproduction region of each color device. In order to analyze the color mapping state and the color reproduction area of each color device, it is necessary to measure or calculate the color (Lab value) output from the color device and plot it in the Lab color space. Here, the plot means to write the data on the graph. In the case of a two-variable plot, a point sequence or the like is written at the coordinate position on the plane such as the XY coordinates, but the coordinates are configured as a space. In that case, a 3D rendering function must be used.
[0004]
The 3D rendering system reproduces an object in space as a two-dimensional image in a pseudo manner by generating an image mapped onto a certain projection plane through a preset observation position. Furthermore, functions such as rotation and enlargement / reduction are often added in order for the operating user to observe the situation in more detail. By using such a function, it has been conventionally performed to visualize color data scattered in a color space.
[0005]
[Problems to be solved by the invention]
There are many types of 3D rendering systems that provide the 3D rendering function described above. Among them, there are some which need to match the normal vectors of the triangular polygons to be drawn for the convenience of hidden surface processing.
[0006]
However, there is no technical disclosure of a technique for matching the normal vectors of the polygon group by automatic processing for a polyhedron composed of triangular polygons. For this reason, in the three-dimensional rendering system in which the normal vectors of the triangular polygons to be drawn must coincide with each other because of hidden surface processing, it has been impossible to draw a polygon group having irregular normal vectors.
[0007]
Here, in the three-dimensional rendering system, the relationship between the order of the three vertices of the registered triangular polygon and the direction of the normal vector of the triangular polygon will be described with reference to FIG.
[0008]
Considering the normal vector in a triangular polygon, the length is uniquely determined, but its direction must be clearly defined as necessary. Therefore, when viewed in the order of the registered vertices, the direction of the normal vector is defined as the direction of advance in the same way as the direction of the right-handed screw. In the case of a triangular polygon registered in the clockwise direction of 04 → 19 → 05, the normal vector is directed in the back direction, which is the same as the case where the right screw advances when it rotates clockwise. On the other hand, in the case of a triangular polygon registered as 04 → 11 → 05, the normal vector is directed in the forward direction, which is the same as the direction that proceeds when the right screw is rotated counterclockwise. From this example, it can be seen that the normal vectors of the triangular polygon registered as 04 → 19 → 05 and the triangular polygon registered as 04 → 11 → 05 do not match.
[0009]
In addition, when such a triangular polygon group whose normal vectors do not match is displayed in the above-described system, there is a problem that a triangular polygon that should be originally drawn may not be displayed.
[0010]
An object of the present invention is to make it possible to obtain a color gamut of a point sequence data group indicating a sequence of points scattered in a color coordinate space at high speed.
[0011]
It is an object of the present invention to display a color gamut of a point sequence data group indicating a sequence of points scattered in a color coordinate space at high speed.
[0012]
[Means for Solving the Problems]
In order to achieve the above object, the invention described in claim 1 of the present application is a color image processing apparatus for obtaining a polyhedron indicating a color gamut of a point sequence data group indicating a point sequence scattered in a color coordinate space, Reading means for reading a point sequence data group indicating a point sequence scattered in the coordinate space; extraction means for extracting N-point point sequence data from the point sequence data group according to a predetermined condition; and the N point data Generating means for generating an N-hedron based on the above, exclusion means for excluding the point sequence data indicating the included sequence of the N-plane from the point sequence data group, and point sequence data indicating the included sequence of the N-plane Generation means for generating an M-hedron (M> N) indicating the color gamut from the N-hedron using the point sequence data group excluding the M-hedron, and storing vertex data constituting the M-hedron in a storage unit It is characterized by that.
[0013]
The invention according to claim 5 of the present application is a color information processing method applicable to a color image processing apparatus, which reads a point sequence data group indicating a point sequence scattered in a color coordinate space, and from the point sequence data group N-point point sequence data is extracted according to a predetermined condition, an N-face body is generated based on the N-point data, and the point-sequence data included in the N-plane body is excluded from the point-sequence data group, An M-hedron (M> N) indicating the color gamut is generated from the N-hedron using a point-sequence data group excluding point-sequence data indicating the included point sequence of the N-hedron, and the M-hedron is configured. Vertex data is stored in a storage unit, and an M-hedron indicating the color gamut is displayed on a display unit using vertex data constituting the M-hedron.
[0017]
DETAILED DESCRIPTION OF THE INVENTION
(Embodiment 1)
First, an outline of a system for realizing polyhedron generation processing and polyhedron generation processing will be described.
[0018]
A first embodiment will be described with reference to FIGS.
[0019]
First, a schematic configuration of the present embodiment will be described. FIG. 6 shows an example of a three-dimensional rendering system 10 (polyhedron generation device) that provides a 3D rendering function in the color image processing apparatus 1.
[0020]
The three-dimensional rendering system 10 includes a data generation unit 11, a data change unit 12, and a display unit 13. Reference numeral 14 denotes a file system for storing the generated polyhedron data. Reference numeral 15 denotes a memory used in an embodiment described later.
[0021]
Here, the data generation means 11 takes in a sequence of points scattered in the coordinate space, derives a triangle from the search target side, and generates the vertex of the triangle as a data group of triangular polygons constituting the polyhedron. Through such polyhedron generation processing, the vertices of each triangular polygon are registered in the file system 14 as a set of data.
[0022]
The data changing means 12 calculates the normal vector of each triangular polygon constituting the polyhedron and matches the normal vector of all the triangular polygons constituting the polyhedron by appropriately changing the normal vector as necessary. Let That is, first, one point is set inside the generated polyhedron. Normally, the centroid point obtained from the triangular polygon coordinates is within the polyhedron, so that the centroid point is used as the inner point, but it is not necessary to be the centroid point. Next, a set of registered vertex data of triangular polygons is extracted. As the vertex data, an outer product vector is obtained from the registered order and the coordinate data of the vertex, and this is used as a normal vector. Next, a centroid point as a triangle of the triangular polygon is obtained, and a vector connecting the internal point and the centroid point as a triangle is calculated by obtaining a vector with the internal point. Next, an inner product of the calculated vector and the normal vector is taken, and the order of the registered vertex data is appropriately changed as necessary using the obtained scalar value. By such processing, the normal vectors of all the triangular polygons are matched.
[0023]
The display means 13 displays the polyhedron in which the normal vectors after matching the order of the vertices of the triangular polygons constituting the polyhedron are all matched.
[0024]
FIG. 1 is a flowchart showing a polyhedron generation process surrounding a sequence of points scattered in a coordinate space. First, in step S11, initialization processing is performed. Here, the first triangle is searched. The first triangle is searched in the vicinity of the extreme point such as the maximum value or the minimum value of the point sequence scattered in the coordinate space. Next, in step S12, the sides to be searched are reorganized, and the sides to be searched are registered in the file system 14.
[0025]
In step S13, it is determined whether or not the search is completed by sequentially examining the edges registered in step S12. If the search is not completed, the process proceeds to step S14, the address of the search target side is accessed, and the coordinate data of the side registered in the file system 14 is extracted.
[0026]
In step S15, it is verified whether a new triangle can be derived from the search target side based on the coordinate data extracted from the file system 14, and a new vertex candidate is searched. If it is determined in step S16 that the new vertex candidate does not overlap with the one already registered, if it is a new registration target, additional registration is performed in the file system 14 in step S17. By sequentially searching in this way and deriving new triangles from each triangle and registering them, polygon data can be generated.
[0027]
By the process of FIG. 1 described above, as shown in FIGS. 4 and 5, it is possible to automatically generate a polyhedron that surrounds a point sequence scattered in the coordinate space.
[0028]
Next, in the three-dimensional rendering system, the relationship between the order of the three vertices of the registered triangular polygon and the direction of the normal vector of the triangular polygon will be described with reference to FIG.
[0029]
Considering the normal vector in a triangular polygon, the length is uniquely determined, but its direction must be clearly defined as necessary.
[0030]
For example, when the hidden surface processing is performed, a triangular polygon that performs the hidden surface processing based on the positional relationship between the viewpoint position and the polyhedron is obtained. As one method of performing this hidden surface processing at high speed, if the inner product of the vector from the center of gravity of the triangular polygon to the viewpoint and the normal vector of the triangular polygon (positive direction of right-handed screw) is negative, There is a technique for performing hidden surface processing.
[0031]
Therefore, in this embodiment, when viewed in the order of the registered vertices, the direction of the normal vector is defined as the direction of the normal vector, and the normal of all the triangular polygons constituting the polyhedron is defined. Performs processing to align vector directions.
[0032]
In the example shown in FIG. 9 described above, in the case of a triangular polygon registered in the clockwise direction of 04 → 19 → 05, the normal vector faces in the back direction, and the two triangular polygons are adjacent to each other. The normal vectors indicate completely opposite directions. In such a case, the direction of the normal vector is changed. Specifically, as shown in FIG. 3, by rearranging 04 → 19 → 05 and re-registering 04 → 05 → 19, the direction of the normal vector is aligned.
[0033]
In order to make all the normal vectors of the triangular polygons constituting the polyhedron coincide, the normals of all the triangular polygons need to be set outward. To do this, if a vector is calculated from the point inside the polyhedron (inner point or centroid) to the centroid of each triangle, the inner product of the vector and the normal vector is taken, and the inner product value becomes negative A process of changing the registration order of the vertex data of the triangular polygon may be performed.
[0034]
FIG. 2 is a flowchart for explaining data change processing for examining the vectors of each triangular polygon and changing the registration order of vertices in order to match the normal vectors of all the triangular polygons constituting the polyhedron.
[0035]
First, in step S411, initialization processing is appropriately performed. In the data reading process in step S412, each triangular polygon data recorded in the file system 14 is read. In step S413, the barycenter of the polyhedron is calculated based on the coordinates of the read triangular polygon data. In the reading process in step S421, the vertex coordinates are read again.
[0036]
In the vector calculation process in step S422, the center of gravity of the triangle is obtained, and the vector A directed to the center of gravity of the triangle is calculated from the center of gravity of the polyhedron obtained in step 413. In the normal vector calculation processing in step S423, normal vector components are calculated based on the registered vertex order, and in the inner product calculation processing in step S424, the inner product calculation of the normal vector and the vector A is performed.
[0037]
The determination process in step S425 is configured to branch to the rearrangement process in step S426 when the calculated inner product value is a negative number. In the rearrangement process in step S426, a process of exchanging the second and third data which are the vertex data of the triangular polygon registered in the file system 14 is performed. In the end determination process of step S427, it is determined whether or not the reading has been completed by referring to the file structure. If the reading has not ended, the process returns to the reading process of step S421, and if the reading has ended, the end process of step S428 is performed. Proceed to ending processing.
[0038]
By appropriately changing the vertex registration order as described above, the normal vectors of all the triangular polygons constituting the polyhedron can be matched.
[0039]
Next, Modification 1 of Embodiment 1 will be described with reference to FIG.
[0040]
In this example, as shown in FIG. 6, in the process of generating and changing a polyhedron, instead of reading and processing data already registered in the file system 14 and the like as in the example of the first embodiment, Data read processing is executed using the memory 15.
[0041]
First, in the initialization processing 511 in step S511, initialization processing is performed as appropriate. In the data reading process in step S152, the point sequence data recorded in the file system 14 is read. The search end determination process in step S513 is the same process as step S13 in FIG. 2, and the search registration process in step S514 is a process substantially similar to the process from S14 to S17 in FIG.
[0042]
In this example, without registering in the file system 14 here, the process proceeds to the next process while temporarily retaining the data on the memory 15.
[0043]
In the center-of-gravity point calculation process in step S515, the data of the triangular polygon recorded on the memory 15 is accessed to calculate the center-of-gravity point of the polyhedron. In the coordinate extraction process in step S521, the data on the memory 15 is accessed again, and the vertex coordinate data is extracted. In the vector calculation process in step S522, a centroid point of the triangle is obtained, and a vector A directed to the centroid point of the triangle is calculated from the centroid point of the polyhedron obtained in step S515. In the normal vector calculation process in step S523, a normal vector component is calculated based on the registered order of vertices, and in the inner product calculation process in step S524, an inner product calculation of the normal vector and the vector A is performed.
[0044]
In the determination process of step S525, when the calculated inner product value is a negative number, the process branches to the rearrangement process of step S526. In the rearrangement process in step S526, the second and third data that are the vertex data of the triangular polygons registered in the memory 15 are exchanged. In the end determination process in step S527, it is determined whether or not the process has been completed by referring to a pointer or the like that refers to registered data. If it has not been completed, the process returns to the extraction process in step S521. Proceeding to an end process, an end process such as a data write / save process on the memory 15 and a memory 15 release process is appropriately performed.
[0045]
Next, a second modification of the first embodiment will be described with reference to FIG.
[0046]
In this example, after the point sequence data of FIG. 4 is input, a process for sequentially displaying the retrieved triangular polygons on the display means 13 at the stage of forming the polyhedron of FIG. 5 is provided.
[0047]
First, in the data reading process in step S611, the point sequence data recorded in the file system 14 is read. In the center point calculation process in step S612, the center point (internal point) when the polyhedron is configured is calculated from the maximum value and the minimum value of each coordinate component in each data.
[0048]
The search end determination process in step S613 is a process corresponding to S13 in FIG. 2, and the search end determination process is repeated until the process ends. In the search process of step S621, a triangular polygon to be newly registered is searched and temporarily registered in a temporary area. In the vector calculation process in step S622, a vector A is calculated from the center point of the polyhedron obtained in step S612 to a vector point going to one of the three vertices forming the triangular polygon.
[0049]
In the normal vector calculation process in step S623, a normal vector component is calculated based on the order of the tentatively registered vertices, and in the inner product calculation process in step S624, an inner product calculation of the normal vector and the vector A is performed. .
[0050]
In the determination process of step S625, when the calculated inner product value is a negative number, the process branches to the rearrangement process of step S626. In the rearrangement process in step S626, the second and third data that are the vertex data of the triangular polygons registered in the memory 15 are exchanged. In the drawing process in step S627, the triangular polygon with the normal vector optimized is additionally displayed on the display means 13, and the additional operation is repeated until all the searches are completed.
[0051]
(Embodiment 2)
As a method for generating a convex polyhedron as shown in FIG. 5, the gift wrapping method is widely known as the most basic implementation method. As shown in FIG. 1, a point sequence is input, and each data sequence is appropriately operated with respect to the point sequence, starting from an appropriate outer point, and the next point sequence (vertex candidate) is repeatedly searched. It will be.
[0052]
However, with this method, there is a problem that the processing time increases greatly in proportion to the number of target point sequences.
[0053]
In the present embodiment, high-speed polyhedron generation is realized by performing the following processing and removing points inside the convex polyhedron from the search target.
1. The octahedron is formed by using the maximum and minimum end points (six points) on each axis constituting the three dimensions.
2. The number of point sequences to be processed is reduced by excluding the octahedral inclusion sequence.
3. The gift wrapping method is applied to the data group excluding the included point sequence. Furthermore, after configuring the octahedron, for the point sequence on the triangle composing the octahedron, a point sequence farthest from the plane of the triangle is selected, and a tetrahedron with this as the vertex is newly configured. Then, the inclusion point sequence of the tetrahedron is excluded to reduce the number of data. This process is more effective if it is configured to be repeated a plurality of times as appropriate.
[0054]
Hereinafter, the polyhedron generation method will be described in detail with reference to the drawings.
[0055]
FIG. 10 shows the distribution state of the data point sequence observed from a position perpendicular to the XY plane. A quadrilateral is constituted by the maximum and minimum points on each XY axis, and the internal points of the quadrilateral are defined. It shows how it is deleted. As is apparent from the figure, the internal point sequence surrounded by the quadrilaterals based on the maximum and minimum values on each axis cannot be the point sequence that constitutes the surface, so it is not necessary for subsequent processing. It can be seen that it is. The gist of the present invention is to significantly reduce the number of data to be processed by deleting points unnecessary for processing, and to realize high-speed processing as a whole. If it is data on a plane, an unnecessary point can be determined by a combination of a quadrilateral or a triangle. When the target space is three-dimensional like a color space, unnecessary points can be similarly determined using a polyhedron.
[0056]
FIG. 11 shows a case where the data to be handled is extended to a three-dimensional space. As shown in the figure, the octahedron is configured by adding the maximum and minimum values of the Z axis. If the octahedron is assigned a vertex number (1-8) for convenience corresponding to the maximum value and the minimum value of each axis as shown in the figure, 1-2-3, 1-3-4, 1- 4-5, 1-5-2, 6-3-2, 6-4-3, 6-5-4, and 6-2-5 are surrounded by a total of eight triangles.
[0057]
In this embodiment, speeding up of processing is realized by deleting a point sequence existing inside the octahedron. FIG. 12 is a schematic flowchart showing the processing of this embodiment. As a pre-stage process of the polyhedron generation process of FIG. 1, a procedure step S19 constituting an octahedron and a procedure of deleting internal points of the polyhedron (step S20) are performed. The number of point sequences that can be deleted by this processing varies depending on the distribution state of the input data. For example, if the data is distributed almost uniformly in a spherical shape with a radius of 1, the total number of points is about 31.8. (= 1 / π)% is to be deleted.
[0058]
This is the ratio of the volume (4/3) of the octahedron inscribed in the sphere to the volume (4π / 3) of the sphere of radius 1. In actual examination results, the processing time for 435 points randomly generated inside the sphere as test data was 51.8 seconds, whereas the target processing data was reduced to 324 points by the deletion process, and as a result Processing time was reduced to 34.4 seconds. The difference of 17.4 seconds was a decrease of approximately 33%, and it was found that a result almost proportional to the decrease rate of the number of data was obtained.
[0059]
(Modification of Embodiment 2)
Next, a modification of the second embodiment will be described with reference to FIGS.
[0060]
As shown in FIG. 13, after deleting the dot sequence inside the octahedron as in the second embodiment, the dot sequence exists only outside the octahedron. Furthermore, in this modification, the number of points to be deleted is increased by deleting the point sequence inside the tetrahedron formed by the triangles of the faces constituting the octahedron and the point farthest from the plane. Realize.
[0061]
First, as shown in FIG. 13, three points Xmin, Ymax, and Zmin are set as point ABC, and a point sequence on the plane including the three points is selected. Next, as shown in FIG. 14, a tetrahedron is formed with a point D farthest from the plane as an apex, and the internal points of the roughly tetrahedron are deleted (steps S25 and S26). Such processing is performed on all the faces of the octahedron. Further, the same processing is repeated as necessary on the triangular plane on the formed tetrahedron. If the processing is terminated when there are no point sequences in all tetrahedrons, the generated triangle set represents the surface covering the outline of the given point sequence data.
[0062]
The outline of the processing flow will be briefly described with reference to FIG.
[0063]
First, initialization processing is performed in step S21. In steps S22 to S24, an octahedron is obtained as in the second embodiment, and points inside the octahedron are deleted.
[0064]
Next, a point that is farthest from a certain face constituting the octahedron is searched to obtain a tetrahedron (step S26), points inside the tetrahedron are deleted (step S27), and the points searched in step S26 Are additionally registered as new vertices (step S28). The processes in steps S26 to S28 are performed on all the faces constituting the octahedron (steps S25, S29, and S30).
[0065]
Then, based on the new vertex added in step S28 and the eight vertices constituting the octahedron, the polyhedron is reconfigured to determine whether or not the polyhedron is to be made more complicated. If the polyhedron needs to be complicated, N is updated according to the reconstructed polyhedron (step S31). If a point is always searched in step S26, N is set to 16.
[0066]
When N is updated in step S31, the processes of steps S25 to S31 are repeated for each surface (step S32).
[0067]
In addition, although the octahedron and the tetrahedron are used in the second embodiment and the modification thereof, the same processing can be realized by using, for example, a hexahedron. Furthermore, the same applies to the use of an appropriate polyhedron such as a dodecahedron.
[0068]
That is, in order to improve the speed of the polyhedron generation process, it is only necessary to delete unnecessary data point sequences as efficiently as possible.
[0069]
According to the second embodiment, when generating a polyhedron model that wraps color data or the like scattered in a space, the processing time greatly increases in proportion to the number of given point sequences. The prevention and efficient polyhedron generation processing can be performed.
[0070]
(Embodiment 3)
As a method for generating a convex polyhedron, the gift wrapping method is widely known as the most basic implementation method. There are many other methods for generating a convex polyhedron.
[0071]
The problem here is that each processing speed cannot be predicted in a general manner. For example, depending on the distribution state of a certain data, even if an optimal algorithm exists, the speed of a data group having another distribution state may be reduced. Therefore, ideally, there is no meaning to adaptively select the most optimal algorithm according to the data distribution state.
[0072]
Therefore, the third embodiment provides a method for selecting an algorithm suitable for the data distribution state.
[0073]
A plurality of analysis algorithms are prepared in advance, and a tag that associates a generation algorithm that is most suitable for processing is assigned to a typical data group, and processing is appropriately switched using the tags at the stage of analysis execution. .
[0074]
In a system that can process multiple algorithms in parallel, for an irregular data group, statistically analyze the data distribution status, etc., and list multiple generation algorithms that are optimal for processing as candidates. After starting up at the same time, by examining the intermediate processing results, the optimum algorithm corresponding to the input data group is uniquely determined, and the unnecessary process is erased halfway, and the computer resources secured by the process are released. Constitute.
[0075]
A process of assigning a tag corresponding to the input data to a characteristic data string obtained by a steady experiment or measurement and selecting an algorithm type to be applied by the tag will be described with reference to FIG.
[0076]
A plurality of data is input to the data selector. Each data is a data group measured in different situations, for example, data 1 is a data group obtained by measuring a color output by a color inkjet printer, and data 2 is a data obtained by measuring a color outputted by a color LBP. Suppose that it was output in groups. Here, assuming that it is experimentally known that the processing of algorithm A for data 1 and the processing of algorithm B for data 2 are optimal, these data groups are used for polyhedron generation processing. Add tag data to specify the algorithm.
[0077]
When data 1 or 2 to which tag data is added is input, a tag analysis processing unit 30 (not shown) included in the three-dimensional rendering system of FIG. 6 analyzes the tag data added to the data, and is suitable for the data. An algorithm is selected, and control is performed so as to use the selected algorithm in the polyhedron generation process executed in the data generation means of FIG.
[0078]
When data 1 is input, the tag analysis processing unit 30 analyzes the tag A and selects the algorithm A.
[0079]
When data 2 is input, the tag analysis processing unit 30 analyzes the tag B and selects the algorithm B.
[0080]
With the above-described processing, it is possible to perform polyhedron generation processing by using selection of an optimal algorithm based on tag data for routinely performed measurement and analysis. Therefore, the polyhedron generation process can always be performed in a short time.
[0081]
Next, a process for selecting an appropriate algorithm for input data whose data distribution state is indefinite will be described with reference to FIG.
[0082]
First, data analysis is performed on a given data string, candidates for the application algorithm are enumerated according to the analysis result, processes are forked by the number of the enumerated candidates, and the algorithm is assigned to each parallel computer. Start processing at the same time. Some time after the process is started, the result of the process is investigated, the optimal algorithm is selected and determined based on the result of the investigation, and the available computing resources are allocated only to the selected algorithm during the process. Realizes a reduction in processing time.
[0083]
Data 3 which is a data group obtained by measuring the color output by the color printer (model-independent) is input. First, the data analysis processing unit 31 analyzes the data 3 and determines some candidates from the plurality of algorithms A, B, and C included in the data generation unit 11.
[0084]
For example, when the algorithms B and C are selected as candidates for the data 3, the data generation unit 11 controls to start (fork) processes based on the two algorithms B and C simultaneously (candidates). Decision & Fork 32).
[0085]
The processes (B, C) started simultaneously notify the process monitoring processing unit 33 of an intermediate report signal indicating the number of data processed (or processing progress) at a predetermined timing. The process monitoring processor 33 selects an optimal algorithm for the data 3 based on the intermediate report signal, and stops the process not selected by the control signal.
[0086]
Then, the polyhedron generation process for the data 3 is completed by continuing the selected process.
[0087]
On a computer operating in multitasking, it is possible to increase the processing speed of a single process by effectively releasing resources, and as a result, it is possible to finish the processing at the fastest speed.
[0088]
Note that the data analysis processing unit 31 (not shown) is included in the three-dimensional rendering system 10 of FIG. The other processing unit is a function of data generation means.
[0089]
FIG. 18 shows an example of the configuration of the present embodiment having the processing functions of FIGS. 16 and 17. 18, the same functions as those in FIGS. 16 and 17 are denoted by the same reference numerals and description thereof is omitted.
[0090]
The data selector 35 analyzes the input data and determines whether or not a tag that specifies an algorithm for polyhedron generation processing is added to the data. If the tag is added, the process shown in FIG. 16 is performed. If the tag is not added, the process shown in FIG. 17 is controlled.
[0091]
According to the present embodiment, when generating a polyhedron model that wraps color data or the like scattered in space, no matter what the distribution of the given point sequence data is, The optimum algorithm corresponding to the distribution state is automatically selected and executed appropriately, and it is possible to always obtain a high-speed processing result.
[0092]
(Embodiment 4)
A technique for reproducing a color image on a monitor as faithfully as possible with a color printer is called color matching, and is one of techniques widely used in recent years. Usually, the color reproduction range of a monitor is wide, and that of a printer is narrow. In other words, not all colors on the monitor can be reproduced by the printer. In order to solve this problem, a technique called color space compression is used. There are a plurality of color space compressions in various methods and compression ratios. This is appropriately selected or assigned depending on the use case. The problem is that it is difficult for the user to understand how the applied method works.
[0093]
In the present embodiment, a method is described in which the effect of color space compression is visually understandable using the 3D rendering function described in the first to third embodiments.
[0094]
First, an outline of the present embodiment will be described.
[0095]
First, a modeling means for uniquely calculating a triangular polygon data group representing a color reproduction area in space is prepared, and the color reproduction area of the selected monitor and the selection monitor are subjected to color space compression using the modeling means. Model data representing the color reproduction area after compression is generated, each polygon data is given an appropriate transmission attribute, and this is displayed in 3D. A user can select a color space compression method having desired characteristics by referring to two color reproduction regions displayed in 3D while additionally displaying a specific color to be worried about during printing. To do.
[0096]
As a result, the mapping of color space compression, which has been difficult to understand conventionally, can be visualized at high speed by using triangular polygon data, so that it is possible to provide the user with a quicker and optimal color document printing environment.
[0097]
Hereinafter, this embodiment will be described in detail with reference to the drawings.
[0098]
FIG. 19 is a schematic block diagram of internal processing of a color printer driver in which the present embodiment is implemented. Here, among the internal processes of the driver, the setting process and the operation of the color conversion process changed by each setting will be described in detail. Here, for the sake of convenience, the following system and process will be described. The driver is incorporated in the OS of the host computer. There are two types of monitors connected to the host, A and B types, both of which can display full color. The output printer is a local printer directly connected to the printer interface of the host computer and can output a full color image. A user creates a color document using the host computer and outputs it using a color printer. The created color document is subjected to operations such as editing while being displayed on the monitor. Color matching processing is performed inside the driver so that the color of the output color document matches that displayed on the monitor.
[0099]
As color matching options, two types of a hue priority type and a saturation priority type are prepared and can be appropriately changed according to each document. These both use the color space compression method, but are different types of compression methods. Hereinafter, for convenience, the color matching option and the color space compression method are treated synonymously. Also, the CIE-1976 Lab value is omitted and is simply set as the Lab value. Furthermore, at the time when the driver is incorporated in the OS, the monitor is treated as A type, and the color matching option is treated as 1: hue priority type as default.
[0100]
The image data 101 is displayed on the monitor 120 after being converted into a preview image by the preview image generation processing 111. The user selects a specific color in the image while referring to the preview image and inputs it to the color designation input means 113. For example, if the image data includes a bar graph, select a color of particular interest (eg, dark blue) in the bar graph, and select the value (RGB value) of the selected color using a keyboard device or mouse operation. input. The monitor type and the color matching option are specified by the monitor specifying means 114 and the color matching option specifying means 115, respectively, and the settings can be changed on the driver setting screen. The profile selector 112 selects profile data (any one of four of A1, A2, B1, and B2) designated by the combination of the monitor type and the color matching option from the profile storage file 131, and selects this. Delivered to the color conversion process 102. When printing is started, the color conversion process 102 receives the image data 101, performs an appropriate color conversion process using the profile specified by the settings, and outputs output data 103 for printing.
[0101]
FIG. 20 is a schematic block diagram showing the inside of the rendering processing unit 116 in FIG. The model data selection means 221 selects model data (any one of four of A1, A2, B1, and B2) designated by the combination of the monitor type and the matching option from the model storage file 211, and selects this. Delivered to the synthesis process 231. Here, in order to visualize the color reproduction range, this is expressed using a polyhedron that forms a surface with a group of triangular polygons.
[0102]
Model data is prepared in advance by modeling means, and stores two data, a color reproduction range of the monitor and a color reproduction range after color space compression. Each of them describes a plurality of vertices and a triangular polygon group combining them. An example is shown below.
Filename “Model-A1”
ModelBegin // Motor
A (no compress)
Vertex Px1, Py1, Pz1
Vertex Px2, Py2, Pz2
Vertex PxM1, PyM1, PzM1
Polyline 3ti1 tj1 tk1
Polyline 3ti2 tj2 tk2
...
Polyline 3tiN1 tjN1
tkN1
ModelEnd
ModelBegin // Motor
A (compressed)
Vertex px1, py1, pz1
Vertex px2, py2, pz2
...
Vertex pxM2, pyM2, PzM2
Polygon 3ti1 tj1 tk1
Polygon 3ti2 tj2 tk2
...
Polygon 3tiN2 tjN2 tkN2
ModelEnd
[0103]
Further, based on the designated color (RGB value) input to the color designation input means 113, the coordinate position calculation means 223 obtains the color coordinate value A (Ax, Ay, Az) on the currently selected monitor, and After obtaining the color coordinate value A ′ (Ax ′, Ay ′, Az ′) after color conversion processing with the currently selected color matching option, the format is adapted to the rendering processing by the following processing. Convert.
Filename “Model-Point”
ModelBegin // 2points
PointSet sphere radius (o.5)
Vertex Ax Ay Az
Vertex Ax'Ay'Az '
Point 1 Color A
Point 2 Color A '
ModelEnd
[0104]
In the present embodiment, a (three-dimensional Euclidean) space composed of xyz axes is assumed as a rendering space. Here, since the Lab space is applied to the space, each coordinate value is equivalent to the Lab value. For convenience, the L axis is treated as the x axis, the a axis as the y axis, and the b axis as the z axis. In the synthesis process 231, the selected model data (Model-A1) and the output file (Model-Point) in the coordinate position calculation means 223 are synthesized and delivered to the three-dimensional renderer process 232 as one file. In the renderer process, a two-dimensional image is generated from a specified three-dimensional object and displayed on a display device.
[0105]
FIG. 21 is a flowchart showing an outline of processing of the modeling means for creating model data.
[0106]
First, in step 301, measured sample data of 125 points are input. Here, 125 points are assumed as samples for equally dividing the RGB space of the monitor. If 0 to 255 are divided into 5 steps for each axis of RGB, sample data of 5 × 5 × 5 points is obtained. If this is totaled, it will be 125 points. Lab values are obtained for each of the 125 RGB data combinations and input is made in step 301. At this time, input is performed in a combination of ID number, RGB value, and Lab value in order from the top. In step 302, the ID numbers of the eight basic colors (RGBCMYWK, corresponding to the eight vertices constituting the dodecahedron in FIG. 11) at this time are input. In step 310, the ID numbers and the input 125-point data are used. A dodecahedron is generated. In step 312, the generated polyhedron and 125 points are displayed simultaneously. In step 313, if the displayed polyhedron does not sufficiently approximate the color reproduction region, a new vertex is added in step 314, the polyhedron is reconstructed in step 315, and the process returns to step 312 to display again. By repeating this, it is possible to generate a polyhedron model until sufficient approximation can be performed. FIG. 22 is a conceptual diagram showing an example of adding one vertex to two adjacent triangular polygons to increase the number of faces. In this way, the sample points are hidden behind or inside the surface of the polyhedron displayed in 3D, or if the triangular surface is too far from each sample, the concave surface is appropriately configured to obtain a better approximation. Construct a triangular polygon. Here, when approximation with higher accuracy is performed, all the points may be selected carefully using more samples.
[0107]
Note that the data generation unit 11 and the data change unit 12 described in the first to third embodiments may be used as the modeling unit. When the method described in the first to third embodiments is used, a polyhedron can be generated automatically and at high speed by performing geometric calculation on a point sequence scattered in a space.
[0108]
FIG. 23 is a sample example showing an actual 3D display. Here, the polyhedron 510 indicates a color reproduction region on the monitor, and the triangular polygon is drawn with only sides. On the other hand, a polyhedron 520 shows a color reproduction region after color space compression, and a triangular polygon is drawn with sides and faces. In the 3D display of this embodiment, since the hidden surface process is performed, only the polygon in front is always drawn, and therefore the inside of the polyhedron 520 becomes invisible. A point 531 indicates a position of the designated color before color space compression, and a point 532 indicates a position after color space compression.
[0109]
The user can finally select the optimum matching option for each printing while checking the mapping state of the plurality of designated colors while switching the optimum matching option according to the document to be output.
[0110]
Although only one designated color is displayed in FIG. 23, a plurality of colors can be simultaneously displayed based on a user instruction. However, when a plurality of colors are displayed at the same time, there is a possibility that a color that is not displayed by the hidden surface process may be generated depending on the positional relationship between the viewpoints.
[0111]
(Modification 1 of Embodiment 4)
Next, Modification 1 of Embodiment 4 will be described with reference to FIG. FIG. 24 is a schematic block diagram illustrating processing corresponding to the rendering processing unit 116 of FIG. Rather than preparing model data representing the color reproduction area in advance, the model data generation function in the processing system will generate model data according to the selected monitor and matching options at any time. is there. Here, modeling means for calculating a color reproduction region in space by a convex body generation algorithm is prepared. Since many methods have already been proposed for the convex body generation algorithm, it will not be described here.
[0112]
Model data generation is first performed for the color reproduction region of the selected monitor. The monitor data 1601 stores the color characteristic information of the currently selected monitor, and using this, the modeling unit 1611 generates 125 samples and obtains the Lab value of each point. Surface polygons (triangles) covering the point sequence group in the space are automatically generated by a convex polyhedron generation algorithm. In the process 1612, a transparency attribute is assigned to the generated model data. An example is shown below. Here, the Polygon surface surrounded by the TransparentBegin () statement and the TransparentEnd statement has a transparency attribute, and is specified by the parameter of the transparency TransparentBegin () statement. Here, if the transmittance of 100% is set, the polygon representing the outline itself cannot be seen. Therefore, in this embodiment, the transmittance of 80% (specified value is 1/100 becomes 0.8) is set. .
[0113]
Filename “Model-A1”
ModelBegin // Motor
A (no compress)
Vertex Px1, Py1, Pz1
Vertex Px2, Py2, Pz2
...
TransientBegin (0.8)
Vertex PxM1, PyM1, PzM1
Polygon 3 ti1 tj1 tk1
Polygon 3 ti2 tj2 tk2
...
Polygon 3 tiN1 tjN1
tkN1
TransparentEnd
ModelEnd
ModelBegin // Motor
A (compressed)
Vertex px1, py1, pz1
Vertex px2, py2, pz2
...
Vertex pxM2, pyM2, PzM2
Polygon 3 ti1 tj1 tk1
Polygon 3 ti2 tj2 tk2
...
Polygon 3 tiN2 tjN2
tkN2
ModelEnd
[0114]
Next, model data generation is performed on the color reproduction region after color space compression. The monitor data 1611 and the color matching option handle 1630 indicating the currently selected color space compression method are passed to the color space compression calculation means 1613, 125 color samples after color space compression are generated, and the Lab value of each point is set. Ask. The modeling means 1614 automatically generates a surface polygon covering the point sequence group in the space by a convex polyhedron generation algorithm. Here, the transparency attribute is not added.
[0115]
In the coordinate position calculation means 1615, the monitor data 1611, the color matching option handle 1630, the RGB values of the special color designated by the color designation means 1616, and the coordinate position of the designated color on the currently selected monitor are obtained. It is done. Here, two coordinate positions are obtained before and after color space compression, and are transferred to the composition process 1620.
[0116]
In the composition process 1620, the polygon data of the monitor color reproduction area before color space compression, the polygon data of the monitor color reproduction area after color space compression, and the two points of the coordinate position of the specified color (before and after color space compression) The data is synthesized, and the data is delivered to the three-dimensional renderer process 1621. In this renderer process, a two-dimensional image is generated from a specified three-dimensional object and displayed on a display device. The user can change to an optimum matching option according to the document to be output while viewing the display state.
[0117]
(Modification 2 of Embodiment 4)
A second modification of the fourth embodiment will be described with reference to FIG. FIG. 25 is a schematic block diagram illustrating processing corresponding to the rendering processing unit 116 of FIG. In this modification, model data representing the color reproduction area is not prepared in advance, but model data corresponding to the selected monitor or matching option can be obtained at any time by having a model data generation function in the processing system. Generate. However, one significant difference is that the polygon representing the color reproduction region after color space compression has the second transmission attribute.
[0118]
Model data generation is first performed for the color reproduction region of the selected monitor. The monitor data 701 stores the color characteristic information of the currently selected monitor, and using this, the modeling unit 711 generates 125 samples and obtains the Lab value of each point. Surface polygons (triangles) covering the point sequence group in the space are automatically generated by a convex polyhedron generation algorithm. In the process 712, the first transparency attribute is attached to the generated model data. Here, if a transmittance of 100% is set, the polygon representing the outline itself cannot be seen. Therefore, in this embodiment, the first transparency attribute is 80% (the designated value is 0.8 when 1/100). Set the transmittance.
[0119]
Next, model data generation is performed on the color reproduction region after color space compression. The monitor data 711 and the matching option handle 730 indicating the currently selected color space compression method are input to the color space compression calculation means 713, 125 samples after color space compression are generated, and the Lab value of each point is set. Ask. The modeling means 714 automatically generates a surface polygon covering the point sequence group in the space by a convex polyhedron generation algorithm. In the process 717, the first transparency attribute is attached to the generated model data. Here, a transmittance of 20% (specified value is 0.2 in 1/100) is set as the second transmission attribute. The following data is configured together with the polygon group constituting the outline described above.
Filename “Model-A1”
ModelBegin // Motor
A (no compress)
Vertex Px1, Py1, Pz1
Vertex Px2, Py2, Pz2
...
TransientBegin (0.8)
Vertex PxM1, PyM1, PzM1
Polygon 3 ti1 tj1 tk1
Polygon 3 ti2 tj2 tk2
...
Polygon 3 tiN1 tjN1
tkN1
TransparentEnd
ModelEnd
ModelBegin // Motor
A (compressed)
Vertex px1, py1, pz1
Vertex px2, py2, pz2
...
Vertex pxM2, pyM2, PzM2
TransparentBegin (0.2)
Polygon 3 ti1 tj1 tk1
Polygon 3 ti2 tj2 tk2
...
Polygon 3 tiN2 tjN2
tkN2
TransparentEnd
ModelEnd
[0120]
In the coordinate position calculation means 715, the monitor data 711, the matching option handle 730, the RGB value of the specific color designated by the color designation means 716, and the coordinate position of the designated color on the currently selected monitor are obtained. . Here, two coordinate positions are obtained before and after color space compression. In the present embodiment, a point A (coordinate before color space compression) is connected to a point A ′ (coordinate after compression) by an arrow line so that the position can be more easily grasped visually.
Filename “Model-Point”
ModelBegin // 2points
PointSet sphere radius (0.5)
Vertex Ax Ay Az
Vertex Ax'Ay'Az '
Point 1 Color A
Point 2 Color A '
Line 1 2 Arrow
ModelEnd
[0121]
In the composition process 720, the polygon data of the monitor color reproduction area before color space compression, the polygon data of the monitor color reproduction area after color space compression, and the two points of the coordinate position of the specified color (before and after color space compression) The data is synthesized and the data is delivered to the three-dimensional renderer process 721. In this renderer process, a two-dimensional image is generated from a specified three-dimensional object and displayed on a display device.
[0122]
FIG. 26 is an example showing a state of 3D display of this modification. Here, a polyhedron 810 indicates a color reproduction region on the monitor, and a triangular polygon group representing this is drawn with a side and a surface having a transmittance of 80%. On the other hand, a polyhedron 820 shows a color reproduction region after color space compression, and a triangular polygon group representing this is drawn with a side and a surface with a transmittance of 20%. In the 3D display of the present embodiment, the hidden surface processing is performed for polygons having a transparency of 0% even if the transparency attribute is not set and the transparency attribute is set. In consideration of the above, the polygon overlap is also displayed. Therefore, even if the point 832 enters the color reproduction area 820 as shown in the figure, the transmission attribute is set, so that the point 832 looks over the front polygon. A point 831 is a position before the color space compression of the designated color, and a point 832 is a position after the color space compression, and is devised so that visual recognition can be correctly performed by connecting these with an arrow line. . The user can freely select an optimal matching option corresponding to the document to be output while viewing the display state.
[0123]
In addition to the embodiments described above, the following embodiments are possible.
[0124]
1. The monitor data 601 may be information obtained from a profile assigned to each color device in the color management system.
[0125]
2. Although the modeling unit 611 and the modeling unit 614 are block diagrams as separate units for convenience of explanation, they may be the same block in mounting.
[0126]
3. The color space compression is a compression of the color reproduction area of the monitor, but is not limited to this. All color devices are targeted on the source and destination sides. Further, in the first to third embodiments, the volume reduction is treated as color space compression, but this is not restrictive. Conversely, processing can be performed in the same manner regardless of color space movement or color space movement.
[0127]
4). Triangular polygons are used as the basic surface configuration when the color reproduction area is represented by the surface of the polyhedron, but a combination of quadrilateral polygons and triangular polygons, or a combination of pentagonal polygons and triangular polygons may be used. Further, a free-form surface approximated by a small triangular polygon may be used.
[0128]
5. Using a triangular polygon as the basic surface configuration when expressing the color reproduction area on the surface of the polyhedron, the color at the coordinate position is calculated for the coordinates of the three vertices, the corresponding color is assigned to each vertex, and the vertex and vertex A color obtained by interpolation based on the corresponding color at each vertex is assigned to the sides and surfaces connecting the two.
[0129]
6). The printer connection may be local or other. In addition, the processing can be similarly realized by processing other than the printer driver incorporated in the system. For example, utility software, application software, a plug-in format connected to application software, or a helper application may be used. Of course, this may be realized by a profile maker that creates a color profile in a color management system.
[0130]
7). The model data may be prepared in advance, created when necessary, or data created at a certain time may be cached. Furthermore, the data may be stored inside the profile data or stored in a temporary work area (memory or file).
[0131]
8). For 3D display, it is possible to move, rotate, scale, etc. in real time using an input device such as a mouse, and provide a configuration that allows 3D data to be observed from any position. May be.
[0132]
9. Instead of designating the transmission attribute, it may be configured such that points inside the surface covered with the polygon can be observed by devising such as switching the hidden surface processing based on a certain input.
[0133]
Various embodiments other than those described above are conceivable. However, if a polyhedron using a triangular polygon is used on the surface when the color reproduction region is substantially expressed, other techniques associated therewith can be used. The present invention is not limited by the method.
[0134]
According to the fourth embodiment and the modification thereof, it is possible to efficiently visualize the mapping state by color space compression processing, which has been difficult to understand conventionally, using a three-dimensional display system. It is possible to compare changes in the color reproduction area before and after color space compression with overlapping display, and to reduce the amount of data and increase the processing speed by using triangular polygons. As a result, it has become possible to interactively observe three-dimensional data from more free positions, such as real-time rotation and reduction of data, which has been difficult in the past. In addition, it is possible to directly analyze a problem in an actual color printing process by designating a specific color and observing how the corresponding color is actually mapped. As a result, it is possible to quickly set or select a type having desired characteristics from various color space compression methods.
[0135]
(Embodiment 5)
When the user frequently repeats operations such as rotation and enlargement / reduction when observing an object in space using the 3D rendering function, the original top-to-bottom relationship of the effect cannot be understood. There is. Conventionally, there have been contrivances such as drawing the coordinate axes at the same time or displaying the direction in another display window, but lack in intuitiveness. In particular, when a 3D rendering system is used interactively, high-speed display is required so that the system responds immediately to the user's operation, and at the same time, the data displayed by the user is accurately and intuitively displayed. It must be configured so that its state can be recognized.
[0136]
Therefore, in the present embodiment, a square parallel to the ab plane of the Lab color space is prepared, the center point of the square is overlapped with the origin, and simultaneously displayed, so that the user can intuitively see the state of the displayed data. To be able to recognize. When this display is not necessary, it can be deleted at any time by a user operation.
[0137]
FIG. 27 is a schematic flowchart illustrating a process for determining the size of a square parallel to the ab plane with reference to the maximum value, minimum value, and maximum value, minimum value of b value of input data. In the initialization process S811, a process such as setting the variable Max to zero is performed. In the data input process S812, a set of L value, a value, and b value indicating the color reproduction area is read. In the magnitude determination S813, the absolute value of the a value read in the data input process S12 is compared with the variable Max. If the absolute value of the a value is larger, the absolute value of the a value is substituted into the variable Max in the substitution process S814. To do. In magnitude determination S815, the absolute value of the b value read in the data input process S12 is compared with the variable Max. If the absolute value of the b value is larger, the absolute value of the b value is assigned to the variable Max in the assignment process S816. To do. In end determination S817, it is determined whether reading has ended. If not, the process returns to data input processing S812. In the side length setting process S818, a value obtained by multiplying the variable Max by 0.5 is set. In the coordinate setting process S819, square coordinate data is generated based on the set value. The square is parallel to the ab plane, and its center of gravity is set to coincide with the origin.
[0138]
FIG. 28 shows a displayed image obtained by synthesizing the polyhedron P1 generated by the data group indicating the color reproduction area and the square P2 generated by the processing of FIG. 27 based on the data group using the 3D rendering system. .
[0139]
In FIG. 28, the surface of the polyhedron can be observed, but the inside cannot be observed. Therefore, as shown in P3 of FIG. 29, the triangles constituting the polyhedron are not represented by planes, but are reproduced by only the sides so that the inside can be observed.
[0140]
The display like P3 can be easily realized by controlling the transmittance described in the fourth embodiment.
[0141]
That is, the present embodiment can be realized by controlling the transmittance relating to the color reproduction region in accordance with which mode of FIG. 28 (P1) or FIG. 29 (P3) is set by the user.
[0142]
The user can analyze the data in detail by switching and observing the two images as appropriate.
[0143]
In addition, it is important to observe the state of the color reproduction area at a certain luminance value in detail when grasping the color reproduction area.
[0144]
Therefore, a user interface as shown in FIG. 30 is provided.
[0145]
A polyhedron generation process is performed on the input Lab value point sequence data group to obtain a polyhedron P4, which is displayed on the display window R1 using a 3D rendering system. At the left end of the display window R1, there is a slide bar R3 that freely moves within the slide region R2. As this is moved to an arbitrary position, a square P5 parallel to the ab plane moves. When the square overlaps with the polyhedron P4, the overlapping portion is appropriately displayed on another display window as necessary. The display window R43 displays the overlapping portion at the position of R5 displayed in FIG. 6 as a cross section P6. The display window R41 and the display window R42 are display windows showing an overlap at the previous position P5, and can be generated, held, and discarded as necessary.
[0146]
In P6, not only the vertices of the polyhedron but also data other than the vertices included in the data group from which the vertex data is extracted (for example, 125 sample data input in step 301 in FIG. 21) are displayed. . Thereby, the degree of accuracy of the polyhedron and the color reproducibility of the device that outputs the sample data can be confirmed.
[0147]
In addition to the method of displaying the color reproduction area using the 3D rendering system described with reference to FIGS. 28, 29, and 30, the following forms are conceivable.
[0148]
1. When handling a plurality of enlarged / reduced images, it is configured so that it can be replaced with a square having a specified length so that a difference due to the scale can be easily recognized.
[0149]
2. Different color schemes are applied to the front and back of the square so that the top and bottom relationships that change with the operation by rotation can be recognized more easily.
[0150]
3. In order to show the state of the internal point sequence, a transparent attribute is given to the surface of the triangular polygon. This makes it possible to observe the state of the internal points while always recognizing the color reproduction region.
[0151]
4). By defining a gradation of a specific color and expressing the change of the gradation by a line segment, the color change and the positional relationship with the color reproduction region can be observed.
[0152]
5. When an object is not displayed at a desired position due to rotation or enlargement / reduction, the current display state is discarded by selecting a pre-registered icon and immediately switched to the registered display state (rotation, enlargement) (Reduce).
[0153]
In addition to the above-described embodiments, various embodiments are conceivable. In practice, however, a polyhedral model is displayed in a three-dimensional display system for the purpose of color analysis, and this is performed when operations such as rotation and enlargement / reduction are performed. Anything designed to make it easier for the user to handle is the same as the present invention.
[0154]
Conventionally, when observing an effect in a three-dimensional space, if the user repeatedly performs operations such as rotation and enlargement / reduction, the vertical relationship of the effect may not be known. According to the present embodiment, by arranging a square as a pedestal in the vicinity of the origin and simultaneously displaying it, the user can accurately and intuitively recognize the vertical relationship of the displayed data. Further, the observation data can be easily compared and compared by changing the square size according to the distribution of input data. Further, a polyhedron surrounding the point sequence is formed, and this is cut using a square parallel to the ab plane, and the cut surface is displayed in a separate display window. The square is configured to be freely movable on the L axis, and the cut surface is appropriately changed according to this. This facilitates the three-dimensional grasp of the polyhedron.
[0155]
The present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can also be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a storage medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention.
[0156]
【The invention's effect】
According to the first aspect of the present invention, the color gamut of the point sequence data group indicating the point sequence scattered in the color coordinate space can be obtained at high speed.
[0157]
According to the fifth aspect of the present invention, the color gamut of the point sequence data group indicating the point sequence scattered on the color coordinate space can be displayed at high speed.
[Brief description of the drawings]
FIG. 1 is a flowchart showing a data change process at the time of generating polygon data constituting a polyhedron according to the first embodiment of the present invention.
FIG. 2 is a flowchart showing generation processing of polygon data constituting a polyhedron.
FIG. 3 is an explanatory diagram showing an example in the case where the directions of normal vectors match in the relationship between the order of vertices registered in a triangular polygon and the normal vectors;
FIG. 4 is an explanatory diagram showing a point sequence scattered in a coordinate space.
FIG. 5 is an explanatory diagram showing a configuration of a polyhedron surrounding a sequence of points scattered in a coordinate space.
FIG. 6 is a block diagram illustrating a configuration example of a three-dimensional rendering system.
FIG. 7 is a flowchart of Modification 1 of the first embodiment.
FIG. 8 is a flowchart of Modification 2 of the first embodiment.
FIG. 9 is an explanatory diagram showing an example in which the directions of normal vectors are different from each other in the relationship between the order of vertices registered in a triangular polygon and the normal vector.
FIG. 10 is a schematic diagram showing a state in which a polygonal internal point sequence is excluded.
FIG. 11 is an overview diagram showing a polyhedron composed of six points selected from the maximum and minimum points on the XYZ axes in a three-dimensional space.
FIG. 12 is a schematic flowchart showing processing of Embodiment 2.
FIG. 13 is a conceptual diagram showing how a point sequence on a triangular plane is selected in a modification of the second embodiment.
FIG. 14 is a conceptual diagram showing a configuration of a tetrahedron and a state of selecting an internal point sequence in a modification of the second embodiment.
FIG. 15 is a schematic flowchart showing processing of a modified example of the second embodiment.
FIG. 16 is a diagram illustrating processing for selecting a polyhedron generation processing algorithm based on a tag added to data.
FIG. 17 is a diagram for explaining processing for analyzing data and selecting a suitable algorithm;
FIG. 18 is a diagram illustrating a configuration of a third embodiment.
FIG. 19 is a schematic block diagram illustrating overall processing in the fourth embodiment.
FIG. 20 is a schematic block diagram illustrating internal processing of rendering processing;
FIG. 21 is a schematic flow diagram illustrating a modeling process for generating model data.
FIG. 22 is a schematic diagram showing a state in which adjacent triangular polygons are divided by new vertices.
FIG. 23 is a sample diagram showing an example of three-dimensional display.
FIG. 24 is a schematic block diagram illustrating internal processing of rendering processing according to a modification of the fourth embodiment.
FIG. 25 is a schematic block diagram illustrating internal processing of rendering processing according to the second modification of the fourth embodiment.
FIG. 26 is a sample diagram showing an example of three-dimensional display.
FIG. 27 is a schematic flowchart outlining a process for changing the length of a square according to the distribution of an input data point sequence.
FIG. 28 shows an example in which a color reproduction region of color data scattered in Lab space is represented by a polyhedron, a square planar object is arranged at the origin position, and both are displayed by a 3D rendering system.
FIG. 29 is an example in which a color reproduction region of color data scattered in Lab space is expressed by a polyhedron, and a triangular polygon constituting the area is drawn by a surface and a case of drawing only by a line segment.
FIG. 30 is a display example in which a cut surface when a polyhedron existing in a space is cut at an arbitrary position is displayed in another display window.

Claims (7)

A color image processing apparatus for obtaining a polyhedron indicating a color gamut of a point sequence data group indicating a point sequence scattered on a color coordinate space,
Reading means for reading a point sequence data group indicating a point sequence scattered on the color coordinate space;
Extraction means for extracting point sequence data of N points from the point sequence data group according to a predetermined condition;
Generating means for generating an N-hedron based on the N-point data;
Exclusion means for excluding point sequence data indicating the included sequence of N-face from the point sequence data group;
An M-hedron (M> N) indicating the color gamut is generated from the N-hedron using a point-sequence data group excluding point-sequence data indicating the included point sequence of the N-hedron, and the M-hedron is configured. A color information processing apparatus comprising: generating means for storing vertex data in a storage unit. The color coordinate space is a three-dimensional space;
2. The color information processing apparatus according to claim 1, wherein the extraction unit extracts eight point sequence data having a maximum or minimum value of each component constituting the color coordinate space. The generating means includes
Registration for detecting point sequence data farthest from the plane of each surface constituting the N-plane and registering it as vertex data from the point sequence data group excluding the point sequence data of the included-point sequence of the N-plane Means,
2. A color information processing apparatus according to claim 1, further comprising means for excluding point sequence data indicating a sequence of points included in a tetrahedron composed of the detected point sequence data and each surface. Storage means for storing a data group of triangular polygons constituting the M-hedron generated by the generation means;
2. The color image processing apparatus according to claim 1, further comprising changing means for changing a registration order of vertex data of the triangular polygon data so that normal vectors of the triangular polygons coincide with each other. A color information processing method applicable to a color image processing apparatus,
Read the point sequence data group indicating the point sequence scattered in the color coordinate space,
N points of point sequence data are extracted from the point sequence data group according to predetermined conditions,
An N-face is generated based on the N-point data,
Excluding the point sequence data of the N-hedron containing point sequence from the point sequence data group;
An M-hedron (M> N) indicating the color gamut is generated from the N-hedron using a point-sequence data group excluding point-sequence data indicating the included point sequence of the N-hedron, and the M-hedron is configured. Store vertex data in the storage,
A color image processing method, comprising: displaying an M-hedron indicating the color gamut on a display unit using vertex data constituting the M-hedron. The color coordinate space is a three-dimensional space;
6. The color according to claim 5, wherein the point sequence data of the N points is eight point sequence data having the maximum or minimum value of each component constituting the color coordinate space in the point sequence data group. Information processing method.   A recording medium for recording a program for realizing the color image processing method according to claim 5 by a computer.

Images