The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We propose a new encoder-friendly image compression strategy for high-throughput cameras and other scenarios of resource-constrained encoders. The encoder performs ℓ∞-constrained predictive coding (DPCM coupled with uniform scalar quantizer), while the decoder solves an inverse problem of ℓ2 restoration of ℓ∞-coded images. Although designed for minimum encoder complexity, the new codec outperforms...
In this work we present an effective and computationally simple algorithm for image compression based on Hilbert Scanning of Embedded quadTrees (Hi-SET). It allows to represent an image as an embedded bitstream along a fractal function. Embedding is an important feature of modern image compression algorithms, in this way Salomon in [1, pg. 614] cite that another feature and perhaps a unique one is...
We present a new graph-based transform for video signals using wavelet lifting. Graphs are created to capture spatial and temporal correlations in video sequences. Our new transforms allow spatial and temporal correlation to be jointly exploited, in contrast to existing techniques, such as motion compensated temporal filtering, which can be seen as "separable" transforms, since spatial and...
A new semantic steganographic algorithm for hiding data in the motion trajectories of Video Objects (VOs) is presented. First, a set of primitives (objects bounding-box coordinates and its centroid) are used to dene a VO. The centroid of VO is tracked in each frame and its coordinate is stored in a trajectory vector. The proposed algorithm embeds data in the VO object trajectory by presenting a relationship...
A Printed photograph cannot be used to recover the original digital image with improved accuracy because of distortions introduced during the process of scanning the printed material. This paper describes a method to recover the original digital images from the print-scan channel with improved quality. We solve this approximation problem by formulating a method for approximating the original digital...
The application of distributed coding in many media applications, where low power and low-complexity encoder device is essential, is a new paradigm. In this paper, we propose a new pixel-domain Distributed Video Coding (DVC) scheme, in which both temporal and spatial correlations are exploited at the decoder. The Slepian-Wolf decoder is modified by introducing a source decoder to exploit Wyner-Ziv...
This paper presents a design methodology for hardware/software (HW/SW) architecture design using ESL tools (Electronic System Level). From C++ descriptions, our design flow is able to generate hardware blocks running with a software part and all necessary codes to prototype the HW/SW system on Xilinx FPGAs. Therefore we use assistance of high level synthesis tools (Catapult C Synthesis), logic synthesis...
3DTV promises to become the mainstream of next-generation TV systems. High resolution 3DTV provides users with a vivid watching experience. Moreover, free-viewpoint view synthesis (FVVS) extends the common two-view stereo 3D vision into virtual reality by generating unlimited views from any desired view point. In the next-generation 3DTV systems, the set-top box (STB) SoC requires both a high-definition...
The paper proposes a novel method to compress color images with imperceptible quality loss. The algorithm explores the difference in error perceptibility of human visual system for various areas. It is done by implementing different non-uniform quantizers for flat, detail and random blocks of pixels. These blocks are classified based on principle component analysis (PCA) and prediction error. For...
We describe a system for localizing and deblurring motion-blurred 2D barcodes. Previous work on barcode detection and deblurring has mainly focused on 1D barcodes, and has employed traditional image acquisition which is not robust to motion blur. Our solution is based on coded exposure imaging which, as we show, enables well-posed de-convolution and decoding over a wider range of velocities. To serve...
This paper presents a new approach for hiding message in digital image in spatial domain. In this method two bits of message is embedded in a pixel in a way that not only the least significant bit of pixel is allowed to change but also the second bit plane and fourth bit plane are allowed to be manipulated, But the point is in each embedding process only one alternation in one bit plane is allowed...
This work addresses the twin issues of overlapping and blocking artifacts in Distributed Video Coding side information (SI). These both emanate from the block matching algorithm (BMA) used for motion vector (MV) generation rather than pixel-wise processing. In temporal correlation exploitation and particularly in the formulation of higher-order piecewise temporal trajectory interpolation (HOPTTI),...
The unique requirements imposed by contemporary video communication applications promote the rise of the distributed video coding paradigm, which offers flexible complexity allocation and error resilience combined with competitive compression performance. This work proposes a novel Wyner-Ziv video coding scheme, performing hash-based motion estimation at the decoder. Subsequently, maximum likelihood...
New method improving B-slice prediction is proposed. By combining the optical flow concept and high accuracy gradients evaluation we construct the algorithm which allows pixel-wise refinement of motion. This approach does not require any signaling for decoder. According to tests with WQVGA sequences bit-saving of 2%-6% can be achieved using this tool.
The hybrid coding method combining the predictive coding with the orthogonal transformation and the quantization is mainly used recently. This paper proposes a new hybrid parallel Intra Coding based on interpolative prediction which uses correlations between neighboring pixels, including non-causal pixels. In order to get high prediction performance, the optimal quantizing scheme, which is used to...
In the compression technique of hyperspectral image (HSI), PSNR of the reconstructed image is usually used for evaluating the performance of the coding results. For the spectral analysis applications of HSI, it is also important to consider the error in the result of spectral analysis. In the vegetation analysis, for example, the distortion of the vegetation index should be considered in addition...
View synthesis using depth maps is a well-known technique for exploiting the redundancy between multi-view videos. In this paper, we deal with the bitrates of view synthesis at the decoder side of FTV that would use compressed depth maps and views. Both inherent depth estimation error and coding distortion would degrade synthesis quality. The focus is to reduce bitrates required for generating the...
In this paper, we propose an intra-prediction system that is both parallel friendly and with high coding efficiency. This is achieved by combining a novel prediction strategy that reduces serial dependencies and a novel, multi-directional and adaptive prediction system. The resulting technique is compared with state-of-the-art ITU-T H.264/MPEG-4 AVC. We observe a 2× and 8× increase in parallelism...
Side information plays a key role in the performance of a Distributed Video Coding (DVC) system. However, the generation of side information often relies on complex motion estimation/interpolation operation. The correlation between the source data and the side information, sometimes referred as virtual channel, is also very difficult to model accurately. In this paper, we propose a bitwise prediction...
In this paper, we propose three algorithms for fractal image decoding in which the decoding will be done in less iteration, so it would be faster. The first two algorithms are based on using an initial image which has coloration with the original image. In the first algorithm, we save the average of the original image along with the fractal codes, and we use the average image as the initial image...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.