Secure Transmission of Compressed Medical Image Sequences on Communication Networks Using Motion Vector Watermarking

Medical imaging plays a key role within modern hospital management systems for diagnostic purposes.Compression methodologies are extensively employed to mitigate storage demands and enhance transmission speed,all while upholding image quality.Moreover,an increasing number of hospitals are embracing cloud computing for patient data storage,necessitating meticulous scrutiny of server security and privacy protocols.Nevertheless,considering the widespread availability of multimedia tools,the preservation of digital data integrity surpasses the significance of compression alone.In response to this concern,we propose a secure storage and transmission solution for compressed medical image sequences,such as ultrasound images,utilizing a motion vector watermarking scheme.The watermark is generated employing an error-correcting code known as Bose-Chaudhuri-Hocquenghem(BCH)and is subsequently embedded into the compressed sequence via block-based motion vectors.In the process of watermark embedding,motion vectors are selected based on their magnitude and phase angle.When embedding watermarks,no specific spatial area,such as a region of interest(ROI),is used in the images.The embedding of watermark bits is dependent on motion vectors.Although reversible watermarking allows the restoration of the original image sequences,we use the irreversible watermarking method.The reason for this is that the use of reversible watermarks may impede the claims of ownership and legal rights.The restoration of original data or images may call into question ownership or other legal claims.The peak signal-to-noise ratio(PSNR)and structural similarity index(SSIM)serve as metrics for evaluating the watermarked image quality.Across all images,the PSNR value exceeds 46 dB,and the SSIM value exceeds 0.92.Experimental results substantiate the efficacy of the proposed technique in preserving data integrity.

Intelligent extraction of road cracks based on vehicle laser point cloud and panoramic sequence images

In light of the limited efficacy of conventional methods for identifying pavement cracks and the absence of comprehensive depth and location data in two-dimensional photographs,this study presents an intelligent strategy for extracting road cracks.This methodology involves the integration of laser point cloud data obtained from a vehicle-mounted system and a panoramic sequence of images.The study employs a vehicle-mounted LiDAR measurement system to acquire laser point cloud and panoramic sequence image data simultaneously.A convolutional neural network is utilized to extract cracks from the panoramic sequence image.The extracted sequence image is then aligned with the laser point cloud,enabling the assignment of RGB information to the vehicle-mounted three dimensional(3D)point cloud and location information to the two dimensional(2D)panoramic image.Additionally,a threshold value is set based on the crack elevation change to extract the aligned roadway point cloud.The three-dimensional data pertaining to the cracks can be acquired.The experimental findings demonstrate that the use of convolutional neural networks has yielded noteworthy outcomes in the extraction of road cracks.The utilization of point cloud and image alignment techniques enables the extraction of precise location data pertaining to road cracks.This approach exhibits superior accuracy when compared to conventional methods.Moreover,it facilitates rapid and accurate identification and localization of road cracks,thereby playing a crucial role in ensuring road maintenance and traffic safety.Consequently,this technique finds extensive application in the domains of intelligent transportation and urbanization development.The technology exhibits significant promise for use in the domains of intelligent transportation and city development.

MOVING OBJECT TRACKING IN DYNAMIC IMAGE SEQUENCE BASED ON ESTIMATION OF MOTION VECTORS OF FEATURE POINTS

An improved estimation of motion vectors of feature points is proposed for tracking moving objects of dynamic image sequence. Feature points are firstly extracted by the improved minimum intensity change （MIC） algorithm. The matching points of these feature points are then determined by adaptive rood pattern searching. Based on the random sample consensus （RANSAC） method, the background motion is finally compensated by the parameters of an affine transform of the background motion. With reasonable morphological filtering, the moving objects are completely extracted from the background, and then tracked accurately. Experimental results show that the improved method is successful on the motion background compensation and offers great promise in tracking moving objects of the dynamic image sequence.

Relational graph location network for multi-view image localization

In multi-view image localization task,the features of the images captured from different views should be fused properly.This paper considers the classification-based image localization problem.We propose the relational graph location network(RGLN)to perform this task.In this network,we propose a heterogeneous graph construction approach for graph classification tasks,which aims to describe the location in a more appropriate way,thereby improving the expression ability of the location representation module.Experiments show that the expression ability of the proposed graph construction approach outperforms the compared methods by a large margin.In addition,the proposed localization method outperforms the compared localization methods by around 1.7%in terms of meter-level accuracy.

