{"title":"Estimation of spatial distortion as a function of geometric parameters of perspective","authors":"C. Rosenberg, W. Barfield","doi":"10.1109/21.400510","DOIUrl":"https://doi.org/10.1109/21.400510","url":null,"abstract":"As part of a study on the relationship between geometric parameters of perspective and judgments of spatial information, 15 subjects estimated the degree of spatial distortion within a computer-generated perspective display. The experiment task was to estimate \"skewness,\" the projected angle (in screen spate coordinates) between two parallel vertical computer-generated droplines (in world space coordinates) which varied as a function of the radial distance, station point distance, and the geometric field of view. These variables will influence the perceived size, depth, and height of objects displayed in the scene. Thus, estimating skewness as a function of display parameters is a relevant task for display design because it enables an intermediate variable (skewness) to be measured that will subsequently influence estimates of azimuth, elevation, size, and perceived depth within a perspective scene. In order to compare the subject's estimate of skewness with the actual on-screen distortion produced by the geometric parameters of perspective, a mathematical procedure for calculating the actual projected skewness angle was developed. The difference between the subject's estimated skewness and the actual on-screen skewness angle was analyzed as the response variable. The results indicated that both the station point and radial distance were significant factors in determining the accuracy with which subjects estimated the distortion in the perspective scene. However, there was no significant relationship between the geometric field of view used to design the perspective display and the subject's ability to judge the skewness angle in the perspective projection. The implications of the results for the design of spatial instruments and for performance of spatial tasks using perspective displays is discussed. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"25 1","pages":"1323-1333"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84385357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stream Option Manager (SOM): automated integration of aircraft separation, merging, stream management, and other air traffic control functions","authors":"W. Niedringhaus","doi":"10.1109/21.400505","DOIUrl":"https://doi.org/10.1109/21.400505","url":null,"abstract":"Stream Option Manager (SOM) is a proposed concept for automated integration of aircraft separation, merging and stream management, using linear programming techniques. It was developed as part of a research and development initiative for air traffic control (ATC) automation concepts, sponsored by the Federal Aviation Administration (FAA) and performed by MITRE Corporation. SOM is research; it has not been approved by the FAA for use in future ATC. SOM's purpose is to resolve possible problems involving multiple aircraft with given flight paths. Each aircraft must be separated by a minimum distance from every other aircraft at all times, and certain sets of aircraft (e.g., those about to land at a particular airport) must be merged or metered (lined up, or separated in trail by a given distance). Aircraft in sets called streams must be separated in the along-route direction at all times. Each aircraft is also subject to certain speed limits. Given the pilot-preferred flight paths, and separation, metering, stream, and speed requirements, SOM finds modified flight paths for each aircraft that satisfy all the requirements yet stay as close as possible to the pilot-preferred paths. SOM's algorithm represents the (x, y, z) positions of each aircraft at future times as variables in a linear program. The requirements are expressed or approximated by linear inequalities or equalities. Pilot preferences are approximated by a linear objective function. The SOM algorithm has been implemented successfully in a prototype simulation in 2D. Scenarios with up to 15 aircraft and 24 separation and/or merging problems have been resolved. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"263 1","pages":"1269-1280"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81712213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A neural network approach to photometric stereo inversion of real-world reflectance maps for extracting 3-D shapes of objects","authors":"K. Rajaram, P. Guturu, M. Faruqi","doi":"10.1109/21.400507","DOIUrl":"https://doi.org/10.1109/21.400507","url":null,"abstract":"Presents a neural network approach to the problem of photometric stereo inversion of the reflectance maps of real-world objects for the purpose of estimating the 3-D attitudes of the surface patches of objects. As in the photometric stereo approach, here also the observation that there is a one-to-one mapping between the n-tuples of the photometric stereo image intensities and the orientations of the surface normals is valid. A multilayered feedforward neural network with backpropagation training algorithm is used as dimensionality reducer to effectively encode this mapping by associating the two components of surface normals to the observed intensities from three photometric stereo images of the underlying surface patches. The training patterns are sampled from the images of a Gaussian sphere of average reflectance containing both diffuse and specular components. The neural network thus trained has been tested on images of real-world objects with different shapes and reflectance properties. Using the surface normals estimated by the neural network, 3-D shapes of the objects have been reconstructed to a good approximation. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"40 1","pages":"1289-1300"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73844263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dependency analysis in constraint negotiation","authors":"A. Kusiak, Juite Wang","doi":"10.1109/21.400508","DOIUrl":"https://doi.org/10.1109/21.400508","url":null,"abstract":"Problems in engineering design are constraint-oriented and often involve multiple perspectives. Designers must consider not only functional requirements of a product but also its life-cycle perspectives. Each perspective has its own set of constraints which may contain conflicting or unsatisfied requirements. A human designer can not be aware of all constraints and design alternatives all the time. The objective of this paper is to develop a methodology to assist designers in negotiation of constraints. A network model is proposed to represent relationships among design variables. An algorithm is developed to derive dependencies between design variables and goals. Based on the dependencies obtained, design modifications are generated for resolving conflicts. In the second part of the paper, a fuzzy-logic-based approach is used to model imprecise dependencies between variables in the case when no sufficient quantitative information is available. The approach proposed can be used to increase the amount of information provided to the designers for making decisions. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"47 1","pages":"1301-1313"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88601983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimum multisensor data fusion for image change detection","authors":"Ze-Sun Jain, Y. Chau","doi":"10.1109/21.414528","DOIUrl":"https://doi.org/10.1109/21.414528","url":null,"abstract":"Optimum multisensor data fusion is addressed for image change detection based on the optimum likelihood ratio test for the statistical dependence of the luminance signals in additive Gaussian noise. It is demonstrated that the information to be transmitted from the sensors to the fusion center is the maximum likelihood estimates of the correlation coefficients between pairs of consecutive image frames. Experimental results illustrate that the detection error decreases as the number of sensors and/or frames increases. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"187 1","pages":"1340-1347"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88821165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A graphical method for solving a decision analysis problem","authors":"C. Goutis","doi":"10.1109/21.398680","DOIUrl":"https://doi.org/10.1109/21.398680","url":null,"abstract":"A method for solving multistage decision analysis problems under uncertainty is proposed. The method is appropriate when the utility function can be decomposed to smaller factors and the joint probability function of the random variables also factorises to probabilities defined in smaller subsets of random variables. We use the factorisations and the corresponding graphical structure of the problem to compute efficiently the expected utility at each stage, All computations are local in the sense that they involve a small number of variables. Then, using dynamic programming, we can identify an optimum strategy, depending on the available knowledge at the time that decisions are taken. The algorithm is illustrated by a worked example, and a comparison with existing approaches is included. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"88 1","pages":"1181-1193"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83810926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On consistent symbolic representations of general dynamic systems","authors":"M. Kokar","doi":"10.1109/21.398684","DOIUrl":"https://doi.org/10.1109/21.398684","url":null,"abstract":"This paper deals with the issue of consistent symbolic (qualitative) representation of continuous dynamic systems. Consistency means here that the results of reasoning with the qualitative representation hold in the underlying (quantitative) dynamic system. In the formalization proposed in this paper, the quantitative structure is represented using the notion of a general dynamic system (GDS). The qualitative counterpart (QDS), is represented by a finite-state automaton structure. The two representational substructures are related through functions, called qualitative abstractions of dynamic systems. Qualitative abstractions associate inputs, states and outputs of the QDS, with partitions of appropriate GDS spaces. The paper shows how to establish such consistent partitions, given a partitioning of the system's output. To represent borders of these partitions, the notion of critical hypersurfaces is introduced. One of the main ideas that provides consistency is the interpretation of qualitative input events as elements of the partition of the Cartesian product of input, initial state and time sets. An example of a consistent qualitative/quantitative representation of a simple dynamic system, and of reasoning using such a representation, is provided. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"64 1","pages":"1231-1242"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78079685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evidential reasoning approach to multisource-data classification in remote sensing","authors":"Hakil Kim, P. Swain","doi":"10.1109/21.398687","DOIUrl":"https://doi.org/10.1109/21.398687","url":null,"abstract":"In the evidential reasoning approach to the classification of remotely sensed multisource data, each data source is considered as providing a body of evidence with a certain degree of belief. The degrees of belief are represented by \"interval-valued probabilities\" rather than by conventional point-valued probabilities so that uncertainty can be embedded in the measures. The proposed method is applied to the ground-cover classification of simulated 201-band high resolution imaging spectrometer (HIRIS) data, from which a set of multiple sources is obtained by dividing the dimensionally huge data into smaller pieces based on the global statistical correlation information. By a divide-and-combine process, the method is able to utilize more features than conventional maximum likelihood methods. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"1 1","pages":"1257-1265"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74611554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The optimal camera geometry and performance analysis of a trinocular vision system","authors":"R. Chiou, Chin-hsing Chen, K. Hung, Jau-Yien Lee","doi":"10.1109/21.398682","DOIUrl":"https://doi.org/10.1109/21.398682","url":null,"abstract":"In this paper, the projection location constraint is exploited to reduce ambiguous correspondences in trinocular systems. The inherent matching problems associated with the spurious features produced by overlapping among targets, the periodic structure of objects and the occlusion features were solved. The projection location constraint can be achieved by the deviation-to-distance transformation and the optimal epipolar constraint. The deviation-to-distance transformation transforms the location deviation of the extracted feature on an image plane to a maximum distance between the potential corresponding features and the epipolar line on another image for restricting the searching area of correspondences. The optimal epipolar constraint is obtained by adjusting the camera model before systems start to work. With the deviation-to-distance transformation and the optimal epipolar constraint, the arbitral area for searching the potential corresponding features can be made reasonably small. This not only saves computational time but also results in fewer ambiguous correspondences. In practice, the importance of the paper is that it proposes a very easy adjustment of camera geometry to simplify the most troublesome matching problem encountered in stereo systems. All the discussions and derivations are based on the geometry of the camera model and the mapping between the locations of the 3D features and their projection locations on the image planes. The non-ambiguity probability of the trinocular system is derived theoretically and verified by experimental results. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"101 1","pages":"1207-1220"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89495460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation","authors":"Tsung-Rian Chen, T. Chang, Cheng-Wu Chen, J. Kao","doi":"10.1109/21.398686","DOIUrl":"https://doi.org/10.1109/21.398686","url":null,"abstract":"This paper presents a Lagrangian relaxation approach for the scheduling problem of an IC sort and test facility. In an integrated circuit (IC) manufacturing environment, a combination of tester, prober, and some hardware facilities is needed for wafer sort while a combination of tester, handler, and some other hardware facilities is needed for final test. To schedule both sorting and testing at the same time, the resource constraints on testers, probers, handlers and hardware have to be dealt with. This paper also extends the Lagrangian relaxation technique to solve a class of preemptive scheduling problems which particularly exist in an IC test floor environment. Numerical examples are given to illustrate the potential of the authors' approach. Comparisons of the authors' results with those obtained by some heuristic rules are also given. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"25 1","pages":"1249-1256"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87100427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}