412 results about "One pass" patented technology

The present invention applies a novel iterative algorithm to the problem of multidimensional optimization by supplying a strict, nonlinear mathematical solution to what has traditionally been treated as a linear multidimensional problem. The process consists of randomly selecting a statistically significant sample of a prospect list, calculating the value of the utility function for each pair of an offer and selected prospects, reducing the original linear multidimensional problem to a non-linear problem with a feasible number of dimensions, solving the non-linear problem for the selected sample numerically with the desired tolerance using an iterative algorithm, and using the results to calculate an optimal set of offers in one pass for the full prospect list.

A digital image processing method for multiple passes diagnostic alignment of in vivo images, comprising the steps of: acquiring images using an in vivo video camera system; forming an in vivo video camera system examination bundlette; transmitting the examination bundlette to proximal in vitro computing device(s); processing the transmitted examination bundlette; automatically identifying abnormalities in the transmitted examination bundlette; and setting off alarm signals to a local site provided that suspected abnormalities have been identified for each pass forming a registration bundle; selecting identification elements of an image from the registration bundle of one pass; and retrieving corresponding images from another pass.

A relational database warehouse system with query optimization capabilities is described that allows for speedy identification of sets of records of interest from amongst tens of millions of records. The records of interest may include complex derived attributes, generated, at least in part, by aggregating data from a plurality of records in base data tables. In various embodiments, the query optimization capabilities allow the database warehouse system to identify conditions under which normal query execution may be replaced by one or more optimized execution methods, including, for example, eliminating unnecessary inner join operations on base data tables specified by a query, re-ordering the execution of group-by operations and left-outer join operations to greatly reduce the size of join tables produced while processing a query, and / or consolidating a set of segmentation queries for execution in one pass over the records of the database.

To irradiate a target with a beam of energetic radiation formed by electrically charged particles, the beam is formed and imaged onto a target, where it generates a pattern image composed of pixels. The pattern image is moved along a path on the target over a region to be exposed, and this movement defines a number of stripes covering said region in sequential exposures and having respective widths. The number of stripes is written in at least two subsequent passes such that for each pass, the widths of the stripes of one pass combine into a cover of the total width of the region to be exposed; and each pass is associated with one of a number of partial grids of pattern pixels which are exposable during the respective pass. The mutually different partial grids combine to the complete plurality of pattern pixels which compose the region to be exposed.

A toner showing a high transferability and suitable for use in cleanerless image forming system is formed of toner particles comprising at least a binder resin and magnetic iron oxide. The toner is characterized by a specific circularity distribution relative to its weight-average particle size and a controlled degree of surface-exposed magnetic iron oxide providing an extract solution with hydrochloric acid showing an absorbance of 1.0-2.5 at a wavelength of 340 nm. The toner is suitably produced by a production system including a rotary mechanical pulverizer and a one-pass surface treatment apparatus for continuously applying a mechanical impact force to pulverized toner particles therein.

System and method for constructing a 3D model of an object based on a series of silhouette and texture map images. In the exemplary embodiment an object is placed on a rotating turntable and a camera, which is stationary, captures images of the object as it rotates on the turntable. In one pass, the system captures a number of photographic images that will be processed into image silhouettes. In a second pass, the system gathers texture data. After a calibration procedure (used to determine the camera's focal length and the turntable's axis of rotation), a silhouette processing module determines a set of two-dimensional polygon shapes (silhouette contour polygons) that describe the contours of the object. The system uses the silhouette contour polygons to create a 3D polygonal mesh model of the object. The system determines the shape of the 3D model analytically by finding the areas of intersection between the edges of the model faces and the edges of the silhouette contour polygons. The system creates an initial, (rough) model of the 3D object from one of the silhouette contour polygons, then executes an overlaying procedure to process each of the remaining silhouette contour polygons. In the overlaying process, the system processes the silhouette contour polygons collected from each silhouette image, projecting each face of the (rough) 3D model onto the image plane of the silhouette contour polygons. The overlaying of each face of the (rough) 3D model onto the 2D plane of the silhouette contour polygons enables the present invention to determine those areas that are extraneous and should be removed from the (rough) 3D model. As the system processes the silhouette contour polygons in each image it removes the extraneous spaces from the initial object model and creates new faces to patch “holes.” The polygonal mesh model, once completed, can be transformed into a triangulated mesh model. In a subsequent step, the system uses a deterministic procedure to map texture from the texture images onto the triangles of the 3D mesh model, locating that area in the various texture map images that is “best” for each mesh triangle.