Hepatic MR imaging using IDEAL-IQ sequence:Will Gd-EOB-DTPA interfere with reproductivity of fat fraction quantification?

BACKGROUND Iterative decomposition of water and fat with echo asymmetry and least squares estimation quantification sequence(IDEAL-IQ)is based on chemical shift-based water and fat separation technique to get proton density fat fraction.Multiple studies have shown that using IDEAL-IQ to test the stability and repeatability of liver fat is acceptable and has high accuracy.AIM To explore whether Gadoxetate Disodium(Gd-EOB-DTPA)interferes with the measurement of the hepatic fat content quantified with the IDEAL-IQ and to evaluate the robustness of this technique.METHODS IDEAL-IQ was used to quantify the liver fat content at 3.0T in 65 patients injected with Gd-EOB-DTPA contrast.After injection,IDEAL-IQ was estimated four times,and the fat fraction(FF)and R2* were measured at the following time points:Precontrast,between the portal phase(70 s)and the late phase(180 s),the delayed phase(5 min)and the hepatobiliary phase(20 min).One-way repeated-measures analysis was conducted to evaluate the difference in the FFs between the four time points.Bland-Altman plots were adopted to assess the FF changes before and after injection of the contrast agent.P<0.05 was considered statistically significant.RESULTS The assessment of the FF at the four time points in the liver,spleen and spine showed no significant differences,and the measurements of hepatic FF yielded good consistency between T1 and T2[95%confidence interval:-0.6768%,0.6658%],T1 and T3(-0.3900%,0.3178%),and T1 and T4(-0.3750%,0.2825%).R2* of the liver,spleen and spine increased significantly after injection(P<0.0001).CONCLUSION Using the IDEAL-IQ sequence to measure the FF,we can obtain results that will not be affected by Gd-EOB-DTPA.The high reproducibility of the IDEAL-IQ sequence makes it available in the scanning interval to save time during multiphase examinations.

A novel color image encryption scheme using fractional-order hyperchaotic system and DNA sequence operations

In this paper, Adomian decomposition method （ADM） with high accuracy and fast convergence is introduced to solve the fractional-order piecewise-linear （PWL） hyperchaotic system. Based on the obtained hyperchaotic sequences, a novel color image encryption algorithm is proposed by employing a hybrid model of bidirectional circular permutation and DNA masking. In this scheme, the pixel positions of image are scrambled by circular permutation, and the pixel values are substituted by DNA sequence operations. In the DNA sequence operations, addition and substraction operations are performed according to traditional addition and subtraction in the binary, and two rounds of addition rules are used to encrypt the pixel values. The simulation results and security analysis show that the hyperchaotic map is suitable for image encryption, and the proposed encryption algorithm has good encryption effect and strong key sensitivity. It can resist brute-force attack, statistical attack, differential attack, known-plaintext, and chosen-plaintext attacks.

A Sequence Image Matching Method Based on Improved High-Dimensional Combined Features

Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes.

A New Images Hiding Scheme Based on Chaotic Sequences

We propose a data hidding technique in a still image. This technique is based on chaotic sequence in the transform domain of cover image. We use different chaotic random sequences multiplied by multiple sensitive images, respectively, to spread the spectrum of sensitive images. Multiple sensitive images are hidden in a covert image as a form of noise. The results of theoretical analysis and computer simulation show the new hiding technique have better properties with high security, imperceptibility and capacity for hidden information in comparison with the conventional scheme such as LSB (Least Significance Bit).

Stability of Efficient Deterministic Compressed Sensing for Images with Chirps and Reed-Muller Sequences

We explore the stability of image reconstruction algorithms under deterministic compressed sensing. Recently, we have proposed [1-3] deterministic compressed sensing algorithms for 2D images. These algorithms are suitable when Daubechies wavelets are used as the sparsifying basis. In the initial work, we have shown that the algorithms perform well for images with sparse wavelets coefficients. In this work, we address the question of robustness and stability of the algorithms, specifically, if the image is not sparse and/or if noise is present. We show that our algorithms perform very well in the presence of a certain degree of noise. This is especially important for MRI and other real world applications where some level of noise is always present.

