JP5531087B1 - Image processing apparatus and method, and program - Google Patents

Abstract

A feature vertex sequence is obtained easily and appropriately.
A curvature cost calculation unit 32 calculates a curvature cost H (e) of each side e stored in a 3D shape data storage unit 31. The route length cost calculation unit 33 calculates the route length cost L (e) of each side e stored in the 3D shape data storage unit 31. The feature vertex sequence generation unit 34 operates the operation unit 37 to calculate the path length cost L (e) on the path configured by connecting the sides between the start point and the end point supplied from the start point / end point input unit 38. The cost C (= (1−w) × L + w × H) is calculated based on the total L, the total H of the curvature cost H (e), and the weight w supplied from the cost weight input unit 39, and the minimum The points that make up the path are obtained as feature vertex sequences. The present technology can be applied to a three-dimensional shape editing software program.
[Selection] Figure 1

Description

  The present technology relates to an image processing apparatus and method, and a program, and more particularly, to an image processing apparatus and method, and a program that can easily and appropriately select a feature vertex sequence including characteristic vertices.

  Shape vertex selection is one of the basic operations important in editing three-dimensional shape data. In particular, the selection of a vertex row along a characteristic line such as a ridge is an important operation for a shape deformation operation, and is a procedure necessary for creating a shape or creating an animation.

  As a method for extracting feature lines of the entire 3D shape, for example, using scan data (modeling data) of a 3D object, parameters of curved surfaces of a plurality of 3D object shapes are held in advance and similar to measurement results There has been proposed a method of using one (see Patent Document 1). Here, although it is proposed about the case where the measurement result of a three-dimensional object is used, the same effect can be produced by applying it to the three-dimensional shape data.

  In general software, for example, three types of methods are mainly used to select a vertex row: a method of selecting one point at a time, a method of selecting a vertex in a closed region, and a method of selecting by painting. ing.

Japanese Patent Laid-Open No. 08-030809

  However, when editing a 3D shape such as creating a shape or creating an animation as described above, a feature line of the entire shape can be extracted, but a locally characteristic vertex sequence according to the user's intention In order to select, one has to select one by one manually, and a huge amount of work and work time are spent on shape editing.

  The present technology has been made in view of such a situation, and in particular, along a feature line of a three-dimensional shape by selecting a characteristic vertex of a given three-dimensional shape based on a user input. This makes it possible to easily and appropriately realize the selection of vertex rows.

  An image processing apparatus according to one aspect of the present technology, a curvature cost calculation unit that calculates a curvature cost based on the curvature of each side, based on shape information including a vertex, a side, and a surface constituting a three-dimensional shape; A path length cost calculation unit that calculates a path length cost based on a path length in each side based on shape information including vertices, sides, and faces constituting the three-dimensional shape, the curvature cost, and the path Based on the long cost, the cost between the two points in the three-dimensional shape and the cost between the two points in the three-dimensional shape become the minimum. And a feature vertex sequence generation unit that generates a sequence of points existing on the path between the two predetermined points as a feature vertex sequence.

A weight setting unit that sets a weight to be added to each of the curvature cost and the path length cost can be further included. The point-to-point cost calculation unit includes the curvature cost and the path length. A weight set by the weight setting unit can be added to the cost to calculate a cost in a path between two predetermined points in the three-dimensional shape.

  A simplified ratio setting unit that sets a ratio for simplifying by thinning out the number of points constituting the feature vertex sequence, and the number of points of the feature vertex sequence obtained by the feature vertex sequence generation unit It is possible to further include a simplification unit that simplifies the feature vertex sequence by thinning out at a rate set by the conversion rate setting unit.

It said generated by the feature vertex string generator, in the three-dimensional shape, by selecting the points constituting the feature vertices column and directed to further include an editing unit for editing the feature vertex sequence Can do.

