Journal of Real-Time Image Processing

Publisher: Springer Verlag

Current impact factor: 2.02

Impact Factor Rankings

2016 Impact Factor Available summer 2017
2014 / 2015 Impact Factor 2.02
2013 Impact Factor 1.111
2012 Impact Factor 1.156
2011 Impact Factor 1.02
2010 Impact Factor 0.962

Impact factor over time

Impact factor
Year

Additional details

5-year impact 1.55
Cited half-life 3.80
Immediacy index 0.15
Eigenfactor 0.00
Article influence 0.55
Other titles Real-time image processing
ISSN 1861-8200
OCLC 73532162
Material type Document, Periodical, Internet resource
Document type Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details

Springer Verlag

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author can archive a post-print version
  • Conditions
    • Author's pre-print on pre-print servers such as arXiv.org
    • Author's post-print on author's personal website immediately
    • Author's post-print on any open access repository after 12 months after publication
    • Publisher's version/PDF cannot be used
    • Published source must be acknowledged
    • Must link to publisher version
    • Set phrase to accompany link to published version (see policy)
    • Articles in some journals can be made Open Access on payment of additional charge
  • Classification
    green

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: Teleconferencing has become an indispensable element in any business system, because it offers the opportunity for collaborators to participate in a virtual group while remaining in divergent regions. Teleconferencing also increases productivity, minimizes travel expenses and saves travel time. This paper presents a reliable Teleconference system that utilizes an improved high-efficiency video codec (HEVC) H.265 technology with congestion control. The improvement is based on CU size decision and entropy coding, which provides an adequate approach to enhance the real-time video/IP technology in terms of improved video quality and increased compression ratio compared to the previous codec (H.264) and original HEVC.
    No preview · Article · Feb 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: Real-time imaging, using ultrasound techniques, is a complex task in non-destructive evaluation. In this context, fast and precise control systems require design of specialized parallel architectures. Total focusing method (TFM) for ultrasound imaging has many advantages in terms of flexibility and accuracy in comparison to traditional imaging techniques. However, one major drawback is the high number of data acquisitions and computing requirements for this imaging technique. Due to those constraints, the TFM algorithm was earlier classified in the field of post-processing tasks. This paper describes a multi-FPGA architecture for real-time TFM imaging using the full matrix capture (FMC). In the acquisition process, data are acquired using a phased array and processed with synthetic focusing techniques such as the TFM algorithm. The FMC-TFM architecture consists of a set of interconnected FPGAs integrated on an embedded system. Initially, this imaging system was dedicated to data acquisition using a phased array. The algorithm was reviewed and partitioned to parallelize processing tasks on FPGAs. The architecture was entirely described using VHDL language, synthesized and implemented on a V5FX70T Xilinx FPGA for the control and high-level processing tasks and four V5SX95T Xilinx FPGAs for the acquisition and low-level processing tasks. The designed architecture performs real-time FMC-TFM imaging with a good characterization of defects.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a new performance improvement method ‘exact window memoization’ for local image processing algorithms. Window memoization is a technique that uses the advantage of memoization method and data redundancy on images to minimize the amount of redundant computations by reusing the previous result, and it leads to achieve speedup of computation performed. In the tolerant window memoization, a part of pixels is eliminated to increase the probability of similar windows in entire of image, but it causes an accuracy loss in the results. In our new proposed method, the benefit of inter-pixel redundancy in images is used where the neighboring pixels are correlated, and window memoization technique is applied to windows where the MSBs part of pixels are same, and also the trivial computations of identical pixels in the neighborhood of windows are eliminated. In this new method, accuracy is preserved in the results as well as speedup computation performance is achieved when compared with the current window memoization technique. We have also presented a performance method to predict speedup achievement in the newly proposed method using inverse difference moment (IDM) as one of the statistical parameters of the gray-level co-occurrence matrix. We have developed this method on software and applied to Median and Kirsch edge detection filter on 512 × 512 of pixels images. The typical speedup computational performance compared with conventional method in an image with an IDM range between 0.5 and 0.6 in the median filter was 1.45× and for Kirsch edge detection was 1.61×.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes a novel fast 3D filtering technique for enhancement of color video sequences using digital paths created on the image grid extended to a spatio-temporal domain. Numerous modifications improved impulsive noise filtering efficiency and cope with video artifacts such as Gaussian, impulsive and grain noise and still preserves and even enhances edges. It can even remove block compression artifacts and video flickering. Simulations show that it performs well under PSNR and SSIM metrics. It gives particularly good results for mixed Gaussian and impulse noise—PSNR is approximately 3 dB better than VMF3D and my previous spatial filters. The new algorithm allows video processing in real time for low resolution images; in the preliminary simulations, the processing rate of over 50 fps for the CIF (CIF standard: 352 \(\times\) 288 pixel) video sequences was obtained.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: When traditional secret image sharing techniques reconstructed the secret, they input the shares over t. While less than t shares can know nothing about the secret, the problem arises when there are more than t shares. The cheater can use this to put their share in the last. Therefore, fairness is a important objective of the secret image sharing. Tian et al. proposed the fairness secret sharing scheme in 2012. However, they generated v polynomials for one secret data and performed v-times to reconstruct the polynomial using Lagrange interpolation. Therefore, their scheme is unsuitableness in the real-time processing. The proposed scheme generates one polynomial for the one secret data based on the fairness concept of Tian et al.’s scheme. For the providing fairness, the proposed scheme hides the verification value at the random coefficient of the polynomial. During the secret image reconstruction procedure, each shadow image brought by a participant is verified for its fairness using XOR operation. Our scheme not only satisfies the fairness, but also is suitable for the real-time process. This helps to detect the participant from intentional provision of a false or cheating. In addition, our scheme uses the steganography technique for increasing the security protection purpose. The proposed scheme as a whole offers a high secure and effective mechanism for the secret image sharing that is not found in existing secret image sharing methods. In the experimental result, PSNR of the proposed scheme is average 44.67 dB. It is higher 4 dB than the previous schemes. The embedding capacity is also similar to the other schemes.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a novel algorithm for the vectorization of ordered sets of points, named Fast Total Least Squares (FTLS) vectorization. The emphasis was put on low computational complexity, which allows it to be run online on a mobile device at a speed comparable to the fastest algorithms, such as the Douglas–Peucker (DP) algorithm, while maintaining a much higher quality of the approximation. Our approach is based on the total least squares method, therefore all the points from the cloud contribute to its approximation. This leads to better utilization of the information contained in the point cloud, compared to those algorithms based on point elimination, such as DP. Several experiments and performance comparisons are presented to demonstrate the most important attributes of the FTLS algorithm.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: Data hiding used to embed data, such as copyright information, into various forms of media such as image, audio, or text with a minimum amount of perceivable degradation to the “host” signal. Therefore, in many cases, the cover media contain distortions even after the hidden data have been extracted. Thus, to extend the application of data hiding to some sensitive domains such as military, medical, and fine arts, which require the embedded cover images to be properly covered, reversible data hiding has become another new branch of this field. Our proposed scheme is inspired by Chang et al.’s idea. In this paper, we propose adaptive real-time reversible data hiding for JPEG images using successive zero coefficients in zigzag sequences of discrete cosine transformation blocks. The contribution of our proposed scheme successfully enhances the hiding capacity while the image quality of stego image and reversibility are maintained. The result of experiments conducted indicates that the proposed scheme enhances data hiding capacity, image quality, and improves performance.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a general approximation for 2D filters by using only power-of-two terms. This enables to easily implement these filters in electronic devices such as FPGA and ASIC just by using simple hardware shifters and adders/subtractors. Consequently, no division and no multiplication operators are required, which can reduce the memory and the power needed for computing operations such as convolution. Instead of using only additions and power-of-two terms for representing a number like in the standard binary decomposition, our model also uses subtractions for representing and approximating numbers. In addition, we propose a binary tree structure for computing a minimal representation in power-of-two terms in such a way that hardware shifters used for performing a convolution with a low-pass filter for example are well reduced to their minimum. Based on some experiments performed for contrast enhancement, which is a common image processing operation, we have noticed that good results can be obtained using our approximation in terms of image quality, hardware resources, and power consumption when compared to some other binary representations.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: Magnetic resonance imaging (MRI) is a widely deployed medical imaging technique used for various applications such as neuroimaging, cardiovascular imaging and musculoskeletal imaging. However, MR images degrade in quality due to noise. The magnitude MRI data in the presence of noise generally follows a Rician distribution if acquired with single-coil systems. Several methods are proposed in the literature for denoising MR images corrupted with Rician noise. Amongst the methods proposed in literature for denoising MR images corrupted with Rician noise, the non-local maximum likelihood methods (NLML) and its variants are popular. In spite of the performance and denoising quality, NLML algorithm suffers from a tremendous time complexity (Formula presented.), where (Formula presented.) and (Formula presented.) represent the search window and image size, respectively, for a 3D image. This makes the algorithm challenging for deployment in the real-time applications where fast and prompt results are required. A viable solution to this shortcoming would be the application of a data parallel processing framework such as Nvidia CUDA so as to utilize the mutually exclusive and computationally intensive calculations to our advantage. The GPU-based implementation of NLML-based image denoising achieves significant speedup compared to the serial implementation. This research paper describes the first successful attempt to implement a GPU-accelerated version of the NLML algorithm. The main focus of the research was on the parallelization and acceleration of one computationally intensive section of the algorithm so as to demonstrate the execution time improvement through the application of parallel processing concepts on a GPU. Our results suggest the possibility of practical deployment of NLML and its variants for MRI denoising.
    No preview · Article · Jan 2016 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a methodology about real-time 3D fluid simulation system using BCI (brain–computer interface). Spectators appreciate our work with their emotion. The advance of technology has exerted huge impacts on arts and as result a new genre called digital art has emerged. In digital art, interaction is an important element. Various types of interaction are bein g implemented in digital art using touch, hand gesture, sound, movement, etc., even brain wave. Usually, digital artists pursue interactions in their art work; the reason is that they want spectators’ deep appreciation and involvement. However, many of interactive digital art works fail to induce interaction as much as the artists expected. If visible interaction is weak, or interaction result is weak, spectators are not immersed much in the work. Nowadays, there are many interactive digital arts. In digital art, new type of interaction is needed to captivate spectators. So, we tried to implement BCI interaction digital art prototype (tentative title: Soul flow). Electroencephalography (EEG) is the recording of brain electrical activity along the scalp. We measured user’s EEG signal using MindSet (the MindSet senses EEG brainwave data to power the innovation of laboratory researchers and application developers like no other EEG device in the world. It delivers RAW signal, power frequency bands and NeuroSky eSense meters:attention, meditation. http:// www. neurosky. com/ products/ mindset. aspx) to take user’s emotional state on appreciating digital art. We can get user’s emotional state in four categories (attention/inattention, meditation/uneasiness) and these emotional states interact with 3D fluid simulation system in real-time. In this art work prototype, each spectator experiences each different fluid (scale, speed and visual) because each spectator has different emotional state. Our art work prototype expressed the flow through water flow simulation. Flow means the mental state of operation in which a person performing an activity is fully immersed in a feeling of energized focus, full involvement, and enjoyment in the process of the activity. In essence, flow is characterized by complete absorption in what one does (The psychology of optimal experience 1990). In addition, it means stream in water flow. We pursued these concepts and expressed to 3D fluid simulation digital art using BCI. We used Unity3D and MindSet to implement our art work prototype. This study will expand the participation of the spectator in digital art. In addition, it will expand the possibilities of BCI in digital art interaction.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: For its excellent performance compared with other cameras, GigE Vision cameras have been extensively applied in real-time image acquisition systems. But its features, such as the high CPU utilization and the dependency on network protocols, make it hard to be applied in embedded systems. This paper presents a hardware solution to access GigE Vision camera. It is a special Ethernet controller, which uses hardware logic to analyze network protocol as well as GigE Vision protocol, and can write image data into memory actively. Because the Ethernet controller is simplified and the protocols are analyzed by hardware, resource consumption and CPU utilization are both reduced. The experimental results prove that the CPU utilization of proposed solution is leading to zero, the acquisition speed of 1280 × 256 image is up to 228 frames per second, and the resource consumption is less than other solutions, which is only about 1393 logic unit blocks, 984 registers and 46,080 bits of memory.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a novel hardware-oriented color image compression algorithm based on digital halftoning and block truncation coding (BTC) techniques is proposed for very large-scale integration (VLSI) implementation. The proposed technique consists of a threshold generator, a bitmap generator, a BTC training module, a predictor, and a signed Golomb–Rice coding module. Because the wireless camera network is developed for perceiving, measuring, and collecting information from the environment, each camera sensing node should be designed to achieve low cost, small size, high compression rates, and low power consumption. Hence, a novel low-complexity, high-performance, transform-free, hardware-oriented color image compression algorithm based on digital halftoning and BTC is proposed. In order to achieve the performance of compressing images in real time, the proposed color image compression algorithm was realized by a VLSI technique. The VLSI architecture in this work contains only 8.1-k gate counts, and the core area is 81,000 μm2 synthesized using a TSMC 0.18-μm CMOS process. The operating frequency of this work is 100 MHz and consumes 2.91 mW, which is efficient to develop wireless electronic systems with the demand of color image compression in real time. Compared with JPEG- and JPEG-LS-based designs, this work reduces gate counts by at least 71.1 % and power consumption by 53 % and only requires a one-line-buffer memory.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a parallelization method for a deblocking filter in a high-efficiency video coding (HEVC) decoder based on complexity estimation. A deblocking filter of HEVC is generally considered to be appropriate for data-level parallelism (DLP) because there are no data-level dependencies among adjacent blocks in the horizontal and vertical filtering processes. However, an imbalanced workload can increase the idle time on some of the threads, and thus, the maximum parallel performance cannot be achieved with only DLP. To alleviate this problem, the proposed method estimates the computational complexity by utilizing the coding unit (CU) segment information and the on/off flag of the deblocking filter in advance. Then, the workload is distributed equally across all threads. The experimental results indicate that the proposed method can accelerate the decoding speed by a factor of 3.97, with six threads on top of the sequential deblocking filtering. In addition, the ratio of the maximum elapsed time to ideal elapsed time is reduced to approximately 21 %, as compared to conventional DLP-based parallel deblocking filtering methods that do not implement a complexity estimation method.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a real-time watermarking codec that is robust against re-encoding attacks for high-definition videos. The codec uses a segmentation function and texture detector techniques for applying real-time watermarking to human visual systems. Experimental results confirm that the proposed scheme satisfies the requirements of invisibility, real-time processing, and robustness against format conversion and low bit-rate encoding. The proposed algorithm has the advantages of simplicity, flexibility, and low computational burden; thus, it is a suitable candidate for many novel and interesting applications such as video fingerprinting for set-top boxes, Internet protocol television, personal video recorders, and satellite boxes.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: The emerging intra-coding tools of High Efficiency Video Coding (HEVC) standard can achieve up to 36 % bit-rate reduction compared to H.264/AVC, but with significant complexity increase. The design challenges, such as data dependency and computational complexity, make it difficult to implement a hardware encoder for real-time applications. In this paper, firstly, the data dependency in HEVC intra-mode decision is fully analyzed, which is cost by the reconstruction loop, the Most Probable Mode, the context adaption during Context-based Adaptive Binary Arithmetic Coding based rate estimation, and the Chroma derived mode. Then, several fast algorithms are proposed to remove the data dependency and to reduce the computational complexity, which include source signal based Rough Mode Decision, coarse to fine rough mode search, Prediction Mode Interlaced RDO mode decision, parallelized context adaption and Chroma-free Coding Unit (CU)/Prediction Unit (PU) decision. Finally, the parallelized VLSI architecture with CU reordering and Chroma reordering scheduling is proposed to improve the throughput. The experimental results demonstrate that the proposed intra-mode decision achieves 41.6 % complexity reduction with 4.3 % Bjontegaard Delta Rate (BDR) increase on average compared to the reference software, HM-13.0. The intra-mode decision scheme is implemented with 1571.7K gate count in 55 nm CMOS technology. The implementation results show that our design can achieve 1080p@60fps real time processing at 294 MHz operation frequency.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing
  • [Show abstract] [Hide abstract]
    ABSTRACT: Since the first histogram shifting technique was proposed by Ni et al., many histogram based data hiding methods were proposed to improve their scheme. One of the methods is using difference value between cover image and prediction image. Another method is using two point pairs and absolute value for improving Ni et al.’s scheme. In this paper, novel reversible data hiding scheme with edge-direction predictor and modulo operation was proposed for improving histogram shifting technique with 3 cases. We considered as much as possible around pixels by using edge-direction predictor with odd and even line embedding Also, we utilize two point pairs and absolute value at the same time by using modulo operation with wrap around. In the experimental results, the proposed scheme shown a good quality image result about 48dB as similar as other schemes and enhanced hiding capacity over 50 % than other schemes.
    No preview · Article · Dec 2015 · Journal of Real-Time Image Processing