3D Motion Parameters Determination Based on Binocular Sequence Images

Exactly capturing three dimensional (3D) motion i nf ormation of an object is an essential and important task in computer vision, and is also one of the most difficult problems. In this paper, a binocular vision s ystem and a method for determining 3D motion parameters of an object from binocu lar sequence images are introduced. The main steps include camera calibration, t he matching of motion and stereo images, 3D feature point correspondences and re solving the motion parameters. Finally, the experimental results of acquiring th e motion parameters of the objects with uniform velocity and acceleration in the straight line based on the real binocular sequence images by the mentioned meth od are presented.

Measurement of 3-D motion parameters of jacket launch based on stereo image sequences

To make sure that the process of jacket launch occurs in a seml-controlled manner, this paper deals with measurement of kinematic parameters of jacket launch using stereo vision and motion analysis. The system captured stereo image sequences by two separate CCD cameras, and then rebuilt 3D coordinates of the feature points to analyze the jacket launch motion. The possibility of combining stereo vision and motion analysis for measurement was examined. Resuhs by experiments using scale model of jacket confirm the theoretical data.

Rapid Texture Mapping from Image Sequences for Building Geometry Model

An effective approach, mapping the texture for building model based on the digital photogrammetric theory, is proposed. The easily-acquired image sequences from digital video camera on helicopter are used as texture resource, and the correspondence between the space edge in building geometry model and its line feature in image sequences is determined semi-automatically. The experimental results in production of three-dimensional data for car navigation show us an attractive future both in efficiency and effect.

BIT-CORRELATION MATCHING FUNCTION FOR IMAGE SEQUENCE CODING

This paper proposes a new block matching criterion called the bit-correlation matching function for image sequence coding. When using the identical fast searching algorithm, the bit-correlation matching function not only results in nearly the same accuracy in displacement estimation as the mean square error function, but also makes the algorithm low in computation complexity and easy to parallel implementation, thus reducing the coding time of image sequence efficiently.

Fast interactive segmentation algorithm of image sequences based on relative fuzzy connectedness

A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.

Relative Navigation of Long-Range Non-Cooperative Targets Based on Monocular Sequence Images

Along with the increase of the number of failed satellites,plus space debris,year by year,it will take considerable manpower and resources if we rely just on ground surveillance and early warning.An alternative effective way would be to use autonomous long-range non-cooperative target relative navigation to solve this problem.For longrange non-cooperative targets,the stereo cameras or lidars that are commonly used would not be applicable.This paper studies a relative navigation method for long-range relative motion estimation of non-cooperative targets using only a monocular camera.Firstly,the paper provides the nonlinear relative orbit dynamics equations and then derives the discrete recursive form of the dynamics equations.An EKF filter is then designed to implement the relative navigation estimation.After that,the relative"locally weakly observability"theory for nonlinear systems is used to analyze the observability of monocular sequence images.The analysis results show that by relying only on monocular sequence images it has the possibility of deducing the relative navigation for long-range non-cooperative targets.Finally,numerical simulations show that the method given in this paper can achieve a complete estimation of the relative motion of longrange non-cooperative targets without conducting orbital maneuvers.

Center of rotation estimation for rocket nozzle by infrared reflective makers and image sequences

The determination of an accurate center of rotation of rocket motor nozzle or other object to be measured is of great interest across a wide range of applications,such as rocket,missile,robotics,industry,spaceflight,aviation and human motion analysis fields,particularly for clinical gait analysis.A new approach was proposed to estimate the moving objects' instantaneous center of rotation and other motion parameters.The new method assumes that the two segment of object to be measured are rigid body which rotates around a center of rotation between each other relatively.The center of rotation varies with time in the global coordinate system but is fixed in the local coordinate system attached to each segment.The models of rocket motor nozzle and its movement were established.The arbitrary moving object's corresponding to motion equations were deduced,and the least square closed-form solutions of the object's motion parameters were figured out.It is assumed that the two high speed CCD cameras mounted on the 750 nm infrared(IR) filter are synchronized and calibrated in advance.The virtual simulation experiment using 3D coordinates of markers was conducted by synchronized stereo image sequences based on 6-DOF motion platform and the experimental results prove the feasibility of our algorithm.The test results show that the precision of x,y,z component on center of rotation is up to 0.14 mm,0.13 mm,0.15 mm.