An image processing method according to one aspect of the present technology includes a curvature cost calculation unit that calculates a curvature cost based on a curvature of each side based on shape information including a vertex, a side, and a surface for forming a three-dimensional shape. A path length cost calculation unit that calculates a path length cost based on a path length in each side based on shape information including vertices, sides, and faces for constituting the three-dimensional shape, and the curvature cost And a point-to-point cost calculation unit for calculating a cost in a path between two predetermined points in the three-dimensional shape based on the path length cost, and a cost between the two predetermined points in the three-dimensional shape In the image processing method of the image processing apparatus, including the feature vertex sequence generation unit that generates, as a feature vertex sequence, a sequence composed of points existing on the path between the predetermined two points, the curvature cost Curvature cost calculating step for calculating a curvature cost based on the curvature of each side based on shape information including vertices, sides, and faces constituting the three-dimensional shape in the calculation unit , and the path length cost calculating unit in the vertex constituting the three-dimensional shape, the sides, and based on the shape information comprising the surface, the path length cost calculation step of calculating a route path lengths cost based on length of the each side, the two-point cost A point-to-point cost calculation step of calculating a cost in a path between two predetermined points in the three-dimensional shape based on the curvature cost and the path length cost in the calculation unit; , in the three-dimensional shape, the predetermined cost between two points is minimized, said predetermined feature vertices columns columns of points existing on a route between two points And a feature vertex string generation step of generating by.

  A program according to one aspect of the present technology includes a curvature cost calculation step of calculating a curvature cost based on the curvature of each side based on shape information including a vertex, a side, and a surface that form a three-dimensional shape; A path length cost calculating step of calculating a path length cost based on a path length in each of the sides based on shape information including vertices, sides, and faces constituting a three-dimensional shape, the curvature cost, and the path length cost Based on the two-point cost calculation step of calculating a cost in a path between two predetermined points in the three-dimensional shape, and the cost between the two predetermined points in the three-dimensional shape is minimized, A computer is caused to execute a process including a feature vertex sequence generation step of generating a sequence of points existing on a path between two predetermined points as a feature vertex sequence.

  In one aspect of the present technology, a curvature cost based on the curvature of each side is calculated on the basis of shape information including a vertex, a side, and a surface constituting the three-dimensional shape, and the vertex constituting the three-dimensional shape , A path length cost based on the path length in each side is calculated based on the shape information consisting of sides and faces, and based on the curvature cost and the path length cost, a predetermined value in the three-dimensional shape is calculated. The feature vertex sequence is a sequence of points existing on the path between the predetermined two points, in which the cost in the path between the two points is calculated, and the cost between the predetermined two points in the three-dimensional shape is the minimum. Is generated as

  The image processing apparatus according to one aspect of the present technology may be an independent apparatus or a block that performs image processing.

  According to one aspect of the present technology, a feature vertex row in a three-dimensional shape can be easily and appropriately selected.

It is a figure showing an example of composition of an embodiment of a feature vertex sequence selection device to which this art is applied. It is a flowchart explaining a feature vertex row selection process. It is a figure explaining the example of the display image displayed on a display part. It is a flowchart explaining a curvature cost calculation process. It is a flowchart explaining a route length cost calculation process. It is a flowchart explaining a feature vertex sequence generation process. It is a figure explaining the example of the display image for demonstrating operation of a weight knob. It is a flowchart explaining a feature vertex sequence simplification process. It is a figure explaining the example of the display image for demonstrating operation of the simplification ratio knob. It is a flowchart explaining a feature vertex sequence editing process. It is a figure explaining the example of the display image for demonstrating deformation | transformation operation of an external shape. And FIG. 11 is a diagram illustrating a configuration example of a general-purpose personal computer.

