Abstract: A method for efficient image registration between two images in the presence of inlier-poor domains includes receiving a set of candidate correspondences between the two images. An approximate homography between the two images is generated based upon a first correspondence in the correspondences. The set of candidate correspondences is filtered to identify inlier correspondences based upon the approximate homography. A candidate homography is computed based upon the inlier correspondences. The candidate homography can be selected as a final homography between the two images based upon a support of the candidate homography against the set of candidate correspondences. An image registration is performed between the two images based upon the candidate homography being selected as the final homography.

Abstract: The disclosure includes a computational system implemented with respect to a novel computational architecture for operating an externally-defined data based on client-defined rules. In one of the implementations, the architecture is utilized in a billing and customer service program. The architecture includes a engine unit which includes a number of processing modules which internally operate on generic data units that are independent of the particular application. a metadata engine receives externally-defined data and relates the externally-defined data and the relates the externally-defined data to the generic data units for use for the engine unit. a rules-based engine provides to the engine unit information related to the client defined rules. In this manner, the engine unit can be reused in a large part in a variety of different environments.

Abstract: The disclosure includes a computational system implemented with respect to a novel computational architecture for operating an externally-defined data based on client-defined rules. In one of the implementations, the architecture is utilized in a billing and customer service program. The architecture includes a engine unit which includes a number of processing modules which internally operate on generic data units that are independent of the particular application. A metadata engine receives externally-defined data and relates the externally-defined data and the relates the externally-defined data to the generic data units for use for the engine unit. A rules-based engine provides to the engine unit information related to the client defined rules. In this manner, the engine unit can be reused in a large part in a variety of different environments.

Abstract: The disclosure includes a computational system implemented with respect to a novel computational architecture for operating an externally-defined data based on client-defined rules. In one of the implementations, the architecture is utilized in a billing and customer service program. The architecture includes a engine unit which includes a number of processing modules which internally operate on generic data units that are independent of the particular application. a metadata engine receives externally-defined data and relates the externally-defined data and the relates the externally-defined data to the generic data units for use for the engine unit. a rules-based engine provides to the engine unit information related to the client defined rules. In this manner, the engine unit can be reused in a large part in a variety of different environments.