{"title":"Estimating the phase congruency of localised frequencies","authors":"P. J. Myerscough, M. Nixon","doi":"10.1109/ICIP.2004.1418743","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418743","url":null,"abstract":"Phase congruency is a new method for detecting features in images. One of its significant strengths is its invariance to lighting variation within an image, as well as being able to detect a wide range of interesting features. We present a method for estimating the phase congruency of localised frequencies that cannot be measured separately by Gabor filters. We show that by measuring the ratio of the standard deviation to the mean energy between different phase shifted Gabor filters we are able to estimate whether the localised frequencies are phase congruent. We then show example results from applying this estimation procedure to a set of images. We also show improvements when compared to another phase congruency detector. We conclude that the concept of estimating the phase congruency of localised features is possible, but more work is needed to mature the technique to a robust feature detector.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"856 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275251","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}
F. Zhai, Y. Eisenberg, T. Pappas, R. Berry, A. Katsaggelos
{"title":"An integrated joint source-channel coding framework for video transmission over packet lossy networks","authors":"F. Zhai, Y. Eisenberg, T. Pappas, R. Berry, A. Katsaggelos","doi":"10.1109/ICIP.2004.1421618","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421618","url":null,"abstract":"The problem of application-layer error control for real-time video transmission over packet lossy networks is commonly addressed by joint source-channel coding (JSCC). The traditional JSCC approaches solve this problem in a sequential manner, where source coding and channel coding are not fully integrated. In this paper, we present an integrated joint source-channel coding (IJSCC) framework, where error resilient source coding, channel coding and error concealment are jointly considered in an integrated manner. We show through both analysis and simulations the advantages of the proposed IJSCC approach, in comparison to a sequential JSCC approach.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126506948","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":"Proposal of the hybrid spectral gradient method to extract character/text regions from general scene images","authors":"Yoichiro Baba, A. Hirose","doi":"10.1109/ICIP.2004.1418727","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418727","url":null,"abstract":"We propose a spectral gradient method that is a novel method to extract character/text regions from general scene images. We obtain the distribution of the degree of likelihood of character/text regions by calculating the spatial variation of texture. We evaluate the texture variation by the gradient of local spatial spectra. A characteristic Fourier transform process, named hybrid spectral gradient method, is also developed to achieve a high extraction performance. This method is based on human foveation and can be applied for a wide range of languages and letters.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128109423","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":"Hyperspectral target detection using kernel matched subspace detector","authors":"H. Kwon, N. Nasrabadi","doi":"10.1109/ICIP.2004.1421826","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421826","url":null,"abstract":"In this paper we present a nonlinear realization of a subspace signal detection approach based on the generalized likelihood ratio test (GLRT) - so called matched subspace detectors (MSD). The linear model for MSD is first extended to a high, possibly infinite, dimensional feature space and then the corresponding nonlinear GLRT expression is obtained. In order to address the intractability of the GLRT in the nonlinear feature space we kernelize the nonlinear GLRT using kernel eigenvector representations as well as the kernel trick where dot products in the nonlinear feature space are implicitly computed by kernels. The proposed kernel-based nonlinear detector, so called kernel matched subspace detector (KMSD), is applied to a given hyperspectral imagery - HYDICE (hyperspectral digital imagery collection experiment) images - to detect targets of interest. KMSD showed superior detection performance over MSD for the HYDICE images tested in this paper.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128125724","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":"Error-resilient wireless video transmission using motion-based unequal error protection and intraframe packet interleaving","authors":"Q. Qu, Y. Pei, J. Modestino, Xusheng Tian","doi":"10.1109/ICIP.2004.1419429","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419429","url":null,"abstract":"Packet video transmission over wireless networks is expected to experience packet losses due to noise, interference, multipath and the motion of mobile hosts. Such packet losses often occur in bursts which may cause substantial degradation to the transmitted video quality. In this paper, we propose the use of a cross-layer unequal error protection (UEP) approach which is achieved by assigning an unequal amount of forward error correction (FEC) to each group of link-layer packets according to the corresponding motion level of the slice acquired at the application layer. Also, a novel packetization scheme and an intraframe packet interleaving scheme are proposed to be used together with FEC/UEP in order to combat the bursty packet losses in 3G wireless environments. Our results demonstrate that the proposed approach is very effective in dealing with the packet losses occurring on wireless networks without incurring any additional implementation complexity or delay.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125728415","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":"Basis picking for matching pursuits image coding","authors":"D. Monro","doi":"10.1109/ICIP.2004.1421609","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421609","url":null,"abstract":"The novel 'Basis Picking' algorithm is applied to select dictionaries of 1D basis functions for coding of image data by Matching Pursuits. For both motion compensated residual images and normal still images, bases are picked with a hybrid Wavelet/Matching Pursuits image codec using 1D scanning. By successively adding bases one at a time from a set of 1289 candidates according to their ranked signal to residual ratio (SRR) performance, effective codebooks are constructed. These outperform traditional selection by ranked frequency of use from the same candidate bases over a range of compressions of both residuals and still images. This holds for both the training sets used for picking and other test images. Picked bases are also capable of good quality compression of still images, which was not previously thought to be feasible by matching pursuits.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918279","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 wavelet difference reduction (MWDR) video codec","authors":"Y. L. Law, Truong Q. Nguyen","doi":"10.1109/ICIP.2004.1421559","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421559","url":null,"abstract":"In this paper, a new fast video codec using Wavelet Difference Reduction (WDR) algorithm is presented. This proposed video codec is inspired by the concept of motion JPEG; namely, we adapted the efficient WDR still image compression algorithm into a video compression algorithm without the motion estimation step. This approach significantly reduces the processing time for motion vector search and motion compensation procedures. In addition, we employ block-based WDR algorithm which significantly reduces the memory requirement while comparing to other wavelet based compression algorithm.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121725810","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 face image recognition scheme with strong tolerances to lighting fluctuations","authors":"Kenji Matsuo, M. Hashimoto, A. Koike","doi":"10.1109/ICIP.2004.1421471","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421471","url":null,"abstract":"In this paper, we propose a face recognition scheme that has strong tolerances to changes in the lighting environment. The current spread of cellular phones with camera devices has made biometric certification of face images possible, without adding extra devices. However, face images taken via cellular phones are fluctuated by lighting environments, because cellular phones are used both indoors and outdoors without limit. Therefore, the most serious problem is that lighting fluctuations decrease its recognition accuracy. Our proposed scheme is very simple. This scheme uses the lighting canonical space and creates a virtual subspace that contains various elements of lighting, without actually taking many face images under different environments. Simulation results show the proposed scheme can achieve not only a lower equal-error-rate of verification, but also higher precision of identification than the conventional subspace scheme.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121747474","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 energy-based framework using global spatial constraints for the stereo correspondence problem","authors":"Pierre-Marc Jodoin, M. Mignotte","doi":"10.1109/ICIP.2004.1421744","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421744","url":null,"abstract":"This paper investigates the use of a region-based approach for the stereo matching problem. We have stated this problem in a commonly adopted global energy-based framework. Our energy-based model mixes a local and robust regularization term with global spatial constraints. These constraints are related to a (precomputed) partition into homogeneous regions with identical disparity. In practice, our approach assigns a single disparity to regions instead of individual pixels. These regions, used to globally constrain the ill-posed nature of our minimization problem, are estimated by combining an unsupervised Markovian segmentation and a roughly estimated disparity map. This disparity map is computed with a basic winner-take-all (WTA) procedure. The proposed global energy function seems to be well suited to find good disparity discontinuities at object boundaries, especially when the number of disparities is large. An iterated conditional modes (ICM) algorithm is used to optimize this global energy function. We provide experimental results on real stereo image pairs. A quality measure, based on ground truth data, is used to evaluate the performance of our algorithm. Results indicate that our approach is fast and performs well compared to other existing methods.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121778976","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":"Evolutionary Gibbs sampler for image segmentation","authors":"Xiao Wang, Han Wang","doi":"10.1109/ICIP.2004.1421864","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421864","url":null,"abstract":"We propose a novel evolutionary algorithm for the function optimization problem in Bayesian image segmentation with Markov random field prior. Function variables are partitioned into several codings. A pivot coding is selected and variables in it are evolved respectively according to their probability distributions which encode both the evolutionary pressure and contextual constraints from neighboring pixels. Variables in other codings are evolved according to their conditional probabilities. In summary, the algorithm is about building probabilistic models to guide search. It achieves the efficiency and flexibility by incorporating Gibbs sampler in an evolutionary approach. Remarkable performance is observed in some experiments.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115828931","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}