Boolean Operation - Explore the Science & Experts | ideXlab

Scan Science and Technology

Contact Leading Edge Experts & Companies

Boolean Operation

The Experts below are selected from a list of 6108 Experts worldwide ranked by ideXlab platform

Dao-shun Wang – 1st expert on this subject based on the ideXlab platform

  • Boolean Operation Based Visual Cryptography
    IEEE Access, 2019
    Co-Authors: Zhili Zhou, Ching-nung Yang, Dao-shun Wang

    Abstract:

    A (k, n)-Traditional Visual Cryptographic Scheme (VCS) based on basis matrices encoded a secret image into n shadow images distributed among n participants. When any k participants superimposed their shadow images, the secret image can be visually revealed. This stacking Operation in decoding process is equivalent to perform OR Operation. Basis matrices of a (k, n) OR-Operation based VCS (OVCS) have been proved in the (k, n) XOR-Operation based VCS (XVCS) underlying XOR Operation to enhance the contrast 2(k-1) times. Although XOR Operation has been used to excavate good property of basis matrices in OVCS, other properties of basis matrices are obviously ignored in visual cryptography. In this paper, we define two new BooleanOperation based VCSs, AND-Operation based VCS (AVCS) and NOT-Operation based VCS (NVCS), and prove that basis matrices in a (k, n)-OVCS can be used as basis matrices in (k n)AVCS and (k, n) NVCS, respectively. Furthermore, we obtain a general converting formula of their contrasts among OVCS, AVCS, XVCS, and NVCS. With OVCS, there does not exist perfect whiteness. However, with other BooleanOperation based VCSs (XVCS, AVCS, and NVCS), there may exist this situation. Therefore, new contrast is also given to precisely evaluate visual quality of BooleanOperation based VCSs. Some observations and results demonstrate how to properly use these BooleanOperation based VCSs for decoding.

  • 2 n secret sharing scheme for gray and color images based on Boolean Operation
    Science in China Series F: Information Sciences, 2012
    Co-Authors: Lin Dong, Dao-shun Wang, Shundong Li

    Abstract:

    Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computation complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2,n)-SS scheme for binary images based on Boolean Operation, which has low computation complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.’s binary (2,n)-SS scheme. Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image. The two approaches are both based on Boolean Operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low computation complexity and almost ideal contrast.

  • 2 n secret sharing scheme based on Boolean Operation
    Scientia Sinica(Informationis), 2011
    Co-Authors: Lin Dong, Dao-shun Wang, L I Shundong

    Abstract:

    Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computa- tion complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2, n )-SS scheme for binary images based on Boolean Operation, which has low computation complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct a r runs (2, n )-SS scheme to improve the contrast of Wang et al.s binary (2, n )-SS scheme. Then we present two approaches to construct r runs (2, n )-SS schemes for grayscale image and color image. The two approaches are both based on Boolean Operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low computation complexity and almost ideal contrast.

X Hu – 2nd expert on this subject based on the ideXlab platform

  • reasoning Boolean Operation based modeling for heterogeneous objects
    Computer-aided Design, 2002
    Co-Authors: X Hu

    Abstract:

    Abstract A reasoning Boolean Operation based CAD modeling approach applied to construct heterogeneous material objects is presented. This reasoning Boolean Operation consists of a merging Operation and an extracting Operation, and it is executed according to the material-dominant information defined in the designed heterogeneous object database. In addition to the material-dominant Boolean union, subtraction, and intersection, a new Boolean complex_union Operation is defined and introduced to the set of the reasoning Boolean Operation. The Boolean complex_union ‘assembles’ the results of the material-dominant Boolean intersection and subtraction to form a new modeling assembly for the heterogeneous object. Due to the CAD-based nature, the thus formed heterogeneous model can be readily implemented with advanced CAD/CAE/CAM software for integrated design, analysis, and simulation. An example of such an application, its hierarchy of the model database, and the major steps of the model construction are described.

  • Computer-aided design and modeling of composite unit cells
    Composites Science and Technology, 2001
    Co-Authors: W. Sun, Fu Lin, X Hu

    Abstract:

    A novel modeling approach for designing and constructing CAD-based composite unit cells is presented. The modeling technique is developed based on a reasoning Boolean Operation algorithm which consists of merging and extracting Operation to construct composite unit cells at the heterogeneous material level. Owing to its CAD-based nature, the unit cell models can be readily implemented with advanced CAD/CAE/CAM systems for integrated design, simulation, and manufacturing of advanced composites. A seamless integration between the CAD model and finite element analysis, and results of stress and deformation in composite unit cells and in the fiber and matrix is demonstrated. The proposed modeling technique is able to capture the designed composite geometry, reinforced fiber architecture, and constituent material heterogeneity. Sample unit cells representing 2D woven fabric, 2D basket weave, 3D tri-axial braided, and 3D uni-directional composite are also presented.

Lin Dong – 3rd expert on this subject based on the ideXlab platform

  • 2 n secret sharing scheme for gray and color images based on Boolean Operation
    Science in China Series F: Information Sciences, 2012
    Co-Authors: Lin Dong, Dao-shun Wang, Shundong Li

    Abstract:

    Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computation complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2,n)-SS scheme for binary images based on Boolean Operation, which has low computation complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.’s binary (2,n)-SS scheme. Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image. The two approaches are both based on Boolean Operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low computation complexity and almost ideal contrast.

  • 2 n secret sharing scheme based on Boolean Operation
    Scientia Sinica(Informationis), 2011
    Co-Authors: Lin Dong, Dao-shun Wang, L I Shundong

    Abstract:

    Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computa- tion complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2, n )-SS scheme for binary images based on Boolean Operation, which has low computation complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct a r runs (2, n )-SS scheme to improve the contrast of Wang et al.s binary (2, n )-SS scheme. Then we present two approaches to construct r runs (2, n )-SS schemes for grayscale image and color image. The two approaches are both based on Boolean Operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low computation complexity and almost ideal contrast.

  • 2 n secret image sharing scheme with ideal contrast
    Computational Intelligence and Security, 2010
    Co-Authors: Lin Dong, Dao-shun Wang, Min Ku

    Abstract:

    In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image. In revealing phase, each two participants can recover the original secret image precisely by just performing simple Boolean Operation. The proposed scheme has low computational complexity and can reconstruct the secret image precisely. Experimental results show our scheme is simple and effective.