{"title":"Performance evaluation of data hiding system using wavelet transform and error-control coding","authors":"N. Abdulaziz, K. K. Pang","doi":"10.1109/ICIP.2000.901031","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901031","url":null,"abstract":"This paper proposes an algorithm of data hiding for an image signal based on the wavelet transform and error-correcting codes. The data to be embedded, referred to as the signature data, are coded using error-correcting codes and the resulting code is hidden into the wavelet transformed coefficients of the host image in a vector based perturbation. When the amount of hidden data is large, as is the case when the signature data is an image, the signature data are first compressed using vector quantization and the indices obtained in the process are embedded. Information data are detected using both original and watermarked images. Simulation results demonstrate the high robustness of the algorithm to image degradations such as JPEG and additive noise.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127434415","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 appearance based neural image processing algorithm for 3-D object recognition","authors":"C. Yuan, H. Niemann","doi":"10.1109/ICIP.2000.899388","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899388","url":null,"abstract":"We propose an appearance based neural image processing algorithm for the recognition of 3-D objects with arbitrary pose in a 2-D image. Instead of object segmentation we utilize the wavelet transform to extract compact features for object representation. Translational invariance is achieved by using two neural network based object pose estimators to translate objects automatically to the image center. Based on these translation-invariant features a neural model is built to identify objects taken at different viewpoint and under different illumination condition. Results for the recognition of real images under occlusions are shown.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467660","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 retrieval based on edge representation","authors":"M. Abdel-Mottaleb","doi":"10.1109/ICIP.2000.899559","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899559","url":null,"abstract":"Content-based image retrieval from large collections of images is a challenging task; especially retrieval based on edges. We present a fast algorithm for image retrieval by sketch or image example. The images in the database are archived in a hash table, where the addresses of the entries in the table are derived from the edge orientations in predefined regions of the images. In the retrieval stage, images that have regions similar to the regions of the query image are retrieved from the hash table and a voting is performed to rank the images according to their similarity to the query. Experimental results show that the algorithm is robust.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130059086","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":"Robust estimation of motion and structure using a discrete H/sub /spl infin// filter","authors":"Gang Qian, A. Kale, R. Chellappa","doi":"10.1109/ICIP.2000.899529","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899529","url":null,"abstract":"In this paper a robust structure from motion (SfM) algorithm using a discrete H/sub /spl infin// filter is presented. Existing SfM algorithms do not work well when large motion or measurements modeling uncertainties are present. By using a H/sub /spl infin// filter these modeling uncertainties can be successfully handled. This algorithm has been tested on synthetic image sequences and results show the superiority of the H/sub /spl infin// filtering approach.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894566","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":"Optimal sampling in array-based image formation","authors":"Yun Gao, S. Reeves","doi":"10.1109/ICIP.2000.901063","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901063","url":null,"abstract":"In some types of imaging, the signal is strictly limited in one domain while sampling takes places in another. If sampling is done in a rectangular array pattern at sub-Nyquist density, the array must be dithered to sample the image at the Nyquist density in each dimension. However, the Nyquist density oversamples the image due to the nonrectangular support in the transform domain. We present an efficient algorithm for optimizing the dithering pattern so that the image can be reconstructed as reliably as possible from a periodic nonuniform set of samples, which can be obtained from a dithered rectangular-grid array. Taking into account the transform support of the image, we sequentially eliminate the least informative array recursively until the minimal number of arrays remain.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128902949","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 invariance of differential scale invariants","authors":"A. Siebert","doi":"10.1109/ICIP.2000.901068","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901068","url":null,"abstract":"Many geometric invariants have been reported in the literature. For two specific differential scale invariants we discuss the parameters involved and analyze the accuracy of their computation on real camera data. Our experimental data show significant errors in the observed values. Those errors seem to be inherent in the image formation and scaling process. They indicate the limitations of local differential computations and, more generally, the problems of synthetically scaled images as models for zoomed images.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130529408","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":"Adaptive target detection across a clutter boundary: GLR and maximally invariant detectors","authors":"Hyung Soo Kim, A. Hero","doi":"10.1109/ICIP.2000.901050","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901050","url":null,"abstract":"We present and compare adaptive detection algorithms developed for synthetic aperture radar (SAR) targets in structured clutter, utilizing both generalized likelihood ratio (GLR) tests and maximal invariant (MI) tests. We consider the problem of detecting a target straddling a known boundary between two independent clutter regions inducing a clutter covariance matrix with block diagonal structure. GLR and MI tests are presented for various clutter scenarios: two totally unknown clutter types, one of the clutter types known except for its variance, and one of the clutter types completely known. Numerical comparisons illustrate that GLR tests and MI tests are complementary-neither test strategy uniformly outperforms the other-suggesting that it may be worthwhile to hybridize these tests for overall optimal performance.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130775496","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":"VLSI implementation of a reduced memory bandwidth real-time EZW video coder","authors":"Yu Dong, R. Y. Omaki, T. Onoye, I. Shirakawa","doi":"10.1109/ICIP.2000.899311","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899311","url":null,"abstract":"The architecture of a real-time wavelet video coder is described, with the main emphasis put on the memory bandwidth reduction and efficient VLSI implementation. The proposed architecture adopts a modified 2D subband decomposition scheme, along with a parallelized pipelined embedded zerotree wavelet coder architecture. The video encoder is integrated in a 0.35 /spl mu/m 3LM chip by using 341000 transistors on a 4.93/spl times/4.93 mm/sup 2/ die, which can process 720/spl times/480 30 fps pictures in real-time.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128830100","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":"Simplification of a color image segmentation using a fuzzy attributed graph","authors":"H. Grecu, P. Lambert","doi":"10.1109/ICIP.2000.901011","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901011","url":null,"abstract":"A segmentation can be represented by a graph where each vertex corresponds to a region and where the arc between two vertices (i.e. two regions) denotes the connectivity between the two regions. Each vertex and each arc being characterized by a set of attributes (color attributes, geometrical attributes, ...), the first aim of the paper is to define a symbolic description for each attribute. Then, by using rule basis, the similarity between two adjacent regions is also described in a symbolic way. Finally, according to this similarity definition the graph is reduced to get a simplified segmentation. In the presented applications, it is shown that the simplification can be performed in different ways, depending on a the aim of the analysis.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128842575","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 new force field transform for ear and face recognition","authors":"David J. Hurley, M. Nixon, J. Carter","doi":"10.1109/ICIP.2000.900883","DOIUrl":"https://doi.org/10.1109/ICIP.2000.900883","url":null,"abstract":"The objective in defining feature space is to reduce the dimension of the original pattern space yet maintaining discriminatory power for classification. To meet this objective in the context of ear and face biometrics a novel force field transformation has been developed in which the image is treated as an array of Gaussian attractors that act as the source of a force field. The directional properties of the force field are exploited to automatically locate a small number of potential energy wells and channels that form the basis of a characteristic feature vector. Here, we generalise the analysis, and the stock of applications.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123354616","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}