Abstract: The present method relates to the manual assistance for the automated indexing (100) of a collection of images using facial recognition. In a first automated indexing step, automated indexing of faces within a collection of images is performed, creating sets of faces each of which comprises faces that are determined by the automated process to be representative of the same person. In a second splitting step (200), sets are displayed to an operator, who determines whether there are false-positive associations within a set. If false-positive associations are found, the faces representing different people are manually split into different sets, hi this way, there will be no false-positive associations within the collection of images, hi a third merging step (300), sets that have some degree of similarity are presented to the operator, who determines whether the two sets comprise representations of the same person. If so, the two sets are manually merged, thereby eliminating false-negative errors.

Abstract: The present method relates to the manual assistance for the automated indexing (100) of a collection of images using facial recognition. In a first automated indexing step, automated indexing of faces within a collection of images is performed, creating sets of faces each of which comprises faces that are determined by the automated process to be representative of the same person. In a second splitting step (200), sets are displayed to an operator, who determines whether there are false-positive associations within a set. If false-positive associations are found, the faces representing different people are manually split into different sets, hi this way, there will be no false-positive associations within the collection of images, hi a third merging step (300), sets that have some degree of similarity are presented to the operator, who determines whether the two sets comprise representations of the same person. If so, the two sets are manually merged, thereby eliminating false-negative errors.

Abstract: The present invention consists of an evaluation engine, which is a system for evaluating the state of an animation at a specific time where secondary animation may be derived from the state of the animation at another time. Unlike DAG-based systems where time is another variable, time is external to the evaluation engine so that it can easily evaluate alternate times and even entire simulations. It also comprises meshes which support instancing and edge weights, and which employ and extensible system of polygon types to support subdivision surface approximation using a set of bi-quadratic patches which solve quickly. The meshes can also be animated by the evaluation engine using a mesh stack, which has multiple evaluation paths for quickly computing mesh attributes without performing a full evaluation.

Abstract: The present invention allows users to customize user interfaces within software programs on the fly. By customizing user interfaces users can streamline their own work process, particularly when the user is dealing with large amounts of data. In addition to customizing user interfaces, the present invention also allows users to more easily select portions of an object with the select more command and to more easily enter exact numeric values with detents on mouse input.

Abstract: The present invention consists of an evaluation engine, which is a system for evaluating the state of an animation at a specific time where secondary animation may be derived from the state of the animation at another time. Unlike DAG-based systems where time is another variable, time is external to the evaluation engine so that it can easily evaluate alternate times and even entire simulations. It also comprises meshes which support instancing and edge weights, and which employ and extensible system of polygon types to support subdivision surface approximation using a set of bi-quadratic patches which solve quickly. The meshes can also be animated by the evaluation engine using a mesh stack, which has multiple evaluation paths for quickly computing mesh attributes without performing a full evaluation.