检索结果-内蒙古大学图书馆

Multi-objective based spectral unmixing for hyperspectral images

ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING 2017年第Feb.期124卷 54-69页

作者： Xu, Xia Shi, Zhenwei Beihang Univ Sch Astronaut Image Proc Ctr Beijing 100191 Peoples R China Beihang Univ State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Beihang Univ Beijing Key Lab Digital Media Beijing 100191 Peoples R China

Sparse hyperspectral unmixing assumes that each observed pixel can be expressed by a linear combina-tion of several pure spectra in a priori library. Sparse unmixing is challenging, since it is usually trans-formed to a NP-hard 10 norm based optimization problem. Existing methods usually utilize a relaxation to the original 10 norm. However, the relaxation may bring in sensitive weighted parameters and additional calculation error. In this paper, we propose a novel multi-objective based algorithm to solve the sparse unmixing problem without any relaxation. We transform sparse unmixing to a multi-objective optimization problem, which contains two correlative objectives: minimizing the reconstruc-tion error and controlling the endmember sparsity. To improve the efficiency of multi-objective optimiza-tion, a population-based randomly flipping strategy is designed. Moreover, we theoretically prove that the proposed method is able to recover a guaranteed approximate solution from the spectral library within limited iterations. The proposed method can directly deal with 10 norm via binary coding for the spectral signatures in the library. Experiments on both synthetic and real hyperspectral datasets demonstrate the effectiveness of the proposed method. (C) 2016 International Society for Photogrammetry and Remote Sensing, Inc. (ISPRS). Published by Elsevier B.V. All rights reserved.

关键词： Hyperspectral image Sparse unmixing Multi-objective optimization l(o) problem binary coding

来源：评论

学校读者我要写书评

暂无评论

Chirality-modulated photonic spin Hall effect in PT-symmetry

引用

NANOPHOTONICS 2022年第15期11卷 3475-3484页

作者： Liang, Chengkang Liu, Dongxue Liu, Rao Deng, Dongmei Wang, Guanghui South China Normal Univ Guangdong Prov Key Lab Nanophoton Funct Mat & Dev Guangzhou Peoples R China South China Normal Univ Guangzhou Key Lab Special Fiber Photon Devices Guangzhou Peoples R China

The photonic spin Hall effect (PSHE), featured by a spin-dependent shift driven by its polarization handedness, is proposed to facilitate the applications in precision metrology and quantum information processing. Here, due to the magnetoelectric coupling of the chirality, the PSHE is accompanied with Goos-Hanchen and Imbert-Fedorov effects. Taking advantage of this superiority, the transverse shift (TS) and longitudinal shift (LS) can be applied simultaneously. Rearranging the PT-symmetric scattering matrix, the responsive PSHE near the exceptional points and their basic physical mechanisms are discussed in detail in the case of complex chirality kappa. Re[kappa] and Im[kappa] regulated the rich (at multi-angle), gaint (reach upper limit) and tunable (magnitude and direction) TS and LS, respectively. Based on the chirality-modulated PSHE, the novel applications in binary code conversion and barcode encryption are proposed systematically. By incorporating the quantum weak measurement technology, our applications provide new mechanisms to realize optoelectronic communication.

关键词： binary coding chiral metamaterial photonic spin Hall effect PT-symmetry

来源：评论

学校读者我要写书评

暂无评论

An algorithm for rapid computational construction of metabolic networks: A cholesterol biosynthesis example

引用

COMPUTERS IN BIOLOGY AND MEDICINE 2013年第5期43卷 471-480页

作者： Belic, Ales Pompon, Denis Monostory, Katalin Kelly, Diane Kelly, Steven Rozman, Damjana Univ Ljubljana Fac Elect Engn SI-1000 Ljubljana Slovenia Ctr Natl Rech Sci Ctr Genet Mol F-91190 Gif Sur Yvette France Hungarian Acad Sci Chem Res Ctr H-1025 Budapest Hungary Univ Swansea Sch Med Inst Life Sci Swansea SA2 8PP W Glam Wales Univ Ljubljana Fac Med Inst Biochem Ctr Funct Genom & Biochips SI-1000 Ljubljana Slovenia

Alternative pathways of metabolic networks represent the escape routes that can reduce drug efficacy and can cause severe adverse effects. In this paper we introduce a mathematical algorithm and a coding system for rapid computational construction of metabolic networks. The initial data for the algorithm are the source substrate code and the enzyme/metabolite interaction tables. The major strength of the algorithm is the adaptive coding system of the enzyme-substrate interactions. A reverse application of the algorithm is also possible, when optimisation algorithm is used to compute the enzyme/metabolite rules from the reference network structure. The coding system is user-defined and must be adapted to the studied problem. The algorithm is most effective for computation of networks that consist of metabolites with similar molecular structures. The computation of the cholesterol biosynthesis metabolic network suggests that 89 intermediates can theoretically be formed between lanosterol and cholesterol, only 20 are presently considered as cholesterol intermediates. Alternative metabolites may represent links with other metabolic networks both as precursors and metabolites of cholesterol. A possible cholesterol-by-pass pathway to bile acids metabolism through cholestanol is suggested. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Systems biology binary coding Modelling Simulation Metabolic networks