<Configuration example of feature vertex selection device>
FIG. 1 shows a configuration example of an embodiment of a feature vertex selection device to which the present technology is applied. The feature vertex selection device 11 shown in FIG. 1 can easily generate a feature vertex sequence including an array of vertices constituting a ridge between two points input by a user based on the curvature of an object in a three-dimensional shape. In addition, it enables the appropriate selection.

  More specifically, the feature vertex sequence selection device 11 includes a 3D (three-dimensional) shape data storage unit 31, a curvature cost calculation unit 32, a path length cost calculation unit 33, a feature vertex sequence generation unit 34, a display unit 35, and a feature. A vertex sequence simplification unit 36, an operation unit 37, a start point end point input unit 38, a cost weight input unit 39, and a simplification ratio input unit 40 are provided.

  The 3D shape data storage unit 31 stores data necessary for arranging points, sides, and surfaces that form a three-dimensional shape. That is, for example, if it is a point, it is coordinate position data for constructing an object in the three-dimensional space, and if it is a side, it represents a straight line defining a line segment for constructing the object in the three-dimensional space. If it is a surface, it is data of edge and point connection information that defines a surface for constructing an object in a three-dimensional space.

  The curvature cost calculation unit 32 is based on data required for arranging points, sides, and faces constituting the three-dimensional shape stored in the 3D shape data storage unit 31, LCD (Liquid Crystal Display), etc. The curvature cost at the edge connecting each point displayed in the three-dimensional space displayed (represented) displayed on the display unit 35 including the display of the above is calculated, and the calculation result is supplied to the feature vertex string generation unit 34. . The curvature cost may be, for example, a value of the curvature itself or a value calculated by a predetermined function or the like based on the curvature.

  The path length cost calculation unit 33 uses a display such as an LCD on the basis of data required for arranging points, sides, and surfaces constituting the three-dimensional shape stored in the 3D shape data storage unit 31. The path length cost at the side connecting the points displayed in the three-dimensional space displayed (represented) on the display unit 35 is calculated, and the calculation result is supplied to the feature vertex string generation unit 34. The route length cost may be, for example, a value of the route length itself or a value calculated by a predetermined function or the like based on the route length.

  The operation unit 37 receives input from the user such as a mouse, a keyboard, or an operation button, and sends an operation signal corresponding to the received operation content to the start point end point input unit 38, the cost weight input unit 39, or the simplified ratio. This is supplied to the input unit 40.

  Based on the operation signal from the operation unit 37, the start point / end point input unit 38 receives input of information on the coordinate position of the start point and the coordinate position of the end point for which a feature vertex sequence is to be obtained, and the received coordinate information of the start point and end point Is supplied to the feature vertex sequence generation unit 34.

  The cost weight input unit 39 receives input of weight information assigned to each of the curvature cost and the path length cost based on the operation signal from the operation unit 37, and sets the received weight information to the feature vertex sequence It supplies to the production | generation part 34. More specifically, the cost weight input unit 39 includes a slider bar display control unit 39a. When the operation unit 37 is operated and the pointer is dragged in the horizontal direction (left and right direction) by a predetermined distance, the slider is displayed. The bar display control unit 39a displays a slider bar for inputting a weight using a pointer on the display unit 35. Furthermore, when the slider bar displayed on the display unit 35 is operated by the pointer by the slider bar display control unit 39a, the cost weight input unit 39 receives input of weight information corresponding to the operation content.

  The simplification ratio input unit 40 receives input information of a simplification ratio that sets a simplification ratio based on an operation signal from the operation unit 37, and receives the received information on the simplification ratio as a feature vertex string generation unit 34. To supply. More specifically, the simplified ratio input unit 40 includes a slider bar display control unit 40a. When the operation unit 37 is operated and the pointer is dragged in a vertical direction (vertical direction) by a predetermined distance, The slider bar display control unit 40a displays on the display unit 35 a slider bar for inputting a simplified ratio using a pointer. Further, when the slider bar displayed on the display unit 35 is operated by the pointer by the slider bar display control unit 40a, the simplification rate input unit 40 receives input of information on the simplification rate according to the operation content.

  The feature vertex sequence generation unit 34 includes a cost calculation unit 34a, a curvature cost supplied from the start point supplied from the start point / end point input unit 38 and the curvature cost calculation unit 32 between the end points, and a path length cost calculation unit. The weight specified as the cost weight is added to the route length cost supplied by the number 33, the cost calculation method of the cost calculation unit 34a is updated, and the route that minimizes the sum of the calculated costs is calculated. Then, a feature vertex sequence composed of a sequence composed of points existing on the calculated path is calculated and supplied to the feature vertex sequence simplification unit 36.

  The feature vertex sequence simplification unit 36 thins out the feature vertices at equal intervals from the feature vertex sequence included in the feature vertex sequence information based on the information of the simplification ratio, and the feature vertex sequence information obtained as a result of the thinning Is supplied to the display unit 35 and displayed on the display unit 35.

  The feature vertex sequence editing unit 41 is selected when any of the vertices constituting the feature vertex sequence generated by the feature vertex sequence generation unit 34 is selected and moved according to the operation content of the operation unit 37. With the movement of the selected vertex, the editing of the feature vertex sequence to which the selected vertex belongs is accepted, and the editing result is stored in the 3D shape data storage unit 31. As a result, the 3D shape data stored in the 3D shape data storage unit 31 is edited.

<Feature vertex sequence selection processing>
Next, the feature vertex string selection process will be described with reference to the flowchart of FIG.

  In step S11, the feature vertex sequence generation unit 34 controls the display unit 35 to display a display image serving as an operation screen. The display image is, for example, as shown in FIG. In the display image G1 of FIG. 3, a display field for displaying a three-dimensional shape is provided. In the lower part of the figure, a length indicating that the path length is given priority is displayed on the left side, and a slider bar SL1 is displayed on the right side indicating Curvature indicating that the curvature is given priority. The slider bar SL1 is displayed on the slider bar SL1. The weight is set by operating the displayed weight knob T to the left and right in the figure. Further, in the display image G1 of FIG. 3, an object OB1 made up of an automobile exterior frame is displayed. In addition, a start point P (s1) and an end point P (e1) are displayed, and a feature vertex row L1 connecting them is displayed.

  In step S <b> 11, the curvature cost calculation unit 32 calculates the curvature cost based on the data required for arranging the points, sides, and surfaces that constitute the three-dimensional shape stored in the 3D shape data storage unit 31. The process is executed and the curvature cost of each side in the three-dimensional space to be handled is calculated. The curvature cost calculation process will be described in detail later with reference to the flowchart of FIG.

  In step S <b> 12, the path length cost calculation unit 33 determines the path length based on the data required to arrange the points, sides, and faces that make up the three-dimensional shape stored in the 3D shape data storage unit 31. The cost calculation process is executed, and the path length cost of each side in the three-dimensional shape to be handled is calculated. Details of the path length cost calculation processing will be described later with reference to the flowchart of FIG.

  In step S <b> 13, the feature vertex string generation unit 34 determines whether or not the operation point 37 has been operated and the start point and end point information has been input to the start point / end point input unit 38. In step S13, for example, as shown in FIG. 3, the operation unit 37 is operated, and the coordinates of the start point and the end point are, for example, the start point P (s1) and the end point P (e1 in FIG. ), The process proceeds to step S14.

  In step S14, the feature vertex sequence generation unit 34 executes a feature point sequence generation process based on the input curvature cost, path length cost, and start point / end point coordinate information to generate a feature point sequence, The generated feature vertex sequence is supplied to the feature vertex sequence simplification unit 36. The feature vertex sequence generation process will be described in detail later with reference to the flowchart of FIG.

  In step S15, the feature vertex sequence simplification unit 36 is based on the feature vertex sequence information supplied from the feature vertex sequence generation unit 34 and the simplification rate information supplied from the simplification rate input unit 40. The feature vertex sequence simplification process is executed to simplify the feature vertex sequence and supply it to the display unit 35 for display. The feature vertex sequence simplification process will be described later with reference to the flowchart of FIG.

  In step S16, it is determined whether the operation unit 37 has been operated to instruct the completion of the process. If the completion has not been instructed, the process returns to step S13. That is, the processes in steps S13 to S16 are repeated until the completion of the process is instructed. In step S16, when completion is instructed, the process ends.

  Through the above processing, when information on the weight and simplification ratio described later is input in addition to the information on the coordinates of the start point and the end point, the corresponding feature vertex row is selected and displayed on the display unit 35.

