Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 734 dari 34197, Total: 341964 data)

Computerized Tomography and Reproducing Kernels

Nama Pengarang : Ho Yun, Victor M. Panaretos
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 67 (No. 2)
Nomor Halaman : 321-350
Abstraksi Narasi : In this review paper, we provide an overview of numerical methods used in the study of the Gross–Pitaevskii eigenvalue problem (GPEVP). The GPEVP is an important nonlinear Schrödinger equation that is used in quantum physics to describe the ground states of ultracold bosonic gases. The discretization of the GPEVP leads to a nonlinear eigenvalue problem with eigenvector nonlinearities. The rich variety of numerical techniques in the literature for tackling the GPEVP has ingredients from linear algebra, partial differential equations, and numerical optimization as well as gradient flows on Riemannian manifolds. We review this heterogeneous body of literature with a focus on a unified treatment of seemingly different approaches, algorithms, and method properties, and we point to open problems and future challenges in the field.

The Gross Pitaevskii Equation and Eigenvector Nonlinearities: Numerical Methods and Algorithms

Nama Pengarang : Patrick Henning, Elias Jarlebring
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 67 (No. 2)
Nomor Halaman : 256-317
Abstraksi Narasi : In this review paper, we provide an overview of numerical methods used in the study of the Gross–Pitaevskii eigenvalue problem (GPEVP). The GPEVP is an important nonlinear Schrödinger equation that is used in quantum physics to describe the ground states of ultracold bosonic gases. The discretization of the GPEVP leads to a nonlinear eigenvalue problem with eigenvector nonlinearities. The rich variety of numerical techniques in the literature for tackling the GPEVP has ingredients from linear algebra, partial differential equations, and numerical optimization as well as gradient flows on Riemannian manifolds. We review this heterogeneous body of literature with a focus on a unified treatment of seemingly different approaches, algorithms, and method properties, and we point to open problems and future challenges in the field.

Multiobjective Optimization Using the R2 Utility

Nama Pengarang : Ben Tu, Nikolas Kantas, Robert M. Lee, Behrang Shafei
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 67 (No. 2)
Nomor Halaman : 213-255
Abstraksi Narasi : The goal of multiobjective optimization is to identify a collection of points which describe the best possible trade-offs among the multiple objectives. In order to solve this vector-valued optimization problem, practitioners often appeal to the use of scalarization functions in order to transform the multiobjective problem into a collection of single-objective problems. This set of scalarized problems can then be solved using traditional single-objective optimization techniques. In this paper, we formalize this convention into a general mathematical framework. We show how this strategy effectively recasts the original multiobjective optimization problem into a single-objective optimization problem defined over sets. An appropriate class of objective functions for this new problem is that of the R2 utilities, which are utility functions that are defined as a weighted integral over the scalarized optimization problem. As part of our work, we show that these utilities are monotone and submodular set functions that can be optimized effectively using greedy optimization algorithms. We then analyze the performance of these greedy algorithms both theoretically and empirically. Our analysis largely focuses on Bayesian optimization, which is a popular probabilistic framework for black-box optimization.

Vector-based signal processing and quantization for image and video compression

Nama Pengarang : -
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 317-335
Abstraksi Narasi : Image and video compression has become an increasingly important and active area. Many techniques have been developed in this area. Any compression technique can be modeled as a three-stage process. The first stage can be generally called a signal processing stage where an image or video signal is converted into a different domain. Usually, there is no or little loss of information in this stage. The second stage is quantization where loss of information occurs. The third stage is lossless coding that generates the compressed bit stream. The purpose of the signal processing stage is to convert an image or video signal into such a form that quantization can achieve better performance than without the signal processing stage. Because the quantization stage is the place where most of compression is achieved and loss of information occurs, it is naturally the central stage of any compression technique. Since scalar quantization or vector quantization may be used in the second stage, the operation in the first stage should be scalar-based or vector-based respectively in order to match the second stage so that the compression performance can be optimized. In this paper, we summarize the most recent research results on vector-based signal processing and quantization techniques that have shown high compression performance.

Image and video compression algorithms based on recovery techniques using mean field annealing

Nama Pengarang : -
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 304-316
Abstraksi Narasi : Image and video coding algorithms have found a number of applications ranging from video telephony on the public switched telephone networks (PSTN) to HDTV. However, as the bit rate is lowered, most of the existing techniques, as well as current standards, such as JPEG, H. 261, and MPEG-1 produce highly visible degradations in the reconstructed images primarily due to the information loss caused by the quantization process. In this paper, we propose an iterative technique to reduce the unwanted degradations, such as blocking and mosquito artifacts while keeping the necessary detail present in the original image. The proposed technique makes use of a priori information about the original image through a nonstationary Gauss-Markov model. Utilizing this model, a maximum a posteriori (MAP) estimate is obtained iteratively using mean field annealing. The fidelity to the data is preserved by projecting the image onto a constraint set defined by the quantizer at each iteration. The proposed solution represents an implementation of a paradigm we advocate, according to which the decoder is not simply undoing the operations performed by the encoder, but instead it solves an estimation problem based on the available bitstream and any prior knowledge about the source image. The performance of the proposed algorithm was tested on a JPEG, as well as on an H.261-type video codec. It is shown to be effective in removing the coding artifacts present in low bit rate compression.

