Loading...
Office

Table of Content

    20 June 2011 Volume 38 Issue 3
      
    Original Articles
    N-generation Fibonacci sequence and  the Nth-generation golden section
    LIANG Changhong;TAN Kangbo;ZHANG Wei
    J4. 2011, 38(3):  1-6.  doi:10.3969/j.issn.1001-2400.2011.03.001
    Abstract ( 1403 )   PDF (3612KB) ( 1180 )   Save
    References | Related Articles | Metrics

    The Fibonacci Sequence can be seen as the 2-generation symmetrical genetic series, which corresponds to the golden section. It is extended to the Second-generation uneven K&M sequence and the corresponding partition in this paper. The N-generation Fibonacci Sequence and the Nth-generation golden section are proposed. It is specifically pointed out that the Nth-generation (N→∞) golden section is known as the Zhuangzi cutting rod.

    Pupil center localization algorithm used for the  IR head-mounted eye tracker
    WANG Junning;LIU Tao;HE Di;WU Yuanyuan
    J4. 2011, 38(3):  7-12+82.  doi:10.3969/j.issn.1001-2400.2011.03.002
    Abstract ( 1706 )   PDF (2525KB) ( 1260 )   Save
    References | Related Articles | Metrics

    In order to improve pupil center localization accuracy and reduce computational complexity, firstly, we adopt star rays to get pupil counter points. Its amount of calculation is cut down drastically compared with searching in the whole figure. Secondly, we cope with some false points produced by eyelashes, eyelids and glints in the interesting area. Then, we apply a randomized method of ellipse fitting to determine the pupil center with pupil counter points. The inclusion is allowed in randomized ellipse fitting so as to ensure the accuracy of the fitting localization algorithm. And eliminating false points further increases the fitting rate. The variation of the number of pupil pixels is detected to distinguish between true-blink and pseudo-blink in dealing with continuous frames. Experiments show that the new algorithm is simple and robust.

    Video dual watermarking method for resisting geometric attacks based on low-dimensional manifold
    TONG Ming;XU Ting;ZHANG Jianlong
    J4. 2011, 38(3):  13-19.  doi:10.3969/j.issn.1001-2400.2011.03.003
    Abstract ( 1375 )   PDF (3463KB) ( 1116 )   Save
    References | Related Articles | Metrics

    How to resist geometric attacks is currently the focus and difficulty in video watermarking fields. This paper presents a video dual watermarking method which could effectively resist geometric attacks. The method mines a geometric deformation invariant, namely the low-dimensional manifold of video, and theoretically derives and experimentally demonstrates geometric invariance. First of all, the method generates zero-watermark or dynamic semantics watermark online according to low-dimensional manifolds of different video shots. In order to balance the robustness and transparency, the method embeds watermark in the IF DCT coefficients of AVS predicted residuals with large energy. This paper studies deeply the three-dimensional space-time characteristics of video, effectively quantifies and characterizes video motion information by low-dimensional manifold of video,establishes the human dynamic masking model including movement features, brightness features and texture features, so as to adaptively control watermark embedding strength. Experiments and analysis show that this method can effectively resist center cutting, irregular cutting, row cutting, rotation, scaling, translation and other high intensity geometric attacks and combined attacks, such as rotation and corner cutting, center cutting and rotation, etc. It also has strong robustness to the conventional video signal processing and various video attacks.

    Power plan of the printed circuit board with novel  electromagnetic band-gap structures
    LU Hongmin;YU Zhiyong;ZHAO Yimin;NA Yan
    J4. 2011, 38(3):  20-23.  doi:10.3969/j.issn.1001-2400.2011.03.004
    Abstract ( 1475 )   PDF (836KB) ( 1122 )   Save
    References | Related Articles | Metrics

    In allusion to the suppression of the simultaneous switching noise (SSN) within the power/ground planes of the printed circuit boards, a novel planar electromagnetic band-gap (EBG) structure is proposed. The novel design is based on using meander lines to increase the effective inductance of EBG patches, and the unit cell of the EBG power plane consists of one square patch with the slots and four meander line bridges. The design is validated numerically, and simulation results show that the -30dB suppression bandwidth ranges from 0.40GHz to 5.1GHz compared with the L-bridged EBG of the same parameters, that the lower cut-off frequency is decreased by 200MHz, and that the relative bandwidth is increased by about 16.2%. In addition to the advantage of the omnidirectional suppression of the SSN, the proposed EBG structure can be achieved by means of the standard PCB process.

    Discriminant neighborhood preserving embedding algorithm  for face recognition
    TIAN Yumin;YUN Yan'e;MA Tianjun
    J4. 2011, 38(3):  24-28+98.  doi:10.3969/j.issn.1001-2400.2011.03.005
    Abstract ( 1575 )   PDF (521KB) ( 1216 )   Save
    References | Related Articles | Metrics

    Neighborhood preserving embedding (NPE) emphasizes the face sample manifold local structure, without taking into account the sample class discriminant information and the small sample problem. The algorithm is based on NPE and the maximum scatter difference criterion (MSDC) is introduced to its objective function. After being embedded into a low dimensional subspace, the samples of the same class maintain their intrinsic neighbor relations while the samples of the different classes are far from each other. And then the most discriminative feature is extracted. Experiments in the AT & T face database show that the highest recognition rate of the algorithm has increased by 15.35%, 6.47%, and 6.94%, respectively, comparied with the PCA, LDA and NPE algorithm. Comparative experiments in the Yale face database show that the highest recognition rate of the algorithm has increased by 20.27%, 5.63%, and 2.27%, respectively.

    GOP-level video transmission method using  data partitioning in H.264/AVC
    FENG Ni'na;CHANG Yilin;LI Peng;YANG Fuzheng;LU Zhaoyang
    J4. 2011, 38(3):  29-36+113.  doi:10.3969/j.issn.1001-2400.2011.03.006
    Abstract ( 1698 )   PDF (549KB) ( 1066 )   Save
    References | Related Articles | Metrics

    In H.264/AVC, different partition parts in one slice and different types of coded frame in one GOP are of unequal importance to the reconstructed video quality. Based on these characteristics, a distortion derivation algorithm for evaluating the importance of different partition parts of different frames is presented. Moreover, a video content and channel adaptive video transmission scheme is proposed based on the determined importance, in which priority sorting is adaptively adjusted to match the characteristics of video content and current channel condition. The distortion derivation algorithm for determining the importance takes into account the total distortion caused by error propagation and error concealment. Experimental results demonstrate that the distortion derived accords with the distortion in simulation, and that the video transmission scheme based on the proposed priority sorting method improves the reconstruction video quality by more than 2dB compared with the video transmission scheme based on data partitioning in one slice.

    Compressed hyperspectral image sensing based on  interband prediction
    LIU Haiying;LI Yunsong;WU Chengke;Lü Pei
    J4. 2011, 38(3):  37-41+120.  doi:10.3969/j.issn.1001-2400.2011.03.007
    Abstract ( 2053 )   PDF (4286KB) ( 1276 )   Save
    References | Related Articles | Metrics

    A new compression algorithm for hyperspectral images based on compressed sensing is proposed which has the advantages of high reconstruction quality and low complexity by exploiting the strong spectral correlations. At the encoder, the prediction parameter between the neighboring bands is first estimated using the prediction algorithm and transmitted to the decoder. The random measurements of each band are then made, quantized and transmitted to the decoder independently. At the decoder, a new reconstruction algorithm with the proposed initialization and stopping criterion is applied to reconstruct the current band with the assistance of its prediction band, which is derived from the previous reconstructed neighboring band and the received prediction parameter using the prediction algorithm. Experimental results show that the proposed algorithm not only obtains a gain of about 1.2dB but also greatly decreases decoding complexity. In addition, our algorithm has the characteristics of low-complexity encoding and easy hardware implementation.

    Unequal error protection strategy for video transmission over  wireless channels with hierarchical QAM
    LI Peng;LU Zhaoyang;CHANG Yilin;FENG Ni'na;LI Zhibin
    J4. 2011, 38(3):  42-47.  doi:10.3969/j.issn.1001-2400.2011.03.008
    Abstract ( 1576 )   PDF (562KB) ( 1049 )   Save
    References | Related Articles | Metrics

    For band-limited wireless video transmission with multi-subcarriers, a novel unequal error protection strategy for video transmission over the wireless channel by using hierarchical quadrature amplitude modulation (HQAM) is proposed. Firstly, all the subcarriers available are divided into different classes based on their channel quality, and then the HQAM modulation parameters are determined according to the channel quality of those subcarriers and the importance of different parts of the video bitstream to the reconstructed video. The unequal error protection of the video bitstream is implemented by modulating different parts in the video stream to subcarriers with unequal HQAM parameters. Experimental results demonstrate that compared with the reported methods, the proposed method effectively improves the quality of the reconstructed video with the maximum improvement of about 2dB.

    Movement control algorithm for balancing transmission power
    YAN Zhongjiang;SHEN Zhong;CHANG Yilin;YANG Jiawei
    J4. 2011, 38(3):  48-54.  doi:10.3969/j.issn.1001-2400.2011.03.009
    Abstract ( 1239 )   PDF (671KB) ( 1020 )   Save
    References | Related Articles | Metrics

    To decrease the movement cost and the algorithm's iteration number in balancing the transmission power of nodes, a novel movement control algorithm is proposed, which is based on the minimum connected dominating set and Steiner tree. Firstly, a node set, which acts as the backbone of the network, is computed. Then a Steiner tree is constructed with the input of the backbone node set and the critical transmission radius, where the Steiner points are set as the moving candidates' destination points. Finally, the nodes which are not in the backbone node set are matched with and moved to the Steiner points to balance the transmission power. Simulation results show that, compared to the MST-based PMST-UV, the proposed algorithm reduces the movement cost and the iteration number, with the total movement distance decreased 13%~34%, and the iteration number reduced 17%~68%.

    Micro-Doppler feature analysis and extraction of  the complex motion target
    CHEN Guangfeng;ZHANG Linrang;WANG Chun;LIU Gaogao
    J4. 2011, 38(3):  55-62.  doi:10.3969/j.issn.1001-2400.2011.03.010
    Abstract ( 1367 )   PDF (911KB) ( 1148 )   Save
    References | Related Articles | Metrics

    Micro-Doppler signature produced by micro-motion contains movement and structure information which is useful for radar classification and recognition. Because of the complexity and difference of micro-motion, based on non-rotor targets and rotary-wing targets, the complex motion scattering point with translation, acceleration and vibration is modeled, so is complex motion scattering point with translation, vibration, acceleration and rotation. Then their micro-Doppler modulation and difference are analyzed. By simulation, the micro-Doppler modulation induced by the two models is extracted from the radar echo with the Smoothed pseudo Winger-Ville time-frequency analysis method, which agrees well with the computed results and proves that the models and the mathematical derivation of their micro-Doppler theoretical analysis are valid.

    High efficiency algorithm with antinoise properties for  multi-focus image fusion
    YAN Chunman;GUO Baolong;YANG Xiuhong
    J4. 2011, 38(3):  63-68.  doi:10.3969/j.issn.1001-2400.2011.03.011
    Abstract ( 2137 )   PDF (2223KB) ( 1361 )   Save
    References | Related Articles | Metrics

    In view of the more real-time requirements of the image processing algorithm for ordinary optics and the particularity of noise condition, this paper proposes an antinoise algorithm for image fusion, which is based on Laplacian pyramid decomposition and pseudo inverse. For the algorithm, orthogonal wavelets are used for image decomposition and the pyramid data structure, and at the reconstruction stage, a pseudo inverse is used. The new algorithm can restrain the additive noise and system noise from thresholding and quantization process of compression, and it is of lower complexity. Experimental results show that the new algorithm can obtain a better effect than the method based on the usual Laplacian pyramid transform for the multi-focus image fusion, and has antinoise properties.

    Investigation of effective connectivity of the illusory face detection network based on nonlinear dynamic causal models analysis
    LI Jun;ZHAO Jizheng;FENG Lu;SHI Guangming;LIANG Jimin
    J4. 2011, 38(3):  69-75.  doi:10.3969/j.issn.1001-2400.2011.03.012
    Abstract ( 1989 )   PDF (1784KB) ( 1056 )   Save
    References | Related Articles | Metrics

    In order to extract the activation patterns of top-down face processing, the present study uses an experimental paradigm in which participants detect illusory faces in pure noise images. The nonlinear dynamic causal models (DCM) analysis, which has a perfect neural theory foundation, is used to investigate the effective connectivity of the illusory face detection network under the top-down processing mechanism. The optimal network model indicates that the occipital face area (OFA) serves as a key generator of illusory face detection. Under directing top-down visual attention exerted by the inferior parietal lobule (IPL), OFA searches for the pure noise images for face-like features, and then provides those face-like feature information to the fusiform face area(FFA) for further holistic face processing.

    Co-processor implementation for fast face detection  in a system-on-chip
    JIAO Jiye;MU Rong;HAO Yue
    J4. 2011, 38(3):  76-82.  doi:10.3969/j.issn.1001-2400.2011.03.013
    Abstract ( 1300 )   PDF (2006KB) ( 1103 )   Save
    References | Related Articles | Metrics

    An improved co-processor architecture suitable for hardware parallel implementation is proposed to perform the feature classification based on the Adaboost algorithm. The co-processor consists of image quick access module, module for calculating the Haar features, DMA data transfer module, and interface to the co-processor module. Modules use the pipeline and FIFO buffer to process data to accelerate the iterative process of face detection. The co-processor only increases a small area in face detection SoC, but significantly improves the speed of face detection. In addition, we implement the proposed SoC on a CYCLONE-Ⅱ EP2C70 FPGA to show that object detection can be achieved at 10 frames per second at the system operating frequency of 70MHz on color QVGA camera video.

    Quasi delay-insensitive full asynchronous arbiter for the network on chips
    GUAN Xuguang;YANG Yintang;ZHU Zhangming
    J4. 2011, 38(3):  83-89.  doi:10.3969/j.issn.1001-2400.2011.03.014
    Abstract ( 1410 )   PDF (649KB) ( 1083 )   Save
    References | Related Articles | Metrics

    This paper proposes a quasi delay-insensitive full asynchronous arbiter for the network on chips. With the function of priority self-detection, it improves the quality of service given by the priority variations of data packages from different directions. It can automatically select one of output schemes according to dynamically detecting the changes of priority in data packages, solving the problems of ports priority fixation in the conventional static arbitration mechanism. The stability of arbitration is greatly enhanced owing to decoupling the arbitration module from the output module by locking input requests. The application of the threshold gate makes the whole arbiter quasi delay-insensitive. The arbiter is implemented in 0.18μm standard CMOS technology. Results have shown that the average arbitration time is 1.175ns with average dynamic power consumption of 1.53mW, which can fulfill the demand of high-speed on-chip data package arbitration.

    Research on the imaging algorithm for missile-borne SAR with downward movement
    ZHOU Song;ZHOU Peng;LI Yachao;XING Mengdao;BAO Zheng
    J4. 2011, 38(3):  90-98.  doi:10.3969/j.issn.1001-2400.2011.03.015
    Abstract ( 1196 )   PDF (1192KB) ( 1124 )   Save
    References | Related Articles | Metrics

    During the downward movement for Missile-Borne SAR imaging, variation of Doppler FM rates for echo signal severely affects the focusing effect, which is introduced by high vertical velocity and acceleration. For this reason, by using azimuth nonlinear chirp scaling (NLCS), an imaging algorithm for Missile-Borne SAR is proposed in this paper. After range cell migration correction and range compression, variation of Doppler FM rates for the echo signal can be compensated and image distortion can be corrected by the operation of azimuth nonlinear chirp scaling, thus improving the focus depth and focusing effect. Simulation results are provided to validate the effectiveness of the proposed algorithm.

    Parameter estimation and statistical noise reduction  for low-dose CT sinogram
    ZHANG Yuanke;ZHANG Junying;LU Hongbing
    J4. 2011, 38(3):  99-106.  doi:10.3969/j.issn.1001-2400.2011.03.016
    Abstract ( 1410 )   PDF (2691KB) ( 1166 )   Save
    References | Related Articles | Metrics

    Improvement of the SNR of low-dose CT images is a crucial issue for the low-dose CT application. In this paper, we propose a novel adaptive statistical noise reduction algorithm for low-dose CT sinogram. The algorithm first adopts an EM algorithm to adaptively estimate the parameters of the image model based on the non-stationary Gaussian noise property in the low-dose CT projection data, and then uses the MAP estimation to restore the sinogram. In the parameters estimation procedure, a Gibbs sampler is used to handle the complicated computation problem. In addition, two initialization strategies are used in the algorithm to accelerate the convergence speed too. The effectiveness of the proposed algorithm is validated by both computer simulations and experimental studies. The advantage of the proposed approach over other methods is quantified by noise-resolution tradeoff curves.

    Novel track-before-detect algorithm for small infrared target
    WU Bin;LI Peng
    J4. 2011, 38(3):  107-113.  doi:10.3969/j.issn.1001-2400.2011.03.017
    Abstract ( 1539 )   PDF (876KB) ( 1213 )   Save
    References | Related Articles | Metrics

    A novel track-before-detect filtering algorithm is proposed for the dim infrared target with a low signal-to-noise ratio in complex backgrounds. A new particle filter called the Quasi-Monte Carlo sampling based Gaussian particle filter(QMC-GPF) is developed to estimate on-line the standard kinematic parameters of the target, including the position and velocity, as well as the amplitude of the target. The convergence characteristic of the covariance of the posterior densities propagated in the QMC-GPF is used to construct the logical rules for soft-decision detection of a possible target. The algorithm is tested with a synthetic target in IR image sequences, and it is proved that the algorithm is capable of performing sufficiently well for the dim target of SNR≥1dB.

    Fast adaptive interference suppression method in the GPS receiver
    WANG Chun;ZHANG Linrang;CHEN Guangfeng;HUANG Qingdong;LIU Gaogao
    J4. 2011, 38(3):  114-120.  doi:10.3969/j.issn.1001-2400.2011.03.018
    Abstract ( 1747 )   PDF (607KB) ( 2259 )   Save
    References | Related Articles | Metrics

    The adaptive Generalized Sidelobe Canceller(GSC) always employs the least-mean-square(LMS) algorithm for weight adaptation. In the GPS receiver, real adaptive interference suppression can not be satisfied by this algorithm because of its slow convergence rate, especially at the very low signal-to-noise ratio(SNR). Since the convergence behavior of the LMS algorithm is highly dependent on the eigenvalue spreads of the covariance matrix of the blocking matrix output, we present a novel Householder-based fast adaptive interference suppression approach. Householder transformation can be employed for the design of the blocking matrix of the GSC, which will block not only the desired signal but also accelerate the convergence rate of the LMS algorithm. Therefore, it can also maximize the output SINR and significantly improve the performance of the anti-jammer GPS receiver. Theoretical analysis and simulation results demonstrate the superiority of the proposed structure.

    Gene selection method based on supervised dimension reduction and procrustes analysis
    GENG Yaojun;ZHANG Junying
    J4. 2011, 38(3):  121-127.  doi:10.3969/j.issn.1001-2400.2011.03.019
    Abstract ( 1339 )   PDF (599KB) ( 1029 )   Save
    References | Related Articles | Metrics

    The gene selection method which combines principal component analysis with shape analysis does not effectively use the class information on samples. Aiming at this shortcoming,a new gene selection method combining margin maximizing discriminant analysis with shape analysis is presented in this paper. In the gene selection process, the new method considers not only the interaction between genes but also the relationship between genes and class label, which improves the classification performance of selected genes. Experimental results on four microarray gene expression data show that the performance of the presented method is superior to that of the method which combines principal component analysis with shape analysis. Compared with two state-of-the-art multivariable filter methods, the presented method also has a certain advantage.

    Fast reverse searching method for covert channels identification
    ZHANG Liyong;WANG Xianqing;CHEN Ping;DENG Fan;KONG Delan
    J4. 2011, 38(3):  128-135.  doi:10.3969/j.issn.1001-2400.2011.03.020
    Abstract ( 1262 )   PDF (569KB) ( 1044 )   Save
    References | Related Articles | Metrics

    A method for identifing covert channels automatically based on static analysis is proposed. The method adopts typical syntax and semantic analysis technology to implement initial information flow extraction, retains indirect information flows produced by local variables and establishes information flow rules for library functions and information flow deduction, which enhanceds the accuracy and integrality of information flow collection. Based on the information flow graph, a constrained reverse depth-first traversing (DFT) algorithm is designed to iteratively detect potential covert channels, and the efficiency of covert channel detection is thus improved. Finally, syntax and semantic rules are discussed to eliminate illegal covert channels.

    On the existence of a class of QC-LDPC codes with girth at least six
    ZHANG Guohua;WANG Xinmei
    J4. 2011, 38(3):  136-139+149.  doi:10.3969/j.issn.1001-2400.2011.03.021
    Abstract ( 1235 )   PDF (380KB) ( 1011 )   Save
    References | Related Articles | Metrics

    For QC-LDPC codes with column weights of three and four, and girth of at least six, M.Hagiwara et al recently investigated the smallest value of the dimension p of the cyclic permutation matrix, and remarked that for m greater than or equal to 50, the existence of QC-LDPC codes with column weight of four, row weight of 6m+3, dimension of 6m+3 and girth of at least six, remains open. By the method of matrix combination, it is proved in this paper that there exist infinite values of m which enable such codes to exist.

    Free protocol for the subliminal channels in the Schnorr-type ordinal multi-signature schemes
    ZHANG Yinghui;LI Hui;MA Hua
    J4. 2011, 38(3):  140-144.  doi:10.3969/j.issn.1001-2400.2011.03.022
    Abstract ( 1463 )   PDF (435KB) ( 1030 )   Save
    References | Related Articles | Metrics

    A new interactive subliminal-free protocol is designed. It is shown that the proposed protocol can completely close the subliminal channels by the whole substitution existing in the random parameters in the Schnorr-type ordinal multi-signature schemes. The new protocol is an interactive process between the signers and the warden, and it ensures that the signature authority of the signer is guaranteed. To sign a given message, it is necessary for the warden to cooperate with all signers. The security of the proposed protocol is based on both the discrete logarithm intractability assumption and the existence of collision-free hash functions. In computational complexity and communications cost, the proposed protocol is more efficient than the existing schemes.

    Study of calibration of the phase center of array antennas and its error analysis
    CHEN Xi;FU Guang;GONG Shuxi;YAN Yali;LIU Haifeng
    J4. 2011, 38(3):  145-149.  doi:10.3969/j.issn.1001-2400.2011.03.023
    Abstract ( 1928 )   PDF (487KB) ( 1230 )   Save
    References | Related Articles | Metrics

    For calibrating the phase center (PC) of array antennas precisely, a calibration method on the PC of array antennas is proposed. Firstly, the relationship between the phase radiation pattern and the position offset of the array antennas is derived. Secondly, based on the definition of the phase center of the array antennas and the steps of calibration, the precise value of the phase center is calculated by the least square method (LSM). Then, the proposed calibration method is verified by simulation. The error analysis of the simulated results indicates that a wider half power beam width (HPBW) and a higher measurement accuracy can enhance the calibration accuracy of the phase center of array antennas.

    SAR image automatic segmentation based on DT-GrowCut
    CUI Yanpeng;HU Jianwei;YANG Shaoquan;ZHU Yan
    J4. 2011, 38(3):  150-154.  doi:10.3969/j.issn.1001-2400.2011.03.024
    Abstract ( 2171 )   PDF (4766KB) ( 1347 )   Save
    References | Related Articles | Metrics

    A novel automated robust segmentation algorithm based on Delaunay triangulation and GrowCut is proposed. The core idea is to apply the theory of Delaunay triangulation to the MSTAR image just for the seeds initialization of GrowCut. The DT-GrowCut based algorithm can give rough segmentation between the target, shadow and background. Several sets of SAR images from MSTAR datasets are segmented by the proposed method. Experimental results demonstrate that the proposed method outperforms the traditional FCM based method in despeckling, extracting the edge and reducing the edge fuzzy degree. The results of experiments with different SAR images demonstrate the efficiency of the presented algorithm.

    Variational model with the Besov fidelity term  for image denoising
    ZHANG Weibin;FENG Xiangchu;WANG Weiwei
    J4. 2011, 38(3):  155-158+163.  doi:10.3969/j.issn.1001-2400.2011.03.025
    Abstract ( 1342 )   PDF (4441KB) ( 1026 )   Save
    References | Related Articles | Metrics

    An improved variational model based on Besov space for image denoising is proposed. The L<sup>2</sup> fidelity term in the classical model is generalized to the Besov fidelity term. The new model can be quickly solved by using the wavelet thresholding algorithm. The proposed algorithm does not need to solve the nonlinear partial differential equation, so it is an efficient and fast algorithm. Numerical experiments show that this model can remove noise efficiently while preserving the texture and the details.

    Range Doppler detection based on the pulsed two-frequency laser
    LI Yanhui;WU Zhensen
    J4. 2011, 38(3):  159-163.  doi:10.3969/j.issn.1001-2400.2011.03.026
    Abstract ( 1373 )   PDF (717KB) ( 1307 )   Save
    References | Related Articles | Metrics

    A method for measuring the range and velocity of the target is proposed based on the pulsed two-frequency laser, and the lidar-radar system concept is introduced. By analyzing the electrical power signal-to nose ratio (SNR), the relation between detection range and pulsewidth is obtained. Then the Doppler detection of the laser pulse bandwidth containing many Doppler gates and the laser pulse bandwidth less than the beat frequency is given.

    Novel curve fitting edge feature extraction algorithm
    DU Yaqin;HONG Bo;GUO Lei;YANG Ning
    J4. 2011, 38(3):  164-168+188.  doi:10.3969/j.issn.1001-2400.2011.03.027
    Abstract ( 1725 )   PDF (3082KB) ( 1331 )   Save
    References | Related Articles | Metrics

    The edge contains much visual information of the image, so the image feature extraction is important in image processing. In this paper, the former least squares support vector machines(LS-SVM) edge feature extraction algorithm is analysed, and it is found that its universality is weaken. So this paper proposes a novel method for edge extraction, in which firstly the digital image is transfered to the fuzzy characteristic plane, where the image edge part is extruded, and the other part is weakened. The the image intensity surface is well fitted by the LS-SVM function, in which the first and second derivatives are calculated. Finally, the rather fine image edge feature can be gained. Experiments show that this algorithm can lead to a higher segmentation quality and that the parameters can be fixed, which is very useful in image processing.

    Low-cost hardware optimization design for high-speed GMC demodulation
    XIONG Herui;HAO Xuefei;HU Guorong
    J4. 2011, 38(3):  169-174.  doi:10.3969/j.issn.1001-2400.2011.03.028
    Abstract ( 1440 )   PDF (652KB) ( 1015 )   Save
    References | Related Articles | Metrics

    Based on GMC (Generalized Multi-carrier)demodulation, a 512 point pipelined IFFT processor is proposed, whose output sequence is consistent with the input sequence of the polyphase filter, thus avoiding the extra data storage and reducing the hardware cost and latency of the whole system. The processor takes a new radix 2<sup>3</sup> SDLF (Single-path Delay Locally Feedback) architecture as the basic operating unit, which has a sequence input and a sequence output. After three stages' operation and a buffer with the depth of 64, the processor's final output is the extraction of IFFT results by factor of 8. In the design, a method for extracting the common factor is also proposed to opimize twiddle factor storage. The verification, based on the FPGA, indicates that the proposed processor can reduce the memory size by 30% and 67% respectively, compared with the traditional radix 2<sup>3</sup> SDF (Single-path Delay Feedback) and radix 8 FF (Feed Forward) architecture, and reduce output latency by about 43%, compared with the SDF architecture.

    Application of PSO algorithm in pattern synthesis for antenna arrays
    WANG Weibo;FENG Quanyuan
    J4. 2011, 38(3):  175-180.  doi:10.3969/j.issn.1001-2400.2011.03.029
    Abstract ( 1757 )   PDF (655KB) ( 1258 )   Save
    References | Related Articles | Metrics

    According to the prematurity and easy trapping in local optimum resulting from using Particle Swarm Optimization(PSO) in the pattern synthesis of antenna arrays with sidelobe reduction and nulls control, a mixed optimal algorithm(Chaotic PSO,CPSO) is proposed by fusing the advantages of both chaotic optimal algorithm and PSO algorithm. The new algorithm uses chaotic searching strategy within the neighborhood of the global best position to find a better solution when the swarm traps into stagnancy. The range of the chaotic searching region can be adaptively adjusted. To enhance the diversity of samples, several individuals are picked out as exemplars when the new global best position is updated in each dimension. Simulation results show that the algorithm can lead to a relatively high performance by applying CPSO in the pattern synthesis of antenna arrays.

    Multi-grain joint model of topic and sentiment for opinion mining
    ZHAO Yu;CAI Wandong
    J4. 2011, 38(3):  181-188.  doi:10.3969/j.issn.1001-2400.2011.03.030
    Abstract ( 1446 )   PDF (626KB) ( 1283 )   Save
    References | Related Articles | Metrics

    Based on extensions to standard topic modeling methods,a novel multi-grain joint model of topic and sentiment is proposed to improve efficiency of opinion mining. This model extracts sentiment and hierarchy topic from the text simultaneously, which distinguishes between local topics and global topics. The proposed model adopts the unsupervised learning method to address the issue of being domain dependent in existing methods. According to experiments, this model achieves an accuracy of 82.6% for sentiment classification. It has a performance comparable to that of supervised sentiment classification methods. Moreover, the acquired collection of topics is hierarchy and semantic related. It is proved that the proposed model is feasible and effective for opinion mining.

    Research on blind detection of the sub synchronous sequence  based on word frequency statistic
    Lü Xizai;SU Shaojing;HUANG Zhiping
    J4. 2011, 38(3):  189-196.  doi:10.3969/j.issn.1001-2400.2011.03.031
    Abstract ( 1628 )   PDF (852KB) ( 3042 )   Save
    References | Related Articles | Metrics

    In order to get the frame synchronization information on the unknown lines in digital communication, a method of blind detecting sub synchronous sequence is presented. By modeling frame synchronization, the relationship between the probability of detecting the sub synchronous sequence and the length of data is gained in the word frequency statistics with different word widths. According to this relationship, the blind detecting sub synchronous sequence of unknown lines with any bit-start in error conditions is realized by conducting the word frequency statistic and adjusting the word width and data length, which makes it possible to get the whole frame synchronization information on unknown lines.