<Curvature cost calculation process>
Next, the curvature cost calculation process will be described with reference to the flowchart of FIG.

  In step S <b> 31, the curvature cost calculation unit 32 sets one of the unprocessed sides as the processing target side e among the information on the sides constituting the three-dimensional shape stored in the 3D shape data storage unit 31.

  In step S32, the curvature cost calculation unit 32 calculates a curvature cost H (e) for the processing target side e. Specifically, the curvature cost calculation unit 32 may set the curvature of the processing target side e itself as the curvature cost H (e), or inputs the curvature of the processing target side e into a predetermined function for calculation. The value to be used may be the curvature cost H (e).

  In step S <b> 33, the curvature cost calculation unit 32 stores the calculated curvature cost H (e) in the 3D shape data storage unit 31.

  In step S <b> 34, the curvature cost calculation unit 32 determines whether or not there is an unprocessed side among the information on the sides constituting the three-dimensional shape stored in the 3D shape data storage unit 31. In step S34, when there is an unprocessed side, the process returns to step S31, and the subsequent processes are repeated. That is, the processes in steps S31 to S34 are repeated until all sides are set as the processing target side e and the curvature cost H (e) is calculated for all sides. If it is determined in step S34 that there is no unprocessed side, the process ends.

  That is, the curvature cost is calculated for all pieces of information constituting the three-dimensional shape stored in the 3D shape data storage unit 31 and stored in the 3D shape data storage unit 31 by the above processing.

<Route length cost calculation processing>
Next, the path length cost calculation process will be described with reference to the flowchart of FIG.

  In step S51, the path length cost calculation unit 33 sets one of the unprocessed sides as the processing target side e among the information on the sides constituting the three-dimensional shape stored in the 3D shape data storage unit 31. .

  In step S52, the path length cost calculation unit 33 calculates the path length cost L (e) for the processing target side e. Specifically, the path length cost calculation unit 33 may set the path length itself of the processing target side e as the path length cost L (e), or the path length of the processing target side e as a predetermined function. A value calculated by inputting may be used as the path length cost L (e).

  In step S <b> 53, the route length cost calculation unit 33 stores the calculated route length cost L (e) in the 3D shape data storage unit 31.

  In step S <b> 54, the path length cost calculation unit 33 determines whether or not there is an unprocessed side among the information on the sides constituting the three-dimensional shape stored in the 3D shape data storage unit 31. In step S54, when there is an unprocessed side, the process returns to step S51, and the subsequent processes are repeated. That is, the processing of steps S51 to S54 is repeated until all sides are set as the processing target side e and the path length cost L (e) is calculated for all sides. If it is determined in step S54 that there is no unprocessed side, the process ends.

  That is, the path length cost is calculated for all of the information of the sides constituting the three-dimensional shape stored in the 3D shape data storage unit 31 and stored in the 3D shape data storage unit 31 by the above processing.