来源：评论

学校读者我要写书评

暂无评论

Spectral Feature Probabilistic coding for Hyperspectral Signatures

引用

IEEE SENSORS JOURNAL 2010年第3期10卷 395-409页

作者： Chang, Chein-I Chakravarty, Sumit Lo, Chien-Shun Lin, Chinsu Univ Maryland Dept Comp Sci & Elect Engn Remote Sensing Signal & Image Proc Lab Baltimore MD 21250 USA Natl Chung Hsing Univ Environm Restorat & Disaster Reduct Res Ctr Taichung 40227 Taiwan Natl Chung Hsing Univ Dept Elect Engn Taichung 40227 Taiwan Natl Formosa Univ Dept Multimedia Design Huwei 635 Taiwan Natl Chiayi Univ Dept Forestry & Nat Resources Chiayi 60004 Taiwan

Spectral signature coding (SSC) is generally performed by encoding spectral values of a signature across its spectral coverage followed by the Hamming distance to measure signature similarity. The effectiveness of such an SSC largely relies on how well the Hamming distance can capture spectral variations that characterize a signature. Unfortunately, in most cases, this Hamming-distance-based SSC does not provide sufficient discriminatory information for signature analysis because the Hamming distance does not take into account the band-to-band variation, in which case the Hamming distance can be considered as a memoryless distance. This paper extends the Hamming-distance-based SSC to an approach, referred to as spectral feature probabilistic coding (SFPC), which introduces a new concept into SSC that uses a criterion with memory to measure spectral similarity. It implements the well-known arithmetic coding (AC) in two ways to encode a signature in a probabilistic manner, called circular SFPC and split SFPC. The values resulting from the AC is then used to measure the distance between two spectral signatures. In order to demonstrate advantages of using AC-based SSC in signature analysis, a comparative analysis is also conducted against spectral binary coding.

关键词： Arithmetic coding (AC) binary coding circular SFPC (C-SFPC) spectral analysis manager (SPAM) spectral feature-based binary coding (SFBC) spectral feature probabilistic coding (SFPC) spectral signature coding (SSC) split SFPC (S-SFPC)

来源：评论

学校读者我要写书评

暂无评论

Huffman scanning: Using language models within fixed-grid keyboard emulation

引用

COMPUTER SPEECH AND LANGUAGE 2013年第6期27卷 1212-1234页

作者： Roark, Brian Beckley, Russell Gibbons, Chris Fried-Oken, Melanie Oregon Hlth & Sci Univ Ctr Spoken Language Understanding Portland OR 97201 USA Oregon Hlth & Sci Univ Child Dev & Rehabil Ctr Portland OR 97201 USA

Individuals with severe motor impairments commonly enter text using a single binary switch and symbol scanning methods. We present a new scanning method Huffman scanning which uses Huffman coding to select the symbols to highlight during scanning, thus minimizing the expected bits per symbol. With our method, the user can select the intended symbol even after switch activation errors. We describe two varieties of Huffman scanning synchronous and asynchronous and present experimental results, demonstrating speedups over row/column and linear scanning. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Keyboard emulation Language modeling binary coding Text entry

来源：评论

学校读者我要写书评

暂无评论

Indexing and mining large-scale neuron databases using maximum inner product search

引用

PATTERN RECOGNITION 2017年 63卷 680-688页

作者： Li, Zhongyu Fang, Ruogu Shen, Fumin Katouzian, Amin Zhang, Shaoting Univ N Carolina Dept Comp Sci Charlotte NC 27541 USA Florida Int Univ Sch Comp & Informat Sci Miami FL USA Univ Elect Sci & Technol China Chengdu Peoples R China IBM Corp Almaden Res Ctr San Jose CA USA

Morphological retrieval is an effective approach to explore large-scale neuronal databases, as the morphology is correlated with neuronal types, regions, functions, etc. In this paper, we focus on the neuron identification and analysis via morphological retrieval. In our proposed framework, multiple features are extracted to represent 3D neuron data. Because each feature reflects different levels of similarity between neurons, we group features into different hierarchies to compute the similarity matrix. Then, compact binary codes are generated from hierarchical features for efficient similarity search. Since neuronal cells usually have tree-topology structure, it is hard to distinguish different types of neurons simply via traditional binary coding or hashing methods based on Euclidean distance metric and/or linear hyperplanes. Therefore, we employ an asymmetric binary coding strategy based on the maximum inner product search (MIPS), which not only makes it easier to learn the binary coding functions, but also preserves the non-linear characteristics of the neuron morphological data. We evaluate the proposed method on more than 17,000 neurons, by validating the retrieved neurons with associated cell types and brain regions. Experimental results show the superiority of our approach in neuron morphological retrieval compared with other state-of-the-art methods. Moreover, we demonstrate its potential use cases in the identification and analysis of neuron characteristics from large neuron databases.

