{"title":"Design considerations for a space-variant visual sensor with complex-logarithmic geometry","authors":"A. Rojer, E. Schwartz","doi":"10.1109/ICPR.1990.119370","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119370","url":null,"abstract":"A space-variant sensor design based on the conformal mapping of the half disk, w=log (z+a), with real a>0, which characterizes the anatomical structure of the primate and human visual systems is discussed. There are three relevant parameters: the circumferential index kappa which is defined as the number of pixels around the periphery of the sensor, the visual field radius R (of the half-disk to be mapped), and the map parameter a, which displaces the logarithm's singularity at the origin out of the domain of the mapping. It is shown that the log sensor requires O( kappa /sup 2/log (R/a)) pixels. An analysis is presented which makes it possible to compare directly the space complexity of different sensor designs in the complex logarithmic family. In particular, rough estimates can be obtained of the parameters necessary to duplicate the field width/resolution performance of the human visual system.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740560","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":"Purposive and qualitative active vision","authors":"Y. Aloimonos","doi":"10.1109/ICPR.1990.118128","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118128","url":null,"abstract":"The traditional view of the problem of computer vision as a recovery problem is questioned, and the paradigm of purposive-qualitative vision is offered as an alternative. This paradigm considers vision as a general recognition problem (recognition of objects, patterns or situations). To demonstrate the usefulness of the framework, the design of the Medusa of CVL is described. It is noted that this machine can perform complex visual tasks without reconstructing the world. If it is provided with intentions, knowledge of the environment, and planning capabilities, it can perform highly sophisticated navigational tasks. It is explained why the traditional structure from motion problem cannot be solved in some cases and why there is reason to be pessimistic about the optimal performance of a structure from motion module. New directions for future research on this problem in the recovery paradigm, e.g., research on stability or robustness, are suggested.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127420079","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":"Active vision: 3D from an image sequence","authors":"A. Shmuel, M. Werman","doi":"10.1109/ICPR.1990.118063","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118063","url":null,"abstract":"An approach to active depth perception using stereo methods is proposed. Active vision is characterized by gaze control for input-dependent data acquisition, coupled with a treatment of the reliability of the acquired information. An active solution is proposed for the task of computing 3D depth from an image sequence, where the camera can be controlled. After each phase of computation (between pictures), when information is still needed, the camera is placed in a new optimal position for the next picture. This process is repeated until sufficient accuracy is achieved. The proposed approach improves the ability to perform tasks in a noisy environment. The accuracy and reliability of solutions are improved, and the quantity of necessary data and computations is reduced.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129111957","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":"Connectionist model binarization","authors":"N. Babaguchi, Koji Yamada, K. Kise, Y. Tezuka","doi":"10.1109/ICPR.1990.119329","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119329","url":null,"abstract":"The application of a connectionist model to an image binarization method called connectionist model binarization (CMB) is discussed. CMB employs a multilayer network of a connectionist model whose input and output are a histogram and a desirable threshold for binarization, respectively. This network is trained with a back-propagation algorithm to output a threshold which gives a visually suitable binarised image against any histogram. The details of CMB are described, and its learning strategy and binarization performance are discussed.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133689892","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":"Small sample size effects in statistical pattern recognition: recommendations for practitioners and open problems","authors":"S. Raudys, Anil K. Jain","doi":"10.1109/ICPR.1990.118138","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118138","url":null,"abstract":"The authors discuss the effects of sample size on the feature selection and error estimation for several types of classifiers. In addition to surveying prior work in this area, they give practical advice to today's designers and users of statistical pattern recognition systems. It is pointed out that one needs a large number of training samples if a complex classification rule with many features is being utilized. In many pattern recognition problems, the number of potential features is very large and not much is known about the characteristics of the pattern classes under consideration: thus, it is difficult to determine a priori the complexity of the classification rule needed. Therefore, even when the designer believes that a large number of training samples has been selected, they may not be enough for designing and evaluating the classification problem at hand. It is further noted that a small sample size can cause many problems in the design of a pattern recognition system.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130491205","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 space saving approach to the Hough transform","authors":"M. Albanesi, M. Ferretti","doi":"10.1109/ICPR.1990.119403","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119403","url":null,"abstract":"Some results are reported on an approach to the vote collecting phase of the Hough transform, particularly of the generalized Hough transform (GHT). The purpose of the analysis is to obtain a reduction in the computational cost of the algorithm that would make it suitable for efficient hardware implementation. The reduction is sought at the level of storage requirements for the accumulator space. The method applied differs from the various approaches that dynamically quantize the accumulator space; it extends previously published work on fixed-size, limited memory by introducing a priori knowledge, in the form of geometry constraints, in the process of votes accumulation. A very simple geometry constraint is embedded in the voting rule. The method is tested in an application to IC inspection. Within the framework of raster scan, real-time image processing, a hardware realization of the algorithm can be based on systolic accumulation of votes in a modified priority queue device.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116629261","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 multiple-level heterogeneous architecture for image understanding","authors":"D. Shu, J. G. Nash, C. Weems","doi":"10.1109/ICPR.1990.119444","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119444","url":null,"abstract":"First- and second-generation implementations of an image understanding architecture, IUA, are described. The IUA system is designed specifically for computer vision processing that relies heavily on artificial intelligence techniques to classify objects. To provide for low-, intermediate-, and high-level computer vision processing-required for model-/knowledge-based interpretation of sensor data-the IUA system combines three heterogeneous levels of parallelism with associative processing mechanisms. The tightly coupled symbolic and numeric processing capabilities constitute a unique computing paradigm ideally suited to computer vision applications, which require both control- and data-parallel processing. The IUA architecture, hardware, and software are described.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116831696","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":"An architecture for multiresolution, focal, image analysis","authors":"P. Burt, G. V. D. Wal","doi":"10.1109/ICPR.1990.119374","DOIUrl":"https://doi.org/10.1109/ICPR.1990.119374","url":null,"abstract":"A segmented pipeline architecture for multiresolution, focal, array processing is presented. A buffer is introduced at each point in a pipeline computation at which changes in sample density or analysis area may take place. These buffers divide the pipeline into segments, each with constant data load. When active, a segment runs at its full design rate. Efficiency is maintained by switching processing elements between segments as image data flows through the system. The segmented pipeline architecture is illustrated with an application to image motion analysis.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"ii 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131051841","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":"Model-based segmentation and estimation of 3D surfaces from two or more intensity images using Markov random fields","authors":"Jayashree Subrahmonia, Y. Hung, D. Cooper","doi":"10.1109/ICPR.1990.118134","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118134","url":null,"abstract":"An approach and algorithm for 3D primitive model recognition, parameter estimation, and segmentation from a sequence of images taken by one or more calibrated cameras are presented. Though the approach and algorithm are applicable to more general models, the experiments described are for primitive objects that are 3D planes. Given two or more images taken by one or more calibrated cameras, the algorithm simultaneously segments the images and 3D space into regions, each region associated with a single planar patch, and estimates the parameters of the 3D plane associated with each segmented region. The algorithm is suitable for parallel processing and should function at close to the best possible accuracy. Markov random fields are used to provide very coarse prior knowledge of the regions occupied by the planar patches, resulting in markedly enhanced accuracy.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132878172","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":"Segmentation and feature extraction for magnetic resonance brain image analysis","authors":"I. Kapouleas","doi":"10.1109/ICPR.1990.118169","DOIUrl":"https://doi.org/10.1109/ICPR.1990.118169","url":null,"abstract":"A segmentation method developed for a system which analyzes magnetic resonance brain images is described. Consideration is also given to how the results of the segmentation method are used to successively identify the brain, suspected lesions, and the interhemispherical fissure, as well as to how these landmarks are used to determine automatically the orientation of a patient brain in 3-D. It is explained how all of the above are used in conjunction with a deformable 3-D model of the relevant brain anatomy to locate lesions in those images. The methods have been tested on more than 1000 images from 17 patients with multiple sclerosis: however, they can also be used in other radiologic tasks.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128188569","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}