<Feature vertex sequence generation processing>
Next, the feature vertex sequence generation process will be described with reference to the flowchart of FIG.

  In step S71, the slider bar display control unit 39a of the cost weight input unit 39 determines whether or not the operation unit 37 is requested to display a slider bar for inputting the cost weight w by performing a predetermined operation. Determine. In step S71, for example, when the operation unit 37 is operated and the pointer is dragged in the horizontal direction by a distance longer than the predetermined distance, and the predetermined operation is regarded as being performed, the process proceeds to step S72. The predetermined operation for displaying the slider bar for inputting the cost weight w may be an operation other than the operation of dragging in the horizontal direction by a distance longer than the predetermined distance. It is also possible to provide a button or the like for requesting and to display a slider bar when the button is operated.

  In step S72, the slider bar display control unit 39a displays, for example, the slider bar SL1 as shown in FIG. 3 on the display unit 35 so that the input of the cost weight w can be accepted. By such processing, it is possible to display the slider bar SL1 by an easy operation only when it is necessary for the operation, and it is possible to prevent the slider bar SL1 from being displayed in an unnecessary state.

  In step S <b> 73, the feature vertex string generation unit 34 receives the weight w (0 <w <1) of the cost by operating the weight knob T on the slider bar SL <b> 1 by the operation unit 37, and the feature vertex string generation unit 34. It is determined whether or not the generation process is instructed. That is, when the weight knob T shown in FIG. 3 is set to a new position on the slider bar SL1 by operating the operation unit 37, it is considered that the weight w has been set, and the processing is performed in step S74. Proceed to

  In step S74, the feature vertex string generation unit 34 controls the cost calculation unit 34a to calculate the curvature cost H (e) for each combination of edges existing on the path from the start point to the end point based on the weight w. A calculation method of the cost C (= (1−w) × L + w × H) using the total H and the total L of the path length cost L (e) is set.

  In step S75, the feature vertex string generation unit 34 controls the cost calculation unit 34a, and the cost C (= (1-w) × L + w ×) for every combination of edges existing on the path from the start point to the end point. H) are all calculated. Further, the feature vertex string generation unit 34 calculates, as the shortest path, a path composed of a combination of edges where the cost C has a minimum value among the costs C that are the calculation results. That is, the feature vertex sequence generation unit 34 calculates the shortest path by solving the shortest path problem between the start point and the end point based on the cost C.

  In step S <b> 76, the feature vertex sequence generation unit 34 generates a sequence of vertices including points existing on the shortest path as a feature vertex sequence, and supplies the feature vertex sequence simplification unit 36.

  Note that if the display of the slider bar is not requested in step S71, or if the weight w is not input and the generation of a new feature vertex sequence is not instructed in step S73, the processing of steps S74 to S76 is skipped. Is done.

  In step S77, the feature vertex sequence generation unit 34 determines whether or not the operation unit 37 has been operated to instruct the completion of the feature vertex sequence generation process. If the completion has not been instructed, the process proceeds to step S71. Return. That is, until the completion of the process is instructed, the display request of the slider bar and the input of the weight w are accepted, and the feature vertex sequence is generated by recalculation every time the weight w is input. In step S77, when the operation unit 37 is operated and the completion of the process is input, the process ends.

  Through the above processing, for example, as shown by the weight knob T1 of the display image G11 in FIG. 7, when the left end of the slider bar SL1 is operated so as to prioritize the path length, the weight w = 0 is set. As the feature vertex row L1 as indicated by 3 is indicated by the feature vertex row L11 of the display image G11 in FIG. 7, the vertex row is selected with priority on the path length. Conversely, for example, as shown by the weight knob T2 of the display image G12 in FIG. 7, when the right end of the slider bar SL1 is operated so as to give priority to the curvature, the weight w = 1 is set, and the display in FIG. As indicated by the feature vertex row L12 of the image G12, the curvature is prioritized and the vertex row is selected along the crease. The slider bar SL1 may not be displayed when a predetermined time has elapsed after the operation. In this way, the slider bar SL1 can be displayed only at a necessary timing.