Complexity estimation of image sequence for automatic target track

In the field of automatic target recognition and tracking,traditional image complexity metrics,such as statistical variance and signal-to-noise ratio,all focus on single-frame images.However,there are few researches about the complexity of image sequence.To solve this problem,a criterion of evaluating image sequence complexity is proposed.Firstly,to characterize this criterion quantitatively,two metrics for measuring the complexity of image sequence,namely feature space similarity degree of global background(FSSDGB)and feature space occultation degree of local background(FSODLB)are developed.Here,FSSDGB reflects the ability of global background to introduce false alarms based on feature space,and FSODLB represents the difference between target and local background based on feature space.Secondly,the feature space is optimized by the grey relational method and relevant features are removed so that FSSDGB and FSODLB are more reasonable to establish complexity of single-frame images.Finally,the image sequence complexity is not a linear sum of the single-frame image complexity.Target tracking errors often occur in high-complexity images and the tracking effect of low-complexity images is very well.The nonlinear transformation based on median(NTM)is proposed to construct complexity of image sequence.The experimental results show that the proposed metric is more valid than other metrics,such as sequence correlation(SC)and interframe change degree(IFCD),and it is highly relevant to the actual performance of automatic target tracking algorithms.

Three-dimensional motion parameters estimation from stereo image sequences based on infrared reflective markers

In this paper,an innovative 3D motion parameters estimation method from stereo image sequences based on infrared(IR) reflective markers is presented.It was assumed that two high speed CCD cameras had been calibrated previously.The method consists of the following steps:1) the coordinate of several markers and depth map for each stereo pair was determined from the sequences of stereo images by relations of markers' coordinate the correspondence between markers was established,2) the 3D motion parameters of the target was computed based upon the matched markers' coordinate,and 3) translated 3D motion parameters estimation into the problem of least square according to the movement model of the object to be measured.Without using line,curve or corner correspondence,this method can calculate the depth of these markers feature easily and quickly in contrast to traditional approaches.The two CCD cameras work on 200 f/s,and each processing cost time is about 3 ms.It was found that,by using several markers and a large number of stereo images,this method can improve the computational speed,robustness and numerical accuracy of the motion parameters in comparison with traditional methods.The virtual simulation experiment was conducted using synthesized stereo image sequences based on 6-DOF motion platform and the experimental results proved the validity of our approach and showed that the translation and rotation precision is up to 0.1 mm and 0.1°.

Modified Adaptive Weighted Averaging Filtering Algorithm for Noisy Image Sequences

In order to avoid the influence of noise variance on the filtering performances, a modified adaptive weighted averaging (MAWA) filtering algorithm is proposed for noisy image sequences. Based upon adaptive weighted averaging pixel values in consecutive frames, this algorithm achieves the filtering goal by assigning smaller weights to the pixels with inappropriate estimated motion trajectory for noise. It only utilizes the intensity of pixels to suppress noise and accordingly is independent of noise variance. To evaluate the performance of the proposed filtering algorithm, its mean square error and percentage of preserved edge points were compared with those of traditional adaptive weighted averaging and non-adaptive mean filtering algorithms under different noise variances. Relevant results show that the MAWA filtering algorithm can preserve image structures and edges under motion after attenuating noise, and thus may be used in image sequence filtering.

Screen image sequence compression method utilizing adaptive block size coding and hierarchical GOP structure

To compress screen image sequence in real-time remote and interactive applications,a novel compression method is proposed.The proposed method is named as CABHG.CABHG employs hybrid coding schemes that consist of intra-frame and inter-frame coding modes.The intra-frame coding is a rate-distortion optimized adaptive block size that can be also used for the compression of a single screen image.The inter-frame coding utilizes hierarchical group of pictures(GOP) structure to improve system performance during random accesses and fast-backward scans.Experimental results demonstrate that the proposed CABHG method has approximately 47%-48% higher compression ratio and 46%-53% lower CPU utilization than professional screen image sequence codecs such as TechSmith Ensharpen codec and Sorenson 3 codec.Compared with general video codecs such as H.264 codec,XviD MPEG-4 codec and Apple's Animation codec,CABHG also shows 87%-88% higher compression ratio and 64%-81% lower CPU utilization than these general video codecs.