Showing papers on "Object (computer science) published in 1971"

Optimal Whereabouts Search

Abstract: An optimal whereabouts search maximizes the probability of correctly stating, at the end of a search costing no more than some budget C, which box contains the object. This can be accomplished either by finding the object in the search or by guessing, at the end of an unsuccessful search, which box contains the object. Generalizing work of Tognetti, this paper shows that an optimal whereabouts search never searches the box to be guessed, and gives an algorithm for finding an optimal whereabouts-search strategy. Finally, whereabouts search is compared to a similar problem proposed by Bellman.

Image modification of motion pictures

Abstract: Individual image areas of a previously recorded motion picture scene can be modified electronically despite relative movement of such areas from frame to frame. Video values for each image element are stored in digital form in the memory of a general purpose computer in association with identifying addresses. A selected object area to be modified is then defined by a list of addresses of the image elements bounding the object. Such boundary addresses are derived partly manually or visually by reference to a CRT display of a selected frame, with assistance from the suitably programmed computer which automatically extends the boundary address list from frame to frame. The computer is then programmed to recover from memory the video values for image elements within the area defined by each boundary address list, to perform the desired modification of each value, and to return the modified values to memory. The modification of each value typically requires reference to other image elements in the same frame or to corresponding image elements of adjacent frames, with computation of functions such as averages of the video values for such elements. Useful types of modification include changes of definition, contrast, hue and brightness, elimination of unwanted objects, reduction of graininess and other random noise, and insertion of color. After completion of the desired modification, each frame or group of frames is again recorded photographically, magnetically or on any desired storage medium.

Variable depth laminagraphy

Abstract: A METHOD AND APPARATUS FOR OBTAINING LAMINAL DETAIL WITHIN A THREE-DIMENSIONAL OBJECT UTILIZING CIRCULAR LAMINAGRAPHY, THAT IS, A SERIES OF EXPOSURES TO PENETRATING RAYS RECORDED SERIATIM ON DISCRETE FILMS AS A RAY-SOURCE AND OBJECT ARE RELATIVELY MOVED CIRCULARLY IN REFERENCE TO THE FILM. THE APPARATUS MOUNTS THE FILM AND OBJECT FOR RECORDING, AND MOUNTS THE RESPECTIVE RECORDED DATA AND MOVES EACH SUITABLY WITH RESPECT TO THE OTHER TO GENERATE A SERIES OF LAMINAL DETAIL PROGRESSIVELY THROUGH THE OBJECT.

Apparatus for detecting and rejecting improperly oriented objects

Abstract: Apparatus utilizing a fiber optic system for detecting misorientation of an object passing on a conveyor. By means of the system light is projected onto the object and, if the latter is not properly oriented, the light is reflected back through the system and actuates a sensor. Upon actuation of the sensor, the apparatus operates through electromechanical means to remove the object from the conveyor.

A steel object having hidden magnetically readable identification and the method for applying the identification

Abstract: A vehicle, appliance or tool having a multiplicity of magnetizable identifying indicia hidden by an opaque, protective layer such as paint. The indicia may be read by the use of a magnetic reader.

Computer analysis of visual properties of curved objects

Abstract: A method is presented for the visual analysis of objects by computer. It is particularly well suited for opaque objects with smoothly curved surfaces. The method extracts information about the object''s surface properties, including measures of its specularity, texture, and regularity. It also aids in determining the object''s shape. The application of this method to a simple recognition task, (the recognition of fruit) is discussed. The results on a more complex smoothly curved object, a human face, are also considered.

Computer interpretation of imperfect line data as a three-dimensional scene

Abstract: : The paper describes a heuristic scence description program. This program accepts as input a scene represented as a line drawing. Based on a set of known object models the program attempts to determine the identify and location of each object viewed. The most significant feature of the program is its ability to deal with imperfect input data. Also presented are some preliminary results concerning constraints in projections of planar-faced solids. It is shown that for a restricted class of projections, 4 points located in 3-space in addition to complete monocular information are sufficient to specify all the visible point locations precisely. (Author)

Egral radar phase comparison system for object recognition19730306

Abstract: A radar system of object recognition wherein non-integral coherent-harmonic frequency signals are transmitted towards the object of interest and the return signals therefrom are phase compared to provide a resultant signal having characteristics distinguishing the object from its background.

Floating buoyant object

Abstract: A floating buoyant object such as a duck decoy having an anchor and an attaching anchor line. Resilient line-holding clip means are provided whereby the length of the anchor line may be adjusted. Means are provided on the object for the storage of reserve anchor line.

Optimal search for a randomly moving object in a special case

Abstract: Search for an object whose motion is a symmetrical two-dimensional diffusion process is considered in the case where a given amount of search of constant density is distributed, during a given interval of time, over a fixed circular area. An expression for the probability of detection of the object during this interval of time is derived in the special case where the location of the object at time zero is given. The application of this expression would involve numerical work.