<Feature vertex sequence simplification process>
Next, the feature vertex string simplification process will be described with reference to the flowchart of FIG.

  In step S91, whether or not the slider bar display control unit 40a of the simplified ratio input unit 40 has been requested to display a slider bar for inputting the simplified ratio d by the operation unit 37 performing a predetermined operation. Determine whether. In step S91, for example, when the operation unit 37 is operated and the pointer is dragged in the vertical direction by a distance longer than the predetermined distance, and the predetermined operation is regarded as being performed, the process proceeds to step S92. Note that the predetermined operation for displaying the slider bar for inputting the simplified ratio d may be an operation other than the operation of being dragged in the vertical direction by a distance longer than the predetermined distance, or separately displayed. It is also possible to provide a button or the like for requesting and to display a slider bar when the button is operated.

  In step S92, the slider bar display control unit 40a displays, for example, the slider bar SL2 as shown by the display image G21 in FIG. 9 and the simplified ratio knob T11 on the display unit 35, and inputs the simplified ratio d. Get ready. In FIG. 9, when the dense bar is displayed at the upper end of the slider bar SL2 and the density of feature vertices is controlled to be increased, the simplified ratio knob T11 is operated, and the lower end is displayed as Sparse. When the control is performed in the direction in which the value becomes lower, the simplified ratio knob T11 is operated. By such processing, it is possible to display the slider bar SL2 only by an easy operation only when it is necessary for the operation, and it is possible to prevent the slider bar SL2 from being displayed in an unnecessary state.

  In step S <b> 93, the feature vertex row simplification unit 36 determines whether the simplification ratio is input from the simplification ratio input unit 40 by operating the simplification ratio knob on the slider bar SL <b> 2 by the operation unit 37. . That is, for example, when the simplified ratio knob T11 shown in FIG. 9 is set to a new position on the slider bar SL2 by operating the operation unit 37, it is considered that the simplified ratio d is set. . In FIG. 9, the simplified ratio knob T11 is operated upward in the display image G21.

  In step S93, for example, when the simplification ratio d is operated and input, the process proceeds to step S94.

  In step S94, the feature vertex sequence simplification unit 36 adjusts the density of feature vertices constituting the feature vertex sequence based on the simplification ratio d.

  In step S95, the feature vertex sequence simplification unit 36 connects the adjusted feature vertices based on the simplification ratio d to generate a new feature vertex sequence.

  In step S96, it is determined whether or not the operation unit 37 has been operated to instruct that the process has been completed. If the completion has not been instructed, the process returns to step S91. That is, steps S91 to S96 are repeated until completion is instructed. Then, when completion is instructed in step S96, the process ends. The slider bar SL2 may not be displayed when a predetermined time has elapsed after the operation. In this way, the slider bar SL2 can be displayed only at a necessary timing.

  That is, as shown in the left part of FIG. 9, when the simplified ratio knob T11 is operated in the upward direction with the highest density on the slider bar SL2 and the simplified ratio d is 1, all the characteristics are obtained. The feature vertex row L21 is displayed with the vertices left. That is, when there are many feature vertices, as shown by the feature vertex row L21 of the display image G21 in FIG. 9, what should be arranged on the circumference has a shape with noise on the image. As shown by the right display image G22, the simplified ratio d is, for example, about 0.75 by being operated downward on the slider bar SL2 as indicated by the simplified ratio knob T12. As a result, the density of feature vertices is reduced at equal intervals, so that the outer shape is beautifully corrected as indicated by the feature vertex row L22. In FIG. 9, P (s2) represents the start point and P (e2) represents the end point. As for the simplification ratio d, the maximum value is about 1, but the minimum value may be, for example, 0.75 or other values. However, since the feature vertex row cannot be configured when the minimum value becomes 0, the setting may be adjusted according to the shape to be left.

