Automated matching of corresponding seed images of three simulator radiographs to allow 3D triangulation of implanted seeds

NASA Astrophysics Data System (ADS)

Altschuler, Martin D.; Kassaee, Alireza

1997-02-01

To match corresponding seed images in different radiographs so that the 3D seed locations can be triangulated automatically and without ambiguity requires (at least) three radiographs taken from different perspectives, and an algorithm that finds the proper permutations of the seed-image indices. Matching corresponding images in only two radiographs introduces inherent ambiguities which can be resolved only with the use of non-positional information obtained with intensive human effort. Matching images in three or more radiographs is an `NP (Non-determinant in Polynomial time)-complete' problem. Although the matching problem is fundamental, current methods for three-radiograph seed-image matching use `local' (seed-by-seed) methods that may lead to incorrect matchings. We describe a permutation-sampling method which not only gives good `global' (full permutation) matches for the NP-complete three-radiograph seed-matching problem, but also determines the reliability of the radiographic data themselves, namely, whether the patient moved in the interval between radiographic perspectives.

Permutation coding technique for image recognition systems.

PubMed

Kussul, Ernst M; Baidyk, Tatiana N; Wunsch, Donald C; Makeyev, Oleksandr; Martín, Anabel

2006-11-01

A feature extractor and neural classifier for image recognition systems are proposed. The proposed feature extractor is based on the concept of random local descriptors (RLDs). It is followed by the encoder that is based on the permutation coding technique that allows to take into account not only detected features but also the position of each feature on the image and to make the recognition process invariant to small displacements. The combination of RLDs and permutation coding permits us to obtain a sufficiently general description of the image to be recognized. The code generated by the encoder is used as an input data for the neural classifier. Different types of images were used to test the proposed image recognition system. It was tested in the handwritten digit recognition problem, the face recognition problem, and the microobject shape recognition problem. The results of testing are very promising. The error rate for the Modified National Institute of Standards and Technology (MNIST) database is 0.44% and for the Olivetti Research Laboratory (ORL) database it is 0.1%.

A fast chaos-based image encryption scheme with a dynamic state variables selection mechanism

NASA Astrophysics Data System (ADS)

Chen, Jun-xin; Zhu, Zhi-liang; Fu, Chong; Yu, Hai; Zhang, Li-bo

2015-03-01

In recent years, a variety of chaos-based image cryptosystems have been investigated to meet the increasing demand for real-time secure image transmission. Most of them are based on permutation-diffusion architecture, in which permutation and diffusion are two independent procedures with fixed control parameters. This property results in two flaws. (1) At least two chaotic state variables are required for encrypting one plain pixel, in permutation and diffusion stages respectively. Chaotic state variables produced with high computation complexity are not sufficiently used. (2) The key stream solely depends on the secret key, and hence the cryptosystem is vulnerable against known/chosen-plaintext attacks. In this paper, a fast chaos-based image encryption scheme with a dynamic state variables selection mechanism is proposed to enhance the security and promote the efficiency of chaos-based image cryptosystems. Experimental simulations and extensive cryptanalysis have been carried out and the results prove the superior security and high efficiency of the scheme.

Non-parametric combination and related permutation tests for neuroimaging.

PubMed

Winkler, Anderson M; Webster, Matthew A; Brooks, Jonathan C; Tracey, Irene; Smith, Stephen M; Nichols, Thomas E

2016-04-01

In this work, we show how permutation methods can be applied to combination analyses such as those that include multiple imaging modalities, multiple data acquisitions of the same modality, or simply multiple hypotheses on the same data. Using the well-known definition of union-intersection tests and closed testing procedures, we use synchronized permutations to correct for such multiplicity of tests, allowing flexibility to integrate imaging data with different spatial resolutions, surface and/or volume-based representations of the brain, including non-imaging data. For the problem of joint inference, we propose and evaluate a modification of the recently introduced non-parametric combination (NPC) methodology, such that instead of a two-phase algorithm and large data storage requirements, the inference can be performed in a single phase, with reasonable computational demands. The method compares favorably to classical multivariate tests (such as MANCOVA), even when the latter is assessed using permutations. We also evaluate, in the context of permutation tests, various combining methods that have been proposed in the past decades, and identify those that provide the best control over error rate and power across a range of situations. We show that one of these, the method of Tippett, provides a link between correction for the multiplicity of tests and their combination. Finally, we discuss how the correction can solve certain problems of multiple comparisons in one-way ANOVA designs, and how the combination is distinguished from conjunctions, even though both can be assessed using permutation tests. We also provide a common algorithm that accommodates combination and correction. © 2016 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

A novel chaos-based image encryption algorithm using DNA sequence operations

NASA Astrophysics Data System (ADS)

Chai, Xiuli; Chen, Yiran; Broyde, Lucie

2017-01-01

An image encryption algorithm based on chaotic system and deoxyribonucleic acid (DNA) sequence operations is proposed in this paper. First, the plain image is encoded into a DNA matrix, and then a new wave-based permutation scheme is performed on it. The chaotic sequences produced by 2D Logistic chaotic map are employed for row circular permutation (RCP) and column circular permutation (CCP). Initial values and parameters of the chaotic system are calculated by the SHA 256 hash of the plain image and the given values. Then, a row-by-row image diffusion method at DNA level is applied. A key matrix generated from the chaotic map is used to fuse the confused DNA matrix; also the initial values and system parameters of the chaotic system are renewed by the hamming distance of the plain image. Finally, after decoding the diffused DNA matrix, we obtain the cipher image. The DNA encoding/decoding rules of the plain image and the key matrix are determined by the plain image. Experimental results and security analyses both confirm that the proposed algorithm has not only an excellent encryption result but also resists various typical attacks.

Non‐parametric combination and related permutation tests for neuroimaging

PubMed Central

Webster, Matthew A.; Brooks, Jonathan C.; Tracey, Irene; Smith, Stephen M.; Nichols, Thomas E.

2016-01-01

Abstract In this work, we show how permutation methods can be applied to combination analyses such as those that include multiple imaging modalities, multiple data acquisitions of the same modality, or simply multiple hypotheses on the same data. Using the well‐known definition of union‐intersection tests and closed testing procedures, we use synchronized permutations to correct for such multiplicity of tests, allowing flexibility to integrate imaging data with different spatial resolutions, surface and/or volume‐based representations of the brain, including non‐imaging data. For the problem of joint inference, we propose and evaluate a modification of the recently introduced non‐parametric combination (NPC) methodology, such that instead of a two‐phase algorithm and large data storage requirements, the inference can be performed in a single phase, with reasonable computational demands. The method compares favorably to classical multivariate tests (such as MANCOVA), even when the latter is assessed using permutations. We also evaluate, in the context of permutation tests, various combining methods that have been proposed in the past decades, and identify those that provide the best control over error rate and power across a range of situations. We show that one of these, the method of Tippett, provides a link between correction for the multiplicity of tests and their combination. Finally, we discuss how the correction can solve certain problems of multiple comparisons in one‐way ANOVA designs, and how the combination is distinguished from conjunctions, even though both can be assessed using permutation tests. We also provide a common algorithm that accommodates combination and correction. Hum Brain Mapp 37:1486‐1511, 2016. © 2016 Wiley Periodicals, Inc. PMID:26848101

Bootstrapping on Undirected Binary Networks Via Statistical Mechanics

NASA Astrophysics Data System (ADS)

Fushing, Hsieh; Chen, Chen; Liu, Shan-Yu; Koehl, Patrice

2014-09-01

We propose a new method inspired from statistical mechanics for extracting geometric information from undirected binary networks and generating random networks that conform to this geometry. In this method an undirected binary network is perceived as a thermodynamic system with a collection of permuted adjacency matrices as its states. The task of extracting information from the network is then reformulated as a discrete combinatorial optimization problem of searching for its ground state. To solve this problem, we apply multiple ensembles of temperature regulated Markov chains to establish an ultrametric geometry on the network. This geometry is equipped with a tree hierarchy that captures the multiscale community structure of the network. We translate this geometry into a Parisi adjacency matrix, which has a relative low energy level and is in the vicinity of the ground state. The Parisi adjacency matrix is then further optimized by making block permutations subject to the ultrametric geometry. The optimal matrix corresponds to the macrostate of the original network. An ensemble of random networks is then generated such that each of these networks conforms to this macrostate; the corresponding algorithm also provides an estimate of the size of this ensemble. By repeating this procedure at different scales of the ultrametric geometry of the network, it is possible to compute its evolution entropy, i.e. to estimate the evolution of its complexity as we move from a coarse to a fine description of its geometric structure. We demonstrate the performance of this method on simulated as well as real data networks.

SCOPES: steganography with compression using permutation search

NASA Astrophysics Data System (ADS)

Boorboor, Sahar; Zolfaghari, Behrouz; Mozafari, Saadat Pour

2011-10-01

LSB (Least Significant Bit) is a widely used method for image steganography, which hides the secret message as a bit stream in LSBs of pixel bytes in the cover image. This paper proposes a variant of LSB named SCOPES that encodes and compresses the secret message while being hidden through storing addresses instead of message bytes. Reducing the length of the stored message improves the storage capacity and makes the stego image visually less suspicious to the third party. The main idea behind the SCOPES approach is dividing the message into 3-character segments, seeking each segment in the cover image and storing the address of the position containing the segment instead of the segment itself. In this approach, every permutation of the 3 bytes (if found) can be stored along with some extra bits indicating the permutation. In some rare cases the segment may not be found in the image and this can cause the message to be expanded by some overhead bits2 instead of being compressed. But experimental results show that SCOPES performs overlay better than traditional LSB even in the worst cases.

Symmetric encryption algorithms using chaotic and non-chaotic generators: A review

PubMed Central

Radwan, Ahmed G.; AbdElHaleem, Sherif H.; Abd-El-Hafiz, Salwa K.

2015-01-01

This paper summarizes the symmetric image encryption results of 27 different algorithms, which include substitution-only, permutation-only or both phases. The cores of these algorithms are based on several discrete chaotic maps (Arnold’s cat map and a combination of three generalized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms include a set of new image encryption algorithms based on non-chaotic generators, either using substitution only (using fractals) and permutation only (chess-based) or both. Moreover, two different permutation scenarios are presented where the permutation-phase has or does not have a relationship with the input image through an ON/OFF switch. Different encryption-key lengths and complexities are provided from short to long key to persist brute-force attacks. In addition, sensitivities of those different techniques to a one bit change in the input parameters of the substitution key as well as the permutation key are assessed. Finally, a comparative discussion of this work versus many recent research with respect to the used generators, type of encryption, and analyses is presented to highlight the strengths and added contribution of this paper. PMID:26966561

A novel image encryption algorithm based on the chaotic system and DNA computing

NASA Astrophysics Data System (ADS)

Chai, Xiuli; Gan, Zhihua; Lu, Yang; Chen, Yiran; Han, Daojun

A novel image encryption algorithm using the chaotic system and deoxyribonucleic acid (DNA) computing is presented. Different from the traditional encryption methods, the permutation and diffusion of our method are manipulated on the 3D DNA matrix. Firstly, a 3D DNA matrix is obtained through bit plane splitting, bit plane recombination, DNA encoding of the plain image. Secondly, 3D DNA level permutation based on position sequence group (3DDNALPBPSG) is introduced, and chaotic sequences generated from the chaotic system are employed to permutate the positions of the elements of the 3D DNA matrix. Thirdly, 3D DNA level diffusion (3DDNALD) is given, the confused 3D DNA matrix is split into sub-blocks, and XOR operation by block is manipulated to the sub-DNA matrix and the key DNA matrix from the chaotic system. At last, by decoding the diffused DNA matrix, we get the cipher image. SHA 256 hash of the plain image is employed to calculate the initial values of the chaotic system to avoid chosen plaintext attack. Experimental results and security analyses show that our scheme is secure against several known attacks, and it can effectively protect the security of the images.

An authenticated image encryption scheme based on chaotic maps and memory cellular automata

NASA Astrophysics Data System (ADS)

Bakhshandeh, Atieh; Eslami, Ziba

2013-06-01

This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.

A fault diagnosis scheme for planetary gearboxes using adaptive multi-scale morphology filter and modified hierarchical permutation entropy

NASA Astrophysics Data System (ADS)

Li, Yongbo; Li, Guoyan; Yang, Yuantao; Liang, Xihui; Xu, Minqiang

2018-05-01

The fault diagnosis of planetary gearboxes is crucial to reduce the maintenance costs and economic losses. This paper proposes a novel fault diagnosis method based on adaptive multi-scale morphological filter (AMMF) and modified hierarchical permutation entropy (MHPE) to identify the different health conditions of planetary gearboxes. In this method, AMMF is firstly adopted to remove the fault-unrelated components and enhance the fault characteristics. Second, MHPE is utilized to extract the fault features from the denoised vibration signals. Third, Laplacian score (LS) approach is employed to refine the fault features. In the end, the obtained features are fed into the binary tree support vector machine (BT-SVM) to accomplish the fault pattern identification. The proposed method is numerically and experimentally demonstrated to be able to recognize the different fault categories of planetary gearboxes.

Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding.

PubMed

Zhang, Xuncai; Han, Feng; Niu, Ying

2017-01-01

With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule's inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.

Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding

PubMed Central

2017-01-01

With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule's inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis. PMID:28912802

Color image encryption based on color blend and chaos permutation in the reality-preserving multiple-parameter fractional Fourier transform domain

NASA Astrophysics Data System (ADS)

Lang, Jun

2015-03-01

In this paper, we propose a novel color image encryption method by using Color Blend (CB) and Chaos Permutation (CP) operations in the reality-preserving multiple-parameter fractional Fourier transform (RPMPFRFT) domain. The original color image is first exchanged and mixed randomly from the standard red-green-blue (RGB) color space to R‧G‧B‧ color space by rotating the color cube with a random angle matrix. Then RPMPFRFT is employed for changing the pixel values of color image, three components of the scrambled RGB color space are converted by RPMPFRFT with three different transform pairs, respectively. Comparing to the complex output transform, the RPMPFRFT transform ensures that the output is real which can save storage space of image and convenient for transmission in practical applications. To further enhance the security of the encryption system, the output of the former steps is scrambled by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by two coupled chaotic logistic maps. The parameters in the Color Blend, Chaos Permutation and the RPMPFRFT transform are regarded as the key in the encryption algorithm. The proposed color image encryption can also be applied to encrypt three gray images by transforming the gray images into three RGB color components of a specially constructed color image. Numerical simulations are performed to demonstrate that the proposed algorithm is feasible, secure, sensitive to keys and robust to noise attack and data loss.

A chaotic cryptosystem for images based on Henon and Arnold cat map.

PubMed

Soleymani, Ali; Nordin, Md Jan; Sundararajan, Elankovan

2014-01-01

The rapid evolution of imaging and communication technologies has transformed images into a widespread data type. Different types of data, such as personal medical information, official correspondence, or governmental and military documents, are saved and transmitted in the form of images over public networks. Hence, a fast and secure cryptosystem is needed for high-resolution images. In this paper, a novel encryption scheme is presented for securing images based on Arnold cat and Henon chaotic maps. The scheme uses Arnold cat map for bit- and pixel-level permutations on plain and secret images, while Henon map creates secret images and specific parameters for the permutations. Both the encryption and decryption processes are explained, formulated, and graphically presented. The results of security analysis of five different images demonstrate the strength of the proposed cryptosystem against statistical, brute force and differential attacks. The evaluated running time for both encryption and decryption processes guarantee that the cryptosystem can work effectively in real-time applications.

A Chaotic Cryptosystem for Images Based on Henon and Arnold Cat Map

PubMed Central

Sundararajan, Elankovan

2014-01-01

The rapid evolution of imaging and communication technologies has transformed images into a widespread data type. Different types of data, such as personal medical information, official correspondence, or governmental and military documents, are saved and transmitted in the form of images over public networks. Hence, a fast and secure cryptosystem is needed for high-resolution images. In this paper, a novel encryption scheme is presented for securing images based on Arnold cat and Henon chaotic maps. The scheme uses Arnold cat map for bit- and pixel-level permutations on plain and secret images, while Henon map creates secret images and specific parameters for the permutations. Both the encryption and decryption processes are explained, formulated, and graphically presented. The results of security analysis of five different images demonstrate the strength of the proposed cryptosystem against statistical, brute force and differential attacks. The evaluated running time for both encryption and decryption processes guarantee that the cryptosystem can work effectively in real-time applications. PMID:25258724

Capacity of the Generalized Pulse-Position Modulation Channel

NASA Technical Reports Server (NTRS)

Hamkins, J.; Klimesh, M.; McElience, R.; Moision, B.

2005-01-01

We show the capacity of a generalized pulse-position modulation (PPM) channel, where the input vectors may be any set that allows a transitive group of coordinate permutations, is achieved by a uniform input distribution. We derive a simple expression in terms of the Kullback Leibler distance for the binary case, and the asymptote in the PPM order. We prove a sub-additivity result for the PPM channel and use it to show PPM capacity is monotonic in the order.

Interpreting support vector machine models for multivariate group wise analysis in neuroimaging

PubMed Central

Gaonkar, Bilwaj; Shinohara, Russell T; Davatzikos, Christos

2015-01-01

Machine learning based classification algorithms like support vector machines (SVMs) have shown great promise for turning a high dimensional neuroimaging data into clinically useful decision criteria. However, tracing imaging based patterns that contribute significantly to classifier decisions remains an open problem. This is an issue of critical importance in imaging studies seeking to determine which anatomical or physiological imaging features contribute to the classifier’s decision, thereby allowing users to critically evaluate the findings of such machine learning methods and to understand disease mechanisms. The majority of published work addresses the question of statistical inference for support vector classification using permutation tests based on SVM weight vectors. Such permutation testing ignores the SVM margin, which is critical in SVM theory. In this work we emphasize the use of a statistic that explicitly accounts for the SVM margin and show that the null distributions associated with this statistic are asymptotically normal. Further, our experiments show that this statistic is a lot less conservative as compared to weight based permutation tests and yet specific enough to tease out multivariate patterns in the data. Thus, we can better understand the multivariate patterns that the SVM uses for neuroimaging based classification. PMID:26210913

A novel chaotic image encryption scheme using DNA sequence operations

NASA Astrophysics Data System (ADS)

Wang, Xing-Yuan; Zhang, Ying-Qian; Bao, Xue-Mei

2015-10-01

In this paper, we propose a novel image encryption scheme based on DNA (Deoxyribonucleic acid) sequence operations and chaotic system. Firstly, we perform bitwise exclusive OR operation on the pixels of the plain image using the pseudorandom sequences produced by the spatiotemporal chaos system, i.e., CML (coupled map lattice). Secondly, a DNA matrix is obtained by encoding the confused image using a kind of DNA encoding rule. Then we generate the new initial conditions of the CML according to this DNA matrix and the previous initial conditions, which can make the encryption result closely depend on every pixel of the plain image. Thirdly, the rows and columns of the DNA matrix are permuted. Then, the permuted DNA matrix is confused once again. At last, after decoding the confused DNA matrix using a kind of DNA decoding rule, we obtain the ciphered image. Experimental results and theoretical analysis show that the scheme is able to resist various attacks, so it has extraordinarily high security.

Quantum one-way permutation over the finite field of two elements

NASA Astrophysics Data System (ADS)

de Castro, Alexandre

2017-06-01

In quantum cryptography, a one-way permutation is a bounded unitary operator U:{H} → {H} on a Hilbert space {H} that is easy to compute on every input, but hard to invert given the image of a random input. Levin (Probl Inf Transm 39(1):92-103, 2003) has conjectured that the unitary transformation g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \\in {GF}_{{2}^{\\Vert x\\Vert }}, is an information-theoretically secure operator within a polynomial factor. Here, we show that Levin's one-way permutation is provably secure because its output values are four maximally entangled two-qubit states, and whose probability of factoring them approaches zero faster than the multiplicative inverse of any positive polynomial poly( x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of classical one-way functions implies existence of a universal quantum one-way permutation that cannot be inverted in subexponential time in the worst case.

Cluster mass inference via random field theory.

PubMed

Zhang, Hui; Nichols, Thomas E; Johnson, Timothy D

2009-01-01

Cluster extent and voxel intensity are two widely used statistics in neuroimaging inference. Cluster extent is sensitive to spatially extended signals while voxel intensity is better for intense but focal signals. In order to leverage strength from both statistics, several nonparametric permutation methods have been proposed to combine the two methods. Simulation studies have shown that of the different cluster permutation methods, the cluster mass statistic is generally the best. However, to date, there is no parametric cluster mass inference available. In this paper, we propose a cluster mass inference method based on random field theory (RFT). We develop this method for Gaussian images, evaluate it on Gaussian and Gaussianized t-statistic images and investigate its statistical properties via simulation studies and real data. Simulation results show that the method is valid under the null hypothesis and demonstrate that it can be more powerful than the cluster extent inference method. Further, analyses with a single subject and a group fMRI dataset demonstrate better power than traditional cluster size inference, and good accuracy relative to a gold-standard permutation test.

A one-time pad color image cryptosystem based on SHA-3 and multiple chaotic systems

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Wang, Siwei; Zhang, Yingqian; Luo, Chao

2018-04-01

A novel image encryption algorithm is proposed that combines the SHA-3 hash function and two chaotic systems: the hyper-chaotic Lorenz and Chen systems. First, 384 bit keystream hash values are obtained by applying SHA-3 to plaintext. The sensitivity of the SHA-3 algorithm and chaotic systems ensures the effect of a one-time pad. Second, the color image is expanded into three-dimensional space. During permutation, it undergoes plane-plane displacements in the x, y and z dimensions. During diffusion, we use the adjacent pixel dataset and corresponding chaotic value to encrypt each pixel. Finally, the structure of alternating between permutation and diffusion is applied to enhance the level of security. Furthermore, we design techniques to improve the algorithm's encryption speed. Our experimental simulations show that the proposed cryptosystem achieves excellent encryption performance and can resist brute-force, statistical, and chosen-plaintext attacks.

Design of an image encryption scheme based on a multiple chaotic map

NASA Astrophysics Data System (ADS)

Tong, Xiao-Jun

2013-07-01

In order to solve the problem that chaos is degenerated in limited computer precision and Cat map is the small key space, this paper presents a chaotic map based on topological conjugacy and the chaotic characteristics are proved by Devaney definition. In order to produce a large key space, a Cat map named block Cat map is also designed for permutation process based on multiple-dimensional chaotic maps. The image encryption algorithm is based on permutation-substitution, and each key is controlled by different chaotic maps. The entropy analysis, differential analysis, weak-keys analysis, statistical analysis, cipher random analysis, and cipher sensibility analysis depending on key and plaintext are introduced to test the security of the new image encryption scheme. Through the comparison to the proposed scheme with AES, DES and Logistic encryption methods, we come to the conclusion that the image encryption method solves the problem of low precision of one dimensional chaotic function and has higher speed and higher security.

Embedding intensity image into a binary hologram with strong noise resistant capability

NASA Astrophysics Data System (ADS)

Zhuang, Zhaoyong; Jiao, Shuming; Zou, Wenbin; Li, Xia

2017-11-01

A digital hologram can be employed as a host image for image watermarking applications to protect information security. Past research demonstrates that a gray level intensity image can be embedded into a binary Fresnel hologram by error diffusion method or bit truncation coding method. However, the fidelity of the retrieved watermark image from binary hologram is generally not satisfactory, especially when the binary hologram is contaminated with noise. To address this problem, we propose a JPEG-BCH encoding method in this paper. First, we employ the JPEG standard to compress the intensity image into a binary bit stream. Next, we encode the binary bit stream with BCH code to obtain error correction capability. Finally, the JPEG-BCH code is embedded into the binary hologram. By this way, the intensity image can be retrieved with high fidelity by a BCH-JPEG decoder even if the binary hologram suffers from serious noise contamination. Numerical simulation results show that the image quality of retrieved intensity image with our proposed method is superior to the state-of-the-art work reported.

On complexity of trellis structure of linear block codes

NASA Technical Reports Server (NTRS)

Lin, Shu

1990-01-01

The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.

Tse computers. [Chinese pictograph character binary image processor design for high speed applications

NASA Technical Reports Server (NTRS)

Strong, J. P., III

1973-01-01

Tse computers have the potential of operating four or five orders of magnitude faster than present digital computers. The computers of the new design use binary images as their basic computational entity. The word 'tse' is the transliteration of the Chinese word for 'pictograph character.' Tse computers are large collections of devices that perform logical operations on binary images. The operations on binary images are to be performed over the entire image simultaneously.

A Novel Bearing Multi-Fault Diagnosis Approach Based on Weighted Permutation Entropy and an Improved SVM Ensemble Classifier.

PubMed

Zhou, Shenghan; Qian, Silin; Chang, Wenbing; Xiao, Yiyong; Cheng, Yang

2018-06-14

Timely and accurate state detection and fault diagnosis of rolling element bearings are very critical to ensuring the reliability of rotating machinery. This paper proposes a novel method of rolling bearing fault diagnosis based on a combination of ensemble empirical mode decomposition (EEMD), weighted permutation entropy (WPE) and an improved support vector machine (SVM) ensemble classifier. A hybrid voting (HV) strategy that combines SVM-based classifiers and cloud similarity measurement (CSM) was employed to improve the classification accuracy. First, the WPE value of the bearing vibration signal was calculated to detect the fault. Secondly, if a bearing fault occurred, the vibration signal was decomposed into a set of intrinsic mode functions (IMFs) by EEMD. The WPE values of the first several IMFs were calculated to form the fault feature vectors. Then, the SVM ensemble classifier was composed of binary SVM and the HV strategy to identify the bearing multi-fault types. Finally, the proposed model was fully evaluated by experiments and comparative studies. The results demonstrate that the proposed method can effectively detect bearing faults and maintain a high accuracy rate of fault recognition when a small number of training samples are available.

A ripple-spreading genetic algorithm for the aircraft sequencing problem.

PubMed

Hu, Xiao-Bing; Di Paolo, Ezequiel A

2011-01-01

When genetic algorithms (GAs) are applied to combinatorial problems, permutation representations are usually adopted. As a result, such GAs are often confronted with feasibility and memory-efficiency problems. With the aircraft sequencing problem (ASP) as a study case, this paper reports on a novel binary-representation-based GA scheme for combinatorial problems. Unlike existing GAs for the ASP, which typically use permutation representations based on aircraft landing order, the new GA introduces a novel ripple-spreading model which transforms the original landing-order-based ASP solutions into value-based ones. In the new scheme, arriving aircraft are projected as points into an artificial space. A deterministic method inspired by the natural phenomenon of ripple-spreading on liquid surfaces is developed, which uses a few parameters as input to connect points on this space to form a landing sequence. A traditional GA, free of feasibility and memory-efficiency problems, can then be used to evolve the ripple-spreading related parameters in order to find an optimal sequence. Since the ripple-spreading model is the centerpiece of the new algorithm, it is called the ripple-spreading GA (RSGA). The advantages of the proposed RSGA are illustrated by extensive comparative studies for the case of the ASP.

Soft decoding a self-dual (48, 24; 12) code

NASA Technical Reports Server (NTRS)

Solomon, G.

1993-01-01

A self-dual (48,24;12) code comes from restricting a binary cyclic (63,18;36) code to a 6 x 7 matrix, adding an eighth all-zero column, and then adjoining six dimensions to this extended 6 x 8 matrix. These six dimensions are generated by linear combinations of row permutations of a 6 x 8 matrix of weight 12, whose sums of rows and columns add to one. A soft decoding using these properties and approximating maximum likelihood is presented here. This is preliminary to a possible soft decoding of the box (72,36;15) code that promises a 7.7-dB theoretical coding under maximum likelihood.

Probing and exploiting the chaotic dynamics of a hydrodynamic photochemical oscillator to implement all the basic binary logic functions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hayashi, Kenta; Department of Chemistry, Biology, and Biotechnology, University of Perugia, 06123 Perugia; Gotoda, Hiroshi

2016-05-15

The convective motions within a solution of a photochromic spiro-oxazine being irradiated by UV only on the bottom part of its volume, give rise to aperiodic spectrophotometric dynamics. In this paper, we study three nonlinear properties of the aperiodic time series: permutation entropy, short-term predictability and long-term unpredictability, and degree distribution of the visibility graph networks. After ascertaining the extracted chaotic features, we show how the aperiodic time series can be exploited to implement all the fundamental two-inputs binary logic functions (AND, OR, NAND, NOR, XOR, and XNOR) and some basic arithmetic operations (half-adder, full-adder, half-subtractor). This is possible duemore » to the wide range of states a nonlinear system accesses in the course of its evolution. Therefore, the solution of the convective photochemical oscillator results in hardware for chaos-computing alternative to conventional complementary metal-oxide semiconductor-based integrated circuits.« less

Tolerance of a Knotted Near-Infrared Fluorescent Protein to Random Circular Permutation.

PubMed

Pandey, Naresh; Kuypers, Brianna E; Nassif, Barbara; Thomas, Emily E; Alnahhas, Razan N; Segatori, Laura; Silberg, Jonathan J

2016-07-12

Bacteriophytochrome photoreceptors (BphP) are knotted proteins that have been developed as near-infrared fluorescent protein (iRFP) reporters of gene expression. To explore how rearrangements in the peptides that interlace into the knot within the BphP photosensory core affect folding, we subjected iRFPs to random circular permutation using an improved transposase mutagenesis strategy and screened for variants that fluoresce. We identified 27 circularly permuted iRFPs that display biliverdin-dependent fluorescence in Escherichia coli. The variants with the brightest whole cell fluorescence initiated translation at residues near the domain linker and knot tails, although fluorescent variants that initiated translation within the PAS and GAF domains were discovered. Circularly permuted iRFPs retained sufficient cofactor affinity to fluoresce in tissue culture without the addition of biliverdin, and one variant displayed enhanced fluorescence when expressed in bacteria and tissue culture. This variant displayed a quantum yield similar to that of iRFPs but exhibited increased resistance to chemical denaturation, suggesting that the observed increase in the magnitude of the signal arose from more efficient protein maturation. These results show how the contact order of a knotted BphP can be altered without disrupting chromophore binding and fluorescence, an important step toward the creation of near-infrared biosensors with expanded chemical sensing functions for in vivo imaging.

Tolerance of a knotted near infrared fluorescent protein to random circular permutation

PubMed Central

Pandey, Naresh; Kuypers, Brianna E.; Nassif, Barbara; Thomas, Emily E.; Alnahhas, Razan N.; Segatori, Laura; Silberg, Jonathan J.

2016-01-01

Bacteriophytochrome photoreceptors (BphP) are knotted proteins that have been developed as near-infrared fluorescent protein (iRFP) reporters of gene expression. To explore how rearrangements in the peptides that interlace into the knot within the BphP photosensory core affect folding, we subjected iRFP to random circular permutation using an improved transposase mutagenesis strategy and screened for variants that fluoresce. We identified twenty seven circularly permuted iRFP that display biliverdin-dependent fluorescence in Escherichia coli. The variants with the brightest whole cell fluorescence initiated translation at residues near the domain linker and knot tails, although fluorescent variants were discovered that initiated translation within the PAS and GAF domains. Circularly permuted iRFP retained sufficient cofactor affinity to fluoresce in tissue culture without the addition of biliverdin, and one variant displayed enhanced fluorescence when expressed in bacteria and tissue culture. This variant displayed a similar quantum yield as iRFP, but exhibited increased resistance to chemical denaturation, suggesting that the observed signal increase arose from more efficient protein maturation. These results show how the contact order of a knotted BphP can be altered without disrupting chromophore binding and fluorescence, an important step towards the creation of near-infrared biosensors with expanded chemical-sensing functions for in vivo imaging. PMID:27304983

Palmprint verification using Lagrangian decomposition and invariant interest points

NASA Astrophysics Data System (ADS)

Gupta, P.; Rattani, A.; Kisku, D. R.; Hwang, C. J.; Sing, J. K.

2011-06-01

This paper presents a palmprint based verification system using SIFT features and Lagrangian network graph technique. We employ SIFT for feature extraction from palmprint images whereas the region of interest (ROI) which has been extracted from wide palm texture at the preprocessing stage, is considered for invariant points extraction. Finally, identity is established by finding permutation matrix for a pair of reference and probe palm graphs drawn on extracted SIFT features. Permutation matrix is used to minimize the distance between two graphs. The propsed system has been tested on CASIA and IITK palmprint databases and experimental results reveal the effectiveness and robustness of the system.

Binary image encryption in a joint transform correlator scheme by aid of run-length encoding and QR code

NASA Astrophysics Data System (ADS)

Qin, Yi; Wang, Zhipeng; Wang, Hongjuan; Gong, Qiong

2018-07-01

We propose a binary image encryption method in joint transform correlator (JTC) by aid of the run-length encoding (RLE) and Quick Response (QR) code, which enables lossless retrieval of the primary image. The binary image is encoded with RLE to obtain the highly compressed data, and then the compressed binary image is further scrambled using a chaos-based method. The compressed and scrambled binary image is then transformed into one QR code that will be finally encrypted in JTC. The proposed method successfully, for the first time to our best knowledge, encodes a binary image into a QR code with the identical size of it, and therefore may probe a new way for extending the application of QR code in optical security. Moreover, the preprocessing operations, including RLE, chaos scrambling and the QR code translation, append an additional security level on JTC. We present digital results that confirm our approach.

Algorithms and programming tools for image processing on the MPP:3

NASA Technical Reports Server (NTRS)

Reeves, Anthony P.

1987-01-01

This is the third and final report on the work done for NASA Grant 5-403 on Algorithms and Programming Tools for Image Processing on the MPP:3. All the work done for this grant is summarized in the introduction. Work done since August 1986 is reported in detail. Research for this grant falls under the following headings: (1) fundamental algorithms for the MPP; (2) programming utilities for the MPP; (3) the Parallel Pascal Development System; and (4) performance analysis. In this report, the results of two efforts are reported: region growing, and performance analysis of important characteristic algorithms. In each case, timing results from MPP implementations are included. A paper is included in which parallel algorithms for region growing on the MPP is discussed. These algorithms permit different sized regions to be merged in parallel. Details on the implementation and peformance of several important MPP algorithms are given. These include a number of standard permutations, the FFT, convolution, arbitrary data mappings, image warping, and pyramid operations, all of which have been implemented on the MPP. The permutation and image warping functions have been included in the standard development system library.

Optimized OFDM Transmission of Encrypted Image Over Fading Channel

NASA Astrophysics Data System (ADS)

Eldin, Salwa M. Serag

2014-11-01

This paper compares the quality of diffusion-based and permutation-based encrypted image transmission using orthogonal frequency division multiplexing (OFDM) over wireless fading channel. Sensitivity to carrier frequency offsets (CFOs) is one of the limitations in OFDM transmission that was compensated here. Different OFDM diffusions are investigated to study encrypted image transmission optimization. Peak signal-to-noise ratio between the original image and the decrypted image is used to evaluate the received image quality. Chaotic encrypted image modulated with CFOs compensated FFT-OFDM was found to give outstanding performance against other encryption and modulation techniques.

Invariant correlation to position and rotation using a binary mask applied to binary and gray images

NASA Astrophysics Data System (ADS)

Álvarez-Borrego, Josué; Solorza, Selene; Bueno-Ibarra, Mario A.

2013-05-01

In this paper more alternative ways to generate the binary ring masks are studied and a new methodology is presented when in the analysis the image come with some distortion due to rotation. This new algorithm requires low computational cost. Signature vectors of the target so like signature vectors of the object to be recognized in the problem image are obtained using a binary ring mask constructed in accordance with the real or the imaginary part of their Fourier transform analyzing two different conditions in each one. In this manner, each image target or problem image, will have four unique binary ring masks. The four ways are analyzed and the best is chosen. In addition, due to any image with rotation include some distortion, the best transect is chosen in the Fourier plane in order to obtain the best signature through the different ways to obtain the binary mask. This methodology is applied to two cases: to identify different types of alphabetic letters in Arial font and to identify different fossil diatoms images. Considering the great similarity between diatom images the results obtained are excellent.

Rotation invariant deep binary hashing for fast image retrieval

NASA Astrophysics Data System (ADS)

Dai, Lai; Liu, Jianming; Jiang, Aiwen

2017-07-01

In this paper, we study how to compactly represent image's characteristics for fast image retrieval. We propose supervised rotation invariant compact discriminative binary descriptors through combining convolutional neural network with hashing. In the proposed network, binary codes are learned by employing a hidden layer for representing latent concepts that dominate on class labels. A loss function is proposed to minimize the difference between binary descriptors that describe reference image and the rotated one. Compared with some other supervised methods, the proposed network doesn't have to require pair-wised inputs for binary code learning. Experimental results show that our method is effective and achieves state-of-the-art results on the CIFAR-10 and MNIST datasets.

A Novel Bit-level Image Encryption Method Based on Chaotic Map and Dynamic Grouping

NASA Astrophysics Data System (ADS)

Zhang, Guo-Ji; Shen, Yan

2012-10-01

In this paper, a novel bit-level image encryption method based on dynamic grouping is proposed. In the proposed method, the plain-image is divided into several groups randomly, then permutation-diffusion process on bit level is carried out. The keystream generated by logistic map is related to the plain-image, which confuses the relationship between the plain-image and the cipher-image. The computer simulation results of statistical analysis, information entropy analysis and sensitivity analysis show that the proposed encryption method is secure and reliable enough to be used for communication application.

Extracting the Data From the LCM vk4 Formatted Output File

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wendelberger, James G.

These are slides about extracting the data from the LCM vk4 formatted output file. The following is covered: vk4 file produced by Keyence VK Software, custom analysis, no off the shelf way to read the file, reading the binary data in a vk4 file, various offsets in decimal lines, finding the height image data, directly in MATLAB, binary output beginning of height image data, color image information, color image binary data, color image decimal and binary data, MATLAB code to read vk4 file (choose a file, read the file, compute offsets, read optical image, laser optical image, read and computemore » laser intensity image, read height image, timing, display height image, display laser intensity image, display RGB laser optical images, display RGB optical images, display beginning data and save images to workspace, gamma correction subroutine), reading intensity form the vk4 file, linear in the low range, linear in the high range, gamma correction for vk4 files, computing the gamma intensity correction, observations.« less

BinCat: a Catalog of Nearby Binary Stars with Tools for Calculating Light-Leakage for Direct Imaging Missions

NASA Astrophysics Data System (ADS)

Holte, Elias Peter; Sirbu, Dan; Belikov, Ruslan

2018-01-01

Binary stars have been largely left out of direct imaging surveys for exoplanets, specifically for earth-sized planets in their star's habitable zone. Utilizing new direct imaging techniques brings us closer to being able to detect earth-like exoplanets around binary stars. In preparation for the upcoming WFIRST mission and other direct imaging-capable missions (HabEx, LUVIOR) it is important to understand the expected science yield resulting from the implementation of these imaging techniques. BinCat is a catalog of binary systems within 30 parsecs to be used as a target list for future direct imaging missions. There is a non-static component along with BinCat that allows researchers to predict the expected light-leakage between a binary component and its off-axis companion (a value critical to the aforementioned techniques) at any epoch. This is accomplished by using orbital elements from the Sixth Orbital Catalog to model the orbits of the binaries. The software was validated against the historical data used to generate the orbital parameters. When orbital information is unknown or the binaries are purely optical the proper motion of the pair taken from the Washington Double Star catalog is integrated in time to estimate expected light-leakage.

Blocks in cycles and k-commuting permutations.

PubMed

Moreno, Rutilo; Rivera, Luis Manuel

2016-01-01

We introduce and study k -commuting permutations. One of our main results is a characterization of permutations that k -commute with a given permutation. Using this characterization, we obtain formulas for the number of permutations that k -commute with a permutation [Formula: see text], for some cycle types of [Formula: see text]. Our enumerative results are related with integer sequences in "The On-line Encyclopedia of Integer Sequences", and in some cases provide new interpretations for such sequences.

Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation.

PubMed

Gog, Simon; Bader, Martin

2008-10-01

The problem of sorting signed permutations by reversals is a well-studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pevzner in 1995. The algorithm was improved several times, and nowadays the most efficient algorithm has a subquadratic running time. Simple permutations played an important role in the development of these algorithms. Although the latest result of Tannier et al. does not require simple permutations, the preliminary version of their algorithm as well as the first polynomial time algorithm of Hannenhalli and Pevzner use the structure of simple permutations. More precisely, the latter algorithms require a precomputation that transforms a permutation into an equivalent simple permutation. To the best of our knowledge, all published algorithms for this transformation have at least a quadratic running time. For further investigations on genome rearrangement problems, the existence of a fast algorithm for the transformation could be crucial. Another important task is the back transformation, i.e. if we have a sorting on the simple permutation, transform it into a sorting on the original permutation. Again, the naive approach results in an algorithm with quadratic running time. In this paper, we present a linear time algorithm for transforming a permutation into an equivalent simple permutation, and an O(n log n) algorithm for the back transformation of the sorting sequence.

A Random Variable Related to the Inversion Vector of a Partial Random Permutation

ERIC Educational Resources Information Center

Laghate, Kavita; Deshpande, M. N.

2005-01-01

In this article, we define the inversion vector of a permutation of the integers 1, 2,..., n. We set up a particular kind of permutation, called a partial random permutation. The sum of the elements of the inversion vector of such a permutation is a random variable of interest.

Permutation testing of orthogonal factorial effects in a language-processing experiment using fMRI.

PubMed

Suckling, John; Davis, Matthew H; Ooi, Cinly; Wink, Alle Meije; Fadili, Jalal; Salvador, Raymond; Welchew, David; Sendur, Levent; Maxim, Vochita; Bullmore, Edward T

2006-05-01

The block-paradigm of the Functional Image Analysis Contest (FIAC) dataset was analysed with the Brain Activation and Morphological Mapping software. Permutation methods in the wavelet domain were used for inference on cluster-based test statistics of orthogonal contrasts relevant to the factorial design of the study, namely: the average response across all active blocks, the main effect of speaker, the main effect of sentence, and the interaction between sentence and speaker. Extensive activation was seen with all these contrasts. In particular, different vs. same-speaker blocks produced elevated activation in bilateral regions of the superior temporal lobe and repetition suppression for linguistic materials (same vs. different-sentence blocks) in left inferior frontal regions. These are regions previously reported in the literature. Additional regions were detected in this study, perhaps due to the enhanced sensitivity of the methodology. Within-block sentence suppression was tested post-hoc by regression of an exponential decay model onto the extracted time series from the left inferior frontal gyrus, but no strong evidence of such an effect was found. The significance levels set for the activation maps are P-values at which we expect <1 false-positive cluster per image. Nominal type I error control was verified by empirical testing of a test statistic corresponding to a randomly ordered design matrix. The small size of the BOLD effect necessitates sensitive methods of detection of brain activation. Permutation methods permit the necessary flexibility to develop novel test statistics to meet this challenge.

A transposase strategy for creating libraries of circularly permuted proteins.

PubMed

Mehta, Manan M; Liu, Shirley; Silberg, Jonathan J

2012-05-01

A simple approach for creating libraries of circularly permuted proteins is described that is called PERMutation Using Transposase Engineering (PERMUTE). In PERMUTE, the transposase MuA is used to randomly insert a minitransposon that can function as a protein expression vector into a plasmid that contains the open reading frame (ORF) being permuted. A library of vectors that express different permuted variants of the ORF-encoded protein is created by: (i) using bacteria to select for target vectors that acquire an integrated minitransposon; (ii) excising the ensemble of ORFs that contain an integrated minitransposon from the selected vectors; and (iii) circularizing the ensemble of ORFs containing integrated minitransposons using intramolecular ligation. Construction of a Thermotoga neapolitana adenylate kinase (AK) library using PERMUTE revealed that this approach produces vectors that express circularly permuted proteins with distinct sequence diversity from existing methods. In addition, selection of this library for variants that complement the growth of Escherichia coli with a temperature-sensitive AK identified functional proteins with novel architectures, suggesting that PERMUTE will be useful for the directed evolution of proteins with new functions.

A transposase strategy for creating libraries of circularly permuted proteins

PubMed Central

Mehta, Manan M.; Liu, Shirley; Silberg, Jonathan J.

2012-01-01

A simple approach for creating libraries of circularly permuted proteins is described that is called PERMutation Using Transposase Engineering (PERMUTE). In PERMUTE, the transposase MuA is used to randomly insert a minitransposon that can function as a protein expression vector into a plasmid that contains the open reading frame (ORF) being permuted. A library of vectors that express different permuted variants of the ORF-encoded protein is created by: (i) using bacteria to select for target vectors that acquire an integrated minitransposon; (ii) excising the ensemble of ORFs that contain an integrated minitransposon from the selected vectors; and (iii) circularizing the ensemble of ORFs containing integrated minitransposons using intramolecular ligation. Construction of a Thermotoga neapolitana adenylate kinase (AK) library using PERMUTE revealed that this approach produces vectors that express circularly permuted proteins with distinct sequence diversity from existing methods. In addition, selection of this library for variants that complement the growth of Escherichia coli with a temperature-sensitive AK identified functional proteins with novel architectures, suggesting that PERMUTE will be useful for the directed evolution of proteins with new functions. PMID:22319214

Structured Forms Reference Set of Binary Images (SFRS)

National Institute of Standards and Technology Data Gateway

NIST Structured Forms Reference Set of Binary Images (SFRS) (Web, free access)   The NIST Structured Forms Database (Special Database 2) consists of 5,590 pages of binary, black-and-white images of synthesized documents. The documents in this database are 12 different tax forms from the IRS 1040 Package X for the year 1988.

Quick probabilistic binary image matching: changing the rules of the game

NASA Astrophysics Data System (ADS)

Mustafa, Adnan A. Y.

2016-09-01

A Probabilistic Matching Model for Binary Images (PMMBI) is presented that predicts the probability of matching binary images with any level of similarity. The model relates the number of mappings, the amount of similarity between the images and the detection confidence. We show the advantage of using a probabilistic approach to matching in similarity space as opposed to a linear search in size space. With PMMBI a complete model is available to predict the quick detection of dissimilar binary images. Furthermore, the similarity between the images can be measured to a good degree if the images are highly similar. PMMBI shows that only a few pixels need to be compared to detect dissimilarity between images, as low as two pixels in some cases. PMMBI is image size invariant; images of any size can be matched at the same quick speed. Near-duplicate images can also be detected without much difficulty. We present tests on real images that show the prediction accuracy of the model.

The True Ultracool Binary Fraction Using Spectral Binaries

NASA Astrophysics Data System (ADS)

Bardalez Gagliuffi, Daniella; Burgasser, Adam J.; Schmidt, Sarah J.; Gagné, Jonathan; Faherty, Jacqueline K.; Cruz, Kelle; Gelino, Chris

2018-01-01

Brown dwarfs bridge the gap between stars and giant planets. While the essential mechanisms governing their formation are not well constrained, binary statistics are a direct outcome of the formation process, and thus provide a means to test formation theories. Observational constraints on the brown dwarf binary fraction place it at 10 ‑ 20%, dominated by imaging studies (85% of systems) with the most common separation at 4 AU. This coincides with the resolution limit of state-of-the-art imaging techniques, suggesting that the binary fraction is underestimated. We have developed a separation-independent method to identify and characterize tightly-separated (< 5 AU) binary systems of brown dwarfs as spectral binaries by identifying traces of methane in the spectra of late-M and early-L dwarfs. Imaging follow-up of 17 spectral binaries yielded 3 (18%) resolved systems, corroborating the observed binary fraction, but 5 (29%) known binaries were missed, reinforcing the hypothesis that the short-separation systems are undercounted. In order to find the true binary fraction of brown dwarfs, we have compiled a volume-limited, spectroscopic sample of M7-L5 dwarfs and searched for T dwarf companions. In the 25 pc volume, 4 candidates were found, three of which are already confirmed, leading to a spectral binary fraction of 0.95 ± 0.50%, albeit for a specific combination of spectral types. To extract the true binary fraction and determine the biases of the spectral binary method, we have produced a binary population simulation based on different assumptions of the mass function, age distribution, evolutionary models and mass ratio distribution. Applying the correction fraction resulting from this method to the observed spectral binary fraction yields a true binary fraction of 27 ± 4%, which is roughly within 1σ of the binary fraction obtained from high resolution imaging studies, radial velocity and astrometric monitoring. This method can be extended to identify giant planet companions to young brown dwarfs.

Two-dimensional PCA-based human gait identification

NASA Astrophysics Data System (ADS)

Chen, Jinyan; Wu, Rongteng

2012-11-01

It is very necessary to recognize person through visual surveillance automatically for public security reason. Human gait based identification focus on recognizing human by his walking video automatically using computer vision and image processing approaches. As a potential biometric measure, human gait identification has attracted more and more researchers. Current human gait identification methods can be divided into two categories: model-based methods and motion-based methods. In this paper a two-Dimensional Principal Component Analysis and temporal-space analysis based human gait identification method is proposed. Using background estimation and image subtraction we can get a binary images sequence from the surveillance video. By comparing the difference of two adjacent images in the gait images sequence, we can get a difference binary images sequence. Every binary difference image indicates the body moving mode during a person walking. We use the following steps to extract the temporal-space features from the difference binary images sequence: Projecting one difference image to Y axis or X axis we can get two vectors. Project every difference image in the difference binary images sequence to Y axis or X axis difference binary images sequence we can get two matrixes. These two matrixes indicate the styles of one walking. Then Two-Dimensional Principal Component Analysis(2DPCA) is used to transform these two matrixes to two vectors while at the same time keep the maximum separability. Finally the similarity of two human gait images is calculated by the Euclidean distance of the two vectors. The performance of our methods is illustrated using the CASIA Gait Database.

Forecast Modelling via Variations in Binary Image-Encoded Information Exploited by Deep Learning Neural Networks.

PubMed

Liu, Da; Xu, Ming; Niu, Dongxiao; Wang, Shoukai; Liang, Sai

2016-01-01

Traditional forecasting models fit a function approximation from dependent invariables to independent variables. However, they usually get into trouble when date are presented in various formats, such as text, voice and image. This study proposes a novel image-encoded forecasting method that input and output binary digital two-dimensional (2D) images are transformed from decimal data. Omitting any data analysis or cleansing steps for simplicity, all raw variables were selected and converted to binary digital images as the input of a deep learning model, convolutional neural network (CNN). Using shared weights, pooling and multiple-layer back-propagation techniques, the CNN was adopted to locate the nexus among variations in local binary digital images. Due to the computing capability that was originally developed for binary digital bitmap manipulation, this model has significant potential for forecasting with vast volume of data. The model was validated by a power loads predicting dataset from the Global Energy Forecasting Competition 2012.

Forecast Modelling via Variations in Binary Image-Encoded Information Exploited by Deep Learning Neural Networks

PubMed Central

Xu, Ming; Niu, Dongxiao; Wang, Shoukai; Liang, Sai

2016-01-01

Traditional forecasting models fit a function approximation from dependent invariables to independent variables. However, they usually get into trouble when date are presented in various formats, such as text, voice and image. This study proposes a novel image-encoded forecasting method that input and output binary digital two-dimensional (2D) images are transformed from decimal data. Omitting any data analysis or cleansing steps for simplicity, all raw variables were selected and converted to binary digital images as the input of a deep learning model, convolutional neural network (CNN). Using shared weights, pooling and multiple-layer back-propagation techniques, the CNN was adopted to locate the nexus among variations in local binary digital images. Due to the computing capability that was originally developed for binary digital bitmap manipulation, this model has significant potential for forecasting with vast volume of data. The model was validated by a power loads predicting dataset from the Global Energy Forecasting Competition 2012. PMID:27281032

Constrained Metric Learning by Permutation Inducing Isometries.

PubMed

Bosveld, Joel; Mahmood, Arif; Huynh, Du Q; Noakes, Lyle

2016-01-01

The choice of metric critically affects the performance of classification and clustering algorithms. Metric learning algorithms attempt to improve performance, by learning a more appropriate metric. Unfortunately, most of the current algorithms learn a distance function which is not invariant to rigid transformations of images. Therefore, the distances between two images and their rigidly transformed pair may differ, leading to inconsistent classification or clustering results. We propose to constrain the learned metric to be invariant to the geometry preserving transformations of images that induce permutations in the feature space. The constraint that these transformations are isometries of the metric ensures consistent results and improves accuracy. Our second contribution is a dimension reduction technique that is consistent with the isometry constraints. Our third contribution is the formulation of the isometry constrained logistic discriminant metric learning (IC-LDML) algorithm, by incorporating the isometry constraints within the objective function of the LDML algorithm. The proposed algorithm is compared with the existing techniques on the publicly available labeled faces in the wild, viewpoint-invariant pedestrian recognition, and Toy Cars data sets. The IC-LDML algorithm has outperformed existing techniques for the tasks of face recognition, person identification, and object classification by a significant margin.

Many local pattern texture features: which is better for image-based multilabel human protein subcellular localization classification?

PubMed

Yang, Fan; Xu, Ying-Ying; Shen, Hong-Bin

2014-01-01

Human protein subcellular location prediction can provide critical knowledge for understanding a protein's function. Since significant progress has been made on digital microscopy, automated image-based protein subcellular location classification is urgently needed. In this paper, we aim to investigate more representative image features that can be effectively used for dealing with the multilabel subcellular image samples. We prepared a large multilabel immunohistochemistry (IHC) image benchmark from the Human Protein Atlas database and tested the performance of different local texture features, including completed local binary pattern, local tetra pattern, and the standard local binary pattern feature. According to our experimental results from binary relevance multilabel machine learning models, the completed local binary pattern, and local tetra pattern are more discriminative for describing IHC images when compared to the traditional local binary pattern descriptor. The combination of these two novel local pattern features and the conventional global texture features is also studied. The enhanced performance of final binary relevance classification model trained on the combined feature space demonstrates that different features are complementary to each other and thus capable of improving the accuracy of classification.

Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation

PubMed Central

Recchia, Gabriel; Sahlgren, Magnus; Kanerva, Pentti; Jones, Michael N.

2015-01-01

Circular convolution and random permutation have each been proposed as neurally plausible binding operators capable of encoding sequential information in semantic memory. We perform several controlled comparisons of circular convolution and random permutation as means of encoding paired associates as well as encoding sequential information. Random permutations outperformed convolution with respect to the number of paired associates that can be reliably stored in a single memory trace. Performance was equal on semantic tasks when using a small corpus, but random permutations were ultimately capable of achieving superior performance due to their higher scalability to large corpora. Finally, “noisy” permutations in which units are mapped to other units arbitrarily (no one-to-one mapping) perform nearly as well as true permutations. These findings increase the neurological plausibility of random permutations and highlight their utility in vector space models of semantics. PMID:25954306

Finite state model and compatibility theory - New analysis tools for permutation networks

NASA Technical Reports Server (NTRS)

Huang, S.-T.; Tripathi, S. K.

1986-01-01

A simple model to describe the fundamental operation theory of shuffle-exchange-type permutation networks, the finite permutation machine (FPM), is described, and theorems which transform the control matrix result to a continuous compatible vector result are developed. It is found that only 2n-1 shuffle exchange passes are necessary, and that 3n-3 passes are sufficient, to realize all permutations, reducing the sufficient number of passes by two from previous results. The flexibility of the approach is demonstrated by the description of a stack permutation machine (SPM) which can realize all permutations, and by showing that the FPM corresponding to the Benes (1965) network belongs to the SPM. The FPM corresponding to the network with two cascaded reverse-exchange networks is found to realize all permutations, and a simple mechanism to verify several equivalence relationships of various permutation networks is discussed.

Sorting permutations by prefix and suffix rearrangements.

PubMed

Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni

2017-02-01

Some interesting combinatorial problems have been motivated by genome rearrangements, which are mutations that affect large portions of a genome. When we represent genomes as permutations, the goal is to transform a given permutation into the identity permutation with the minimum number of rearrangements. When they affect segments from the beginning (respectively end) of the permutation, they are called prefix (respectively suffix) rearrangements. This paper presents results for rearrangement problems that involve prefix and suffix versions of reversals and transpositions considering unsigned and signed permutations. We give 2-approximation and ([Formula: see text])-approximation algorithms for these problems, where [Formula: see text] is a constant divided by the number of breakpoints (pairs of consecutive elements that should not be consecutive in the identity permutation) in the input permutation. We also give bounds for the diameters concerning these problems and provide ways of improving the practical results of our algorithms.

An ensemble of SVM classifiers based on gene pairs.

PubMed

Tong, Muchenxuan; Liu, Kun-Hong; Xu, Chungui; Ju, Wenbin

2013-07-01

In this paper, a genetic algorithm (GA) based ensemble support vector machine (SVM) classifier built on gene pairs (GA-ESP) is proposed. The SVMs (base classifiers of the ensemble system) are trained on different informative gene pairs. These gene pairs are selected by the top scoring pair (TSP) criterion. Each of these pairs projects the original microarray expression onto a 2-D space. Extensive permutation of gene pairs may reveal more useful information and potentially lead to an ensemble classifier with satisfactory accuracy and interpretability. GA is further applied to select an optimized combination of base classifiers. The effectiveness of the GA-ESP classifier is evaluated on both binary-class and multi-class datasets. Copyright © 2013 Elsevier Ltd. All rights reserved.

A Novel Binarization Algorithm for Ballistics Firearm Identification

NASA Astrophysics Data System (ADS)

Li, Dongguang

The identification of ballistics specimens from imaging systems is of paramount importance in criminal investigation. Binarization plays a key role in preprocess of recognizing cartridges in the ballistic imaging systems. Unfortunately, it is very difficult to get the satisfactory binary image using existing binary algorithms. In this paper, we utilize the global and local thresholds to enhance the image binarization. Importantly, we present a novel criterion for effectively detecting edges in the images. Comprehensive experiments have been conducted over sample ballistic images. The empirical results demonstrate the proposed method can provide a better solution than existing binary algorithms.

Direct Exoplanet Detection with Binary Differential Imaging

NASA Astrophysics Data System (ADS)

Rodigas, Timothy J.; Weinberger, Alycia; Mamajek, Eric E.; Males, Jared R.; Close, Laird M.; Morzinski, Katie; Hinz, Philip M.; Kaib, Nathan

2015-10-01

Binaries are typically excluded from direct imaging exoplanet surveys. However, the recent findings of Kepler and radial velocity programs show that planets can and do form in binary systems. Here, we suggest that visual binaries offer unique advantages for direct imaging. We show that Binary Differential Imaging (BDI), whereby two stars are imaged simultaneously at the same wavelength within the isoplanatic patch at a high Strehl ratio, offers improved point spread function (PSF) subtraction that can result in increased sensitivity to planets close to each star. We demonstrate this by observing a young visual binary separated by 4″ with MagAO/Clio-2 at 3.9 μm, where the Strehl ratio is high, the isoplanatic patch is large, and giant planets are bright. Comparing BDI to angular differential imaging (ADI), we find that BDI’s 5σ contrast is ˜0.5 mag better than ADI’s within ˜1″ for the particular binary we observed. Because planets typically reside close to their host stars, BDI is a promising technique for discovering exoplanets in stellar systems that are often ignored. BDI is also 2-4× more efficient than ADI and classical reference PSF subtraction, since planets can be detected around both the target and PSF reference simultaneously. We are currently exploiting this technique in a new MagAO survey for giant planets in 140 young nearby visual binaries. BDI on a space-based telescope would not be limited by isoplanatism effects and would therefore be an even more powerful tool for imaging and discovering planets. This paper includes data obtained at the 6.5 m Magellan Telescopes located at Las Campanas Observatory, Chile.

Comparing object recognition from binary and bipolar edge images for visual prostheses.

PubMed

Jung, Jae-Hyun; Pu, Tian; Peli, Eli

2016-11-01

Visual prostheses require an effective representation method due to the limited display condition which has only 2 or 3 levels of grayscale in low resolution. Edges derived from abrupt luminance changes in images carry essential information for object recognition. Typical binary (black and white) edge images have been used to represent features to convey essential information. However, in scenes with a complex cluttered background, the recognition rate of the binary edge images by human observers is limited and additional information is required. The polarity of edges and cusps (black or white features on a gray background) carries important additional information; the polarity may provide shape from shading information missing in the binary edge image. This depth information may be restored by using bipolar edges. We compared object recognition rates from 16 binary edge images and bipolar edge images by 26 subjects to determine the possible impact of bipolar filtering in visual prostheses with 3 or more levels of grayscale. Recognition rates were higher with bipolar edge images and the improvement was significant in scenes with complex backgrounds. The results also suggest that erroneous shape from shading interpretation of bipolar edges resulting from pigment rather than boundaries of shape may confound the recognition.

Structured Forms Reference Set of Binary Images II (SFRS2)

National Institute of Standards and Technology Data Gateway

NIST Structured Forms Reference Set of Binary Images II (SFRS2) (Web, free access)   The second NIST database of structured forms (Special Database 6) consists of 5,595 pages of binary, black-and-white images of synthesized documents containing hand-print. The documents in this database are 12 different tax forms with the IRS 1040 Package X for the year 1988.

A Reversible Logical Circuit Synthesis Algorithm Based on Decomposition of Cycle Representations of Permutations

NASA Astrophysics Data System (ADS)

Zhu, Wei; Li, Zhiqiang; Zhang, Gaoman; Pan, Suhan; Zhang, Wei

2018-05-01

A reversible function is isomorphic to a permutation and an arbitrary permutation can be represented by a series of cycles. A new synthesis algorithm for 3-qubit reversible circuits was presented. It consists of two parts, the first part used the Number of reversible function's Different Bits (NDBs) to decide whether the NOT gate should be added to decrease the Hamming distance of the input and output vectors; the second part was based on the idea of exploring properties of the cycle representation of permutations, decomposed the cycles to make the permutation closer to the identity permutation and finally turn into the identity permutation, it was realized by using totally controlled Toffoli gates with positive and negative controls.

A New Quantum Gray-Scale Image Encoding Scheme

NASA Astrophysics Data System (ADS)

Naseri, Mosayeb; Abdolmaleky, Mona; Parandin, Fariborz; Fatahi, Negin; Farouk, Ahmed; Nazari, Reza

2018-02-01

In this paper, a new quantum images encoding scheme is proposed. The proposed scheme mainly consists of four different encoding algorithms. The idea behind of the scheme is a binary key generated randomly for each pixel of the original image. Afterwards, the employed encoding algorithm is selected corresponding to the qubit pair of the generated randomized binary key. The security analysis of the proposed scheme proved its enhancement through both randomization of the generated binary image key and altering the gray-scale value of the image pixels using the qubits of randomized binary key. The simulation of the proposed scheme assures that the final encoded image could not be recognized visually. Moreover, the histogram diagram of encoded image is flatter than the original one. The Shannon entropies of the final encoded images are significantly higher than the original one, which indicates that the attacker can not gain any information about the encoded images. Supported by Kermanshah Branch, Islamic Azad University, Kermanshah, IRAN

The Großschwabhausen binary survey

NASA Astrophysics Data System (ADS)

Mugrauer, M.; Buder, S.; Reum, F.; Birth, A.

2017-01-01

Background: Since 2009, the Großschwabhausen binary survey is being carried out at the University Observatory Jena. This new imaging survey uses available time slots during photometric monitoring campaigns, caused by nonphotometric weather conditions, which often exhibit good atmospheric seeing. The goal of the project is to obtain current relative astrometric measurements of the binary systems that are listed in the Washington Visual Double Star Catalog. Materials and Methods: For the survey we use the Refraktor-Teleskop-Kamera at the University Observatory Jena to take imaging data of selected visual binary systems. Results: In this paper, we characterize the target sample of the survey, describe the imaging observations and the astrometric measurements including the astrometric calibration, and present the relative astrometric measures of 352 binaries that could be obtained during the course of the Großschwabhausen binary survey, so far.

Halftone visual cryptography.

PubMed

Zhou, Zhi; Arce, Gonzalo R; Di Crescenzo, Giovanni

2006-08-01

Visual cryptography encodes a secret binary image (SI) into n shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the n shares, however, have no visual meaning and hinder the objectives of visual cryptography. Extended visual cryptography [1] was proposed recently to construct meaningful binary images as shares using hypergraph colourings, but the visual quality is poor. In this paper, a novel technique named halftone visual cryptography is proposed to achieve visual cryptography via halftoning. Based on the blue-noise dithering principles, the proposed method utilizes the void and cluster algorithm [2] to encode a secret binary image into n halftone shares (images) carrying significant visual information. The simulation shows that the visual quality of the obtained halftone shares are observably better than that attained by any available visual cryptography method known to date.

Medical image classification using spatial adjacent histogram based on adaptive local binary patterns.

PubMed

Liu, Dong; Wang, Shengsheng; Huang, Dezhi; Deng, Gang; Zeng, Fantao; Chen, Huiling

2016-05-01

Medical image recognition is an important task in both computer vision and computational biology. In the field of medical image classification, representing an image based on local binary patterns (LBP) descriptor has become popular. However, most existing LBP-based methods encode the binary patterns in a fixed neighborhood radius and ignore the spatial relationships among local patterns. The ignoring of the spatial relationships in the LBP will cause a poor performance in the process of capturing discriminative features for complex samples, such as medical images obtained by microscope. To address this problem, in this paper we propose a novel method to improve local binary patterns by assigning an adaptive neighborhood radius for each pixel. Based on these adaptive local binary patterns, we further propose a spatial adjacent histogram strategy to encode the micro-structures for image representation. An extensive set of evaluations are performed on four medical datasets which show that the proposed method significantly improves standard LBP and compares favorably with several other prevailing approaches. Copyright © 2016 Elsevier Ltd. All rights reserved.

Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map

PubMed Central

2014-01-01

We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments. PMID:25143970

Cross-indexing of binary SIFT codes for large-scale image search.

PubMed

Liu, Zhen; Li, Houqiang; Zhang, Liyan; Zhou, Wengang; Tian, Qi

2014-05-01

In recent years, there has been growing interest in mapping visual features into compact binary codes for applications on large-scale image collections. Encoding high-dimensional data as compact binary codes reduces the memory cost for storage. Besides, it benefits the computational efficiency since the computation of similarity can be efficiently measured by Hamming distance. In this paper, we propose a novel flexible scale invariant feature transform (SIFT) binarization (FSB) algorithm for large-scale image search. The FSB algorithm explores the magnitude patterns of SIFT descriptor. It is unsupervised and the generated binary codes are demonstrated to be dispreserving. Besides, we propose a new searching strategy to find target features based on the cross-indexing in the binary SIFT space and original SIFT space. We evaluate our approach on two publicly released data sets. The experiments on large-scale partial duplicate image retrieval system demonstrate the effectiveness and efficiency of the proposed algorithm.

A novel color image encryption scheme using alternate chaotic mapping structure

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Zhao, Yuanyuan; Zhang, Huili; Guo, Kang

2016-07-01

This paper proposes an color image encryption algorithm using alternate chaotic mapping structure. Initially, we use the R, G and B components to form a matrix. Then one-dimension logistic and two-dimension logistic mapping is used to generate a chaotic matrix, then iterate two chaotic mappings alternately to permute the matrix. For every iteration, XOR operation is adopted to encrypt plain-image matrix, then make further transformation to diffuse the matrix. At last, the encrypted color image is obtained from the confused matrix. Theoretical analysis and experimental results has proved the cryptosystem is secure and practical, and it is suitable for encrypting color images.

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

NASA Astrophysics Data System (ADS)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

Robust watermarking scheme for binary images using a slice-based large-cluster algorithm with a Hamming Code

NASA Astrophysics Data System (ADS)

Chen, Wen-Yuan; Liu, Chen-Chung

2006-01-01

The problems with binary watermarking schemes are that they have only a small amount of embeddable space and are not robust enough. We develop a slice-based large-cluster algorithm (SBLCA) to construct a robust watermarking scheme for binary images. In SBLCA, a small-amount cluster selection (SACS) strategy is used to search for a feasible slice in a large-cluster flappable-pixel decision (LCFPD) method, which is used to search for the best location for concealing a secret bit from a selected slice. This method has four major advantages over the others: (a) SBLCA has a simple and effective decision function to select appropriate concealment locations, (b) SBLCA utilizes a blind watermarking scheme without the original image in the watermark extracting process, (c) SBLCA uses slice-based shuffling capability to transfer the regular image into a hash state without remembering the state before shuffling, and finally, (d) SBLCA has enough embeddable space that every 64 pixels could accommodate a secret bit of the binary image. Furthermore, empirical results on test images reveal that our approach is a robust watermarking scheme for binary images.

Weight distributions for turbo codes using random and nonrandom permutations

NASA Technical Reports Server (NTRS)

Dolinar, S.; Divsalar, D.

1995-01-01

This article takes a preliminary look at the weight distributions achievable for turbo codes using random, nonrandom, and semirandom permutations. Due to the recursiveness of the encoders, it is important to distinguish between self-terminating and non-self-terminating input sequences. The non-self-terminating sequences have little effect on decoder performance, because they accumulate high encoded weight until they are artificially terminated at the end of the block. From probabilistic arguments based on selecting the permutations randomly, it is concluded that the self-terminating weight-2 data sequences are the most important consideration in the design of constituent codes; higher-weight self-terminating sequences have successively decreasing importance. Also, increasing the number of codes and, correspondingly, the number of permutations makes it more and more likely that the bad input sequences will be broken up by one or more of the permuters. It is possible to design nonrandom permutations that ensure that the minimum distance due to weight-2 input sequences grows roughly as the square root of (2N), where N is the block length. However, these nonrandom permutations amplify the bad effects of higher-weight inputs, and as a result they are inferior in performance to randomly selected permutations. But there are 'semirandom' permutations that perform nearly as well as the designed nonrandom permutations with respect to weight-2 input sequences and are not as susceptible to being foiled by higher-weight inputs.

PERMutation Using Transposase Engineering (PERMUTE): A Simple Approach for Constructing Circularly Permuted Protein Libraries.

PubMed

Jones, Alicia M; Atkinson, Joshua T; Silberg, Jonathan J

2017-01-01

Rearrangements that alter the order of a protein's sequence are used in the lab to study protein folding, improve activity, and build molecular switches. One of the simplest ways to rearrange a protein sequence is through random circular permutation, where native protein termini are linked together and new termini are created elsewhere through random backbone fission. Transposase mutagenesis has emerged as a simple way to generate libraries encoding different circularly permuted variants of proteins. With this approach, a synthetic transposon (called a permuteposon) is randomly inserted throughout a circularized gene to generate vectors that express different permuted variants of a protein. In this chapter, we outline the protocol for constructing combinatorial libraries of circularly permuted proteins using transposase mutagenesis, and we describe the different permuteposons that have been developed to facilitate library construction.

Comparing object recognition from binary and bipolar edge images for visual prostheses

PubMed Central

Jung, Jae-Hyun; Pu, Tian; Peli, Eli

2017-01-01

Visual prostheses require an effective representation method due to the limited display condition which has only 2 or 3 levels of grayscale in low resolution. Edges derived from abrupt luminance changes in images carry essential information for object recognition. Typical binary (black and white) edge images have been used to represent features to convey essential information. However, in scenes with a complex cluttered background, the recognition rate of the binary edge images by human observers is limited and additional information is required. The polarity of edges and cusps (black or white features on a gray background) carries important additional information; the polarity may provide shape from shading information missing in the binary edge image. This depth information may be restored by using bipolar edges. We compared object recognition rates from 16 binary edge images and bipolar edge images by 26 subjects to determine the possible impact of bipolar filtering in visual prostheses with 3 or more levels of grayscale. Recognition rates were higher with bipolar edge images and the improvement was significant in scenes with complex backgrounds. The results also suggest that erroneous shape from shading interpretation of bipolar edges resulting from pigment rather than boundaries of shape may confound the recognition. PMID:28458481

Particle Filter with State Permutations for Solving Image Jigsaw Puzzles

PubMed Central

Yang, Xingwei; Adluru, Nagesh; Latecki, Longin Jan

2016-01-01

We deal with an image jigsaw puzzle problem, which is defined as reconstructing an image from a set of square and non-overlapping image patches. It is known that a general instance of this problem is NP-complete, and it is also challenging for humans, since in the considered setting the original image is not given. Recently a graphical model has been proposed to solve this and related problems. The target label probability function is then maximized using loopy belief propagation. We also formulate the problem as maximizing a label probability function and use exactly the same pairwise potentials. Our main contribution is a novel inference approach in the sampling framework of Particle Filter (PF). Usually in the PF framework it is assumed that the observations arrive sequentially, e.g., the observations are naturally ordered by their time stamps in the tracking scenario. Based on this assumption, the posterior density over the corresponding hidden states is estimated. In the jigsaw puzzle problem all observations (puzzle pieces) are given at once without any particular order. Therefore, we relax the assumption of having ordered observations and extend the PF framework to estimate the posterior density by exploring different orders of observations and selecting the most informative permutations of observations. This significantly broadens the scope of applications of the PF inference. Our experimental results demonstrate that the proposed inference framework significantly outperforms the loopy belief propagation in solving the image jigsaw puzzle problem. In particular, the extended PF inference triples the accuracy of the label assignment compared to that using loopy belief propagation. PMID:27795660

Opposition-Based Memetic Algorithm and Hybrid Approach for Sorting Permutations by Reversals.

PubMed

Soncco-Álvarez, José Luis; Muñoz, Daniel M; Ayala-Rincón, Mauricio

2018-02-21

Sorting unsigned permutations by reversals is a difficult problem; indeed, it was proved to be NP-hard by Caprara (1997). Because of its high complexity, many approximation algorithms to compute the minimal reversal distance were proposed until reaching the nowadays best-known theoretical ratio of 1.375. In this article, two memetic algorithms to compute the reversal distance are proposed. The first one uses the technique of opposition-based learning leading to an opposition-based memetic algorithm; the second one improves the previous algorithm by applying the heuristic of two breakpoint elimination leading to a hybrid approach. Several experiments were performed with one-hundred randomly generated permutations, single benchmark permutations, and biological permutations. Results of the experiments showed that the proposed OBMA and Hybrid-OBMA algorithms achieve the best results for practical cases, that is, for permutations of length up to 120. Also, Hybrid-OBMA showed to improve the results of OBMA for permutations greater than or equal to 60. The applicability of our proposed algorithms was checked processing permutations based on biological data, in which case OBMA gave the best average results for all instances.

Binary CMOS image sensor with a gate/body-tied MOSFET-type photodetector for high-speed operation

NASA Astrophysics Data System (ADS)

Choi, Byoung-Soo; Jo, Sung-Hyun; Bae, Myunghan; Kim, Sang-Hwan; Shin, Jang-Kyoo

2016-05-01

In this paper, a binary complementary metal oxide semiconductor (CMOS) image sensor with a gate/body-tied (GBT) metal oxide semiconductor field effect transistor (MOSFET)-type photodetector is presented. The sensitivity of the GBT MOSFET-type photodetector, which was fabricated using the standard CMOS 0.35-μm process, is higher than the sensitivity of the p-n junction photodiode, because the output signal of the photodetector is amplified by the MOSFET. A binary image sensor becomes more efficient when using this photodetector. Lower power consumptions and higher speeds of operation are possible, compared to the conventional image sensors using multi-bit analog to digital converters (ADCs). The frame rate of the proposed image sensor is over 2000 frames per second, which is higher than those of the conventional CMOS image sensors. The output signal of an active pixel sensor is applied to a comparator and compared with a reference level. The 1-bit output data of the binary process is determined by this level. To obtain a video signal, the 1-bit output data is stored in the memory and is read out by horizontal scanning. The proposed chip is composed of a GBT pixel array (144 × 100), binary-process circuit, vertical scanner, horizontal scanner, and readout circuit. The operation mode can be selected from between binary mode and multi-bit mode.

Visual recognition of permuted words

NASA Astrophysics Data System (ADS)

Rashid, Sheikh Faisal; Shafait, Faisal; Breuel, Thomas M.

2010-02-01

In current study we examine how letter permutation affects in visual recognition of words for two orthographically dissimilar languages, Urdu and German. We present the hypothesis that recognition or reading of permuted and non-permuted words are two distinct mental level processes, and that people use different strategies in handling permuted words as compared to normal words. A comparison between reading behavior of people in these languages is also presented. We present our study in context of dual route theories of reading and it is observed that the dual-route theory is consistent with explanation of our hypothesis of distinction in underlying cognitive behavior for reading permuted and non-permuted words. We conducted three experiments in lexical decision tasks to analyze how reading is degraded or affected by letter permutation. We performed analysis of variance (ANOVA), distribution free rank test, and t-test to determine the significance differences in response time latencies for two classes of data. Results showed that the recognition accuracy for permuted words is decreased 31% in case of Urdu and 11% in case of German language. We also found a considerable difference in reading behavior for cursive and alphabetic languages and it is observed that reading of Urdu is comparatively slower than reading of German due to characteristics of cursive script.

Four applications of permutation methods to testing a single-mediator model.

PubMed

Taylor, Aaron B; MacKinnon, David P

2012-09-01

Four applications of permutation tests to the single-mediator model are described and evaluated in this study. Permutation tests work by rearranging data in many possible ways in order to estimate the sampling distribution for the test statistic. The four applications to mediation evaluated here are the permutation test of ab, the permutation joint significance test, and the noniterative and iterative permutation confidence intervals for ab. A Monte Carlo simulation study was used to compare these four tests with the four best available tests for mediation found in previous research: the joint significance test, the distribution of the product test, and the percentile and bias-corrected bootstrap tests. We compared the different methods on Type I error, power, and confidence interval coverage. The noniterative permutation confidence interval for ab was the best performer among the new methods. It successfully controlled Type I error, had power nearly as good as the most powerful existing methods, and had better coverage than any existing method. The iterative permutation confidence interval for ab had lower power than do some existing methods, but it performed better than any other method in terms of coverage. The permutation confidence interval methods are recommended when estimating a confidence interval is a primary concern. SPSS and SAS macros that estimate these confidence intervals are provided.

An optimal algorithm for reconstructing images from binary measurements

NASA Astrophysics Data System (ADS)

Yang, Feng; Lu, Yue M.; Sbaiz, Luciano; Vetterli, Martin

2010-01-01

We have studied a camera with a very large number of binary pixels referred to as the gigavision camera [1] or the gigapixel digital film camera [2, 3]. Potential advantages of this new camera design include improved dynamic range, thanks to its logarithmic sensor response curve, and reduced exposure time in low light conditions, due to its highly sensitive photon detection mechanism. We use maximum likelihood estimator (MLE) to reconstruct a high quality conventional image from the binary sensor measurements of the gigavision camera. We prove that when the threshold T is "1", the negative loglikelihood function is a convex function. Therefore, optimal solution can be achieved using convex optimization. Base on filter bank techniques, fast algorithms are given for computing the gradient and the multiplication of a vector and Hessian matrix of the negative log-likelihood function. We show that with a minor change, our algorithm also works for estimating conventional images from multiple binary images. Numerical experiments with synthetic 1-D signals and images verify the effectiveness and quality of the proposed algorithm. Experimental results also show that estimation performance can be improved by increasing the oversampling factor or the number of binary images.

SiGN-SSM: open source parallel software for estimating gene networks with state space models.

PubMed

Tamada, Yoshinori; Yamaguchi, Rui; Imoto, Seiya; Hirose, Osamu; Yoshida, Ryo; Nagasaki, Masao; Miyano, Satoru

2011-04-15

SiGN-SSM is an open-source gene network estimation software able to run in parallel on PCs and massively parallel supercomputers. The software estimates a state space model (SSM), that is a statistical dynamic model suitable for analyzing short time and/or replicated time series gene expression profiles. SiGN-SSM implements a novel parameter constraint effective to stabilize the estimated models. Also, by using a supercomputer, it is able to determine the gene network structure by a statistical permutation test in a practical time. SiGN-SSM is applicable not only to analyzing temporal regulatory dependencies between genes, but also to extracting the differentially regulated genes from time series expression profiles. SiGN-SSM is distributed under GNU Affero General Public Licence (GNU AGPL) version 3 and can be downloaded at http://sign.hgc.jp/signssm/. The pre-compiled binaries for some architectures are available in addition to the source code. The pre-installed binaries are also available on the Human Genome Center supercomputer system. The online manual and the supplementary information of SiGN-SSM is available on our web site. tamada@ims.u-tokyo.ac.jp.

Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform

NASA Astrophysics Data System (ADS)

Lee, Moon Ho; Khan, Md Hashem Ali; Kim, Kyeong Jin

2013-12-01

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 k , 3 k , 5 k , and 6 k , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.

Object-Location-Aware Hashing for Multi-Label Image Retrieval via Automatic Mask Learning.

PubMed

Huang, Chang-Qin; Yang, Shang-Ming; Pan, Yan; Lai, Han-Jiang

2018-09-01

Learning-based hashing is a leading approach of approximate nearest neighbor search for large-scale image retrieval. In this paper, we develop a deep supervised hashing method for multi-label image retrieval, in which we propose to learn a binary "mask" map that can identify the approximate locations of objects in an image, so that we use this binary "mask" map to obtain length-limited hash codes which mainly focus on an image's objects but ignore the background. The proposed deep architecture consists of four parts: 1) a convolutional sub-network to generate effective image features; 2) a binary "mask" sub-network to identify image objects' approximate locations; 3) a weighted average pooling operation based on the binary "mask" to obtain feature representations and hash codes that pay most attention to foreground objects but ignore the background; and 4) the combination of a triplet ranking loss designed to preserve relative similarities among images and a cross entropy loss defined on image labels. We conduct comprehensive evaluations on four multi-label image data sets. The results indicate that the proposed hashing method achieves superior performance gains over the state-of-the-art supervised or unsupervised hashing baselines.

Circular Permutation of a Chaperonin Protein: Biophysics and Application to Nanotechnology

NASA Technical Reports Server (NTRS)

Paavola, Chad; Chan, Suzanne; Li, Yi-Fen; McMillan, R. Andrew; Trent, Jonathan

2004-01-01

We have designed five circular permutants of a chaperonin protein derived from the hyperthermophilic organism Sulfolobus shibatae. These permuted proteins were expressed in E. coli and are well-folded. Furthermore, all the permutants assemble into 18-mer double rings of the same form as the wild-type protein. We characterized the thermodynamics of folding for each permutant by both guanidine denaturation and differential scanning calorimetry. We also examined the assembly of chaperonin rings into higher order structures that may be used as nanoscale templates. The results show that circular permutation can be used to tune the thermodynamic properties of a protein template as well as facilitating the fusion of peptides, binding proteins or enzymes onto nanostructured templates.

Deep Hashing for Scalable Image Search.

PubMed

Lu, Jiwen; Liong, Venice Erin; Zhou, Jie

2017-05-01

In this paper, we propose a new deep hashing (DH) approach to learn compact binary codes for scalable image search. Unlike most existing binary codes learning methods, which usually seek a single linear projection to map each sample into a binary feature vector, we develop a deep neural network to seek multiple hierarchical non-linear transformations to learn these binary codes, so that the non-linear relationship of samples can be well exploited. Our model is learned under three constraints at the top layer of the developed deep network: 1) the loss between the compact real-valued code and the learned binary vector is minimized, 2) the binary codes distribute evenly on each bit, and 3) different bits are as independent as possible. To further improve the discriminative power of the learned binary codes, we extend DH into supervised DH (SDH) and multi-label SDH by including a discriminative term into the objective function of DH, which simultaneously maximizes the inter-class variations and minimizes the intra-class variations of the learned binary codes with the single-label and multi-label settings, respectively. Extensive experimental results on eight widely used image search data sets show that our proposed methods achieve very competitive results with the state-of-the-arts.

The Impact of Binary Companions on Planetary Systems

NASA Astrophysics Data System (ADS)

Kraus, Adam L.; Ireland, Michael; Dupuy, Trent; Mann, Andrew; Huber, Daniel

2018-01-01

The majority of solar-type stars are found in binary systems, and the dynamical influence of binary companions is expected to profoundly influence planetary systems. However, the difficulty of identifying planets in binary systems has left the magnitude of this effect uncertain; despite numerous theoretical hurdles to their formation and survival, at least some binary systems clearly host planets. We present high-resolution imaging of nearly 500 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. We super-resolve some binary systems to projected separations of under 5 AU, showing that planets might form in these dynamically active environments. However, the full distribution of projected separations for our planet-host sample more broadly reveals a deep paucity of binary companions at solar-system scales. Our results demonstrate that a fifth of all solar-type stars in the Milky Way are disallowed from hosting planetary systems due to the influence of a binary companion. We now update these results with multi-epoch imaging to reject non-comoving background stars and securely identify even the least massive stellar companions, as well as tracing out the orbital motion of stellar companions. These results are beginning to reveal not just the fraction of binaries that do not host planets, but also potential explanations for planet survival even in some very close, dynamically active binary systems.

The structure of a thermophilic kinase shapes fitness upon random circular permutation

PubMed Central

Jones, Alicia M.; Mehta, Manan M.; Thomas, Emily E.; Atkinson, Joshua T.; Segall-Shapiro, Thomas H.; Liu, Shirley; Silberg, Jonathan J.

2016-01-01

Proteins can be engineered for synthetic biology through circular permutation, a sequence rearrangement where native protein termini become linked and new termini are created elsewhere through backbone fission. However, it remains challenging to anticipate a protein’s functional tolerance to circular permutation. Here, we describe new transposons for creating libraries of randomly circularly permuted proteins that minimize peptide additions at their termini, and we use transposase mutagenesis to study the tolerance of a thermophilic adenylate kinase (AK) to circular permutation. We find that libraries expressing permuted AK with either short or long peptides amended to their N-terminus yield distinct sets of active variants and present evidence that this trend arises because permuted protein expression varies across libraries. Mapping all sites that tolerate backbone cleavage onto AK structure reveals that the largest contiguous regions of sequence that lack cleavage sites are proximal to the phosphotransfer site. A comparison of our results with a range of structure-derived parameters further showed that retention of function correlates to the strongest extent with the distance to the phosphotransfer site, amino acid variability in an AK family sequence alignment, and residue-level deviations in superimposed AK structures. Our work illustrates how permuted protein libraries can be created with minimal peptide additions using transposase mutagenesis, and they reveal a challenge of maintaining consistent expression across permuted variants in a library that minimizes peptide additions. Furthermore, these findings provide a basis for interpreting responses of thermophilic phosphotransferases to circular permutation by calibrating how different structure-derived parameters relate to retention of function in a cellular selection. PMID:26976658

The Structure of a Thermophilic Kinase Shapes Fitness upon Random Circular Permutation.

PubMed

Jones, Alicia M; Mehta, Manan M; Thomas, Emily E; Atkinson, Joshua T; Segall-Shapiro, Thomas H; Liu, Shirley; Silberg, Jonathan J

2016-05-20

Proteins can be engineered for synthetic biology through circular permutation, a sequence rearrangement in which native protein termini become linked and new termini are created elsewhere through backbone fission. However, it remains challenging to anticipate a protein's functional tolerance to circular permutation. Here, we describe new transposons for creating libraries of randomly circularly permuted proteins that minimize peptide additions at their termini, and we use transposase mutagenesis to study the tolerance of a thermophilic adenylate kinase (AK) to circular permutation. We find that libraries expressing permuted AKs with either short or long peptides amended to their N-terminus yield distinct sets of active variants and present evidence that this trend arises because permuted protein expression varies across libraries. Mapping all sites that tolerate backbone cleavage onto AK structure reveals that the largest contiguous regions of sequence that lack cleavage sites are proximal to the phosphotransfer site. A comparison of our results with a range of structure-derived parameters further showed that retention of function correlates to the strongest extent with the distance to the phosphotransfer site, amino acid variability in an AK family sequence alignment, and residue-level deviations in superimposed AK structures. Our work illustrates how permuted protein libraries can be created with minimal peptide additions using transposase mutagenesis, and it reveals a challenge of maintaining consistent expression across permuted variants in a library that minimizes peptide additions. Furthermore, these findings provide a basis for interpreting responses of thermophilic phosphotransferases to circular permutation by calibrating how different structure-derived parameters relate to retention of function in a cellular selection.

Near-Infrared Polarimetry of the GG Tauri A Binary System

NASA Technical Reports Server (NTRS)

Itoh, Yoichi; Oasa, Yumiko; Kudo, Tomoyuki; Kusakabe, Nobuhiko; Hashimoto, Jun; Abe, Lyu; Brandner, Wolfgang; Brandt, Timothy D.; Carson, Joseph C.; Egner, Sebastian;

Teaching Tip: When a Matrix and Its Inverse Are Stochastic

ERIC Educational Resources Information Center

Ding, J.; Rhee, N. H.

2013-01-01

A stochastic matrix is a square matrix with nonnegative entries and row sums 1. The simplest example is a permutation matrix, whose rows permute the rows of an identity matrix. A permutation matrix and its inverse are both stochastic. We prove the converse, that is, if a matrix and its inverse are both stochastic, then it is a permutation matrix.

Permutation-based inference for the AUC: A unified approach for continuous and discontinuous data.

PubMed

Pauly, Markus; Asendorf, Thomas; Konietschke, Frank

2016-11-01

We investigate rank-based studentized permutation methods for the nonparametric Behrens-Fisher problem, that is, inference methods for the area under the ROC curve. We hereby prove that the studentized permutation distribution of the Brunner-Munzel rank statistic is asymptotically standard normal, even under the alternative. Thus, incidentally providing the hitherto missing theoretical foundation for the Neubert and Brunner studentized permutation test. In particular, we do not only show its consistency, but also that confidence intervals for the underlying treatment effects can be computed by inverting this permutation test. In addition, we derive permutation-based range-preserving confidence intervals. Extensive simulation studies show that the permutation-based confidence intervals appear to maintain the preassigned coverage probability quite accurately (even for rather small sample sizes). For a convenient application of the proposed methods, a freely available software package for the statistical software R has been developed. A real data example illustrates the application. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Unequal homologous recombination between tandemly arranged sequences stably incorporated into cultured rat cells.

PubMed Central

Stringer, J R; Kuhn, R M; Newman, J L; Meade, J C

1985-01-01

Cultured rat cells deficient in endogenous thymidine kinase activity (tk) were stably transformed with a recombination-indicator DNA substrate constructed in vitro by rearrangement of the herpes simplex virus tk gene sequences into a partially redundant permutation of the functional gene. The recombination-indicator DNA did not express tk, but was designed to allow formation of a functional tk gene via homologous recombination. A clonal cell line (519) was isolated that harbored several permuted herpes simplex virus tk genes. 519 cells spontaneously produced progeny that survived in medium containing hypoxanthine, aminopterin, and thymidine. Acquisition of resistance to hypoxanthine, aminopterin, and thymidine was accompanied by the rearrangement of the defective tk gene to functional configuration. The rearrangement apparently occurred by unequal exchange between one permuted tk gene and a replicated copy of itself. Recombination was between 500-base-pair tracts of DNA sequence homology that were separated by 3.4 kilobases. Exchanges occurred spontaneously at a frequency of approximately 5 X 10(-6) events per cell per generation. Recombination also mediated reversion to the tk- phenotype; however, the predominant mechanism by which cells escaped death in the presence of drugs rendered toxic by thymidine kinase was not recombination, but rather inactivation of the intact tk gene. Images PMID:3016511

Binary encoding of multiplexed images in mixed noise.

PubMed

Lalush, David S

2008-09-01

Binary coding of multiplexed signals and images has been studied in the context of spectroscopy with models of either purely constant or purely proportional noise, and has been shown to result in improved noise performance under certain conditions. We consider the case of mixed noise in an imaging system consisting of multiple individually-controllable sources (X-ray or near-infrared, for example) shining on a single detector. We develop a mathematical model for the noise in such a system and show that the noise is dependent on the properties of the binary coding matrix and on the average number of sources used for each code. Each binary matrix has a characteristic linear relationship between the ratio of proportional-to-constant noise and the noise level in the decoded image. We introduce a criterion for noise level, which is minimized via a genetic algorithm search. The search procedure results in the discovery of matrices that outperform the Hadamard S-matrices at certain levels of mixed noise. Simulation of a seven-source radiography system demonstrates that the noise model predicts trends and rank order of performance in regions of nonuniform images and in a simple tomosynthesis reconstruction. We conclude that the model developed provides a simple framework for analysis, discovery, and optimization of binary coding patterns used in multiplexed imaging systems.

Robust image region descriptor using local derivative ordinal binary pattern

NASA Astrophysics Data System (ADS)

Shang, Jun; Chen, Chuanbo; Pei, Xiaobing; Liang, Hu; Tang, He; Sarem, Mudar

2015-05-01

Binary image descriptors have received a lot of attention in recent years, since they provide numerous advantages, such as low memory footprint and efficient matching strategy. However, they utilize intermediate representations and are generally less discriminative than floating-point descriptors. We propose an image region descriptor, namely local derivative ordinal binary pattern, for object recognition and image categorization. In order to preserve more local contrast and edge information, we quantize the intensity differences between the central pixels and their neighbors of the detected local affine covariant regions in an adaptive way. These differences are then sorted and mapped into binary codes and histogrammed with a weight of the sum of the absolute value of the differences. Furthermore, the gray level of the central pixel is quantized to further improve the discriminative ability. Finally, we combine them to form a joint histogram to represent the features of the image. We observe that our descriptor preserves more local brightness and edge information than traditional binary descriptors. Also, our descriptor is robust to rotation, illumination variations, and other geometric transformations. We conduct extensive experiments on the standard ETHZ and Kentucky datasets for object recognition and PASCAL for image classification. The experimental results show that our descriptor outperforms existing state-of-the-art methods.

An AUC-based permutation variable importance measure for random forests

PubMed Central

2013-01-01

Background The random forest (RF) method is a commonly used tool for classification with high dimensional data as well as for ranking candidate predictors based on the so-called random forest variable importance measures (VIMs). However the classification performance of RF is known to be suboptimal in case of strongly unbalanced data, i.e. data where response class sizes differ considerably. Suggestions were made to obtain better classification performance based either on sampling procedures or on cost sensitivity analyses. However to our knowledge the performance of the VIMs has not yet been examined in the case of unbalanced response classes. In this paper we explore the performance of the permutation VIM for unbalanced data settings and introduce an alternative permutation VIM based on the area under the curve (AUC) that is expected to be more robust towards class imbalance. Results We investigated the performance of the standard permutation VIM and of our novel AUC-based permutation VIM for different class imbalance levels using simulated data and real data. The results suggest that the new AUC-based permutation VIM outperforms the standard permutation VIM for unbalanced data settings while both permutation VIMs have equal performance for balanced data settings. Conclusions The standard permutation VIM loses its ability to discriminate between associated predictors and predictors not associated with the response for increasing class imbalance. It is outperformed by our new AUC-based permutation VIM for unbalanced data settings, while the performance of both VIMs is very similar in the case of balanced classes. The new AUC-based VIM is implemented in the R package party for the unbiased RF variant based on conditional inference trees. The codes implementing our study are available from the companion website: http://www.ibe.med.uni-muenchen.de/organisation/mitarbeiter/070_drittmittel/janitza/index.html. PMID:23560875

An AUC-based permutation variable importance measure for random forests.

PubMed

Janitza, Silke; Strobl, Carolin; Boulesteix, Anne-Laure

2013-04-05

The random forest (RF) method is a commonly used tool for classification with high dimensional data as well as for ranking candidate predictors based on the so-called random forest variable importance measures (VIMs). However the classification performance of RF is known to be suboptimal in case of strongly unbalanced data, i.e. data where response class sizes differ considerably. Suggestions were made to obtain better classification performance based either on sampling procedures or on cost sensitivity analyses. However to our knowledge the performance of the VIMs has not yet been examined in the case of unbalanced response classes. In this paper we explore the performance of the permutation VIM for unbalanced data settings and introduce an alternative permutation VIM based on the area under the curve (AUC) that is expected to be more robust towards class imbalance. We investigated the performance of the standard permutation VIM and of our novel AUC-based permutation VIM for different class imbalance levels using simulated data and real data. The results suggest that the new AUC-based permutation VIM outperforms the standard permutation VIM for unbalanced data settings while both permutation VIMs have equal performance for balanced data settings. The standard permutation VIM loses its ability to discriminate between associated predictors and predictors not associated with the response for increasing class imbalance. It is outperformed by our new AUC-based permutation VIM for unbalanced data settings, while the performance of both VIMs is very similar in the case of balanced classes. The new AUC-based VIM is implemented in the R package party for the unbiased RF variant based on conditional inference trees. The codes implementing our study are available from the companion website: http://www.ibe.med.uni-muenchen.de/organisation/mitarbeiter/070_drittmittel/janitza/index.html.

Hemodynamic Response to Interictal Epileptiform Discharges Addressed by Personalized EEG-fNIRS Recordings

PubMed Central

Pellegrino, Giovanni; Machado, Alexis; von Ellenrieder, Nicolas; Watanabe, Satsuki; Hall, Jeffery A.; Lina, Jean-Marc; Kobayashi, Eliane; Grova, Christophe

2016-01-01

Objective: We aimed at studying the hemodynamic response (HR) to Interictal Epileptic Discharges (IEDs) using patient-specific and prolonged simultaneous ElectroEncephaloGraphy (EEG) and functional Near InfraRed Spectroscopy (fNIRS) recordings. Methods: The epileptic generator was localized using Magnetoencephalography source imaging. fNIRS montage was tailored for each patient, using an algorithm to optimize the sensitivity to the epileptic generator. Optodes were glued using collodion to achieve prolonged acquisition with high quality signal. fNIRS data analysis was handled with no a priori constraint on HR time course, averaging fNIRS signals to similar IEDs. Cluster-permutation analysis was performed on 3D reconstructed fNIRS data to identify significant spatio-temporal HR clusters. Standard (GLM with fixed HRF) and cluster-permutation EEG-fMRI analyses were performed for comparison purposes. Results: fNIRS detected HR to IEDs for 8/9 patients. It mainly consisted oxy-hemoglobin increases (seven patients), followed by oxy-hemoglobin decreases (six patients). HR was lateralized in six patients and lasted from 8.5 to 30 s. Standard EEG-fMRI analysis detected an HR in 4/9 patients (4/9 without enough IEDs, 1/9 unreliable result). The cluster-permutation EEG-fMRI analysis restricted to the region investigated by fNIRS showed additional strong and non-canonical BOLD responses starting earlier than the IEDs and lasting up to 30 s. Conclusions: (i) EEG-fNIRS is suitable to detect the HR to IEDs and can outperform EEG-fMRI because of prolonged recordings and greater chance to detect IEDs; (ii) cluster-permutation analysis unveils additional HR features underestimated when imposing a canonical HR function (iii) the HR is often bilateral and lasts up to 30 s. PMID:27047325

Segmentation of acute pyelonephritis area on kidney SPECT images using binary shape analysis

NASA Astrophysics Data System (ADS)

Wu, Chia-Hsiang; Sun, Yung-Nien; Chiu, Nan-Tsing

1999-05-01

Acute pyelonephritis is a serious disease in children that may result in irreversible renal scarring. The ability to localize the site of urinary tract infection and the extent of acute pyelonephritis has considerable clinical importance. In this paper, we are devoted to segment the acute pyelonephritis area from kidney SPECT images. A two-step algorithm is proposed. First, the original images are translated into binary versions by automatic thresholding. Then the acute pyelonephritis areas are located by finding convex deficiencies in the obtained binary images. This work gives important diagnosis information for physicians and improves the quality of medical care for children acute pyelonephritis disease.

Near-Earth Asteroid 2005 CR37: Radar Images and Photometry of a Candidate Contact Binary

NASA Technical Reports Server (NTRS)

Benner, Lance A. M.; Nolan, Michael C.; Ostro, Steven J.; Giorgini, Jon D.; Pray, Donald P.; Harris, Alan W.; Magri, Christopher; Margot, Jean-Luc

2006-01-01

Arecibo (2380 MHz, 13 cm) radar observations of 2005 CR37 provide detailed images of a candidate contact binary: a 1.8-km-long, extremely bifurcated object. Although the asteroid's two lobes are round, there are regions of modest topographic relief, such as an elevated, 200-m-wide facet, that suggest that the lobes are geologically more complex than either coherent fragments or homogeneous rubble piles. Since January 1999, about 9% of NEAs larger than approx.200 m imaged by radar can be described as candidate contact binaries.

Applications Of Binary Image Analysis Techniques

NASA Astrophysics Data System (ADS)

Tropf, H.; Enderle, E.; Kammerer, H. P.

1983-10-01

After discussing the conditions where binary image analysis techniques can be used, three new applications of the fast binary image analysis system S.A.M. (Sensorsystem for Automation and Measurement) are reported: (1) The human view direction is measured at TV frame rate while the subject's head is free movable. (2) Industrial parts hanging on a moving conveyor are classified prior to spray painting by robot. (3) In automotive wheel assembly, the eccentricity of the wheel is minimized by turning the tyre relative to the rim in order to balance the eccentricity of the components.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S [Santa Fe, NM; Cabantous, Stephanie [Los Alamos, NM

2008-06-24

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S; Cabantous, Stephanie

2013-02-12

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S [Santa Fe, NM; Cabantous, Stephanie [Los Alamos, NM

2011-06-14

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Circular permutant GFP insertion folding reporters

DOEpatents

Waldo, Geoffrey S.; Cabantous, Stephanie

2013-04-16

Provided are methods of assaying and improving protein folding using circular permutants of fluorescent proteins, including circular permutants of GFP variants and combinations thereof. The invention further provides various nucleic acid molecules and vectors incorporating such nucleic acid molecules, comprising polynucleotides encoding fluorescent protein circular permutants derived from superfolder GFP, which polynucleotides include an internal cloning site into which a heterologous polynucleotide may be inserted in-frame with the circular permutant coding sequence, and which when expressed are capable of reporting on the degree to which a polypeptide encoded by such an inserted heterologous polynucleotide is correctly folded by correlation with the degree of fluorescence exhibited.

Texture Classification by Texton: Statistical versus Binary

PubMed Central

Guo, Zhenhua; Zhang, Zhongcheng; Li, Xiu; Li, Qin; You, Jane

2014-01-01

Using statistical textons for texture classification has shown great success recently. The maximal response 8 (Statistical_MR8), image patch (Statistical_Joint) and locally invariant fractal (Statistical_Fractal) are typical statistical texton algorithms and state-of-the-art texture classification methods. However, there are two limitations when using these methods. First, it needs a training stage to build a texton library, thus the recognition accuracy will be highly depended on the training samples; second, during feature extraction, local feature is assigned to a texton by searching for the nearest texton in the whole library, which is time consuming when the library size is big and the dimension of feature is high. To address the above two issues, in this paper, three binary texton counterpart methods were proposed, Binary_MR8, Binary_Joint, and Binary_Fractal. These methods do not require any training step but encode local feature into binary representation directly. The experimental results on the CUReT, UIUC and KTH-TIPS databases show that binary texton could get sound results with fast feature extraction, especially when the image size is not big and the quality of image is not poor. PMID:24520346

Robust image obfuscation for privacy protection in Web 2.0 applications

NASA Astrophysics Data System (ADS)

Poller, Andreas; Steinebach, Martin; Liu, Huajian

2012-03-01

We present two approaches to robust image obfuscation based on permutation of image regions and channel intensity modulation. The proposed concept of robust image obfuscation is a step towards end-to-end security in Web 2.0 applications. It helps to protect the privacy of the users against threats caused by internet bots and web applications that extract biometric and other features from images for data-linkage purposes. The approaches described in this paper consider that images uploaded to Web 2.0 applications pass several transformations, such as scaling and JPEG compression, until the receiver downloads them. In contrast to existing approaches, our focus is on usability, therefore the primary goal is not a maximum of security but an acceptable trade-off between security and resulting image quality.

Multi-focus image fusion and robust encryption algorithm based on compressive sensing

NASA Astrophysics Data System (ADS)

Xiao, Di; Wang, Lan; Xiang, Tao; Wang, Yong

2017-06-01

Multi-focus image fusion schemes have been studied in recent years. However, little work has been done in multi-focus image transmission security. This paper proposes a scheme that can reduce data transmission volume and resist various attacks. First, multi-focus image fusion based on wavelet decomposition can generate complete scene images and optimize the perception of the human eye. The fused images are sparsely represented with DCT and sampled with structurally random matrix (SRM), which reduces the data volume and realizes the initial encryption. Then the obtained measurements are further encrypted to resist noise and crop attack through combining permutation and diffusion stages. At the receiver, the cipher images can be jointly decrypted and reconstructed. Simulation results demonstrate the security and robustness of the proposed scheme.

Method and apparatus for detecting a desired behavior in digital image data

DOEpatents

Kegelmeyer, Jr., W. Philip

1997-01-01

A method for detecting stellate lesions in digitized mammographic image data includes the steps of prestoring a plurality of reference images, calculating a plurality of features for each of the pixels of the reference images, and creating a binary decision tree from features of randomly sampled pixels from each of the reference images. Once the binary decision tree has been created, a plurality of features, preferably including an ALOE feature (analysis of local oriented edges), are calculated for each of the pixels of the digitized mammographic data. Each of these plurality of features of each pixel are input into the binary decision tree and a probability is determined, for each of the pixels, corresponding to the likelihood of the presence of a stellate lesion, to create a probability image. Finally, the probability image is spatially filtered to enforce local consensus among neighboring pixels and the spatially filtered image is output.

Method and apparatus for detecting a desired behavior in digital image data

DOEpatents

Kegelmeyer, Jr., W. Philip

1997-01-01

A method for detecting stellate lesions in digitized mammographic image data includes the steps of prestoring a plurality of reference images, calculating a plurality of features for each of the pixels of the reference images, and creating a binary decision tree from features of randomly sampled pixels from each of the reference images. Once the binary decision tree has been created, a plurality of features, preferably including an ALOE feature (analysis of local oriented edges), are calculated for each of the pixels of the digitized mammographic data. Each of these plurality of features of each pixel are input into the binary decision tree and a probability is determined, for each of the pixels, corresponding to the likelihood of the presence of a stellate lesion, to create a probability image. Finally, the probability image is spacially filtered to enforce local consensus among neighboring pixels and the spacially filtered image is output.

Two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images.

PubMed

He, Lifeng; Chao, Yuyan; Suzuki, Kenji

2011-08-01

Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.

Discriminating crop and other canopies by overlapping binary image layers

NASA Astrophysics Data System (ADS)

Doi, Ryoichi

2013-02-01

For optimal management of agricultural fields by remote sensing, discrimination of the crop canopy from weeds and other objects is essential. In a digital photograph, a rice canopy was discriminated from a variety of weed and tree canopies and other objects by overlapping binary image layers of red-green-blue and other color components indicating the pixels with target canopy-specific (intensity) values based on the ranges of means ±(3×) standard deviations. By overlapping and merging the binary image layers, the target canopy specificity improved to 0.0015 from 0.027 for the yellow 1× standard deviation binary image layer, which was the best among all combinations of color components and means ±(3×) standard deviations. The most target rice canopy-likely pixels were further identified by limiting the pixels at different luminosity values. The discriminatory power was also visually demonstrated in this manner.

Imaging the cool stars in the interacting binaries AE Aqr, BV Cen and V426 Oph

NASA Astrophysics Data System (ADS)

Watson, C. A.; Steeghs, D.; Dhillon, V. S.; Shahbaz, T.

2007-10-01

It is well known that magnetic activity in late-type stars increases with increasing rotation rate. Using inversion techniques akin to medical imaging, the rotationally broadened profiles from such stars can be used to reconstruct `Doppler images' of the distribution of cool, dark starspots on their stellar surfaces. Interacting binaries, however, contain some of the most rapidly rotating late-type stars known and thus provide important tests of stellar dynamo models. Furthermore, magnetic activity is thought to play a key role in their evolution, behaviour and accretion dynamics. Despite this, we know comparatively little about the magnetic activity and its influence on such binaries. In this review we summarise the concepts behind indirect imaging of these systems, and present movies of the starspot distributions on the cool stars in some interacting binaries. We conclude with a look at the future opportunities that such studies may provide.

Efficient and Robust Signal Approximations

DTIC Science & Technology

2009-05-01

otherwise. Remark. Permutation matrices are both orthogonal and doubly- stochastic [62]. We will now show how to further simplify the Robust Coding...reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching...Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 Keywords: signal processing, image compression, independent component analysis , sparse

A multiagent evolutionary algorithm for constraint satisfaction problems.

PubMed

Liu, Jing; Zhong, Weicai; Jiao, Licheng

2006-02-01

With the intrinsic properties of constraint satisfaction problems (CSPs) in mind, we divide CSPs into two types, namely, permutation CSPs and nonpermutation CSPs. According to their characteristics, several behaviors are designed for agents by making use of the ability of agents to sense and act on the environment. These behaviors are controlled by means of evolution, so that the multiagent evolutionary algorithm for constraint satisfaction problems (MAEA-CSPs) results. To overcome the disadvantages of the general encoding methods, the minimum conflict encoding is also proposed. Theoretical analyzes show that MAEA-CSPs has a linear space complexity and converges to the global optimum. The first part of the experiments uses 250 benchmark binary CSPs and 79 graph coloring problems from the DIMACS challenge to test the performance of MAEA-CSPs for nonpermutation CSPs. MAEA-CSPs is compared with six well-defined algorithms and the effect of the parameters is analyzed systematically. The second part of the experiments uses a classical CSP, n-queen problems, and a more practical case, job-shop scheduling problems (JSPs), to test the performance of MAEA-CSPs for permutation CSPs. The scalability of MAEA-CSPs along n for n-queen problems is studied with great care. The results show that MAEA-CSPs achieves good performance when n increases from 10(4) to 10(7), and has a linear time complexity. Even for 10(7)-queen problems, MAEA-CSPs finds the solutions by only 150 seconds. For JSPs, 59 benchmark problems are used, and good performance is also obtained.

A new collage steganographic algorithm using cartoon design

NASA Astrophysics Data System (ADS)

Yi, Shuang; Zhou, Yicong; Pun, Chi-Man; Chen, C. L. Philip

2014-02-01

Existing collage steganographic methods suffer from low payload of embedding messages. To improve the payload while providing a high level of security protection to messages, this paper introduces a new collage steganographic algorithm using cartoon design. It embeds messages into the least significant bits (LSBs) of color cartoon objects, applies different permutations to each object, and adds objects to a cartoon cover image to obtain the stego image. Computer simulations and comparisons demonstrate that the proposed algorithm shows significantly higher capacity of embedding messages compared with existing collage steganographic methods.

Auto and hetero-associative memory using a 2-D optical logic gate

NASA Technical Reports Server (NTRS)

Chao, Tien-Hsin (Inventor)

1992-01-01

An optical system for auto-associative and hetero-associative recall utilizing Hamming distance as the similarity measure between a binary input image vector V(sup k) and a binary image vector V(sup m) in a first memory array using an optical Exclusive-OR gate for multiplication of each of a plurality of different binary image vectors in memory by the input image vector. After integrating the light of each product V(sup k) x V(sup m), a shortest Hamming distance detection electronics module determines which product has the lowest light intensity and emits a signal that activates a light emitting diode to illuminate a corresponding image vector in a second memory array for display. That corresponding image vector is identical to the memory image vector V(sup m) in the first memory array for auto-associative recall or related to it, such as by name, for hetero-associative recall.

High Resolution Imaging of Very Low Mass Spectral Binaries: Three Resolved Systems and Detection of Orbital Motion in an L/T Transition Binary

NASA Astrophysics Data System (ADS)

Bardalez Gagliuffi, Daniella C.; Gelino, Christopher R.; Burgasser, Adam J.

2015-11-01

We present high resolution Laser Guide Star Adaptive Optics imaging of 43 late-M, L and T dwarf systems with Keck/NIRC2. These include 17 spectral binary candidates, systems whose spectra suggest the presence of a T dwarf secondary. We resolve three systems: 2MASS J1341-3052, SDSS J1511+0607 and SDSS J2052-1609 the first two are resolved for the first time. All three have projected separations <8 AU and estimated periods of 14-80 years. We also report a preliminary orbit determination for SDSS J2052-1609 based on six epochs of resolved astrometry between 2005 and 2010. Among the 14 unresolved spectral binaries, 5 systems were confirmed binaries but remained unresolved, implying a minimum binary fraction of {47}-11+12% for this sample. Our inability to resolve most of the spectral binaries, including the confirmed binaries, supports the hypothesis that a large fraction of very low mass systems have relatively small separations and are missed with direct imaging. Some of the data presented herein were obtained at the W.M. Keck Observatory, which is operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W.M. Keck Foundation.

Learning Rotation-Invariant Local Binary Descriptor.

PubMed

Duan, Yueqi; Lu, Jiwen; Feng, Jianjiang; Zhou, Jie

2017-08-01

In this paper, we propose a rotation-invariant local binary descriptor (RI-LBD) learning method for visual recognition. Compared with hand-crafted local binary descriptors, such as local binary pattern and its variants, which require strong prior knowledge, local binary feature learning methods are more efficient and data-adaptive. Unlike existing learning-based local binary descriptors, such as compact binary face descriptor and simultaneous local binary feature learning and encoding, which are susceptible to rotations, our RI-LBD first categorizes each local patch into a rotational binary pattern (RBP), and then jointly learns the orientation for each pattern and the projection matrix to obtain RI-LBDs. As all the rotation variants of a patch belong to the same RBP, they are rotated into the same orientation and projected into the same binary descriptor. Then, we construct a codebook by a clustering method on the learned binary codes, and obtain a histogram feature for each image as the final representation. In order to exploit higher order statistical information, we extend our RI-LBD to the triple rotation-invariant co-occurrence local binary descriptor (TRICo-LBD) learning method, which learns a triple co-occurrence binary code for each local patch. Extensive experimental results on four different visual recognition tasks, including image patch matching, texture classification, face recognition, and scene classification, show that our RI-LBD and TRICo-LBD outperform most existing local descriptors.

Generation of binary holograms for deep scenes captured with a camera and a depth sensor

NASA Astrophysics Data System (ADS)

Leportier, Thibault; Park, Min-Chul

2017-01-01

This work presents binary hologram generation from images of a real object acquired from a Kinect sensor. Since hologram calculation from a point-cloud or polygon model presents a heavy computational burden, we adopted a depth-layer approach to generate the holograms. This method enables us to obtain holographic data of large scenes quickly. Our investigations focus on the performance of different methods, iterative and noniterative, to convert complex holograms into binary format. Comparisons were performed to examine the reconstruction of the binary holograms at different depths. We also propose to modify the direct binary search algorithm to take into account several reference image planes. Then, deep scenes featuring multiple planes of interest can be reconstructed with better efficiency.

Iterative quantization: a Procrustean approach to learning binary codes for large-scale image retrieval.

PubMed

Gong, Yunchao; Lazebnik, Svetlana; Gordo, Albert; Perronnin, Florent

2013-12-01

This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections. We formulate this problem in terms of finding a rotation of zero-centered data so as to minimize the quantization error of mapping this data to the vertices of a zero-centered binary hypercube, and propose a simple and efficient alternating minimization algorithm to accomplish this task. This algorithm, dubbed iterative quantization (ITQ), has connections to multiclass spectral clustering and to the orthogonal Procrustes problem, and it can be used both with unsupervised data embeddings such as PCA and supervised embeddings such as canonical correlation analysis (CCA). The resulting binary codes significantly outperform several other state-of-the-art methods. We also show that further performance improvements can result from transforming the data with a nonlinear kernel mapping prior to PCA or CCA. Finally, we demonstrate an application of ITQ to learning binary attributes or "classemes" on the ImageNet data set.

Learning Short Binary Codes for Large-scale Image Retrieval.

PubMed

Liu, Li; Yu, Mengyang; Shao, Ling

2017-03-01

Large-scale visual information retrieval has become an active research area in this big data era. Recently, hashing/binary coding algorithms prove to be effective for scalable retrieval applications. Most existing hashing methods require relatively long binary codes (i.e., over hundreds of bits, sometimes even thousands of bits) to achieve reasonable retrieval accuracies. However, for some realistic and unique applications, such as on wearable or mobile devices, only short binary codes can be used for efficient image retrieval due to the limitation of computational resources or bandwidth on these devices. In this paper, we propose a novel unsupervised hashing approach called min-cost ranking (MCR) specifically for learning powerful short binary codes (i.e., usually the code length shorter than 100 b) for scalable image retrieval tasks. By exploring the discriminative ability of each dimension of data, MCR can generate one bit binary code for each dimension and simultaneously rank the discriminative separability of each bit according to the proposed cost function. Only top-ranked bits with minimum cost-values are then selected and grouped together to compose the final salient binary codes. Extensive experimental results on large-scale retrieval demonstrate that MCR can achieve comparative performance as the state-of-the-art hashing algorithms but with significantly shorter codes, leading to much faster large-scale retrieval.

A Permutation Approach for Selecting the Penalty Parameter in Penalized Model Selection

PubMed Central

Sabourin, Jeremy A; Valdar, William; Nobel, Andrew B

2015-01-01

Summary We describe a simple, computationally effcient, permutation-based procedure for selecting the penalty parameter in LASSO penalized regression. The procedure, permutation selection, is intended for applications where variable selection is the primary focus, and can be applied in a variety of structural settings, including that of generalized linear models. We briefly discuss connections between permutation selection and existing theory for the LASSO. In addition, we present a simulation study and an analysis of real biomedical data sets in which permutation selection is compared with selection based on the following: cross-validation (CV), the Bayesian information criterion (BIC), Scaled Sparse Linear Regression, and a selection method based on recently developed testing procedures for the LASSO. PMID:26243050

Atypical nucleus accumbens morphology in psychopathy: another limbic piece in the puzzle.

PubMed

Boccardi, Marina; Bocchetta, Martina; Aronen, Hannu J; Repo-Tiihonen, Eila; Vaurio, Olli; Thompson, Paul M; Tiihonen, Jari; Frisoni, Giovanni B

2013-01-01

Psychopathy has been associated with increased putamen and striatum volumes. The nucleus accumbens - a key structure in reversal learning, less effective in psychopathy - has not yet received specific attention. Moreover, basal ganglia morphology has never been explored. We examined the morphology of the caudate, putamen and accumbens, manually segmented from magnetic resonance images of 26 offenders (age: 32.5 ± 8.4) with medium-high psychopathy (mean PCL-R=30 ± 5) and 25 healthy controls (age: 34.6 ± 10.8). Local differences were statistically modeled using a surface-based radial distance mapping method (p<0.05; multiple comparisons correction through permutation tests). In psychopathy, the caudate and putamen had normal global volume, but different morphology, significant after correction for multiple comparisons, for the right dorsal putamen (permutation test: p=0.02). The volume of the nucleus accumbens was 13% smaller in psychopathy (p corrected for multiple comparisons <0.006). The atypical morphology consisted of predominant anterior hypotrophy bilaterally (10-30%). Caudate and putamen local morphology displayed negative correlation with the lifestyle factor of the PCL-R (permutation test: p=0.05 and 0.03). From these data, psychopathy appears to be associated with an atypical striatal morphology, with highly significant global and local differences of the accumbens. This is consistent with the clinical syndrome and with theories of limbic involvement. Copyright © 2013 Elsevier Ltd. All rights reserved.

Sub-Selective Quantization for Learning Binary Codes in Large-Scale Image Search.

PubMed

Li, Yeqing; Liu, Wei; Huang, Junzhou

2018-06-01

Recently with the explosive growth of visual content on the Internet, large-scale image search has attracted intensive attention. It has been shown that mapping high-dimensional image descriptors to compact binary codes can lead to considerable efficiency gains in both storage and performing similarity computation of images. However, most existing methods still suffer from expensive training devoted to large-scale binary code learning. To address this issue, we propose a sub-selection based matrix manipulation algorithm, which can significantly reduce the computational cost of code learning. As case studies, we apply the sub-selection algorithm to several popular quantization techniques including cases using linear and nonlinear mappings. Crucially, we can justify the resulting sub-selective quantization by proving its theoretic properties. Extensive experiments are carried out on three image benchmarks with up to one million samples, corroborating the efficacy of the sub-selective quantization method in terms of image retrieval.

Toward privacy-preserving JPEG image retrieval

NASA Astrophysics Data System (ADS)

Cheng, Hang; Wang, Jingyue; Wang, Meiqing; Zhong, Shangping

2017-07-01

This paper proposes a privacy-preserving retrieval scheme for JPEG images based on local variance. Three parties are involved in the scheme: the content owner, the server, and the authorized user. The content owner encrypts JPEG images for privacy protection by jointly using permutation cipher and stream cipher, and then, the encrypted versions are uploaded to the server. With an encrypted query image provided by an authorized user, the server may extract blockwise local variances in different directions without knowing the plaintext content. After that, it can calculate the similarity between the encrypted query image and each encrypted database image by a local variance-based feature comparison mechanism. The authorized user with the encryption key can decrypt the returned encrypted images with plaintext content similar to the query image. The experimental results show that the proposed scheme not only provides effective privacy-preserving retrieval service but also ensures both format compliance and file size preservation for encrypted JPEG images.

Image Retrieval using Integrated Features of Binary Wavelet Transform

NASA Astrophysics Data System (ADS)

Agarwal, Megha; Maheshwari, R. P.

2011-12-01

In this paper a new approach for image retrieval is proposed with the application of binary wavelet transform. This new approach facilitates the feature calculation with the integration of histogram and correlogram features extracted from binary wavelet subbands. Experiments are performed to evaluate and compare the performance of proposed method with the published literature. It is verified that average precision and average recall of proposed method (69.19%, 41.78%) is significantly improved compared to optimal quantized wavelet correlogram (OQWC) [6] (64.3%, 38.00%) and Gabor wavelet correlogram (GWC) [10] (64.1%, 40.6%). All the experiments are performed on Corel 1000 natural image database [20].

Overlap Cycles for Permutations: Necessary and Sufficient Conditions

DTIC Science & Technology

2013-09-19

for Weak Orders, To appear in SIAM Journal of Discrete Math . [9] G. Hurlbert and G. Isaak, Equivalence class universal cycles for permutations, Discrete ... Math . 149 (1996), pp. 123–129. [10] J. R. Johnson, Universal cycles for permutations, Discrete Math . 309 (2009), pp. 5264– 5270. [11] E. A. Ragland

Multi-response permutation procedure as an alternative to the analysis of variance: an SPSS implementation.

PubMed

Cai, Li

2006-02-01

A permutation test typically requires fewer assumptions than does a comparable parametric counterpart. The multi-response permutation procedure (MRPP) is a class of multivariate permutation tests of group difference useful for the analysis of experimental data. However, psychologists seldom make use of the MRPP in data analysis, in part because the MRPP is not implemented in popular statistical packages that psychologists use. A set of SPSS macros implementing the MRPP test is provided in this article. The use of the macros is illustrated by analyzing example data sets.

3-D Image Encryption Based on Rubik's Cube and RC6 Algorithm

NASA Astrophysics Data System (ADS)

Helmy, Mai; El-Rabaie, El-Sayed M.; Eldokany, Ibrahim M.; El-Samie, Fathi E. Abd

2017-12-01

A novel encryption algorithm based on the 3-D Rubik's cube is proposed in this paper to achieve 3D encryption of a group of images. This proposed encryption algorithm begins with RC6 as a first step for encrypting multiple images, separately. After that, the obtained encrypted images are further encrypted with the 3-D Rubik's cube. The RC6 encrypted images are used as the faces of the Rubik's cube. From the concepts of image encryption, the RC6 algorithm adds a degree of diffusion, while the Rubik's cube algorithm adds a degree of permutation. The simulation results demonstrate that the proposed encryption algorithm is efficient, and it exhibits strong robustness and security. The encrypted images are further transmitted over wireless Orthogonal Frequency Division Multiplexing (OFDM) system and decrypted at the receiver side. Evaluation of the quality of the decrypted images at the receiver side reveals good results.

Software For Tie-Point Registration Of SAR Data

NASA Technical Reports Server (NTRS)

Rignot, Eric; Dubois, Pascale; Okonek, Sharon; Van Zyl, Jacob; Burnette, Fred; Borgeaud, Maurice

1995-01-01

SAR-REG software package registers synthetic-aperture-radar (SAR) image data to common reference frame based on manual tie-pointing. Image data can be in binary, integer, floating-point, or AIRSAR compressed format. For example, with map of soil characteristics, vegetation map, digital elevation map, or SPOT multispectral image, as long as user can generate binary image to be used by tie-pointing routine and data are available in one of the previously mentioned formats. Written in FORTRAN 77.

A self-adaptive algorithm for traffic sign detection in motion image based on color and shape features

NASA Astrophysics Data System (ADS)

Zhang, Ka; Sheng, Yehua; Gong, Zhijun; Ye, Chun; Li, Yongqiang; Liang, Cheng

2007-06-01

As an important sub-system in intelligent transportation system (ITS), the detection and recognition of traffic signs from mobile images is becoming one of the hot spots in the international research field of ITS. Considering the problem of traffic sign automatic detection in motion images, a new self-adaptive algorithm for traffic sign detection based on color and shape features is proposed in this paper. Firstly, global statistical color features of different images are computed based on statistics theory. Secondly, some self-adaptive thresholds and special segmentation rules for image segmentation are designed according to these global color features. Then, for red, yellow and blue traffic signs, the color image is segmented to three binary images by these thresholds and rules. Thirdly, if the number of white pixels in the segmented binary image exceeds the filtering threshold, the binary image should be further filtered. Fourthly, the method of gray-value projection is used to confirm top, bottom, left and right boundaries for candidate regions of traffic signs in the segmented binary image. Lastly, if the shape feature of candidate region satisfies the need of real traffic sign, this candidate region is confirmed as the detected traffic sign region. The new algorithm is applied to actual motion images of natural scenes taken by a CCD camera of the mobile photogrammetry system in Nanjing at different time. The experimental results show that the algorithm is not only simple, robust and more adaptive to natural scene images, but also reliable and high-speed on real traffic sign detection.

Learning Compact Binary Face Descriptor for Face Recognition.

PubMed

Lu, Jiwen; Liong, Venice Erin; Zhou, Xiuzhuang; Zhou, Jie

2015-10-01

Binary feature descriptors such as local binary patterns (LBP) and its variations have been widely used in many face recognition systems due to their excellent robustness and strong discriminative power. However, most existing binary face descriptors are hand-crafted, which require strong prior knowledge to engineer them by hand. In this paper, we propose a compact binary face descriptor (CBFD) feature learning method for face representation and recognition. Given each face image, we first extract pixel difference vectors (PDVs) in local patches by computing the difference between each pixel and its neighboring pixels. Then, we learn a feature mapping to project these pixel difference vectors into low-dimensional binary vectors in an unsupervised manner, where 1) the variance of all binary codes in the training set is maximized, 2) the loss between the original real-valued codes and the learned binary codes is minimized, and 3) binary codes evenly distribute at each learned bin, so that the redundancy information in PDVs is removed and compact binary codes are obtained. Lastly, we cluster and pool these binary codes into a histogram feature as the final representation for each face image. Moreover, we propose a coupled CBFD (C-CBFD) method by reducing the modality gap of heterogeneous faces at the feature level to make our method applicable to heterogeneous face recognition. Extensive experimental results on five widely used face datasets show that our methods outperform state-of-the-art face descriptors.

The Ruinous Influence of Close Binary Companions on Planetary Systems

NASA Astrophysics Data System (ADS)

Kraus, Adam L.; Ireland, Michael; Mann, Andrew; Huber, Daniel; Dupuy, Trent J.

2017-01-01

The majority of solar-type stars are found in binary systems, and the dynamical influence of binary companions is expected to profoundly influence planetary systems. However, the difficulty of identifying planets in binary systems has left the magnitude of this effect uncertain; despite numerous theoretical hurdles to their formation and survival, at least some binary systems clearly host planets. We present high-resolution imaging of nearly 500 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. We super-resolve some binary systems to projected separations of under 5 AU, showing that planets might form in these dynamically active environments. However, the full distribution of projected separations for our planet-host sample more broadly reveals a deep paucity of binary companions at solar-system scales. When the binary population is parametrized with a semimajor axis cutoff a cut and a suppression factor inside that cutoff S bin, we find with correlated uncertainties that inside acut = 47 +59/-23 AU, the planet occurrence rate in binary systems is only Sbin = 0.34 +0.14/-0.15 times that of wider binaries or single stars. Our results demonstrate that a fifth of all solar-type stars in the Milky Way are disallowed from hosting planetary systems due to the influence of a binary companion.

The Ruinous Influence of Close Binary Companions on Planetary Systems

NASA Astrophysics Data System (ADS)

Kraus, Adam L.; Ireland, Michael; Mann, Andrew; Huber, Daniel; Dupuy, Trent J.

2017-06-01

The majority of solar-type stars are found in binary systems, and the dynamical influence of binary companions is expected to profoundly influence planetary systems. However, the difficulty of identifying planets in binary systems has left the magnitude of this effect uncertain; despite numerous theoretical hurdles to their formation and survival, at least some binary systems clearly host planets. We present high-resolution imaging of nearly 500 Kepler Objects of Interest (KOIs) obtained using adaptive-optics imaging and nonredundant aperture-mask interferometry on the Keck II telescope. We super-resolve some binary systems to projected separations of under 5 AU, showing that planets might form in these dynamically active environments. However, the full distribution of projected separations for our planet-host sample more broadly reveals a deep paucity of binary companions at solar-system scales. When the binary population is parametrized with a semimajor axis cutoff a cut and a suppression factor inside that cutoff S bin, we find with correlated uncertainties that inside acut = 47 +59/-23 AU, the planet occurrence rate in binary systems is only Sbin = 0.34+0.14/-0.15 times that of wider binaries or single stars. Our results demonstrate that a fifth of all solar-type stars in the Milky Way are disallowed from hosting planetary systems due to the influence of a binary companion.

Tse computers. [ultrahigh speed optical processing for two dimensional binary image

NASA Technical Reports Server (NTRS)

Schaefer, D. H.; Strong, J. P., III

1977-01-01

An ultra-high-speed computer that utilizes binary images as its basic computational entity is being developed. The basic logic components perform thousands of operations simultaneously. Technologies of the fiber optics, display, thin film, and semiconductor industries are being utilized in the building of the hardware.

Superradiant effects on pulse propagation in resonant media. [atomic excitations/coherent radiation - operators (mathematics)/matrices (mathematics)

NASA Technical Reports Server (NTRS)

Lee, C.

1975-01-01

Adopting the so-called genealogical construction, the eigenstates of collective operators can be expressed corresponding to a specified mode for an N-atom system in terms of those for an (N-1)-atom system. Matrix element of a collective operator of an arbitrary mode is presented which can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME was obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups was then introduced. This gave a simple and systematic way of calculating the RME. Results show explicitly the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes and clears up the chief difficulty encounted in the problem of N two-level atoms, spread over large regions, interacting with a multimode radiation field.

Using R to Simulate Permutation Distributions for Some Elementary Experimental Designs

ERIC Educational Resources Information Center

Eudey, T. Lynn; Kerr, Joshua D.; Trumbo, Bruce E.

2010-01-01

Null distributions of permutation tests for two-sample, paired, and block designs are simulated using the R statistical programming language. For each design and type of data, permutation tests are compared with standard normal-theory and nonparametric tests. These examples (often using real data) provide for classroom discussion use of metrics…

Evaluation of Second-Level Inference in fMRI Analysis

PubMed Central

Roels, Sanne P.; Loeys, Tom; Moerkerke, Beatrijs

2016-01-01

We investigate the impact of decisions in the second-level (i.e., over subjects) inferential process in functional magnetic resonance imaging on (1) the balance between false positives and false negatives and on (2) the data-analytical stability, both proxies for the reproducibility of results. Second-level analysis based on a mass univariate approach typically consists of 3 phases. First, one proceeds via a general linear model for a test image that consists of pooled information from different subjects. We evaluate models that take into account first-level (within-subjects) variability and models that do not take into account this variability. Second, one proceeds via inference based on parametrical assumptions or via permutation-based inference. Third, we evaluate 3 commonly used procedures to address the multiple testing problem: familywise error rate correction, False Discovery Rate (FDR) correction, and a two-step procedure with minimal cluster size. Based on a simulation study and real data we find that the two-step procedure with minimal cluster size results in most stable results, followed by the familywise error rate correction. The FDR results in most variable results, for both permutation-based inference and parametrical inference. Modeling the subject-specific variability yields a better balance between false positives and false negatives when using parametric inference. PMID:26819578

Crystal structures of the GCaMP calcium sensor reveal the mechanism of fluorescence signal change and aid rational design.

PubMed

Akerboom, Jasper; Rivera, Jonathan D Vélez; Guilbe, María M Rodríguez; Malavé, Elisa C Alfaro; Hernandez, Hector H; Tian, Lin; Hires, S Andrew; Marvin, Jonathan S; Looger, Loren L; Schreiter, Eric R

2009-03-06

The genetically encoded calcium indicator GCaMP2 shows promise for neural network activity imaging, but is currently limited by low signal-to-noise ratio. We describe x-ray crystal structures as well as solution biophysical and spectroscopic characterization of GCaMP2 in the calcium-free dark state, and in two calcium-bound bright states: a monomeric form that dominates at intracellular concentrations observed during imaging experiments and an unexpected domain-swapped dimer with decreased fluorescence. This series of structures provides insight into the mechanism of Ca2+-induced fluorescence change. Upon calcium binding, the calmodulin (CaM) domain wraps around the M13 peptide, creating a new domain interface between CaM and the circularly permuted enhanced green fluorescent protein domain. Residues from CaM alter the chemical environment of the circularly permuted enhanced green fluorescent protein chromophore and, together with flexible inter-domain linkers, block solvent access to the chromophore. Guided by the crystal structures, we engineered a series of GCaMP2 point mutants to probe the mechanism of GCaMP2 function and characterized one mutant with significantly improved signal-to-noise. The mutation is located at a domain interface and its effect on sensor function could not have been predicted in the absence of structural data.

Coupled binary embedding for large-scale image retrieval.

PubMed

Zheng, Liang; Wang, Shengjin; Tian, Qi

2014-08-01

Visual matching is a crucial step in image retrieval based on the bag-of-words (BoW) model. In the baseline method, two keypoints are considered as a matching pair if their SIFT descriptors are quantized to the same visual word. However, the SIFT visual word has two limitations. First, it loses most of its discriminative power during quantization. Second, SIFT only describes the local texture feature. Both drawbacks impair the discriminative power of the BoW model and lead to false positive matches. To tackle this problem, this paper proposes to embed multiple binary features at indexing level. To model correlation between features, a multi-IDF scheme is introduced, through which different binary features are coupled into the inverted file. We show that matching verification methods based on binary features, such as Hamming embedding, can be effectively incorporated in our framework. As an extension, we explore the fusion of binary color feature into image retrieval. The joint integration of the SIFT visual word and binary features greatly enhances the precision of visual matching, reducing the impact of false positive matches. Our method is evaluated through extensive experiments on four benchmark datasets (Ukbench, Holidays, DupImage, and MIR Flickr 1M). We show that our method significantly improves the baseline approach. In addition, large-scale experiments indicate that the proposed method requires acceptable memory usage and query time compared with other approaches. Further, when global color feature is integrated, our method yields competitive performance with the state-of-the-arts.

Generalized spin filtering and an improved derivative-sign binary image method for the extraction of fringe skeletons

NASA Astrophysics Data System (ADS)

Yu, Qifeng; Liu, Xiaolin; Sun, Xiangyi

1998-07-01

Generalized spin filters, including several directional filters such as the directional median filter and the directional binary filter, are proposed for removal of the noise of fringe patterns and the extraction of fringe skeletons with the help of fringe-orientation maps (FOM s). The generalized spin filters can filter off noise on fringe patterns and binary fringe patterns efficiently, without distortion of fringe features. A quadrantal angle filter is developed to filter off the FOM. With these new filters, the derivative-sign binary image (DSBI) method for extraction of fringe skeletons is improved considerably. The improved DSBI method can extract high-density skeletons as well as common density skeletons.

Circular permutation of a WW domain: Folding still occurs after excising the turn of the folding-nucleating hairpin

PubMed Central

Kier, Brandon L.; Anderson, Jordan M.; Andersen, Niels H.

2014-01-01

A hyperstable Pin1 WW domain has been circularly permuted via excision of the fold-nucleating turn; it still folds to form the native three-strand sheet and hydrophobic core features. Multiprobe folding dynamics studies of the normal and circularly permuted sequences, as well as their constituent hairpin fragments and comparable-length β-strand-loop-β-strand models, indicate 2-state folding for all topologies. N-terminal hairpin formation is the fold nucleating event for the wild-type sequence; the slower folding circular permutant has a more distributed folding transition state. PMID:24350581

High Information Capacity Quantum Imaging

DTIC Science & Technology

2014-09-19

single-pixel camera [41, 75]. An object is imaged onto a Digital Micromirror device ( DMD ), a 2D binary array of individually-addressable mirrors that...reflect light either to a single detector or a dump. Rows of the sensing matrix A consist of random, binary patterns placed sequentially on the DMD ...The single-pixel camera concept naturally adapts to imaging correlations by adding a second detector. Consider placing separate DMDs in the near-field

High-speed particle tracking in microscopy using SPAD image sensors

NASA Astrophysics Data System (ADS)

Gyongy, Istvan; Davies, Amy; Miguelez Crespo, Allende; Green, Andrew; Dutton, Neale A. W.; Duncan, Rory R.; Rickman, Colin; Henderson, Robert K.; Dalgarno, Paul A.

2018-02-01

Single photon avalanche diodes (SPADs) are used in a wide range of applications, from fluorescence lifetime imaging microscopy (FLIM) to time-of-flight (ToF) 3D imaging. SPAD arrays are becoming increasingly established, combining the unique properties of SPADs with widefield camera configurations. Traditionally, the photosensitive area (fill factor) of SPAD arrays has been limited by the in-pixel digital electronics. However, recent designs have demonstrated that by replacing the complex digital pixel logic with simple binary pixels and external frame summation, the fill factor can be increased considerably. A significant advantage of such binary SPAD arrays is the high frame rates offered by the sensors (>100kFPS), which opens up new possibilities for capturing ultra-fast temporal dynamics in, for example, life science cellular imaging. In this work we consider the use of novel binary SPAD arrays in high-speed particle tracking in microscopy. We demonstrate the tracking of fluorescent microspheres undergoing Brownian motion, and in intra-cellular vesicle dynamics, at high frame rates. We thereby show how binary SPAD arrays can offer an important advance in live cell imaging in such fields as intercellular communication, cell trafficking and cell signaling.

Binary partition tree analysis based on region evolution and its application to tree simplification.

PubMed

Lu, Huihai; Woods, John C; Ghanbari, Mohammed

2007-04-01

Pyramid image representations via tree structures are recognized methods for region-based image analysis. Binary partition trees can be applied which document the merging process with small details found at the bottom levels and larger ones close to the root. Hindsight of the merging process is stored within the tree structure and provides the change histories of an image property from the leaf to the root node. In this work, the change histories are modelled by evolvement functions and their second order statistics are analyzed by using a knee function. Knee values show the reluctancy of each merge. We have systematically formulated these findings to provide a novel framework for binary partition tree analysis, where tree simplification is demonstrated. Based on an evolvement function, for each upward path in a tree, the tree node associated with the first reluctant merge is considered as a pruning candidate. The result is a simplified version providing a reduced solution space and still complying with the definition of a binary tree. The experiments show that image details are preserved whilst the number of nodes is dramatically reduced. An image filtering tool also results which preserves object boundaries and has applications for segmentation.

Segmentation of white rat sperm image

NASA Astrophysics Data System (ADS)

Bai, Weiguo; Liu, Jianguo; Chen, Guoyuan

2011-11-01

The segmentation of sperm image exerts a profound influence in the analysis of sperm morphology, which plays a significant role in the research of animals' infertility and reproduction. To overcome the microscope image's properties of low contrast and highly polluted noise, and to get better segmentation results of sperm image, this paper presents a multi-scale gradient operator combined with a multi-structuring element for the micro-spermatozoa image of white rat, as the multi-scale gradient operator can smooth the noise of an image, while the multi-structuring element can retain more shape details of the sperms. Then, we use the Otsu method to segment the modified gradient image whose gray scale processed is strong in sperms and weak in the background, converting it into a binary sperm image. As the obtained binary image owns impurities that are not similar with sperms in the shape, we choose a form factor to filter those objects whose form factor value is larger than the select critical value, and retain those objects whose not. And then, we can get the final binary image of the segmented sperms. The experiment shows this method's great advantage in the segmentation of the micro-spermatozoa image.

Application of local binary pattern and human visual Fibonacci texture features for classification different medical images

NASA Astrophysics Data System (ADS)

Sanghavi, Foram; Agaian, Sos

2017-05-01

The goal of this paper is to (a) test the nuclei based Computer Aided Cancer Detection system using Human Visual based system on the histopathology images and (b) Compare the results of the proposed system with the Local Binary Pattern and modified Fibonacci -p pattern systems. The system performance is evaluated using different parameters such as accuracy, specificity, sensitivity, positive predictive value, and negative predictive value on 251 prostate histopathology images. The accuracy of 96.69% was observed for cancer detection using the proposed human visual based system compared to 87.42% and 94.70% observed for Local Binary patterns and the modified Fibonacci p patterns.

The Binary Offset Effect in CCDs: an Anomalous Readout Artifact Affecting Most Astronomical CCDs in Use

NASA Astrophysics Data System (ADS)

Boone, Kyle Robert; Aldering, Gregory; Copin, Yannick; Dixon, Samantha; Domagalski, Rachel; Gangler, Emmanuel; Pecontal, Emmanuel; Perlmutter, Saul; Nearby Supernova Factory Collaboration

2018-01-01

We discovered an anomalous behavior of CCD readout electronics that affects their use in many astronomical applications, which we call the “binary offset effect”. Due to feedback in the readout electronics, an offset is introduced in the values read out for each pixel that depends on the binary encoding of the previously read-out pixel values. One consequence of this effect is that a pathological local background offset can be introduced in images that only appears where science data are present on the CCD. The amplitude of this introduced offset does not scale monotonically with the amplitude of the objects in the image, and can be up to 4.5 ADU per pixel for certain instruments. Additionally, this background offset will be shifted by several pixels from the science data, potentially distorting the shape of objects in the image. We tested 22 instruments for signs of the binary offset effect and found evidence of it in 16 of them, including LRIS and DEIMOS on the Keck telescopes, WFC3-UVIS and STIS on HST, MegaCam on CFHT, SNIFS on the UH88 telescope, GMOS on the Gemini telescopes, HSC on Subaru, and FORS on VLT. A large amount of archival data is therefore affected by the binary offset effect, and conventional methods of reducing CCD images do not measure or remove the introduced offsets. As a demonstration of how to correct for the binary offset effect, we have developed a model that can accurately predict and remove the introduced offsets for the SNIFS instrument on the UH88 telescope. Accounting for the binary offset effect is essential for precision low-count astronomical observations with CCDs.

Physical Connectivity Mapping by Circular Permutation of Human Telomerase RNA Reveals New Regions Critical for Activity and Processivity.

PubMed

Mefford, Melissa A; Zappulla, David C

2016-01-15

Telomerase is a specialized ribonucleoprotein complex that extends the 3' ends of chromosomes to counteract telomere shortening. However, increased telomerase activity is associated with ∼90% of human cancers. The telomerase enzyme minimally requires an RNA (hTR) and a specialized reverse transcriptase protein (TERT) for activity in vitro. Understanding the structure-function relationships within hTR has important implications for human disease. For the first time, we have tested the physical-connectivity requirements in the 451-nucleotide hTR RNA using circular permutations, which reposition the 5' and 3' ends. Our extensive in vitro analysis identified three classes of hTR circular permutants with altered function. First, circularly permuting 3' of the template causes specific defects in repeat-addition processivity, revealing that the template recognition element found in ciliates is conserved in human telomerase RNA. Second, seven circular permutations residing within the catalytically important core and CR4/5 domains completely abolish telomerase activity, unveiling mechanistically critical portions of these domains. Third, several circular permutations between the core and CR4/5 significantly increase telomerase activity. Our extensive circular permutation results provide insights into the architecture and coordination of human telomerase RNA and highlight where the RNA could be targeted for the development of antiaging and anticancer therapeutics. Copyright © 2016, American Society for Microbiology. All Rights Reserved.

Physical Connectivity Mapping by Circular Permutation of Human Telomerase RNA Reveals New Regions Critical for Activity and Processivity

PubMed Central

Mefford, Melissa A.

2015-01-01

Telomerase is a specialized ribonucleoprotein complex that extends the 3′ ends of chromosomes to counteract telomere shortening. However, increased telomerase activity is associated with ∼90% of human cancers. The telomerase enzyme minimally requires an RNA (hTR) and a specialized reverse transcriptase protein (TERT) for activity in vitro. Understanding the structure-function relationships within hTR has important implications for human disease. For the first time, we have tested the physical-connectivity requirements in the 451-nucleotide hTR RNA using circular permutations, which reposition the 5′ and 3′ ends. Our extensive in vitro analysis identified three classes of hTR circular permutants with altered function. First, circularly permuting 3′ of the template causes specific defects in repeat-addition processivity, revealing that the template recognition element found in ciliates is conserved in human telomerase RNA. Second, seven circular permutations residing within the catalytically important core and CR4/5 domains completely abolish telomerase activity, unveiling mechanistically critical portions of these domains. Third, several circular permutations between the core and CR4/5 significantly increase telomerase activity. Our extensive circular permutation results provide insights into the architecture and coordination of human telomerase RNA and highlight where the RNA could be targeted for the development of antiaging and anticancer therapeutics. PMID:26503788

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.

PubMed

Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun

2018-07-01

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.

Practical low-cost visual communication using binary images for deaf sign language.

PubMed

Manoranjan, M D; Robinson, J A

2000-03-01

Deaf sign language transmitted by video requires a temporal resolution of 8 to 10 frames/s for effective communication. Conventional videoconferencing applications, when operated over low bandwidth telephone lines, provide very low temporal resolution of pictures, of the order of less than a frame per second, resulting in jerky movement of objects. This paper presents a practical solution for sign language communication, offering adequate temporal resolution of images using moving binary sketches or cartoons, implemented on standard personal computer hardware with low-cost cameras and communicating over telephone lines. To extract cartoon points an efficient feature extraction algorithm adaptive to the global statistics of the image is proposed. To improve the subjective quality of the binary images, irreversible preprocessing techniques, such as isolated point removal and predictive filtering, are used. A simple, efficient and fast recursive temporal prefiltering scheme, using histograms of successive frames, reduces the additive and multiplicative noise from low-cost cameras. An efficient three-dimensional (3-D) compression scheme codes the binary sketches. Subjective tests performed on the system confirm that it can be used for sign language communication over telephone lines.

Aberration-free superresolution imaging via binary speckle pattern encoding and processing

NASA Astrophysics Data System (ADS)

Ben-Eliezer, Eyal; Marom, Emanuel

2007-04-01

We present an approach that provides superresolution beyond the classical limit as well as image restoration in the presence of aberrations; in particular, the ability to obtain superresolution while extending the depth of field (DOF) simultaneously is tested experimentally. It is based on an approach, recently proposed, shown to increase the resolution significantly for in-focus images by speckle encoding and decoding. In our approach, an object multiplied by a fine binary speckle pattern may be located anywhere along an extended DOF region. Since the exact magnification is not known in the presence of defocus aberration, the acquired low-resolution image is electronically processed via a parallel-branch decoding scheme, where in each branch the image is multiplied by the same high-resolution synchronized time-varying binary speckle but with different magnification. Finally, a hard-decision algorithm chooses the branch that provides the highest-resolution output image, thus achieving insensitivity to aberrations as well as DOF variations. Simulation as well as experimental results are presented, exhibiting significant resolution improvement factors.

Spatially variant morphological restoration and skeleton representation.

PubMed

Bouaynaya, Nidhal; Charif-Chefchaouni, Mohammed; Schonfeld, Dan

2006-11-01

The theory of spatially variant (SV) mathematical morphology is used to extend and analyze two important image processing applications: morphological image restoration and skeleton representation of binary images. For morphological image restoration, we propose the SV alternating sequential filters and SV median filters. We establish the relation of SV median filters to the basic SV morphological operators (i.e., SV erosions and SV dilations). For skeleton representation, we present a general framework for the SV morphological skeleton representation of binary images. We study the properties of the SV morphological skeleton representation and derive conditions for its invertibility. We also develop an algorithm for the implementation of the SV morphological skeleton representation of binary images. The latter algorithm is based on the optimal construction of the SV structuring element mapping designed to minimize the cardinality of the SV morphological skeleton representation. Experimental results show the dramatic improvement in the performance of the SV morphological restoration and SV morphological skeleton representation algorithms in comparison to their translation-invariant counterparts.

All Source Sensor Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

- PNNL, Harold Trease

2012-10-10

ASSA is a software application that processes binary data into summarized index tables that can be used to organize features contained within the data. ASSA's index tables can also be used to search for user specified features. ASSA is designed to organize and search for patterns in unstructured binary data streams or archives, such as video, images, audio, and network traffic. ASSA is basically a very general search engine used to search for any pattern in any binary data stream. It has uses in video analytics, image analysis, audio analysis, searching hard-drives, monitoring network traffic, etc.

Altering the orientation of a fused protein to the RNA-binding ribosomal protein L7Ae and its derivatives through circular permutation.

PubMed

Ohuchi, Shoji J; Sagawa, Fumihiko; Sakamoto, Taiichi; Inoue, Tan

2015-10-23

RNA-protein complexes (RNPs) are useful for constructing functional nano-objects because a variety of functional proteins can be displayed on a designed RNA scaffold. Here, we report circular permutations of an RNA-binding protein L7Ae based on the three-dimensional structure information to alter the orientation of the displayed proteins on the RNA scaffold. An electrophoretic mobility shift assay and atomic force microscopy (AFM) analysis revealed that most of the designed circular permutants formed an RNP nano-object. Moreover, the alteration of the enhanced green fluorescent protein (EGFP) orientation was confirmed with AFM by employing EGFP on the L7Ae permutant on the RNA. The results demonstrate that targeted fine-tuning of the stereo-specific fixation of a protein on a protein-binding RNA is feasible by using the circular permutation technique. Copyright © 2015 Elsevier Inc. All rights reserved.

Linear models: permutation methods

USGS Publications Warehouse

Cade, B.S.; Everitt, B.S.; Howell, D.C.

2005-01-01

Permutation tests (see Permutation Based Inference) for the linear model have applications in behavioral studies when traditional parametric assumptions about the error term in a linear model are not tenable. Improved validity of Type I error rates can be achieved with properly constructed permutation tests. Perhaps more importantly, increased statistical power, improved robustness to effects of outliers, and detection of alternative distributional differences can be achieved by coupling permutation inference with alternative linear model estimators. For example, it is well-known that estimates of the mean in linear model are extremely sensitive to even a single outlying value of the dependent variable compared to estimates of the median [7, 19]. Traditionally, linear modeling focused on estimating changes in the center of distributions (means or medians). However, quantile regression allows distributional changes to be estimated in all or any selected part of a distribution or responses, providing a more complete statistical picture that has relevance to many biological questions [6]...

Altering the orientation of a fused protein to the RNA-binding ribosomal protein L7Ae and its derivatives through circular permutation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ohuchi, Shoji J.; Sagawa, Fumihiko; Sakamoto, Taiichi

RNA-protein complexes (RNPs) are useful for constructing functional nano-objects because a variety of functional proteins can be displayed on a designed RNA scaffold. Here, we report circular permutations of an RNA-binding protein L7Ae based on the three-dimensional structure information to alter the orientation of the displayed proteins on the RNA scaffold. An electrophoretic mobility shift assay and atomic force microscopy (AFM) analysis revealed that most of the designed circular permutants formed an RNP nano-object. Moreover, the alteration of the enhanced green fluorescent protein (EGFP) orientation was confirmed with AFM by employing EGFP on the L7Ae permutant on the RNA. Themore » results demonstrate that targeted fine-tuning of the stereo-specific fixation of a protein on a protein-binding RNA is feasible by using the circular permutation technique.« less

Probabilistic seismic history matching using binary images

NASA Astrophysics Data System (ADS)

Davolio, Alessandra; Schiozer, Denis Jose

2018-02-01

Currently, the goal of history-matching procedures is not only to provide a model matching any observed data but also to generate multiple matched models to properly handle uncertainties. One such approach is a probabilistic history-matching methodology based on the discrete Latin Hypercube sampling algorithm, proposed in previous works, which was particularly efficient for matching well data (production rates and pressure). 4D seismic (4DS) data have been increasingly included into history-matching procedures. A key issue in seismic history matching (SHM) is to transfer data into a common domain: impedance, amplitude or pressure, and saturation. In any case, seismic inversions and/or modeling are required, which can be time consuming. An alternative to avoid these procedures is using binary images in SHM as they allow the shape, rather than the physical values, of observed anomalies to be matched. This work presents the incorporation of binary images in SHM within the aforementioned probabilistic history matching. The application was performed with real data from a segment of the Norne benchmark case that presents strong 4D anomalies, including softening signals due to pressure build up. The binary images are used to match the pressurized zones observed in time-lapse data. Three history matchings were conducted using: only well data, well and 4DS data, and only 4DS. The methodology is very flexible and successfully utilized the addition of binary images for seismic objective functions. Results proved the good convergence of the method in few iterations for all three cases. The matched models of the first two cases provided the best results, with similar well matching quality. The second case provided models presenting pore pressure changes according to the expected dynamic behavior (pressurized zones) observed on 4DS data. The use of binary images in SHM is relatively new with few examples in the literature. This work enriches this discussion by presenting a new application to match pressure in a reservoir segment with complex pressure behavior.

Optoelectronic Inner-Product Neural Associative Memory

NASA Technical Reports Server (NTRS)

Liu, Hua-Kuang

1993-01-01

Optoelectronic apparatus acts as artificial neural network performing associative recall of binary images. Recall process is iterative one involving optical computation of inner products between binary input vector and one or more reference binary vectors in memory. Inner-product method requires far less memory space than matrix-vector method.

Automatic event detection in low SNR microseismic signals based on multi-scale permutation entropy and a support vector machine

NASA Astrophysics Data System (ADS)

Jia, Rui-Sheng; Sun, Hong-Mei; Peng, Yan-Jun; Liang, Yong-Quan; Lu, Xin-Ming

2017-07-01

Microseismic monitoring is an effective means for providing early warning of rock or coal dynamical disasters, and its first step is microseismic event detection, although low SNR microseismic signals often cannot effectively be detected by routine methods. To solve this problem, this paper presents permutation entropy and a support vector machine to detect low SNR microseismic events. First, an extraction method of signal features based on multi-scale permutation entropy is proposed by studying the influence of the scale factor on the signal permutation entropy. Second, the detection model of low SNR microseismic events based on the least squares support vector machine is built by performing a multi-scale permutation entropy calculation for the collected vibration signals, constructing a feature vector set of signals. Finally, a comparative analysis of the microseismic events and noise signals in the experiment proves that the different characteristics of the two can be fully expressed by using multi-scale permutation entropy. The detection model of microseismic events combined with the support vector machine, which has the features of high classification accuracy and fast real-time algorithms, can meet the requirements of online, real-time extractions of microseismic events.

Modulation of a protein free-energy landscape by circular permutation.

PubMed

Radou, Gaël; Enciso, Marta; Krivov, Sergei; Paci, Emanuele

2013-11-07

Circular permutations usually retain the native structure and function of a protein while inevitably perturbing its folding dynamics. By using simulations with a structure-based model and a rigorous methodology to determine free-energy surfaces from trajectories, we evaluate the effect of a circular permutation on the free-energy landscape of the protein T4 lysozyme. We observe changes which, although subtle, largely affect the cooperativity between the two subdomains. Such a change in cooperativity has been previously experimentally observed and recently also characterized using single molecule optical tweezers and the Crooks relation. The free-energy landscapes show that both the wild type and circular permutant have an on-pathway intermediate, previously experimentally characterized, in which one of the subdomains is completely formed. The landscapes, however, differ in the position of the rate-limiting step for folding, which occurs before the intermediate in the wild type and after in the circular permutant. This shift of transition state explains the observed change in the cooperativity. The underlying free-energy landscape thus provides a microscopic description of the folding dynamics and the connection between circular permutation and the loss of cooperativity experimentally observed.

Toward a general theory of conical intersections in systems of identical nuclei

NASA Astrophysics Data System (ADS)

Keating, Sean P.; Mead, C. Alden

1987-02-01

It has been shown previously that the Herzberg-Longuet-Higgins sign change produced in Born-Oppenheimer electronic wave functions when the nuclei traverse a closed path around a conical intersection has implications for the symmetry of wave functions under permutations of identical nuclei. For systems of three or four identical nuclei, there are special features present which have facilitated the detailed analysis. The present paper reports progress toward a general theory for systems of n nuclei. For n=3 or 4, the two key functions which locate conical intersections and define compensating phase factors can conveniently be defined so as to transform under permutations according to a two-dimensional irreducible representation of the permutation group. Since such representations do not exist for n>4, we have chosen to develop a formalism in terms of lab-fixed electronic basis functions, and we show how to define the two key functions in principle. The functions so defined both turn out to be totally symmetric under permutations. We show how they can be used to define compensating phase factors so that all modified electronic wave functions are either totally symmetric or totally antisymmetric under permutations. A detailed analysis is made to cyclic permutations in the neighborhood of Dnh symmetry, which can be extended by continuity arguments to more general configurations, and criteria are obtained for sign changes. There is a qualitative discussion of the treatment of more general permutations.

Isometries and binary images of linear block codes over ℤ4 + uℤ4 and ℤ8 + uℤ8

NASA Astrophysics Data System (ADS)

Sison, Virgilio; Remillion, Monica

2017-10-01

Let {{{F}}}2 be the binary field and ℤ2 r the residue class ring of integers modulo 2 r , where r is a positive integer. For the finite 16-element commutative local Frobenius non-chain ring ℤ4 + uℤ4, where u is nilpotent of index 2, two weight functions are considered, namely the Lee weight and the homogeneous weight. With the appropriate application of these weights, isometric maps from ℤ4 + uℤ4 to the binary spaces {{{F}}}24 and {{{F}}}28, respectively, are established via the composition of other weight-based isometries. The classical Hamming weight is used on the binary space. The resulting isometries are then applied to linear block codes over ℤ4+ uℤ4 whose images are binary codes of predicted length, which may or may not be linear. Certain lower and upper bounds on the minimum distances of the binary images are also derived in terms of the parameters of the ℤ4 + uℤ4 codes. Several new codes and their images are constructed as illustrative examples. An analogous procedure is performed successfully on the ring ℤ8 + uℤ8, where u 2 = 0, which is a commutative local Frobenius non-chain ring of order 64. It turns out that the method is possible in general for the class of rings ℤ2 r + uℤ2 r , where u 2 = 0, for any positive integer r, using the generalized Gray map from ℤ2 r to {{{F}}}2{2r-1}.

Automatic target detection using binary template matching

NASA Astrophysics Data System (ADS)

Jun, Dong-San; Sun, Sun-Gu; Park, HyunWook

2005-03-01

This paper presents a new automatic target detection (ATD) algorithm to detect targets such as battle tanks and armored personal carriers in ground-to-ground scenarios. Whereas most ATD algorithms were developed for forward-looking infrared (FLIR) images, we have developed an ATD algorithm for charge-coupled device (CCD) images, which have superior quality to FLIR images in daylight. The proposed algorithm uses fast binary template matching with an adaptive binarization, which is robust to various light conditions in CCD images and saves computation time. Experimental results show that the proposed method has good detection performance.

High-Speed Binary-Output Image Sensor

NASA Technical Reports Server (NTRS)

Fossum, Eric; Panicacci, Roger A.; Kemeny, Sabrina E.; Jones, Peter D.

1996-01-01

Photodetector outputs digitized by circuitry on same integrated-circuit chip. Developmental special-purpose binary-output image sensor designed to capture up to 1,000 images per second, with resolution greater than 10 to the 6th power pixels per image. Lower-resolution but higher-frame-rate prototype of sensor contains 128 x 128 array of photodiodes on complementary metal oxide/semiconductor (CMOS) integrated-circuit chip. In application for which it is being developed, sensor used to examine helicopter oil to determine whether amount of metal and sand in oil sufficient to warrant replacement.

Numerical Generation of Double Star Images for Different Types of Telescopes

NASA Astrophysics Data System (ADS)

Xavier, Ademir

2015-11-01

This paper reviews the modeling of stellar images using diffraction theory applied to different types of telescope masks. The masks are projected by secondary mirror holder vanes (such as the spider type) or holes on the primary mirror which result in different configurations of single stellar images. Using Fast Fourier Transform, the image of binary stars with different magnitudes is calculated. Given the numerical results obtained, a discussion is presented on the best secondary vane configurations and on the effect of obstruction types for the separation of binary pairs with different magnitudes.

Applying local binary patterns in image clustering problems

NASA Astrophysics Data System (ADS)

Skorokhod, Nikolai N.; Elizarov, Alexey I.

2017-11-01

Due to the fact that the cloudiness plays a critical role in the Earth radiative balance, the study of the distribution of different types of clouds and their movements is relevant. The main sources of such information are artificial satellites that provide data in the form of images. The most commonly used method of solving tasks of processing and classification of images of clouds is based on the description of texture features. The use of a set of local binary patterns is proposed to describe the texture image.

Efficient algorithms for dilated mappings of binary trees

NASA Technical Reports Server (NTRS)

Iqbal, M. Ashraf

1990-01-01

The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

Kitt Peak Speckle Interferometry of Close Visual Binary Stars (Abstract)

NASA Astrophysics Data System (ADS)

Gener, R.; Rowe, D.; Smith, T. C.; Teiche, A.; Harshaw, R.; Wallace, D.; Weise, E.; Wiley, E.; Boyce, G.; Boyce, P.; Branston, D.; Chaney, K.; Clark, R. K.; Estrada, C.; Estrada, R.; Frey, T.; Green, W. L.; Haurberg, N.; Jones, G.; Kenney, J.; Loftin, S.; McGieson, I.; Patel, R.; Plummer, J.; Ridgely, J.; Trueblood, M.; Westergren, D.; Wren, P.

2014-12-01

(Abstract only) Speckle interferometry can be used to overcome normal seeing limitations by taking many very short exposures at high magnification and analyzing the resulting speckles to obtain the position angles and separations of close binary stars. A typical speckle observation of a close binary consists of 1,000 images, each 20 milliseconds in duration. The images are stored as a multi-plane FITS cube. A portable speckle interferometry system that features an electron-multiplying CCD camera was used by the authors during two week-long observing runs on the 2.1-meter telescope at Kitt Peak National Observatory to obtain some 1,000 data cubes of close binaries selected from a dozen different research programs. Many hundreds of single reference stars were also observed and used in deconvolution to remove undesirable atmospheric and telescope optical effects. The database of well over one million images was reduced with the Speckle Interferometry Tool of platesolve3. A few sample results are provided. During the second Kitt Peak run, the McMath-Pierce 1.6- and 0.8-meter solar telescopes were evaluated for nighttime speckle interferometry, while the 0.8-meter Coude feed was used to obtain differential radial velocities of short arc binaries.

Kitt Peak Speckle Interferometry of Close Visual Binary Stars

NASA Astrophysics Data System (ADS)

Genet, Russell M.; Rowe, David; Smith, Thomas C.; Teiche, Alex; Harshaw, Richard; Wallace, Daniel; Weise, Eric; Wiley, Edward; Boyce, Grady; Boyce, Patrick; Branston, Detrick; Chaney, Kayla; Clark, R. Kent; Estrada, Chris; Frey, Thomas; Estrada, Reed; Green, Wayne; Haurberg, Nathalie; Kenney, John; Jones, Greg; Loftin, Sheri; McGieson, Izak; Patel, Rikita; Plummer, Josh; Ridgely, John; Trueblood, Mark; Westergren, Donald; Wren, Paul

2015-09-01

Speckle interferometry can be used to overcome normal seeing limitations by taking many very short exposures at high magnification and analyzing the resulting speckles to obtain the position angles and separations of close binary stars. A typical speckle observation of a close binary consists of 1000 images, each 20 milliseconds in duration. The images are stored as a multi-plane FITS cube. A portable speckle interferometry system that features an electronmultiplying CCD camera was used by the authors during two week-long observing runs on the 2.1-meter telescope at Kitt Peak National Observatory to obtain some 1000 data cubes of close binaries selected from a dozen different research programs. Many hundreds of single reference stars were also observed and used in deconvolution to remove undesirable atmospheric and telescope optical effects. The data base of well over one million images was reduced with the Speckle Interferometry Tool of PlateSolve 3. A few sample results are provided. During the second Kitt Peak run, the McMath-Pierce 1.6- and 0.8-meter solar telescopes were evaluated for nighttime speckle interferometry, while the 0.8-meter Coude feed was used to obtain differential radial velocities of short arc binaries.

Organic–inorganic binary mixture matrix for comprehensive laser-desorption ionization mass spectrometric analysis and imaging of medium-size molecules including phospholipids, glycerolipids, and oligosaccharides

DOE PAGES

Feenstra, Adam D.; Ames Lab., Ames, IA; O'Neill, Kelly C.; ...

2016-10-13

Matrix-assisted laser desorption/ionization mass spectrometry (MALDI-MS) is a widely adopted, versatile technique, especially in high-throughput analysis and imaging. However, matrix-dependent selectivity of analytes is often a severe limitation. In this work, a mixture of organic 2,5-dihydroxybenzoic acid and inorganic Fe 3O 4 nanoparticles is developed as a binary MALDI matrix to alleviate the well-known issue of triacylglycerol (TG) ion suppression by phosphatidylcholine (PC). In application to lipid standards and maize seed cross-sections, the binary matrix not only dramatically reduced the ion suppression of TG, but also efficiently desorbed and ionized a wide variety of lipids such as cationic PC, anionicmore » phosphatidylethanolamine (PE) and phosphatidylinositol (PI), and neutral digalactosyldiacylglycerol (DGDG). The binary matrix was also very efficient for large polysaccharides, which were not detected by either of the individual matrices. As a result, the usefulness of the binary matrix is demonstrated in MS imaging of maize seed sections, successfully visualizing diverse medium-size molecules and acquiring high-quality MS/MS spectra for these compounds.« less

Inference for Distributions over the Permutation Group

DTIC Science & Technology

2008-05-01

world problems, such as voting , ranking, and data association. Representing uncertainty over permutations is challenging, since there are n...problems, such as voting , ranking, and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities...the Krone ker (or Tensor ) Produ t Representation.In general, the Krone ker produ t representation is redu ible, and so it ande omposed into a dire t

Students' Errors in Solving the Permutation and Combination Problems Based on Problem Solving Steps of Polya

ERIC Educational Resources Information Center

Sukoriyanto; Nusantara, Toto; Subanji; Chandra, Tjang Daniel

2016-01-01

This article was written based on the results of a study evaluating students' errors in problem solving of permutation and combination in terms of problem solving steps according to Polya. Twenty-five students were asked to do four problems related to permutation and combination. The research results showed that the students still did a mistake in…

Neighborhood binary speckle pattern for deformation measurements insensitive to local illumination variation by digital image correlation.

PubMed

Zhao, Jian; Yang, Ping; Zhao, Yue

2017-06-01

Speckle pattern-based characteristics of digital image correlation (DIC) restrict its application in engineering fields and nonlaboratory environments, since serious decorrelation effect occurs due to localized sudden illumination variation. A simple and efficient speckle pattern adjusting and optimizing approach presented in this paper is aimed at providing a novel speckle pattern robust enough to resist local illumination variation. The new speckle pattern, called neighborhood binary speckle pattern, derived from original speckle pattern, is obtained by means of thresholding the pixels of a neighborhood at its central pixel value and considering the result as a binary number. The efficiency of the proposed speckle pattern is evaluated in six experimental scenarios. Experiment results indicate that the DIC measurements based on neighborhood binary speckle pattern are able to provide reliable and accurate results, even though local brightness and contrast of the deformed images have been seriously changed. It is expected that the new speckle pattern will have more potential value in engineering applications.

Sorting signed permutations by short operations.

PubMed

Galvão, Gustavo Rodrigues; Lee, Orlando; Dias, Zanoni

2015-01-01

During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the most common operations are reversals, which are responsible for reversing the order and orientation of a sequence of genes, and transpositions, which are responsible for switching the location of two contiguous portions of a genome. The problem of computing the minimum sequence of operations that transforms one genome into another - which is equivalent to the problem of sorting a permutation into the identity permutation - is a well-studied problem that finds application in comparative genomics. There are a number of works concerning this problem in the literature, but they generally do not take into account the length of the operations (i.e. the number of genes affected by the operations). Since it has been observed that short operations are prevalent in the evolution of some species, algorithms that efficiently solve this problem in the special case of short operations are of interest. In this paper, we investigate the problem of sorting a signed permutation by short operations. More precisely, we study four flavors of this problem: (i) the problem of sorting a signed permutation by reversals of length at most 2; (ii) the problem of sorting a signed permutation by reversals of length at most 3; (iii) the problem of sorting a signed permutation by reversals and transpositions of length at most 2; and (iv) the problem of sorting a signed permutation by reversals and transpositions of length at most 3. We present polynomial-time solutions for problems (i) and (iii), a 5-approximation for problem (ii), and a 3-approximation for problem (iv). Moreover, we show that the expected approximation ratio of the 5-approximation algorithm is not greater than 3 for random signed permutations with more than 12 elements. Finally, we present experimental results that show that the approximation ratios of the approximation algorithms cannot be smaller than 3. In particular, this means that the approximation ratio of the 3-approximation algorithm is tight.

Infrared moving small target detection based on saliency extraction and image sparse representation

NASA Astrophysics Data System (ADS)

Zhang, Xiaomin; Ren, Kan; Gao, Jin; Li, Chaowei; Gu, Guohua; Wan, Minjie

2016-10-01

Moving small target detection in infrared image is a crucial technique of infrared search and tracking system. This paper present a novel small target detection technique based on frequency-domain saliency extraction and image sparse representation. First, we exploit the features of Fourier spectrum image and magnitude spectrum of Fourier transform to make a rough extract of saliency regions and use a threshold segmentation system to classify the regions which look salient from the background, which gives us a binary image as result. Second, a new patch-image model and over-complete dictionary were introduced to the detection system, then the infrared small target detection was converted into a problem solving and optimization process of patch-image information reconstruction based on sparse representation. More specifically, the test image and binary image can be decomposed into some image patches follow certain rules. We select the target potential area according to the binary patch-image which contains salient region information, then exploit the over-complete infrared small target dictionary to reconstruct the test image blocks which may contain targets. The coefficients of target image patch satisfy sparse features. Finally, for image sequence, Euclidean distance was used to reduce false alarm ratio and increase the detection accuracy of moving small targets in infrared images due to the target position correlation between frames.

Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.

PubMed

Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan

2017-06-01

In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.

Edge-SIFT: discriminative binary descriptor for scalable partial-duplicate mobile search.

PubMed

Zhang, Shiliang; Tian, Qi; Lu, Ke; Huang, Qingming; Gao, Wen

2013-07-01

As the basis of large-scale partial duplicate visual search on mobile devices, image local descriptor is expected to be discriminative, efficient, and compact. Our study shows that the popularly used histogram-based descriptors, such as scale invariant feature transform (SIFT) are not optimal for this task. This is mainly because histogram representation is relatively expensive to compute on mobile platforms and loses significant spatial clues, which are important for improving discriminative power and matching near-duplicate image patches. To address these issues, we propose to extract a novel binary local descriptor named Edge-SIFT from the binary edge maps of scale- and orientation-normalized image patches. By preserving both locations and orientations of edges and compressing the sparse binary edge maps with a boosting strategy, the final Edge-SIFT shows strong discriminative power with compact representation. Furthermore, we propose a fast similarity measurement and an indexing framework with flexible online verification. Hence, the Edge-SIFT allows an accurate and efficient image search and is ideal for computation sensitive scenarios such as a mobile image search. Experiments on a large-scale dataset manifest that the Edge-SIFT shows superior retrieval accuracy to Oriented BRIEF (ORB) and is superior to SIFT in the aspects of retrieval precision, efficiency, compactness, and transmission cost.

Photometric Analysis and Modeling of Five Mass-Transferring Binary Systems

NASA Astrophysics Data System (ADS)

Geist, Emily; Beaky, Matthew; Jamison, Kate

2018-01-01

In overcontact eclipsing binary systems, both stellar components have overfilled their Roche lobes, resulting in a dumbbell-shaped shared envelope. Mass transfer is common in overcontact binaries, which can be observed as a slow change on the rotation period of the system.We studied five overcontact eclipsing binary systems with evidence of period change, and thus likely mass transfer between the components, identified by Nelson (2014): V0579 Lyr, KN Vul, V0406 Lyr, V2240 Cyg, and MS Her. We used the 31-inch NURO telescope at Lowell Observatory in Flagstaff, Arizona to obtain images in B,V,R, and I filters for V0579 Lyr, and the 16-inch Meade LX200GPS telescope with attached SBIG ST-8XME CCD camera at Juniata College in Huntingdon, Pennsylvania to image KN Vul, V0406 Lyr, V2240 Cyg, and MS Her, also in B,V,R, and I.After data reduction, we created light curves for each of the systems and modeled the eclipsing binaries using the BinaryMaker3 and PHOEBE programs to determine their fundamental physical parameters for the first time. Complete light curves and preliminary models for each of these neglected eclipsing binary systems will be presented.

Determination of mango fruit from binary image using randomized Hough transform

NASA Astrophysics Data System (ADS)

Rizon, Mohamed; Najihah Yusri, Nurul Ain; Abdul Kadir, Mohd Fadzil; bin Mamat, Abd. Rasid; Abd Aziz, Azim Zaliha; Nanaa, Kutiba

2015-12-01

A method of detecting mango fruit from RGB input image is proposed in this research. From the input image, the image is processed to obtain the binary image using the texture analysis and morphological operations (dilation and erosion). Later, the Randomized Hough Transform (RHT) method is used to find the best ellipse fits to each binary region. By using the texture analysis, the system can detect the mango fruit that is partially overlapped with each other and mango fruit that is partially occluded by the leaves. The combination of texture analysis and morphological operator can isolate the partially overlapped fruit and fruit that are partially occluded by leaves. The parameters derived from RHT method was used to calculate the center of the ellipse. The center of the ellipse acts as the gripping point for the fruit picking robot. As the results, the rate of detection was up to 95% for fruit that is partially overlapped and partially covered by leaves.

Perimetric Complexity of Binary Digital Images: Notes on Calculation and Relation to Visual Complexity

NASA Technical Reports Server (NTRS)

Watson, Andrew B.

2011-01-01

Perimetric complexity is a measure of the complexity of binary pictures. It is defined as the sum of inside and outside perimeters of the foreground, squared, divided by the foreground area, divided by 4p . Difficulties arise when this definition is applied to digital images composed of binary pixels. In this paper we identify these problems and propose solutions. Perimetric complexity is often used as a measure of visual complexity, in which case it should take into account the limited resolution of the visual system. We propose a measure of visual perimetric complexity that meets this requirement.

A Novel Color Image Encryption Algorithm Based on Quantum Chaos Sequence

NASA Astrophysics Data System (ADS)

Liu, Hui; Jin, Cong

2017-03-01

In this paper, a novel algorithm of image encryption based on quantum chaotic is proposed. The keystreams are generated by the two-dimensional logistic map as initial conditions and parameters. And then general Arnold scrambling algorithm with keys is exploited to permute the pixels of color components. In diffusion process, a novel encryption algorithm, folding algorithm, is proposed to modify the value of diffused pixels. In order to get the high randomness and complexity, the two-dimensional logistic map and quantum chaotic map are coupled with nearest-neighboring coupled-map lattices. Theoretical analyses and computer simulations confirm that the proposed algorithm has high level of security.

Quantification and Statistical Analysis Methods for Vessel Wall Components from Stained Images with Masson's Trichrome

PubMed Central

Hernández-Morera, Pablo; Castaño-González, Irene; Travieso-González, Carlos M.; Mompeó-Corredera, Blanca; Ortega-Santana, Francisco

2016-01-01

Purpose To develop a digital image processing method to quantify structural components (smooth muscle fibers and extracellular matrix) in the vessel wall stained with Masson’s trichrome, and a statistical method suitable for small sample sizes to analyze the results previously obtained. Methods The quantification method comprises two stages. The pre-processing stage improves tissue image appearance and the vessel wall area is delimited. In the feature extraction stage, the vessel wall components are segmented by grouping pixels with a similar color. The area of each component is calculated by normalizing the number of pixels of each group by the vessel wall area. Statistical analyses are implemented by permutation tests, based on resampling without replacement from the set of the observed data to obtain a sampling distribution of an estimator. The implementation can be parallelized on a multicore machine to reduce execution time. Results The methods have been tested on 48 vessel wall samples of the internal saphenous vein stained with Masson’s trichrome. The results show that the segmented areas are consistent with the perception of a team of doctors and demonstrate good correlation between the expert judgments and the measured parameters for evaluating vessel wall changes. Conclusion The proposed methodology offers a powerful tool to quantify some components of the vessel wall. It is more objective, sensitive and accurate than the biochemical and qualitative methods traditionally used. The permutation tests are suitable statistical techniques to analyze the numerical measurements obtained when the underlying assumptions of the other statistical techniques are not met. PMID:26761643

Comparison of a non-stationary voxelation-corrected cluster-size test with TFCE for group-Level MRI inference.

PubMed

Li, Huanjie; Nickerson, Lisa D; Nichols, Thomas E; Gao, Jia-Hong

2017-03-01

Two powerful methods for statistical inference on MRI brain images have been proposed recently, a non-stationary voxelation-corrected cluster-size test (CST) based on random field theory and threshold-free cluster enhancement (TFCE) based on calculating the level of local support for a cluster, then using permutation testing for inference. Unlike other statistical approaches, these two methods do not rest on the assumptions of a uniform and high degree of spatial smoothness of the statistic image. Thus, they are strongly recommended for group-level fMRI analysis compared to other statistical methods. In this work, the non-stationary voxelation-corrected CST and TFCE methods for group-level analysis were evaluated for both stationary and non-stationary images under varying smoothness levels, degrees of freedom and signal to noise ratios. Our results suggest that, both methods provide adequate control for the number of voxel-wise statistical tests being performed during inference on fMRI data and they are both superior to current CSTs implemented in popular MRI data analysis software packages. However, TFCE is more sensitive and stable for group-level analysis of VBM data. Thus, the voxelation-corrected CST approach may confer some advantages by being computationally less demanding for fMRI data analysis than TFCE with permutation testing and by also being applicable for single-subject fMRI analyses, while the TFCE approach is advantageous for VBM data. Hum Brain Mapp 38:1269-1280, 2017. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Report on the Observation of Binaries in 2013: Humacao University Observatory

NASA Astrophysics Data System (ADS)

Cotto, D.; Muller, R.; Cersosimo, J.; Rodriguez, R.; Diaz, M.; Rosario, M.; Nieves, Y.; Franco, E.; Lopez, A.; Torres, B.; Vergara, N.; Rodriguez-del Valle, Y.; Espinosa, G.; Reyes, M.; Martinez, J.

2017-07-01

This is a report on observations of position angle and separation of binary stars of the year 2013 from the Humacao University Observatory. The stars analyzed totaled 62; they were imaged at the NURO 31 inch telescope in Flagstaff, Arizona in June 2013. The images were analyzed at the Humacao Observatory of the University of Puerto Rico.

High-speed 3D imaging using digital binary defocusing method vs sinusoidal method

NASA Astrophysics Data System (ADS)

Zhang, Song; Hyun, Jae-Sang; Li, Beiwen

2017-02-01

This paper presents our research findings on high-speed 3D imaging using digital light processing (DLP) technologies. In particular, we compare two different sinusoidal fringe generation techniques using the DLP projection devices: direct projection of 8-bit computer generated sinusoidal patterns (a.k.a, the sinusoidal method), and the creation of sinusoidal patterns by defocusing binary patterns (a.k.a., the binary defocusing method). This paper mainly examines their performance on high-accuracy measurement applications under precisely controlled settings. Two different projection systems were tested in this study: the commercially available inexpensive projector, and the DLP development kit. Experimental results demonstrated that the binary defocusing method always outperforms the sinusoidal method if a sufficient number of phase-shifted fringe patterns can be used.

Determining distinct circuit in complete graphs using permutation

NASA Astrophysics Data System (ADS)

Karim, Sharmila; Ibrahim, Haslinda; Darus, Maizon Mohd

2017-11-01

A Half Butterfly Method (HBM) is a method introduced to construct the distinct circuits in complete graphs where used the concept of isomorphism. The Half Butterfly Method was applied in the field of combinatorics such as in listing permutations of n elements. However the method of determining distinct circuit using HBM for n > 4 is become tedious. Thus, in this paper, we present the method of generating distinct circuit using permutation.

A Versatile Platform for Nanotechnology Based on Circular Permutation of a Chaperonin Protein

NASA Technical Reports Server (NTRS)

Paavola, Chad; McMillan, Andrew; Trent, Jonathan; Chan, Suzanne; Mazzarella, Kellen; Li, Yi-Fen

2004-01-01

A number of protein complexes have been developed as nanoscale templates. These templates can be functionalized using the peptide sequences that bind inorganic materials. However, it is difficult to integrate peptides into a specific position within a protein template. Integrating intact proteins with desirable binding or catalytic activities is an even greater challenge. We present a general method for modifying protein templates using circular permutation so that additional peptide sequence can be added in a wide variety of specific locations. Circular permutation is a reordering of the polypeptide chain such that the original termini are joined and new termini are created elsewhere in the protein. New sequence can be joined to the protein termini without perturbing the protein structure and with minimal limitation on the size and conformation of the added sequence. We have used this approach to modify a chaperonin protein template, placing termini at five different locations distributed across the surface of the protein complex. These permutants are competent to form the double-ring structures typical of chaperonin proteins. The permuted double-rings also form the same assemblies as the unmodified protein. We fused a fluorescent protein to two representative permutants and demonstrated that it assumes its active structure and does not interfere with assembly of chaperonin double-rings.

Imaging Stellar Surface with The CHARA Array

NASA Astrophysics Data System (ADS)

Schaefer, Gail

2018-04-01

I will provide an overview of results on imaging stellar surfaces with the CHARA Array. These include imaging gravity darkening on rapid rotators, starspots on magnetically active stars, convective cells on red supergiants, and stellar winds from massive stars. In binary systems, the CHARA Array has been used to observe tidal distortions from Roche lobe filling in interactive binaries, transiting companions as they move through eclipse, and the angular expansion of novae explosions. I will discuss the impact of these results in an astrophysical context.

Global Binary Continuity for Color Face Detection With Complex Background

NASA Astrophysics Data System (ADS)

Belavadi, Bhaskar; Mahendra Prashanth, K. V.; Joshi, Sujay S.; Suprathik, N.

2017-08-01

In this paper, we propose a method to detect human faces in color images, with complex background. The proposed algorithm makes use of basically two color space models, specifically HSV and YCgCr. The color segmented image is filled uniformly with a single color (binary) and then all unwanted discontinuous lines are removed to get the final image. Experimental results on Caltech database manifests that the purported model is able to accomplish far better segmentation for faces of varying orientations, skin color and background environment.

An empirical study using permutation-based resampling in meta-regression

PubMed Central

2012-01-01

Background In meta-regression, as the number of trials in the analyses decreases, the risk of false positives or false negatives increases. This is partly due to the assumption of normality that may not hold in small samples. Creation of a distribution from the observed trials using permutation methods to calculate P values may allow for less spurious findings. Permutation has not been empirically tested in meta-regression. The objective of this study was to perform an empirical investigation to explore the differences in results for meta-analyses on a small number of trials using standard large sample approaches verses permutation-based methods for meta-regression. Methods We isolated a sample of randomized controlled clinical trials (RCTs) for interventions that have a small number of trials (herbal medicine trials). Trials were then grouped by herbal species and condition and assessed for methodological quality using the Jadad scale, and data were extracted for each outcome. Finally, we performed meta-analyses on the primary outcome of each group of trials and meta-regression for methodological quality subgroups within each meta-analysis. We used large sample methods and permutation methods in our meta-regression modeling. We then compared final models and final P values between methods. Results We collected 110 trials across 5 intervention/outcome pairings and 5 to 10 trials per covariate. When applying large sample methods and permutation-based methods in our backwards stepwise regression the covariates in the final models were identical in all cases. The P values for the covariates in the final model were larger in 78% (7/9) of the cases for permutation and identical for 22% (2/9) of the cases. Conclusions We present empirical evidence that permutation-based resampling may not change final models when using backwards stepwise regression, but may increase P values in meta-regression of multiple covariates for relatively small amount of trials. PMID:22587815

Rank score and permutation testing alternatives for regression quantile estimates

USGS Publications Warehouse

Cade, B.S.; Richards, J.D.; Mielke, P.W.

2006-01-01

Performance of quantile rank score tests used for hypothesis testing and constructing confidence intervals for linear quantile regression estimates (0 ≤ τ ≤ 1) were evaluated by simulation for models with p = 2 and 6 predictors, moderate collinearity among predictors, homogeneous and hetero-geneous errors, small to moderate samples (n = 20–300), and central to upper quantiles (0.50–0.99). Test statistics evaluated were the conventional quantile rank score T statistic distributed as χ2 random variable with q degrees of freedom (where q parameters are constrained by H 0:) and an F statistic with its sampling distribution approximated by permutation. The permutation F-test maintained better Type I errors than the T-test for homogeneous error models with smaller n and more extreme quantiles τ. An F distributional approximation of the F statistic provided some improvements in Type I errors over the T-test for models with > 2 parameters, smaller n, and more extreme quantiles but not as much improvement as the permutation approximation. Both rank score tests required weighting to maintain correct Type I errors when heterogeneity under the alternative model increased to 5 standard deviations across the domain of X. A double permutation procedure was developed to provide valid Type I errors for the permutation F-test when null models were forced through the origin. Power was similar for conditions where both T- and F-tests maintained correct Type I errors but the F-test provided some power at smaller n and extreme quantiles when the T-test had no power because of excessively conservative Type I errors. When the double permutation scheme was required for the permutation F-test to maintain valid Type I errors, power was less than for the T-test with decreasing sample size and increasing quantiles. Confidence intervals on parameters and tolerance intervals for future predictions were constructed based on test inversion for an example application relating trout densities to stream channel width:depth.

Crystal Structures of the GCaMP Calcium Sensor Reveal the Mechanism of Fluorescence Signal Change and Aid Rational Design

DOE Office of Scientific and Technical Information (OSTI.GOV)

Akerboom, Jasper; Velez Rivera, Jonathan D.; Rodriguez Guilbe, María M.

The genetically encoded calcium indicator GCaMP2 shows promise for neural network activity imaging, but is currently limited by low signal-to-noise ratio. We describe x-ray crystal structures as well as solution biophysical and spectroscopic characterization of GCaMP2 in the calcium-free dark state, and in two calcium-bound bright states: a monomeric form that dominates at intracellular concentrations observed during imaging experiments and an unexpected domain-swapped dimer with decreased fluorescence. This series of structures provides insight into the mechanism of Ca{sup 2+}-induced fluorescence change. Upon calcium binding, the calmodulin (CaM) domain wraps around the M13 peptide, creating a new domain interface between CaMmore » and the circularly permuted enhanced green fluorescent protein domain. Residues from CaM alter the chemical environment of the circularly permuted enhanced green fluorescent protein chromophore and, together with flexible inter-domain linkers, block solvent access to the chromophore. Guided by the crystal structures, we engineered a series of GCaMP2 point mutants to probe the mechanism of GCaMP2 function and characterized one mutant with significantly improved signal-to-noise. The mutation is located at a domain interface and its effect on sensor function could not have been predicted in the absence of structural data.« less

Differential Binary Encoding Method for Calibrating Image Sensors Based on IOFBs

PubMed Central

Fernández, Pedro R.; Lázaro-Galilea, José Luis; Gardel, Alfredo; Espinosa, Felipe; Bravo, Ignacio; Cano, Ángel

2012-01-01

Image transmission using incoherent optical fiber bundles (IOFBs) requires prior calibration to obtain the spatial in-out fiber correspondence necessary to reconstruct the image captured by the pseudo-sensor. This information is recorded in a Look-Up Table called the Reconstruction Table (RT), used later for reordering the fiber positions and reconstructing the original image. This paper presents a very fast method based on image-scanning using spaces encoded by a weighted binary code to obtain the in-out correspondence. The results demonstrate that this technique yields a remarkable reduction in processing time and the image reconstruction quality is very good compared to previous techniques based on spot or line scanning, for example. PMID:22666023

Content based image retrieval using local binary pattern operator and data mining techniques.

PubMed

Vatamanu, Oana Astrid; Frandeş, Mirela; Lungeanu, Diana; Mihalaş, Gheorghe-Ioan

2015-01-01

Content based image retrieval (CBIR) concerns the retrieval of similar images from image databases, using feature vectors extracted from images. These feature vectors globally define the visual content present in an image, defined by e.g., texture, colour, shape, and spatial relations between vectors. Herein, we propose the definition of feature vectors using the Local Binary Pattern (LBP) operator. A study was performed in order to determine the optimum LBP variant for the general definition of image feature vectors. The chosen LBP variant is then subsequently used to build an ultrasound image database, and a database with images obtained from Wireless Capsule Endoscopy. The image indexing process is optimized using data clustering techniques for images belonging to the same class. Finally, the proposed indexing method is compared to the classical indexing technique, which is nowadays widely used.

Classification of skin cancer images using local binary pattern and SVM classifier

NASA Astrophysics Data System (ADS)

Adjed, Faouzi; Faye, Ibrahima; Ababsa, Fakhreddine; Gardezi, Syed Jamal; Dass, Sarat Chandra

2016-11-01

In this paper, a classification method for melanoma and non-melanoma skin cancer images has been presented using the local binary patterns (LBP). The LBP computes the local texture information from the skin cancer images, which is later used to compute some statistical features that have capability to discriminate the melanoma and non-melanoma skin tissues. Support vector machine (SVM) is applied on the feature matrix for classification into two skin image classes (malignant and benign). The method achieves good classification accuracy of 76.1% with sensitivity of 75.6% and specificity of 76.7%.

Converting optical scanning holograms of real objects to binary Fourier holograms using an iterative direct binary search algorithm.

PubMed

Leportier, Thibault; Park, Min Chul; Kim, You Seok; Kim, Taegeun

2015-02-09

In this paper, we present a three-dimensional holographic imaging system. The proposed approach records a complex hologram of a real object using optical scanning holography, converts the complex form to binary data, and then reconstructs the recorded hologram using a spatial light modulator (SLM). The conversion from the recorded hologram to a binary hologram is achieved using a direct binary search algorithm. We present experimental results that verify the efficacy of our approach. To the best of our knowledge, this is the first time that a hologram of a real object has been reconstructed using a binary SLM.

An analog scrambler for speech based on sequential permutations in time and frequency

NASA Astrophysics Data System (ADS)

Cox, R. V.; Jayant, N. S.; McDermott, B. J.

Permutation of speech segments is an operation that is frequently used in the design of scramblers for analog speech privacy. In this paper, a sequential procedure for segment permutation is considered. This procedure can be extended to two dimensional permutation of time segments and frequency bands. By subjective testing it is shown that this combination gives a residual intelligibility for spoken digits of 20 percent with a delay of 256 ms. (A lower bound for this test would be 10 percent). The complexity of implementing such a system is considered and the issues of synchronization and channel equalization are addressed. The computer simulation results for the system using both real and simulated channels are examined.

A 1.375-approximation algorithm for sorting by transpositions.

PubMed

Elias, Isaac; Hartman, Tzvika

2006-01-01

Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a 10-year-old open problem to improve the best known 1.5-approximation algorithm. In this paper, we provide a 1.375-approximation algorithm for sorting by transpositions. The algorithm is based on a new upper bound on the diameter of 3-permutations. In addition, we present some new results regarding the transposition diameter: we improve the lower bound for the transposition diameter of the symmetric group and determine the exact transposition diameter of simple permutations.

Permutational distribution of the log-rank statistic under random censorship with applications to carcinogenicity assays.

PubMed

Heimann, G; Neuhaus, G

1998-03-01

In the random censorship model, the log-rank test is often used for comparing a control group with different dose groups. If the number of tumors is small, so-called exact methods are often applied for computing critical values from a permutational distribution. Two of these exact methods are discussed and shown to be incorrect. The correct permutational distribution is derived and studied with respect to its behavior under unequal censoring in the light of recent results proving that the permutational version and the unconditional version of the log-rank test are asymptotically equivalent even under unequal censoring. The log-rank test is studied by simulations of a realistic scenario from a bioassay with small numbers of tumors.

Spatial and spatiotemporal pattern analysis of coconut lethal yellowing in Mozambique.

PubMed

Bonnot, F; de Franqueville, H; Lourenço, E

2010-04-01

Coconut lethal yellowing (LY) is caused by a phytoplasma and is a major threat for coconut production throughout its growing area. Incidence of LY was monitored visually on every coconut tree in six fields in Mozambique for 34 months. Disease progress curves were plotted and average monthly disease incidence was estimated. Spatial patterns of disease incidence were analyzed at six assessment times. Aggregation was tested by the coefficient of spatial autocorrelation of the beta-binomial distribution of diseased trees in quadrats. The binary power law was used as an assessment of overdispersion across the six fields. Spatial autocorrelation between symptomatic trees was measured by the BB join count statistic based on the number of pairs of diseased trees separated by a specific distance and orientation, and tested using permutation methods. Aggregation of symptomatic trees was detected in every field in both cumulative and new cases. Spatiotemporal patterns were analyzed with two methods. The proximity of symptomatic trees at two assessment times was investigated using the spatiotemporal BB join count statistic based on the number of pairs of trees separated by a specific distance and orientation and exhibiting the first symptoms of LY at the two times. The semivariogram of times of appearance of LY was calculated to characterize how the lag between times of appearance of LY was related to the distance between symptomatic trees. Both statistics were tested using permutation methods. A tendency for new cases to appear in the proximity of previously diseased trees and a spatially structured pattern of times of appearance of LY within clusters of diseased trees were detected, suggesting secondary spread of the disease.

VX Her: Eclipsing Binary System or Single Variable Star

NASA Astrophysics Data System (ADS)

Perry, Kathleen; Castelaz, Michael; Henson, Gary; Boghozian, Andrew

2015-01-01

VX Her is a pulsating variable star with a period of .4556504 days. It is believed to be part of an eclipsing binary system (Fitch et al. 1966). This hypothesis originated from Fitch seeing VX Her's minimum point on its light curve reaching a 0.7 magnitude fainter than normal and remaining that way for nearly two hours. If VX Her were indeed a binary system, I would expect to see similar results with a fainter minimum and a broader, more horizontal dip. Having reduced and analyzed images from the Southeastern Association for Research in Astronomy Observatory in Chile and Kitt Peak, as well as images from a 0.15m reflector at East Tennessee State University, I found that VX Her has the standard light curve of the prototype variable star, RR Lyrae. Using photometry, I found no differing features in its light curve to suggest that it is indeed a binary system. However, more observations are needed in case VX Her is a wide binary.

Multiclass Reduced-Set Support Vector Machines

NASA Technical Reports Server (NTRS)

Tang, Benyang; Mazzoni, Dominic

2006-01-01

There are well-established methods for reducing the number of support vectors in a trained binary support vector machine, often with minimal impact on accuracy. We show how reduced-set methods can be applied to multiclass SVMs made up of several binary SVMs, with significantly better results than reducing each binary SVM independently. Our approach is based on Burges' approach that constructs each reduced-set vector as the pre-image of a vector in kernel space, but we extend this by recomputing the SVM weights and bias optimally using the original SVM objective function. This leads to greater accuracy for a binary reduced-set SVM, and also allows vectors to be 'shared' between multiple binary SVMs for greater multiclass accuracy with fewer reduced-set vectors. We also propose computing pre-images using differential evolution, which we have found to be more robust than gradient descent alone. We show experimental results on a variety of problems and find that this new approach is consistently better than previous multiclass reduced-set methods, sometimes with a dramatic difference.

Encoding plaintext by Fourier transform hologram in double random phase encoding using fingerprint keys

NASA Astrophysics Data System (ADS)

Takeda, Masafumi; Nakano, Kazuya; Suzuki, Hiroyuki; Yamaguchi, Masahiro

2012-09-01

It has been shown that biometric information can be used as a cipher key for binary data encryption by applying double random phase encoding. In such methods, binary data are encoded in a bit pattern image, and the decrypted image becomes a plain image when the key is genuine; otherwise, decrypted images become random images. In some cases, images decrypted by imposters may not be fully random, such that the blurred bit pattern can be partially observed. In this paper, we propose a novel bit coding method based on a Fourier transform hologram, which makes images decrypted by imposters more random. Computer experiments confirm that the method increases the randomness of images decrypted by imposters while keeping the false rejection rate as low as in the conventional method.

An Astrometric Observation of Binary Star System WDS 15559-0210 at the Great Basin Observatory

NASA Astrophysics Data System (ADS)

Musegades, Lila; Niebuhr, Cole; Graham, Mackenzie; Poore, Andrew; Freed, Rachel; Kenney, John; Genet, Russell

2018-04-01

Researchers at Concordia University Irvine measured the position angle and separation of the double star system WDS 15559-0210 using a SBIG STX-16803 CCD camera on the PlaneWave 0.7-m CDK 700 telescope at the Great Basin Observatory. Images of the binary star system were measured using AstroImageJ software. Twenty observations of WDS 15559-0210 were measured and analyzed. The calculated mean resulted in a position angle of 345.95° and a separation of 5.94". These measurements were consistent with the previous values for this binary system listed in the Washington Double Star Catalog.

A Computationally Efficient Hypothesis Testing Method for Epistasis Analysis using Multifactor Dimensionality Reduction

PubMed Central

Pattin, Kristine A.; White, Bill C.; Barney, Nate; Gui, Jiang; Nelson, Heather H.; Kelsey, Karl R.; Andrew, Angeline S.; Karagas, Margaret R.; Moore, Jason H.

2008-01-01

Multifactor dimensionality reduction (MDR) was developed as a nonparametric and model-free data mining method for detecting, characterizing, and interpreting epistasis in the absence of significant main effects in genetic and epidemiologic studies of complex traits such as disease susceptibility. The goal of MDR is to change the representation of the data using a constructive induction algorithm to make nonadditive interactions easier to detect using any classification method such as naïve Bayes or logistic regression. Traditionally, MDR constructed variables have been evaluated with a naïve Bayes classifier that is combined with 10-fold cross validation to obtain an estimate of predictive accuracy or generalizability of epistasis models. Traditionally, we have used permutation testing to statistically evaluate the significance of models obtained through MDR. The advantage of permutation testing is that it controls for false-positives due to multiple testing. The disadvantage is that permutation testing is computationally expensive. This is in an important issue that arises in the context of detecting epistasis on a genome-wide scale. The goal of the present study was to develop and evaluate several alternatives to large-scale permutation testing for assessing the statistical significance of MDR models. Using data simulated from 70 different epistasis models, we compared the power and type I error rate of MDR using a 1000-fold permutation test with hypothesis testing using an extreme value distribution (EVD). We find that this new hypothesis testing method provides a reasonable alternative to the computationally expensive 1000-fold permutation test and is 50 times faster. We then demonstrate this new method by applying it to a genetic epidemiology study of bladder cancer susceptibility that was previously analyzed using MDR and assessed using a 1000-fold permutation test. PMID:18671250

Estrogen pathway polymorphisms in relation to primary open angle glaucoma: An analysis accounting for gender from the United States

PubMed Central

Loomis, Stephanie J.; Weinreb, Robert N.; Kang, Jae H.; Yaspan, Brian L.; Bailey, Jessica Cooke; Gaasterland, Douglas; Gaasterland, Terry; Lee, Richard K.; Scott, William K.; Lichter, Paul R.; Budenz, Donald L.; Liu, Yutao; Realini, Tony; Friedman, David S.; McCarty, Catherine A.; Moroi, Sayoko E.; Olson, Lana; Schuman, Joel S.; Singh, Kuldev; Vollrath, Douglas; Wollstein, Gadi; Zack, Donald J.; Brilliant, Murray; Sit, Arthur J.; Christen, William G.; Fingert, John; Kraft, Peter; Zhang, Kang; Allingham, R. Rand; Pericak-Vance, Margaret A.; Richards, Julia E.; Hauser, Michael A.; Haines, Jonathan L.; Wiggs, Janey L.

2013-01-01

Purpose Circulating estrogen levels are relevant in glaucoma phenotypic traits. We assessed the association between an estrogen metabolism single nucleotide polymorphism (SNP) panel in relation to primary open angle glaucoma (POAG), accounting for gender. Methods We included 3,108 POAG cases and 3,430 controls of both genders from the Glaucoma Genes and Environment (GLAUGEN) study and the National Eye Institute Glaucoma Human Genetics Collaboration (NEIGHBOR) consortium genotyped on the Illumina 660W-Quad platform. We assessed the relation between the SNP panels representative of estrogen metabolism and POAG using pathway- and gene-based approaches with the Pathway Analysis by Randomization Incorporating Structure (PARIS) software. PARIS executes a permutation algorithm to assess statistical significance relative to the pathways and genes of comparable genetic architecture. These analyses were performed using the meta-analyzed results from the GLAUGEN and NEIGHBOR data sets. We evaluated POAG overall as well as two subtypes of POAG defined as intraocular pressure (IOP) ≥22 mmHg (high-pressure glaucoma [HPG]) or IOP <22 mmHg (normal pressure glaucoma [NPG]) at diagnosis. We conducted these analyses for each gender separately and then jointly in men and women. Results Among women, the estrogen SNP pathway was associated with POAG overall (permuted p=0.006) and HPG (permuted p<0.001) but not NPG (permuted p=0.09). Interestingly, there was no relation between the estrogen SNP pathway and POAG when men were considered alone (permuted p>0.99). Among women, gene-based analyses revealed that the catechol-O-methyltransferase gene showed strong associations with HTG (permuted gene p≤0.001) and NPG (permuted gene p=0.01). Conclusions The estrogen SNP pathway was associated with POAG among women. PMID:23869166

Investigating the binary nature of active asteroid 288P/300163

NASA Astrophysics Data System (ADS)

Agarwal, Jessica

2016-10-01

We propose to study the suspected binary nature of active asteroid 288P/300163. We aim to confirm or disprove the existence of a binary nucleus, and - if confirmed - to measure the mutual orbital period and orbit orientation of the compoents, and their sizes. We request 5 orbits of WFC3 imaging, spaced at intervals of 8-12 days. 288P belongs to the recently discovered group of active asteroids, and is particularly remarkable as HST images obtained during its last close approach to Earth in 2011 are consistent with a barely resolved binary system. If confirmed, 288P would be the first known active binary asteroid. For the first time, we would see two important consequences of rotational break-up in a single object: binary formation and dust ejection, highlighting the importance of the YORP-effect in re-shaping the asteroid belt. Confirming 288P as a binary would be a key step towards understanding the evolutionary processes underlying asteroid activity. In order to resolve the two components we need 288P at a geocentric distance comparable to or less than we had in 2011 December (1.85 AU). This condition will be fulfilled for the first time since 2011, between mid-July and mid-November of 2016. The next opportunity to carry out such observations will be in 2021.

Error-free holographic frames encryption with CA pixel-permutation encoding algorithm

NASA Astrophysics Data System (ADS)

Li, Xiaowei; Xiao, Dan; Wang, Qiong-Hua

2018-01-01

The security of video data is necessary in network security transmission hence cryptography is technique to make video data secure and unreadable to unauthorized users. In this paper, we propose a holographic frames encryption technique based on the cellular automata (CA) pixel-permutation encoding algorithm. The concise pixel-permutation algorithm is used to address the drawbacks of the traditional CA encoding methods. The effectiveness of the proposed video encoding method is demonstrated by simulation examples.

A Flexible Computational Framework Using R and Map-Reduce for Permutation Tests of Massive Genetic Analysis of Complex Traits.

PubMed

Mahjani, Behrang; Toor, Salman; Nettelblad, Carl; Holmgren, Sverker

2017-01-01

In quantitative trait locus (QTL) mapping significance of putative QTL is often determined using permutation testing. The computational needs to calculate the significance level are immense, 10 4 up to 10 8 or even more permutations can be needed. We have previously introduced the PruneDIRECT algorithm for multiple QTL scan with epistatic interactions. This algorithm has specific strengths for permutation testing. Here, we present a flexible, parallel computing framework for identifying multiple interacting QTL using the PruneDIRECT algorithm which uses the map-reduce model as implemented in Hadoop. The framework is implemented in R, a widely used software tool among geneticists. This enables users to rearrange algorithmic steps to adapt genetic models, search algorithms, and parallelization steps to their needs in a flexible way. Our work underlines the maturity of accessing distributed parallel computing for computationally demanding bioinformatics applications through building workflows within existing scientific environments. We investigate the PruneDIRECT algorithm, comparing its performance to exhaustive search and DIRECT algorithm using our framework on a public cloud resource. We find that PruneDIRECT is vastly superior for permutation testing, and perform 2 ×10 5 permutations for a 2D QTL problem in 15 hours, using 100 cloud processes. We show that our framework scales out almost linearly for a 3D QTL search.

Image encryption using random sequence generated from generalized information domain

NASA Astrophysics Data System (ADS)

Xia-Yan, Zhang; Guo-Ji, Zhang; Xuan, Li; Ya-Zhou, Ren; Jie-Hua, Wu

2016-05-01

A novel image encryption method based on the random sequence generated from the generalized information domain and permutation-diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.

Analysis of objects in binary images. M.S. Thesis - Old Dominion Univ.

NASA Technical Reports Server (NTRS)

Leonard, Desiree M.

1991-01-01

Digital image processing techniques are typically used to produce improved digital images through the application of successive enhancement techniques to a given image or to generate quantitative data about the objects within that image. In support of and to assist researchers in a wide range of disciplines, e.g., interferometry, heavy rain effects on aerodynamics, and structure recognition research, it is often desirable to count objects in an image and compute their geometric properties. Therefore, an image analysis application package, focusing on a subset of image analysis techniques used for object recognition in binary images, was developed. This report describes the techniques and algorithms utilized in three main phases of the application and are categorized as: image segmentation, object recognition, and quantitative analysis. Appendices provide supplemental formulas for the algorithms employed as well as examples and results from the various image segmentation techniques and the object recognition algorithm implemented.

Hyperspectral image classification based on local binary patterns and PCANet

NASA Astrophysics Data System (ADS)

Yang, Huizhen; Gao, Feng; Dong, Junyu; Yang, Yang

2018-04-01

Hyperspectral image classification has been well acknowledged as one of the challenging tasks of hyperspectral data processing. In this paper, we propose a novel hyperspectral image classification framework based on local binary pattern (LBP) features and PCANet. In the proposed method, linear prediction error (LPE) is first employed to select a subset of informative bands, and LBP is utilized to extract texture features. Then, spectral and texture features are stacked into a high dimensional vectors. Next, the extracted features of a specified position are transformed to a 2-D image. The obtained images of all pixels are fed into PCANet for classification. Experimental results on real hyperspectral dataset demonstrate the effectiveness of the proposed method.

Photographs and Committees: Activities That Help Students Discover Permutations and Combinations.

ERIC Educational Resources Information Center

Szydlik, Jennifer Earles

2000-01-01

Presents problem situations that support students when discovering the multiplication principle, permutations, combinations, Pascal's triangle, and relationships among those objects in a concrete context. (ASK)

Automated characterisation of ultrasound images of ovarian tumours: the diagnostic accuracy of a support vector machine and image processing with a local binary pattern operator.

PubMed

Khazendar, S; Sayasneh, A; Al-Assam, H; Du, H; Kaijser, J; Ferrara, L; Timmerman, D; Jassim, S; Bourne, T

2015-01-01

Preoperative characterisation of ovarian masses into benign or malignant is of paramount importance to optimise patient management. In this study, we developed and validated a computerised model to characterise ovarian masses as benign or malignant. Transvaginal 2D B mode static ultrasound images of 187 ovarian masses with known histological diagnosis were included. Images were first pre-processed and enhanced, and Local Binary Pattern Histograms were then extracted from 2 × 2 blocks of each image. A Support Vector Machine (SVM) was trained using stratified cross validation with randomised sampling. The process was repeated 15 times and in each round 100 images were randomly selected. The SVM classified the original non-treated static images as benign or malignant masses with an average accuracy of 0.62 (95% CI: 0.59-0.65). This performance significantly improved to an average accuracy of 0.77 (95% CI: 0.75-0.79) when images were pre-processed, enhanced and treated with a Local Binary Pattern operator (mean difference 0.15: 95% 0.11-0.19, p < 0.0001, two-tailed t test). We have shown that an SVM can classify static 2D B mode ultrasound images of ovarian masses into benign and malignant categories. The accuracy improves if texture related LBP features extracted from the images are considered.

A permutation characterization of Sturm global attractors of Hamiltonian type

NASA Astrophysics Data System (ADS)

Fiedler, Bernold; Rocha, Carlos; Wolfrum, Matthias

We consider Neumann boundary value problems of the form u=u+f on the interval 0⩽x⩽π for dissipative nonlinearities f=f(u). A permutation characterization for the global attractors of the semiflows generated by these equations is well known, even in the much more general case f=f(x,u,u). We present a permutation characterization for the global attractors in the restrictive class of nonlinearities f=f(u). In this class the stationary solutions of the parabolic equation satisfy the second order ODE v+f(v)=0 and we obtain the permutation characterization from a characterization of the set of 2 π-periodic orbits of this planar Hamiltonian system. Our results are based on a diligent discussion of this mere pendulum equation.

Creation of an anti-imaging system using binary optics.

PubMed

Wang, Haifeng; Lin, Jian; Zhang, Dawei; Wang, Yang; Gu, Min; Urbach, H P; Gan, Fuxi; Zhuang, Songlin

2016-09-13

We present a concealing method in which an anti-point spread function (APSF) is generated using binary optics, which produces a large-scale dark area in the focal region that can hide any object located within it. This result is achieved by generating two identical PSFs of opposite signs, one consisting of positive electromagnetic waves from the zero-phase region of the binary optical element and the other consisting of negative electromagnetic waves from the pi-phase region of the binary optical element.

Creation of an anti-imaging system using binary optics

PubMed Central

Wang, Haifeng; Lin, Jian; Zhang, Dawei; Wang, Yang; Gu, Min; Urbach, H. P.; Gan, Fuxi; Zhuang, Songlin

2016-01-01

We present a concealing method in which an anti-point spread function (APSF) is generated using binary optics, which produces a large-scale dark area in the focal region that can hide any object located within it. This result is achieved by generating two identical PSFs of opposite signs, one consisting of positive electromagnetic waves from the zero-phase region of the binary optical element and the other consisting of negative electromagnetic waves from the pi-phase region of the binary optical element. PMID:27620068

Clustering and Dimensionality Reduction to Discover Interesting Patterns in Binary Data

NASA Astrophysics Data System (ADS)

Palumbo, Francesco; D'Enza, Alfonso Iodice

The attention towards binary data coding increased consistently in the last decade due to several reasons. The analysis of binary data characterizes several fields of application, such as market basket analysis, DNA microarray data, image mining, text mining and web-clickstream mining. The paper illustrates two different approaches exploiting a profitable combination of clustering and dimensionality reduction for the identification of non-trivial association structures in binary data. An application in the Association Rules framework supports the theory with the empirical evidence.

Processing Of Binary Images

NASA Astrophysics Data System (ADS)

Hou, H. S.

1985-07-01

An overview of the recent progress in the area of digital processing of binary images in the context of document processing is presented here. The topics covered include input scan, adaptive thresholding, halftoning, scaling and resolution conversion, data compression, character recognition, electronic mail, digital typography, and output scan. Emphasis has been placed on illustrating the basic principles rather than descriptions of a particular system. Recent technology advances and research in this field are also mentioned.

Binary Cepheids: Separations and Mass Ratios in 5 Solar Mass Binaries

DTIC Science & Technology

2013-10-01

astrometry, photometry , direct imaging), each with selection biases. However, Cepheids—cool, evolved stars of∼5M—are a special case because ultraviolet...detected velocity variability. In an imaging survey with the Hubble Space Telescope Wide Field Camera 3, we resolved three of the companions (those...1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and

Binary Disassembly Block Coverage by Symbolic Execution vs. Recursive Descent

DTIC Science & Technology

2012-03-01

explores the effectiveness of symbolic execution on packed or obfuscated samples of the same binaries to generate a model-based evaluation of success...24 2.3.4.1 Packing . . . . . . . . . . . . . . . . . . . . . . . . . . 25 2.3.4.2 Techniques...inner workings of UPX (Universal Packer for eXecutables), a common packing tool, on a Windows binary. Image source: GFC08 . . . . . . . . . . . 25 3.1

Fast large-scale object retrieval with binary quantization

NASA Astrophysics Data System (ADS)

Zhou, Shifu; Zeng, Dan; Shen, Wei; Zhang, Zhijiang; Tian, Qi

2015-11-01

The objective of large-scale object retrieval systems is to search for images that contain the target object in an image database. Where state-of-the-art approaches rely on global image representations to conduct searches, we consider many boxes per image as candidates to search locally in a picture. In this paper, a feature quantization algorithm called binary quantization is proposed. In binary quantization, a scale-invariant feature transform (SIFT) feature is quantized into a descriptive and discriminative bit-vector, which allows itself to adapt to the classic inverted file structure for box indexing. The inverted file, which stores the bit-vector and box ID where the SIFT feature is located inside, is compact and can be loaded into the main memory for efficient box indexing. We evaluate our approach on available object retrieval datasets. Experimental results demonstrate that the proposed approach is fast and achieves excellent search quality. Therefore, the proposed approach is an improvement over state-of-the-art approaches for object retrieval.

Interferometric space-mode multiplexing based on binary phase plates and refractive phase shifters.

PubMed

Liñares, Jesús; Prieto-Blanco, Xesús; Moreno, Vicente; Montero-Orille, Carlos; Mouriz, Dolores; Nistal, María C; Barral, David

2017-05-15

A Mach-Zehnder interferometer (MZI) that includes in an arm either a reflective image inverter or a Gouy phase shifter (RGPS) can (de)multiplex many types of modes of a few mode fiber without fundamental loss. The use of RGPSs in combination with binary phase plates for multiplexing purposes is studied for the first time, showing that the particular RGPS that shifts π the odd modes only multiplexes accurately low order modes. To overcome such a restriction, we present a new exact refractive image inverter, more compact and flexible than its reflective counterpart. Moreover, we show that these interferometers remove or reduce the crosstalk that the binary phase plates could introduce between the multiplexed modes. Finally, an experimental analysis of a MZI with both an approximated and an exact refractive image inverter is presented for the case of a bimodal multiplexing. Likewise, it is proven experimentally that a RGPS that shifts π/2 demultiplexes two odd modes which can not be achieved by any image inverter.

PBOOST: a GPU-based tool for parallel permutation tests in genome-wide association studies.

PubMed

Yang, Guangyuan; Jiang, Wei; Yang, Qiang; Yu, Weichuan

2015-05-01

The importance of testing associations allowing for interactions has been demonstrated by Marchini et al. (2005). A fast method detecting associations allowing for interactions has been proposed by Wan et al. (2010a). The method is based on likelihood ratio test with the assumption that the statistic follows the χ(2) distribution. Many single nucleotide polymorphism (SNP) pairs with significant associations allowing for interactions have been detected using their method. However, the assumption of χ(2) test requires the expected values in each cell of the contingency table to be at least five. This assumption is violated in some identified SNP pairs. In this case, likelihood ratio test may not be applicable any more. Permutation test is an ideal approach to checking the P-values calculated in likelihood ratio test because of its non-parametric nature. The P-values of SNP pairs having significant associations with disease are always extremely small. Thus, we need a huge number of permutations to achieve correspondingly high resolution for the P-values. In order to investigate whether the P-values from likelihood ratio tests are reliable, a fast permutation tool to accomplish large number of permutations is desirable. We developed a permutation tool named PBOOST. It is based on GPU with highly reliable P-value estimation. By using simulation data, we found that the P-values from likelihood ratio tests will have relative error of >100% when 50% cells in the contingency table have expected count less than five or when there is zero expected count in any of the contingency table cells. In terms of speed, PBOOST completed 10(7) permutations for a single SNP pair from the Wellcome Trust Case Control Consortium (WTCCC) genome data (Wellcome Trust Case Control Consortium, 2007) within 1 min on a single Nvidia Tesla M2090 device, while it took 60 min in a single CPU Intel Xeon E5-2650 to finish the same task. More importantly, when simultaneously testing 256 SNP pairs for 10(7) permutations, our tool took only 5 min, while the CPU program took 10 h. By permuting on a GPU cluster consisting of 40 nodes, we completed 10(12) permutations for all 280 SNP pairs reported with P-values smaller than 1.6 × 10⁻¹² in the WTCCC datasets in 1 week. The source code and sample data are available at http://bioinformatics.ust.hk/PBOOST.zip. gyang@ust.hk; eeyu@ust.hk Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Engineering calculations for solving the orbital allotment problem

NASA Technical Reports Server (NTRS)

Reilly, C.; Walton, E. K.; Mount-Campbell, C.; Caldecott, R.; Aebker, E.; Mata, F.

1988-01-01

Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.

New Finger Biometric Method Using Near Infrared Imaging

PubMed Central

Lee, Eui Chul; Jung, Hyunwoo; Kim, Daeyeoul

2011-01-01

In this paper, we propose a new finger biometric method. Infrared finger images are first captured, and then feature extraction is performed using a modified Gaussian high-pass filter through binarization, local binary pattern (LBP), and local derivative pattern (LDP) methods. Infrared finger images include the multimodal features of finger veins and finger geometries. Instead of extracting each feature using different methods, the modified Gaussian high-pass filter is fully convolved. Therefore, the extracted binary patterns of finger images include the multimodal features of veins and finger geometries. Experimental results show that the proposed method has an error rate of 0.13%. PMID:22163741

Finding False Positives Planet Candidates Due To Background Eclipsing Binaries in K2

NASA Astrophysics Data System (ADS)

Mullally, Fergal; Thompson, Susan E.; Coughlin, Jeffrey; DAVE Team

2016-06-01

We adapt the difference image centroid approach, used for finding background eclipsing binaries, to vet K2 planet candidates. Difference image centroids were used with great success to vet planet candidates in the original Kepler mission, where the source of a transit could be identified by subtracting images of out-of-transit cadences from in-transit cadences. To account for K2's roll pattern, we reconstruct out-of-transit images from cadences that are nearby in both time and spacecraft roll angle. We describe the method and discuss some K2 planet candidates which this method suggests are false positives.

Diagrammatic technique for calculating matrix elements of collective operators in superradiance. [eigenstates for N two-level atom systems

NASA Technical Reports Server (NTRS)

Lee, C. T.

1975-01-01

Adopting the so-called genealogical construction, one can express the eigenstates of collective operators corresponding to a specified mode for an N-atom system in terms of those for an (N-1) atom system. Using these Dicke states as bases and using the Wigner-Eckart theorem, a matrix element of a collective operator of an arbitrary mode can be written as the product of an m-dependent factor and an m-independent reduced matrix element (RME). A set of recursion formulas for the RME is obtained. A graphical representation of the RME on the branching diagram for binary irreducible representations of permutation groups is then introduced. This gives a simple and systematic way of calculating the RME. This method is especially useful when the cooperation number r is close to N/2, where almost exact asymptotic expressions can be obtained easily. The result shows explicity the geometry dependence of superradiance and the relative importance of r-conserving and r-nonconserving processes.

WAVELET-DOMAIN REGRESSION AND PREDICTIVE INFERENCE IN PSYCHIATRIC NEUROIMAGING

PubMed Central

Reiss, Philip T.; Huo, Lan; Zhao, Yihong; Kelly, Clare; Ogden, R. Todd

2016-01-01

An increasingly important goal of psychiatry is the use of brain imaging data to develop predictive models. Here we present two contributions to statistical methodology for this purpose. First, we propose and compare a set of wavelet-domain procedures for fitting generalized linear models with scalar responses and image predictors: sparse variants of principal component regression and of partial least squares, and the elastic net. Second, we consider assessing the contribution of image predictors over and above available scalar predictors, in particular via permutation tests and an extension of the idea of confounding to the case of functional or image predictors. Using the proposed methods, we assess whether maps of a spontaneous brain activity measure, derived from functional magnetic resonance imaging, can meaningfully predict presence or absence of attention deficit/hyperactivity disorder (ADHD). Our results shed light on the role of confounding in the surprising outcome of the recent ADHD-200 Global Competition, which challenged researchers to develop algorithms for automated image-based diagnosis of the disorder. PMID:27330652

A secure image encryption method based on dynamic harmony search (DHS) combined with chaotic map

NASA Astrophysics Data System (ADS)

Mirzaei Talarposhti, Khadijeh; Khaki Jamei, Mehrzad

2016-06-01

In recent years, there has been increasing interest in the security of digital images. This study focuses on the gray scale image encryption using dynamic harmony search (DHS). In this research, first, a chaotic map is used to create cipher images, and then the maximum entropy and minimum correlation coefficient is obtained by applying a harmony search algorithm on them. This process is divided into two steps. In the first step, the diffusion of a plain image using DHS to maximize the entropy as a fitness function will be performed. However, in the second step, a horizontal and vertical permutation will be applied on the best cipher image, which is obtained in the previous step. Additionally, DHS has been used to minimize the correlation coefficient as a fitness function in the second step. The simulation results have shown that by using the proposed method, the maximum entropy and the minimum correlation coefficient, which are approximately 7.9998 and 0.0001, respectively, have been obtained.

Fourier-Mellin moment-based intertwining map for image encryption

NASA Astrophysics Data System (ADS)

Kaur, Manjit; Kumar, Vijay

2018-03-01

In this paper, a robust image encryption technique that utilizes Fourier-Mellin moments and intertwining logistic map is proposed. Fourier-Mellin moment-based intertwining logistic map has been designed to overcome the issue of low sensitivity of an input image. Multi-objective Non-Dominated Sorting Genetic Algorithm (NSGA-II) based on Reinforcement Learning (MNSGA-RL) has been used to optimize the required parameters of intertwining logistic map. Fourier-Mellin moments are used to make the secret keys more secure. Thereafter, permutation and diffusion operations are carried out on input image using secret keys. The performance of proposed image encryption technique has been evaluated on five well-known benchmark images and also compared with seven well-known existing encryption techniques. The experimental results reveal that the proposed technique outperforms others in terms of entropy, correlation analysis, a unified average changing intensity and the number of changing pixel rate. The simulation results reveal that the proposed technique provides high level of security and robustness against various types of attacks.

Fast encryption of RGB color digital images using a tweakable cellular automaton based schema

NASA Astrophysics Data System (ADS)

Faraoun, Kamel Mohamed

2014-12-01

We propose a new tweakable construction of block-enciphers using second-order reversible cellular automata, and we apply it to encipher RGB-colored images. The proposed construction permits a parallel encryption of the image content by extending the standard definition of a block cipher to take into account a supplementary parameter used as a tweak (nonce) to control the behavior of the cipher from one region of the image to the other, and hence avoid the necessity to use slow sequential encryption's operating modes. The proposed construction defines a flexible pseudorandom permutation that can be used with efficacy to solve the electronic code book problem without the need to a specific sequential mode. Obtained results from various experiments show that the proposed schema achieves high security and execution performances, and enables an interesting mode of selective area decryption due to the parallel character of the approach.

A novel image encryption algorithm using chaos and reversible cellular automata

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Luan, Dapeng

2013-11-01

In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.

Cryptanalysis and improvement of an optical image encryption scheme using a chaotic Baker map and double random phase encoding

NASA Astrophysics Data System (ADS)

Chen, Jun-Xin; Zhu, Zhi-Liang; Fu, Chong; Zhang, Li-Bo; Zhang, Yushu

2014-12-01

In this paper, we evaluate the security of an enhanced double random phase encoding (DRPE) image encryption scheme (2013 J. Lightwave Technol. 31 2533). The original system employs a chaotic Baker map prior to DRPE to provide more protection to the plain image and hence promote the security level of DRPE, as claimed. However, cryptanalysis shows that this scheme is vulnerable to a chosen-plaintext attack, and the ciphertext can be precisely recovered. The corresponding improvement is subsequently reported upon the basic premise that no extra equipment or computational complexity is required. The simulation results and security analyses prove its effectiveness and security. The proposed achievements are suitable for all cryptosystems under permutation and, following that, the DRPE architecture, and we hope that our work can motivate the further research on optical image encryption.

Local Multi-Grouped Binary Descriptor With Ring-Based Pooling Configuration and Optimization.

PubMed

Gao, Yongqiang; Huang, Weilin; Qiao, Yu

2015-12-01

Local binary descriptors are attracting increasingly attention due to their great advantages in computational speed, which are able to achieve real-time performance in numerous image/vision applications. Various methods have been proposed to learn data-dependent binary descriptors. However, most existing binary descriptors aim overly at computational simplicity at the expense of significant information loss which causes ambiguity in similarity measure using Hamming distance. In this paper, by considering multiple features might share complementary information, we present a novel local binary descriptor, referred as ring-based multi-grouped descriptor (RMGD), to successfully bridge the performance gap between current binary and floated-point descriptors. Our contributions are twofold. First, we introduce a new pooling configuration based on spatial ring-region sampling, allowing for involving binary tests on the full set of pairwise regions with different shapes, scales, and distances. This leads to a more meaningful description than the existing methods which normally apply a limited set of pooling configurations. Then, an extended Adaboost is proposed for an efficient bit selection by emphasizing high variance and low correlation, achieving a highly compact representation. Second, the RMGD is computed from multiple image properties where binary strings are extracted. We cast multi-grouped features integration as rankSVM or sparse support vector machine learning problem, so that different features can compensate strongly for each other, which is the key to discriminativeness and robustness. The performance of the RMGD was evaluated on a number of publicly available benchmarks, where the RMGD outperforms the state-of-the-art binary descriptors significantly.

Asymmetric distances for binary embeddings.

PubMed

Gordo, Albert; Perronnin, Florent; Gong, Yunchao; Lazebnik, Svetlana

2014-01-01

In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes that binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances that are applicable to a wide variety of embedding techniques including locality sensitive hashing (LSH), locality sensitive binary codes (LSBC), spectral hashing (SH), PCA embedding (PCAE), PCAE with random rotations (PCAE-RR), and PCAE with iterative quantization (PCAE-ITQ). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques.

Detection algorithm for glass bottle mouth defect by continuous wavelet transform based on machine vision

NASA Astrophysics Data System (ADS)

Qian, Jinfang; Zhang, Changjiang

2014-11-01

An efficient algorithm based on continuous wavelet transform combining with pre-knowledge, which can be used to detect the defect of glass bottle mouth, is proposed. Firstly, under the condition of ball integral light source, a perfect glass bottle mouth image is obtained by Japanese Computar camera through the interface of IEEE-1394b. A single threshold method based on gray level histogram is used to obtain the binary image of the glass bottle mouth. In order to efficiently suppress noise, moving average filter is employed to smooth the histogram of original glass bottle mouth image. And then continuous wavelet transform is done to accurately determine the segmentation threshold. Mathematical morphology operations are used to get normal binary bottle mouth mask. A glass bottle to be detected is moving to the detection zone by conveyor belt. Both bottle mouth image and binary image are obtained by above method. The binary image is multiplied with normal bottle mask and a region of interest is got. Four parameters (number of connected regions, coordinate of centroid position, diameter of inner cycle, and area of annular region) can be computed based on the region of interest. Glass bottle mouth detection rules are designed by above four parameters so as to accurately detect and identify the defect conditions of glass bottle. Finally, the glass bottles of Coca-Cola Company are used to verify the proposed algorithm. The experimental results show that the proposed algorithm can accurately detect the defect conditions of the glass bottles and have 98% detecting accuracy.

Visualising interacting binaries in 3D

NASA Astrophysics Data System (ADS)

Hynes, R. I.

2002-01-01

I have developed a code which allows images to be produced of a variety of interacting binaries for any system parameters. The resulting images are not only helpful in visualising the geometry of a given system but are also helpful in talks and educational work. I would like to acknowledge financial support from the Leverhulme Trust, and to thank Dan Rolfe for many discussions on how to represent interacting binaries and the users of BinSim who have provided valuable testing and feedback. BinSim would not have been possible without the efforts of Brian Paul and others responsible for the Mesa 3-D graphics library -- Mesa 3-D graphics .

The analysis of image feature robustness using cometcloud

PubMed Central

Qi, Xin; Kim, Hyunjoo; Xing, Fuyong; Parashar, Manish; Foran, David J.; Yang, Lin

2012-01-01

The robustness of image features is a very important consideration in quantitative image analysis. The objective of this paper is to investigate the robustness of a range of image texture features using hematoxylin stained breast tissue microarray slides which are assessed while simulating different imaging challenges including out of focus, changes in magnification and variations in illumination, noise, compression, distortion, and rotation. We employed five texture analysis methods and tested them while introducing all of the challenges listed above. The texture features that were evaluated include co-occurrence matrix, center-symmetric auto-correlation, texture feature coding method, local binary pattern, and texton. Due to the independence of each transformation and texture descriptor, a network structured combination was proposed and deployed on the Rutgers private cloud. The experiments utilized 20 randomly selected tissue microarray cores. All the combinations of the image transformations and deformations are calculated, and the whole feature extraction procedure was completed in 70 minutes using a cloud equipped with 20 nodes. Center-symmetric auto-correlation outperforms all the other four texture descriptors but also requires the longest computational time. It is roughly 10 times slower than local binary pattern and texton. From a speed perspective, both the local binary pattern and texton features provided excellent performance for classification and content-based image retrieval. PMID:23248759

Permutation invariant polynomial neural network approach to fitting potential energy surfaces. II. Four-atom systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Jun; Jiang, Bin; Guo, Hua, E-mail: hguo@unm.edu

2013-11-28

A rigorous, general, and simple method to fit global and permutation invariant potential energy surfaces (PESs) using neural networks (NNs) is discussed. This so-called permutation invariant polynomial neural network (PIP-NN) method imposes permutation symmetry by using in its input a set of symmetry functions based on PIPs. For systems with more than three atoms, it is shown that the number of symmetry functions in the input vector needs to be larger than the number of internal coordinates in order to include both the primary and secondary invariant polynomials. This PIP-NN method is successfully demonstrated in three atom-triatomic reactive systems, resultingmore » in full-dimensional global PESs with average errors on the order of meV. These PESs are used in full-dimensional quantum dynamical calculations.« less

Searching for Binary Systems Among Nearby Dwarfs Based on Pulkovo Observations and SDSS Data

NASA Astrophysics Data System (ADS)

Khovrichev, M. Yu.; Apetyan, A. A.; Roshchina, E. A.; Izmailov, I. S.; Bikulova, D. A.; Ershova, A. P.; Balyaev, I. A.; Kulikova, A. M.; Petyur, V. V.; Shumilov, A. A.; Os'kina, K. I.; Maksimova, L. A.

2018-02-01

Our goal is to find previously unknown binary systems among low-mass dwarfs in the solar neighborhood and to test the search technique. The basic ideas are to reveal the images of stars with significant ellipticities and/or asymmetries compared to the background stars on CCD frames and to subsequently determine the spatial parameters of the binary system and the magnitude difference between its components. For its realization we have developed a method based on an image shapelet decomposition. All of the comparatively faint stars with large proper motions ( V >13 m , μ > 300 mas yr-1) for which the "duplicate source" flag in the Gaia DR1 catalogue is equal to one have been included in the list of objects for our study. As a result, we have selected 702 stars. To verify our results, we have performed additional observations of 65 stars from this list with the Pulkovo 1-m "Saturn" telescope (2016-2017). We have revealed a total of 138 binary candidates (nine of them from the "Saturn" telescope and SDSS data). Six program stars are known binaries. The images of the primaries of the comparatively wide pairs WDS 14519+5147, WDS 11371+6022, and WDS 15404+2500 are shown to be resolved into components; therefore, we can talk about the detection of triple systems. The angular separation ρ, position angle, and component magnitude difference Δ m have been estimated for almost all of the revealed binary systems. For most stars 1.5'' < ρ < 2.5'', while Δ m <1.5m.

A comparative study for chest radiograph image retrieval using binary texture and deep learning classification.

PubMed

Anavi, Yaron; Kogan, Ilya; Gelbart, Elad; Geva, Ofer; Greenspan, Hayit

2015-08-01

In this work various approaches are investigated for X-ray image retrieval and specifically chest pathology retrieval. Given a query image taken from a data set of 443 images, the objective is to rank images according to similarity. Different features, including binary features, texture features, and deep learning (CNN) features are examined. In addition, two approaches are investigated for the retrieval task. One approach is based on the distance of image descriptors using the above features (hereon termed the "descriptor"-based approach); the second approach ("classification"-based approach) is based on a probability descriptor, generated by a pair-wise classification of each two classes (pathologies) and their decision values using an SVM classifier. Best results are achieved using deep learning features in a classification scheme.

Receptive fields selection for binary feature description.

PubMed

Fan, Bin; Kong, Qingqun; Trzcinski, Tomasz; Wang, Zhiheng; Pan, Chunhong; Fua, Pascal

2014-06-01

Feature description for local image patch is widely used in computer vision. While the conventional way to design local descriptor is based on expert experience and knowledge, learning-based methods for designing local descriptor become more and more popular because of their good performance and data-driven property. This paper proposes a novel data-driven method for designing binary feature descriptor, which we call receptive fields descriptor (RFD). Technically, RFD is constructed by thresholding responses of a set of receptive fields, which are selected from a large number of candidates according to their distinctiveness and correlations in a greedy way. Using two different kinds of receptive fields (namely rectangular pooling area and Gaussian pooling area) for selection, we obtain two binary descriptors RFDR and RFDG .accordingly. Image matching experiments on the well-known patch data set and Oxford data set demonstrate that RFD significantly outperforms the state-of-the-art binary descriptors, and is comparable with the best float-valued descriptors at a fraction of processing time. Finally, experiments on object recognition tasks confirm that both RFDR and RFDG successfully bridge the performance gap between binary descriptors and their floating-point competitors.

Classification of multispectral image data by the Binary Diamond neural network and by nonparametric, pixel-by-pixel methods

NASA Technical Reports Server (NTRS)

Salu, Yehuda; Tilton, James

1993-01-01

The classification of multispectral image data obtained from satellites has become an important tool for generating ground cover maps. This study deals with the application of nonparametric pixel-by-pixel classification methods in the classification of pixels, based on their multispectral data. A new neural network, the Binary Diamond, is introduced, and its performance is compared with a nearest neighbor algorithm and a back-propagation network. The Binary Diamond is a multilayer, feed-forward neural network, which learns from examples in unsupervised, 'one-shot' mode. It recruits its neurons according to the actual training set, as it learns. The comparisons of the algorithms were done by using a realistic data base, consisting of approximately 90,000 Landsat 4 Thematic Mapper pixels. The Binary Diamond and the nearest neighbor performances were close, with some advantages to the Binary Diamond. The performance of the back-propagation network lagged behind. An efficient nearest neighbor algorithm, the binned nearest neighbor, is described. Ways for improving the performances, such as merging categories, and analyzing nonboundary pixels, are addressed and evaluated.

Context-Aware Local Binary Feature Learning for Face Recognition.

PubMed

Duan, Yueqi; Lu, Jiwen; Feng, Jianjiang; Zhou, Jie

2018-05-01

In this paper, we propose a context-aware local binary feature learning (CA-LBFL) method for face recognition. Unlike existing learning-based local face descriptors such as discriminant face descriptor (DFD) and compact binary face descriptor (CBFD) which learn each feature code individually, our CA-LBFL exploits the contextual information of adjacent bits by constraining the number of shifts from different binary bits, so that more robust information can be exploited for face representation. Given a face image, we first extract pixel difference vectors (PDV) in local patches, and learn a discriminative mapping in an unsupervised manner to project each pixel difference vector into a context-aware binary vector. Then, we perform clustering on the learned binary codes to construct a codebook, and extract a histogram feature for each face image with the learned codebook as the final representation. In order to exploit local information from different scales, we propose a context-aware local binary multi-scale feature learning (CA-LBMFL) method to jointly learn multiple projection matrices for face representation. To make the proposed methods applicable for heterogeneous face recognition, we present a coupled CA-LBFL (C-CA-LBFL) method and a coupled CA-LBMFL (C-CA-LBMFL) method to reduce the modality gap of corresponding heterogeneous faces in the feature level, respectively. Extensive experimental results on four widely used face datasets clearly show that our methods outperform most state-of-the-art face descriptors.

Vesta Cratered Landscape: Double Crater and Craters with Bright Ejecta

NASA Image and Video Library

2011-11-23

This image from NASA Dawn spacecraft is dominated by a double crater which may have been formed by the simultaneous impact of a binary asteroid. Binary asteroids are asteroids that orbit their mutual center of mass.

The coupling analysis between stock market indices based on permutation measures

NASA Astrophysics Data System (ADS)

Shi, Wenbin; Shang, Pengjian; Xia, Jianan; Yeh, Chien-Hung

2016-04-01

Many information-theoretic methods have been proposed for analyzing the coupling dependence between time series. And it is significant to quantify the correlation relationship between financial sequences since the financial market is a complex evolved dynamic system. Recently, we developed a new permutation-based entropy, called cross-permutation entropy (CPE), to detect the coupling structures between two synchronous time series. In this paper, we extend the CPE method to weighted cross-permutation entropy (WCPE), to address some of CPE's limitations, mainly its inability to differentiate between distinct patterns of a certain motif and the sensitivity of patterns close to the noise floor. It shows more stable and reliable results than CPE does when applied it to spiky data and AR(1) processes. Besides, we adapt the CPE method to infer the complexity of short-length time series by freely changing the time delay, and test it with Gaussian random series and random walks. The modified method shows the advantages in reducing deviations of entropy estimation compared with the conventional one. Finally, the weighted cross-permutation entropy of eight important stock indices from the world financial markets is investigated, and some useful and interesting empirical results are obtained.

Automated characterisation of ultrasound images of ovarian tumours: the diagnostic accuracy of a support vector machine and image processing with a local binary pattern operator

PubMed Central

Khazendar, S.; Sayasneh, A.; Al-Assam, H.; Du, H.; Kaijser, J.; Ferrara, L.; Timmerman, D.; Jassim, S.; Bourne, T.

2015-01-01

Introduction: Preoperative characterisation of ovarian masses into benign or malignant is of paramount importance to optimise patient management. Objectives: In this study, we developed and validated a computerised model to characterise ovarian masses as benign or malignant. Materials and methods: Transvaginal 2D B mode static ultrasound images of 187 ovarian masses with known histological diagnosis were included. Images were first pre-processed and enhanced, and Local Binary Pattern Histograms were then extracted from 2 × 2 blocks of each image. A Support Vector Machine (SVM) was trained using stratified cross validation with randomised sampling. The process was repeated 15 times and in each round 100 images were randomly selected. Results: The SVM classified the original non-treated static images as benign or malignant masses with an average accuracy of 0.62 (95% CI: 0.59-0.65). This performance significantly improved to an average accuracy of 0.77 (95% CI: 0.75-0.79) when images were pre-processed, enhanced and treated with a Local Binary Pattern operator (mean difference 0.15: 95% 0.11-0.19, p < 0.0001, two-tailed t test). Conclusion: We have shown that an SVM can classify static 2D B mode ultrasound images of ovarian masses into benign and malignant categories. The accuracy improves if texture related LBP features extracted from the images are considered. PMID:25897367

Permutation entropy of fractional Brownian motion and fractional Gaussian noise

NASA Astrophysics Data System (ADS)

Zunino, L.; Pérez, D. G.; Martín, M. T.; Garavaglia, M.; Plastino, A.; Rosso, O. A.

2008-06-01

We have worked out theoretical curves for the permutation entropy of the fractional Brownian motion and fractional Gaussian noise by using the Bandt and Shiha [C. Bandt, F. Shiha, J. Time Ser. Anal. 28 (2007) 646] theoretical predictions for their corresponding relative frequencies. Comparisons with numerical simulations show an excellent agreement. Furthermore, the entropy-gap in the transition between these processes, observed previously via numerical results, has been here theoretically validated. Also, we have analyzed the behaviour of the permutation entropy of the fractional Gaussian noise for different time delays.

Prototype Focal-Plane-Array Optoelectronic Image Processor

NASA Technical Reports Server (NTRS)

Fang, Wai-Chi; Shaw, Timothy; Yu, Jeffrey

1995-01-01

Prototype very-large-scale integrated (VLSI) planar array of optoelectronic processing elements combines speed of optical input and output with flexibility of reconfiguration (programmability) of electronic processing medium. Basic concept of processor described in "Optical-Input, Optical-Output Morphological Processor" (NPO-18174). Performs binary operations on binary (black and white) images. Each processing element corresponds to one picture element of image and located at that picture element. Includes input-plane photodetector in form of parasitic phototransistor part of processing circuit. Output of each processing circuit used to modulate one picture element in output-plane liquid-crystal display device. Intended to implement morphological processing algorithms that transform image into set of features suitable for high-level processing; e.g., recognition.

A Comparison of Multiscale Permutation Entropy Measures in On-Line Depth of Anesthesia Monitoring

PubMed Central

Li, Xiaoli; Li, Duan; Li, Yongwang; Ursino, Mauro

2016-01-01

Objective Multiscale permutation entropy (MSPE) is becoming an interesting tool to explore neurophysiological mechanisms in recent years. In this study, six MSPE measures were proposed for on-line depth of anesthesia (DoA) monitoring to quantify the anesthetic effect on the real-time EEG recordings. The performance of these measures in describing the transient characters of simulated neural populations and clinical anesthesia EEG were evaluated and compared. Methods Six MSPE algorithms—derived from Shannon permutation entropy (SPE), Renyi permutation entropy (RPE) and Tsallis permutation entropy (TPE) combined with the decomposition procedures of coarse-graining (CG) method and moving average (MA) analysis—were studied. A thalamo-cortical neural mass model (TCNMM) was used to generate noise-free EEG under anesthesia to quantitatively assess the robustness of each MSPE measure against noise. Then, the clinical anesthesia EEG recordings from 20 patients were analyzed with these measures. To validate their effectiveness, the ability of six measures were compared in terms of tracking the dynamical changes in EEG data and the performance in state discrimination. The Pearson correlation coefficient (R) was used to assess the relationship among MSPE measures. Results CG-based MSPEs failed in on-line DoA monitoring at multiscale analysis. In on-line EEG analysis, the MA-based MSPE measures at 5 decomposed scales could track the transient changes of EEG recordings and statistically distinguish the awake state, unconsciousness and recovery of consciousness (RoC) state significantly. Compared to single-scale SPE and RPE, MSPEs had better anti-noise ability and MA-RPE at scale 5 performed best in this aspect. MA-TPE outperformed other measures with faster tracking speed of the loss of unconsciousness. Conclusions MA-based multiscale permutation entropies have the potential for on-line anesthesia EEG analysis with its simple computation and sensitivity to drug effect changes. CG-based multiscale permutation entropies may fail to describe the characteristics of EEG at high decomposition scales. PMID:27723803

A Comparison of Multiscale Permutation Entropy Measures in On-Line Depth of Anesthesia Monitoring.

PubMed

Su, Cui; Liang, Zhenhu; Li, Xiaoli; Li, Duan; Li, Yongwang; Ursino, Mauro

2016-01-01

Multiscale permutation entropy (MSPE) is becoming an interesting tool to explore neurophysiological mechanisms in recent years. In this study, six MSPE measures were proposed for on-line depth of anesthesia (DoA) monitoring to quantify the anesthetic effect on the real-time EEG recordings. The performance of these measures in describing the transient characters of simulated neural populations and clinical anesthesia EEG were evaluated and compared. Six MSPE algorithms-derived from Shannon permutation entropy (SPE), Renyi permutation entropy (RPE) and Tsallis permutation entropy (TPE) combined with the decomposition procedures of coarse-graining (CG) method and moving average (MA) analysis-were studied. A thalamo-cortical neural mass model (TCNMM) was used to generate noise-free EEG under anesthesia to quantitatively assess the robustness of each MSPE measure against noise. Then, the clinical anesthesia EEG recordings from 20 patients were analyzed with these measures. To validate their effectiveness, the ability of six measures were compared in terms of tracking the dynamical changes in EEG data and the performance in state discrimination. The Pearson correlation coefficient (R) was used to assess the relationship among MSPE measures. CG-based MSPEs failed in on-line DoA monitoring at multiscale analysis. In on-line EEG analysis, the MA-based MSPE measures at 5 decomposed scales could track the transient changes of EEG recordings and statistically distinguish the awake state, unconsciousness and recovery of consciousness (RoC) state significantly. Compared to single-scale SPE and RPE, MSPEs had better anti-noise ability and MA-RPE at scale 5 performed best in this aspect. MA-TPE outperformed other measures with faster tracking speed of the loss of unconsciousness. MA-based multiscale permutation entropies have the potential for on-line anesthesia EEG analysis with its simple computation and sensitivity to drug effect changes. CG-based multiscale permutation entropies may fail to describe the characteristics of EEG at high decomposition scales.

BROCCOLI: Software for fast fMRI analysis on many-core CPUs and GPUs

PubMed Central

Eklund, Anders; Dufort, Paul; Villani, Mattias; LaConte, Stephen

2014-01-01

Analysis of functional magnetic resonance imaging (fMRI) data is becoming ever more computationally demanding as temporal and spatial resolutions improve, and large, publicly available data sets proliferate. Moreover, methodological improvements in the neuroimaging pipeline, such as non-linear spatial normalization, non-parametric permutation tests and Bayesian Markov Chain Monte Carlo approaches, can dramatically increase the computational burden. Despite these challenges, there do not yet exist any fMRI software packages which leverage inexpensive and powerful graphics processing units (GPUs) to perform these analyses. Here, we therefore present BROCCOLI, a free software package written in OpenCL (Open Computing Language) that can be used for parallel analysis of fMRI data on a large variety of hardware configurations. BROCCOLI has, for example, been tested with an Intel CPU, an Nvidia GPU, and an AMD GPU. These tests show that parallel processing of fMRI data can lead to significantly faster analysis pipelines. This speedup can be achieved on relatively standard hardware, but further, dramatic speed improvements require only a modest investment in GPU hardware. BROCCOLI (running on a GPU) can perform non-linear spatial normalization to a 1 mm3 brain template in 4–6 s, and run a second level permutation test with 10,000 permutations in about a minute. These non-parametric tests are generally more robust than their parametric counterparts, and can also enable more sophisticated analyses by estimating complicated null distributions. Additionally, BROCCOLI includes support for Bayesian first-level fMRI analysis using a Gibbs sampler. The new software is freely available under GNU GPL3 and can be downloaded from github (https://github.com/wanderine/BROCCOLI/). PMID:24672471

A novel algorithm for thermal image encryption.

PubMed

Hussain, Iqtadar; Anees, Amir; Algarni, Abdulmohsen

2018-04-16

Thermal images play a vital character at nuclear plants, Power stations, Forensic labs biological research, and petroleum products extraction. Safety of thermal images is very important. Image data has some unique features such as intensity, contrast, homogeneity, entropy and correlation among pixels that is why somehow image encryption is trickier as compare to other encryptions. With conventional image encryption schemes it is normally hard to handle these features. Therefore, cryptographers have paid attention to some attractive properties of the chaotic maps such as randomness and sensitivity to build up novel cryptosystems. That is why, recently proposed image encryption techniques progressively more depends on the application of chaotic maps. This paper proposed an image encryption algorithm based on Chebyshev chaotic map and S8 Symmetric group of permutation based substitution boxes. Primarily, parameters of chaotic Chebyshev map are chosen as a secret key to mystify the primary image. Then, the plaintext image is encrypted by the method generated from the substitution boxes and Chebyshev map. By this process, we can get a cipher text image that is perfectly twisted and dispersed. The outcomes of renowned experiments, key sensitivity tests and statistical analysis confirm that the proposed algorithm offers a safe and efficient approach for real-time image encryption.

Generalized permutation entropy analysis based on the two-index entropic form S q , δ

NASA Astrophysics Data System (ADS)

Xu, Mengjia; Shang, Pengjian

2015-05-01

Permutation entropy (PE) is a novel measure to quantify the complexity of nonlinear time series. In this paper, we propose a generalized permutation entropy ( P E q , δ ) based on the recently postulated entropic form, S q , δ , which was proposed as an unification of the well-known Sq of nonextensive-statistical mechanics and S δ , a possibly appropriate candidate for the black-hole entropy. We find that P E q , δ with appropriate parameters can amplify minor changes and trends of complexities in comparison to PE. Experiments with this generalized permutation entropy method are performed with both synthetic and stock data showing its power. Results show that P E q , δ is an exponential function of q and the power ( k ( δ ) ) is a constant if δ is determined. Some discussions about k ( δ ) are provided. Besides, we also find some interesting results about power law.

Permutational symmetries for coincidence rates in multimode multiphotonic interferometry

NASA Astrophysics Data System (ADS)

Khalid, Abdullah; Spivak, Dylan; Sanders, Barry C.; de Guise, Hubert

2018-06-01

We obtain coincidence rates for passive optical interferometry by exploiting the permutational symmetries of partially distinguishable input photons, and our approach elucidates qualitative features of multiphoton coincidence landscapes. We treat the interferometer input as a product state of any number of photons in each input mode with photons distinguished by their arrival time. Detectors at the output of the interferometer count photons from each output mode over a long integration time. We generalize and prove the claim of Tillmann et al. [Phys. Rev. X 5, 041015 (2015), 10.1103/PhysRevX.5.041015] that coincidence rates can be elegantly expressed in terms of immanants. Immanants are functions of matrices that exhibit permutational symmetries and the immanants appearing in our coincidence-rate expressions share permutational symmetries with the input state. Our results are obtained by employing representation theory of the symmetric group to analyze systems of an arbitrary number of photons in arbitrarily sized interferometers.

A hybrid approach of using symmetry technique for brain tumor segmentation.

PubMed

Saddique, Mubbashar; Kazmi, Jawad Haider; Qureshi, Kalim

2014-01-01

Tumor and related abnormalities are a major cause of disability and death worldwide. Magnetic resonance imaging (MRI) is a superior modality due to its noninvasiveness and high quality images of both the soft tissues and bones. In this paper we present two hybrid segmentation techniques and their results are compared with well-recognized techniques in this area. The first technique is based on symmetry and we call it a hybrid algorithm using symmetry and active contour (HASA). In HASA, we take refection image, calculate the difference image, and then apply the active contour on the difference image to segment the tumor. To avoid unimportant segmented regions, we improve the results by proposing an enhancement in the form of the second technique, EHASA. In EHASA, we also take reflection of the original image, calculate the difference image, and then change this image into a binary image. This binary image is mapped onto the original image followed by the application of active contouring to segment the tumor region.

Hadamard multimode optical imaging transceiver

DOEpatents

Cooke, Bradly J; Guenther, David C; Tiee, Joe J; Kellum, Mervyn J; Olivas, Nicholas L; Weisse-Bernstein, Nina R; Judd, Stephen L; Braun, Thomas R

2012-10-30

Disclosed is a method and system for simultaneously acquiring and producing results for multiple image modes using a common sensor without optical filtering, scanning, or other moving parts. The system and method utilize the Walsh-Hadamard correlation detection process (e.g., functions/matrix) to provide an all-binary structure that permits seamless bridging between analog and digital domains. An embodiment may capture an incoming optical signal at an optical aperture, convert the optical signal to an electrical signal, pass the electrical signal through a Low-Noise Amplifier (LNA) to create an LNA signal, pass the LNA signal through one or more correlators where each correlator has a corresponding Walsh-Hadamard (WH) binary basis function, calculate a correlation output coefficient for each correlator as a function of the corresponding WH binary basis function in accordance with Walsh-Hadamard mathematical principles, digitize each of the correlation output coefficient by passing each correlation output coefficient through an Analog-to-Digital Converter (ADC), and performing image mode processing on the digitized correlation output coefficients as desired to produce one or more image modes. Some, but not all, potential image modes include: multi-channel access, temporal, range, three-dimensional, and synthetic aperture.

Nonparametric statistical modeling of binary star separations

NASA Technical Reports Server (NTRS)

Heacox, William D.; Gathright, John

1994-01-01

We develop a comprehensive statistical model for the distribution of observed separations in binary star systems, in terms of distributions of orbital elements, projection effects, and distances to systems. We use this model to derive several diagnostics for estimating the completeness of imaging searches for stellar companions, and the underlying stellar multiplicities. In application to recent imaging searches for low-luminosity companions to nearby M dwarf stars, and for companions to young stars in nearby star-forming regions, our analyses reveal substantial uncertainty in estimates of stellar multiplicity. For binary stars with late-type dwarf companions, semimajor axes appear to be distributed approximately as a(exp -1) for values ranging from about one to several thousand astronomical units. About one-quarter of the companions to field F and G dwarf stars have semimajor axes less than 1 AU, and about 15% lie beyond 1000 AU. The geometric efficiency (fraction of companions imaged onto the detector) of imaging searches is nearly independent of distances to program stars and orbital eccentricities, and varies only slowly with detector spatial limitations.

Automatic lumen segmentation in IVOCT images using binary morphological reconstruction

PubMed Central

2013-01-01

Background Atherosclerosis causes millions of deaths, annually yielding billions in expenses round the world. Intravascular Optical Coherence Tomography (IVOCT) is a medical imaging modality, which displays high resolution images of coronary cross-section. Nonetheless, quantitative information can only be obtained with segmentation; consequently, more adequate diagnostics, therapies and interventions can be provided. Since it is a relatively new modality, many different segmentation methods, available in the literature for other modalities, could be successfully applied to IVOCT images, improving accuracies and uses. Method An automatic lumen segmentation approach, based on Wavelet Transform and Mathematical Morphology, is presented. The methodology is divided into three main parts. First, the preprocessing stage attenuates and enhances undesirable and important information, respectively. Second, in the feature extraction block, wavelet is associated with an adapted version of Otsu threshold; hence, tissue information is discriminated and binarized. Finally, binary morphological reconstruction improves the binary information and constructs the binary lumen object. Results The evaluation was carried out by segmenting 290 challenging images from human and pig coronaries, and rabbit iliac arteries; the outcomes were compared with the gold standards made by experts. The resultant accuracy was obtained: True Positive (%) = 99.29 ± 2.96, False Positive (%) = 3.69 ± 2.88, False Negative (%) = 0.71 ± 2.96, Max False Positive Distance (mm) = 0.1 ± 0.07, Max False Negative Distance (mm) = 0.06 ± 0.1. Conclusions In conclusion, by segmenting a number of IVOCT images with various features, the proposed technique showed to be robust and more accurate than published studies; in addition, the method is completely automatic, providing a new tool for IVOCT segmentation. PMID:23937790

A geometrical defect detection method for non-silicon MEMS part based on HU moment invariants of skeleton image

NASA Astrophysics Data System (ADS)

Cheng, Xu; Jin, Xin; Zhang, Zhijing; Lu, Jun

2014-01-01

In order to improve the accuracy of geometrical defect detection, this paper presented a method based on HU moment invariants of skeleton image. This method have four steps: first of all, grayscale images of non-silicon MEMS parts are collected and converted into binary images, secondly, skeletons of binary images are extracted using medialaxis- transform method, and then HU moment invariants of skeleton images are calculated, finally, differences of HU moment invariants between measured parts and qualified parts are obtained to determine whether there are geometrical defects. To demonstrate the availability of this method, experiments were carried out between skeleton images and grayscale images, and results show that: when defects of non-silicon MEMS part are the same, HU moment invariants of skeleton images are more sensitive than that of grayscale images, and detection accuracy is higher. Therefore, this method can more accurately determine whether non-silicon MEMS parts qualified or not, and can be applied to nonsilicon MEMS part detection system.

A joint asymmetric watermarking and image encryption scheme

NASA Astrophysics Data System (ADS)

Boato, G.; Conotter, V.; De Natale, F. G. B.; Fontanari, C.

2008-02-01

Here we introduce a novel watermarking paradigm designed to be both asymmetric, i.e., involving a private key for embedding and a public key for detection, and commutative with a suitable encryption scheme, allowing both to cipher watermarked data and to mark encrypted data without interphering with the detection process. In order to demonstrate the effectiveness of the above principles, we present an explicit example where the watermarking part, based on elementary linear algebra, and the encryption part, exploiting a secret random permutation, are integrated in a commutative scheme.

Development of an optical parallel logic device and a half-adder circuit for digital optical processing

NASA Technical Reports Server (NTRS)

Athale, R. A.; Lee, S. H.

1978-01-01

The paper describes the fabrication and operation of an optical parallel logic (OPAL) device which performs Boolean algebraic operations on binary images. Several logic operations on two input binary images were demonstrated using an 8 x 8 device with a CdS photoconductor and a twisted nematic liquid crystal. Two such OPAL devices can be interconnected to form a half-adder circuit which is one of the essential components of a CPU in a digital signal processor.

A near infrared speckle imaging study of T Tauri stars

NASA Technical Reports Server (NTRS)

Ghez, A. M.; Mccarthy, D. W., Jr.; Weinberger, A. J.; Neugebauer, G.; Matthews, K.

1994-01-01

The results of a speckle imaging survey of T Tauri stars suggest that most, if not all, young low mass stars have companions. Repeated observations of these young binary stars have revealed orbital motion in the closest pairs (less than or = 0.3 sec), providing that these systems are indeed gravitationally bound and providing the basis for mass estimates in the upcoming years. These mass estimates are necessary to distinguish between the various binary star formation mechanisms that have been proposed to date.

Sylow p-groups of polynomial permutations on the integers mod pn☆

PubMed Central

Frisch, Sophie; Krenn, Daniel

2013-01-01

We enumerate and describe the Sylow p-groups of the groups of polynomial permutations of the integers mod pn for n⩾1 and of the pro-finite group which is the projective limit of these groups. PMID:26869732

Storage and computationally efficient permutations of factorized covariance and square-root information arrays

NASA Technical Reports Server (NTRS)

Muellerschoen, R. J.

1988-01-01

A unified method to permute vector stored Upper triangular Diagonal factorized covariance and vector stored upper triangular Square Root Information arrays is presented. The method involves cyclic permutation of the rows and columns of the arrays and retriangularization with fast (slow) Givens rotations (reflections). Minimal computation is performed, and a one dimensional scratch array is required. To make the method efficient for large arrays on a virtual memory machine, computations are arranged so as to avoid expensive paging faults. This method is potentially important for processing large volumes of radio metric data in the Deep Space Network.

Note on new KLT relations

NASA Astrophysics Data System (ADS)

Feng, Bo; He, Song; Huang, Rijun; Jia, Yin

2010-10-01

In this short note, we present two results about KLT relations discussed in recent several papers. Our first result is the re-derivation of Mason-Skinner MHV amplitude by applying the S n-3 permutation symmetric KLT relations directly to MHV amplitude. Our second result is the equivalence proof of the newly discovered S n-2 permutation symmetric KLT relations and the well-known S n-3 permutation symmetric KLT relations. Although both formulas have been shown to be correct by BCFW recursion relations, our result is the first direct check using the regularized definition of the new formula.

Combating HER2-overexpressing breast cancer through induction of calreticulin exposure by Tras-Permut CrossMab

PubMed Central

Zhang, Fan; Zhang, Jie; Liu, Moyan; Zhao, Lichao; LingHu, RuiXia; Feng, Fan; Gao, Xudong; Jiao, Shunchang; Zhao, Lei; Hu, Yi; Yang, Junlan

2015-01-01

Although trastuzumab has succeeded in breast cancer treatment, acquired resistance is one of the prime obstacles for breast cancer therapies. There is an urgent need to develop novel HER2 antibodies against trastuzumab resistance. Here, we first rational designed avidity-imporved trastuzumab and pertuzumab variants, and explored the correlation between the binding avidity improvement and their antitumor activities. After characterization of a pertuzumab variant L56TY with potent antitumor activities, a bispecific immunoglobulin G-like CrossMab (Tras-Permut CrossMab) was generated from trastuzumab and binding avidity-improved pertuzumab variant L56TY. Although, the antitumor efficacy of trastuzumab was not enhanced by improving its binding avidity, binding avidity improvement could significantly increase the anti-proliferative and antibody-dependent cellular cytotoxicity (ADCC) activities of pertuzumab. Further studies showed that Tras-Permut CrossMab exhibited exceptional high efficiency to inhibit the progression of trastuzumab-resistant breast cancer. Notably, we found that calreticulin (CRT) exposure induced by Tras-Permut CrossMab was essential for induction of tumor-specific T cell immunity against tumor recurrence. These data indicated that simultaneous blockade of HER2 protein by Tras-Permut CrossMab could trigger CRT exposure and subsequently induce potent tumor-specific T cell immunity, suggesting it could be a promising therapeutic strategy against trastuzumab resistance. PMID:25949918

TEMPORAL CORRELATION OF CLASSIFICATIONS IN REMOTE SENSING

EPA Science Inventory

A bivariate binary model is developed for estimating the change in land cover from satellite images obtained at two different times. The binary classifications of a pixel at the two times are modeled as potentially correlated random variables, conditional on the true states of th...

Automatic NEPHIS Coding of Descriptive Titles for Permuted Index Generation.

ERIC Educational Resources Information Center

Craven, Timothy C.

1982-01-01

Describes a system for the automatic coding of most descriptive titles which generates Nested Phrase Indexing System (NEPHIS) input strings of sufficient quality for permuted index production. A series of examples and an 11-item reference list accompany the text. (JL)

Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees

PubMed Central

Chang, Wan-Yu; Chiu, Chung-Cheng; Yang, Jia-Horng

2015-01-01

In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based scan mask. We analyze the advantages of a sequential raster scan for the block-based scan mask, and integrate the block-connected relationships using two different procedures with binary decision trees to reduce unnecessary memory access. This greatly simplifies the pixel locations of the block-based scan mask. Furthermore, our algorithm significantly reduces the number of leaf nodes and depth levels required in the binary decision tree. We analyze the labeling performance of the proposed algorithm alongside that of other labeling algorithms using high-resolution images and foreground images. The experimental results from synthetic and real image datasets demonstrate that the proposed algorithm is faster than other methods. PMID:26393597

A neural net based architecture for the segmentation of mixed gray-level and binary pictures

NASA Technical Reports Server (NTRS)

Tabatabai, Ali; Troudet, Terry P.

1991-01-01

A neural-net-based architecture is proposed to perform segmentation in real time for mixed gray-level and binary pictures. In this approach, the composite picture is divided into 16 x 16 pixel blocks, which are identified as character blocks or image blocks on the basis of a dichotomy measure computed by an adaptive 16 x 16 neural net. For compression purposes, each image block is further divided into 4 x 4 subblocks; a one-bit nonparametric quantizer is used to encode 16 x 16 character and 4 x 4 image blocks; and the binary map and quantizer levels are obtained through a neural net segmentor over each block. The efficiency of the neural segmentation in terms of computational speed, data compression, and quality of the compressed picture is demonstrated. The effect of weight quantization is also discussed. VLSI implementations of such adaptive neural nets in CMOS technology are described and simulated in real time for a maximum block size of 256 pixels.

HIGH RESOLUTION H{alpha} IMAGES OF THE BINARY LOW-MASS PROPLYD LV 1 WITH THE MAGELLAN AO SYSTEM

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Y.-L.; Close, L. M.; Males, J. R.

2013-09-01

We utilize the new Magellan adaptive optics system (MagAO) to image the binary proplyd LV 1 in the Orion Trapezium at H{alpha}. This is among the first AO results in visible wavelengths. The H{alpha} image clearly shows the ionization fronts, the interproplyd shell, and the cometary tails. Our astrometric measurements find no significant relative motion between components over {approx}18 yr, implying that LV 1 is a low-mass system. We also analyze Large Binocular Telescope AO observations, and find a point source which may be the embedded protostar's photosphere in the continuum. Converting the H magnitudes to mass, we show thatmore » the LV 1 binary may consist of one very-low-mass star with a likely brown dwarf secondary, or even plausibly a double brown dwarf. Finally, the magnetopause of the minor proplyd is estimated to have a radius of 110 AU, consistent with the location of the bow shock seen in H{alpha}.« less

Oriented modulation for watermarking in direct binary search halftone images.

PubMed

Guo, Jing-Ming; Su, Chang-Cheng; Liu, Yun-Fu; Lee, Hua; Lee, Jiann-Der

2012-09-01

In this paper, a halftoning-based watermarking method is presented. This method enables high pixel-depth watermark embedding, while maintaining high image quality. This technique is capable of embedding watermarks with pixel depths up to 3 bits without causing prominent degradation to the image quality. To achieve high image quality, the parallel oriented high-efficient direct binary search (DBS) halftoning is selected to be integrated with the proposed orientation modulation (OM) method. The OM method utilizes different halftone texture orientations to carry different watermark data. In the decoder, the least-mean-square-trained filters are applied for feature extraction from watermarked images in the frequency domain, and the naïve Bayes classifier is used to analyze the extracted features and ultimately to decode the watermark data. Experimental results show that the DBS-based OM encoding method maintains a high degree of image quality and realizes the processing efficiency and robustness to be adapted in printing applications.

Lossless compression of VLSI layout image data.

PubMed

Dai, Vito; Zakhor, Avideh

2006-09-01

We present a novel lossless compression algorithm called Context Copy Combinatorial Code (C4), which integrates the advantages of two very disparate compression techniques: context-based modeling and Lempel-Ziv (LZ) style copying. While the algorithm can be applied to many lossless compression applications, such as document image compression, our primary target application has been lossless compression of integrated circuit layout image data. These images contain a heterogeneous mix of data: dense repetitive data better suited to LZ-style coding, and less dense structured data, better suited to context-based encoding. As part of C4, we have developed a novel binary entropy coding technique called combinatorial coding which is simultaneously as efficient as arithmetic coding, and as fast as Huffman coding. Compression results show C4 outperforms JBIG, ZIP, BZIP2, and two-dimensional LZ, and achieves lossless compression ratios greater than 22 for binary layout image data, and greater than 14 for gray-pixel image data.

Fringe image processing based on structured light series

NASA Astrophysics Data System (ADS)

Gai, Shaoyan; Da, Feipeng; Li, Hongyan

2009-11-01

The code analysis of the fringe image is playing a vital role in the data acquisition of structured light systems, which affects precision, computational speed and reliability of the measurement processing. According to the self-normalizing characteristic, a fringe image processing method based on structured light is proposed. In this method, a series of projective patterns is used when detecting the fringe order of the image pixels. The structured light system geometry is presented, which consist of a white light projector and a digital camera, the former projects sinusoidal fringe patterns upon the object, and the latter acquires the fringe patterns that are deformed by the object's shape. Then the binary images with distinct white and black strips can be obtained and the ability to resist image noise is improved greatly. The proposed method can be implemented easily and applied for profile measurement based on special binary code in a wide field.

Single image super-resolution based on approximated Heaviside functions and iterative refinement

PubMed Central

Wang, Xin-Yu; Huang, Ting-Zhu; Deng, Liang-Jian

2018-01-01

One method of solving the single-image super-resolution problem is to use Heaviside functions. This has been done previously by making a binary classification of image components as “smooth” and “non-smooth”, describing these with approximated Heaviside functions (AHFs), and iteration including l1 regularization. We now introduce a new method in which the binary classification of image components is extended to different degrees of smoothness and non-smoothness, these components being represented by various classes of AHFs. Taking into account the sparsity of the non-smooth components, their coefficients are l1 regularized. In addition, to pick up more image details, the new method uses an iterative refinement for the residuals between the original low-resolution input and the downsampled resulting image. Experimental results showed that the new method is superior to the original AHF method and to four other published methods. PMID:29329298

Bi-lobed Shape of Comet 67P from a Collapsed Binary

NASA Astrophysics Data System (ADS)

Nesvorný, David; Parker, Joel; Vokrouhlický, David

2018-06-01

The Rosetta spacecraft observations revealed that the nucleus of comet 67P/Churyumov–Gerasimenko consists of two similarly sized lobes connected by a narrow neck. Here, we evaluate the possibility that 67P is a collapsed binary. We assume that the progenitor of 67P was a binary and consider various physical mechanisms that could have brought the binary components together, including small-scale impacts and gravitational encounters with planets. We find that 67P could be a primordial body (i.e., not a collisional fragment) if the outer planetesimal disk lasted ≲10 Myr before it was dispersed by migrating Neptune. The probability of binary collapse by impact is ≃30% for tightly bound binaries. Most km-class binaries become collisionally dissolved. Roughly 10% of the surviving binaries later evolve to become contact binaries during the disk dispersal, when bodies suffer gravitational encounters with Neptune. Overall, the processes described in this work do not seem to be efficient enough to explain the large fraction (∼67%) of bi-lobed cometary nuclei inferred from spacecraft imaging.

A symmetrical image encryption scheme in wavelet and time domain

NASA Astrophysics Data System (ADS)

Luo, Yuling; Du, Minghui; Liu, Junxiu

2015-02-01

There has been an increasing concern for effective storages and secure transactions of multimedia information over the Internet. Then a great variety of encryption schemes have been proposed to ensure the information security while transmitting, but most of current approaches are designed to diffuse the data only in spatial domain which result in reducing storage efficiency. A lightweight image encryption strategy based on chaos is proposed in this paper. The encryption process is designed in transform domain. The original image is decomposed into approximation and detail components using integer wavelet transform (IWT); then as the more important component of the image, the approximation coefficients are diffused by secret keys generated from a spatiotemporal chaotic system followed by inverse IWT to construct the diffused image; finally a plain permutation is performed for diffusion image by the Logistic mapping in order to reduce the correlation between adjacent pixels further. Experimental results and performance analysis demonstrate the proposed scheme is an efficient, secure and robust encryption mechanism and it realizes effective coding compression to satisfy desirable storage.

Young Binaries and Early Stellar Evolution

NASA Astrophysics Data System (ADS)

Brandner, Wolfgang

1996-07-01

Most main-sequence stars are members of binary or multiple systems. The same is true for pre-main-sequence (PMS) stars, as recent surveys have shown. Therefore studying star formation means to a large extent studying the formation of binary systems. Similarly, studying early stellar evolution primarily involves PMS binary systems. In this thesis I have studied the binary frequency among ROSAT selected T Tauri stars in the Chamaeleon T association and the Scorpius-Centaurus OB association, and the evolutionary status of Hα-selected PMS binaries in the T associations of Chamaeleon, Lupus, and ρ Ophiuchi. The direct imaging and spectroscopic observations in the optical have been carried out under subarcsec seeing conditions at the ESO New Technology Telescope (NTT) at La Silla. Furthermore, high-spatial resolution images of selected PMS stars in the near infrared were obtained with the ESO adaptive optics system COME-ON+/ADONIS. Among 195 T Tauri stars observed using direct imaging 31 binaries could be identified, 12 of them with subarcsec separation. Based on statistical arguments alone I conclude that almost all of them are indeed physical (i.e. gravitationally bound) binary or multiple systems. Using astrometric measurements of some binaries I showed that the components of these binaries are common proper motion pairs, very likely in a gravitationally bound orbit around each other. The overall binary frequency among T Tauri stars with a range of separations between 120 and 1800 AU is in agreement with the binary frequency observed among main-sequence stars in the solar neighbourhood. However, within individual regions the spatial distribution of binaries is non-uniform. In particular, in Upper Scorpius, weak-line T Tauri stars in the vicinity of early type stars seem to be almost devoid of multiple systems, whereas in another area in Upper Scorpius half of all weak-line T Tauri stars have a companion in a range of separation between 0.''7 and 3.''0. For a sample of 14 spatially resolved PMS binaries (separations 0.''6 to 1.prime'7) located in the above mentioned T associations both photometric and spectroscopic information has been analyzed. All binaries (originally unresolved) were identified as PMS stars based on their strong Hα emission and their association with dark clouds. Using the spectral A index, which measures the strength of the CaH band at 697.5nm relative to the nearby continuum as a luminosity class indicator, I showed that the classical T Tauri stars in the sample tend to be close to luminosity class V. Eight out of the 14 pairs could be placed on an H--R diagram. When comparing with theoretical PMS evolutionary tracks the individual components of all pairs appear to be coeval within the observational errors. This result is similar to Hartigan et al. (1994) who found two thirds of the wider pairs with separations from 400 AU to 6000 AU to be coeval. However, unlike Hartigan et al.'s finding for the wider pairs, I find no non-coeval pairs. One of the presumed binaries in our sample (ESO Hα 281) turned out to be a likely chance projection with the ``primary'' showing neither Hα emission nor Li absorption. Finally, using adaptive optics at the ESO 3.6m telescope, diffraction-limited JHK images of the region around the Herbig AeBe star NX Pup were obtained. The close companion (sep. 0.''128) to NX Pup -- originally discovered by HST -- was clearly resolved and its JHK magnitudes were determined. A third object at a separation of 7.''0 from NX Pup was identified as a classical T Tauri star so that NX Pup may in fact form a hierarchical triple system. I discuss the evolutionary status of these stars and derive estimates for their spectral types, luminosities, masses, and ages. My conclusions are that binarity is established very early in stellar evolution, that the orbital parameters of wide binaries (a >= 120AU) remain virtually unchanged during their PMS evolution, and that the components of the wide binaries were formed at the same time --- perhaps either through collisional fragmentation or fragmentation of rotating filaments. (Copies of the thesis (written in German) and related pre-/reprints are available from the author upon request.)

Image secure transmission for optical orthogonal frequency-division multiplexing visible light communication systems using chaotic discrete cosine transform

NASA Astrophysics Data System (ADS)

Wang, Zhongpeng; Zhang, Shaozhong; Chen, Fangni; Wu, Ming-Wei; Qiu, Weiwei

2017-11-01

A physical encryption scheme for orthogonal frequency-division multiplexing (OFDM) visible light communication (VLC) systems using chaotic discrete cosine transform (DCT) is proposed. In the scheme, the row of the DCT matrix is permutated by a scrambling sequence generated by a three-dimensional (3-D) Arnold chaos map. Furthermore, two scrambling sequences, which are also generated from a 3-D Arnold map, are employed to encrypt the real and imaginary parts of the transmitted OFDM signal before the chaotic DCT operation. The proposed scheme enhances the physical layer security and improves the bit error rate (BER) performance for OFDM-based VLC. The simulation results prove the efficiency of the proposed encryption method. The experimental results show that the proposed security scheme not only protects image data from eavesdroppers but also keeps the good BER and peak-to-average power ratio performances for image-based OFDM-VLC systems.

CHANDRA X-RAY AND HUBBLE SPACE TELESCOPE IMAGING OF OPTICALLY SELECTED KILOPARSEC-SCALE BINARY ACTIVE GALACTIC NUCLEI. II. HOST GALAXY MORPHOLOGY AND AGN ACTIVITY

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shangguan, Jinyi; Ho, Luis C.; Liu, Xin

Binary active galactic nuclei (AGNs) provide clues to how gas-rich mergers trigger and fuel AGNs and how supermassive black hole (SMBH) pairs evolve in a gas-rich environment. While significant effort has been invested in their identification, the detailed properties of binary AGNs and their host galaxies are still poorly constrained. In a companion paper, we examined the nature of ionizing sources in the double nuclei of four kiloparsec-scale binary AGNs with redshifts between 0.1 and 0.2. Here, we present their host galaxy morphology based on F336W ( U -band) and F105W ( Y -band) images taken by the Wide Fieldmore » Camera 3 on board the Hubble Space Telescope . Our targets have double-peaked narrow emission lines and were confirmed to host binary AGNs with follow-up observations. We find that kiloparsec-scale binary AGNs occur in galaxy mergers with diverse morphological types. There are three major mergers with intermediate morphologies and a minor merger with a dominant disk component. We estimate the masses of the SMBHs from their host bulge stellar masses and obtain Eddington ratios for each AGN. Compared with a representative control sample drawn at the same redshift and stellar mass, the AGN luminosities and Eddington ratios of our binary AGNs are similar to those of single AGNs. The U − Y color maps indicate that clumpy star-forming regions could significantly affect the X-ray detection of binary AGNs, e.g., the hardness ratio. Considering the weak X-ray emission in AGNs triggered in merger systems, we suggest that samples of X-ray-selected AGNs may be biased against gas-rich mergers.« less

Binary-space-partitioned images for resolving image-based visibility.

PubMed

Fu, Chi-Wing; Wong, Tien-Tsin; Tong, Wai-Shun; Tang, Chi-Keung; Hanson, Andrew J

2004-01-01

We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting. Since the overall structure of a BSP tree is encoded in a BSPI, traversing a BSPI is comparable to traversing the corresponding BSP tree. BSPI performs visibility sorting efficiently and accurately in the 2D image space by warping the reference image triangle-by-triangle instead of pixel-by-pixel. Multiple BSPIs can be combined to solve "disocclusion," when an occluded portion of the scene becomes visible at a novel viewpoint. Our method is highly automatic, including a tensor voting preprocessing step that generates candidate image partition lines for BSPIs, filters the noisy input data by rejecting outliers, and interpolates missing information. Our system has been applied to a variety of real data, including stereo, motion, and range images.

A New Pixels Flipping Method for Huge Watermarking Capacity of the Invoice Font Image

PubMed Central

Li, Li; Hou, Qingzheng; Lu, Jianfeng; Dai, Junping; Mao, Xiaoyang; Chang, Chin-Chen

2014-01-01

Invoice printing just has two-color printing, so invoice font image can be seen as binary image. To embed watermarks into invoice image, the pixels need to be flipped. The more huge the watermark is, the more the pixels need to be flipped. We proposed a new pixels flipping method in invoice image for huge watermarking capacity. The pixels flipping method includes one novel interpolation method for binary image, one flippable pixels evaluation mechanism, and one denoising method based on gravity center and chaos degree. The proposed interpolation method ensures that the invoice image keeps features well after scaling. The flippable pixels evaluation mechanism ensures that the pixels keep better connectivity and smoothness and the pattern has highest structural similarity after flipping. The proposed denoising method makes invoice font image smoother and fiter for human vision. Experiments show that the proposed flipping method not only keeps the invoice font structure well but also improves watermarking capacity. PMID:25489606

Creation of a Ligand-Dependent Enzyme by Fusing Circularly Permuted Antibody Variable Region Domains.

PubMed

Iwai, Hiroto; Kojima-Misaizu, Miki; Dong, Jinhua; Ueda, Hiroshi

2016-04-20

Allosteric control of enzyme activity with exogenous substances has been hard to achieve, especially using antibody domains that potentially allow control by any antigens of choice. Here, in order to attain this goal, we developed a novel antibody variable region format introduced with circular permutations, called Clampbody. The two variable-region domains of the antibone Gla protein (BGP) antibody were each circularly permutated to have novel termini at the loops near their domain interface. Through their attachment to the N- and C-termini of a circularly permutated TEM-1 β-lactamase (cpBLA), we created a molecular switch that responds to the antigen peptide. The fusion protein specifically recognized the antigen, and in the presence of some detergent or denaturant, its catalytic activity was enhanced up to 4.7-fold in an antigen-dependent manner, due to increased resistance to these reagents. Hence, Clampbody will be a powerful tool for the allosteric regulation of enzyme and other protein activities and especially useful to design robust biosensors.

Tumor or abnormality identification from magnetic resonance images using statistical region fusion based segmentation.

PubMed

Subudhi, Badri Narayan; Thangaraj, Veerakumar; Sankaralingam, Esakkirajan; Ghosh, Ashish

2016-11-01

In this article, a statistical fusion based segmentation technique is proposed to identify different abnormality in magnetic resonance images (MRI). The proposed scheme follows seed selection, region growing-merging and fusion of multiple image segments. In this process initially, an image is divided into a number of blocks and for each block we compute the phase component of the Fourier transform. The phase component of each block reflects the gray level variation among the block but contains a large correlation among them. Hence a singular value decomposition (SVD) technique is adhered to generate a singular value of each block. Then a thresholding procedure is applied on these singular values to identify edgy and smooth regions and some seed points are selected for segmentation. By considering each seed point we perform a binary segmentation of the complete MRI and hence with all seed points we get an equal number of binary images. A parcel based statistical fusion process is used to fuse all the binary images into multiple segments. Effectiveness of the proposed scheme is tested on identifying different abnormalities: prostatic carcinoma detection, tuberculous granulomas identification and intracranial neoplasm or brain tumor detection. The proposed technique is established by comparing its results against seven state-of-the-art techniques with six performance evaluation measures. Copyright © 2016 Elsevier Inc. All rights reserved.

Diagnosis of Tempromandibular Disorders Using Local Binary Patterns.

PubMed

Haghnegahdar, A A; Kolahi, S; Khojastepour, L; Tajeripour, F

2018-03-01

Temporomandibular joint disorder (TMD) might be manifested as structural changes in bone through modification, adaptation or direct destruction. We propose to use Local Binary Pattern (LBP) characteristics and histogram-oriented gradients on the recorded images as a diagnostic tool in TMD assessment. CBCT images of 66 patients (132 joints) with TMD and 66 normal cases (132 joints) were collected and 2 coronal cut prepared from each condyle, although images were limited to head of mandibular condyle. In order to extract features of images, first we use LBP and then histogram of oriented gradients. To reduce dimensionality, the linear algebra Singular Value Decomposition (SVD) is applied to the feature vectors matrix of all images. For evaluation, we used K nearest neighbor (K-NN), Support Vector Machine, Naïve Bayesian and Random Forest classifiers. We used Receiver Operating Characteristic (ROC) to evaluate the hypothesis. K nearest neighbor classifier achieves a very good accuracy (0.9242), moreover, it has desirable sensitivity (0.9470) and specificity (0.9015) results, when other classifiers have lower accuracy, sensitivity and specificity. We proposed a fully automatic approach to detect TMD using image processing techniques based on local binary patterns and feature extraction. K-NN has been the best classifier for our experiments in detecting patients from healthy individuals, by 92.42% accuracy, 94.70% sensitivity and 90.15% specificity. The proposed method can help automatically diagnose TMD at its initial stages.

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

Nicotine deprivation elevates neural representation of smoking-related cues in object-sensitive visual cortex: a proof of concept study.

PubMed

Havermans, Anne; van Schayck, Onno C P; Vuurman, Eric F P M; Riedel, Wim J; van den Hurk, Job

2017-08-01

In the current study, we use functional magnetic resonance imaging (fMRI) and multi-voxel pattern analysis (MVPA) to investigate whether tobacco addiction biases basic visual processing in favour of smoking-related images. We hypothesize that the neural representation of smoking-related stimuli in the lateral occipital complex (LOC) is elevated after a period of nicotine deprivation compared to a satiated state, but that this is not the case for object categories unrelated to smoking. Current smokers (≥10 cigarettes a day) underwent two fMRI scanning sessions: one after 10 h of nicotine abstinence and the other one after smoking ad libitum. Regional blood oxygenated level-dependent (BOLD) response was measured while participants were presented with 24 blocks of 8 colour-matched pictures of cigarettes, pencils or chairs. The functional data of 10 participants were analysed through a pattern classification approach. In bilateral LOC clusters, the classifier was able to discriminate between patterns of activity elicited by visually similar smoking-related (cigarettes) and neutral objects (pencils) above empirically estimated chance levels only during deprivation (mean = 61.0%, chance (permutations) = 50.0%, p = .01) but not during satiation (mean = 53.5%, chance (permutations) = 49.9%, ns.). For all other stimulus contrasts, there was no difference in discriminability between the deprived and satiated conditions. The discriminability between smoking and non-smoking visual objects was elevated in object-selective brain region LOC after a period of nicotine abstinence. This indicates that attention bias likely affects basic visual object processing.

Electric Field Reconstruction in the Image Plane of a High-Contrast Coronagraph Using a Set of Pinholes around the Lyot Plane

NASA Technical Reports Server (NTRS)

Giveona, Amir; Shaklan, Stuart; Kern, Brian; Noecker, Charley; Kendrick, Steve; Wallace, Kent

2012-01-01

In a setup similar to the self coherent camera, we have added a set of pinholes in the diffraction ring of the Lyot plane in a high-contrast stellar Lyot coronagraph. We describe a novel complex electric field reconstruction from image plane intensity measurements consisting of light in the coronagraph's dark hole interfering with light from the pinholes. The image plane field is modified by letting light through one pinhole at a time. In addition to estimation of the field at the science camera, this method allows for self-calibration of the probes by letting light through the pinholes in various permutations while blocking the main Lyot opening. We present results of estimation and calibration from the High Contrast Imaging Testbed along with a comparison to the pair-wise deformable mirror diversity based estimation technique. Tests are carried out in narrow-band light and over a composite 10% bandpass.

Levels of Conceptual Development in Melodic Permutation Concepts Based on Piaget's Theory

ERIC Educational Resources Information Center

Larn, Ronald L.

1973-01-01

Article considered different ways in which subjects at different age levels solved a musical task involving melodic permutation. The differences in responses to the musical task between age groups were judged to be compatible with Piaget's theory of cognitive development. (Author/RK)

In Response to Rowland on "Realism and Debateability in Policy Advocacy."

ERIC Educational Resources Information Center

Herbeck, Dale A.; Katsulas, John P.

1986-01-01

Argues that Robert Rowland has overstated the case against the permutation process for assessing counterplan competitiveness. Claims that the permutation standard is a viable method for ascertaining counterplan competitiveness. Examines Rowland's alternative and argues that it is an unsatisfactory method for determining counterplan…

Curious case of gravitational lensing by binary black holes: A tale of two photon spheres, new relativistic images, and caustics

NASA Astrophysics Data System (ADS)

Patil, Mandar; Mishra, Priti; Narasimha, D.

2017-01-01

Binary black holes have been in the limelight of late due to the detection of gravitational waves from coalescing compact binaries in the events GW150914 and GW151226. In this paper we study gravitational lensing by the binary black holes modeled as an equal mass Majumdar-Papapetrou dihole metric and show that this system displays features that are quite unprecedented and absent in any other lensing configuration investigated so far in the literature. We restrict our attention to the light rays which move on the plane midway between the two identical black holes, which allows us to employ various techniques developed for the equatorial lensing in the spherically symmetric spacetimes. If distance between the two black holes is below a certain threshold value, then the system admits two photon spheres. As in the case of a single black hole, infinitely many relativistic images are formed due to the light rays which turn back from the region outside the outer (unstable) photon sphere, all of which lie beyond a critical angular radius with respect to the lens. However, in the presence of the inner (stable) photon sphere, the effective potential after admitting minimum turns upwards and blows up for the smaller values of radii and the light rays that enter the outer photon sphere can turn back, leading to the formation of a new set of infinitely many relativistic images, all of which lie below the critical radius from the lens mentioned above. As the distance between the two black holes is increased, two photon spheres approach one another, merge and eventually disappear. In the absence of the photon sphere, apart from the formation of a finite number of discrete relativistic images, the system remarkably admits a radial caustic, which has never been observed in the context of relativistic lensing before. Thus the system of the binary black hole admits novel features both in the presence and absence of photon spheres. We discuss possible observational signatures and implications of the binary black hole lensing.

VizieR Online Data Catalog: Astrometric monitoring of ultracool dwarf binaries (Dupuy+, 2017)

NASA Astrophysics Data System (ADS)

Dupuy, T. J.; Liu, M. C.

2017-09-01

In Table 1 we list all 33 binaries in our Keck+CFHT astrometric monitoring sample, along with three other binaries that have published orbit and parallax measurements. We began obtaining resolved Keck AO astrometry in 2007-2008, and we combined our new astrometry with available data in the literature or public archives (e.g., HST and Gemini) to refine our orbital period estimates and thereby our prioritization for Keck observations. We present here new Keck/NIRC2 AO imaging and non-redundant aperture-masking observations, in addition to a re-analysis of our own previously published data and publicly available archival data for our sample binaries. Table 2 gives our measured astrometry and flux ratios for all Keck AO data used in our orbital analysis spanning 2003 Apr 15 to 2016 May 13. In total there are 339 distinct measurements (unique bandpass and epoch for a given target), where 302 of these are direct imaging and 37 are non-redundant aperture masking. Eight of the imaging measurements are from six unpublished archival data sets. See section 3.1.1 for further details. In addition to our Keck AO monitoring, we also obtained data for three T dwarf binaries over a three-year HST program using the Advanced Camera for Surveys (ACS) Wide Field Camera (WFC) in the F814W bandpass. See section 3.1.2 for further details. Many of our sample binaries have HST imaging data in the public archive. We have re-analyzed the available archival data coming from the WFPC2 Planetary Camera (WFPC2-PC1), ACS High Resolution Channel (ACS-HRC), and NICMOS Camera 1 (NICMOS-NIC1). See section 3.1.3 for further details. We present here an updated analysis of our data from the Hawaii Infrared Parallax Program that uses the CFHT facility infrared camera WIRCam. Our observing strategy and custom astrometry pipeline are described in detail in Dupuy & Liu (2012, J/ApJS/201/19). See section 3.2 for further explanations. (10 data files).

THE LEECH EXOPLANET IMAGING SURVEY: ORBIT AND COMPONENT MASSES OF THE INTERMEDIATE-AGE, LATE-TYPE BINARY NO UMa

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schlieder, Joshua E.; Skemer, Andrew J.; Hinz, Philip

2016-02-10

We present high-resolution Large Binocular Telescope LBTI/LMIRcam images of the spectroscopic and astrometric binary NO UMa obtained as part of the LBT Interferometer Exozodi Exoplanet Common Hunt exoplanet imaging survey. Our H-, K{sub s}-, and L′-band observations resolve the system at angular separations <0.″09. The components exhibit significant orbital motion over a span of ∼7 months. We combine our imaging data with archival images, published speckle interferometry measurements, and existing spectroscopic velocity data to solve the full orbital solution and estimate component masses. The masses of the K2.0 ± 0.5 primary and K6.5 ± 0.5 secondary are 0.83 ± 0.02 M{sub ⊙} and 0.64 ± 0.02 M{sub ⊙},more » respectively. We also derive a system distance of d = 25.87 ± 0.02 pc and revise the Galactic kinematics of NO UMa. Our revised Galactic kinematics confirm NO UMa as a nuclear member of the ∼500 Myr old Ursa Major moving group, and it is thus a mass and age benchmark. We compare the masses of the NO UMa binary components to those predicted by five sets of stellar evolution models at the age of the Ursa Major group. We find excellent agreement between our measured masses and model predictions with little systematic scatter between the models. NO UMa joins the short list of nearby, bright, late-type binaries having known ages and fully characterized orbits.« less

EPEPT: A web service for enhanced P-value estimation in permutation tests

PubMed Central

2011-01-01

Background In computational biology, permutation tests have become a widely used tool to assess the statistical significance of an event under investigation. However, the common way of computing the P-value, which expresses the statistical significance, requires a very large number of permutations when small (and thus interesting) P-values are to be accurately estimated. This is computationally expensive and often infeasible. Recently, we proposed an alternative estimator, which requires far fewer permutations compared to the standard empirical approach while still reliably estimating small P-values [1]. Results The proposed P-value estimator has been enriched with additional functionalities and is made available to the general community through a public website and web service, called EPEPT. This means that the EPEPT routines can be accessed not only via a website, but also programmatically using any programming language that can interact with the web. Examples of web service clients in multiple programming languages can be downloaded. Additionally, EPEPT accepts data of various common experiment types used in computational biology. For these experiment types EPEPT first computes the permutation values and then performs the P-value estimation. Finally, the source code of EPEPT can be downloaded. Conclusions Different types of users, such as biologists, bioinformaticians and software engineers, can use the method in an appropriate and simple way. Availability http://informatics.systemsbiology.net/EPEPT/ PMID:22024252

Probabilistic model for quick detection of dissimilar binary images

NASA Astrophysics Data System (ADS)

Mustafa, Adnan A. Y.

2015-09-01

We present a quick method to detect dissimilar binary images. The method is based on a "probabilistic matching model" for image matching. The matching model is used to predict the probability of occurrence of distinct-dissimilar image pairs (completely different images) when matching one image to another. Based on this model, distinct-dissimilar images can be detected by matching only a few points between two images with high confidence, namely 11 points for a 99.9% successful detection rate. For image pairs that are dissimilar but not distinct-dissimilar, more points need to be mapped. The number of points required to attain a certain successful detection rate or confidence depends on the amount of similarity between the compared images. As this similarity increases, more points are required. For example, images that differ by 1% can be detected by mapping fewer than 70 points on average. More importantly, the model is image size invariant; so, images of any sizes will produce high confidence levels with a limited number of matched points. As a result, this method does not suffer from the image size handicap that impedes current methods. We report on extensive tests conducted on real images of different sizes.

Invited Article: Mask-modulated lensless imaging with multi-angle illuminations

NASA Astrophysics Data System (ADS)

Zhang, Zibang; Zhou, You; Jiang, Shaowei; Guo, Kaikai; Hoshino, Kazunori; Zhong, Jingang; Suo, Jinli; Dai, Qionghai; Zheng, Guoan

2018-06-01

The use of multiple diverse measurements can make lensless phase retrieval more robust. Conventional diversity functions include aperture diversity, wavelength diversity, translational diversity, and defocus diversity. Here we discuss a lensless imaging scheme that employs multiple spherical-wave illuminations from a light-emitting diode array as diversity functions. In this scheme, we place a binary mask between the sample and the detector for imposing support constraints for the phase retrieval process. This support constraint enforces the light field to be zero at certain locations and is similar to the aperture constraint in Fourier ptychographic microscopy. We use a self-calibration algorithm to correct the misalignment of the binary mask. The efficacy of the proposed scheme is first demonstrated by simulations where we evaluate the reconstruction quality using mean square error and structural similarity index. The scheme is then experimentally tested by recovering images of a resolution target and biological samples. The proposed scheme may provide new insights for developing compact and large field-of-view lensless imaging platforms. The use of the binary mask can also be combined with other diversity functions for better constraining the phase retrieval solution space. We provide the open-source implementation code for the broad research community.

Multiphase computer-generated holograms for full-color image generation

NASA Astrophysics Data System (ADS)

Choi, Kyong S.; Choi, Byong S.; Choi, Yoon S.; Kim, Sun I.; Kim, Jong Man; Kim, Nam; Gil, Sang K.

2002-06-01

Multi-phase and binary-phase computer-generated holograms were designed and demonstrated for full-color image generation. Optimize a phase profile of the hologram that achieves each color image, we employed a simulated annealing method. The design binary phase hologram had the diffraction efficiency of 33.23 percent and the reconstruction error of 0.367 X 10-2. And eight phase hologram had the diffraction efficiency of 67.92 percent and the reconstruction error of 0.273 X 10-2. The designed BPH was fabricated by micro photolithographic technique with a minimum pixel width of 5micrometers . And the it was reconstructed using by two Ar-ion lasers and a He-Ne laser. In addition, the color dispersion characteristic of the fabricate grating and scaling problem of the reconstructed image were discussed.

Binary logic based purely on Fresnel diffraction

NASA Astrophysics Data System (ADS)

Hamam, H.; de Bougrenet de La Tocnaye, J. L.

1995-09-01

Binary logic operations on two-dimensional data arrays are achieved by use of the self-imaging properties of Fresnel diffraction. The fields diffracted by periodic objects can be considered as the superimposition of weighted and shifted replicas of original objects. We show that a particular spatial organization of the input data can result in logical operations being performed on these data in the considered diffraction planes. Among various advantages, this approach is shown to allow the implementation of dual-track, nondissipative logical operators. Image algebra is presented as an experimental illustration of this principle.

Hazard avoidance via descent images for safe landing

NASA Astrophysics Data System (ADS)

Yan, Ruicheng; Cao, Zhiguo; Zhu, Lei; Fang, Zhiwen

2013-10-01

In planetary or lunar landing missions, hazard avoidance is critical for landing safety. Therefore, it is very important to correctly detect hazards and effectively find a safe landing area during the last stage of descent. In this paper, we propose a passive sensing based HDA (hazard detection and avoidance) approach via descent images to lower the landing risk. In hazard detection stage, a statistical probability model on the basis of the hazard similarity is adopted to evaluate the image and detect hazardous areas, so that a binary hazard image can be generated. Afterwards, a safety coefficient, which jointly utilized the proportion of hazards in the local region and the inside hazard distribution, is proposed to find potential regions with less hazards in the binary hazard image. By using the safety coefficient in a coarse-to-fine procedure and combining it with the local ISD (intensity standard deviation) measure, the safe landing area is determined. The algorithm is evaluated and verified with many simulated descent downward looking images rendered from lunar orbital satellite images.

Digital image registration method based upon binary boundary maps

NASA Technical Reports Server (NTRS)

Jayroe, R. R., Jr.; Andrus, J. F.; Campbell, C. W.

1974-01-01

A relatively fast method is presented for matching or registering the digital data of imagery from the same ground scene acquired at different times, or from different multispectral images, sensors, or both. It is assumed that the digital images can be registed by using translations and rotations only, that the images are of the same scale, and that little or no distortion exists between images. It is further assumed that by working with several local areas of the image, the rotational effects in the local areas can be neglected. Thus, by treating the misalignments of local areas as translations, it is possible to determine rotational and translational misalignments for a larger portion of the image containing the local areas. This procedure of determining the misalignment and then registering the data according to the misalignment can be repeated until the desired degree of registration is achieved. The method to be presented is based upon the use of binary boundary maps produced from the raw digital imagery rather than the raw digital data.

KIC 7177553: A QUADRUPLE SYSTEM OF TWO CLOSE BINARIES

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehmann, H.; Borkovits, T.; Rappaport, S. A.

2016-03-01

KIC 7177553 was observed by the Kepler satellite to be an eclipsing eccentric binary star system with an 18-day orbital period. Recently, an eclipse timing study of the Kepler binaries has revealed eclipse timing variations (ETVs) in this object with an amplitude of ∼100 s and an outer period of 529 days. The implied mass of the third body is that of a super-Jupiter, but below the mass of a brown dwarf. We therefore embarked on a radial velocity (RV) study of this binary to determine its system configuration and to check the hypothesis that it hosts a giant planet. Frommore » the RV measurements, it became immediately obvious that the same Kepler target contains another eccentric binary, this one with a 16.5-day orbital period. Direct imaging using adaptive optics reveals that the two binaries are separated by 0.″4 (∼167 AU) and have nearly the same magnitude (to within 2%). The close angular proximity of the two binaries and very similar γ velocities strongly suggest that KIC 7177553 is one of the rare SB4 systems consisting of two eccentric binaries where at least one system is eclipsing. Both systems consist of slowly rotating, nonevolved, solar-like stars of comparable masses. From the orbital separation and the small difference in γ velocity, we infer that the period of the outer orbit most likely lies in the range of 1000–3000 yr. New images taken over the next few years, as well as the high-precision astrometry of the Gaia satellite mission, will allow us to set much narrower constraints on the system geometry. Finally, we note that the observed ETVs in the Kepler data cannot be produced by the second binary. Further spectroscopic observations on a longer timescale will be required to prove the existence of the massive planet.« less

Introduction to Permutation and Resampling-Based Hypothesis Tests

ERIC Educational Resources Information Center

LaFleur, Bonnie J.; Greevy, Robert A.

2009-01-01

A resampling-based method of inference--permutation tests--is often used when distributional assumptions are questionable or unmet. Not only are these methods useful for obvious departures from parametric assumptions (e.g., normality) and small sample sizes, but they are also more robust than their parametric counterparts in the presences of…

Explorations in Statistics: Permutation Methods

ERIC Educational Resources Information Center

Curran-Everett, Douglas

2012-01-01

Learning about statistics is a lot like learning about science: the learning is more meaningful if you can actively explore. This eighth installment of "Explorations in Statistics" explores permutation methods, empiric procedures we can use to assess an experimental result--to test a null hypothesis--when we are reluctant to trust statistical…

Orbital motion in pre-main sequence binaries

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schaefer, G. H.; Prato, L.; Simon, M.

2014-06-01

We present results from our ongoing program to map the visual orbits of pre-main sequence (PMS) binaries in the Taurus star forming region using adaptive optics imaging at the Keck Observatory. We combine our results with measurements reported in the literature to analyze the orbital motion for each binary. We present preliminary orbits for DF Tau, T Tau S, ZZ Tau, and the Pleiades binary HBC 351. Seven additional binaries show curvature in their relative motion. Currently, we can place lower limits on the orbital periods for these systems; full solutions will be possible with more orbital coverage. Five othermore » binaries show motion that is indistinguishable from linear motion. We suspect that these systems are bound and might show curvature with additional measurements in the future. The observations reported herein lay critical groundwork toward the goal of measuring precise masses for low-mass PMS stars.« less

Searching for Unresolved Binary Brown Dwarfs

NASA Astrophysics Data System (ADS)

Albretsen, Jacob; Stephens, Denise

2007-10-01

There are currently L and T brown dwarfs (BDs) with errors in their classification of +/- 1 to 2 spectra types. Metallicity and gravitational differences have accounted for some of these discrepancies, and recent studies have shown unresolved binary BDs may offer some explanation as well. However limitations in technology and resources often make it difficult to clearly resolve an object that may be binary in nature. Stephens and Noll (2006) identified statistically strong binary source candidates from Hubble Space Telescope (HST) images of Trans-Neptunian Objects (TNOs) that were apparently unresolved using model point-spread functions for single and binary sources. The HST archive contains numerous observations of BDs using the Near Infrared Camera and Multi-Object Spectrometer (NICMOS) that have never been rigorously analyzed for binary properties. Using methods developed by Stephens and Noll (2006), BD observations from the HST data archive are being analyzed for possible unresolved binaries. Preliminary results will be presented. This technique will identify potential candidates for future observations to determine orbital information.

Clustering biomolecular complexes by residue contacts similarity.

PubMed

Rodrigues, João P G L M; Trellet, Mikaël; Schmitz, Christophe; Kastritis, Panagiotis; Karaca, Ezgi; Melquiond, Adrien S J; Bonvin, Alexandre M J J

2012-07-01

Inaccuracies in computational molecular modeling methods are often counterweighed by brute-force generation of a plethora of putative solutions. These are then typically sieved via structural clustering based on similarity measures such as the root mean square deviation (RMSD) of atomic positions. Albeit widely used, these measures suffer from several theoretical and technical limitations (e.g., choice of regions for fitting) that impair their application in multicomponent systems (N > 2), large-scale studies (e.g., interactomes), and other time-critical scenarios. We present here a simple similarity measure for structural clustering based on atomic contacts--the fraction of common contacts--and compare it with the most used similarity measure of the protein docking community--interface backbone RMSD. We show that this method produces very compact clusters in remarkably short time when applied to a collection of binary and multicomponent protein-protein and protein-DNA complexes. Furthermore, it allows easy clustering of similar conformations of multicomponent symmetrical assemblies in which chain permutations can occur. Simple contact-based metrics should be applicable to other structural biology clustering problems, in particular for time-critical or large-scale endeavors. Copyright © 2012 Wiley Periodicals, Inc.

The Search for Bright Variable Stars in Open Cluster NGC 6819.

NASA Astrophysics Data System (ADS)

Talamantes, Antonio; Sandquist, E. L.

2009-01-01

During this research period data was taken for seven nights at the 1m telescope at Mt. Laguna Observatory for the open cluster NGC 6819. For four of the nights data was taken using a V-band filter. For the three nights remaining nights the data was taken using an R-band filter. Photometry was done using the ISIS image subtraction package. Six new variable stars were located using these techniques. These variable types include a pulsating variable, five detached eclipsing binaries. Of the detached eclipsing binaries, three are near the cluster turnoff and two in the blue straggler region(and one of these has total eclipses). Nine previously known variables(six contact binaries, two detached eclipsing binaries and one near-contact binary) were also studied.

Astrometric and photometric measurements of binary stars with adaptive optics: observations from 2001 to 2006

NASA Astrophysics Data System (ADS)

Roberts, Lewis C.; Mason, Brian D.

2018-02-01

The adaptive optics system at the 3.6 m Advanced Electro-Optical System telescope was used to measure the astrometry and differential magnitude in I band of binary star systems between 2002 and 2006. We report 413 astrometric and photometric measurements of 373 stellar pairs. The astrometric measurements will be of use for future orbital determination, and the photometric measurements will be of use in estimating the spectral types of the component stars. For 21 binaries that had not been observed in decades, we are able to confirm that the systems share common proper motion. Candidate new companions were detected in 24 systems; for these we show the discovery images. Follow-up observations should be able to determine if these systems share common proper motion and are gravitationally bound objects. We computed orbits for nine binaries. Of these, the orbits of five systems are improved compared to prior orbits and four systems have their orbits computed for the first time. In addition, 315 stars were unresolved and the full-width half maxima of the images are presented.

CytometryML binary data standards

NASA Astrophysics Data System (ADS)

Leif, Robert C.

2005-03-01

CytometryML is a proposed new Analytical Cytology (Cytomics) data standard, which is based on a common set of XML schemas for encoding flow cytometry and digital microscopy text based data types (metadata). CytometryML schemas reference both DICOM (Digital Imaging and Communications in Medicine) codes and FCS keywords. Flow Cytometry Standard (FCS) list-mode has been mapped to the DICOM Waveform Information Object. The separation of the large binary data objects (list mode and image data) from the XML description of the metadata permits the metadata to be directly displayed, analyzed, and reported with standard commercial software packages; the direct use of XML languages; and direct interfacing with clinical information systems. The separation of the binary data into its own files simplifies parsing because all extraneous header data has been eliminated. The storage of images as two-dimensional arrays without any extraneous data, such as in the Adobe Photoshop RAW format, facilitates the development by scientists of their own analysis and visualization software. Adobe Photoshop provided the display infrastructure and the translation facility to interconvert between the image data from commercial formats and RAW format. Similarly, the storage and parsing of list mode binary data type with a group of parameters that are specified at compilation time is straight forward. However when the user is permitted at run-time to select a subset of the parameters and/or specify results of mathematical manipulations, the development of special software was required. The use of CytometryML will permit investigators to be able to create their own interoperable data analysis software and to employ commercially available software to disseminate their data.

Quantum Assisted Learning for Registration of MODIS Images

NASA Astrophysics Data System (ADS)

Pelissier, C.; Le Moigne, J.; Fekete, G.; Halem, M.

2017-12-01

The advent of the first large scale quantum annealer by D-Wave has led to an increased interest in quantum computing. However, the quantum annealing computer of the D-Wave is limited to either solving Quadratic Unconstrained Binary Optimization problems (QUBOs) or using the ground state sampling of an Ising system that can be produced by the D-Wave. These restrictions make it challenging to find algorithms to accelerate the computation of typical Earth Science applications. A major difficulty is that most applications have continuous real-valued parameters rather than binary. Here we present an exploratory study using the ground state sampling to train artificial neural networks (ANNs) to carry out image registration of MODIS images. The key idea to using the D-Wave to train networks is that the quantum chip behaves thermally like Boltzmann machines (BMs), and BMs are known to be successful at recognizing patterns in images. The ground state sampling of the D-Wave also depends on the dynamics of the adiabatic evolution and is subject to other non-thermal fluctuations, but the statistics are thought to be similar and ANNs tend to be robust under fluctuations. In light of this, the D-Wave ground state sampling is used to define a Boltzmann like generative model and is investigated to register MODIS images. Image intensities of MODIS images are transformed using a Discrete Cosine Transform and used to train a several layers network to learn how to align images to a reference image. The network layers consist of an initial sigmoid layer acting as a binary filter of the input followed by a strict binarization using Bernoulli sampling, and then fed into a Boltzmann machine. The output is then classified using a soft-max layer. Results are presented and discussed.

Coronal Structures in Cool Stars

NASA Technical Reports Server (NTRS)

Oliversen, Ronald (Technical Monitor); Dupree, Andrea K.

2004-01-01

Many papers have been published that further elucidate the structure of coronas in cool stars as determined from EUVE, HST, FUSE, Chandra, and XMM-Newton observations. In addition we are exploring the effects of coronas on the He I 1083081 transition that is observed in the infrared. Highlights of these are summarized below including publications during this reporting period and presentations. Ground-based magnetic Doppler imaging of cool stars suggests that active stars have active regions located at high latitudes on their surface. We have performed similar imaging in X-ray to locate the sites of enhanced activity using Chandra spectra. Chandra HETG observations of the bright eclipsing contact binary 44i Boo and Chandra LETG observations for the eclipsing binary VW Cep show X-ray line profiles that are Doppler-shifted by orbital motion. After careful analysis of the spectrum of each binary, a composite line-profile is constructed by adding the individual spectral lines. This high signal-to-noise ratio composite line-profile yields orbital velocities for these binaries that are accurate to 30 km/sec and allows their orbital motion to be studied at higher time resolutions. In conjunction with X-ray lightcurves, the phase-binned composite line-profiles constrain coronal structures to be small and located at high latitudes. These observations and techniques show the power of the Doppler Imaging Technique applied to X-ray line emission.

NASA Thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1976-01-01

The NASA Thesaurus -- Volume 2, Access Vocabulary -- contains an alphabetical listing of all Thesaurus terms (postable and nonpostable) and permutations of all multiword and pseudo-multiword terms. Also included are Other Words (non-Thesaurus terms) consisting of abbreviations, chemical symbols, etc. The permutations and Other Words provide 'access' to the appropriate postable entries in the Thesaurus.

A Permutation Test for Correlated Errors in Adjacent Questionnaire Items

ERIC Educational Resources Information Center

Hildreth, Laura A.; Genschel, Ulrike; Lorenz, Frederick O.; Lesser, Virginia M.

2013-01-01

Response patterns are of importance to survey researchers because of the insight they provide into the thought processes respondents use to answer survey questions. In this article we propose the use of structural equation modeling to examine response patterns and develop a permutation test to quantify the likelihood of observing a specific…

The Parity Theorem Shuffle

ERIC Educational Resources Information Center

Smith, Michael D.

2016-01-01

The Parity Theorem states that any permutation can be written as a product of transpositions, but no permutation can be written as a product of both an even number and an odd number of transpositions. Most proofs of the Parity Theorem take several pages of mathematical formalism to complete. This article presents an alternative but equivalent…

Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

ERIC Educational Resources Information Center

Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie

2008-01-01

Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…

Permutation Entropy and Signal Energy Increase the Accuracy of Neuropathic Change Detection in Needle EMG

PubMed Central

2018-01-01

Background and Objective. Needle electromyography can be used to detect the number of changes and morphological changes in motor unit potentials of patients with axonal neuropathy. General mathematical methods of pattern recognition and signal analysis were applied to recognize neuropathic changes. This study validates the possibility of extending and refining turns-amplitude analysis using permutation entropy and signal energy. Methods. In this study, we examined needle electromyography in 40 neuropathic individuals and 40 controls. The number of turns, amplitude between turns, signal energy, and “permutation entropy” were used as features for support vector machine classification. Results. The obtained results proved the superior classification performance of the combinations of all of the above-mentioned features compared to the combinations of fewer features. The lowest accuracy from the tested combinations of features had peak-ratio analysis. Conclusion. Using the combination of permutation entropy with signal energy, number of turns and mean amplitude in SVM classification can be used to refine the diagnosis of polyneuropathies examined by needle electromyography. PMID:29606959

Testing for the Presence of Correlation Changes in a Multivariate Time Series: A Permutation Based Approach.

PubMed

Cabrieto, Jedelyn; Tuerlinckx, Francis; Kuppens, Peter; Hunyadi, Borbála; Ceulemans, Eva

2018-01-15

Detecting abrupt correlation changes in multivariate time series is crucial in many application fields such as signal processing, functional neuroimaging, climate studies, and financial analysis. To detect such changes, several promising correlation change tests exist, but they may suffer from severe loss of power when there is actually more than one change point underlying the data. To deal with this drawback, we propose a permutation based significance test for Kernel Change Point (KCP) detection on the running correlations. Given a requested number of change points K, KCP divides the time series into K + 1 phases by minimizing the within-phase variance. The new permutation test looks at how the average within-phase variance decreases when K increases and compares this to the results for permuted data. The results of an extensive simulation study and applications to several real data sets show that, depending on the setting, the new test performs either at par or better than the state-of-the art significance tests for detecting the presence of correlation changes, implying that its use can be generally recommended.

Multi-scale symbolic transfer entropy analysis of EEG

NASA Astrophysics Data System (ADS)

Yao, Wenpo; Wang, Jun

2017-10-01

From both global and local perspectives, we symbolize two kinds of EEG and analyze their dynamic and asymmetrical information using multi-scale transfer entropy. Multi-scale process with scale factor from 1 to 199 and step size of 2 is applied to EEG of healthy people and epileptic patients, and then the permutation with embedding dimension of 3 and global approach are used to symbolize the sequences. The forward and reverse symbol sequences are taken as the inputs of transfer entropy. Scale factor intervals of permutation and global way are (37, 57) and (65, 85) where the two kinds of EEG have satisfied entropy distinctions. When scale factor is 67, transfer entropy of the healthy and epileptic subjects of permutation, 0.1137 and 0.1028, have biggest difference. And the corresponding values of the global symbolization is 0.0641 and 0.0601 which lies in the scale factor of 165. Research results show that permutation which takes contribution of local information has better distinction and is more effectively applied to our multi-scale transfer entropy analysis of EEG.

A new EEG synchronization strength analysis method: S-estimator based normalized weighted-permutation mutual information.

PubMed

Cui, Dong; Pu, Weiting; Liu, Jing; Bian, Zhijie; Li, Qiuli; Wang, Lei; Gu, Guanghua

2016-10-01

Synchronization is an important mechanism for understanding information processing in normal or abnormal brains. In this paper, we propose a new method called normalized weighted-permutation mutual information (NWPMI) for double variable signal synchronization analysis and combine NWPMI with S-estimator measure to generate a new method named S-estimator based normalized weighted-permutation mutual information (SNWPMI) for analyzing multi-channel electroencephalographic (EEG) synchronization strength. The performances including the effects of time delay, embedding dimension, coupling coefficients, signal to noise ratios (SNRs) and data length of the NWPMI are evaluated by using Coupled Henon mapping model. The results show that the NWPMI is superior in describing the synchronization compared with the normalized permutation mutual information (NPMI). Furthermore, the proposed SNWPMI method is applied to analyze scalp EEG data from 26 amnestic mild cognitive impairment (aMCI) subjects and 20 age-matched controls with normal cognitive function, who both suffer from type 2 diabetes mellitus (T2DM). The proposed methods NWPMI and SNWPMI are suggested to be an effective index to estimate the synchronization strength. Copyright © 2016 Elsevier Ltd. All rights reserved.

Sorting signed permutations by inversions in O(nlogn) time.

PubMed

Swenson, Krister M; Rajan, Vaibhav; Lin, Yu; Moret, Bernard M E

2010-03-01

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inversions, improved algorithms have been designed, culminating with an optimal linear-time algorithm for computing the inversion distance and a subquadratic algorithm for providing a shortest sequence of inversions--also known as sorting by inversions. Remaining open was the question of whether sorting by inversions could be done in O(nlogn) time. In this article, we present a qualified answer to this question, by providing two new sorting algorithms, a simple and fast randomized algorithm and a deterministic refinement. The deterministic algorithm runs in time O(nlogn + kn), where k is a data-dependent parameter. We provide the results of extensive experiments showing that both the average and the standard deviation for k are small constants, independent of the size of the permutation. We conclude (but do not prove) that almost all signed permutations can be sorted by inversions in O(nlogn) time.

Revisiting the European sovereign bonds with a permutation-information-theory approach

NASA Astrophysics Data System (ADS)

Fernández Bariviera, Aurelio; Zunino, Luciano; Guercio, María Belén; Martinez, Lisana B.; Rosso, Osvaldo A.

2013-12-01

In this paper we study the evolution of the informational efficiency in its weak form for seventeen European sovereign bonds time series. We aim to assess the impact of two specific economic situations in the hypothetical random behavior of these time series: the establishment of a common currency and a wide and deep financial crisis. In order to evaluate the informational efficiency we use permutation quantifiers derived from information theory. Specifically, time series are ranked according to two metrics that measure the intrinsic structure of their correlations: permutation entropy and permutation statistical complexity. These measures provide the rectangular coordinates of the complexity-entropy causality plane; the planar location of the time series in this representation space reveals the degree of informational efficiency. According to our results, the currency union contributed to homogenize the stochastic characteristics of the time series and produced synchronization in the random behavior of them. Additionally, the 2008 financial crisis uncovered differences within the apparently homogeneous European sovereign markets and revealed country-specific characteristics that were partially hidden during the monetary union heyday.

The first Doppler images of the eclipsing binary SZ Piscium

NASA Astrophysics Data System (ADS)

Xiang, Yue; Gu, Shenghong; Cameron, A. Collier; Barnes, J. R.; Zhang, Liyun

2016-02-01

We present the first Doppler images of the active eclipsing binary system SZ Psc, based on the high-resolution spectral data sets obtained in 2004 November and 2006 September-December. The least-squares deconvolution technique was applied to derive high signal-to-noise profiles from the observed spectra of SZ Psc. Absorption features contributed by a third component of the system were detected in the LSD profiles at all observed phases. We estimated the mass and period of the third component to be about 0.9 M⊙ and 1283 ± 10 d, respectively. After removing the contribution of the third body from the least-squares deconvolved profiles, we derived the surface maps of SZ Psc. The resulting Doppler images indicate significant star-spot activities on the surface of the K subgiant component. The distributions of star-spots are more complex than that revealed by previous photometric studies. The cooler K component exhibited pronounced high-latitude spots as well as numerous low- and intermediate-latitude spot groups during the entire observing seasons, but did not show any large, stable polar cap, different from many other active RS CVn-type binaries.

Chandra Reveals Nest of Tight Binaries in Dense Cluster

NASA Astrophysics Data System (ADS)

2001-05-01

Scientists have gazed into an incredibly dense star cluster with NASA's Chandra X-ray Observatory and identified a surprising bonanza of binary stars, including a large number of rapidly rotating neutron stars. The discovery may help explain how one of the oldest structures in our Galaxy evolved over its lifetime. By combining Chandra, Hubble Space Telescope, and ground-based radio data, the researchers conducted an important survey of the binary systems that dominate the dynamics of 47 Tucanae, a globular cluster about 12 billion years old located in our Milky Way galaxy. Most of the binaries in 47 Tucanae are systems in which a normal, Sun-like companion orbits a collapsed star, either a white dwarf or a neutron star. White dwarf stars are dense, burnt-out remnants of stars like the Sun, while neutron stars are even denser remains of a more massive star. When matter from a nearby star falls onto either a white dwarf or a neutron star, as in the case with the binaries in 47 Tucanae, X-rays are produced. 47 Tuc This composite image shows relation of the Chandra image of 47 Tucanae to ground-based, optical observations. "This Chandra image provides the first complete census of compact binaries in the core of a globular cluster," said Josh Grindlay of the Harvard-Smithsonian Center for Astrophysics (CfA) and lead author of the report that appears in the May 18 issue of Science. "The relative number of neutron stars versus white dwarfs in these binaries tell us about the development of the first stars in the cluster, and the binaries themselves are key to the evolution of the entire cluster core." Many of the binaries in 47 Tucanae are exotic systems never before seen in such large quantities. Perhaps the most intriguing are the "millisecond pulsars", which contain neutron stars that are rotating extremely rapidly, between 100 to nearly 1000 times a second. "The Chandra data, in conjunction with radio observations, indicate that there are many more millisecond pulsars than we would expect based on the number of their likely progenitors we found," said co-author Peter Edmonds, also of the CfA. "While there is a general consensus on how some of the millisecond pulsars form, these new data suggest that there need to be other methods to create them." In addition to the millisecond pulsars, Chandra also detected other important populations of binary systems, including those with white dwarf stars and normal stars, and others where pairs of normal stars undergo large flares induced by their close proximity. The Chandra data also indicate an apparent absence of a central black hole. Stellar-sized mass black holes -- those about five to ten times as massive as the Sun -- have apparently not coalesced to the center of the star cluster. All or most stellar-sized black holes that formed over the lifetime of the cluster have likely been ejected by their slingshot encounters with binaries deep in the cluster core. "These results show that binary star systems are a source of gravitational energy which ejects stellar mass black holes and prevents the collapse of the cluster’s core to a more massive, central black hole," said the CfA's Craig Heinke. "In other words, binary systems - not black holes - are the dynamical heat engines that drive the evolution of globular clusters." Chandra observed 47 Tucanae on March 16-17, 2000, for a period of 74,000 seconds with the Advanced CCD Imaging Spectrometer (ACIS). The ACIS X-ray camera was developed for NASA by Penn State and the Massachusetts Institute of Technology. The High Energy Transmission Grating Spectrometer was built by MIT. NASA's Marshall Space Flight Center in Huntsville, AL, manages the Chandra program. TRW, Inc., Redondo Beach, California, is the prime contractor for the spacecraft. The Smithsonian's Chandra X-ray Center controls science and flight operations from Cambridge, MA. Images associated with this release are available on the World Wide Web at: http://chandra.harvard.edu AND http://chandra.nasa.gov

Merging Galaxies Create a Binary Quasar

NASA Astrophysics Data System (ADS)

2010-02-01

Astronomers have found the first clear evidence of a binary quasar within a pair of actively merging galaxies. Quasars are the extremely bright centers of galaxies surrounding super-massive black holes, and binary quasars are pairs of quasars bound together by gravity. Binary quasars, like other quasars, are thought to be the product of galaxy mergers. Until now, however, binary quasars have not been seen in galaxies that are unambiguously in the act of merging. But images of a new binary quasar from the Carnegie Institution's Magellan telescope in Chile show two distinct galaxies with "tails" produced by tidal forces from their mutual gravitational attraction. "This is really the first case in which you see two separate galaxies, both with quasars, that are clearly interacting," says Carnegie astronomer John Mulchaey who made observations crucial to understanding the galaxy merger. Most, if not all, large galaxies, such as our galaxy the Milky Way, host super-massive black holes at their centers. Because galaxies regularly interact and merge, astronomers have assumed that binary super-massive black holes have been common in the Universe, especially during its early history. Black holes can only be detected as quasars when they are actively accreting matter, a process that releases vast amounts of energy. A leading theory is that galaxy mergers trigger accretion, creating quasars in both galaxies. Because most such mergers would have happened in the distant past, binary quasars and their associated galaxies are very far away and therefore difficult for most telescopes to resolve. The binary quasar, labeled SDSS J1254+0846, was initially detected by the Sloan Digital Sky Survey, a large scale astronomical survey of galaxies and over 120,000 quasars. Further observations by Paul Green of the Harvard-Smithsonian Center for Astrophysics and colleagues* using NASA's Chandra's X-ray Observatory and telescopes at Kitt Peak National Observatory in Arizona and Palomar Observatory in California indicated that the object was likely a binary quasar in the midst of a galaxy merger. Carnegie's Mulchaey then used the 6.5 meter Baade-Magellan telescope at the Las Campanas observatory in Chile to obtain deeper images and more detailed spectroscopy of the merging galaxies. "Just because you see two galaxies that are close to each other in the sky doesn't mean they are merging," says Mulchaey. "But from the Magellan images we can actually see tidal tails, one from each galaxy, which suggests that the galaxies are in fact interacting and are in the process of merging." Thomas Cox, now a fellow at the Carnegie Observatories, corroborated this conclusion using computer simulations of the merging galaxies. When Cox's model galaxies merged, they showed features remarkably similar to what Mulchaey observed in the Magellan images. "The model verifies the merger origin for this binary quasar system," he says. "It also hints that this kind of galaxy interaction is a key component of the growth of black holes and production of quasars throughout our universe." * The authors of the paper published in the Astrophysical Journal are Paul J. Green of the Harvard-Smithsonian Center for Astrophysics, Adam D. Myers of the University of Illinois at Urbana-Champaign, Wayne A. Barkhouse of the University of North Dakota, John S. Mulchaey of the Observatories of the Carnegie Institution for Science, Vardha N. Bennert of the Department of Physics, University of California, Santa Barbara, Thomas J. Cox of the Observatories of the Carnegie Institution for Science, Thomas L. Aldcroft of the Harvard-Smithsonian Center for Astrophysics, and Joan M. Wrobel of National Radio Astronomy Observatory, Socorro, NM. More information, including images and other multimedia, can be found at: http://chandra.harvard.edu and http://chandra.nasa.gov

Parallel image logical operations using cross correlation

NASA Technical Reports Server (NTRS)

Strong, J. P., III

1972-01-01

Methods are presented for counting areas in an image in a parallel manner using noncoherent optical techniques. The techniques presented include the Levialdi algorithm for counting, optical techniques for binary operations, and cross-correlation.

Development of isothermal-isobaric replica-permutation method for molecular dynamics and Monte Carlo simulations and its application to reveal temperature and pressure dependence of folded, misfolded, and unfolded states of chignolin

NASA Astrophysics Data System (ADS)

Yamauchi, Masataka; Okumura, Hisashi

2017-11-01

We developed a two-dimensional replica-permutation molecular dynamics method in the isothermal-isobaric ensemble. The replica-permutation method is a better alternative to the replica-exchange method. It was originally developed in the canonical ensemble. This method employs the Suwa-Todo algorithm, instead of the Metropolis algorithm, to perform permutations of temperatures and pressures among more than two replicas so that the rejection ratio can be minimized. We showed that the isothermal-isobaric replica-permutation method performs better sampling efficiency than the isothermal-isobaric replica-exchange method and infinite swapping method. We applied this method to a β-hairpin mini protein, chignolin. In this simulation, we observed not only the folded state but also the misfolded state. We calculated the temperature and pressure dependence of the fractions on the folded, misfolded, and unfolded states. Differences in partial molar enthalpy, internal energy, entropy, partial molar volume, and heat capacity were also determined and agreed well with experimental data. We observed a new phenomenon that misfolded chignolin becomes more stable under high-pressure conditions. We also revealed this mechanism of the stability as follows: TYR2 and TRP9 side chains cover the hydrogen bonds that form a β-hairpin structure. The hydrogen bonds are protected from the water molecules that approach the protein as the pressure increases.

A studentized permutation test for three-arm trials in the 'gold standard' design.

PubMed

Mütze, Tobias; Konietschke, Frank; Munk, Axel; Friede, Tim

2017-03-15

The 'gold standard' design for three-arm trials refers to trials with an active control and a placebo control in addition to the experimental treatment group. This trial design is recommended when being ethically justifiable and it allows the simultaneous comparison of experimental treatment, active control, and placebo. Parametric testing methods have been studied plentifully over the past years. However, these methods often tend to be liberal or conservative when distributional assumptions are not met particularly with small sample sizes. In this article, we introduce a studentized permutation test for testing non-inferiority and superiority of the experimental treatment compared with the active control in three-arm trials in the 'gold standard' design. The performance of the studentized permutation test for finite sample sizes is assessed in a Monte Carlo simulation study under various parameter constellations. Emphasis is put on whether the studentized permutation test meets the target significance level. For comparison purposes, commonly used Wald-type tests, which do not make any distributional assumptions, are included in the simulation study. The simulation study shows that the presented studentized permutation test for assessing non-inferiority in three-arm trials in the 'gold standard' design outperforms its competitors, for instance the test based on a quasi-Poisson model, for count data. The methods discussed in this paper are implemented in the R package ThreeArmedTrials which is available on the comprehensive R archive network (CRAN). Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Studies in optical parallel processing. [All optical and electro-optic approaches

NASA Technical Reports Server (NTRS)

Lee, S. H.

1978-01-01

Threshold and A/D devices for converting a gray scale image into a binary one were investigated for all-optical and opto-electronic approaches to parallel processing. Integrated optical logic circuits (IOC) and optical parallel logic devices (OPA) were studied as an approach to processing optical binary signals. In the IOC logic scheme, a single row of an optical image is coupled into the IOC substrate at a time through an array of optical fibers. Parallel processing is carried out out, on each image element of these rows, in the IOC substrate and the resulting output exits via a second array of optical fibers. The OPAL system for parallel processing which uses a Fabry-Perot interferometer for image thresholding and analog-to-digital conversion, achieves a higher degree of parallel processing than is possible with IOC.

Diagnosis of Tempromandibular Disorders Using Local Binary Patterns

PubMed Central

Haghnegahdar, A.A.; Kolahi, S.; Khojastepour, L.; Tajeripour, F.

2018-01-01

Background: Temporomandibular joint disorder (TMD) might be manifested as structural changes in bone through modification, adaptation or direct destruction. We propose to use Local Binary Pattern (LBP) characteristics and histogram-oriented gradients on the recorded images as a diagnostic tool in TMD assessment. Material and Methods: CBCT images of 66 patients (132 joints) with TMD and 66 normal cases (132 joints) were collected and 2 coronal cut prepared from each condyle, although images were limited to head of mandibular condyle. In order to extract features of images, first we use LBP and then histogram of oriented gradients. To reduce dimensionality, the linear algebra Singular Value Decomposition (SVD) is applied to the feature vectors matrix of all images. For evaluation, we used K nearest neighbor (K-NN), Support Vector Machine, Naïve Bayesian and Random Forest classifiers. We used Receiver Operating Characteristic (ROC) to evaluate the hypothesis. Results: K nearest neighbor classifier achieves a very good accuracy (0.9242), moreover, it has desirable sensitivity (0.9470) and specificity (0.9015) results, when other classifiers have lower accuracy, sensitivity and specificity. Conclusion: We proposed a fully automatic approach to detect TMD using image processing techniques based on local binary patterns and feature extraction. K-NN has been the best classifier for our experiments in detecting patients from healthy individuals, by 92.42% accuracy, 94.70% sensitivity and 90.15% specificity. The proposed method can help automatically diagnose TMD at its initial stages. PMID:29732343

The hubs of the human connectome are generally implicated in the anatomy of brain disorders.

PubMed

Crossley, Nicolas A; Mechelli, Andrea; Scott, Jessica; Carletti, Francesco; Fox, Peter T; McGuire, Philip; Bullmore, Edward T

2014-08-01

Brain networks or 'connectomes' include a minority of highly connected hub nodes that are functionally valuable, because their topological centrality supports integrative processing and adaptive behaviours. Recent studies also suggest that hubs have higher metabolic demands and longer-distance connections than other brain regions, and therefore could be considered biologically costly. Assuming that hubs thus normally combine both high topological value and high biological cost, we predicted that pathological brain lesions would be concentrated in hub regions. To test this general hypothesis, we first identified the hubs of brain anatomical networks estimated from diffusion tensor imaging data on healthy volunteers (n = 56), and showed that computational attacks targeted on hubs disproportionally degraded the efficiency of brain networks compared to random attacks. We then prepared grey matter lesion maps, based on meta-analyses of published magnetic resonance imaging data on more than 20 000 subjects and 26 different brain disorders. Magnetic resonance imaging lesions that were common across all brain disorders were more likely to be located in hubs of the normal brain connectome (P < 10(-4), permutation test). Specifically, nine brain disorders had lesions that were significantly more likely to be located in hubs (P < 0.05, permutation test), including schizophrenia and Alzheimer's disease. Both these disorders had significantly hub-concentrated lesion distributions, although (almost completely) distinct subsets of cortical hubs were lesioned in each disorder: temporal lobe hubs specifically were associated with higher lesion probability in Alzheimer's disease, whereas in schizophrenia lesions were concentrated in both frontal and temporal cortical hubs. These results linking pathological lesions to the topological centrality of nodes in the normal diffusion tensor imaging connectome were generally replicated when hubs were defined instead by the meta-analysis of more than 1500 task-related functional neuroimaging studies of healthy volunteers to create a normative functional co-activation network. We conclude that the high cost/high value hubs of human brain networks are more likely to be anatomically abnormal than non-hubs in many (if not all) brain disorders. © The Author (2014). Published by Oxford University Press on behalf of the Guarantors of Brain.

Deficit of Wide Binaries in the η Chamaeleontis Young Cluster

NASA Astrophysics Data System (ADS)

Brandeker, Alexis; Jayawardhana, Ray; Khavari, Parandis; Haisch, Karl E., Jr.; Mardones, Diego

2006-12-01

We have carried out a sensitive high-resolution imaging survey of stars in the young (6-8 Myr), nearby (97 pc) compact cluster around η Chamaeleontis to search for stellar and substellar companions. Our data were obtained using the NACO adaptive optics system on the ESO Very Large Telescope (VLT). Given its youth and proximity, any substellar companions are expected to be luminous, especially in the near-infrared, and thus easier to detect next to their parent stars. Here, we present VLT NACO adaptive optics imaging with companion detection limits for 17 η Cha cluster members, and follow-up VLT ISAAC near-infrared spectroscopy for companion candidates. The widest binary detected is ~0.2", corresponding to the projected separation 20 AU, despite our survey being sensitive down to substellar companions outside 0.3", and planetary-mass objects outside 0.5". This implies that the stellar companion probability outside 0.3" and the brown dwarf companion probability outside 0.5" are less than 0.16 with 95% confidence. We compare the wide binary frequency of η Cha to that of the similarly aged TW Hydrae association and estimate the statistical likelihood that the wide binary probability is equal in both groups to be less than 2×10-4. Even though the η Cha cluster is relatively dense, stellar encounters in its present configuration cannot account for the relative deficit of wide binaries. We thus conclude that the difference in wide binary probability in these two groups provides strong evidence for multiplicity properties being dependent on environment. In two appendices we derive the projected separation probability distribution for binaries, used to constrain physical separations from observed projected separations, and summarize statistical tools useful for multiplicity studies.

Detecting unresolved binary stars in Euclid VIS images

NASA Astrophysics Data System (ADS)

Kuntzer, T.; Courbin, F.

2017-10-01

Measuring a weak gravitational lensing signal to the level required by the next generation of space-based surveys demands exquisite reconstruction of the point-spread function (PSF). However, unresolved binary stars can significantly distort the PSF shape. In an effort to mitigate this bias, we aim at detecting unresolved binaries in realistic Euclid stellar populations. We tested methods in numerical experiments where (I) the PSF shape is known to Euclid requirements across the field of view; and (II) the PSF shape is unknown. We drew simulated catalogues of PSF shapes for this proof-of-concept paper. Following the Euclid survey plan, the objects were observed four times. We propose three methods to detect unresolved binary stars. The detection is based on the systematic and correlated biases between exposures of the same object. One method is a simple correlation analysis, while the two others use supervised machine-learning algorithms (random forest and artificial neural network). In both experiments, we demonstrate the ability of our methods to detect unresolved binary stars in simulated catalogues. The performance depends on the level of prior knowledge of the PSF shape and the shape measurement errors. Good detection performances are observed in both experiments. Full complexity, in terms of the images and the survey design, is not included, but key aspects of a more mature pipeline are discussed. Finding unresolved binaries in objects used for PSF reconstruction increases the quality of the PSF determination at arbitrary positions. We show, using different approaches, that we are able to detect at least binary stars that are most damaging for the PSF reconstruction process. The code corresponding to the algorithms used in this work and all scripts to reproduce the results are publicly available from a GitHub repository accessible via http://lastro.epfl.ch/software

A novel ship CFAR detection algorithm based on adaptive parameter enhancement and wake-aided detection in SAR images

NASA Astrophysics Data System (ADS)

Meng, Siqi; Ren, Kan; Lu, Dongming; Gu, Guohua; Chen, Qian; Lu, Guojun

2018-03-01

Synthetic aperture radar (SAR) is an indispensable and useful method for marine monitoring. With the increase of SAR sensors, high resolution images can be acquired and contain more target structure information, such as more spatial details etc. This paper presents a novel adaptive parameter transform (APT) domain constant false alarm rate (CFAR) to highlight targets. The whole method is based on the APT domain value. Firstly, the image is mapped to the new transform domain by the algorithm. Secondly, the false candidate target pixels are screened out by the CFAR detector to highlight the target ships. Thirdly, the ship pixels are replaced by the homogeneous sea pixels. And then, the enhanced image is processed by Niblack algorithm to obtain the wake binary image. Finally, normalized Hough transform (NHT) is used to detect wakes in the binary image, as a verification of the presence of the ships. Experiments on real SAR images validate that the proposed transform does enhance the target structure and improve the contrast of the image. The algorithm has a good performance in the ship and ship wake detection.

An object recognition method based on fuzzy theory and BP networks

NASA Astrophysics Data System (ADS)

Wu, Chuan; Zhu, Ming; Yang, Dong

2006-01-01

It is difficult to choose eigenvectors when neural network recognizes object. It is possible that the different object eigenvectors is similar or the same object eigenvectors is different under scaling, shifting, rotation if eigenvectors can not be chosen appropriately. In order to solve this problem, the image is edged, the membership function is reconstructed and a new threshold segmentation method based on fuzzy theory is proposed to get the binary image. Moment invariant of binary image is extracted and normalized. Some time moment invariant is too small to calculate effectively so logarithm of moment invariant is taken as input eigenvectors of BP network. The experimental results demonstrate that the proposed approach could recognize the object effectively, correctly and quickly.

Robo-AO Discovery and Basic Characterization of Wide Multiple Star Systems in the Pleiades, Praesepe, and NGC 2264 Clusters

NASA Astrophysics Data System (ADS)

Hillenbrand, Lynne A.; Zhang, Celia; Riddle, Reed L.; Baranec, Christoph; Ziegler, Carl; Law, Nicholas M.; Stauffer, John

2018-02-01

We identify and roughly characterize 66 candidate binary star systems in the Pleiades, Praesepe, and NGC 2264 star clusters, based on robotic adaptive optics imaging data obtained using Robo-AO at the Palomar 60″ telescope. Only ∼10% of our imaged pairs were previously known. We detect companions at red optical wavelengths, with physical separations ranging from a few tens to a few thousands of au. A three-sigma contrast curve generated for each final image provides upper limits to the brightness ratios for any undetected putative companions. The observations are sensitive to companions with a maximum contrast of ∼6m at larger separations. At smaller separations, the mean (best) raw contrast at 2″ is 3.ͫ8 (6m), at 1″ is 3.ͫ0 (4.ͫ5), and at 0.″5 is 1.ͫ9 (3m). Point-spread function subtraction can recover nearly the full contrast in the closer separations. For detected candidate binary pairs, we report separations, position angles, and relative magnitudes. Theoretical isochrones appropriate to the Pleiades and Praesepe clusters are then used to determine the corresponding binary mass ratios, which range from 0.2 to 0.9 in q={m}2/{m}1. For our sample of roughly solar-mass (FGK type) stars in NGC 2264 and sub-solar-mass (K and early M-type) primaries in the Pleiades and Praesepe, the overall binary frequency is measured at ∼15.5% ± 2%. However, this value should be considered a lower limit to the true binary fraction within the specified separation and mass ratio ranges in these clusters, given that complex and uncertain corrections for sensitivity and completeness have not been applied.

A New Color Image Encryption Scheme Using CML and a Fractional-Order Chaotic System

PubMed Central

Wu, Xiangjun; Li, Yang; Kurths, Jürgen

2015-01-01

The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks. PMID:25826602

Mapping spatial patterns with morphological image processing

Treesearch

Peter Vogt; Kurt H. Riitters; Christine Estreguil; Jacek Kozak; Timothy G. Wade; James D. Wickham

2006-01-01

We use morphological image processing for classifying spatial patterns at the pixel level on binary land-cover maps. Land-cover pattern is classified as 'perforated,' 'edge,' 'patch,' and 'core' with higher spatial precision and thematic accuracy compared to a previous approach based on image convolution, while retaining the...

Convolution Comparison Pattern: An Efficient Local Image Descriptor for Fingerprint Liveness Detection

PubMed Central

Gottschlich, Carsten

2016-01-01

We present a new type of local image descriptor which yields binary patterns from small image patches. For the application to fingerprint liveness detection, we achieve rotation invariant image patches by taking the fingerprint segmentation and orientation field into account. We compute the discrete cosine transform (DCT) for these rotation invariant patches and attain binary patterns by comparing pairs of two DCT coefficients. These patterns are summarized into one or more histograms per image. Each histogram comprises the relative frequencies of pattern occurrences. Multiple histograms are concatenated and the resulting feature vector is used for image classification. We name this novel type of descriptor convolution comparison pattern (CCP). Experimental results show the usefulness of the proposed CCP descriptor for fingerprint liveness detection. CCP outperforms other local image descriptors such as LBP, LPQ and WLD on the LivDet 2013 benchmark. The CCP descriptor is a general type of local image descriptor which we expect to prove useful in areas beyond fingerprint liveness detection such as biological and medical image processing, texture recognition, face recognition and iris recognition, liveness detection for face and iris images, and machine vision for surface inspection and material classification. PMID:26844544

Abnormal Image Detection in Endoscopy Videos Using a Filter Bank and Local Binary Patterns

PubMed Central

Nawarathna, Ruwan; Oh, JungHwan; Muthukudage, Jayantha; Tavanapong, Wallapak; Wong, Johnny; de Groen, Piet C.; Tang, Shou Jiang

2014-01-01

Finding mucosal abnormalities (e.g., erythema, blood, ulcer, erosion, and polyp) is one of the most essential tasks during endoscopy video review. Since these abnormalities typically appear in a small number of frames (around 5% of the total frame number), automated detection of frames with an abnormality can save physician’s time significantly. In this paper, we propose a new multi-texture analysis method that effectively discerns images showing mucosal abnormalities from the ones without any abnormality since most abnormalities in endoscopy images have textures that are clearly distinguishable from normal textures using an advanced image texture analysis method. The method uses a “texton histogram” of an image block as features. The histogram captures the distribution of different “textons” representing various textures in an endoscopy image. The textons are representative response vectors of an application of a combination of Leung and Malik (LM) filter bank (i.e., a set of image filters) and a set of Local Binary Patterns on the image. Our experimental results indicate that the proposed method achieves 92% recall and 91.8% specificity on wireless capsule endoscopy (WCE) images and 91% recall and 90.8% specificity on colonoscopy images. PMID:25132723

Statistical validation of normal tissue complication probability models.

PubMed

Xu, Cheng-Jian; van der Schaaf, Arjen; Van't Veld, Aart A; Langendijk, Johannes A; Schilstra, Cornelis

2012-09-01

To investigate the applicability and value of double cross-validation and permutation tests as established statistical approaches in the validation of normal tissue complication probability (NTCP) models. A penalized regression method, LASSO (least absolute shrinkage and selection operator), was used to build NTCP models for xerostomia after radiation therapy treatment of head-and-neck cancer. Model assessment was based on the likelihood function and the area under the receiver operating characteristic curve. Repeated double cross-validation showed the uncertainty and instability of the NTCP models and indicated that the statistical significance of model performance can be obtained by permutation testing. Repeated double cross-validation and permutation tests are recommended to validate NTCP models before clinical use. Copyright © 2012 Elsevier Inc. All rights reserved.

Binary Cepheids: Separations and Mass Ratios in 5 M ⊙ Binaries

NASA Astrophysics Data System (ADS)

Evans, Nancy Evans; Bond, Howard E.; Schaefer, Gail H.; Mason, Brian D.; Karovska, Margarita; Tingle, Evan

2013-10-01

Deriving the distribution of binary parameters for a particular class of stars over the full range of orbital separations usually requires the combination of results from many different observing techniques (radial velocities, interferometry, astrometry, photometry, direct imaging), each with selection biases. However, Cepheids—cool, evolved stars of ~5 M ⊙—are a special case because ultraviolet (UV) spectra will immediately reveal any companion star hotter than early type A, regardless of the orbital separation. We have used International Ultraviolet Explorer UV spectra of a complete sample of all 76 Cepheids brighter than V = 8 to create a list of all 18 Cepheids with companions more massive than 2.0 M ⊙. Orbital periods of many of these binaries are available from radial-velocity studies, or can be estimated for longer-period systems from detected velocity variability. In an imaging survey with the Hubble Space Telescope Wide Field Camera 3, we resolved three of the companions (those of η Aql, S Nor, and V659 Cen), allowing us to make estimates of the periods out to the long-period end of the distribution. Combining these separations with orbital data in the literature, we derive an unbiased distribution of binary separations, orbital periods, and mass ratios. The distribution of orbital periods shows that the 5 M ⊙ binaries have systematically shorter periods than do 1 M ⊙ stars. Our data also suggest that the distribution of mass ratios depends on both binary separation and system multiplicity. The distribution of mass ratios as a function of orbital separation, however, does not depend on whether a system is a binary or a triple. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained by the Space Telescope Science Institute. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555.

Chandra X-Ray and Hubble Space Telescope Imaging of Optically Selected Kiloparsec-scale Binary Active Galactic Nuclei. II. Host Galaxy Morphology and AGN Activity

NASA Astrophysics Data System (ADS)

Shangguan, Jinyi; Liu, Xin; Ho, Luis C.; Shen, Yue; Peng, Chien Y.; Greene, Jenny E.; Strauss, Michael A.

2016-05-01

Binary active galactic nuclei (AGNs) provide clues to how gas-rich mergers trigger and fuel AGNs and how supermassive black hole (SMBH) pairs evolve in a gas-rich environment. While significant effort has been invested in their identification, the detailed properties of binary AGNs and their host galaxies are still poorly constrained. In a companion paper, we examined the nature of ionizing sources in the double nuclei of four kiloparsec-scale binary AGNs with redshifts between 0.1 and 0.2. Here, we present their host galaxy morphology based on F336W (U-band) and F105W (Y-band) images taken by the Wide Field Camera 3 on board the Hubble Space Telescope. Our targets have double-peaked narrow emission lines and were confirmed to host binary AGNs with follow-up observations. We find that kiloparsec-scale binary AGNs occur in galaxy mergers with diverse morphological types. There are three major mergers with intermediate morphologies and a minor merger with a dominant disk component. We estimate the masses of the SMBHs from their host bulge stellar masses and obtain Eddington ratios for each AGN. Compared with a representative control sample drawn at the same redshift and stellar mass, the AGN luminosities and Eddington ratios of our binary AGNs are similar to those of single AGNs. The U - Y color maps indicate that clumpy star-forming regions could significantly affect the X-ray detection of binary AGNs, e.g., the hardness ratio. Considering the weak X-ray emission in AGNs triggered in merger systems, we suggest that samples of X-ray-selected AGNs may be biased against gas-rich mergers. Based, in part, on observations made with the NASA/ESA Hubble Space Telescope, obtained at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with program number GO 12363.

Using Model Point Spread Functions to Identifying Binary Brown Dwarf Systems

NASA Astrophysics Data System (ADS)

Matt, Kyle; Stephens, Denise C.; Lunsford, Leanne T.

2017-01-01

A Brown Dwarf (BD) is a celestial object that is not massive enough to undergo hydrogen fusion in its core. BDs can form in pairs called binaries. Due to the great distances between Earth and these BDs, they act as point sources of light and the angular separation between binary BDs can be small enough to appear as a single, unresolved object in images, according to Rayleigh Criterion. It is not currently possible to resolve some of these objects into separate light sources. Stephens and Noll (2006) developed a method that used model point spread functions (PSFs) to identify binary Trans-Neptunian Objects, we will use this method to identify binary BD systems in the Hubble Space Telescope archive. This method works by comparing model PSFs of single and binary sources to the observed PSFs. We also use a method to compare model spectral data for single and binary fits to determine the best parameter values for each component of the system. We describe these methods, its challenges and other possible uses in this poster.

Towards constructing multi-bit binary adder based on Belousov-Zhabotinsky reaction

NASA Astrophysics Data System (ADS)

Zhang, Guo-Mao; Wong, Ieong; Chou, Meng-Ta; Zhao, Xin

2012-04-01

It has been proposed that the spatial excitable media can perform a wide range of computational operations, from image processing, to path planning, to logical and arithmetic computations. The realizations in the field of chemical logical and arithmetic computations are mainly concerned with single simple logical functions in experiments. In this study, based on Belousov-Zhabotinsky reaction, we performed simulations toward the realization of a more complex operation, the binary adder. Combining with some of the existing functional structures that have been verified experimentally, we designed a planar geometrical binary adder chemical device. Through numerical simulations, we first demonstrated that the device can implement the function of a single-bit full binary adder. Then we show that the binary adder units can be further extended in plane, and coupled together to realize a two-bit, or even multi-bit binary adder. The realization of chemical adders can guide the constructions of other sophisticated arithmetic functions, ultimately leading to the implementation of chemical computer and other intelligent systems.

Optimizing binary phase and amplitude filters for PCE, SNR, and discrimination

NASA Technical Reports Server (NTRS)

Downie, John D.

1992-01-01

Binary phase-only filters (BPOFs) have generated much study because of their implementation on currently available spatial light modulator devices. On polarization-rotating devices such as the magneto-optic spatial light modulator (SLM), it is also possible to encode binary amplitude information into two SLM transmission states, in addition to the binary phase information. This is done by varying the rotation angle of the polarization analyzer following the SLM in the optical train. Through this parameter, a continuum of filters may be designed that span the space of binary phase and amplitude filters (BPAFs) between BPOFs and binary amplitude filters. In this study, we investigate the design of optimal BPAFs for the key correlation characteristics of peak sharpness (through the peak-to-correlation energy (PCE) metric), signal-to-noise ratio (SNR), and discrimination between in-class and out-of-class images. We present simulation results illustrating improvements obtained over conventional BPOFs, and trade-offs between the different performance criteria in terms of the filter design parameter.

Orbitally modulated dust formation by the WC7+O5 colliding-wind binary WR140

NASA Astrophysics Data System (ADS)

Williams, P. M.; Marchenko, S. V.; Marston, A. P.; Moffat, A. F. J.; Varricatt, W. P.; Dougherty, S. M.; Kidger, M. R.; Morbidelli, L.; Tapia, M.

2009-05-01

We present high-resolution infrared (2-18 μm) images of the archetypal periodic dust-making Wolf-Rayet binary system WR140 (HD 193793) taken between 2001 and 2005, and multi-colour (J - [19.5]) photometry observed between 1989 and 2001. The images resolve the dust cloud formed by WR140 in 2001, allowing us to track its expansion and cooling, while the photometry allows tracking the average temperature and total mass of the dust. The combination of the two data sets constrains the optical properties of the dust, and suggests that they differ from those of the dust made by the WC9 dust-makers, including the classical `pinwheel', WR104. The photometry of individual dust emission features shows them to be significantly redder in (nbL'-[3.99]), but bluer in ([7.9]-[12.5]), than the binary, as expected from the spectra of heated dust and the stellar wind of a Wolf-Rayet star. The most persistent dust features, two concentrations at the ends of a `bar' of emission to the south of the star, were observed to move with constant proper motions of 324 +/- 8 and 243 +/- 7 mas yr-1. Longer wavelength (4.68 and 12.5 μm) images show dust emission from the corresponding features from the previous (1993) periastron passage and dust formation episode, showing that the dust expanded freely in a low-density void for over a decade, with dust features repeating from one cycle to the next. A third persistent dust concentration to the east of the binary (the `arm') was found to have a proper motion ~320 mas yr-1, and a dust mass about one-quarter that of the `bar'. Extrapolation of the motions of the concentrations back to the binary suggests that the eastern `arm' began expansion four to five months earlier than those in the southern `bar', consistent with the projected rotation of the binary axis and wind-collision region (WCR) on the sky. A comparison of model dust images and the observations constrains the intervals when the WCR was producing sufficiently compressed wind for dust nucleation in the WCR, and suggests that the distribution of this material was not uniform about the axis of the WCR, but more abundant in the following edge in the orbital plane.

Stereo matching image processing by synthesized color and the characteristic area by the synthesized color

NASA Astrophysics Data System (ADS)

Akiyama, Akira; Mutoh, Eiichiro; Kumagai, Hideo

2014-09-01

We have developed the stereo matching image processing by synthesized color and the corresponding area by the synthesized color for ranging the object and image recognition. The typical images from a pair of the stereo imagers may have some image disagreement each other due to the size change, missed place, appearance change and deformation of characteristic area. We constructed the synthesized color and corresponding color area with the same synthesized color to make the distinct stereo matching. We constructed the synthesized color and corresponding color area with the same synthesized color by the 3 steps. The first step is making binary edge image by differentiating the focused image from each imager and verifying that differentiated image has normal density of frequency distribution to find the threshold level of binary procedure. We used Daubechies wavelet transformation for the procedures of differentiating in this study. The second step is deriving the synthesized color by averaging color brightness between binary edge points with respect to horizontal direction and vertical direction alternatively. The averaging color procedure was done many times until the fluctuation of averaged color become negligible with respect to 256 levels in brightness. The third step is extracting area with same synthesized color by collecting the pixel of same synthesized color and grouping these pixel points by 4 directional connectivity relations. The matching areas for the stereo matching are determined by using synthesized color areas. The matching point is the center of gravity of each synthesized color area. The parallax between a pair of images is derived by the center of gravity of synthesized color area easily. The experiment of this stereo matching was done for the object of the soccer ball toy. From this experiment we showed that stereo matching by the synthesized color technique are simple and effective.

Restoration of moving binary images degraded owing to phosphor persistence.

PubMed

Cherri, A K; Awwal, A A; Karim, M A; Moon, D L

1991-09-10

The degraded images of dynamic objects obtained by using a phosphor-based electro-optical display are analyzed in terms of dynamic modulation transfer function (DMTF) and temporal characteristics of the display system. The direct correspondence between the DMTF and image smear is used in developing real-time techniques for the restoration of degraded images.

EPIC 219217635: A Doubly Eclipsing Quadruple System Containing an Evolved Binary

NASA Astrophysics Data System (ADS)

Borkovits, T.; Albrecht, S.; Rappaport, S.; Nelson, L.; Vanderburg, A.; Gary, B. L.; Tan, T. G.; Justesen, A. B.; Kristiansen, M. H.; Jacobs, T. L.; LaCourse, D.; Ngo, H.; Wallack, N.; Ruane, G.; Mawet, D.; Howell, S. B.; Tronsgaard, R.

2018-05-01

We have discovered a doubly eclipsing, bound, quadruple star system in the field of K2 Campaign 7. EPIC 219217635 is a stellar image with Kp = 12.7 that contains an eclipsing binary (`EB') with PA = 3.59470 d and a second EB with PB = 0.61825 d. We have obtained followup radial-velocity (`RV') spectroscopy observations, adaptive optics imaging, as well as ground-based photometric observations. From our analysis of all the observations, we derive good estimates for a number of the system parameters. We conclude that (1) both binaries are bound in a quadruple star system; (2) a linear trend to the RV curve of binary A is found over a 2-year interval, corresponding to an acceleration, \\dot{γ }= 0.0024 ± 0.0007 cm s-2; (3) small irregular variations are seen in the eclipse-timing variations (`ETVs') detected over the same interval; (4) the orbital separation of the quadruple system is probably in the range of 8-25 AU; and (5) the orbital planes of the two binaries must be inclined with respect to each other by at least 25°. In addition, we find that binary B is evolved, and the cooler and currently less massive star has transferred much of its envelope to the currently more massive star. We have also demonstrated that the system is sufficiently bright that the eclipses can be followed using small ground-based telescopes, and that this system may be profitably studied over the next decade when the outer orbit of the quadruple is expected to manifest itself in the ETV and/or RV curves.

The formation mechanism of 4179 Toutatis' elongated bilobed structure in a close Earth encounter scenario

NASA Astrophysics Data System (ADS)

Hu, Shoucun; Ji, Jianghui; Richardson, Derek C.; Zhao, Yuhui; Zhang, Yun

2018-07-01

The optical images of near-Earth asteroid 4179 Toutatis acquired by Chang'e-2 spacecraft show that Toutatis has an elongated contact binary configuration, with the contact point located along the long axis. We speculate that such configuration may have resulted from a low-speed impact between two components. In this work, we performed a series of numerical simulations and compared the results with the optical images, to examine the mechanism and better understand the formation of Toutatis. Herein, we propose a scenario that an assumed separated binary precursor could undergo a close encounter with Earth, leading to an impact between the primary and secondary, and the elongation is caused by Earth's tide. The precursor is assumed to be a doubly synchronous binary with a semimajor axis of 4Rp (radius of primary) and the two components are represented as spherical cohesionless self-gravitating granular aggregates. The mutual orbits are simulated in a Monte Carlo routine to provide appropriate parameters for our N-body simulations of impact and tidal distortion. We employ the PKDGRAV package with a soft-sphere discrete element method to explore the entire scenarios. The results show that contact binary configurations are natural outcomes under this scenario, whereas the shape of the primary is almost not affected by the impact of the secondary. However, our simulations further provide an elongated contact binary configuration best matching to the shape of Toutatis at an approaching distance rp = 1.4-1.5 Re (Earth radius), indicative of a likely formation scenario for configurations of Toutatis-like elongated contact binaries.

The formation mechanism of 4179 Toutatis' elongated bi-lobed structure in a close Earth encounter scenario

NASA Astrophysics Data System (ADS)

Hu, Shoucun; Ji, Jianghui; Richardson, Derek C.; Zhao, Yuhui; Zhang, Yun

2018-04-01

The optical images of near-Earth asteroid 4179 Toutatis acquired by Chang'e-2 spacecraft show that Toutatis has an elongated contact binary configuration, with the contact point located along the long axis. We speculate that such configuration may have resulted from a low-speed impact between two components. In this work, we performed a series of numerical simulations and compared the results with the optical images, to examine the mechanism and better understand the formation of Toutatis. Herein we propose an scenario that an assumed separated binary precursor could undergo a close encounter with Earth, leading to an impact between the primary and secondary, and the elongation is caused by Earth's tide. The precursor is assumed to be a doubly synchronous binary with a semi-major axis of 4 Rp (radius of primary) and the two components are represented as spherical cohesionless self-gravitating granular aggregates. The mutual orbits are simulated in a Monte Carlo routine to provide appropriate parameters for our N-body simulations of impact and tidal distortion. We employ the pkdgrav package with a soft-sphere discrete element method (SSDEM) to explore the entire scenarios. The results show that contact binary configurations are natural outcomes under this scenario, whereas the shape of the primary is almost not affected by the impact of the secondary. However, our simulations further provide an elongated contact binary configuration best-matching to the shape of Toutatis at an approaching distance rp = 1.4 ˜ 1.5 Re (Earth radius), indicative of a likely formation scenario for configurations of Toutatis-like elongated contact binaries.

Fast Localization in Large-Scale Environments Using Supervised Indexing of Binary Features.

PubMed

Youji Feng; Lixin Fan; Yihong Wu

2016-01-01

The essence of image-based localization lies in matching 2D key points in the query image and 3D points in the database. State-of-the-art methods mostly employ sophisticated key point detectors and feature descriptors, e.g., Difference of Gaussian (DoG) and Scale Invariant Feature Transform (SIFT), to ensure robust matching. While a high registration rate is attained, the registration speed is impeded by the expensive key point detection and the descriptor extraction. In this paper, we propose to use efficient key point detectors along with binary feature descriptors, since the extraction of such binary features is extremely fast. The naive usage of binary features, however, does not lend itself to significant speedup of localization, since existing indexing approaches, such as hierarchical clustering trees and locality sensitive hashing, are not efficient enough in indexing binary features and matching binary features turns out to be much slower than matching SIFT features. To overcome this, we propose a much more efficient indexing approach for approximate nearest neighbor search of binary features. This approach resorts to randomized trees that are constructed in a supervised training process by exploiting the label information derived from that multiple features correspond to a common 3D point. In the tree construction process, node tests are selected in a way such that trees have uniform leaf sizes and low error rates, which are two desired properties for efficient approximate nearest neighbor search. To further improve the search efficiency, a probabilistic priority search strategy is adopted. Apart from the label information, this strategy also uses non-binary pixel intensity differences available in descriptor extraction. By using the proposed indexing approach, matching binary features is no longer much slower but slightly faster than matching SIFT features. Consequently, the overall localization speed is significantly improved due to the much faster key point detection and descriptor extraction. It is empirically demonstrated that the localization speed is improved by an order of magnitude as compared with state-of-the-art methods, while comparable registration rate and localization accuracy are still maintained.

Phase Holograms In PMMA

NASA Technical Reports Server (NTRS)

Maker, Paul D.; Muller, Richard E.

1994-01-01

Complex, computer-generated phase holograms written in thin films of poly(methyl methacrylate) (PMMA) by process of electron-beam exposure followed by chemical development. Spatial variations of phase delay in holograms quasi-continuous, as distinquished from stepwise as in binary phase holograms made by integrated-circuit fabrication. Holograms more precise than binary holograms. Greater continuity and precision results in decreased scattering loss and increased imaging efficiency.

Binary image classification

NASA Technical Reports Server (NTRS)

Morris, Carl N.

1987-01-01

Motivated by the LANDSAT problem of estimating the probability of crop or geological types based on multi-channel satellite imagery data, Morris and Kostal (1983), Hill, Hinkley, Kostal, and Morris (1984), and Morris, Hinkley, and Johnston (1985) developed an empirical Bayes approach to this problem. Here, researchers return to those developments, making certain improvements and extensions, but restricting attention to the binary case of only two attributes.

NASA thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1985-01-01

The Access Vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries, and pseudo-multiword terms that are permutations of words that contain words within words. The Access Vocabulary contains 40,738 entries that give increased access to the hierarchies in Volume 1 - Hierarchical Listing.

NASA Thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1982-01-01

The Access Vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries, and pseudo-multiword terms that are permutations of words that contain words within words. The Access Vocabulary contains, 40,661 entries that give increased access to he hierarchies in Volume 1 - Hierarchical Listing.

Instability of Hierarchical Cluster Analysis Due to Input Order of the Data: The PermuCLUSTER Solution

ERIC Educational Resources Information Center

van der Kloot, Willem A.; Spaans, Alexander M. J.; Heiser, Willem J.

2005-01-01

Hierarchical agglomerative cluster analysis (HACA) may yield different solutions under permutations of the input order of the data. This instability is caused by ties, either in the initial proximity matrix or arising during agglomeration. The authors recommend to repeat the analysis on a large number of random permutations of the rows and columns…

Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

Rivera-Ruiz, C. M.; de Lima, E. F.; Fanchini, F. F.; Lopez-Richard, V.; Castelano, L. K.

2018-03-01

The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with a fidelity higher than 0.9997, when noise is not taken into account. Particularly, these quantum gates were chosen to perform the permutation algorithm in hybrid qubits in double quantum dots (DQDs). The permutation algorithm is an oracle based quantum algorithm that solves the problem of the permutation parity faster than a classical algorithm without the necessity of entanglement between particles. The only requirement for achieving the speedup is the use of a one-particle quantum system with at least three levels. The high fidelity found in our results is closely related to the quantum speed limit, which is a measure of how fast a quantum state can be manipulated. Furthermore, we model charge noise by considering an average over the optimal field centered at different values of the reference detuning, which follows a Gaussian distribution. When the Gaussian spread is of the order of 5 μ eV (10% of the correct value), the fidelity is still higher than 0.95. Our scheme also can be used for the practical realization of different quantum algorithms in DQDs.

Weighted multiscale Rényi permutation entropy of nonlinear time series

NASA Astrophysics Data System (ADS)

Chen, Shijian; Shang, Pengjian; Wu, Yue

2018-04-01

In this paper, based on Rényi permutation entropy (RPE), which has been recently suggested as a relative measure of complexity in nonlinear systems, we propose multiscale Rényi permutation entropy (MRPE) and weighted multiscale Rényi permutation entropy (WMRPE) to quantify the complexity of nonlinear time series over multiple time scales. First, we apply MPRE and WMPRE to the synthetic data and make a comparison of modified methods and RPE. Meanwhile, the influence of the change of parameters is discussed. Besides, we interpret the necessity of considering not only multiscale but also weight by taking the amplitude into account. Then MRPE and WMRPE methods are employed to the closing prices of financial stock markets from different areas. By observing the curves of WMRPE and analyzing the common statistics, stock markets are divided into 4 groups: (1) DJI, S&P500, and HSI, (2) NASDAQ and FTSE100, (3) DAX40 and CAC40, and (4) ShangZheng and ShenCheng. Results show that the standard deviations of weighted methods are smaller, showing WMRPE is able to ensure the results more robust. Besides, WMPRE can provide abundant dynamical properties of complex systems, and demonstrate the intrinsic mechanism.

PsiQuaSP-A library for efficient computation of symmetric open quantum systems.

PubMed

Gegg, Michael; Richter, Marten

2017-11-24

In a recent publication we showed that permutation symmetry reduces the numerical complexity of Lindblad quantum master equations for identical multi-level systems from exponential to polynomial scaling. This is important for open system dynamics including realistic system bath interactions and dephasing in, for instance, the Dicke model, multi-Λ system setups etc. Here we present an object-oriented C++ library that allows to setup and solve arbitrary quantum optical Lindblad master equations, especially those that are permutationally symmetric in the multi-level systems. PsiQuaSP (Permutation symmetry for identical Quantum Systems Package) uses the PETSc package for sparse linear algebra methods and differential equations as basis. The aim of PsiQuaSP is to provide flexible, storage efficient and scalable code while being as user friendly as possible. It is easily applied to many quantum optical or quantum information systems with more than one multi-level system. We first review the basics of the permutation symmetry for multi-level systems in quantum master equations. The application of PsiQuaSP to quantum dynamical problems is illustrated with several typical, simple examples of open quantum optical systems.

Confidence intervals and hypothesis testing for the Permutation Entropy with an application to epilepsy

NASA Astrophysics Data System (ADS)

Traversaro, Francisco; O. Redelico, Francisco

2018-04-01

In nonlinear dynamics, and to a lesser extent in other fields, a widely used measure of complexity is the Permutation Entropy. But there is still no known method to determine the accuracy of this measure. There has been little research on the statistical properties of this quantity that characterize time series. The literature describes some resampling methods of quantities used in nonlinear dynamics - as the largest Lyapunov exponent - but these seems to fail. In this contribution, we propose a parametric bootstrap methodology using a symbolic representation of the time series to obtain the distribution of the Permutation Entropy estimator. We perform several time series simulations given by well-known stochastic processes: the 1/fα noise family, and show in each case that the proposed accuracy measure is as efficient as the one obtained by the frequentist approach of repeating the experiment. The complexity of brain electrical activity, measured by the Permutation Entropy, has been extensively used in epilepsy research for detection in dynamical changes in electroencephalogram (EEG) signal with no consideration of the variability of this complexity measure. An application of the parametric bootstrap methodology is used to compare normal and pre-ictal EEG signals.

Software implementation of the SKIPSM paradigm under PIP

NASA Astrophysics Data System (ADS)

Hack, Ralf; Waltz, Frederick M.; Batchelor, Bruce G.

1997-09-01

SKIPSM (separated-kernel image processing using finite state machines) is a technique for implementing large-kernel binary- morphology operators and many other operations. While earlier papers on SKIPSM concentrated mainly on implementations using pipelined hardware, there is considerable scope for achieving major speed improvements in software systems. Using identical control software, one-pass binary erosion and dilation structuring elements (SEs) ranging from the trivial (3 by 3) to the gigantic (51 by 51, or even larger), are readily available. Processing speed is independent of the size of the SE, making the SKIPSM approach practical for work with very large SEs on ordinary desktop computers. PIP (prolog image processing) is an interactive machine vision prototyping environment developed at the University of Wales Cardiff. It consists of a large number of image processing operators embedded within the standard AI language Prolog. This paper describes the SKIPSM implementation of binary morphology operators within PIP. A large set of binary erosion and dilation operations (circles, squares, diamonds, octagons, etc.) is available to the user through a command-line driven dialogue, via pull-down menus, or incorporated into standard (Prolog) programs. Little has been done thus far to optimize speed on this first software implementation of SKIPSM. Nevertheless, the results are impressive. The paper describes sample applications and presents timing figures. Readers have the opportunity to try out these operations on demonstration software written by the University of Wales, or via their WWW home page at http://bruce.cs.cf.ac.uk/bruce/index.html .

Establishing Extreme Dynamic Range with JWST: Decoding Smoke Signals in the Glare of a Wolf-Rayet Binary

NASA Astrophysics Data System (ADS)

Lau, Ryan; Hankins, M.; Kasliwal, M.; Sivaramakrishnan, A.; Thatte, D.

2017-11-01

Dust is a key ingredient in the formation of stars and planets. However, the dominant channels of dust production throughout cosmic time are still unclear. With its unprecedented sensitivity and spatial resolution in the mid-IR, the James Webb Space Telescope (JWST) is the ideal platform to address this issue by investigating the dust abundance, composition, and production rates of various dusty sources. In particular, colliding-wind Wolf-Rayet (WR) binaries are efficient dust producers in the local Universe, and likely existed in the earliest galaxies. To study these interesting objects, we propose JWST observations of the archetypal colliding-wind binary WR 140 to study its dust composition, abundance, and formation mechanisms. We will utilize two key JWST observing modes with the medium resolution spectrometer (MRS) on the Mid-Infrared Instrument (MIRI) and the Aperture Masking Interferometry (AMI) mode with the Near Infrared Imager and Slitless Spectrograph (NIRISS). Our proposed observations will yield high impact scientific results on the dust forming properties WR binaries, and establish a benchmark for key observing modes for imaging bright sources with faint extended emission. This will be valuable in various astrophysical contexts including mass-loss from evolved stars, dusty tori around active galactic nuclei, and protoplanetary disks. We are committed to designing and delivering science-enabling products for the JWST community that address technical issues such as bright source artifacts that will limit the maximum achievable image contrast.

Imaging accretion sources and circumbinary disks in young brown dwarfs

NASA Astrophysics Data System (ADS)

Reiners, Ansgar

2010-09-01

We propose to obtain deep WFC3/UVIS imaging observations of two accreting, nearby, young brown dwarf binaries. The first, 2M1207, is a brown dwarf with a planetary mass companion that became a benchmark in low-mass star formation and low-mass evolutionary models. The second, 2M0041, is a nearby young brown dwarf with clear evidence for accretion, but its space motion suggests a slightly higher age than the canonical accretion lifetime of 5-10 Myr. It has recently been discovered to be a binary and is likely to become a second benchmark object in this field. With narrow band images centered on the Halpha line that is indicative of accretion, we aim to determine the accretion ratio between the two components in each system. Halpha was observed in both systems but so far not spatially resolved. In particular, we want to search for accretion in the planetary mass companion of 2M1207. The evidence for accretion in 2M0041 and the possibility that it is in fact older than 10Myr suggests that the accretion lifetime is longer in brown dwarfs than in stars, and in particular that it is longer in brown dwarf binaries. Accretion could be sustained for a longer time if the accreting material is replenished by a circumbinary disk that might exist in both systems. We propose deep WFC/UVIS observations in the optical to search for circumbinary disks, similar to the famous disk around the binary TTauri system GG Tau.

Automatic assessment of mitral regurgitation severity based on extensive textural features on 2D echocardiography videos.

PubMed

Moghaddasi, Hanie; Nourian, Saeed

2016-06-01

Heart disease is the major cause of death as well as a leading cause of disability in the developed countries. Mitral Regurgitation (MR) is a common heart disease which does not cause symptoms until its end stage. Therefore, early diagnosis of the disease is of crucial importance in the treatment process. Echocardiography is a common method of diagnosis in the severity of MR. Hence, a method which is based on echocardiography videos, image processing techniques and artificial intelligence could be helpful for clinicians, especially in borderline cases. In this paper, we introduce novel features to detect micro-patterns of echocardiography images in order to determine the severity of MR. Extensive Local Binary Pattern (ELBP) and Extensive Volume Local Binary Pattern (EVLBP) are presented as image descriptors which include details from different viewpoints of the heart in feature vectors. Support Vector Machine (SVM), Linear Discriminant Analysis (LDA) and Template Matching techniques are used as classifiers to determine the severity of MR based on textural descriptors. The SVM classifier with Extensive Uniform Local Binary Pattern (ELBPU) and Extensive Volume Local Binary Pattern (EVLBP) have the best accuracy with 99.52%, 99.38%, 99.31% and 99.59%, respectively, for the detection of Normal, Mild MR, Moderate MR and Severe MR subjects among echocardiography videos. The proposed method achieves 99.38% sensitivity and 99.63% specificity for the detection of the severity of MR and normal subjects. Copyright © 2016 Elsevier Ltd. All rights reserved.

Median Robust Extended Local Binary Pattern for Texture Classification.

PubMed

Liu, Li; Lao, Songyang; Fieguth, Paul W; Guo, Yulan; Wang, Xiaogang; Pietikäinen, Matti

2016-03-01

Local binary patterns (LBP) are considered among the most computationally efficient high-performance texture features. However, the LBP method is very sensitive to image noise and is unable to capture macrostructure information. To best address these disadvantages, in this paper, we introduce a novel descriptor for texture classification, the median robust extended LBP (MRELBP). Different from the traditional LBP and many LBP variants, MRELBP compares regional image medians rather than raw image intensities. A multiscale LBP type descriptor is computed by efficiently comparing image medians over a novel sampling scheme, which can capture both microstructure and macrostructure texture information. A comprehensive evaluation on benchmark data sets reveals MRELBP's high performance-robust to gray scale variations, rotation changes and noise-but at a low computational cost. MRELBP produces the best classification scores of 99.82%, 99.38%, and 99.77% on three popular Outex test suites. More importantly, MRELBP is shown to be highly robust to image noise, including Gaussian noise, Gaussian blur, salt-and-pepper noise, and random pixel corruption.

Block-based scalable wavelet image codec

NASA Astrophysics Data System (ADS)

Bao, Yiliang; Kuo, C.-C. Jay

1999-10-01

This paper presents a high performance block-based wavelet image coder which is designed to be of very low implementational complexity yet with rich features. In this image coder, the Dual-Sliding Wavelet Transform (DSWT) is first applied to image data to generate wavelet coefficients in fixed-size blocks. Here, a block only consists of wavelet coefficients from a single subband. The coefficient blocks are directly coded with the Low Complexity Binary Description (LCBiD) coefficient coding algorithm. Each block is encoded using binary context-based bitplane coding. No parent-child correlation is exploited in the coding process. There is also no intermediate buffering needed in between DSWT and LCBiD. The compressed bit stream generated by the proposed coder is both SNR and resolution scalable, as well as highly resilient to transmission errors. Both DSWT and LCBiD process the data in blocks whose size is independent of the size of the original image. This gives more flexibility in the implementation. The codec has a very good coding performance even the block size is (16,16).

Missing data reconstruction using Gaussian mixture models for fingerprint images

NASA Astrophysics Data System (ADS)

Agaian, Sos S.; Yeole, Rushikesh D.; Rao, Shishir P.; Mulawka, Marzena; Troy, Mike; Reinecke, Gary

2016-05-01

Publisher's Note: This paper, originally published on 25 May 2016, was replaced with a revised version on 16 June 2016. If you downloaded the original PDF, but are unable to access the revision, please contact SPIE Digital Library Customer Service for assistance. One of the most important areas in biometrics is matching partial fingerprints in fingerprint databases. Recently, significant progress has been made in designing fingerprint identification systems for missing fingerprint information. However, a dependable reconstruction of fingerprint images still remains challenging due to the complexity and the ill-posed nature of the problem. In this article, both binary and gray-level images are reconstructed. This paper also presents a new similarity score to evaluate the performance of the reconstructed binary image. The offered fingerprint image identification system can be automated and extended to numerous other security applications such as postmortem fingerprints, forensic science, investigations, artificial intelligence, robotics, all-access control, and financial security, as well as for the verification of firearm purchasers, driver license applicants, etc.

Navigable points estimation for mobile robots using binary image skeletonization

NASA Astrophysics Data System (ADS)

Martinez S., Fernando; Jacinto G., Edwar; Montiel A., Holman

2017-02-01

This paper describes the use of image skeletonization for the estimation of all the navigable points, inside a scene of mobile robots navigation. Those points are used for computing a valid navigation path, using standard methods. The main idea is to find the middle and the extreme points of the obstacles in the scene, taking into account the robot size, and create a map of navigable points, in order to reduce the amount of information for the planning algorithm. Those points are located by means of the skeletonization of a binary image of the obstacles and the scene background, along with some other digital image processing algorithms. The proposed algorithm automatically gives a variable number of navigable points per obstacle, depending on the complexity of its shape. As well as, the way how the algorithm can change some of their parameters in order to change the final number of the resultant key points is shown. The results shown here were obtained applying different kinds of digital image processing algorithms on static scenes.

A novel encryption scheme for high-contrast image data in the Fresnelet domain

PubMed Central

Bibi, Nargis; Farwa, Shabieh; Jahngir, Adnan; Usman, Muhammad

2018-01-01

In this paper, a unique and more distinctive encryption algorithm is proposed. This is based on the complexity of highly nonlinear S box in Flesnelet domain. The nonlinear pattern is transformed further to enhance the confusion in the dummy data using Fresnelet technique. The security level of the encrypted image boosts using the algebra of Galois field in Fresnelet domain. At first level, the Fresnelet transform is used to propagate the given information with desired wavelength at specified distance. It decomposes given secret data into four complex subbands. These complex sub-bands are separated into two components of real subband data and imaginary subband data. At second level, the net subband data, produced at the first level, is deteriorated to non-linear diffused pattern using the unique S-box defined on the Galois field F28. In the diffusion process, the permuted image is substituted via dynamic algebraic S-box substitution. We prove through various analysis techniques that the proposed scheme enhances the cipher security level, extensively. PMID:29608609

An energy efficient and high speed architecture for convolution computing based on binary resistive random access memory

NASA Astrophysics Data System (ADS)

Liu, Chen; Han, Runze; Zhou, Zheng; Huang, Peng; Liu, Lifeng; Liu, Xiaoyan; Kang, Jinfeng

2018-04-01

In this work we present a novel convolution computing architecture based on metal oxide resistive random access memory (RRAM) to process the image data stored in the RRAM arrays. The proposed image storage architecture shows performances of better speed-device consumption efficiency compared with the previous kernel storage architecture. Further we improve the architecture for a high accuracy and low power computing by utilizing the binary storage and the series resistor. For a 28 × 28 image and 10 kernels with a size of 3 × 3, compared with the previous kernel storage approach, the newly proposed architecture shows excellent performances including: 1) almost 100% accuracy within 20% LRS variation and 90% HRS variation; 2) more than 67 times speed boost; 3) 71.4% energy saving.

Behavioral similarity measurement based on image processing for robots that use imitative learning

NASA Astrophysics Data System (ADS)

Sterpin B., Dante G.; Martinez S., Fernando; Jacinto G., Edwar

2017-02-01

In the field of the artificial societies, particularly those are based on memetics, imitative behavior is essential for the development of cultural evolution. Applying this concept for robotics, through imitative learning, a robot can acquire behavioral patterns from another robot. Assuming that the learning process must have an instructor and, at least, an apprentice, the fact to obtain a quantitative measurement for their behavioral similarity, would be potentially useful, especially in artificial social systems focused on cultural evolution. In this paper the motor behavior of both kinds of robots, for two simple tasks, is represented by 2D binary images, which are processed in order to measure their behavioral similarity. The results shown here were obtained comparing some similarity measurement methods for binary images.

Edge smoothing for real-time simulation of a polygon face object system as viewed by a moving observer

NASA Technical Reports Server (NTRS)

Lotz, Robert W. (Inventor); Westerman, David J. (Inventor)

1980-01-01

The visual system within an aircraft flight simulation system receives flight data and terrain data which is formated into a buffer memory. The image data is forwarded to an image processor which translates the image data into face vertex vectors Vf, defining the position relationship between the vertices of each terrain object and the aircraft. The image processor then rotates, clips, and projects the image data into two-dimensional display vectors (Vd). A display generator receives the Vd faces, and other image data to provide analog inputs to CRT devices which provide the window displays for the simulated aircraft. The video signal to the CRT devices passes through an edge smoothing device which prolongs the rise time (and fall time) of the video data inversely as the slope of the edge being smoothed. An operational amplifier within the edge smoothing device has a plurality of independently selectable feedback capacitors each having a different value. The values of the capacitors form a series which doubles as a power of two. Each feedback capacitor has a fast switch responsive to the corresponding bit of a digital binary control word for selecting (1) or not selecting (0) that capacitor. The control word is determined by the slope of each edge. The resulting actual feedback capacitance for each edge is the sum of all the selected capacitors and is directly proportional to the value of the binary control word. The output rise time (or fall time) is a function of the feedback capacitance, and is controlled by the slope through the binary control word.

Research on properties of an infrared imaging diffractive element

NASA Astrophysics Data System (ADS)

Rachoń, M.; Wegrzyńska, K.; Doch, M.; Kołodziejczyk, A.; Siemion, A.; Suszek, J.; Kakarenko, K.; Sypek, M.

2014-09-01

Novel thermovision imaging systems having high efficiency require very sophisticated optical components. This paper describes the diffractive optical elements which are designed for the wavelengths between 8 and 14 μm for the application in the FLIR cameras. In the current paper the authors present phase only diffractive elements manufactured in the etched gallium arsenide. Due to the simplicity of the manufacturing process only binary phase elements were designed and manufactured. Such solution exhibits huge chromatic aberration. Moreover, the performance of such elements is rather poor, which is caused by two factors. The first one is the limited diffraction efficiency (c.a. 40%) of binary phase structures. The second problem lies in the Fresnel losses coming from the reflection from the two surfaces (around 50%). Performance of this structures is limited and the imaging contrast is poor. However, such structures can be used for relatively cheap practical testing of the new ideas. For example this solution is sufficient for point spread function (PSF) measurements. Different diffractive elements were compared. The first one was the equivalent of the lens designed on the basis of the paraxial approximation. For the second designing process, the non-paraxial approach was used. It was due to the fact that f/# was equal to 1. For the non-paraxial designing the focal spot is smaller and better focused. Moreover, binary phase structures suffer from huge chromatic aberrations. Finally, it is presented that non-paraxially designed optical element imaging with extended depth of focus (light-sword) can suppress chromatic aberration and therefore it creates the image not only in the image plane.

Controllability of symmetric spin networks

NASA Astrophysics Data System (ADS)

Albertini, Francesca; D'Alessandro, Domenico

2018-05-01

We consider a network of n spin 1/2 systems which are pairwise interacting via Ising interaction and are controlled by the same electro-magnetic control field. Such a system presents symmetries since the Hamiltonian is unchanged if we permute two spins. This prevents full (operator) controllability, in that not every unitary evolution can be obtained. We prove however that controllability is verified if we restrict ourselves to unitary evolutions which preserve the above permutation invariance. For low dimensional cases, n = 2 and n = 3, we provide an analysis of the Lie group of available evolutions and give explicit control laws to transfer between two arbitrary permutation invariant states. This class of states includes highly entangled states such as Greenberger-Horne-Zeilinger (GHZ) states and W states, which are of interest in quantum information.

A permutation information theory tour through different interest rate maturities: the Libor case.

PubMed

Bariviera, Aurelio Fernández; Guercio, María Belén; Martinez, Lisana B; Rosso, Osvaldo A

2015-12-13

This paper analyses Libor interest rates for seven different maturities and referred to operations in British pounds, euros, Swiss francs and Japanese yen, during the period 2001-2015. The analysis is performed by means of two quantifiers derived from information theory: the permutation Shannon entropy and the permutation Fisher information measure. An anomalous behaviour in the Libor is detected in all currencies except euros during the years 2006-2012. The stochastic switch is more severe in one, two and three months maturities. Given the special mechanism of Libor setting, we conjecture that the behaviour could have been produced by the manipulation that was uncovered by financial authorities. We argue that our methodology is pertinent as a market overseeing instrument. © 2015 The Author(s).

Storage and computationally efficient permutations of factorized covariance and square-root information matrices

NASA Technical Reports Server (NTRS)

Muellerschoen, R. J.

1988-01-01

A unified method to permute vector-stored upper-triangular diagonal factorized covariance (UD) and vector stored upper-triangular square-root information filter (SRIF) arrays is presented. The method involves cyclical permutation of the rows and columns of the arrays and retriangularization with appropriate square-root-free fast Givens rotations or elementary slow Givens reflections. A minimal amount of computation is performed and only one scratch vector of size N is required, where N is the column dimension of the arrays. To make the method efficient for large SRIF arrays on a virtual memory machine, three additional scratch vectors each of size N are used to avoid expensive paging faults. The method discussed is compared with the methods and routines of Bierman's Estimation Subroutine Library (ESL).

Deep classification hashing for person re-identification

NASA Astrophysics Data System (ADS)

Wang, Jiabao; Li, Yang; Zhang, Xiancai; Miao, Zhuang; Tao, Gang

2018-04-01

As the development of surveillance in public, person re-identification becomes more and more important. The largescale databases call for efficient computation and storage, hashing technique is one of the most important methods. In this paper, we proposed a new deep classification hashing network by introducing a new binary appropriation layer in the traditional ImageNet pre-trained CNN models. It outputs binary appropriate features, which can be easily quantized into binary hash-codes for hamming similarity comparison. Experiments show that our deep hashing method can outperform the state-of-the-art methods on the public CUHK03 and Market1501 datasets.

The Optical Gravitational Lensing Experiment. Eclipsing Binary Stars in the Small Magellanic Cloud

NASA Astrophysics Data System (ADS)

Wyrzykowski, L.; Udalski, A.; Kubiak, M.; Szymanski, M. K.; Zebrun, K.; Soszynski, I.; Wozniak, P. R.; Pietrzynski, G.; Szewczyk, O.

2004-03-01

We present new version of the OGLE-II catalog of eclipsing binary stars detected in the Small Magellanic Cloud, based on Difference Image Analysis catalog of variable stars in the Magellanic Clouds containing data collected from 1997 to 2000. We found 1351 eclipsing binary stars in the central 2.4 square degree area of the SMC. 455 stars are newly discovered objects, not found in the previous release of the catalog. The eclipsing objects were selected with the automatic search algorithm based on the artificial neural network. The full catalog is accessible from the OGLE Internet archive.

Treelets Binary Feature Retrieval for Fast Keypoint Recognition.

PubMed

Zhu, Jianke; Wu, Chenxia; Chen, Chun; Cai, Deng

2015-10-01

Fast keypoint recognition is essential to many vision tasks. In contrast to the classification-based approaches, we directly formulate the keypoint recognition as an image patch retrieval problem, which enjoys the merit of finding the matched keypoint and its pose simultaneously. To effectively extract the binary features from each patch surrounding the keypoint, we make use of treelets transform that can group the highly correlated data together and reduce the noise through the local analysis. Treelets is a multiresolution analysis tool, which provides an orthogonal basis to reflect the geometry of the noise-free data. To facilitate the real-world applications, we have proposed two novel approaches. One is the convolutional treelets that capture the image patch information locally and globally while reducing the computational cost. The other is the higher-order treelets that reflect the relationship between the rows and columns within image patch. An efficient sub-signature-based locality sensitive hashing scheme is employed for fast approximate nearest neighbor search in patch retrieval. Experimental evaluations on both synthetic data and the real-world Oxford dataset have shown that our proposed treelets binary feature retrieval methods outperform the state-of-the-art feature descriptors and classification-based approaches.

MBR-SIFT: A mirror reflected invariant feature descriptor using a binary representation for image matching.

PubMed

Su, Mingzhe; Ma, Yan; Zhang, Xiangfen; Wang, Yan; Zhang, Yuping

2017-01-01

The traditional scale invariant feature transform (SIFT) method can extract distinctive features for image matching. However, it is extremely time-consuming in SIFT matching because of the use of the Euclidean distance measure. Recently, many binary SIFT (BSIFT) methods have been developed to improve matching efficiency; however, none of them is invariant to mirror reflection. To address these problems, in this paper, we present a horizontal or vertical mirror reflection invariant binary descriptor named MBR-SIFT, in addition to a novel image matching approach. First, 16 cells in the local region around the SIFT keypoint are reorganized, and then the 128-dimensional vector of the SIFT descriptor is transformed into a reconstructed vector according to eight directions. Finally, the MBR-SIFT descriptor is obtained after binarization and reverse coding. To improve the matching speed and accuracy, a fast matching algorithm that includes a coarse-to-fine two-step matching strategy in addition to two similarity measures for the MBR-SIFT descriptor are proposed. Experimental results on the UKBench dataset show that the proposed method not only solves the problem of mirror reflection, but also ensures desirable matching accuracy and speed.

MBR-SIFT: A mirror reflected invariant feature descriptor using a binary representation for image matching

PubMed Central

Su, Mingzhe; Ma, Yan; Zhang, Xiangfen; Wang, Yan; Zhang, Yuping

2017-01-01

The traditional scale invariant feature transform (SIFT) method can extract distinctive features for image matching. However, it is extremely time-consuming in SIFT matching because of the use of the Euclidean distance measure. Recently, many binary SIFT (BSIFT) methods have been developed to improve matching efficiency; however, none of them is invariant to mirror reflection. To address these problems, in this paper, we present a horizontal or vertical mirror reflection invariant binary descriptor named MBR-SIFT, in addition to a novel image matching approach. First, 16 cells in the local region around the SIFT keypoint are reorganized, and then the 128-dimensional vector of the SIFT descriptor is transformed into a reconstructed vector according to eight directions. Finally, the MBR-SIFT descriptor is obtained after binarization and reverse coding. To improve the matching speed and accuracy, a fast matching algorithm that includes a coarse-to-fine two-step matching strategy in addition to two similarity measures for the MBR-SIFT descriptor are proposed. Experimental results on the UKBench dataset show that the proposed method not only solves the problem of mirror reflection, but also ensures desirable matching accuracy and speed. PMID:28542537

Fresnel zone plate light field spectral imaging simulation

NASA Astrophysics Data System (ADS)

Hallada, Francis D.; Franz, Anthony L.; Hawks, Michael R.

2017-05-01

Through numerical simulation, we have demonstrated a novel snapshot spectral imaging concept using binary diffractive optics. Binary diffractive optics, such as Fresnel zone plates (FZP) or photon sieves, can be used as the single optical element in a spectral imager that conducts both imaging and dispersion. In previous demonstrations of spectral imaging with diffractive optics, the detector array was physically translated along the optic axis to measure different image formation planes. In this new concept the wavelength-dependent images are constructed synthetically, by using integral photography concepts commonly applied to light field (plenoptic) cameras. Light field cameras use computational digital refocusing methods after exposure to make images at different object distances. Our concept refocuses to make images at different wavelengths instead of different object distances. The simulations in this study demonstrate this concept for an imager designed with a FZP. Monochromatic light from planar sources is propagated through the system to a measurement plane using wave optics in the Fresnel approximation. Simple images, placed at optical infinity, are illuminated by monochromatic sources and then digitally refocused to show different spectral bins. We show the formation of distinct images from different objects, illuminated by monochromatic sources in the VIS/NIR spectrum. Additionally, this concept could easily be applied to imaging in the MWIR and LWIR ranges. In conclusion, this new type of imager offers a rugged and simple optical design for snapshot spectral imaging and warrants further development.

Synthesis of ultrasmall, homogeneously alloyed, bimetallic nanoparticles on silica supports

NASA Astrophysics Data System (ADS)

Wong, A.; Liu, Q.; Griffin, S.; Nicholls, A.; Regalbuto, J. R.

2017-12-01

Supported nanoparticles containing more than one metal have a variety of applications in sensing, catalysis, and biomedicine. Common synthesis techniques for this type of material often result in large, unalloyed nanoparticles that lack the interactions between the two metals that give the particles their desired characteristics. We demonstrate a relatively simple, effective, generalizable method to produce highly dispersed, well-alloyed bimetallic nanoparticles. Ten permutations of noble and base metals (platinum, palladium, copper, nickel, and cobalt) were synthesized with average particle sizes from 0.9 to 1.4 nanometers, with tight size distributions. High-resolution imaging and x-ray analysis confirmed the homogeneity of alloying in these ultrasmall nanoparticles.

A statistical method (cross-validation) for bone loss region detection after spaceflight

PubMed Central

Zhao, Qian; Li, Wenjun; Li, Caixia; Chu, Philip W.; Kornak, John; Lang, Thomas F.

2010-01-01

Astronauts experience bone loss after the long spaceflight missions. Identifying specific regions that undergo the greatest losses (e.g. the proximal femur) could reveal information about the processes of bone loss in disuse and disease. Methods for detecting such regions, however, remains an open problem. This paper focuses on statistical methods to detect such regions. We perform statistical parametric mapping to get t-maps of changes in images, and propose a new cross-validation method to select an optimum suprathreshold for forming clusters of pixels. Once these candidate clusters are formed, we use permutation testing of longitudinal labels to derive significant changes. PMID:20632144

An Integrative Object-Based Image Analysis Workflow for Uav Images

NASA Astrophysics Data System (ADS)

Yu, Huai; Yan, Tianheng; Yang, Wen; Zheng, Hong

2016-06-01

In this work, we propose an integrative framework to process UAV images. The overall process can be viewed as a pipeline consisting of the geometric and radiometric corrections, subsequent panoramic mosaicking and hierarchical image segmentation for later Object Based Image Analysis (OBIA). More precisely, we first introduce an efficient image stitching algorithm after the geometric calibration and radiometric correction, which employs a fast feature extraction and matching by combining the local difference binary descriptor and the local sensitive hashing. We then use a Binary Partition Tree (BPT) representation for the large mosaicked panoramic image, which starts by the definition of an initial partition obtained by an over-segmentation algorithm, i.e., the simple linear iterative clustering (SLIC). Finally, we build an object-based hierarchical structure by fully considering the spectral and spatial information of the super-pixels and their topological relationships. Moreover, an optimal segmentation is obtained by filtering the complex hierarchies into simpler ones according to some criterions, such as the uniform homogeneity and semantic consistency. Experimental results on processing the post-seismic UAV images of the 2013 Ya'an earthquake demonstrate the effectiveness and efficiency of our proposed method.

Effect of image scaling and segmentation in digital rock characterisation

NASA Astrophysics Data System (ADS)

Jones, B. D.; Feng, Y. T.

2016-04-01

Digital material characterisation from microstructural geometry is an emerging field in computer simulation. For permeability characterisation, a variety of studies exist where the lattice Boltzmann method (LBM) has been used in conjunction with computed tomography (CT) imaging to simulate fluid flow through microscopic rock pores. While these previous works show that the technique is applicable, the use of binary image segmentation and the bounceback boundary condition results in a loss of grain surface definition when the modelled geometry is compared to the original CT image. We apply the immersed moving boundary (IMB) condition of Noble and Torczynski as a partial bounceback boundary condition which may be used to better represent the geometric definition provided by a CT image. The IMB condition is validated against published work on idealised porous geometries in both 2D and 3D. Following this, greyscale image segmentation is applied to a CT image of Diemelstadt sandstone. By varying the mapping of CT voxel densities to lattice sites, it is shown that binary image segmentation may underestimate the true permeability of the sample. A CUDA-C-based code, LBM-C, was developed specifically for this work and leverages GPU hardware in order to carry out computations.

Adaptive Optics Imaging of the Circumbinary Disk around the T Tauri Binary UY Aurigae: Estimates of the Binary Mass and Circumbinary Dust Grain Size Distribution

NASA Astrophysics Data System (ADS)

Close, L. M.; Dutrey, A.; Roddier, F.; Guilloteau, S.; Roddier, C.; Northcott, M.; Ménard, F.; Duvert, G.; Graves, J. E.; Potter, D.

1998-05-01

We have obtained high-resolution (FWHM = 0.15") deep images of the UY Aur binary at J, H, and K' with the University of Hawaii adaptive optics instrument. We clearly detect an R ~ 500 AU circumbinary disk discovered with millimeter interferometry, making UY Aur the second young binary with a confirmed circumbinary disk. It appears that the disk is inclined ~42° from face on. We find that the near side of the disk is brighter than the far side by factors of 2.6, 2.7, and 6.5 times at K', H, and J, respectively. The original GG Tau circumbinary disk has been reexamined and is found to have similar flux ratios of 1.5, 2.6, and 3.6 at K', H, and J, respectively. A realistic power-law distribution (p = 4.7) of spherical dust aggregates (composed of silicates, amorphous carbon, and graphite) that reproduces the observed ISM extinction curve also predicts these observed flux ratios from Mie scattering theory. We find the observed preference of forward-scattering over back-scattering is well fitted (global χ2 minimization) by Mie scattering off particles in the range amin = 0.03 μm to amax = 0.5-0.6 μm. The existence of a significant population of grain radii larger than 0.6 μm is not supported by the scattering observations. Based on the observed disk inclination we derive an orbit for UY Aur where the mass for the binary is 1.6+0.47-0.67 M⊙. Based on the observed K7 and M0 spectral types for UY Aur A and B, accretion disk models for the inner disks around the central stars were constructed. The models suggest that small (lower limit R ~ 5-10 AU) inner disks exist around B and A. It appears that B is accreting ~5 times faster than A, and that both inner disks may be exhausted in ~102-103 yr without replenishment from the outer circumbinary disk. Our images suggest that these inner disks may indeed be resupplied with material through thin streamers of material that penetrate inside the circumbinary disk. Currently it appears that such a streamer may be a close to UY Aur B. Comparison of our IR images and the millimeter images of the gas clearly show that the dust seen in our IR images traces the gas in the circumbinary disk, as was also the case with GG Tau.

Subband/transform functions for image processing

NASA Technical Reports Server (NTRS)

Glover, Daniel

1993-01-01

Functions for image data processing written for use with the MATLAB(TM) software package are presented. These functions provide the capability to transform image data with block transformations (such as the Walsh Hadamard) and to produce spatial frequency subbands of the transformed data. Block transforms are equivalent to simple subband systems. The transform coefficients are reordered using a simple permutation to give subbands. The low frequency subband is a low resolution version of the original image, while the higher frequency subbands contain edge information. The transform functions can be cascaded to provide further decomposition into more subbands. If the cascade is applied to all four of the first stage subbands (in the case of a four band decomposition), then a uniform structure of sixteen bands is obtained. If the cascade is applied only to the low frequency subband, an octave structure of seven bands results. Functions for the inverse transforms are also given. These functions can be used for image data compression systems. The transforms do not in themselves produce data compression, but prepare the data for quantization and compression. Sample quantization functions for subbands are also given. A typical compression approach is to subband the image data, quantize it, then use statistical coding (e.g., run-length coding followed by Huffman coding) for compression. Contour plots of image data and subbanded data are shown.

Analysis of autostereoscopic three-dimensional images using multiview wavelets.

PubMed

Saveljev, Vladimir; Palchikova, Irina

2016-08-10

We propose that multiview wavelets can be used in processing multiview images. The reference functions for the synthesis/analysis of multiview images are described. The synthesized binary images were observed experimentally as three-dimensional visual images. The symmetric multiview B-spline wavelets are proposed. The locations recognized in the continuous wavelet transform correspond to the layout of the test objects. The proposed wavelets can be applied to the multiview, integral, and plenoptic images.

NASA thesaurus. Volume 2: Access vocabulary

NASA Technical Reports Server (NTRS)

1988-01-01

The access vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries and pseudo-multiword terms that are permutations of words that contain words within words. The access vocabulary contains almost 42,000 entries that give increased access to the hierarchies in Volume 1 - Hierarchical Listing.

Genomic Analysis of Complex Microbial Communities in Wounds

DTIC Science & Technology

2012-01-01

thoroughly in the ecology literature. Permutation Multivariate Analysis of Variance ( PerMANOVA ). We used PerMANOVA to test the null-hypothesis of no...difference between the bacterial communities found within a single wound compared to those from different patients (α = 0.05). PerMANOVA is a...permutation-based version of the multivariate analysis of variance (MANOVA). PerMANOVA uses the distances between samples to partition variance and

Circular permutation of the starch-binding domain: inversion of ligand selectivity with increased affinity.

PubMed

Stephen, Preyesh; Tseng, Kai-Li; Liu, Yu-Nan; Lyu, Ping-Chiang

2012-03-07

Proteins containing starch-binding domains (SBDs) are used in a variety of scientific and technological applications. A circularly permutated SBD (CP90) with improved affinity and selectivity toward longer-chain carbohydrates was synthesized, suggesting that a new starch-binding protein may be developed for specific scientific and industrial applications. This journal is © The Royal Society of Chemistry 2012

Sampling solution traces for the problem of sorting permutations by signed reversals

PubMed Central

2012-01-01

Background Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same set of reversals that must be applied to sort the original permutation following a partial ordering. By using traces, we therefore can represent the set of optimal solutions in a more compact way. Algorithms for enumerating the complete set of traces of solutions were developed. However, due to their exponential complexity, their practical use is limited to small permutations. A partial enumeration of traces is a sampling of the complete set of traces and can be an alternative for the study of distinct evolutionary scenarios of big permutations. Ideally, the sampling should be done uniformly from the space of all optimal solutions. This is however conjectured to be ♯P-complete. Results We propose and evaluate three algorithms for producing a sampling of the complete set of traces that instead can be shown in practice to preserve some of the characteristics of the space of all solutions. The first algorithm (RA) performs the construction of traces through a random selection of reversals on the list of optimal 1-sequences. The second algorithm (DFALT) consists in a slight modification of an algorithm that performs the complete enumeration of traces. Finally, the third algorithm (SWA) is based on a sliding window strategy to improve the enumeration of traces. All proposed algorithms were able to enumerate traces for permutations with up to 200 elements. Conclusions We analysed the distribution of the enumerated traces with respect to their height and average reversal length. Various works indicate that the reversal length can be an important aspect in genome rearrangements. The algorithms RA and SWA show a tendency to lose traces with high average reversal length. Such traces are however rare, and qualitatively our results show that, for testable-sized permutations, the algorithms DFALT and SWA produce distributions which approximate the reversal length distributions observed with a complete enumeration of the set of traces. PMID:22704580

Evolutionary Pathways for Asteroid Satellites

NASA Astrophysics Data System (ADS)

Jacobson, Seth Andrew

2015-08-01

The YORP-induced rotational fission hypothesis is a proposed mechanism for the creation of small asteroid binaries, which make up approximately 1/6-th of the near-Earth asteroid and small Main Belt asteroid populations. The YORP effect is a radiative torque that rotationally accelerates asteroids on timescales of thousands to millions of years. As asteroids rotationally accelerate, centrifugal accelerations on material within the body can match gravitational accelerations holding that material in place. When this occurs, that material goes into orbit. Once in orbit that material coalesces into a companion that undergoes continued dynamical evolution.Observations with radar, photometric and direct imaging techniques reveal a diverse array of small asteroid satellites. These systems can be sorted into a number of morphologies according to size, multiplicity of members, dynamical orbit and spin states, and member shapes. For instance, singly synchronous binaries have short separation distances between the two members, rapidly rotating oblate primary members, and tidally locked prolate secondary members. Other confirmed binary morphologies include doubly synchronous, tight asynchronous and wide asynchronous binaries. Related to these binary morphologies are unbound paired asteroid systems and bi-lobate contact binaries.A critical test for the YORP-induced rotational fission hypothesis is whether the binary asteroids produced evolve to the observed binary and related systems. In this talk I will review how this evolution is believed to occur according to gravitational dynamics, mutual body tides and the binary YORP effect.

Binary statistics among population II stars

NASA Astrophysics Data System (ADS)

Zinnecker, H.; Köhler, R.; Jahreiß, H.

2004-08-01

Population II stars are old, metal-poor, Galactic halo stars with high proper motion. We have carried out a visual binary survey of 164 halo stars in the solar neighborhood (median distance 100 pc), using infrared speckle interferometry, adaptive optics, and wide field direct imaging. The sample is based on the lists of Population II stars of Carney et al. (1994) and Norris (1986), with reliable distances from HIPPARCOS measurements. At face value, we found 33 binaries, 6 triples, and 1 quadruple system. When we limit ourselves to K-band flux ratios larger than 0.1 (to avoid background contamination), the numbers drop to 9 binaries and 1 triple, corresponding to a binary frequency of 6 - 7 % above our angular resolution limit of about 0.1 arcsec. If we count all systems with K-band flux ratios greater than 0.01, we obtain 15 more binaries and 3 more triples, corresponding to a binary frequency for projected separations in excess of 10 AU of around 20 %. This is to be compared with the frequency of spectroscopic binaries (up to a period of 3000 days) of Population II stars of about 15 % (Latham et al. 2002). We also determined a semi-major axis distribution for our visual Population II binary and triple systems, which appears to be remarkably different from that of Population I stars. Second epoch-observations must help confirm the reality of our results.

Design concepts and options for the Thermal Infrared Imager (TIRI) as part of ESA's Asteroid Impact Mission.

NASA Astrophysics Data System (ADS)

Bowles, Neil; Calcutt, Simon; Licandro, Javier; Reyes, Marcos; Delbo, Marco; Donaldson Hanna, Kerri; Arnold, Jessica; Howe, Chris

2016-04-01

ESA's Asteroid Impact Mission (AIM) is being studied as part of the joint ESA/NASA AIDA mission for launch in 2020. AIDA's primary mission is to investigate the effect of a kinetic impactor on the secondary component of the binary asteroid 65803 Didymos in late 2022. AIM will characterise the Didymos system and monitor the response of the binary system to the impact. A multi-spectral, thermal-infrared imaging instrument (TIRI) will be an essential component of AIM's remote sensing payload, as it will provide key information on the nature of the surfaces (e.g. presence or absence of materials, degree of compaction, and rock abundance of the regolith) of both components in the Didymos system. The temperature maps provided by TIRI will be important for navigation and spacecraft health and safety for proximity/lander operations. By measuring the asteroids' diurnal thermal responses (thermal inertia) and their surface compositions via spectral signatures, TIRI will provide information on the origin and evolution of the binary system. In this presentation we will discuss possible instrument design for TIRI, exploring options that include imaging spectroscopy to broadband imaging. By using thermal models and compositional analogues of the Didymos system we will show how the performance of each design option compares to the wider scientific goals of the AIDA/AIM mission.

Cost-Sensitive Local Binary Feature Learning for Facial Age Estimation.

PubMed

Lu, Jiwen; Liong, Venice Erin; Zhou, Jie

2015-12-01

In this paper, we propose a cost-sensitive local binary feature learning (CS-LBFL) method for facial age estimation. Unlike the conventional facial age estimation methods that employ hand-crafted descriptors or holistically learned descriptors for feature representation, our CS-LBFL method learns discriminative local features directly from raw pixels for face representation. Motivated by the fact that facial age estimation is a cost-sensitive computer vision problem and local binary features are more robust to illumination and expression variations than holistic features, we learn a series of hashing functions to project raw pixel values extracted from face patches into low-dimensional binary codes, where binary codes with similar chronological ages are projected as close as possible, and those with dissimilar chronological ages are projected as far as possible. Then, we pool and encode these local binary codes within each face image as a real-valued histogram feature for face representation. Moreover, we propose a cost-sensitive local binary multi-feature learning method to jointly learn multiple sets of hashing functions using face patches extracted from different scales to exploit complementary information. Our methods achieve competitive performance on four widely used face aging data sets.

Simultaneous Local Binary Feature Learning and Encoding for Homogeneous and Heterogeneous Face Recognition.

PubMed

Lu, Jiwen; Erin Liong, Venice; Zhou, Jie

2017-08-09

In this paper, we propose a simultaneous local binary feature learning and encoding (SLBFLE) approach for both homogeneous and heterogeneous face recognition. Unlike existing hand-crafted face descriptors such as local binary pattern (LBP) and Gabor features which usually require strong prior knowledge, our SLBFLE is an unsupervised feature learning approach which automatically learns face representation from raw pixels. Unlike existing binary face descriptors such as the LBP, discriminant face descriptor (DFD), and compact binary face descriptor (CBFD) which use a two-stage feature extraction procedure, our SLBFLE jointly learns binary codes and the codebook for local face patches so that discriminative information from raw pixels from face images of different identities can be obtained by using a one-stage feature learning and encoding procedure. Moreover, we propose a coupled simultaneous local binary feature learning and encoding (C-SLBFLE) method to make the proposed approach suitable for heterogeneous face matching. Unlike most existing coupled feature learning methods which learn a pair of transformation matrices for each modality, we exploit both the common and specific information from heterogeneous face samples to characterize their underlying correlations. Experimental results on six widely used face datasets are presented to demonstrate the effectiveness of the proposed method.

Multiplicity among Young Brown Dwarfs and Very Low Mass Stars

NASA Astrophysics Data System (ADS)

Ahmic, Mirza; Jayawardhana, Ray; Brandeker, Alexis; Scholz, Alexander; van Kerkwijk, Marten H.; Delgado-Donate, Eduardo; Froebrich, Dirk

2007-12-01

We report on a near-infrared adaptive optics imaging survey of 31 young brown dwarfs and very low mass (VLM) stars, 28 of which are in the Chamaeleon I star-forming region, using the ESO Very Large Telescope. We resolve the suspected 0.16'' (~26 AU) binary Cha Hα 2 and present two new binaries, Hn 13 and CHXR 15, with separations of 0.13'' (~20 AU) and 0.30'' (~50 AU), respectively; the latter is one of the widest VLM systems known. We find a binary frequency of 11+9-6%, thus confirming the trend for a lower binary frequency with decreasing mass. By combining our work with previous surveys, we arrive at the largest sample of young VLM objects (72) with high angular resolution imaging to date. Its multiplicity fraction is in statistical agreement with that for VLM objects in the field. Furthermore, we note that many field stellar binaries with lower binding energies and/or wider cross sections have survived dynamical evolution and that statistical models suggest tidal disruption by passing stars is unlikely to affect the binary properties of our systems. Thus, we argue that there is no significant evolution of multiplicity with age among brown dwarfs and VLM stars in OB and T associations between a few megayears to several gigayears. Instead, the observations so far suggest that VLM objects are either less likely to be born in fragile multiple systems than solar-mass stars or such systems are disrupted very early. We dedicate this paper to the memory of our coauthor, Eduardo Delgado-Donate, who died in a hiking accident in Tenerife earlier this year.

Permutation glass.

PubMed

Williams, Mobolaji

2018-01-01

The field of disordered systems in statistical physics provides many simple models in which the competing influences of thermal and nonthermal disorder lead to new phases and nontrivial thermal behavior of order parameters. In this paper, we add a model to the subject by considering a disordered system where the state space consists of various orderings of a list. As in spin glasses, the disorder of such "permutation glasses" arises from a parameter in the Hamiltonian being drawn from a distribution of possible values, thus allowing nominally "incorrect orderings" to have lower energies than "correct orderings" in the space of permutations. We analyze a Gaussian, uniform, and symmetric Bernoulli distribution of energy costs, and, by employing Jensen's inequality, derive a simple condition requiring the permutation glass to always transition to the correctly ordered state at a temperature lower than that of the nondisordered system, provided that this correctly ordered state is accessible. We in turn find that in order for the correctly ordered state to be accessible, the probability that an incorrectly ordered component is energetically favored must be less than the inverse of the number of components in the system. We show that all of these results are consistent with a replica symmetric ansatz of the system. We conclude by arguing that there is no distinct permutation glass phase for the simplest model considered here and by discussing how to extend the analysis to more complex Hamiltonians capable of novel phase behavior and replica symmetry breaking. Finally, we outline an apparent correspondence between the presented system and a discrete-energy-level fermion gas. In all, the investigation introduces a class of exactly soluble models into statistical mechanics and provides a fertile ground to investigate statistical models of disorder.

Efficient computation of significance levels for multiple associations in large studies of correlated data, including genomewide association studies.

PubMed

Dudbridge, Frank; Koeleman, Bobby P C

2004-09-01

Large exploratory studies, including candidate-gene-association testing, genomewide linkage-disequilibrium scans, and array-expression experiments, are becoming increasingly common. A serious problem for such studies is that statistical power is compromised by the need to control the false-positive rate for a large family of tests. Because multiple true associations are anticipated, methods have been proposed that combine evidence from the most significant tests, as a more powerful alternative to individually adjusted tests. The practical application of these methods is currently limited by a reliance on permutation testing to account for the correlated nature of single-nucleotide polymorphism (SNP)-association data. On a genomewide scale, this is both very time-consuming and impractical for repeated explorations with standard marker panels. Here, we alleviate these problems by fitting analytic distributions to the empirical distribution of combined evidence. We fit extreme-value distributions for fixed lengths of combined evidence and a beta distribution for the most significant length. An initial phase of permutation sampling is required to fit these distributions, but it can be completed more quickly than a simple permutation test and need be done only once for each panel of tests, after which the fitted parameters give a reusable calibration of the panel. Our approach is also a more efficient alternative to a standard permutation test. We demonstrate the accuracy of our approach and compare its efficiency with that of permutation tests on genomewide SNP data released by the International HapMap Consortium. The estimation of analytic distributions for combined evidence will allow these powerful methods to be applied more widely in large exploratory studies.

Statistical significance approximation in local trend analysis of high-throughput time-series data using the theory of Markov chains.

PubMed

Xia, Li C; Ai, Dongmei; Cram, Jacob A; Liang, Xiaoyi; Fuhrman, Jed A; Sun, Fengzhu

2015-09-21

Local trend (i.e. shape) analysis of time series data reveals co-changing patterns in dynamics of biological systems. However, slow permutation procedures to evaluate the statistical significance of local trend scores have limited its applications to high-throughput time series data analysis, e.g., data from the next generation sequencing technology based studies. By extending the theories for the tail probability of the range of sum of Markovian random variables, we propose formulae for approximating the statistical significance of local trend scores. Using simulations and real data, we show that the approximate p-value is close to that obtained using a large number of permutations (starting at time points >20 with no delay and >30 with delay of at most three time steps) in that the non-zero decimals of the p-values obtained by the approximation and the permutations are mostly the same when the approximate p-value is less than 0.05. In addition, the approximate p-value is slightly larger than that based on permutations making hypothesis testing based on the approximate p-value conservative. The approximation enables efficient calculation of p-values for pairwise local trend analysis, making large scale all-versus-all comparisons possible. We also propose a hybrid approach by integrating the approximation and permutations to obtain accurate p-values for significantly associated pairs. We further demonstrate its use with the analysis of the Polymouth Marine Laboratory (PML) microbial community time series from high-throughput sequencing data and found interesting organism co-occurrence dynamic patterns. The software tool is integrated into the eLSA software package that now provides accelerated local trend and similarity analysis pipelines for time series data. The package is freely available from the eLSA website: http://bitbucket.org/charade/elsa.

Learning Optimized Local Difference Binaries for Scalable Augmented Reality on Mobile Devices.

PubMed

Xin Yang; Kwang-Ting Cheng

2014-06-01

The efficiency, robustness and distinctiveness of a feature descriptor are critical to the user experience and scalability of a mobile augmented reality (AR) system. However, existing descriptors are either too computationally expensive to achieve real-time performance on a mobile device such as a smartphone or tablet, or not sufficiently robust and distinctive to identify correct matches from a large database. As a result, current mobile AR systems still only have limited capabilities, which greatly restrict their deployment in practice. In this paper, we propose a highly efficient, robust and distinctive binary descriptor, called Learning-based Local Difference Binary (LLDB). LLDB directly computes a binary string for an image patch using simple intensity and gradient difference tests on pairwise grid cells within the patch. To select an optimized set of grid cell pairs, we densely sample grid cells from an image patch and then leverage a modified AdaBoost algorithm to automatically extract a small set of critical ones with the goal of maximizing the Hamming distance between mismatches while minimizing it between matches. Experimental results demonstrate that LLDB is extremely fast to compute and to match against a large database due to its high robustness and distinctiveness. Compared to the state-of-the-art binary descriptors, primarily designed for speed, LLDB has similar efficiency for descriptor construction, while achieving a greater accuracy and faster matching speed when matching over a large database with 2.3M descriptors on mobile devices.

The multiplicity of T Tauri stars in the star forming regions Taurus-Auriga and Ophiuchus-Scorpius: A 2.2 micron speckle imaging survey

NASA Technical Reports Server (NTRS)

Ghez, A. M.; Neugebauer, G.; Matthews, K.

1993-01-01

We present the results of a magnitude limited (K less than = 8.5 mag) speckle imaging survey of 69 T Tauri stars in the star forming regions Taurus-Auriga and Ophiuchus-Scorpius. Thirty-three companion stars were found with separations ranging from 0.07 sec to 2.5 sec, nine are new detections. This survey reveals a distinction between the classical T Tauri stars (CTTS) and the weak-lined T Tauri stars (WTTS) based on the binary star frequency as a function of separation: the WTTS binary star distribution is enhanced at the closer separations (less than 50 AU) relative to the CTTS binary star distribution. We suggest that the nearby companion stars shorten the accretion time scale in multiple star systems, thereby accounting for the presence of WTTS that are coeval with many CTTS. The binary star frequency in the projected linear separation range 16 to 252 AU for T Tauri stars (60 (+/- 17)%) is a factor of 4 greater than that of the solar-type main-sequence stars (16(+/- 3)%). Given the limited separation range of this survey, the rate at which binaries are detected suggests that most, if not all, T Tauri stars have companions. We propose that the observed overabundance of companions of T Tauri stars is an evolutionary effect, in which triple and higher order T Tauri stars are disrupted by close encounters with another star or system of stars.

VizieR Online Data Catalog: OGLE II SMC eclipsing binaries (Wyrzykowski+, 2004)

NASA Astrophysics Data System (ADS)

Wyrzykowski, L.; Udalski, A.; Kubiak, M.; Szymanski, M. K.; Zebrun, K.; Soszinski, I.; Wozniak, P. R.; Pietrzynski, G.; Szewczyk, O.

2009-03-01

We present new version of the OGLE-II catalog of eclipsing binary stars detected in the Small Magellanic Cloud, based on Difference Image Analysis catalog of variable stars in the Magellanic Clouds containing data collected from 1997 to 2000. We found 1351 eclipsing binary stars in the central 2.4 square degree area of the SMC. 455 stars are newly discovered objects, not found in the previous release of the catalog. The eclipsing objects were selected with the automatic search algorithm based on the artificial neural network. The full catalog with individual photometry is accessible from the OGLE INTERNET archive, at ftp://sirius.astrouw.edu.pl/ogle/ogle2/var_stars/smc/ecl . Regular observations of the SMC fields started on June 26, 1997 and covered about 2.4 square degrees of central parts of the SMC. Reductions of the photometric data collected up to the end of May 2000 were performed with the Difference Image Analysis (DIA) package. (1 data file).

Interaction and formation mechanism of binary complex between zein and propylene glycol alginate.

PubMed

Sun, Cuixia; Dai, Lei; Gao, Yanxiang

2017-02-10

The anti-solvent co-precipitation method was used to fabricate the zein-propylene glycol alginate (PGA) binary complex with different mass ratios of zein to PGA (20:1, 10:1, 5:1, 2:1 and 1:1) at pH 4.0. Results showed that attractive electrostatic interaction between zein and PGA occurred and negatively charged binary complex with large size and high turbidity was formed due to the charge neutralization. Hydrogen bonding and hydrophobic effects were involved in the interactions between zein and PGA, leading to the changed secondary structure and improved thermal stability of zein. Aggregates in the irregular shape with large size were obviously observed in the AFM images. PGA alone exhibited a fine filamentous network structure, while zein-PGA binary complex showed a rough branch-like pattern and the surface of "branch" was closely adsorbed by lots of spherical zein particles. Q in zein-PGA binary complex dispersions presented the improved photochemical and thermal stability. The potential mechanism of a two-step process was proposed to explain the formation of zein-PGA binary complexes. Copyright © 2016 Elsevier Ltd. All rights reserved.

How to think about indiscernible particles

NASA Astrophysics Data System (ADS)

Giglio, Daniel Joseph

Permutation symmetries which arise in quantum mechanics pose an intriguing problem. It is not clear that particles which exhibit permutation symmetries (i.e. particles which are indiscernible, meaning that they can be swapped with each other without this yielding a new physical state) qualify as "objects" in any reasonable sense of the term. One solution to this puzzle, which I attribute to W.V. Quine, would have us eliminate such particles from our ontology altogether in order to circumvent the metaphysical vexations caused by permutation symmetries. In this essay I argue that Quine's solution is too rash, and in its place I suggest a novel solution based on altering some of the language of quantum mechanics. Before launching into the technical details of indiscernible particles, however, I begin this essay with some remarks on the methodology -- instrumentalism -- which motivates my arguments.

Weighted fractional permutation entropy and fractional sample entropy for nonlinear Potts financial dynamics

NASA Astrophysics Data System (ADS)

Xu, Kaixuan; Wang, Jun

2017-02-01

In this paper, recently introduced permutation entropy and sample entropy are further developed to the fractional cases, weighted fractional permutation entropy (WFPE) and fractional sample entropy (FSE). The fractional order generalization of information entropy is utilized in the above two complexity approaches, to detect the statistical characteristics of fractional order information in complex systems. The effectiveness analysis of proposed methods on the synthetic data and the real-world data reveals that tuning the fractional order allows a high sensitivity and more accurate characterization to the signal evolution, which is useful in describing the dynamics of complex systems. Moreover, the numerical research on nonlinear complexity behaviors is compared between the returns series of Potts financial model and the actual stock markets. And the empirical results confirm the feasibility of the proposed model.

Bit-level plane image encryption based on coupled map lattice with time-varying delay

NASA Astrophysics Data System (ADS)

Lv, Xiupin; Liao, Xiaofeng; Yang, Bo

2018-04-01

Most of the existing image encryption algorithms had two basic properties: confusion and diffusion in a pixel-level plane based on various chaotic systems. Actually, permutation in a pixel-level plane could not change the statistical characteristics of an image, and many of the existing color image encryption schemes utilized the same method to encrypt R, G and B components, which means that the three color components of a color image are processed three times independently. Additionally, dynamical performance of a single chaotic system degrades greatly with finite precisions in computer simulations. In this paper, a novel coupled map lattice with time-varying delay therefore is applied in color images bit-level plane encryption to solve the above issues. Spatiotemporal chaotic system with both much longer period in digitalization and much excellent performances in cryptography is recommended. Time-varying delay embedded in coupled map lattice enhances dynamical behaviors of the system. Bit-level plane image encryption algorithm has greatly reduced the statistical characteristics of an image through the scrambling processing. The R, G and B components cross and mix with one another, which reduces the correlation among the three components. Finally, simulations are carried out and all the experimental results illustrate that the proposed image encryption algorithm is highly secure, and at the same time, also demonstrates superior performance.

Extra Solar Planet Science With a Non Redundant Mask

NASA Astrophysics Data System (ADS)

Minto, Stefenie Nicolet; Sivaramakrishnan, Anand; Greenbaum, Alexandra; St. Laurent, Kathryn; Thatte, Deeparshi

2017-01-01

To detect faint planetary companions near a much brighter star, at the Resolution Limit of the James Webb Space Telescope (JWST) the Near-Infrared Imager and Slitless Spectrograph (NIRISS) will use a non-redundant aperture mask (NRM) for high contrast imaging. I simulated NIRISS data of stars with and without planets, and run these through the code that measures interferometric image properties to determine how sensitive planetary detection is to our knowledge of instrumental parameters, starting with the pixel scale. I measured the position angle, distance, and contrast ratio of the planet (with respect to the star) to characterize the binary pair. To organize this data I am creating programs that will automatically and systematically explore multi-dimensional instrument parameter spaces and binary characteristics. In the future my code will also be applied to explore any other parameters we can simulate.

Broadband and chiral binary dielectric meta-holograms.

PubMed

Khorasaninejad, Mohammadreza; Ambrosio, Antonio; Kanhaiya, Pritpal; Capasso, Federico

2016-05-01

Subwavelength structured surfaces, known as meta-surfaces, hold promise for future compact and optically thin devices with versatile functionalities. By revisiting the concept of detour phase, we demonstrate high-efficiency holograms with broadband and chiral imaging functionalities. In our devices, the apertures of binary holograms are replaced by subwavelength structured microgratings. We achieve broadband operation from the visible to the near infrared and efficiency as high as 75% in the 1.0 to 1.4 μm range by compensating for the inherent dispersion of the detour phase with that of the subwavelength structure. In addition, we demonstrate chiral holograms that project different images depending on the handedness of the reference beam by incorporating a geometric phase. Our devices' compactness, lightness, and ability to produce images even at large angles have significant potential for important emerging applications such as wearable optics.

Broadband and chiral binary dielectric meta-holograms

PubMed Central

Khorasaninejad, Mohammadreza; Ambrosio, Antonio; Kanhaiya, Pritpal; Capasso, Federico

2016-01-01

Subwavelength structured surfaces, known as meta-surfaces, hold promise for future compact and optically thin devices with versatile functionalities. By revisiting the concept of detour phase, we demonstrate high-efficiency holograms with broadband and chiral imaging functionalities. In our devices, the apertures of binary holograms are replaced by subwavelength structured microgratings. We achieve broadband operation from the visible to the near infrared and efficiency as high as 75% in the 1.0 to 1.4 μm range by compensating for the inherent dispersion of the detour phase with that of the subwavelength structure. In addition, we demonstrate chiral holograms that project different images depending on the handedness of the reference beam by incorporating a geometric phase. Our devices’ compactness, lightness, and ability to produce images even at large angles have significant potential for important emerging applications such as wearable optics. PMID:27386518

Recovering DC coefficients in block-based DCT.

PubMed

Uehara, Takeyuki; Safavi-Naini, Reihaneh; Ogunbona, Philip

2006-11-01

It is a common approach for JPEG and MPEG encryption systems to provide higher protection for dc coefficients and less protection for ac coefficients. Some authors have employed a cryptographic encryption algorithm for the dc coefficients and left the ac coefficients to techniques based on random permutation lists which are known to be weak against known-plaintext and chosen-ciphertext attacks. In this paper we show that in block-based DCT, it is possible to recover dc coefficients from ac coefficients with reasonable image quality and show the insecurity of image encryption methods which rely on the encryption of dc values using a cryptoalgorithm. The method proposed in this paper combines dc recovery from ac coefficients and the fact that ac coefficients can be recovered using a chosen ciphertext attack. We demonstrate that a method proposed by Tang to encrypt and decrypt MPEG video can be completely broken.

Brown Dwarfs in our Backyard

NASA Image and Video Library

2014-03-07

The third closest star system to the sun, called WISE J104915.57-531906, center of large image, which was taken by NASA WISE. It appeared to be a single object, but a sharper image from Gemini Observatory, revealed that it was binary star system.

Tissues segmentation based on multi spectral medical images

NASA Astrophysics Data System (ADS)

Li, Ya; Wang, Ying

2017-11-01

Each band image contains the most obvious tissue feature according to the optical characteristics of different tissues in different specific bands for multispectral medical images. In this paper, the tissues were segmented by their spectral information at each multispectral medical images. Four Local Binary Patter descriptors were constructed to extract blood vessels based on the gray difference between the blood vessels and their neighbors. The segmented tissue in each band image was merged to a clear image.

Fermion systems in discrete space-time

NASA Astrophysics Data System (ADS)

Finster, Felix

2007-05-01

Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

Dynamic Testing and Automatic Repair of Reconfigurable Wiring Harnesses

DTIC Science & Technology

2006-11-27

Switch An M ×N grid of switches configured to provide a M -input, N -output routing network. Permutation Network A permutation network performs an...wiring reduces the effective advantage of their reduced switch count, particularly when considering that regular grids (crossbar switches being a...are connected to. The outline circuit shown in Fig. 20 shows how a suitable ‘discovery probe’ might be implemented. The circuit shows a UART

Research of Planetary Gear Fault Diagnosis Based on Permutation Entropy of CEEMDAN and ANFIS

PubMed Central

Kuai, Moshen; Cheng, Gang; Li, Yong

2018-01-01

For planetary gear has the characteristics of small volume, light weight and large transmission ratio, it is widely used in high speed and high power mechanical system. Poor working conditions result in frequent failures of planetary gear. A method is proposed for diagnosing faults in planetary gear based on permutation entropy of Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) Adaptive Neuro-fuzzy Inference System (ANFIS) in this paper. The original signal is decomposed into 6 intrinsic mode functions (IMF) and residual components by CEEMDAN. Since the IMF contains the main characteristic information of planetary gear faults, time complexity of IMFs are reflected by permutation entropies to quantify the fault features. The permutation entropies of each IMF component are defined as the input of ANFIS, and its parameters and membership functions are adaptively adjusted according to training samples. Finally, the fuzzy inference rules are determined, and the optimal ANFIS is obtained. The overall recognition rate of the test sample used for ANFIS is 90%, and the recognition rate of gear with one missing tooth is relatively high. The recognition rates of different fault gears based on the method can also achieve better results. Therefore, the proposed method can be applied to planetary gear fault diagnosis effectively. PMID:29510569

Research of Planetary Gear Fault Diagnosis Based on Permutation Entropy of CEEMDAN and ANFIS.

PubMed

Kuai, Moshen; Cheng, Gang; Pang, Yusong; Li, Yong

2018-03-05

For planetary gear has the characteristics of small volume, light weight and large transmission ratio, it is widely used in high speed and high power mechanical system. Poor working conditions result in frequent failures of planetary gear. A method is proposed for diagnosing faults in planetary gear based on permutation entropy of Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) Adaptive Neuro-fuzzy Inference System (ANFIS) in this paper. The original signal is decomposed into 6 intrinsic mode functions (IMF) and residual components by CEEMDAN. Since the IMF contains the main characteristic information of planetary gear faults, time complexity of IMFs are reflected by permutation entropies to quantify the fault features. The permutation entropies of each IMF component are defined as the input of ANFIS, and its parameters and membership functions are adaptively adjusted according to training samples. Finally, the fuzzy inference rules are determined, and the optimal ANFIS is obtained. The overall recognition rate of the test sample used for ANFIS is 90%, and the recognition rate of gear with one missing tooth is relatively high. The recognition rates of different fault gears based on the method can also achieve better results. Therefore, the proposed method can be applied to planetary gear fault diagnosis effectively.

4-D Imaging and Modeling of Eta Carinae's Inner Fossil Wind Structures

NASA Astrophysics Data System (ADS)

Madura, Thomas I.; Gull, Theodore; Teodoro, Mairan; Clementel, Nicola; Corcoran, Michael; Damineli, Augusto; Groh, Jose; Hamaguchi, Kenji; Hillier, D. John; Moffat, Anthony; Richardson, Noel; Weigelt, Gerd; Lindler, Don; Feggans, Keith

2017-11-01

Eta Carinae is the most massive active binary within 10,000 light-years and is famous for the largest non-terminal stellar explosion ever recorded. Observations reveal that the supermassive (~120 M⊙) binary, consisting of an LBV and either a WR or extreme O star, undergoes dramatic changes every 5.54 years due to the stars' very eccentric orbits (e ~ 0.9). Many of these changes are caused by a dynamic wind-wind collision region (WWCR) between the stars, plus expanding fossil WWCRs formed one, two, and three 5.54-year cycles ago. The fossil WWCRs can be spatially and spectrally resolved by the Hubble Space Telescope/Space Telescope Imaging Spectrograph (HST/STIS). Starting in June 2009, we used the HST/STIS to spatially map Eta Carinae's fossil WWCRs across one full orbit, following temporal changes in several forbidden emission lines (e.g. [Feiii] 4659 Å, [Feii] 4815 Å), creating detailed data cubes at multiple epochs. Multiple wind structures were imaged, revealing details about the binary's orbital motion, photoionization properties, and recent (~5 - 15 year) mass-loss history. These observations allow us to test 3-D hydrodynamical and radiative-transfer models of the interacting winds. Our observations and models strongly suggest that the wind and photoionization properties of Eta Carinae's binary have not changed substantially over the past several orbital cycles. They also provide a baseline for following future changes in Eta Carinae, essential for understanding the late-stage evolution of this nearby supernova progenitor. For more details, see Gull et al. (2016) and references therein.

Altered resting-state connectivity within default mode network associated with late chronotype.

PubMed

Horne, Charlotte Mary; Norbury, Ray

2018-04-20

Current evidence suggests late chronotype individuals have an increased risk of developing depression. However, the underlying neural mechanisms of this association are not fully understood. Forty-six healthy, right-handed individuals free of current or previous diagnosis of depression, family history of depression or sleep disorder underwent resting-state functional Magnetic Resonance Imaging (rsFMRI). Using an Independent Component Analysis (ICA) approach, the Default Mode Network (DMN) was identified based on a well validated template. Linear effects of chronotype on DMN connectivity were tested for significance using non-parametric permutation tests (applying 5000 permutations). Sleep quality, age, gender, measures of mood and anxiety, time of scan and cortical grey matter volume were included as covariates in the regression model. A significant positive correlation between chronotype and functional connectivity within nodes of the DMN was observed, including; bilateral PCC and precuneus, such that later chronotype (participants with lower rMEQ scores) was associated with decreased connectivity within these regions. The current results appear consistent with altered DMN connectivity in depressed patients and weighted evidence towards reduced DMN connectivity in other at-risk populations which may, in part, explain the increased vulnerability for depression in late chronotype individuals. The effect may be driven by self-critical thoughts associated with late chronotype although future studies are needed to directly investigate this. Copyright © 2018 Elsevier Ltd. All rights reserved.

Pinwheel Nebula around WR 98a.

PubMed

Monnier; Tuthill; Danchi

1999-11-10

We present the first near-infrared images of the dusty Wolf-Rayet star WR 98a. Aperture-masking interferometry has been utilized to recover images at the diffraction limit of the Keck I telescope, less, similar50 mas at 2.2 µm. Multiepoch observations spanning about 1 yr have resolved the dust shell into a "pinwheel" nebula, the second example of a new class of dust shell first discovered around WR 104 by Tuthill, Monnier, & Danchi. Interpreting the collimated dust outflow in terms of an interacting winds model, the binary orbital parameters and apparent wind speed are derived: a period of 565+/-50 days, a viewing angle of 35&j0;+/-6 degrees from the pole, and a wind speed of 99+/-23 mas yr-1. This period is consistent with a possible approximately 588 day periodicity in the infrared light curve, linking the photometric variation to the binary orbit. Important implications for binary stellar evolution are discussed by identifying WR 104 and WR 98a as members of a class of massive, short-period binaries whose orbits were circularized during a previous red supergiant phase. The current component separation in each system is similar to the diameter of a red supergiant, which indicates that the supergiant phase was likely terminated by Roche lobe overflow, leading to the present Wolf-Rayet stage.

High-speed knots in the hourglass-shaped planetary nebula Hubble 12

NASA Astrophysics Data System (ADS)

Vaytet, N.; Rushton, A. P.; Lloyd, M.; Lopez, J. A.; Meaburn, J.; O'Brien, T. J.; Mitchell, D. L.; Pollacco, D.

We present a detailed kinematical analysis of the young compact hourglass-shaped planetary nebula Hb 12. We performed optical imaging and longslit spectroscopy of Hb 12 using the Manchester echelle spectrometer with the 2.1-m San Pedro Martir telescope. We reveal, for the first time, the presence of end caps (or knots) aligned with the bipolar lobes of the planetary nebula shell in a deep [N ii] 6584 image of Hb 12. We measured from our spectroscopy radial velocities of about 120 km s-1 for these knots. We have derived the inclination angle of the hourglass shaped nebular shell to be 65° to the line of sight. It has been suggested that Hb 12's central star system is an eclipsing binary which would imply a binary inclination of at least 80°. However, if the central binary has been the major shaping influence on the nebula then both nebula and binary would be expected to share a common inclination angle. Finally, we report the discovery of high-velocity knots with Hubble-type velocities, close to the core of Hb 12, observed in HA and oriented in the same direction as the end caps. Very different velocities and kinematical ages were calculated for the outer and inner knots showing that they may originate from different outburst events.

Imaging Survey of Subsystems in Secondary Components to Nearby Southern Dwarfs

NASA Astrophysics Data System (ADS)

Tokovinin, Andrei

2014-10-01

To improve the statistics of hierarchical multiplicity, secondary components of wide nearby binaries with solar-type primaries were surveyed at the SOAR telescope for evaluating the frequency of subsystems. Images of 17 faint secondaries were obtained with the SOAR Adaptive Module that improved the seeing; one new 0.''2 binary was detected. For all targets, photometry in the g', i', z' bands is given. Another 46 secondaries were observed by speckle interferometry, resolving 7 close subsystems. Adding literature data, the binarity of 95 secondary components is evaluated. We found that the detection-corrected frequency of secondary subsystems with periods in the well-surveyed range from 103 to 105 days is 0.21 ± 0.06—same as the normal frequency of such binaries among solar-type stars, 0.18. This indicates that wide binaries are unlikely to be produced by dynamical evolution of N-body systems, but are rather formed by fragmentation. Based on observations obtained at the Southern Astrophysical Research (SOAR) telescope, which is a joint project of the Ministério da Ciência, Tecnologia, e Inovação da República Federativa do Brasil, the U.S. National Optical Astronomy Observatory, the University of North Carolina at Chapel Hill, and Michigan State University.

Design quadrilateral apertures in binary computer-generated holograms of large space bandwidth product.

PubMed

Wang, Jing; Sheng, Yunlong

2016-09-20

A new approach for designing the binary computer-generated hologram (CGH) of a very large number of pixels is proposed. Diffraction of the CGH apertures is computed by the analytical Abbe transform and by considering the aperture edges as the basic diffracting elements. The computation cost is independent of the CGH size. The arbitrary-shaped polygonal apertures in the CGH consist of quadrilateral apertures, which are designed by assigning the binary phases using the parallel genetic algorithm with a local search, followed by optimizing the locations of the co-vertices with a direct search. The design results in high performance with low image reconstruction error.

Gravitational microlensing by double stars and planetary systems

NASA Technical Reports Server (NTRS)

Mao, Shunde; Paczynski, Bohdan

1991-01-01

Almost all stars are in binary systems. When the separation between the two components is comparable to the Einstein ring radius corresponding to the combined mass of the binary acting as a gravitational lens, then an extra pair of images can be created, and the light curve of a lensed source becomes complicated. It is estimated that about 10 percent of all lensing episodes of the Galactic bulge stars will strongly display the binary nature of the lens. The effect is strong even if the companion is a planet. A massive search for microlensing of the Galactic bulge stars may lead to a discovery of the first extrasolar planetary systems.

Different binarization processes validated against manual counts of fluorescent bacterial cells.

PubMed

Tamminga, Gerrit G; Paulitsch-Fuchs, Astrid H; Jansen, Gijsbert J; Euverink, Gert-Jan W

2016-09-01

State of the art software methods (such as fixed value approaches or statistical approaches) to create a binary image of fluorescent bacterial cells are not as accurate and precise as they should be for counting bacteria and measuring their area. To overcome these bottlenecks, we introduce biological significance to obtain a binary image from a greyscale microscopic image. Using our biological significance approach we are able to automatically count about the same number of cells as an individual researcher would do by manual/visual counting. Using the fixed value or statistical approach to obtain a binary image leads to about 20% less cells in automatic counting. In our procedure we included the area measurements of the bacterial cells to determine the right parameters for background subtraction and threshold values. In an iterative process the threshold and background subtraction values were incremented until the number of particles smaller than a typical bacterial cell is less than the number of bacterial cells with a certain area. This research also shows that every image has a specific threshold with respect to the optical system, magnification and staining procedure as well as the exposure time. The biological significance approach shows that automatic counting can be performed with the same accuracy, precision and reproducibility as manual counting. The same approach can be used to count bacterial cells using different optical systems (Leica, Olympus and Navitar), magnification factors (200× and 400×), staining procedures (DNA (Propidium Iodide) and RNA (FISH)) and substrates (polycarbonate filter or glass). Copyright © 2016 Elsevier B.V. All rights reserved.

Can Emotional and Behavioral Dysregulation in Youth Be Decoded from Functional Neuroimaging?

PubMed

Portugal, Liana C L; Rosa, Maria João; Rao, Anil; Bebko, Genna; Bertocci, Michele A; Hinze, Amanda K; Bonar, Lisa; Almeida, Jorge R C; Perlman, Susan B; Versace, Amelia; Schirda, Claudiu; Travis, Michael; Gill, Mary Kay; Demeter, Christine; Diwadkar, Vaibhav A; Ciuffetelli, Gary; Rodriguez, Eric; Forbes, Erika E; Sunshine, Jeffrey L; Holland, Scott K; Kowatch, Robert A; Birmaher, Boris; Axelson, David; Horwitz, Sarah M; Arnold, Eugene L; Fristad, Mary A; Youngstrom, Eric A; Findling, Robert L; Pereira, Mirtes; Oliveira, Leticia; Phillips, Mary L; Mourao-Miranda, Janaina

2016-01-01

High comorbidity among pediatric disorders characterized by behavioral and emotional dysregulation poses problems for diagnosis and treatment, and suggests that these disorders may be better conceptualized as dimensions of abnormal behaviors. Furthermore, identifying neuroimaging biomarkers related to dimensional measures of behavior may provide targets to guide individualized treatment. We aimed to use functional neuroimaging and pattern regression techniques to determine whether patterns of brain activity could accurately decode individual-level severity on a dimensional scale measuring behavioural and emotional dysregulation at two different time points. A sample of fifty-seven youth (mean age: 14.5 years; 32 males) was selected from a multi-site study of youth with parent-reported behavioral and emotional dysregulation. Participants performed a block-design reward paradigm during functional Magnetic Resonance Imaging (fMRI). Pattern regression analyses consisted of Relevance Vector Regression (RVR) and two cross-validation strategies implemented in the Pattern Recognition for Neuroimaging toolbox (PRoNTo). Medication was treated as a binary confounding variable. Decoded and actual clinical scores were compared using Pearson's correlation coefficient (r) and mean squared error (MSE) to evaluate the models. Permutation test was applied to estimate significance levels. Relevance Vector Regression identified patterns of neural activity associated with symptoms of behavioral and emotional dysregulation at the initial study screen and close to the fMRI scanning session. The correlation and the mean squared error between actual and decoded symptoms were significant at the initial study screen and close to the fMRI scanning session. However, after controlling for potential medication effects, results remained significant only for decoding symptoms at the initial study screen. Neural regions with the highest contribution to the pattern regression model included cerebellum, sensory-motor and fronto-limbic areas. The combination of pattern regression models and neuroimaging can help to determine the severity of behavioral and emotional dysregulation in youth at different time points.

Rényi entropy measure of noise-aided information transmission in a binary channel.

PubMed

Chapeau-Blondeau, François; Rousseau, David; Delahaies, Agnès

2010-05-01

This paper analyzes a binary channel by means of information measures based on the Rényi entropy. The analysis extends, and contains as a special case, the classic reference model of binary information transmission based on the Shannon entropy measure. The extended model is used to investigate further possibilities and properties of stochastic resonance or noise-aided information transmission. The results demonstrate that stochastic resonance occurs in the information channel and is registered by the Rényi entropy measures at any finite order, including the Shannon order. Furthermore, in definite conditions, when seeking the Rényi information measures that best exploit stochastic resonance, then nontrivial orders differing from the Shannon case usually emerge. In this way, through binary information transmission, stochastic resonance identifies optimal Rényi measures of information differing from the classic Shannon measure. A confrontation of the quantitative information measures with visual perception is also proposed in an experiment of noise-aided binary image transmission.

Improved opponent color local binary patterns: an effective local image descriptor for color texture classification

NASA Astrophysics Data System (ADS)

Bianconi, Francesco; Bello-Cerezo, Raquel; Napoletano, Paolo

2018-01-01

Texture classification plays a major role in many computer vision applications. Local binary patterns (LBP) encoding schemes have largely been proven to be very effective for this task. Improved LBP (ILBP) are conceptually simple, easy to implement, and highly effective LBP variants based on a point-to-average thresholding scheme instead of a point-to-point one. We propose the use of this encoding scheme for extracting intra- and interchannel features for color texture classification. We experimentally evaluated the resulting improved opponent color LBP alone and in concatenation with the ILBP of the local color contrast map on a set of image classification tasks over 9 datasets of generic color textures and 11 datasets of biomedical textures. The proposed approach outperformed other grayscale and color LBP variants in nearly all the datasets considered and proved competitive even against image features from last generation convolutional neural networks, particularly for the classification of biomedical images.

Global detection of large lunar craters based on the CE-1 digital elevation model

NASA Astrophysics Data System (ADS)

Luo, Lei; Mu, Lingli; Wang, Xinyuan; Li, Chao; Ji, Wei; Zhao, Jinjin; Cai, Heng

2013-12-01

Craters, one of the most significant features of the lunar surface, have been widely researched because they offer us the relative age of the surface unit as well as crucial geological information. Research on crater detection algorithms (CDAs) of the Moon and other planetary bodies has concentrated on detecting them from imagery data, but the computational cost of detecting large craters using images makes these CDAs impractical. This paper presents a new approach to crater detection that utilizes a digital elevation model instead of images; this enables fully automatic global detection of large craters. Craters were delineated by terrain attributes, and then thresholding maps of terrain attributes were used to transform topographic data into a binary image, finally craters were detected by using the Hough Transform from the binary image. By using the proposed algorithm, we produced a catalog of all craters ⩾10 km in diameter on the lunar surface and analyzed their distribution and population characteristics.

Diagnosis of skin cancer using image processing

NASA Astrophysics Data System (ADS)

Guerra-Rosas, Esperanza; Álvarez-Borrego, Josué; Coronel-Beltrán, Ángel

2014-10-01

In this papera methodology for classifying skin cancerin images of dermatologie spots based on spectral analysis using the K-law Fourier non-lineartechnique is presented. The image is segmented and binarized to build the function that contains the interest area. The image is divided into their respective RGB channels to obtain the spectral properties of each channel. The green channel contains more information and therefore this channel is always chosen. This information is point to point multiplied by a binary mask and to this result a Fourier transform is applied written in nonlinear form. If the real part of this spectrum is positive, the spectral density takeunit values, otherwise are zero. Finally the ratio of the sum of the unit values of the spectral density with the sum of values of the binary mask are calculated. This ratio is called spectral index. When the value calculated is in the spectral index range three types of cancer can be detected. Values found out of this range are benign injure.

OBSERVATIONS OF BINARY STARS WITH THE DIFFERENTIAL SPECKLE SURVEY INSTRUMENT. IV. OBSERVATIONS OF KEPLER, CoRoT, AND HIPPARCOS STARS FROM THE GEMINI NORTH TELESCOPE

DOE Office of Scientific and Technical Information (OSTI.GOV)

Horch, Elliott P.; Howell, Steve B.; Everett, Mark E.

2012-12-01

We present the results of 71 speckle observations of binary and unresolved stars, most of which were observed with the DSSI speckle camera at the Gemini North Telescope in 2012 July. The main purpose of the run was to obtain diffraction-limited images of high-priority targets for the Kepler and CoRoT missions, but in addition, we observed a number of close binary stars where the resolution limit of Gemini was used to better determine orbital parameters and/or confirm results obtained at or below the diffraction limit of smaller telescopes. Five new binaries and one triple system were discovered, and first orbitsmore » are calculated for other two systems. Several systems are discussed in detail.« less

General Rotorcraft Aeromechanical Stability Program (GRASP) - Theory Manual

DTIC Science & Technology

1990-10-01

the A basis. Two symbols frequently encountered in vector operations that use index notation are the Kronecker delta eij and the Levi - Civita epsilon...Blade root cutout fijk Levi - Civita epsilon permutation symbol 0 pretwist angle 0’ pretwist per unit length (d;) Oi Tait-Bryan angles K~i moment strains...the components of the identity tensor in a Cartesian coordinate system, while the Levi Civita epsilon consists of components of the permutation

Using permutations to detect dependence between time series

NASA Astrophysics Data System (ADS)

Cánovas, Jose S.; Guillamón, Antonio; Ruíz, María del Carmen

2011-07-01

In this paper, we propose an independence test between two time series which is based on permutations. The proposed test can be carried out by means of different common statistics such as Pearson’s chi-square or the likelihood ratio. We also point out why an exact test is necessary. Simulated and real data (return exchange rates between several currencies) reveal the capacity of this test to detect linear and nonlinear dependences.

Testing of Error-Correcting Sparse Permutation Channel Codes

NASA Technical Reports Server (NTRS)

Shcheglov, Kirill, V.; Orlov, Sergei S.

2008-01-01

A computer program performs Monte Carlo direct numerical simulations for testing sparse permutation channel codes, which offer strong error-correction capabilities at high code rates and are considered especially suitable for storage of digital data in holographic and volume memories. A word in a code of this type is characterized by, among other things, a sparseness parameter (M) and a fixed number (K) of 1 or "on" bits in a channel block length of N.

Scrambled Sobol Sequences via Permutation

DTIC Science & Technology

2009-01-01

LCG LCG64 LFG MLFG PMLCG Sobol Scrambler PermutationScrambler LinearScrambler <<uses>> PermuationFactory StaticFactory DynamicFactory <<uses>> Figure 3...Phy., 19:252–256, 1979. [2] Emanouil I. Atanassov. A new efficient algorithm for generating the scrambled sobol ’ sequence. In NMA ’02: Revised Papers...Deidre W.Evan, and Micheal Mascagni. On the scrambled sobol sequence. In ICCS2005, pages 775–782, 2005. [7] Richard Durstenfeld. Algorithm 235: Random

Data Decomposition Techniques with Multi-Scale Permutation Entropy Calculations for Bearing Fault Diagnosis

PubMed Central

Yasir, Muhammad Naveed; Koh, Bong-Hwan

2018-01-01

This paper presents the local mean decomposition (LMD) integrated with multi-scale permutation entropy (MPE), also known as LMD-MPE, to investigate the rolling element bearing (REB) fault diagnosis from measured vibration signals. First, the LMD decomposed the vibration data or acceleration measurement into separate product functions that are composed of both amplitude and frequency modulation. MPE then calculated the statistical permutation entropy from the product functions to extract the nonlinear features to assess and classify the condition of the healthy and damaged REB system. The comparative experimental results of the conventional LMD-based multi-scale entropy and MPE were presented to verify the authenticity of the proposed technique. The study found that LMD-MPE’s integrated approach provides reliable, damage-sensitive features when analyzing the bearing condition. The results of REB experimental datasets show that the proposed approach yields more vigorous outcomes than existing methods. PMID:29690526

Optimization and experimental realization of the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

Yalçınkaya, I.; Gedik, Z.

2017-12-01

The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its n -qubit implementations, the number of required quantum gates scales quadratically with n due to the quantum Fourier transforms included. We show here for the n -qubit case that the algorithm can be simplified so that it requires only O (n ) quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

A faster 1.375-approximation algorithm for sorting by transpositions.

PubMed

Cunha, Luís Felipe I; Kowada, Luis Antonio B; Hausen, Rodrigo de A; de Figueiredo, Celina M H

2015-11-01

Sorting by Transpositions is an NP-hard problem for which several polynomial-time approximation algorithms have been developed. Hartman and Shamir (2006) developed a 1.5-approximation [Formula: see text] algorithm, whose running time was improved to O(nlogn) by Feng and Zhu (2007) with a data structure they defined, the permutation tree. Elias and Hartman (2006) developed a 1.375-approximation O(n(2)) algorithm, and Firoz et al. (2011) claimed an improvement to the running time, from O(n(2)) to O(nlogn), by using the permutation tree. We provide counter-examples to the correctness of Firoz et al.'s strategy, showing that it is not possible to reach a component by sufficient extensions using the method proposed by them. In addition, we propose a 1.375-approximation algorithm, modifying Elias and Hartman's approach with the use of permutation trees and achieving O(nlogn) time.

A Weak Quantum Blind Signature with Entanglement Permutation

NASA Astrophysics Data System (ADS)

Lou, Xiaoping; Chen, Zhigang; Guo, Ying

2015-09-01

Motivated by the permutation encryption algorithm, a weak quantum blind signature (QBS) scheme is proposed. It involves three participants, including the sender Alice, the signatory Bob and the trusted entity Charlie, in four phases, i.e., initializing phase, blinding phase, signing phase and verifying phase. In a small-scale quantum computation network, Alice blinds the message based on a quantum entanglement permutation encryption algorithm that embraces the chaotic position string. Bob signs the blinded message with private parameters shared beforehand while Charlie verifies the signature's validity and recovers the original message. Analysis shows that the proposed scheme achieves the secure blindness for the signer and traceability for the message owner with the aid of the authentic arbitrator who plays a crucial role when a dispute arises. In addition, the signature can neither be forged nor disavowed by the malicious attackers. It has a wide application to E-voting and E-payment system, etc.

Phase Transitions in Definite Total Spin States of Two-Component Fermi Gases.

PubMed

Yurovsky, Vladimir A

2017-05-19

Second-order phase transitions have no latent heat and are characterized by a change in symmetry. In addition to the conventional symmetric and antisymmetric states under permutations of bosons and fermions, mathematical group-representation theory allows for non-Abelian permutation symmetry. Such symmetry can be hidden in states with defined total spins of spinor gases, which can be formed in optical cavities. The present work shows that the symmetry reveals itself in spin-independent or coordinate-independent properties of these gases, namely as non-Abelian entropy in thermodynamic properties. In weakly interacting Fermi gases, two phases appear associated with fermionic and non-Abelian symmetry under permutations of particle states, respectively. The second-order transitions between the phases are characterized by discontinuities in specific heat. Unlike other phase transitions, the present ones are not caused by interactions and can appear even in ideal gases. Similar effects in Bose gases and strong interactions are discussed.

Data Decomposition Techniques with Multi-Scale Permutation Entropy Calculations for Bearing Fault Diagnosis.

PubMed

Yasir, Muhammad Naveed; Koh, Bong-Hwan

2018-04-21

This paper presents the local mean decomposition (LMD) integrated with multi-scale permutation entropy (MPE), also known as LMD-MPE, to investigate the rolling element bearing (REB) fault diagnosis from measured vibration signals. First, the LMD decomposed the vibration data or acceleration measurement into separate product functions that are composed of both amplitude and frequency modulation. MPE then calculated the statistical permutation entropy from the product functions to extract the nonlinear features to assess and classify the condition of the healthy and damaged REB system. The comparative experimental results of the conventional LMD-based multi-scale entropy and MPE were presented to verify the authenticity of the proposed technique. The study found that LMD-MPE’s integrated approach provides reliable, damage-sensitive features when analyzing the bearing condition. The results of REB experimental datasets show that the proposed approach yields more vigorous outcomes than existing methods.

An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Shao, Zhongshi; Pi, Dechang; Shao, Weishi

2017-11-01

This article proposes an extended continuous estimation of distribution algorithm (ECEDA) to solve the permutation flow-shop scheduling problem (PFSP). In ECEDA, to make a continuous estimation of distribution algorithm (EDA) suitable for the PFSP, the largest order value rule is applied to convert continuous vectors to discrete job permutations. A probabilistic model based on a mixed Gaussian and Cauchy distribution is built to maintain the exploration ability of the EDA. Two effective local search methods, i.e. revolver-based variable neighbourhood search and Hénon chaotic-based local search, are designed and incorporated into the EDA to enhance the local exploitation. The parameters of the proposed ECEDA are calibrated by means of a design of experiments approach. Simulation results and comparisons based on some benchmark instances show the efficiency of the proposed algorithm for solving the PFSP.

Autonomous vision-based navigation for proximity operations around binary asteroids

NASA Astrophysics Data System (ADS)

Gil-Fernandez, Jesus; Ortega-Hernando, Guillermo

2018-02-01

Future missions to small bodies demand higher level of autonomy in the Guidance, Navigation and Control system for higher scientific return and lower operational costs. Different navigation strategies have been assessed for ESA's asteroid impact mission (AIM). The main objective of AIM is the detailed characterization of binary asteroid Didymos. The trajectories for the proximity operations shall be intrinsically safe, i.e., no collision in presence of failures (e.g., spacecraft entering safe mode), perturbations (e.g., non-spherical gravity field), and errors (e.g., maneuver execution error). Hyperbolic arcs with sufficient hyperbolic excess velocity are designed to fulfil the safety, scientific, and operational requirements. The trajectory relative to the asteroid is determined using visual camera images. The ground-based trajectory prediction error at some points is comparable to the camera Field Of View (FOV). Therefore, some images do not contain the entire asteroid. Autonomous navigation can update the state of the spacecraft relative to the asteroid at higher frequency. The objective of the autonomous navigation is to improve the on-board knowledge compared to the ground prediction. The algorithms shall fit in off-the-shelf, space-qualified avionics. This note presents suitable image processing and relative-state filter algorithms for autonomous navigation in proximity operations around binary asteroids.

Autonomous vision-based navigation for proximity operations around binary asteroids

NASA Astrophysics Data System (ADS)

Gil-Fernandez, Jesus; Ortega-Hernando, Guillermo

2018-06-01

Future missions to small bodies demand higher level of autonomy in the Guidance, Navigation and Control system for higher scientific return and lower operational costs. Different navigation strategies have been assessed for ESA's asteroid impact mission (AIM). The main objective of AIM is the detailed characterization of binary asteroid Didymos. The trajectories for the proximity operations shall be intrinsically safe, i.e., no collision in presence of failures (e.g., spacecraft entering safe mode), perturbations (e.g., non-spherical gravity field), and errors (e.g., maneuver execution error). Hyperbolic arcs with sufficient hyperbolic excess velocity are designed to fulfil the safety, scientific, and operational requirements. The trajectory relative to the asteroid is determined using visual camera images. The ground-based trajectory prediction error at some points is comparable to the camera Field Of View (FOV). Therefore, some images do not contain the entire asteroid. Autonomous navigation can update the state of the spacecraft relative to the asteroid at higher frequency. The objective of the autonomous navigation is to improve the on-board knowledge compared to the ground prediction. The algorithms shall fit in off-the-shelf, space-qualified avionics. This note presents suitable image processing and relative-state filter algorithms for autonomous navigation in proximity operations around binary asteroids.

Quantification of synthesized hydration products using synchrotron microtomography and spectral analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deboodt, Tyler; Ideker, Jason H.; Isgor, O. Burkan

2017-12-01

The use of x-ray computed tomography (CT) as a standalone method has primarily been used to characterize pore structure, cracking and mechanical damage in cementitious systems due to low contrast in the hydrated phases. These limitations have resulted in the inability to extract quantifiable information on such phases. The goal of this research was to address the limitations caused by low contrast and improving the ability to distinguish the four primary hydrated phases in portland cement; C-S-H, calcium hydroxide, monosulfate, and ettringite. X-ray CT on individual layers, binary mixtures of phases, and quaternary mixtures of phases to represent a hydratedmore » portland cement paste were imaged with synchrotron radiation. Known masses of each phase were converted to a volume and compared to the segmented image volumes. It was observed that adequate contrast in binary mixing of phases allowed for segmentation, and subsequent image analysis indicated quantifiable volumes could be extracted from the tomographic volume. However, low contrast was observed when C-S-H and monosulfate were paired together leading to difficulties segmenting in an unbiased manner. Quantification of phases in quaternary mixtures included larger errors than binary mixes due to histogram overlaps of monosulfate, C-S-H, and calcium hydroxide.« less

Orbit of the young very low-mass spectroscopic binary CHXR 74

NASA Astrophysics Data System (ADS)

Joergens, V.; Janson, M.; Müller, A.

2012-01-01

The pre-main sequence star CHXR 74 (M4.25) in Chamaeleon I was found a few years ago to be a very low-mass spectroscopic binary. A determination of its mass would provide a valuable dynamical mass measurement at young ages in the poorly constrained mass regime of <0.3 M⊙. We carried out follow-up radial velocity monitoring with UVES/VLT between 2008 and 2011 and high-resolution adaptive-optic-assisted imaging with NACO/VLT in 2008 with the aim of constraining the binary orbit. We present an orbital solution of the system based on the combined radial velocity data set, which spans more than eleven years of UVES monitoring for CHXR 74. The best-fit Kepler model has an orbital period of 13.1 years, zero eccentricity, and a radial velocity semi-amplitude of 2.2 km s-1. A companion mass M2sini (which is a lower limit due to the unknown orbital inclination i) of 0.08 M⊙ is derived by using a model-dependent mass estimate for the primary of 0.24 M⊙. The binary separation (a1sini + a2) for an inclination of 90° is 3.8 AU, which corresponds to 23 mas. Complementary NACO/VLT images of CHXR 74 were taken with the aim to directly resolve the binary. While there are marginal signs of an extended point spread function (PSF), we have detected no convincing companion to CHXR 74 in the NACO images. From the non-detection of the companion together with a prediction of the binary separation at the time of the NACO observations, we derive an upper limit for the K-band brightness ratio of the two binary components of 0.5. This allows us to estimate an upper limit of the companion mass of 0.14 M⊙ by applying evolutionary models. Thus, we confirm that CHXR 74 is a very low-mass spectroscopic binary and constrain the secondary mass to lie within the range of about 0.08 and 0.14 M⊙. We predict an astrometric signal of the primary between 0.2 and 0.4 mas when taking into account the luminosity of the companion. The Gaia astrometric mission might well be able to solve the astrometric orbit of the primary and in combination with the presented radial velocity data determine an absolute companion mass. Based on observations obtained at the Very Large Telescope of the European Southern Observatory at Paranal, Chile with UVES in program 65.I-0011(A), 72.C-0653(A), 75.C-0851(C), 77.C-0831(A+D), 380.C-0596(A), 082.C-0023(A), 087.C-0962(B), and with NACO in program 380.C-0596(B).

BOREAS RSS-7 Landsat TM LAI IMages of the SSA and NSA

NASA Technical Reports Server (NTRS)

Hall, Forrest G. (Editor); Nickeson, Jaime (Editor); Chen, Jing; Cihlar, Josef

2000-01-01

The BOReal Ecosystem-Atmosphere Study Remote Sensing Science (BOREAS RSS-7) team used Landsat Thematic Mapper (TM) images processed at CCRS to produce images of Leaf Area Index (LAI) for the BOREAS study areas. Two images acquired on 06-Jun and 09-Aug-1991 were used for the SSA, and one image acquired on 09-Jun-1994 was used for the NSA. The LAI images are based on ground measurements and Landsat TM Reduced Simple Ratio (RSR) images. The data are stored in binary image-format files.

Primordial main equence binary stars in the globular cluster M71

NASA Technical Reports Server (NTRS)

Yan, Lin; Mateo, Mario

1994-01-01

We report the identification of five short-period variables near the center of the metal-rich globular cluster M71. Our observations consist of multiepoch VI charge coupled device (CCD) images centered on the cluster and covering a 6.3 min x 6.3 min field. Four of these variables are contact eclipsing binaries with periods between 0.35 and 0.41 days; one is a detached or semidetached eclipsing binary with a period of 0.56 days. Two of the variables were first identified as possible eclipsing binaries in an earlier survey by Hodder et al. (1992). We have used a variety of arguments to conclude that all five binary stars are probable members of M71, a result that is consistent with the low number (0.15) of short-period field binaries expected along this line of sight. Based on a simple model of how contact binaries evolve from initially detached binaries, we have determined a lower limit of 1.3% on the frequency of primordial binaries in M71 with initial orbital periods in the range 2.5 - 5 days. This implies that the overall primordial binary frequency, f, is 22(sup +26)(sub -12)% assuming df/d log P = const ( the 'flat' distribution), or f = 57(sup +15)(sub -8)% for df/d log P = 0.032 log P + const as observed for G-dwarf binaries in the solar neighborhood (the 'sloped' distribution). Both estimates of f correspond to binaries with initial periods shorter than 800 yr since any longer-period binaries would have been disrupted over the lifetime of the cluster. Our short-period binary frequency is in excellent agreement with the observed frequency of red-giant binaries observed in globulars if we adopt the flat distribution. For the sloped distribution, our results significantly overestimate the number of red-giant binaries. All of the short-period M71 binaries lie within 1 mag of the luminosity of the cluster turnoff in the color-magnitude diagram despite the fact we should have easily detected similar eclipsing binaries 2 - 2.5 mag fainter than this. We discuss the implications of this on our estimates of the binary frequency in M71 and on the formation of blue stragglers.

Image enhancement of optical images for binary system of melanocytes and keratinocytes

NASA Astrophysics Data System (ADS)

Takanezawa, S.; Baba, A.; Sako, Y.; Ozaki, Y.; Date, A.; Toyama, K.; Morita, S.

2013-05-01

Automatic determination of the cell shapes of large numbers of melanocytes based on optical images of human skin models have been largely unsuccessful (the complexities introduced by dendrites and the melanin pigmentation over the keratinocytes to give unclear outlines). Here, we present an image enhancement procedure for enhancing the contrast of images with removing the non-uniformity of background. The brightness is normalized also for the non-uniform population density of melanocytes.

10 CFR 2.1001 - Definitions.

Code of Federal Regulations, 2014 CFR

2014-01-01

... portions that are neither textual nor image in nature, and graphic or other Binary Large Objects that... docket materials. Image means a visual likeness of a document, presented on a paper copy, microform, or a... J of this part, including the authority of the Pre-License Application Presiding Officer designated...

10 CFR 2.1001 - Definitions.

Code of Federal Regulations, 2013 CFR

2013-01-01

... portions that are neither textual nor image in nature, and graphic or other Binary Large Objects that... docket materials. Image means a visual likeness of a document, presented on a paper copy, microform, or a... J of this part, including the authority of the Pre-License Application Presiding Officer designated...

Hyperspectral imaging for differentiation of foreign materials from pinto beans

NASA Astrophysics Data System (ADS)

Mehrubeoglu, Mehrube; Zemlan, Michael; Henry, Sam

2015-09-01

Food safety and quality in packaged products are paramount in the food processing industry. To ensure that packaged products are free of foreign materials, such as debris and pests, unwanted materials mixed with the targeted products must be detected before packaging. A portable hyperspectral imaging system in the visible-to-NIR range has been used to acquire hyperspectral data cubes from pinto beans that have been mixed with foreign matter. Bands and band ratios have been identified as effective features to develop a classification scheme for detection of foreign materials in pinto beans. A support vector machine has been implemented with a quadratic kernel to separate pinto beans and background (Class 1) from all other materials (Class 2) in each scene. After creating a binary classification map for the scene, further analysis of these binary images allows separation of false positives from true positives for proper removal action during packaging.

A new study of the interacting binary star V356 Sgr

NASA Technical Reports Server (NTRS)

Polidan, R. S.

1988-01-01

Results on V356 Sgr from IUE and Voyager ultraviolet (500 to 3200 A) observations obtained in 1986 and 1987, primarily during 2 total eclipses are presented. The eclipse of Aug. 15, 1986 was fully covered with IUE low dispersion images and 9 hr of Voyager UVS data. The eclipse of Mar. 25, 1987 was covered with IUE low dispersion images and 1 high dispersion SWP image. During both eclipses the total strength of the emission lines is found to be invariant. An uneclipsed UV continuum is detected at wavelengths shorter than 1500 A. The high dispersion SWP spectrum reveals that the emission lines are extremely broad, almost symmetrical emissions with weak, slightly blue shifted absorption components. No evidence of carbon, C I, C II, C III, or C IV, is seen in the emission or absorption spectrum of V356 Sgr in eclipse. Models for this binary system are presented.

Diffractive optics technology and the NASA Geostationary Earth Observatory (GEO)

NASA Technical Reports Server (NTRS)

Morris, G. Michael; Michaels, Robert L.; Faklis, Dean

1992-01-01

Diffractive (or binary) optics offers unique capabilities for the development of large-aperture, high-performance, light-weight optical systems. The Geostationary Earth Observatory (GEO) will consist of a variety of instruments to monitor the environmental conditions of the earth and its atmosphere. The aim of this investigation is to analyze the design of the GEO instrument that is being proposed and to identify the areas in which diffractive (or binary) optics technology can make a significant impact in GEO sensor design. Several potential applications where diffractive optics may indeed serve as a key technology for improving the performance and reducing the weight and cost of the GEO sensors have been identified. Applications include the use of diffractive/refractive hybrid lenses for aft-optic imagers, diffractive telescopes for narrowband imaging, subwavelength structured surfaces for anti-reflection and polarization control, and aberration compensation for reflective imaging systems and grating spectrometers.

Blind motion image deblurring using nonconvex higher-order total variation model

NASA Astrophysics Data System (ADS)

Li, Weihong; Chen, Rui; Xu, Shangwen; Gong, Weiguo

2016-09-01

We propose a nonconvex higher-order total variation (TV) method for blind motion image deblurring. First, we introduce a nonconvex higher-order TV differential operator to define a new model of the blind motion image deblurring, which can effectively eliminate the staircase effect of the deblurred image; meanwhile, we employ an image sparse prior to improve the edge recovery quality. Second, to improve the accuracy of the estimated motion blur kernel, we use L1 norm and H1 norm as the blur kernel regularization term, considering the sparsity and smoothing of the motion blur kernel. Third, because it is difficult to solve the numerically computational complexity problem of the proposed model owing to the intrinsic nonconvexity, we propose a binary iterative strategy, which incorporates a reweighted minimization approximating scheme in the outer iteration, and a split Bregman algorithm in the inner iteration. And we also discuss the convergence of the proposed binary iterative strategy. Last, we conduct extensive experiments on both synthetic and real-world degraded images. The results demonstrate that the proposed method outperforms the previous representative methods in both quality of visual perception and quantitative measurement.

Close Binary Star Speckle Interferometry on the McMath-Pierce 0.8-Meter Solar Telescope

NASA Astrophysics Data System (ADS)

Wiley, Edward; Harshaw, Richard; Jones, Gregory; Branston, Detrick; Boyce, Patrick; Rowe, David; Ridgely, John; Estrada, Reed; Genet, Russell

2015-09-01

Observations were made in April 2014 to assess the utility of the 0.8-meter solar telescope at the McMath-Pierce Solar Observatory at Kitt Peak National Observatory for performing speckle interferometry observations of close binary stars. Several configurations using science cameras, acquisition cameras, eyepieces, and flip mirrors were evaluated. Speckle images were obtained and recommendations for further improvement of the acquisition system are presented.

Amplitude-aware permutation entropy: Illustration in spike detection and signal segmentation.

PubMed

Azami, Hamed; Escudero, Javier

2016-05-01

Signal segmentation and spike detection are two important biomedical signal processing applications. Often, non-stationary signals must be segmented into piece-wise stationary epochs or spikes need to be found among a background of noise before being further analyzed. Permutation entropy (PE) has been proposed to evaluate the irregularity of a time series. PE is conceptually simple, structurally robust to artifacts, and computationally fast. It has been extensively used in many applications, but it has two key shortcomings. First, when a signal is symbolized using the Bandt-Pompe procedure, only the order of the amplitude values is considered and information regarding the amplitudes is discarded. Second, in the PE, the effect of equal amplitude values in each embedded vector is not addressed. To address these issues, we propose a new entropy measure based on PE: the amplitude-aware permutation entropy (AAPE). AAPE is sensitive to the changes in the amplitude, in addition to the frequency, of the signals thanks to it being more flexible than the classical PE in the quantification of the signal motifs. To demonstrate how the AAPE method can enhance the quality of the signal segmentation and spike detection, a set of synthetic and realistic synthetic neuronal signals, electroencephalograms and neuronal data are processed. We compare the performance of AAPE in these problems against state-of-the-art approaches and evaluate the significance of the differences with a repeated ANOVA with post hoc Tukey's test. In signal segmentation, the accuracy of AAPE-based method is higher than conventional segmentation methods. AAPE also leads to more robust results in the presence of noise. The spike detection results show that AAPE can detect spikes well, even when presented with single-sample spikes, unlike PE. For multi-sample spikes, the changes in AAPE are larger than in PE. We introduce a new entropy metric, AAPE, that enables us to consider amplitude information in the formulation of PE. The AAPE algorithm can be used in almost every irregularity-based application in various signal and image processing fields. We also made freely available the Matlab code of the AAPE. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Photospheric Magnetic Field Properties of Flaring versus Flare-quiet Active Regions. II. Discriminant Analysis

NASA Astrophysics Data System (ADS)

Leka, K. D.; Barnes, G.

2003-10-01

We apply statistical tests based on discriminant analysis to the wide range of photospheric magnetic parameters described in a companion paper by Leka & Barnes, with the goal of identifying those properties that are important for the production of energetic events such as solar flares. The photospheric vector magnetic field data from the University of Hawai'i Imaging Vector Magnetograph are well sampled both temporally and spatially, and we include here data covering 24 flare-event and flare-quiet epochs taken from seven active regions. The mean value and rate of change of each magnetic parameter are treated as separate variables, thus evaluating both the parameter's state and its evolution, to determine which properties are associated with flaring. Considering single variables first, Hotelling's T2-tests show small statistical differences between flare-producing and flare-quiet epochs. Even pairs of variables considered simultaneously, which do show a statistical difference for a number of properties, have high error rates, implying a large degree of overlap of the samples. To better distinguish between flare-producing and flare-quiet populations, larger numbers of variables are simultaneously considered; lower error rates result, but no unique combination of variables is clearly the best discriminator. The sample size is too small to directly compare the predictive power of large numbers of variables simultaneously. Instead, we rank all possible four-variable permutations based on Hotelling's T2-test and look for the most frequently appearing variables in the best permutations, with the interpretation that they are most likely to be associated with flaring. These variables include an increasing kurtosis of the twist parameter and a larger standard deviation of the twist parameter, but a smaller standard deviation of the distribution of the horizontal shear angle and a horizontal field that has a smaller standard deviation but a larger kurtosis. To support the ``sorting all permutations'' method of selecting the most frequently occurring variables, we show that the results of a single 10-variable discriminant analysis are consistent with the ranking. We demonstrate that individually, the variables considered here have little ability to differentiate between flaring and flare-quiet populations, but with multivariable combinations, the populations may be distinguished.

Improved spatial regression analysis of diffusion tensor imaging for lesion detection during longitudinal progression of multiple sclerosis in individual subjects

NASA Astrophysics Data System (ADS)

Liu, Bilan; Qiu, Xing; Zhu, Tong; Tian, Wei; Hu, Rui; Ekholm, Sven; Schifitto, Giovanni; Zhong, Jianhui

2016-03-01

Subject-specific longitudinal DTI study is vital for investigation of pathological changes of lesions and disease evolution. Spatial Regression Analysis of Diffusion tensor imaging (SPREAD) is a non-parametric permutation-based statistical framework that combines spatial regression and resampling techniques to achieve effective detection of localized longitudinal diffusion changes within the whole brain at individual level without a priori hypotheses. However, boundary blurring and dislocation limit its sensitivity, especially towards detecting lesions of irregular shapes. In the present study, we propose an improved SPREAD (dubbed improved SPREAD, or iSPREAD) method by incorporating a three-dimensional (3D) nonlinear anisotropic diffusion filtering method, which provides edge-preserving image smoothing through a nonlinear scale space approach. The statistical inference based on iSPREAD was evaluated and compared with the original SPREAD method using both simulated and in vivo human brain data. Results demonstrated that the sensitivity and accuracy of the SPREAD method has been improved substantially by adapting nonlinear anisotropic filtering. iSPREAD identifies subject-specific longitudinal changes in the brain with improved sensitivity, accuracy, and enhanced statistical power, especially when the spatial correlation is heterogeneous among neighboring image pixels in DTI.

A photometric analysis of the neglected EW-type binary V336 TrA

NASA Astrophysics Data System (ADS)

Kriwattanawong, W.; Sarotsakulchai, T.; Maungkorn, S.; Reichart, D. E.; Haislip, J. B.; Kouprianov, V. V.; LaCluyze, A. P.; Moore, J. P.

2018-05-01

This study presents an analysis of photometric light curves and absolute parameters for the EW-type binary V336 TrA. VRI imaging observations were taken in 2013 by using the robotic telescopes PROMPT 4 and PROMPT 5 at Cerro Tololo Inter-American Observatory (CTIO), Chile. The observed light curves were fitted by using the Wilson-Devinney method. The results showed that V336 TrA is a W-type contact binary with a mass ratio of q = 1.396. The binary is a weak contact system with a fill-out factor of f = 15.69%. The system contains components with masses of 0.653 M⊙ and 0.912 M⊙ for the hotter and the cooler, respectively. The location of the secondary (less massive) component on the log M - log L diagram was found to be near the TAMS. The component has evolved to be oversize and overluminous. The orbital angular momentum of the binary was found to be log Jo = 51.61 cgs, less than all detached systems for same mass. The system has undergone angular momentum and/or mass loss, during the binary evolution from the detached to contact system.

Inferring the Presence of Reverse Proxies Through Timing Analysis

DTIC Science & Technology

2015-06-01

16 Figure 3.2 The three different instances of timing measurement configurations 17 Figure 3.3 Permutation of a web request iteration...Their data showed that they could detect at least 6 bits of entropy between unlike devices and that it was enough to determine that they are in fact...depending on the permutation being executed so that every iteration was conducted under the same distance 15 City   Lat   Long   City   Lat   Long

Permutation entropy and statistical complexity analysis of turbulence in laboratory plasmas and the solar wind.

PubMed

Weck, P J; Schaffner, D A; Brown, M R; Wicks, R T

2015-02-01

The Bandt-Pompe permutation entropy and the Jensen-Shannon statistical complexity are used to analyze fluctuating time series of three different turbulent plasmas: the magnetohydrodynamic (MHD) turbulence in the plasma wind tunnel of the Swarthmore Spheromak Experiment (SSX), drift-wave turbulence of ion saturation current fluctuations in the edge of the Large Plasma Device (LAPD), and fully developed turbulent magnetic fluctuations of the solar wind taken from the Wind spacecraft. The entropy and complexity values are presented as coordinates on the CH plane for comparison among the different plasma environments and other fluctuation models. The solar wind is found to have the highest permutation entropy and lowest statistical complexity of the three data sets analyzed. Both laboratory data sets have larger values of statistical complexity, suggesting that these systems have fewer degrees of freedom in their fluctuations, with SSX magnetic fluctuations having slightly less complexity than the LAPD edge I(sat). The CH plane coordinates are compared to the shape and distribution of a spectral decomposition of the wave forms. These results suggest that fully developed turbulence (solar wind) occupies the lower-right region of the CH plane, and that other plasma systems considered to be turbulent have less permutation entropy and more statistical complexity. This paper presents use of this statistical analysis tool on solar wind plasma, as well as on an MHD turbulent experimental plasma.

Unifying the rotational and permutation symmetry of nuclear spin states: Schur-Weyl duality in molecular physics.

PubMed

Schmiedt, Hanno; Jensen, Per; Schlemmer, Stephan

2016-08-21

In modern physics and chemistry concerned with many-body systems, one of the mainstays is identical-particle-permutation symmetry. In particular, both the intra-molecular dynamics of a single molecule and the inter-molecular dynamics associated, for example, with reactive molecular collisions are strongly affected by selection rules originating in nuclear-permutation symmetry operations being applied to the total internal wavefunctions, including nuclear spin, of the molecules involved. We propose here a general tool to determine coherently the permutation symmetry and the rotational symmetry (associated with the group of arbitrary rotations of the entire molecule in space) of molecular wavefunctions, in particular the nuclear-spin functions. Thus far, these two symmetries were believed to be mutually independent and it has even been argued that under certain circumstances, it is impossible to establish a one-to-one correspondence between them. However, using the Schur-Weyl duality theorem we show that the two types of symmetry are inherently coupled. In addition, we use the ingenious representation-theory technique of Young tableaus to represent the molecular nuclear-spin degrees of freedom in terms of well-defined mathematical objects. This simplifies the symmetry classification of the nuclear wavefunction even for large molecules. Also, the application to reactive collisions is very straightforward and provides a much simplified approach to obtaining selection rules.

Unifying the rotational and permutation symmetry of nuclear spin states: Schur-Weyl duality in molecular physics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schmiedt, Hanno; Schlemmer, Stephan; Jensen, Per, E-mail: jensen@uni-wuppertal.de

In modern physics and chemistry concerned with many-body systems, one of the mainstays is identical-particle-permutation symmetry. In particular, both the intra-molecular dynamics of a single molecule and the inter-molecular dynamics associated, for example, with reactive molecular collisions are strongly affected by selection rules originating in nuclear-permutation symmetry operations being applied to the total internal wavefunctions, including nuclear spin, of the molecules involved. We propose here a general tool to determine coherently the permutation symmetry and the rotational symmetry (associated with the group of arbitrary rotations of the entire molecule in space) of molecular wavefunctions, in particular the nuclear-spin functions. Thusmore » far, these two symmetries were believed to be mutually independent and it has even been argued that under certain circumstances, it is impossible to establish a one-to-one correspondence between them. However, using the Schur-Weyl duality theorem we show that the two types of symmetry are inherently coupled. In addition, we use the ingenious representation-theory technique of Young tableaus to represent the molecular nuclear-spin degrees of freedom in terms of well-defined mathematical objects. This simplifies the symmetry classification of the nuclear wavefunction even for large molecules. Also, the application to reactive collisions is very straightforward and provides a much simplified approach to obtaining selection rules.« less

Potential energy surface fitting by a statistically localized, permutationally invariant, local interpolating moving least squares method for the many-body potential: Method and application to N{sub 4}

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bender, Jason D.; Doraiswamy, Sriram; Candler, Graham V., E-mail: truhlar@umn.edu, E-mail: candler@aem.umn.edu

2014-02-07

Fitting potential energy surfaces to analytic forms is an important first step for efficient molecular dynamics simulations. Here, we present an improved version of the local interpolating moving least squares method (L-IMLS) for such fitting. Our method has three key improvements. First, pairwise interactions are modeled separately from many-body interactions. Second, permutational invariance is incorporated in the basis functions, using permutationally invariant polynomials in Morse variables, and in the weight functions. Third, computational cost is reduced by statistical localization, in which we statistically correlate the cutoff radius with data point density. We motivate our discussion in this paper with amore » review of global and local least-squares-based fitting methods in one dimension. Then, we develop our method in six dimensions, and we note that it allows the analytic evaluation of gradients, a feature that is important for molecular dynamics. The approach, which we call statistically localized, permutationally invariant, local interpolating moving least squares fitting of the many-body potential (SL-PI-L-IMLS-MP, or, more simply, L-IMLS-G2), is used to fit a potential energy surface to an electronic structure dataset for N{sub 4}. We discuss its performance on the dataset and give directions for further research, including applications to trajectory calculations.« less

Multiwavelength observations of NaSt1 (WR 122): equatorial mass loss and X-rays from an interacting Wolf-Rayet binary

NASA Astrophysics Data System (ADS)

Mauerhan, Jon; Smith, Nathan; Van Dyk, Schuyler D.; Morzinski, Katie M.; Close, Laird M.; Hinz, Philip M.; Males, Jared R.; Rodigas, Timothy J.

2015-07-01

NaSt1 (aka Wolf-Rayet 122) is a peculiar emission-line star embedded in an extended nebula of [N II] emission with a compact dusty core. The object was previously characterized as a Wolf-Rayet (WR) star cloaked in an opaque nebula of CNO-processed material, perhaps analogous to η Car and its Homunculus nebula, albeit with a hotter central source. To discern the morphology of the [N II] nebula we performed narrow-band imaging using the Hubble Space Telescope and Wide-field Camera 3. The images reveal that the nebula has a disc-like geometry tilted ≈12° from edge-on, composed of a bright central ellipsoid surrounded by a larger clumpy ring. Ground-based spectroscopy reveals radial velocity structure (±10 km s-1) near the outer portions of the nebula's major axis, which is likely to be the imprint of outflowing gas. Near-infrared adaptive-optics imaging with Magellan AO has resolved a compact ellipsoid of Ks-band emission aligned with the larger [N II] nebula, which we suspect is the result of scattered He I line emission (λ2.06 μm). Observations with the Chandra X-ray Observatory have revealed an X-ray point source at the core of the nebula that is heavily absorbed at energies <1 keV and has properties consistent with WR stars and colliding-wind binaries. We suggest that NaSt1 is a WR binary embedded in an equatorial outflow that formed as the result of non-conservative mass transfer. NaSt1 thus appears to be a rare and important example of a stripped-envelope WR forming through binary interaction, caught in the brief Roche lobe overflow phase.

OBSERVATIONS OF BINARY STARS WITH THE DIFFERENTIAL SPECKLE SURVEY INSTRUMENT. III. MEASURES BELOW THE DIFFRACTION LIMIT OF THE WIYN TELESCOPE

DOE Office of Scientific and Technical Information (OSTI.GOV)

Horch, Elliott P.; Van Altena, William F.; Howell, Steve B.

2011-06-15

In this paper, we study the ability of CCD- and electron-multiplying-CCD-based speckle imaging to obtain reliable astrometry and photometry of binary stars below the diffraction limit of the WIYN 3.5 m Telescope. We present a total of 120 measures of binary stars, 75 of which are below the diffraction limit. The measures are divided into two groups that have different measurement accuracy and precision. The first group is composed of standard speckle observations, that is, a sequence of speckle images taken in a single filter, while the second group consists of paired observations where the two observations are taken onmore » the same observing run and in different filters. The more recent paired observations were taken simultaneously with the Differential Speckle Survey Instrument, which is a two-channel speckle imaging system. In comparing our results to the ephemeris positions of binaries with known orbits, we find that paired observations provide the opportunity to identify cases of systematic error in separation below the diffraction limit and after removing these from consideration, we obtain a linear measurement uncertainty of 3-4 mas. However, if observations are unpaired or if two observations taken in the same filter are paired, it becomes harder to identify cases of systematic error, presumably because the largest source of this error is residual atmospheric dispersion, which is color dependent. When observations are unpaired, we find that it is unwise to report separations below approximately 20 mas, as these are most susceptible to this effect. Using the final results obtained, we are able to update two older orbits in the literature and present preliminary orbits for three systems that were discovered by Hipparcos.« less

Masses of the Planetary Nebula Central Stars in the Galactic Globular Cluster System from HST Imaging and Spectroscopy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jacoby, George H.; Marco, Orsola De; Davies, James

The globular cluster (GC) system of our Galaxy contains four planetary nebulae (PNe): K 648 (or Ps 1) in M15, IRAS 18333-2357 in M22, JaFu 1 in Pal 6, and JaFu 2 in NGC 6441. Because single-star evolution at the low stellar mass of present-epoch GCs was considered incapable of producing visible PNe, their origin presented a puzzle. We imaged the PN JaFu 1 with the Hubble Space Telescope (HST) to obtain photometry of its central star (CS) and high-resolution morphological information. We imaged IRAS 18333-2357 with better depth and resolution, and we analyzed its archival HST spectra to constrainmore » its CS temperature and luminosity. All PNe in Galactic GCs now have quality HST data, allowing us to improve CS mass estimates. We find reasonably consistent masses between 0.53 and 0.58 M {sub ⊙} for all four objects, though estimates vary when adopting different stellar evolutionary calculations. The CS mass of IRAS 18333-2357, though, depends strongly on its temperature, which remains elusive due to reddening uncertainties. For all four objects, we consider their CS and nebula masses, their morphologies, and other incongruities to assess the likelihood that these objects formed from binary stars. Although generally limited by uncertainties (∼0.02 M {sub ⊙}) in post-AGB tracks and core mass versus luminosity relations, the high-mass CS in K 648 indicates a binary origin. The CS of JaFu 1 exhibits compact, bright [O iii] and H α emission, like EGB 6, suggesting a binary companion or disk. Evidence is weaker for a binary origin of JaFu 2.« less

Accounting for Non-Gaussian Sources of Spatial Correlation in Parametric Functional Magnetic Resonance Imaging Paradigms I: Revisiting Cluster-Based Inferences.

PubMed

Gopinath, Kaundinya; Krishnamurthy, Venkatagiri; Sathian, K

2018-02-01

In a recent study, Eklund et al. employed resting-state functional magnetic resonance imaging data as a surrogate for null functional magnetic resonance imaging (fMRI) datasets and posited that cluster-wise family-wise error (FWE) rate-corrected inferences made by using parametric statistical methods in fMRI studies over the past two decades may have been invalid, particularly for cluster defining thresholds less stringent than p < 0.001; this was principally because the spatial autocorrelation functions (sACF) of fMRI data had been modeled incorrectly to follow a Gaussian form, whereas empirical data suggested otherwise. Here, we show that accounting for non-Gaussian signal components such as those arising from resting-state neural activity as well as physiological responses and motion artifacts in the null fMRI datasets yields first- and second-level general linear model analysis residuals with nearly uniform and Gaussian sACF. Further comparison with nonparametric permutation tests indicates that cluster-based FWE corrected inferences made with Gaussian spatial noise approximations are valid.