{"title":"A feature tracking algorithm using neighborhood relaxation with multi-candidate pre-screening","authors":"Yen-kuang Chen, Yun-Ting Lin, S. Kung","doi":"10.1109/ICIP.1996.560904","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560904","url":null,"abstract":"Tracking of features in video sequences has many applications. Conventionally, the minimum displaced frame difference (referred to as DFD or residue) of a block of pixels is used as the criterion for tracking in block-matching algorithms (BMA). However, such a criterion often misses the true motion vectors, due to many practical factors, e.g. affine warping, image noise, object occlusion, lighting variation, and existence of multiple minimal DFD. Our goal is to find motion vectors of the features for object-based motion tracking, in which (1) any region of an object contains a good number of blocks, whose motion vectors exhibit certain consistency; and (2) only true motion vectors for a few blocks per region are needed. Hence, we propose a new tracking method. (1) At the outset, we disqualify some of the reference blocks which are considered to be unreliable to track. (2) We adopt a multi-candidate pre-screening to provide some robustness in selecting motion candidates. (3) Assuming the true motion field is piecewise continuous, we determine the motion of a feature block by consulting all its neighboring blocks' directions. This allows for the chance that a singular and erroneous motion vector may be corrected by its surrounding motion vectors (just like median filtering). Our method is also designed for tracking more flexible affine-type motions, such as rotation, zooming, sheering, etc. Finally, the performance improvement over other existing methods is demonstrated.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127983687","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 the information-theoretic assessment of visual communication","authors":"F. O. Huck, C. L. Fales, Z. Rahman","doi":"10.1109/ICIP.1996.560873","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560873","url":null,"abstract":"This paper deals with the extension of information theory to the assessment of visual communication from scene to observer. The mathematical development rigorously unites the electro-optical design of image gathering and display devices with the digital processing algorithms for image coding and restoration. Results show that: end-to-end system analysis closely correlates with measurable and perceptual performance characteristics, such as data rate and image quality, respectively. The goal of producing the best possible image at the lowest data rate can be realized only if (a) the electro-optical design of the image-gathering device is optimized for the maximum-realizable information rate and (b) the image-restoration algorithm properly accounts for the perturbations in the visual communication channel.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128192122","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 model based method for the quantizer assignment of JPEG-like coders","authors":"Kwangseok Yoo, Jinho Choi","doi":"10.1109/ICIP.1996.559471","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559471","url":null,"abstract":"In most coding systems, for image or audio signals, the bit allocation or quantization assignment problem is one of the important issues to minimize the distortion for a given bit budget. By exploiting the empirical distortion-quantization and rate-quantization relations, we propose a model based bit allocation method for JPEG-like coders. The empirical relations have been established using the regression technique which provides a low computational complexity to construct the preprocessing for the bit allocation. From the empirical relations, we can establish the modeling for the distortion-quantization and rate-quantization relations. Using the model, we simplify the problem of the quantization assignment and then obtain an efficient method for solving the simplified problem.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121749407","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":"Image blur identification by using higher order statistic techniques","authors":"Xu You, G. Crebbin","doi":"10.1109/ICIP.1996.560373","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560373","url":null,"abstract":"In this paper, higher order statistic (HOS) based blur identification methods are proposed to estimate blur coefficients in image restoration, in which the image is considered as a colored process. One dimensional (1-D) based blur identification algorithms are proposed, and their extensions to two dimensional (2-D) cases are discussed. The experimental results are presented to demonstrate the performance of the proposed methods in this paper.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115914415","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":"Multi-level based stereo line matching with structural information using dynamic programming","authors":"Raymond K. K. Yip, W. Ho","doi":"10.1109/ICIP.1996.560826","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560826","url":null,"abstract":"In this paper, dynamic programming is used to solve the correspondence problem in stereo vision. A multi-level matching technique is used so as to improve the accuracy of the matching process between the left and right images. The method first matches those that have a similarity larger than a threshold T/sub 1/. In the second match, a lower threshold T/sub 2/ is used and all previous matched pairs are used to provide structural information in measuring the similarity. The matched results are then updated and the process is repeated until a predefined level n is reached. The proposed method uses the multi-level matching technique so as to reduce the errors of missed matches due to imperfect feature extraction such as missing lines and broken lines. The algorithm has been tested on real scenes to confirm the usefulness of the proposed method.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115947352","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":"Regularization of the problem of image restoration from its noisy Fourier transform phase","authors":"I. Lyuboshenko, A. M. Akhmetshin","doi":"10.1109/ICIP.1996.559618","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559618","url":null,"abstract":"In all papers published earlier the phase of the Fourier transform of an image was assumed to be known exactly. This assumption, however, is not valid in practice, since the image phase can be measured or processed only with some error. Owing to the essentially ill-posed nature of the restoration problem this error results in substantial undesired fluctuations in the solution, obtained both by known iterative and direct approaches. In this paper, the problem of restoration of images from their Fourier transform phases is considered as the ill-posed one that calls for using the corresponding regularization algorithms. The regularization algorithm is proposed that significantly improves an estimate of an image restored from the noisy phase.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132238791","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":"Image enhancement based on signal subspace approach","authors":"Ki-Seung Lee, Won Doh, Kun Jong Park, D. Youn","doi":"10.1109/ICIP.1996.559614","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559614","url":null,"abstract":"A newly developed image enhancement algorithm is described in this contribution. The proposed algorithm makes use of the signal subspace method to enhance images corrupted by uncorrelated additive noise. This enhancement is performed by eliminating the noise subspace and estimating clean image from the remaining signal subspace. We propose the block-adaptive Wiener filtering which engages properties of the human visual system to estimate clean image. This criterion enables one to not only preserve the detailed structure of the given image, but to reduce the level of background noise as well. Subjective evaluation tests show the superiority of the method proposed here. In particular, edge blurring effects are noticeably reduced compared to the conventional methods.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132250535","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":"Automatic construction of image transformation processes using genetic algorithm","authors":"T. Nagao, S. Masunaga","doi":"10.1109/ICIP.1996.560795","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560795","url":null,"abstract":"A method to approximate the image transformation from an original image to its ideally processed target image by a sequence of several image transformation filters is proposed in this paper. The ideally processed image is assumed to be generated manually by the use of drawing software. In this method, the order of applying image transformation filters is determined by a genetic algorithm. This method can be applied to construction of an expert system for image processing.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132370925","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":"Recursive map displacement field estimation and its applications","authors":"J. Brailean, A. Katsaggelos","doi":"10.1109/ICIP.1996.559649","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559649","url":null,"abstract":"We briefly describe some of our work on the use of stochastic models to describe the displacement vector field (DVF) in an image sequence. Specifically, autoregressive models are used which describe the abrupt transitions in the DVF with the use of a line process, but also result in spatio-temporally recursive structures. The use of such models in developing maximum a posteriori estimators for the DVF and the line process is subsequently described. Finally, the extension and application of the resulting estimator to the problems of object tracking, video compression and restoration of video sequences is reviewed.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132469849","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":"Motion-based segmentation and tracking of dynamic radar clutters","authors":"F. Barbaresco, S. Bonney, J. Lambert, B. Monnier","doi":"10.1109/ICIP.1996.560944","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560944","url":null,"abstract":"The aim of this study is to perform a classification and a short term spatial estimation of radar clutter. Motion-based segmentation allows one to part clutter into two sets: the static ones and the dynamic ones. A spatial segmentation can then be processed, using Doppler data, in order to obtain homogeneous clutter. The dynamic clutter can be tracked by means of adaptive algorithms based on new techniques such as active contours, front propagation combined with Kalman filtering and motion estimation. The efficiency of our methods is demonstrated on atmospheric clutter in meteorological radar images.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132529831","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}