<Feature vertex sequence editing process>
Next, the feature vertex sequence editing process will be described with reference to the flowchart of FIG. This process is performed in a state where the feature vertex row is selected by the feature vertex selection process.

  That is, in step S111, the feature vertex sequence editing unit 41 determines whether any of the vertices constituting the feature vertex sequence generated by the feature vertex sequence selection process has been selected by operating the operation unit 37. Repeat the same operation until it is selected. In step S111, for example, as shown by the display image G31 in the left part of FIG. 11, the feature vertex row L31 giving priority to the curvature in the three-dimensional shape of the lower lip is obtained, whereby the outer shape of the lower lip is specified. Furthermore, when the vertex T31 on the feature vertex row L31 is selected, the process proceeds to step S112.

  In step S112, the feature vertex sequence editing unit 41 reads data of vertices constituting the feature vertex sequence to which the selected vertex T31 belongs from the 3D shape data storage unit 31. That is, in the case of FIG. 11, data of all vertices belonging to the feature vertex row L31 to which the vertex T31 that is the selected vertex belongs is read out.

  In step S <b> 113, the feature vertex sequence editing unit 41 reads the data of the vertices in the expanded range from the 3D shape data storage unit 31 based on the vertex data constituting the feature vertex sequence to which the selected vertex T <b> 31 belongs. That is, in the case of FIG. 11, the data of all the vertices belonging to the feature vertex row L31 ′, L31 ″ existing in the vicinity of the feature vertex row L31 to which the vertex T31 that is the selected vertex belongs is expanded. Read as data. For the range to be extended, in FIG. 11, feature vertex rows L31 ′ and L31 ″ are set as an example in which feature vertex rows are extended one by one up and down in the figure with respect to the feature vertex row L31. However, the extended range may be a range including a larger number of feature vertex sequences.

  In step S114, the feature vertex string editing unit 41 determines whether or not the selected vertex has been moved by operating the operation unit 37. In step S114, for example, as shown in the right part of FIG. 11, when the vertex T31 is moved in the horizontal direction and the vertical direction indicated by the arrows and moved to the vertex T32, the process proceeds to step S115. move on.

  In step S115, the feature vertex sequence editing unit 41 recalculates the feature vertex sequence composed of the moved vertices and other vertices, and the expanded feature vertex sequence, for example, by performing spline processing. . In other words, in the case of FIG. 11, the feature vertex sequence L32 is obtained by recalculating the positional relationship between the vertex T32 and the vertices constituting the other feature vertex sequence so as to be splined. Further, the feature vertex sequence editing unit 41 recalculates the vertices belonging to the feature vertex sequence L31 ′, L31 ″ in the expanded range as the vertex T31 moves, and the feature vertex sequence L32 ′, L32 ′. Calculate as'. Note that the amount of movement of the vertices belonging to the feature vertex rows L32 'and L32' 'in the expanded range may be reduced according to the distance from the moved vertex T32. By doing in this way, it becomes possible to set the movement amount of the peripheral vertex accompanying the movement of one vertex to a natural one.

  In step S116, the feature vertex sequence editing unit 41 updates and stores the data of vertices constituting the feature vertex sequence obtained by recalculation in the 3D shape data storage unit 31.

  In step S117, the display unit 35 displays the deformed feature vertex row L32 based on the vertex data constituting the feature vertex row updated and stored in this manner.

  In step S114, when the selected vertex is not moved, the process returns to step S111.

  By such processing, for example, as shown in the display image G31 in the left part of FIG. 11, the feature vertex row L31 giving priority to the curvature in the three-dimensional shape of the lower lip is obtained, so that the outer shape of the lower lip is changed. Further, by moving the vertex T31 on the feature vertex row L31 in the horizontal direction and the vertical direction indicated by arrows, for example, the vertex T32 indicated by the display image G32 on the right side of FIG. It is possible to change the outer shape of the lower lip by changing the feature vertex row L31 to the feature vertex row L32. At this time, the feature vertex rows L31 ′ and L31 ″ around the feature vertex row L31 can be changed in accordance with the change of the feature vertex row L31. It can be deformed in a natural state.

  By the above process, the start point and the end point are specified, and the weight w for giving priority to the curvature cost C and the path length cost L, and the simplified ratio d of the feature vertex sequence are input easily. In addition, it is possible to appropriately select the feature vertex sequence. In addition, by simply operating the weight knob and the simplified ratio knob, it is possible to repeatedly perform the operation until the desired feature vertex sequence is selected while changing the feature vertex sequence. In addition, it is possible to appropriately select the feature vertex sequence.

  By the way, the series of processes described above can be executed by hardware, but can also be executed by software. When a series of processing is executed by software, a program constituting the software may execute various functions by installing a computer incorporated in dedicated hardware or various programs. For example, it is installed from a recording medium in a general-purpose personal computer or the like.

  FIG. 12 shows a configuration example of a general-purpose personal computer. This personal computer incorporates a CPU (Central Processing Unit) 1001. An input / output interface 1005 is connected to the CPU 1001 via a bus 1004. A ROM (Read Only Memory) 1002 and a RAM (Random Access Memory) 1003 are connected to the bus 1004.

  The input / output interface 1005 includes an input unit 1006 including an input device such as a keyboard and a mouse for a user to input an operation command, an output unit 1007 for outputting a processing operation screen and an image of the processing result to a display device, programs, and various types. A storage unit 1008 including a hard disk drive for storing data, a LAN (Local Area Network) adapter, and the like, and a communication unit 1009 for performing communication processing via a network represented by the Internet are connected. Also, a magnetic disk (including a flexible disk), an optical disk (including a CD-ROM (Compact Disc-Read Only Memory), a DVD (Digital Versatile Disc)), a magneto-optical disk (including an MD (Mini Disc)), or a semiconductor A drive 1010 for reading / writing data from / to a removable medium 1011 such as a memory is connected.

  The CPU 1001 is read from a program stored in the ROM 1002 or a removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, or a semiconductor memory, installed in the storage unit 1008, and loaded from the storage unit 1008 to the RAM 1003. Various processes are executed according to the program. The RAM 1003 also appropriately stores data necessary for the CPU 1001 to execute various processes.

  In the computer configured as described above, the CPU 1001 loads the program stored in the storage unit 1008 to the RAM 1003 via the input / output interface 1005 and the bus 1004 and executes the program, for example. Is performed.

  The program executed by the computer (CPU 1001) can be provided by being recorded on the removable medium 1011 as a package medium, for example. The program can be provided via a wired or wireless transmission medium such as a local area network, the Internet, or digital satellite broadcasting.

  In the computer, the program can be installed in the storage unit 1008 via the input / output interface 1005 by attaching the removable medium 1011 to the drive 1010. Further, the program can be received by the communication unit 1009 via a wired or wireless transmission medium and installed in the storage unit 1008. In addition, the program can be installed in advance in the ROM 1002 or the storage unit 1008.

  The program executed by the computer may be a program that is processed in time series in the order described in this specification, or in parallel or at a necessary timing such as when a call is made. It may be a program for processing.

  In this specification, the system means a set of a plurality of components (devices, modules (parts), etc.), and it does not matter whether all the components are in the same housing. Accordingly, a plurality of devices housed in separate housings and connected via a network and a single device housing a plurality of modules in one housing are all systems. .

  The embodiments of the present technology are not limited to the above-described embodiments, and various modifications can be made without departing from the gist of the present technology.

  For example, the present technology can take a configuration of cloud computing in which one function is shared by a plurality of devices via a network and is jointly processed.

  In addition, each step described in the above flowchart can be executed by being shared by a plurality of apparatuses in addition to being executed by one apparatus.

  Further, when a plurality of processes are included in one step, the plurality of processes included in the one step can be executed by being shared by a plurality of apparatuses in addition to being executed by one apparatus.

  11 feature vertex sequence selection device, 31 3D shape data storage unit, 32 curvature cost calculation unit, 33 path length cost unit, 34 feature vertex sequence generation unit, 34a cost calculation unit, 35 display unit, 36 feature vertex sequence simplification unit, 37 Operation unit, 38 Start point / end point input unit, 39 Cost weight input unit, 39a Slider bar display control unit, 40 Simplification ratio input unit, 40a Slider bar display control unit, 41 Feature vertex sequence editing unit

