A new method to accelerate the convergent rate of the space-alternatinggeneralized expectation-maximization (SAGE) algorithm is proposed. The new rescaled block-iterativeSAGE (RBI-SAGE) algorithm combines the RBI algo...A new method to accelerate the convergent rate of the space-alternatinggeneralized expectation-maximization (SAGE) algorithm is proposed. The new rescaled block-iterativeSAGE (RBI-SAGE) algorithm combines the RBI algorithm with the SAGE algorithm for PET imagereconstruction. In the new approach, the projection data is partitioned into disjoint blocks; eachiteration step involves only one of these blocks. SAGE updates the parameters sequentially in eachblock. In experiments, the RBI-SAGE algorithm and classical SAGE algorithm are compared in theapplication on positron emission tomography (PET) image reconstruction. Simulation results show thatRBI-SAGE has better performance than SAGE in both convergence and image quality.展开更多
Watermarking system based on quantization index modulation (QIM) is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronizati...Watermarking system based on quantization index modulation (QIM) is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronization attacks of QIM digital watermarking,a low density parity check (LDPC) code-aided QIM watermarking algorithm is proposed,and the performance of QIM watermarking system can be improved by incorporating LDPC code with message passing estimation/detection framework.Using the theory of iterative estimation and decoding,the watermark signal is decoded by the proposed algorithm through iterative estimation of amplitude scaling parameters and decoding of watermark.The performance of the proposed algorithm is closer to the dirty paper Shannon limit than that of repetition code aided algorithm when the algorithm is attacked by the additive white Gaussian noise.For constant amplitude scaling attacks,the proposed algorithm can obtain the accurate estimation of amplitude scaling parameters.The simulation result shows that the algorithm can obtain similar performance compared to the algorithm without desynchronization.展开更多
This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVC...This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of(l) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.展开更多
Replacement and substitution encryption are two basic types of encryption historically. The classical encryption algorithm has been compromised now, but they still can play special role for modem cryptnlogy. For examp...Replacement and substitution encryption are two basic types of encryption historically. The classical encryption algorithm has been compromised now, but they still can play special role for modem cryptnlogy. For example, in digital image encryption system, substitution can disrupt the original order of the images and eliminate the correlation of image information which not only can realize security of images, but also can resist intentional attack and destruction of clipping and noise. And transposition transformation is introduced into the design of block ciphers. The substitution has the feature of high efficiency and resistance, which makes it meet the specific requirements of encryption. So substitution cypher can be applied to modern encryption system.展开更多
Conventional correlation matching algorithms waste great time in invalid area search. This paper proposes a color tracking method based on correlation search area optimization on target characteristic hue decision. By...Conventional correlation matching algorithms waste great time in invalid area search. This paper proposes a color tracking method based on correlation search area optimization on target characteristic hue decision. By quantifying and reducing dimensions of HSV( hue saturation value) color space, a one-dimensional hue space is constructed. In the space, the target characteristic hue granule set is constructed, which contains attributes such as value, area and average distance between pixels and aiming center. By using granular computing method, the similarity between target and search blocks is obtained and the invalid search areas can be removed. The color tracking experiment has proved that the algorithm can improve real time performance for conventional matching algorithms without precision lost.展开更多
An adaptive digital image watermark algorithm with strong robustness based on gray-scale morphology is proposed in this paper.The embedded strategies include:The algorithm seeks and extracts adaptively the image stron...An adaptive digital image watermark algorithm with strong robustness based on gray-scale morphology is proposed in this paper.The embedded strategies include:The algorithm seeks and extracts adaptively the image strong texture regions.The algorithm maps the image strong texture region to the wavelet tree structures, and embeds adaptively watermark into the wavelet coefficients corresponding to the image's strong texture regions.According to the visual masking features, the algorithm adjusts adaptively the watermark-embedding intensity.Experimental results show the algorithm is robust to compression, filtering, noise as well as strong shear attacks.The algorithm is blind watermark scheme.The image strong texture region extraction method based on morphology in this algorithm is simple and effective and adaptive to various images.展开更多
The migration of a downsized crescent-shaped dune was investigated in a wind tunnel experiment.Quantified upwind influx and vertical oscillation of the sand bed were introduced to modulate the saturation level of the ...The migration of a downsized crescent-shaped dune was investigated in a wind tunnel experiment.Quantified upwind influx and vertical oscillation of the sand bed were introduced to modulate the saturation level of the sand flux above the dune surface to affect dune evolution.The evolution was recorded by top-view photography and then abstracted as the evolution of self-defined characteristic quantities using a digital image processing algorithm.The results showed that,in contrast to the case for spanwise quantities,the evolution of streamwise quantities corresponds to a linear increase in the modulation magnitude more positively and in a monotonic and convergent manner.In contrast with quantities on the windward face,the changes in quantities with respect to the horns were nonmonotonic with time and almost uncorrelated with the variation in modulation strength,which reveals the distinctiveness of leeside evolution.展开更多
文摘A new method to accelerate the convergent rate of the space-alternatinggeneralized expectation-maximization (SAGE) algorithm is proposed. The new rescaled block-iterativeSAGE (RBI-SAGE) algorithm combines the RBI algorithm with the SAGE algorithm for PET imagereconstruction. In the new approach, the projection data is partitioned into disjoint blocks; eachiteration step involves only one of these blocks. SAGE updates the parameters sequentially in eachblock. In experiments, the RBI-SAGE algorithm and classical SAGE algorithm are compared in theapplication on positron emission tomography (PET) image reconstruction. Simulation results show thatRBI-SAGE has better performance than SAGE in both convergence and image quality.
基金National Natural Science Foundation of China(No.61272432)Qingdao Science and Technology Development Plan(No.12-1-4-6-(10)-jch)
文摘Watermarking system based on quantization index modulation (QIM) is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronization attacks of QIM digital watermarking,a low density parity check (LDPC) code-aided QIM watermarking algorithm is proposed,and the performance of QIM watermarking system can be improved by incorporating LDPC code with message passing estimation/detection framework.Using the theory of iterative estimation and decoding,the watermark signal is decoded by the proposed algorithm through iterative estimation of amplitude scaling parameters and decoding of watermark.The performance of the proposed algorithm is closer to the dirty paper Shannon limit than that of repetition code aided algorithm when the algorithm is attacked by the additive white Gaussian noise.For constant amplitude scaling attacks,the proposed algorithm can obtain the accurate estimation of amplitude scaling parameters.The simulation result shows that the algorithm can obtain similar performance compared to the algorithm without desynchronization.
文摘This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of(l) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.
文摘Replacement and substitution encryption are two basic types of encryption historically. The classical encryption algorithm has been compromised now, but they still can play special role for modem cryptnlogy. For example, in digital image encryption system, substitution can disrupt the original order of the images and eliminate the correlation of image information which not only can realize security of images, but also can resist intentional attack and destruction of clipping and noise. And transposition transformation is introduced into the design of block ciphers. The substitution has the feature of high efficiency and resistance, which makes it meet the specific requirements of encryption. So substitution cypher can be applied to modern encryption system.
文摘Conventional correlation matching algorithms waste great time in invalid area search. This paper proposes a color tracking method based on correlation search area optimization on target characteristic hue decision. By quantifying and reducing dimensions of HSV( hue saturation value) color space, a one-dimensional hue space is constructed. In the space, the target characteristic hue granule set is constructed, which contains attributes such as value, area and average distance between pixels and aiming center. By using granular computing method, the similarity between target and search blocks is obtained and the invalid search areas can be removed. The color tracking experiment has proved that the algorithm can improve real time performance for conventional matching algorithms without precision lost.
基金Supported by the Technology Key Project of Shanxi Province (2007K04-13)the Application Development and Research Project of Xi’an (YF07017)
文摘An adaptive digital image watermark algorithm with strong robustness based on gray-scale morphology is proposed in this paper.The embedded strategies include:The algorithm seeks and extracts adaptively the image strong texture regions.The algorithm maps the image strong texture region to the wavelet tree structures, and embeds adaptively watermark into the wavelet coefficients corresponding to the image's strong texture regions.According to the visual masking features, the algorithm adjusts adaptively the watermark-embedding intensity.Experimental results show the algorithm is robust to compression, filtering, noise as well as strong shear attacks.The algorithm is blind watermark scheme.The image strong texture region extraction method based on morphology in this algorithm is simple and effective and adaptive to various images.
基金supported by the National Natural Science Foundation of China(Grant Nos.11272252 and 11102153)
文摘The migration of a downsized crescent-shaped dune was investigated in a wind tunnel experiment.Quantified upwind influx and vertical oscillation of the sand bed were introduced to modulate the saturation level of the sand flux above the dune surface to affect dune evolution.The evolution was recorded by top-view photography and then abstracted as the evolution of self-defined characteristic quantities using a digital image processing algorithm.The results showed that,in contrast to the case for spanwise quantities,the evolution of streamwise quantities corresponds to a linear increase in the modulation magnitude more positively and in a monotonic and convergent manner.In contrast with quantities on the windward face,the changes in quantities with respect to the horns were nonmonotonic with time and almost uncorrelated with the variation in modulation strength,which reveals the distinctiveness of leeside evolution.