An optical toy device for simulating stereoscopic x-ray images

Abstract: An optical device comprising a generally transparent body for intercepting light emitted from an object and through which the object may be viewed. The light-transmissive body includes opposite surfaces on at least one of which is provided a plurality of transversely contiguously generally parallel grooves for operating upon light emitted from the object being viewed and simulating an X-ray image of the latter object.

Optical system for focusing spaced object planes in a common image plane

Abstract: An optical system for focusing spaced object planes into a common image plane by means of a compensating optical element alternately placed and removed from between an objective and the object planes which equalizes the optical paths thereof.

Submersible equipment handling system

Abstract: A handling system for lowering and retrieving large and heavy objects such as sonar arrays from surface ships and other unstable platforms. A submersible object which normally is suspended by a single cable when at operating depth is retrieved and returned to a surface platform by a messenger device suspended on two or more other cables from the platform and provided with means for guiding the messenger to the object, orienting the object with respect to the messenger and thus with respect to the surface platform, and locking the messenger and object together. The resulting messenger and object assembly then may be hoisted back to the platform with some or all of the weight of the assembly carried by the messenger cables thus at least partially unloading the main support cable during retrieval.

Optimum sequential search with discrete locations and random acceptance errors

Abstract: : Much work has been done in search theory. However, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these probabilities remain fixed for all searching and locations. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. The policy is optimum in that, for any number of steps, it minimizes the probability of no acceptances and, simultaneously, maximizes the probability that an acceptance occurs and the object is accurately located. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location. (Author)

A laboratory for the study of automating programming

Abstract: We are concerned in this paper with facilities, tools, and techniques for automating programming and thus we had best commence with discussing what we mean by programming. Given a precise specification of some task to be accomplished or some abstract object to be constructed, programming is the activity of producing an algorithm or procedure---a program---capable of performing the task or constructing a representation of the object on some computing system. The initial specifications and the resulting program are both couched in some (programming) language---perhaps the same language. The process typically involves such activities as: choosing efficient representations for data and algorithms, taking advantage of known or deduced constraints on data and algorithms to permit more efficient computations, verifying (proving) that the task will be accomplished or that the object constructed is, in fact, the one desired, demonstrating that certain performance criteria are met, and so on.

On the meaning of names in programming systems

Abstract: It is assumed that there is a similarity of function between the data names of a programming language and the file names of an operating system. The two functions are discussed in terms of the same basic concepts in order to identify the extent to which they overlap. It is suggested that there is some similarity between the idea of a file directory and a storable object of type context. Manipulations with contexts are then discussed at length.It is noted that there is a simple extension of Church's l notation that deals nicely with these ideas of context manipulation. Whereas a function can be regarded as the abstraction based upon the first two terms of the expression l(namelist)(expression)(valuelist), it is found that a context can be viewed as an abstraction based upon the first two terms in the equivalent expression m(namelist)(valuelist)(expression).

The Object Partition Problem

Abstract: We provide a theoretical framework for the "object partition problem". We begin by considering this problem In a rather abstract context. Consider the semantic domain of physical objects, and the syntactic domain of picture graphs. The object partition problem can be viewed In terms of specifying syntactic operations that yield partitions of the picture graph, which when interpreted In the semantic domaih correspond to possible partitions of the scene into physical objects. We term such syntactic partitions "physically realizable partitions" or simply "realizable partitions". The problem has several aspects. We may seek all possible partitions, the one "best" partition, several plausible partitions, judge or rank proposed partitions, and so forth. The most Important aspect of the problem, In sone sense, is determining the "best" or most likely realizable partition. Guzman's SEE attempts to deal with this problem. Guzman uses his understanding of the semantic physical world of objects to make local choices on the best partition of a given picture graph. These choices are somewhat Interrelated. They are combined to inform global decisions which may also be interrelated. Guzman's SEE is a remarkable heuristic programming achievement. However, as might be expected of tho germinal achievement in its field, It lacks a satisfactory theoretical framework. There Is some difficulty in determining the motivations and implications of Gukian's heuristic decisions.

MENELAUS: A system for measurement of the extensible language Proteus

Abstract: The research described below deals with measurement of efficiency characteristics of extensible languages having very small cores. Bell's language Proteus [1] was chosen as an object of study since it is a member of this class and moreover, contains quite general schemes for syntactic and semantic extensibility. I have implemented a Proteus interpreter in Fortran on an XDS Sigma 5, incorporating changes to Bell's original implementation as well as those of Harris [2]. An obvious serious concern in using small core languages is the efficiency of their translation and execution. This efficiency derives from two main sources: the implementation of the core language on a given machine and the implementation of the extended language(s) onto the core. The former problem is solvable by direct implementation in hardware or microprogramming and will not be considered further. The second problem we wish to consider at greater length.