Neural network approaches to image compression

Nama Pengarang : -
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 288-303
Abstraksi Narasi : This paper presents a tutor a overview of neural networks as signal processing tools for image compression. They are well suited to the problem of image compression due to their massively parallel and distributed architecture. Their characteristics are analogous to some of the features of our own visual system, which allow us to process visual information with much ease. For example, multilayer perceptions can be used as nonlinear predictors in differential pulse-code modulation (DPCM). Such predictors have been shown to increase the predictive gain relative to a linear predictor. Another active area of research is in the application of Hebbian learning to the extraction of principal components, which are the basis vectors for the optimal linear Karhunen-Loeve transform (KLT). These learning algorithms are iterative, have some computational advantages over standard eigendecomposition techniques, and can be made to adapt to changes in the input signal. Yet another model, the self-organizing feature map (SOFM), has been used with a great deal of success in the design of codebooks for vector quantization (VQ). The resulting codebooks are less sensitive to initial conditions than the standard LBG algorithm, and the topological ordering of the entries can be exploited to further increasing the coding efficiency and reducing the computational complexity.

High compression image coding using an adaptive morphological subband decomposition

Nama Pengarang : S. Sunarto Ndaru Mursito
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 272-287
Abstraksi Narasi : A morphological subband decomposition with perfect reconstruction is proposed. Critical subsampling is achieved. The reconstructed images using this decomposition do not suffer from any ringing effect. In order to avoid poor texture representation by the morphological filters an adaptive subband decomposition is introduced. It chooses linear filters on textured regions and morphological filters otherwise. A simple and efficient texture detection criterion is proposed and applied to the adaptive decomposition. Comparisons to other coding techniques such as JPEG and linear subband coding show that the proposed scheme performs significantly better both in terms of PSNR and visual quality.

Model-based image coding advanced video coding techniques for very low bit-rate applications

Nama Pengarang : -
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 259-271
Abstraksi Narasi : The paper gives an overview of model-based approaches applied to image coding, by looking at image source models. In these model-based schemes, which are different from the various conventional waveform coding methods, the 3-D properties of the scenes are taken into consideration. They can achieve very low bit rate image transmission. The 2-D model and 3-D model based approaches are explained. Among them, a 3-D model based method using a 3-D facial model and a 2-D model based method utilizing 2-D deformable triangular patches are described. Works related to 3-D model-based coding of facial images and some of the remaining problems are also described.

JAGUAR: a fully pipelined VLSI architecture for JPEG image compression standard

Nama Pengarang : -
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 247-258
Abstraksi Narasi : In this paper, we describe a fully pipelined single chip VLSI architecture for implementing the JPEG baseline image compression standard. The architecture exploits the principles of pipelining and parallelism to the maximum extent in order to obtain high speed and throughput. The architecture for discrete cosine transform and the entropy encoder are based on efficient algorithms designed for high speed VLSI implementation. The entire architecture can be implemented on a single VLSI chip to yield a clock rate of about 100 MHz which would allow an input rate of 30 frames per second for 1024/spl times/1024 color images.

VLSI architectures for video compression-a survey

Nama Pengarang : -
Nama Majalah/Jurnal : Proceedings of the IEEE
Volume / Nomor Edisi : 83-2, FEBRUARY (No. 2)
Nomor Halaman : 220-246
Abstraksi Narasi : The paper presents an overview on architectures for VLSI implementations of video compression schemes as specified by standardization committees of the ITU and ISO. VLSI implementation strategies are discussed and split into function specific and programmable architectures. As examples for the function oriented approach, alternative architectures for DCT and block matching will be evaluated. Also dedicated decoder chips are included Programmable video signal processors are classified and specified as homogeneous and heterogenous processor architectures. Architectures are presented for reported design examples from the literature. Heterogenous processors outperform homogeneous processors because of adaptation to the requirements of special, subtasks by dedicated modules. The majority of heterogenous processors incorporate dedicated modules for high performance subtasks of high regularity as DCT and block matching. By normalization to a fictive 1.0 /spl mu/m CMOS process typical linear relationships between silicon area and through-put rate have been determined for the different architectural styles. This relationship indicates a figure of merit for silicon efficiency.
← Kembali ke Halaman Utama