Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,...Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,we characterize statistical correlations between adjacent bitplanes of a gray image with the Markov random field(MRF),represent it with a factor graph,and integrate the constructed MRF factor graph in that for binary image reconstruction,which gives rise to a joint factor graph for gray images reconstruction(JFGIR).By exploiting the JFGIR at the receiver to facilitate the reconstruction of the original bitplanes and deriving theoretically the sum-product algorithm(SPA)adapted to the JFGIR,a novel MRF-based encryption-then-compression(ETC)scheme is thus proposed.After preferable universal parameters of the MRF between adjacent bitplanes are sought via a numerical manner,extensive experimental simulations are then carried out to show that the proposed scheme successfully compresses the first 3 and 4 most significant bitplanes(MSBs)for most test gray images and the others with a large portion of smooth area,respectively.Thus,the proposed scheme achieves significant improvement against the state-of-the-art leveraging the 2-D Markov source model at the receiver and is comparable or somewhat inferior to that using the resolution-progressive strategy in recovery.展开更多
To solve the problem that the magnetic resonance(MR)image has weak boundaries,large amount of information,and low signal-to-noise ratio,we propose an image segmentation method based on the multi-resolution Markov rand...To solve the problem that the magnetic resonance(MR)image has weak boundaries,large amount of information,and low signal-to-noise ratio,we propose an image segmentation method based on the multi-resolution Markov random field(MRMRF)model.The algorithm uses undecimated dual-tree complex wavelet transformation to transform the image into multiple scales.The transformed low-frequency scale histogram is used to improve the initial clustering center of the K-means algorithm,and then other cluster centers are selected according to the maximum distance rule to obtain the coarse-scale segmentation.The results are then segmented by the improved MRMRF model.In order to solve the problem of fuzzy edge segmentation caused by the gray level inhomogeneity of MR image segmentation under the MRMRF model,it is proposed to introduce variable weight parameters in the segmentation process of each scale.Furthermore,the final segmentation results are optimized.We name this algorithm the variable-weight multi-resolution Markov random field(VWMRMRF).The simulation and clinical MR image segmentation verification show that the VWMRMRF algorithm has high segmentation accuracy and robustness,and can accurately and stably achieve low signal-to-noise ratio,weak boundary MR image segmentation.展开更多
In this work a complete approach for estimation of the spatial resolution for the gamma camera imaging based on the [1] is analyzed considering where the body distance is detected (close or far way). The organ of inte...In this work a complete approach for estimation of the spatial resolution for the gamma camera imaging based on the [1] is analyzed considering where the body distance is detected (close or far way). The organ of interest most of the times is not well defined, so in that case it is appropriate to use elliptical camera detection instead of circular. The image reconstruction is presented which allows spatially varying amounts of local smoothing. An inhomogeneous Markov random field (M.r.f.) model is described which allows spatially varying degrees of smoothing in the reconstructions and a re-parameterization is proposed which implicitly introduces a local correlation structure in the smoothing parameters using a modified maximum likelihood estimation (MLE) denoted as one step late (OSL) introduced by [2].展开更多
Markov random fields(MRF) have potential for predicting and simulating petroleum reservoir facies more accurately from sample data such as logging, core data and seismic data because they can incorporate interclass re...Markov random fields(MRF) have potential for predicting and simulating petroleum reservoir facies more accurately from sample data such as logging, core data and seismic data because they can incorporate interclass relationships. While, many relative studies were based on Markov chain, not MRF, and using Markov chain model for 3D reservoir stochastic simulation has always been the difficulty in reservoir stochastic simulation. MRF was proposed to simulate type variables(for example lithofacies) in this work. Firstly, a Gibbs distribution was proposed to characterize reservoir heterogeneity for building 3-D(three-dimensional) MRF. Secondly, maximum likelihood approaches of model parameters on well data and training image were considered. Compared with the simulation results of MC(Markov chain), the MRF can better reflect the spatial distribution characteristics of sand body.展开更多
A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This...A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This scheme builds normalized histogram and reference histogram from matching results,and uses clustering algorithm to process the two histograms.Region histogram statistical method is adopted to retrieve depth data to achieve final matching results.Regular stereo matching library is used to verify this scheme,and experiments reported in this paper support availability of this method for automatic image processing.This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results.The whole procedure can be executed automatically and improve the integration level of image analysis process.展开更多
Currently, many vision-based motion capture systems require passive markers attached to key loca- tions on the human body. However, such systems are intrusive with limited application. The algorithm that we use for hu...Currently, many vision-based motion capture systems require passive markers attached to key loca- tions on the human body. However, such systems are intrusive with limited application. The algorithm that we use for human motion capture in this paper is based on Markov random field （MRF） and dynamic graph cuts. It takes full account of the impact of 3D reconstruction error and integrates human motion capture and 3D reconstruction into MRF-MAP framework. For more accurate and robust performance, we extend our algorithm by incorporating color constraints into the pose estimation process. The advantages of incorporating color constraints are demonstrated by experimental results on several video sequences.展开更多
One of the classical optimization models for image segmentation is the well known Markov Random Fields(MRF)model.This model is a discrete optimization problem,which is shown here to formulate many continuous models us...One of the classical optimization models for image segmentation is the well known Markov Random Fields(MRF)model.This model is a discrete optimization problem,which is shown here to formulate many continuous models used in image segmentation.In spite of the presence of MRF in the literature,the dominant perception has been that the model is not effective for image segmentation.We show here that the reason for the non-effectiveness is due to the lack of access to the optimal solution.Instead of solving optimally,heuristics have been engaged.Those heuristic methods cannot guarantee the quality of the solution nor the running time of the algorithm.Worse still,heuristics do not link directly the input functions and parameters to the output thus obscuring what would be ideal choices of parameters and functions which are to be selected by users in each particular application context.We describe here how MRF can model and solve efficiently several known continuous models for image segmentation and describe briefly a very efficient polynomial time algorithm,which is provably fastest possible,to solve optimally the MRF problem.The MRF algorithm is enhanced here compared to the algorithm in Hochbaum(2001)by allowing the set of assigned labels to be any discrete set.Other enhancements include dynamic features that permit adjustments to the input parameters and solves optimally for these changes with minimal computation time.Several new theoretical results on the properties of the algorithm are proved here and are demonstrated for images in the context of medical and biological imaging.An interactive implementation tool for MRF is described,and its performance and flexibility in practice are demonstrated via computational experiments.We conclude that many continuous models common in image segmentation have discrete analogs to various special cases of MRF and as such are solved optimally and efficiently,rather than with the use of continuous techniques,such as PDE methods,that restrict the type of functions used and furthermore,can only guarantee convergence to a local minimum.展开更多
基金This work is supported in part by the National Natural Science Foundation of China under contracts 61672242 and 61702199in part by China Spark Program under Grant 2015GA780002+1 种基金in part by The National Key Research and Development Program of China under Grant 2017YFD0701601in part by Natural Science Foundation of Guangdong Province under Grant 2015A030313413.
文摘Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,we characterize statistical correlations between adjacent bitplanes of a gray image with the Markov random field(MRF),represent it with a factor graph,and integrate the constructed MRF factor graph in that for binary image reconstruction,which gives rise to a joint factor graph for gray images reconstruction(JFGIR).By exploiting the JFGIR at the receiver to facilitate the reconstruction of the original bitplanes and deriving theoretically the sum-product algorithm(SPA)adapted to the JFGIR,a novel MRF-based encryption-then-compression(ETC)scheme is thus proposed.After preferable universal parameters of the MRF between adjacent bitplanes are sought via a numerical manner,extensive experimental simulations are then carried out to show that the proposed scheme successfully compresses the first 3 and 4 most significant bitplanes(MSBs)for most test gray images and the others with a large portion of smooth area,respectively.Thus,the proposed scheme achieves significant improvement against the state-of-the-art leveraging the 2-D Markov source model at the receiver and is comparable or somewhat inferior to that using the resolution-progressive strategy in recovery.
基金the National Natural Science Foundation of China(Grant No.11471004)the Key Research and Development Program of Shaanxi Province,China(Grant No.2018SF-251)。
文摘To solve the problem that the magnetic resonance(MR)image has weak boundaries,large amount of information,and low signal-to-noise ratio,we propose an image segmentation method based on the multi-resolution Markov random field(MRMRF)model.The algorithm uses undecimated dual-tree complex wavelet transformation to transform the image into multiple scales.The transformed low-frequency scale histogram is used to improve the initial clustering center of the K-means algorithm,and then other cluster centers are selected according to the maximum distance rule to obtain the coarse-scale segmentation.The results are then segmented by the improved MRMRF model.In order to solve the problem of fuzzy edge segmentation caused by the gray level inhomogeneity of MR image segmentation under the MRMRF model,it is proposed to introduce variable weight parameters in the segmentation process of each scale.Furthermore,the final segmentation results are optimized.We name this algorithm the variable-weight multi-resolution Markov random field(VWMRMRF).The simulation and clinical MR image segmentation verification show that the VWMRMRF algorithm has high segmentation accuracy and robustness,and can accurately and stably achieve low signal-to-noise ratio,weak boundary MR image segmentation.
文摘In this work a complete approach for estimation of the spatial resolution for the gamma camera imaging based on the [1] is analyzed considering where the body distance is detected (close or far way). The organ of interest most of the times is not well defined, so in that case it is appropriate to use elliptical camera detection instead of circular. The image reconstruction is presented which allows spatially varying amounts of local smoothing. An inhomogeneous Markov random field (M.r.f.) model is described which allows spatially varying degrees of smoothing in the reconstructions and a re-parameterization is proposed which implicitly introduces a local correlation structure in the smoothing parameters using a modified maximum likelihood estimation (MLE) denoted as one step late (OSL) introduced by [2].
基金Project(2011ZX05002-005-006)supported by the National "Twelveth Five Year" Science and Technology Major Research Program,China
文摘Markov random fields(MRF) have potential for predicting and simulating petroleum reservoir facies more accurately from sample data such as logging, core data and seismic data because they can incorporate interclass relationships. While, many relative studies were based on Markov chain, not MRF, and using Markov chain model for 3D reservoir stochastic simulation has always been the difficulty in reservoir stochastic simulation. MRF was proposed to simulate type variables(for example lithofacies) in this work. Firstly, a Gibbs distribution was proposed to characterize reservoir heterogeneity for building 3-D(three-dimensional) MRF. Secondly, maximum likelihood approaches of model parameters on well data and training image were considered. Compared with the simulation results of MC(Markov chain), the MRF can better reflect the spatial distribution characteristics of sand body.
基金Sponsored by"985"Second Procession Construction of Ministry of Education(3040012040101)
文摘A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This scheme builds normalized histogram and reference histogram from matching results,and uses clustering algorithm to process the two histograms.Region histogram statistical method is adopted to retrieve depth data to achieve final matching results.Regular stereo matching library is used to verify this scheme,and experiments reported in this paper support availability of this method for automatic image processing.This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results.The whole procedure can be executed automatically and improve the integration level of image analysis process.
基金Supported by the National Basic Research Program of China (Grant No.2006CB303105)
文摘Currently, many vision-based motion capture systems require passive markers attached to key loca- tions on the human body. However, such systems are intrusive with limited application. The algorithm that we use for human motion capture in this paper is based on Markov random field （MRF） and dynamic graph cuts. It takes full account of the impact of 3D reconstruction error and integrates human motion capture and 3D reconstruction into MRF-MAP framework. For more accurate and robust performance, we extend our algorithm by incorporating color constraints into the pose estimation process. The advantages of incorporating color constraints are demonstrated by experimental results on several video sequences.
基金This research was supported in part by NSF awards No.CMMI-1200592 and CBET-0736232.
文摘One of the classical optimization models for image segmentation is the well known Markov Random Fields(MRF)model.This model is a discrete optimization problem,which is shown here to formulate many continuous models used in image segmentation.In spite of the presence of MRF in the literature,the dominant perception has been that the model is not effective for image segmentation.We show here that the reason for the non-effectiveness is due to the lack of access to the optimal solution.Instead of solving optimally,heuristics have been engaged.Those heuristic methods cannot guarantee the quality of the solution nor the running time of the algorithm.Worse still,heuristics do not link directly the input functions and parameters to the output thus obscuring what would be ideal choices of parameters and functions which are to be selected by users in each particular application context.We describe here how MRF can model and solve efficiently several known continuous models for image segmentation and describe briefly a very efficient polynomial time algorithm,which is provably fastest possible,to solve optimally the MRF problem.The MRF algorithm is enhanced here compared to the algorithm in Hochbaum(2001)by allowing the set of assigned labels to be any discrete set.Other enhancements include dynamic features that permit adjustments to the input parameters and solves optimally for these changes with minimal computation time.Several new theoretical results on the properties of the algorithm are proved here and are demonstrated for images in the context of medical and biological imaging.An interactive implementation tool for MRF is described,and its performance and flexibility in practice are demonstrated via computational experiments.We conclude that many continuous models common in image segmentation have discrete analogs to various special cases of MRF and as such are solved optimally and efficiently,rather than with the use of continuous techniques,such as PDE methods,that restrict the type of functions used and furthermore,can only guarantee convergence to a local minimum.