关键词： Neuron morphology Large-scale retrieval binary coding

来源：评论

学校读者我要写书评

暂无评论

SOME EXPERIMENTS ON SPEECH VECTOR QUANTIZATION AT VARIABLE LOW BIT RATE

引用

ELECTRONICS LETTERS 1988年第6期24卷 336-337页

作者： SAVOJI, MH FREEMAN, DK British Telecom Res. Labs. Ipswich

Some experiments on the vector quantisation of the LPC coefficients of the speech signal are described which lead to a proposed method for reducing the average bit rate by reordering the codebook

关键词： LPC coefficients average bit rate reduction binary coding codebook-reordering digital communication systems encoding encoding speech analysis and processing speech vector quantisation variable low bit rate voice communication

来源：评论

学校读者我要写书评

暂无评论

Denoising of Radar Pulse Streams With Autoencoders

引用

IEEE COMMUNICATIONS LETTERS 2020年第4期24卷 797-801页

作者： Li, Xueqiong Liu, Zhang-Meng Huang, Zhitao Natl Univ Def Technol Dept Elect Sci Changsha 410073 Peoples R China

There are many cases in which the noise corrupts the signals in a significant manner. To better analyze these signals, the noise must be removed from the signals for further data analysis, and the process of noise removal is referred to as denoising. In this letter, we propose a novel approach to the pulse denoising problem by extracting features from time of arrival (TOA) sequences using the autoencoders. The noise-contaminated TOA sequence is first coded into a binary vector and then fed into an autoencoder for training. Then, the trained autoencoder is capable of generating the original TOA sequence without lost and spurious pulses. Moreover, the proposed method does not require a noise-free TOA sequence as a priori as with conventional autoencoders. Simulation results show that the new technique can deal with TOA sequences with complex pulse repetition interval (PRI) modes that have not been tackled before. In addition, the proposed method has a better performance in noisy environments than conventional methods and general deep neural network structures.

关键词： Denoising pulse streams TOA sequences autoencoders binary coding

来源：评论

学校读者我要写书评

暂无评论

Some approaches to analogical mapping with structure-sensitive distributed representations

引用

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE 2004年第3期16卷 125-144页

作者： Rachkovskij, DA VM Glushkov Cybernet Ctr UA-03680 Kiev Ukraine

This paper presents some techniques for analogical mapping using associative-projective neural networks (APNNs). Sparse binary distributed representations of constant high dimensionality are constructed on-the-fly for hierarchical structures of various complexity. Such representations encode both surface and structural similarity of analogical episodes. The introduced mapping approaches are illustrated using test analogies.

关键词： analogy analogical mapping reasoning connectionist symbol processing distributed representations representation of structure codevector sparse coding binary coding binding associative-projective neural networks APNN

来源：评论

学校读者我要写书评

暂无评论

Economical placement of PMUs considering observability and voltage stability using binary coded ant lion optimization

引用

INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS 2018年第9期28卷 1-1页

作者： Manoharan, Hariprasath Srikrishna, Subramanian Sivarajan, Ganesan Manoharan, Abirami Annamalai Univ Dept Elect & Commun Engn Annamalainagar Tamil Nadu India Annamalai Univ Dept Elect Engn Annamalainagar Tamil Nadu India Govt Coll Engn Dept Elect & Elect Engn Dharmapuri India Govt Coll Engn Dept Elect & Elect Engn Srirangam Tamil Nadu India

Phasor measurement unit (PMU) plays a key role in concurrent power system state estimation and security enhancement processes. Considering the cost of PMU as an important concern, confined number of PMUs is located at hazardous locations for power system observability. The PMU placements can be explored further for various power system operational studies. One promising indicator is that not only the PMUs should be informative, but also they should be able to perceive the voltage stability levels under critical loading conditions. In topical eons the role of voltage stability is essential which causes severe difficulty. Regrettably, this results in enhancement and impractical vision because of same cost of consumption of PMUs. It is sufficient to reduce the deployment cost provided that the factors such as reliability of the measurement system, observability can be certain for effective placement of PMUs. In line with the above concern, to solve the problem efficiently, a realistic multiobjective model that includes 3 objectives such as (1) system observability with minimum number of PMUs, (2) envisaging the communication cost involved in these placements, and (3) enhancing the voltage stability levels of the system is proposed. The developed model is solved as a nonlinear and constrained optimization problem in multiobjective framework. The binary coding scheme is conventionally preferred for solving PMU placement problem, hence, binary-coded ant lion optimizer has been developed and is applied for the first time to solve the developed multiobjective PMU placement model. The standard IEEE test systems (14 bus, 30 bus, and 57 bus systems) and a large scale system containing 2383 buses are used to ratify the proposed model and the envisioned optimization tool. Numerical outcome specifies that binary-coded ant lion optimizer is robust and effective in finding the best compromise solution.

关键词： ant lion optimization binary coding observability PMU placements voltage stability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：