Two-Layer Reversible Data Hiding for VQ-Compressed Images Based on De-Clustering and Indicator-Free Search-Order Coding

During transmission of digital images, secret messages can be embedded using data hiding techniques. Such techniques can transfer private secrets without drawing the attention of eavesdroppers. To reduce the amount of transmitted data, image compression methods are widely applied. Hiding secret data in compressed images is a hot issue recently. In this paper, we apply the de-clustering concept and the indicator-free search-order coding (IFSOC) technique to hide information into vector quantization (VQ) compressed images. Experimental results show that the proposed two-layer reversible data hiding scheme for IFSOC-encoded VQ index table can hide a large amount of secret data among state-of-the-art methods with a relatively lower bit rate and high security.

44. Search Orders

This chapter discusses the rules for search orders. A search order is a bundle of interim orders which require the respondent to admit another party to premises for the purpose of preserving evidence which might otherwise be destroyed or concealed by the respondent. Search orders are principally, but not exclusively, used in intellectual property claims against defendants who are likely to destroy incriminating evidence rather than disclose it voluntarily under standard disclosure.

44. Search Orders

This chapter discusses the rules for search orders. A search order is a bundle of interim orders which require the respondent to admit another party to premises for the purpose of preserving evidence which might otherwise be destroyed or concealed by the respondent. Search orders are principally, but not exclusively, used in intellectual property claims against defendants who are likely to destroy incriminating evidence rather than disclose it voluntarily under standard disclosure.

44. Search Orders

This chapter discusses the rules for search orders. A search order is a bundle of interim orders which require the respondent to admit another party to premises for the purpose of preserving evidence which might otherwise be destroyed or concealed by the respondent. Search orders are principally, but not exclusively, used in intellectual property claims against defendants who are likely to destroy incriminating evidence rather than disclose it voluntarily under standard disclosure.

A Robust Multi-Circle Detector Based on Horizontal and Vertical Search Analysis Fitting with Tangent Direction

In this paper, we propose an efficient Multi-Circle detector which follows the fixed search order. The method makes use of horizontal and vertical search to realize circle detection, which is named as HVCD. First, this method computes edge areas in a given image. The edge areas could be divided into some regions by means of region growing. Each of regions could be efficiently searched to achieve not only one-pixel wide edges but edge segments as well. Next, the candidate circles can be extracted from every edge segment. Finally, the circle candidates could be validated with the help of Helmholtz principle. Experimental results demonstrate that HVCD could effectively detect circles on synthetic and natural images on the one hand; on the other hand, HVCD here could solve the weakness in the process of circle Hough transform implementation and EDcircles implementation.

Low-Complexity Detection Algorithms for Spatial Modulation MIMO Systems

In this paper, the authors propose three low-complexity detection schemes for spatial modulation (SM) systems based on the modified beam search (MBS) detection. The MBS detector, which splits the search tree into some subtrees, can reduce the computational complexity by decreasing the nodes retained in each layer. However, the MBS detector does not take into account the effect of subtree search order on computational complexity, and it does not consider the effect of layers search order on the bit-error-rate (BER) performance. The ost-MBS detector starts the search from the subtree where the optimal solution is most likely to be located, which can reduce total searches of nodes in the subsequent subtrees. Thus, it can decrease the computational complexity. When the number of the retained nodes is fixed, which nodes are retained is very important. That is, the different search orders of layers have a direct influence on BER. Based on this, we propose the oy-MBS detector. The ost-oy-MBS detector combines the detection order of ost-MBS and oy-MBS together. The algorithm analysis and experimental results show that the proposed detectors outstrip MBS with respect to the BER performance and the computational complexity.

Effects of Users’ Bounded Rationality on a Traffic Network Performance: A Simulation Study

In this paper, we revisit the principle of bounded rationality applied to dynamic traffic assignment to evaluate its influences on network performance. We investigate the influence of different types of bounded rational user behavior on (i) route flows at equilibrium and (ii) network performance in terms of its internal, inflow, and outflow capacities. We consider the implementation of a bounded rational framework based on Monte Carlo simulation. A Lighthill-Whitham-Richards (LWR) mesoscopic traffic simulator is considered to calculate time-dependent route costs that account for congestion, spillback, and shock-wave effects. Network equilibrium is calculated using the Method of Successive Averages. As a benchmark, the results are compared against both Deterministic and Stochastic User Equilibrium. To model different types of bounded rational user behavior we consider two definitions of user search order (indifferent and strict preferences) and two settings of the indifference band. We also test the framework on a toy Braess network to gain insight into changes in the route flows at equilibrium for both search orders and increasing values of aspiration levels.