Claims (6)

A curvature cost calculation unit for calculating a curvature cost based on the curvature of each side based on shape information including vertices, sides, and faces for constituting a three-dimensional shape;
A path length cost calculation unit that calculates a path length cost based on a path length in each of the sides based on shape information including vertices, sides, and faces for constituting the three-dimensional shape;
A point-to-point cost calculation unit that calculates a cost in a path between two predetermined points in the three-dimensional shape based on the curvature cost and the path length cost;
A feature vertex sequence generation unit that generates, as a feature vertex sequence, a sequence of points existing on the path between the predetermined two points, in which the cost between the predetermined two points is minimum in the three-dimensional shape. Image processing device. A weight setting unit that sets a weight to be added to each of the curvature cost and the path length cost;
The point-to-point cost calculation unit adds a weight set by the weight setting unit to the curvature cost and the path length cost, and in a path between predetermined two points in the three-dimensional shape. The image processing apparatus according to claim 1, wherein a cost is calculated. A simplified ratio setting unit that sets a ratio for thinning out and simplifying the number of points constituting the feature vertex sequence;
The simplification unit further simplifies the feature vertex sequence by thinning out the number of points of the feature vertex sequence obtained by the feature vertex sequence generation unit at a rate set by the simplification rate setting unit. The image processing apparatus according to 1. It generated by the feature vertex string generator, in the three-dimensional shape, by selecting the points constituting the feature vertices columns, according to claim 1, further comprising an editing unit for editing the feature vertex sequence Image processing apparatus. A curvature cost calculation unit for calculating a curvature cost based on the curvature of each side based on shape information including vertices, sides, and faces for constituting a three-dimensional shape;
A path length cost calculation unit that calculates a path length cost based on a path length in each of the sides based on shape information including vertices, sides, and faces for constituting the three-dimensional shape;
A point-to-point cost calculation unit that calculates a cost in a path between two predetermined points in the three-dimensional shape based on the curvature cost and the path length cost;
A feature vertex sequence generation unit that generates, as a feature vertex sequence, a sequence of points existing on a path between the predetermined two points, in which the cost between the predetermined two points is minimum in the three-dimensional shape;
In an image processing method of an image processing apparatus including:
A curvature cost calculation step of calculating a curvature cost based on the curvature of each side based on shape information consisting of vertices, sides, and faces for constituting the three-dimensional shape in the curvature cost calculation unit ;
Path length cost calculation for calculating a path length cost based on the path length in each side based on shape information including vertices, sides, and faces for constituting the three-dimensional shape in the path length cost calculation unit Steps,
A point- to-point cost calculation step of calculating a cost in a path between two predetermined points in the three-dimensional shape based on the curvature cost and the path length cost in the point-to-point cost calculation unit ;
The feature vertex sequence generation unit generates, as the feature vertex sequence, a sequence of points existing on the path between the predetermined two points, in which the cost between the predetermined two points in the three-dimensional shape is minimized. An image processing method comprising: a feature vertex sequence generation step. A curvature cost calculating step for calculating a curvature cost based on the curvature of each side based on shape information consisting of vertices, sides, and faces for constituting a three-dimensional shape;
A path length cost calculating step for calculating a path length cost based on a path length in each of the sides based on shape information including vertices, sides, and faces for constituting the three-dimensional shape;
A point-to-point cost calculation step of calculating a cost in a path between two predetermined points in the three-dimensional shape based on the curvature cost and the path length cost;
A feature vertex sequence generation step of generating, as a feature vertex sequence, a sequence of points existing on a path between the predetermined two points, in which the cost between the predetermined two points in the three-dimensional shape is minimized. A program that causes a computer to execute processing.

Images