By Topic

Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)

7-10 Oct. 2001

Go

Filter Results

Displaying Results 1 - 25 of 283
  • Proceedings 2001 International Conference On Image Processing [front matter]

    Publication Year: 2001, Page(s):i - lxx
    Request permission for commercial reuse | PDF file iconPDF (4876 KB)
    Freely Available from IEEE
  • Memory hierarchy exploration for low power architectures in embedded multimedia applications

    Publication Year: 2001, Page(s):326 - 329 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB) | HTML iconHTML

    Multimedia applications are characterized by an increased number of data transfer and storage operations due to real time requirements. Appropriate transformations can be applied at the algorithmic level to improve crucial implementation characteristics. The effect of the data-reuse transformations on power consumption, area and performance of multimedia applications realized on embedded cores is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-resilient mobile video by edge adapted multiscale transforms

    Publication Year: 2001
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (73 KB) | HTML iconHTML

    Summary form only given, as follows. Mobile video systems face particularly challenging problems due to the hostile nature of the mobile radio channel and the very low bit-rate available. For the fading channel, the Shannon separation principle does not hold, and hence source and channel coding should be considered jointly. This talk reviews some advances in our work on joint optimization of video... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparison of MPEG-4 scalable and non-scalable video streaming

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (31 KB)

    Summary form only given, as follows. We first show that 3G wireless multimedia systems adopting scalable video encoding can achieve higher overall network utilization. Moreover, the problems of both packet loss and player rebuffering can degrade wireless streaming performance if the streaming video is non-scalable due to fading/retransmission and multi-user sharing. We demonstrate that these probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless video-do standards matter?

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    Summary form only given, as follows. It is usually assumed that standards are an essential prerequisite for the exchange of various types of data, not least video. For as long as codecs have necessarily been implemented in dedicated hardware this has been true. Now, however, the ground-rules are changing rapidly. General-purpose processors are becoming more powerful but less power hungry. Java is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization and navigation in image database applications based on MPEG-7 descriptors

    Publication Year: 2001
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (31 KB)

    Summary form only given, as follows. The MPEG-7 standard is currently being developed to specify standardized interfaces that help users or agents to identify, filter, browse and efficiently retrieve audio-visual material. The purpose of the presentation is to provide an overview of the scope and potential of the MPEG-7 standard, with particular emphasis on no-text descriptors for visual content. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2001, Page(s):1111 - 1127
    Request permission for commercial reuse | PDF file iconPDF (1604 KB)
    Freely Available from IEEE
  • SADWT for efficient mesh based video coding

    Publication Year: 2001, Page(s):122 - 125 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    The application of SADWT (shape adaptive discrete wavelet transform) has been widely proposed for object-oriented video coding, making it possible to transform and code the arbitrarily-shaped regions obtained by a segmentation of the scene content (which are usually objects in the sense of being a visually observable part of the image context). We present an application which is not restricted to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new perceived motion based shot content representation

    Publication Year: 2001, Page(s):426 - 429 vol.3
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    Motion information is an important cue for humans to perceive video content. However, it is hard to use motion in video retrieval due to the lack of effective representation. In this paper, we propose a perceived motion based shot content representation, perceived motion energy spectrum (PMES), for content-based video retrieval. The human perceivable motion regions or objects can be detected direc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New algorithms for computing directional discrete Fourier transforms

    Publication Year: 2001, Page(s):322 - 325 vol.3
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    New algorithms for computing the discrete Fourier transform (DFT) spectra along different directions are derived and implemented. For computing the DFT spectrum along any given direction (containing N DFT frequencies), a new algorithm is presented that requires N(N-1) additions and a single 1-D FFT. As expected, for a single direction, the directional FFT algorithm is significantly faster than sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical watermarking depending on local constraints

    Publication Year: 2001, Page(s):1011 - 1014 vol.3
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    We propose a new watermarking technique where the watermark is embedded according to two keys. The first key is used to embed a code bit in a block of pixels. The second is used to generate the whole sequence of code bits The watermark is embedded in spatial domain by adding or subtracting a random digital pattern to the given image signal. The embedding depth level depends on the spectral density... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information extraction method without original image using turbo code

    Publication Year: 2001, Page(s):880 - 883 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    This paper proposes a meaningful information extraction method using a channel code as a specific means for protecting copyright ownership without using the original image. The proposed scheme utilizes a bit-oriented turbo code as channel code and is required by a central authority for copyright protection from fake information. In simulation, we identify that the proposed system is very robust to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape-preserving progressive coding of 3D models

    Publication Year: 2001, Page(s):118 - 121 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    We propose a shape-preserving progressive coding scheme for 3D models, focusing on the visual quality of 3D meshes at low resolutions. In order to obtain good reconstruction quality of 3D meshes, we improve a mesh simplification method based on the quadric error metric (QEM) by assigning different weighting factors according to topological constraints. We also develop an efficient geometric predic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the size and shape of multi-level context templates for compression of map images

    Publication Year: 2001, Page(s):458 - 461 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    We present a method for estimating optimal context templates that are used for conditioning the pixel probabilities in context-based image compression. The algorithm optimizes the location of the context pixels within a limited neighborhood area, and produces an ordered template as a result. The ordering can be used to determine the shape of the context template for a given template size. The opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fusion of intensity and range data for improved 3D models

    Publication Year: 2001, Page(s):1107 - 1110 vol.3
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In this paper, we present techniques combining intensity and range data to achieve more realistic three-dimensional models from real world scenes. The principal novelty is the use of the intensity information not only for texturing the final 3D model but also to improve the segmentation of the range data. The technique registers video and range, i.e., the camera parameters are computed in order to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shot boundary detection with mutual information

    Publication Year: 2001, Page(s):422 - 425 vol.3
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    We present a novel approach for shot boundary detection that uses mutual information (MI) and affine image registration. The MI measures the statistical difference between consecutive frames, while the applied affine registration compensates for camera panning and zooming. Results for different sequences are presented to illustrate the motion and zoom compensation and the robustness of MI to illum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel approach of image compression in digital cameras with a Bayer color filter array

    Publication Year: 2001, Page(s):482 - 485 vol.3
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    We propose a new approach for image compression in digital cameras, where the goal is to achieve better quality at a given rate by using the characteristics of a Bayer color filter array. Most digital cameras produce color images by using one CCD plate and each pixel in an image has only one color component, so an interpolation method is needed to produce a full color image. After finishing an ima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting the complexity of signal processing algorithms

    Publication Year: 2001, Page(s):318 - 321 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Predicting the complexity of a signal processing task is a very difficult subject, mainly because the notion of complexity itself is not well defined. We propose to link the complexity to the predicted execution of an algorithm on a given platform or processor. To do so branches, arithmetic and memory operations are classified into different types of category. Then the number of time operations of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-error information hiding capacity of digital images

    Publication Year: 2001, Page(s):1007 - 1010 vol.3
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    We derive a theoretical capacity for digital image watermarking with zero transmission errors. We present three different discrete memoryless channel model to represent the watermarking process. Given the magnitude bound of noise set by applications and the acceptable watermark magnitude determined by the just-noticeable distortion, we estimate the zero-error capacity by applying Shannon's (1948) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized partial distortion search algorithm for block-matching motion estimation

    Publication Year: 2001, Page(s):510 - 513 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    Quality against speed control for real-time video applications, such as low-bit-rate video conferencing or high quality video entertainment, is usually absent from many traditional fast block motion estimators. A novel block-matching algorithm for fast motion estimation, named generalized partial distortion search algorithm (GPDS), is proposed. It uses a halfway-stop technique with progressive par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast affine projection algorithm for 2D filtering and linear prediction

    Publication Year: 2001, Page(s):876 - 879 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    A two-dimensional (2D) fast affine projection algorithm (FAPA) is presented for 2D adaptive filtering and linear prediction. The derivation of the proposed algorithm is based on the spatial shift invariant properties that 2D discrete time signals possess. The proposed algorithm has low computational complexity, comparable to that of the 2D LMS algorithm. The convergence speed and tracking ability ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified framework for wavelet transforms based on the lifting scheme

    Publication Year: 2001, Page(s):792 - 795 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    In the context of image coding, a number of reversible integer-to-integer wavelet transforms were previously proposed and compared with respect to their lossy compression performance, lossless compression performance, and computational complexity. Among the transforms, some of them were found to perform particularly well. In this paper, we propose a unified framework for several efficient transfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum discrimination information clustering: modeling and quantization with Gauss mixtures

    Publication Year: 2001, Page(s):14 - 17 vol.3
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Gauss mixtures have gained popularity in statistics and statistical signal processing applications for a variety of reasons, including their ability to approximate well a large class of interesting densities and the availability of algorithms such as EM for constructing the models based on observed data. We here consider a different motivation and framework based on the information theoretic view ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A message-based cocktail watermarking system

    Publication Year: 2001, Page(s):1035 - 1038 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    A noise-type Gaussian sequence is most commonly used as a watermark to claim ownership of media data. However, only a 1 bit information payload is carried in this type of watermark. For a logo-type watermark, the situation is better because it is visually recognizable and more information can be carried. However, since the sizes and shapes of logos for different organizations are different, the fl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint mesh and texture compression using marginal analysis

    Publication Year: 2001, Page(s):114 - 117 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    In many computer graphic applications, a texture is mapped onto a meshed surface. Under complexity constraints, both texture and mesh need to be approximated. We present a framework for the joint simplification of texture and mesh with respect to an error measure in screen space. In order to achieve optimal operating points, we choose two efficient simplification algorithms: optimal multiresolutio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.