Journal of Real-Time Image Processing

Publisher: Springer Verlag

Journal description

Current impact factor: 1.11

Impact Factor Rankings

2015 Impact Factor Available summer 2015
2013 / 2014 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.06
Cited half-life 3.70
Immediacy index 0.10
Eigenfactor 0.00
Article influence 0.43
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: In this paper, we present a new performance improvement technique, window memoization, for software implementations of local image processing algorithms. Window memoization combines the memoization techniques proposed in software and hardware with data redundancy in image processing to improve the performance of local image processing algorithms. It minimizes the number of redundant computations performed on an image by identifying similar neighborhoods of pixels in the image and skipping the computations that are not necessary. This leads to performance improvement in software. We have developed an optimized architecture for window memoization in software and applied it to six image processing algorithms. We have also developed a performance model to predict the speedups obtained by window memoization in software. The typical (average) speedups range from 1.2x to 7.9x while the total average speedup for different algorithms with different input images across different processors is 3.95x.
    Journal of Real-Time Image Processing 06/2015; 10(1):5-25. DOI:10.1007/s11554-012-0247-8
  • Journal of Real-Time Image Processing 05/2015; DOI:10.1007/s11554-015-0506-6
  • [Show abstract] [Hide abstract]
    ABSTRACT: It is widely accepted that the growth of Internet and the improvement of Internet’s network conditions helped real-time applications to flourish. The demand for Ultra-High Definition video is constantly increasing. Apart from video and sound, a new kind of real-time data is making its appearance, haptic data. The efficient synchronization of video, audio, and haptic data is a rather challenging effort. The new High-Efficiency Video Coding (HEVC) is quite promising for real-time ultra-high definition video transferring through the Internet. This paper presents related work on High-Efficiency Video Coding. It points out the challenges and the synchronization techniques that have been proposed for synchronizing video and haptic data. Comparative tests between H.264 and HEVC are undertaken. Measurements for the network conditions of the Internet are carried out. The equations for the transferring delay of all the inter-prediction configurations of the HEVC are defined. Finally, it proposes a new efficient algorithm for transferring a real-time HEVC stream with haptic data through the Internet.
    Journal of Real-Time Image Processing 05/2015; DOI:10.1007/s11554-015-0505-7
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wide-angle images gained a huge popularity in the last years due to the development of computational photography and imaging technological advances. They present the information of a scene in a way which is more natural for the human eye but, on the other hand, they introduce artifacts such as bent lines. These artifacts become more and more unnatural as the field of view increases. In this work, we present a technique aimed to improve the perceptual quality of panorama visualization. The main ingredients of our approach are, on one hand, considering the viewing sphere as a Riemann sphere, what makes natural the application of M\"obius (complex) transformations to the input image, and, on the other hand, a projection scheme which changes in function of the field of view used. We also introduce an implementation of our method, compare it against images produced with other methods and show that the transformations can be done in real-time, which makes our technique very appealing for new settings, as well as for existing interactive panorama applications.
    Journal of Real-Time Image Processing 04/2015; DOI:10.1007/s11554-015-0502-x
  • [Show abstract] [Hide abstract]
    ABSTRACT: A challenging problem in spectral unmixing is how to determine the number of endmembers in a given scene. One of the most popular ways to determine the number of endmembers is by estimating the virtual dimensionality (VD) of the hyperspectral image using the well-known Harsanyi–Farrand–Chang (HFC) method. Due to the complexity and high dimensionality of hyperspectral scenes, this task is computationally expensive. Reconfigurable field-programmable gate arrays (FPGAs) are promising platforms that allow hardware/software codesign and the potential to provide powerful onboard computing capabilities and flexibility at the same time. In this paper, we present the first FPGA design for the HFC-VD algorithm. The proposed method has been implemented on a Virtex-7 XC7VX690T FPGA and tested using real hyperspectral data collected by NASA’s Airborne Visible Infra-Red Imaging Spectrometer over the Cuprite mining district in Nevada and the World Trade Center in New York. Experimental results demonstrate that our hardware version of the HFC-VD algorithm can significantly outperform an equivalent software version, which makes our reconfigurable system appealing for onboard hyperspectral data processing. Most important, our implementation exhibits real-time performance with regard to the time that the hyperspectral instrument takes to collect the image data.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-014-0482-2
  • [Show abstract] [Hide abstract]
    ABSTRACT: Super-resolution (SR) covers a set of techniques whose objective is to improve the spatial resolution of a video sequence or a single frame. In this scope, fusion SR techniques obtain high-resolution (HR) frames taking as a reference several low-resolution (LR) frames contained in a video sequence. This paper is based on a selective filter to decide the best LR frames to be used in the super-resolution process. Additionally, each frame division into macro-blocks (MBs) is analyzed both in a fixed block size approach, which decides which MBs should be used in the process, and in a variable block size approach with an adaptive MB size, which has been developed to set an appropriate frame division into MBs with variable size. These contributions not only improve the quality of video sequences, but also reduce the computational cost of a baseline SR algorithm, avoiding the incorporation of non-correlated data. Furthermore, this paper explains the way in which the enhanced algorithm proposed in it outperforms the quality of typical SR applications, such as underwater imagery, surveillance video, or remote sensing. The results are provided in a test environment to objectively compare the image quality enhancement obtained by bilinear interpolation, by the baseline SR algorithm, and by the proposed methods, thus presenting a quantitative comparison based on peak signal-to-noise ratio (PSNR) and Structural SIMilarity (SSIM) index parameters. The comparison has also been extended to other relevant proposals of the state of the art. The proposed algorithm significantly speeds up the previous ones, allowing real-time execution under certain conditions.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0489-3
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the start of the widespread use of discrete wavelet transform in image processing, the need for its efficient implementation is becoming increasingly more important. This work presents several novel SIMD-vectorized algorithms of 2-D discrete wavelet transform, using a lifting scheme. At the beginning, a stand-alone core of an already known single-loop approach is extracted. This core is further simplified by an appropriate reorganization of operations. Furthermore, the influence of the CPU cache on a 2-D processing order is examined. Finally, SIMD-vectorizations and parallelizations of the proposed approaches are evaluated. The best of the proposed algorithms scale almost linearly with the number of threads. For all of the platforms used in the tests, these algorithms are significantly faster than other known methods, as shown in the experimental sections of the paper.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0486-6
  • [Show abstract] [Hide abstract]
    ABSTRACT: The popularity of the new standard H.265 (High Efficiency Video Coding) depends on two factors: the rapidity of deploying clients for the most outstanding platforms and the capacity of service providers to develop efficient encoders for serving demanding multimedia services such as Live TV. Both encoders and decoders should inter-operate efficiently with the streaming protocols to limit the risks of implementation incompatibilities.This paper presents a synergy framework between High Efficiency Video Coding (HEVC) and Dynamic Adaptive Streaming over HTTP (DASH) that increases the compression capabilities of the encoder and opens new parallel encoding points for accelerating the video content coding and formatting processes. The synergy takes advantage of inter-motion prediction in HEVC for delimiting the segments of DASH protocol, which increases the motion compensation in each segment. Moreover, the impact of encoding multiple DASH representations is limited due to the parallel encoding presented in this paper.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0496-4
  • [Show abstract] [Hide abstract]
    ABSTRACT: The stereo to multi-view conversion technology plays an important role in the development and promotion of three-dimensional television, which can provide adequate supply of high-quality 3D content for autostereoscopic displays. This paper focuses on a real-time implementation of the stereo to multi-view conversion system, the major parts of which are adaptive meshing, sparse stereo correspondence, energy equation construction and virtual-view rendering. To achieve the real-time performance, we make three main contributions. First, we introduce adaptive meshing to reduce the computational complexity at the expense of slight decrease in quality. Second, we use a simple and effective method based on block matching algorithm to generate the sparse disparity map. Third, for the module of block-saliency calculation, sparse stereo correspondence and view synthesis, novel parallelization strategies and fine-grained optimization techniques based on graphic processing units are used to accelerate the executing speed. Experimental results show that the system can achieve real-time and semi-real-time performance when rendering 8 views with the image resolution of 1280 × 720 and 1920 × 1080 on Tesla K20. The images and videos presented finally are both visually realistic and comfortable.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0490-x
  • [Show abstract] [Hide abstract]
    ABSTRACT: Transmission of high efficiency video coding (HEVC) video streams over error-prone enterprise wireless local area networks (WLAN) architectures is challenging because of the difficulties in buffer overflow management in the switches within enterprise WLAN architectures. Thus, this paper proposes a new quality-aware video transmission method for company-wide enterprise WLAN architectures by combining video transmission technologies with a distributed stochastic buffering model that jointly controls power consumption and queue stabilization. After conducting extensive simulations with HEVC test sequences, significant video quality improvements are observed with the average Y-PSNR gain of 3.33 dB.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0501-y
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Journal of Real-Time Image Processing is entering its 10th year of publication with a steady increase in its stature in the area of image processing. The number of downloads grew to 37K+ in 2014. There are currently six special issue calls for papers, which can be viewed in the back matter of this issue. In the past few years, changes have been made to the Editorial Board to incorporate the technological trends and challenges in the field of real-time image processing. In addition, to improve the geographical representation of manuscripts being submitted, changes are being made to the Advisory Board. As a first step, we are delighted to inform our readers that Professor Touradj Ebrahimi, who is a well-known researcher and technology leader with extensive experience in image processing, has kindly agreed to join the Advisory Board. It is a great pleasure to have him in our Advisory Board.The editorial board meeting of JRTIP (see Fig. 1) was recently held in San Francisco in Februar ...
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0491-9
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this work, a clustering approach for bandwidth reduction in distributed smart camera networks is presented. Properties of the environment such as camera positions and environment pathways, as well as dynamics and features of targets are used to limit the flood of messages in the network. To better understand the correlation between camera positioning and pathways in the scene on one hand and temporal and spatial properties of targets on the other hand, and to devise a sound messaging infrastructure, a unifying probabilistic modeling for object association across multiple cameras with disjointed view is used. Communication is efficiently handled using a task-oriented node clustering that partition the network in different groups according to the pathway among cameras, and the appearance and temporal behavior of targets. We propose a novel asynchronous event exchange strategy to handle sporadic messages generated by non-frequent tasks in a distributed tracking application. Using a Xilinx-FPGA with embedded Microblaze processor, we could show that, with limited resource and speed, the embedded processor was able to sustain a high communication load, while performing complex image processing computations.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0498-2
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, an efficient method for computing the cross-sections of the internal structure from a 3D human brain model has been proposed. It can extract image slices from the brain model in sagittal, coronal, and axial views used for computed tomography and ultrasonography. A doubly connected edge list (DCEL) has been used for speeding up the computation during geometric processing, since the DCEL captures the topological relationship among vertices, edges, and faces of the triangulated surface. For a sectional plane, image slices are computed quite efficiently using the information of geometric coherence from the previous sectional plane with the help of DCEL. The optimal distance between two successive sectional planes is determined from the frequency distribution (Poisson distribution) of the edge lengths in the model. It reduces computational overhead without compromising on the quality of output, as demonstrated by experimental results.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0495-5
  • Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-014-0484-0
  • [Show abstract] [Hide abstract]
    ABSTRACT: The MPEG has recently Querydeveloped a new standard, MPEG media transport (MMT), for the next-generation hybrid media delivery service over IP networks considering the emerging convergence of digital broadcast and broadband services. On account of the heterogeneous characteristics of broadcast and broadband networks, MMT provides an efficient delivery timing model to enable inter-network synchronization, measure various kinds of transmission delays and jitters caused by the transmission delay, and re-adjust the timing relationship between the MMT packets to ensure synchronized playback. By exploiting the delivery timing model, it is possible to accurately estimate the round-trip time (RTT) experienced during MMT packet transmission. Based on the measured RTT, we propose an efficient delay-constrained automatic repeat request (ARQ) scheme, which is applicable to MMT packet-based real-time video streaming service over IP networks. In the proposed ARQ scheme, the receiver buffer fullness at the time of packet loss detection is used to compute the arrival deadline, which is the maximum allowed time for completing the requesting and retransmitting of the lost MMT packet. Simulation results demonstrate that the proposed delay-constrained ARQ scheme can not only provide reliable error recovery, but it also achieves significant bandwidth savings by reducing the number of wastefully retransmitted packets that arrive at the receiver side and exceed the allowed arrival deadline.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0503-9
  • [Show abstract] [Hide abstract]
    ABSTRACT: Split and merge segmentation is a popular region-based segmentation scheme for its robustness and computational efficiency. But it is hard to realize for larger size images or video frames in real time due to its iterative sequential data flow pattern. A quad-tree data structure is quite popular for software implementation of the algorithm, where a local parallelism is difficult to establish due to inherent data dependency between processes. In this paper, we have proposed a parallel algorithm of splitting and merging which depends only on local operations. The algorithm is mapped onto a hierarchical cell network, which is a parallel version of Locally Excitory Globally Inhibitory Oscillatory Network (LEGION). Simulation results show that the proposed design is faster than any of the standard split and merge algorithmic implementations, without compromising segmentation quality. The timing performance enhancement is manifested in its Finite State Machine based VLSI implementation in VIRTEX series FPGA platforms. We have also shown that, though segmentation qualitywise split-and-merge algorithm is little bit behind the state-of-the-art algorithms, computational speedwise it over performs those sophisticated and complex algorithms. Good segmentation performance with minimal computational cost enables the proposed design to tackle real time segmentation problem in live video streams. In this paper, we have demonstrated live PAL video segmentation using VIRTEX 5 series FPGA. Moreover, we have extended our design to HD resolution for which the time taken is less than 5 ms rendering a processing throughput of 200 frames per second.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0488-4
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a fast algorithm for integrating connected-component labeling and Euler number computation. Based on graph theory, the Euler number of a binary image in the proposed algorithm is calculated by counting the occurrences of four patterns of the mask for processing foreground pixels in the first scan of a connected-component labeling process, where these four patterns can be found directly without any additional calculation; thus, connected-component labeling and Euler number computation can be integrated more efficiently. Moreover, when computing the Euler number, unlike other conventional algorithms, the proposed algorithm does not need to process background pixels. Experimental results demonstrate that the proposed algorithm is much more efficient than conventional algorithms either for calculating the Euler number alone or simultaneously calculating the Euler number and labeling connected components.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0499-1
  • [Show abstract] [Hide abstract]
    ABSTRACT: Media synchronization is used to correctly playback a video stream with its associated audio. To support synchronization between video and audio streams transported over IP networks, an RTP/RTCP protocol suite is usually employed. In conventional server-driven media synchronization, the server needs to periodically transmit an RTCP sender report (SR) packet to provide the client with a UTC time in NTP format corresponding to the RTP timestamp carried by each RTP packet. In this paper, we propose a precise client-driven media synchronization mechanism for an RTP packet-based multimedia streaming service. In the proposed method, the server does not need to send any RTCP SR packets for synchronization. Instead, the client device derives the precise normal play time (NPT) for each video and audio stream from the received RTP packets containing an RTP timestamp. Simulations show that the proposed client-driven synchronization method can provide accurate media synchronization without employing an RTCP SR packet and accordingly reduce the initial synchronization delay, the processing complexity at the client device, the number of required user datagram protocol ports, and the amount of control traffic injected into the network.
    Journal of Real-Time Image Processing 01/2015; DOI:10.1007/s11554-015-0497-3