{"title":"Watermarking color histograms","authors":"S. Roy, E. Chang","doi":"10.1109/ICIP.2004.1421531","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421531","url":null,"abstract":"In this paper we give a method for watermarking color histograms. Color histograms have been known M. J. Swain et al., (1991) to be robust to rotations and other geometric transformations. If the watermark can be embedded in such geometry invariant representations it should survive geometric transformations. The difficulty in watermarking color histograms is that they have a nonlinear relationship with the pixel representation. Therefore it is not clear how to get a watermarked image given its watermarked histogram. We give a method for watermarking color histograms that uses earth mover distance (EMD) to modify an image to a target histogram. We conduct extensive experiments to test our method.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"10 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":"130762985","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 studies on LDA for face recognition","authors":"Juwei Lu, K. Plataniotis, A. Venetsanopoulos","doi":"10.1109/ICIP.2004.1418690","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418690","url":null,"abstract":"It is well-known that the applicability of linear discriminant analysis (LDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the so-called \"small sample size\" (SSS) problem arising from the small number of available training samples compared to the dimensionality of the sample space. In this paper, we propose a new LDA method that effectively addresses the SSS problem using a regularization technique. In addition, a scheme of expanding the representational capacity of the face database is introduced to overcome the limitation that the LDA based algorithms require at least two samples per class available for learning. Extensive experimentation performed on the FERET database indicates that the proposed methodology outperforms traditional methods such as eigenfaces and direct LDA in a number of SSS setting scenarios.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"18 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":"130716242","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 approach to automatic music video summarization","authors":"Xi Shao, Changsheng Xu, M. Kankanhalli","doi":"10.1109/ICIP.2004.1418832","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418832","url":null,"abstract":"A new automatic summarization approach for music videos is presented. The proposed method detects and recognizes lyric captions appearing commonly in karaoke music videos and uses the captions to analyze music video structure and identify the most salient music part. The music video summary is created based on the salient part. Experimental results show our proposed method is promising.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"35 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":"132822543","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}
Iasonas Kokkinos, Georgios Evangelopoulos, P. Maragos
{"title":"Modulation-feature based textured image segmentation using curve evolution","authors":"Iasonas Kokkinos, Georgios Evangelopoulos, P. Maragos","doi":"10.1109/ICIP.2004.1419520","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419520","url":null,"abstract":"In this paper we incorporate recent results from AM-FM models for texture analysis into the variational model of image segmentation and examine the potential benefits of using the combination of these two approaches for texture segmentation. Using the dominant components analysis (DCA) technique we obtain a low-dimensional, yet rich texture feature vector that proves to be useful for texture segmentation. We use an unsupervised scheme for texture segmentation, where only the number of regions is known a-priori. Experimental results on both synthetic and challenging real-world images demonstrate the potential of the proposed combination.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"75 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":"133507845","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 resizing images in the DCT domain","authors":"C. Salazar-Lazaro, T. Tran","doi":"10.1109/ICIP.2004.1421685","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421685","url":null,"abstract":"This paper presents a general method for producing a mapping from the DCT domain to another DCT domain that results in an image that has been resized in the spatial dimension. Although the mapping is implemented entirely in the DCT domain, it can be thought of as a transformation into the spatial domain using a combined inverse DCT and resizing operator followed by a combined forward DCT and another resizing operator. Final image quality can be traded off for lower implementation complexity and a wide range of complexity versus final quality operation points can be chosen for each scale factor. Current existing methods often suffer from a lack of flexibility (i.e. work for only one or at most a few resizing factors, have only one or two levels of complexity) or require more operations to achieve similar levels of final image quality. When constructing the mapping, a multiplierless DCT approximation can be used for fast implementation with excellent results. The use of the DCT approximation confers several benefits upon the proposed mapping including multiplierless implementation or at most integer rather than floating point operations.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"1 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":"133514617","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":"Fast alignment of digital images using a lower bound on an entropy metric","authors":"M. Sabuncu, P. Ramadge","doi":"10.1109/ICIP.2004.1421454","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421454","url":null,"abstract":"We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edge alignment, is fast to compute, and compares well in experiments with competing approaches.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"7 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":"133269406","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":"ISAR - radar imaging of targets with complicated motion","authors":"T. Sparr","doi":"10.1109/ICIP.2004.1418675","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418675","url":null,"abstract":"ISAR imaging is described for general motion of a radar target. ISAR imaging may be seen as a 3D to 2D projection, and the importance of the ISAR image projection plane is stated. For general motion, ISAR images are often smeared when using FFT processing. Time frequency methods are used to analyze such images, and to form sharp images. A given smeared image is shown to be the result of changes both in scale and in the projection plane orientation.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"46 1 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":"132687800","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":"Generic method for 2D image resizing with non-separable filters","authors":"C. Hentschel","doi":"10.1109/ICIP.2004.1421387","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421387","url":null,"abstract":"2D image resizing is an important issue for pixel oriented displays with variable input formats. Low-resolution pictures look bad on high-resolution screens, especially when only simple up-conversion methods like pixel and line repetition or bi-linear interpolation are used. Even when applying separable polyphase up-conversion filters, the problem of jagged lines (staircases) remains. The approach investigated for high-quality resizing by rational factors is based on pixel and line repetition with suitable post-filtering. The novel resizing method uses very simple, non-separable filters, and is suitable for all kinds of image and video material such as analog sources (PAL, NTSC), digital sources (JPEG, MPEG), low-resolution up to high-resolution images, and noisy pictures. Jagged lines can be smoothened perfectly.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"36 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":"128835420","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":"Joint server/peer receiver-driven rate-distortion optimized video streaming using asynchronous clocks","authors":"Danjue Li, Gene Cheung, C. Chuah, S. Yoo","doi":"10.1109/ICIP.2004.1421781","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421781","url":null,"abstract":"This paper proposes a joint server/peer video streaming architecture for wireless networks, where a receiver can access a video server via an access point using the infrastructure mode and at the same lime communicate with its peers using the ad hoc mode of its IEEE 802.11 interface card. We introduce a joint infrastructure/peer-to-peer, receiver-driven streaming scheme, and formulate it as a combinatorial optimization problem. We decouple the problem into two steps: first selecting the sender (server or peer) by introducing asynchronous clocks, and then applying point-to-point rate-distortion optimization algorithm between a specific sender-receiver pair. Simulation results show that our joint approach has better performance than those systems with single server or with round-robin selection scheme.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"1 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":"134492639","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":"Subjective assessment of H.264-AVC video for low-bitrate multimedia messaging services","authors":"P. Brun, G. Hauske, T. Stockhammer","doi":"10.1109/ICIP.2004.1419506","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419506","url":null,"abstract":"In this work we investigate the performance of the H.264/AVC video coding standard for low bit rate mobile multimedia messaging services (MMS). We focus on the appropriate selection of the quantization parameter and the temporal resolution. For this purpose, a psychovisual experiment has been designed. It is revealed that only limited set of parameter values is necessary to span almost the entire range of quality levels. In general quantization parameters of 34 frame rates of 10 fps and bit rates below 64 kbit/s are sufficient to provide good quality. Sports sequences ask for slightly higher frame rate, 15 fps is sufficient. To provide sufficient quality, quantization parameters below 40 and frame rates below 5 fps should definitely not be used.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"54 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":"127059084","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}