Loading...
Office

Table of Content

    20 December 2013 Volume 40 Issue 6
      
    Original Articles
    Novel method for frequency hopping signals blind  identification in the compressed domain
    WU Jun;LIU Naian;SHEN Changlin;ZHANG Yanfei
    J4. 2013, 40(6):  1-5+139.  doi:10.3969/j.issn.1001-2400.2013.06.001
    Abstract ( 1126 )   PDF (533KB) ( 984 )   Save
    References | Related Articles | Metrics

    A novel method to blindly identify frequency hopping signals is presented in the compressed domain. The samples obtained by compressive sampling effectively maintain the structure of and the information on the original signal, so the task of identification of the original signal could be done by directly processing the sampling values. The method is based on the difference in numerical characteristic between sampling values. According to the different characteristics of the expectation of sampling values under different hypotheses, identification is accomplished by using the deviation of the actual sampling values from the expectations under the corresponding hypothesis as the criterion. Without reconstructing the frequency hopping signal itself,hopping frequencies can be estimated through a small number of measurements by the compressive sampling algorithm. Simulation results have proved that the proposed method is adequate to the environments in which the signal-to-noise ratio is higher than -2dB. Meanwhile, compared with other traditional methods, the proposed algorithm greatly reduces the amount of data, the computational complexity, and the identification time.

    Low complexity decoding algorithm for LDPC codes and design of key circuits
    MA Kexiang;LIU Yi;HU Jianhua;SUN Jicheng;ZHANG Hailin
    J4. 2013, 40(6):  6-12.  doi:10.3969/j.issn.1001-2400.2013.06.002
    Abstract ( 1487 )   PDF (646KB) ( 875 )   Save
    References | Related Articles | Metrics

    Parallel Weighted Bit Flipping(PWBF) can achieve a good decoding performance. However, it is hard for the hardware design and implementation because of the high complexity of its bit-chosen mechanism. By improving the bit-chosen mechanism in PWBF, a low-complexity decoding algorithm is proposed in this paper. Especially, in each iteration step of decoding, after the metric value of every bit is updated, several bits with the largest metric values are flipped. Furthermore, the optimized circuits with low complexity are provided for the critical modules of the proposed algorithm. Compared with the PWBF algorithm, the complexity of LDPC decoders is greatly decreased by use of the proposed algorithm and the optimized circuits.

    Change detection for SAR images based on fuzzy clustering  using multilevel thresholding
    LIU Yi;KOU Weidong;MU Caihong
    J4. 2013, 40(6):  13-18.  doi:10.3969/j.issn.1001-2400.2013.06.003
    Abstract ( 1103 )   PDF (1893KB) ( 792 )   Save
    References | Related Articles | Metrics

    A new fuzzy clustering algorithm using multilevel thresholding is proposed to reduce the computational complexity of the fuzzy local information c-means (FLICM) algorithm for solving the clustering problem on the difference image of change detection for SAR images. First, the pixels in the difference image are classified into the “changed” pixels, “unchanged” pixels and unknown status pixels by the multilevel thresholding procedure. Then the unknown status pixels are clustered by the FLICM. If the neighboring pixels in the FLICM are not the unknown status pixels, their degrees of membership are set to 1 or 0. The proposed method improves the precision in the change detection for SAR images with the low computational complexity. Experimental results show that the proposed method has the better performance than fuzzy c-means (FCM) and FLICM algorithms on the change detection for SAR images and that its run time is about 70% less than that of the FLICM algorithm.

    Novel anti-noise-uncertainty spectrum sensing algorithm based on  power spectral density segment cancellation
    QI Peihan;SI Jiangbo;LI Zan;GAO Rui
    J4. 2013, 40(6):  19-24.  doi:10.3969/j.issn.1001-2400.2013.06.004
    Abstract ( 1255 )   PDF (574KB) ( 721 )   Save
    References | Related Articles | Metrics

    Since noise uncertainty seriously degrades the spectrum sensing performance of energy detection algorithms, a novel spectrum sensing algorithm based on the power spectral density segment cancellation (PSDSC) is proposed. This spectrum sensing algorithm, which can yield real-time and robust performance, makes use of the un-correlation of different power spectrum lines and takes the ratio of some PSD (power spectral density) lines to the residual PSD lines as the detection statistics. Theoretical analysis and simulation results show that the PSDSC algorithm can overcome the noise uncertainty problem effectively and that the decision threshold does not vary with the ambient noise level of secondary users. The PSDSC algorithm could offer a high probability of detection (P<sub>d</sub>) at a low probability of the false alarm (P<sub>fa</sub>) for a wide range of signal to noise ratios (SNR) and could be applied to spectrum monitoring and cognitive radio systems in the complex electromagnetic environment.

    Low power parallel VLSI architecture for  spatially multiplexed MIMO detection
    LI Xiaofeng;FENG Dazheng;HU Shukai
    J4. 2013, 40(6):  25-31+84.  doi:10.3969/j.issn.1001-2400.2013.06.005
    Abstract ( 899 )   PDF (694KB) ( 649 )   Save
    References | Related Articles | Metrics

    This paper proposes a novel maximum likelihood-like detection algorithm for the 2×2 MIMO wireless communication system. Only the second layer in the search tree needs to be verified exhaustively, and then the area determination strategy is applied to the first layer to figure out the hypothesis node and counter-hypothesis nodes without sorting the partial Euclidean distance for each layer, which reduces the complexity significantly and leads to parallel implementation. The regular VLSI architecture is designed according to the detection algorithm, and flexible parallelism can well control the throughput for versatile applications. The VLSI architecture is implemented with 40nm technology and constrained with the voltage of 1.08V and the clock frequency of 156MHz. The detector achieves 312Mbit/s throughput with the power dissipation of 23mW and the latency of 0.051ns .

    Power allocation strategy for target tracking in asynchronous multistatic radar systems
    YAN Junkun;XIA Shuangzhi;DAI Fengzhou;LIU Hongwei;BAO Zheng
    J4. 2013, 40(6):  32-38+57.  doi:10.3969/j.issn.1001-2400.2013.06.006
    Abstract ( 1484 )   PDF (610KB) ( 732 )   Save
    References | Related Articles | Metrics

    A power allocation scheme for target tracking in asynchronous multistatic radar systems (MSRS) is proposed. An optimal centralized method for asynchronous target tracking is first introduced with the derivation of the Bayesian Cramer-Rao lower bound (BCRLB) on the target tracking mean square error (MSE). Then, the BCRLB is utilized as a criterion for the power allocation strategy. The resulting nonconvex optimization problem is solved by the integration of convex relaxation with the gradient projection algorithm. Simulation results demonstrate that equal allocation of the predetermined power budget is not necessarily the best choice and that the tracking accuracy can be greatly improved by the proposed power allocation algorithm.

    New image segmentation model based on the level set method
    WANG Weiwei;YANG Gongpeng;Lü Chang;YANG Yanqi
    J4. 2013, 40(6):  39-45+91.  doi:10.3969/j.issn.1001-2400.2013.06.007
    Abstract ( 1476 )   PDF (4621KB) ( 772 )   Save
    References | Related Articles | Metrics

    A novel variational model based on the level set method is proposed. In the model, we introduce a nonconvex regularizer which performs better than the convex ones on protecting edges. On the other hand, the nonconvex regularizer is designed to provide a force which can help the evolution of the level set function. The Nesterov algorithm is introduced to implement the model. Experiments demonstrate the advantages of the proposed method over the Chan-Vese model in terms of both efficiency and accuracy.

    Knowledge-aided Bayesian Rao detection approach in  compound Gaussian noise
    GAO Yongchan;LIAO Guisheng;ZHU Shengqi
    J4. 2013, 40(6):  46-51+173.  doi:10.3969/j.issn.1001-2400.2013.06.008
    Abstract ( 1045 )   PDF (576KB) ( 643 )   Save
    References | Related Articles | Metrics

    An asymptotically likelihood covariance matrix is usually used to detect a target in compound Gaussian noise. However, it is influenced greatly by the training sample support, and it ignores the prior distribution of the covariance matrix. For this problem, this paper proposes the knowledge-aided Bayesian Rao detection. The covariance matrix in compound Gaussian noise is modeled as a random matrix, the prior distribution of which satisfies the complex inverse Wishart distribution. With prior distribution, the maximum a-posterior estimation of the covariance matrix is derived. Then, Rao detection is obtained based on the maximum a-posterior estimation. Finally, the performance of the knowledge-aided Bayesian Rao detection approach is evaluated by Monte Carlo simulation. The simulation results show that the detection performance of the proposed approach outperforms the traditional detection approaches when the number of training samples is small in a complex Gaussian noise scenario.

    Compressive sensing with sparse domain division using probability
    TIAN Yumin;SONG Jun2
    J4. 2013, 40(6):  52-57.  doi:10.3969/j.issn.1001-2400.2013.06.009
    Abstract ( 1173 )   PDF (2542KB) ( 675 )   Save
    References | Related Articles | Metrics

    With the development of Compressive Sensing theory in recent years, many new algorithms have been introduced to this field. But still, these algorithms tend to judge the probability of the nonzero signal in each position of the sparse domain as the same, which is in fact not true. In this topic we discuss orthogonal coefficient distribution and divide the whole sparse domain into different parts using probability. With the method called Sparse domain Division using Probability (SDP), the reconstructed speed would increase 20~60 times without producing any negative effect on image quality at the same sampling rate.

    Development and realization of P-channel VDMOS
    PU Shi;HAO Yue
    J4. 2013, 40(6):  58-61.  doi:10.3969/j.issn.1001-2400.2013.06.010
    Abstract ( 843 )   PDF (1693KB) ( 621 )   Save
    References | Related Articles | Metrics

    The relationship among the breakdown voltage, the epitaxial layer parameter and the on-state resistance of P-channel VDMOS has been analyzed. By using Silvaco, the structure, physical parameters and electrical properties of the P-channel VDMOS cell are simulated and optimized. Also, a terminal structure has been designed for this device. An 80V/14A P-channel power VDMOS has been successfully designed and manufactured totally based on the process of domestic fab, with both of its static and dynamic characteristics reaching the design criterion during the tests.

    4-channel-interpolated 14-bit high speed CORDIC DDS IP core
    LIU Maliang;ZHU Zhangming;GUO Xulong;YANG Yintang
    J4. 2013, 40(6):  62-66.  doi:10.3969/j.issn.1001-2400.2013.06.011
    Abstract ( 2018 )   PDF (937KB) ( 635 )   Save
    References | Related Articles | Metrics

    The direct digital frequency synthesizer (DDS) has been widely used because of the advantages of less frequency hopping time and fine frequency discrimination. But the disadvantages of narrowband and poor SFDR performance limit the quality of the DDS output signal. Based on the improved phase to sine-amplitude mapping technology, this paper presents a 4-channel-interpolated 14-bit high speed CORDIC DDS IP core with a 4-stage pipelined phase accumulator. Compared with the traditional CORDIC structure, the sample rate is four times higher, and the complexity and area of the circuit are reduced. The test results indicate that when the sample clock frequency is 1GHz and the frequency resolution is 0.23Hz, the output frequency is 82MHz with a SFDR of 86.7dB. Based on the 0.18μm 1P6M CMOS process, the effective area of the IP core is 1.33mm<sup>2</sup>. The DDS presented in this paper can be used in system chips of the high accuracy wide band radar and communication system as embedded application.

    SAR image change detection based on Brushlet transform
    YAN Xueying;JIAO Licheng;WANG Lingxia
    J4. 2013, 40(6):  67-73.  doi:10.3969/j.issn.1001-2400.2013.06.012
    Abstract ( 993 )   PDF (3255KB) ( 637 )   Save
    References | Related Articles | Metrics

    The traditional change detection method has a poor accuracy for similarity character capture and low direction-resolution. In this paper, a new 2D-Otsu SAR image change detection method is proposed based on the overcomplete Brushlet transform and Gabor window. This method combines the local anisotropic Gabor weighted nonlinear mean procedure in the overcomplete Brushlet domain and linear combination with the minimum mean squared error in the original domain to obtain mean character after the speckle noise is removed, which resolves the problem of low direction-resolution, and can accurately position the texture of each direction, frequency and position. Finally, change detection is processed by the 2D-Otsu method which combines the mean character and gray-level character. Experiment results show that the new method has a better performance, and can well preserve the detailed information such as the texture and edge.

    Novel fractal low-profile antenna
    LIU Ying;LI Fan;GONG Shuxi
    J4. 2013, 40(6):  74-77+124.  doi:10.3969/j.issn.1001-2400.2013.06.013
    Abstract ( 803 )   PDF (2822KB) ( 667 )   Save
    References | Related Articles | Metrics

    A novel fractal iteration technique has been applied to a low-profile miniaturized monopole antenna. The resonant frequency of the antenna is 915MHz and the bandwidth is about 20MHz with vertical polarization. The fractal shape is applied to the open-circuited segment of the substrate to reduce the dimension of the substrate. At the same resonant frequency, the substrate dimension of the fractal antenna is 15% smaller than that of the reference antenna. An antenna prototype is fabricated based on the simulation. The simulated and tested results prove that the design is feasible.

    Compensation method for the effect of large dielectric sandwich radomes on electrical performance
    LI Peng;XU Wanye;QIU Yuanying;LI Huaping
    J4. 2013, 40(6):  78-84.  doi:10.3969/j.issn.1001-2400.2013.06.014
    Abstract ( 865 )   PDF (3754KB) ( 705 )   Save
    References | Related Articles | Metrics

    For the problem that the dielectric sandwich radome will affect the electrical performance of the enclosed antenna, the main factors of the effect have been studied, and it is found that the main reason for the distortion of the far field pattern is the change of phase in the aperture due to radome. The relation between phase change and radome's structure has been analyzed. Then considering the structural features of reflector antenna, some compensated schemes for electrical performance have been proposed. One is the modification of the main reflector, the other is to adjust the axial offset focus of the feed. The second scheme is discussed because it can be more appropriately applied in engineering practice. A formula for the offset focus value has been proposed, and so has the restriction of application. Some simulations have been done by a 9.14m dielectric sandwich radome of satellite earth station. The result shows that the compensated method of the axial offset focus is very effective, especially for the distortion of the far field pattern.

    Computation of special markings of Petri nets  of manufacturing systems
    WANG Qi;WANG Anrong;PU Xuqiang
    J4. 2013, 40(6):  85-91.  doi:10.3969/j.issn.1001-2400.2013.06.015
    Abstract ( 962 )   PDF (517KB) ( 683 )   Save
    References | Related Articles | Metrics

    This paper proposes a method to find the set of dangerous markings of Petri nets based on integer programming by computing a partial set of reachability markings. The proposed method can be used to find all deadlock markings by employing the definition of deadlock markings and the structure information(P-invariant) on Petri nets. Then the state equation is used to derive the sets of bad and dangerous markings. Finally, using the Petri net model of a manufacturing system,we verify the computation of special markings(such as deadlock markings and dangerous markings). Experimental results show that the special markings can be computed by obtaining the partial reachability graph,which reduces state the space explosion problem.

    Method for triplexer rational model extraction
    ZHANG Yongliang;SU Tao;WU Bian;LIANG Changhong
    J4. 2013, 40(6):  92-95.  doi:10.3969/j.issn.1001-2400.2013.06.016
    Abstract ( 768 )   PDF (500KB) ( 618 )   Save
    References | Related Articles | Metrics

    In recent years, a great deal of effort has been made on computer-aided design and tuning for microwave filters. However, there is little literature on the triplexer. The rational model of the triplexer is the key condition for computer-aided design and tuning. A new method based on the improved Cauchy method to extract the rational model of the triplexer is presented in this paper. A triplexer's rational model is extracted by the new method. The extracted rational model response agrees with the simulated response well, which shows the validity of the new method well.

    Left-handed metamaterials applied to the  RCS reduction of the antenna
    WANG Fuwei;LIANG Ruixiang;GONG Shuxi;YU Songtao;JIANG Wen
    J4. 2013, 40(6):  96-100+161.  doi:10.3969/j.issn.1001-2400.2013.06.017
    Abstract ( 895 )   PDF (961KB) ( 626 )   Save
    References | Related Articles | Metrics

    This paper presents a left-handed metamaterials (LHM) applied to reduce the RCS of the antenna. The LHM structure is utilized to the antenna by null-refraction assembly, and two simulated examples are provided. Simulated results show that at the working frequency the RCS of the array antenna with RAM can be reduced more than 20dB by this method. And the control of the RCS of the antenna can be obtained by adjusting the size of the LHM structure.

    Slot microstrip antenna with harmonic control
    XU Yunxue;GONG Shuxi;LIU Ying;HONG Tao
    J4. 2013, 40(6):  101-104+192.  doi:10.3969/j.issn.1001-2400.2013.06.018
    Abstract ( 943 )   PDF (1453KB) ( 604 )   Save
    References | Related Articles | Metrics

    With the introduction of the circularly symmetrical slot near the coaxial feed location of the square microstrip antenna patch, harmonic suppression performance can be realized in the antenna. Effectiveness of the circularly symmetrical slot for harmonic suppression is studied. Experimental results show that application of the circularly symmetrical slot near the coaxial feed location of the microstrip antenna patch can remarkably suppress the harmonic frequencies. Measured radiation patterns indicate that the forward radiation is suppressed by more than 20~25dB at the second and the third harmonic frequencies compared with the reference antenna, while both the forward radiation gain and the backward radiation at the fundamental mode resonant frequency remains basically unchanged.

    Study of high efficiency of evaluation of a PDP  in authorization service
    DENG Fan;CHEN Ping;ZHANG Liyong;WANG Xianqing; LI Sunde;WANG Bin
    J4. 2013, 40(6):  105-110.  doi:10.3969/j.issn.1001-2400.2013.06.019
    Abstract ( 980 )   PDF (462KB) ( 540 )   Save
    References | Related Articles | Metrics

    In authorization service, the efficiency of evaluation of a PDP(policy decision point) is a key issue that affects the efficiency of authorization service. However, the efficiencies of evaluation of many PDPs available are frequently influenced by the factors of conditions in rules. Said Marouf et al put forward a method in which the evaluation speed can be increased by adjusting the rules in policies according to user history access records. This paper analyzes the shortcomings of this method in real-time applications, and proposes that the rules order in policies can be instantaneously adjusted by user history access records and indexes as well as self-adaptation are added to a PDP so that the evaluation speed can be increased substantially. Experimental results indicate that when there are 9795 rules in a PDP, the evaluation time and the time consumption taken for a PDP applied with indexes and self-adaptation to complete an authorized operation call are shortened by 93.33% and 76.32% respectively, compared with those for a PDP which is not applied with indexes and self-adaptation. When the number of repeat visits from the same user is 7, the time consumption taken for a PDP applied with indexes and adaptation to complete an authorized operation call is shortened by 24.29% compared with that for a PDP which is applied with indexes only.

    Selection algorithm of finite alphabet iterative decoders  for LDPC codes
    GUO Junjun;MU Jianjun
    J4. 2013, 40(6):  111-115.  doi:10.3969/j.issn.1001-2400.2013.06.020
    Abstract ( 1005 )   PDF (471KB) ( 680 )   Save
    References | Related Articles | Metrics

    An efficient selection algorithm for finite alphabet iterative decoders (FAIDs) is presented for LDPC (low-density parity-check) codes over the BSC (binary symmetric channel). By taking advantage of the characteristics of decoding rules for variable nodes on Tanner graphical presentations, a set of candidate FAIDs is constructed for some typical LDPC codes. Based on the evaluation of decoding performance for the received channel messages with various additional bias noise inputs derived from trapping sets, the statistical optimal FAID can be rapidly selected from the candidate FAIDs. Finally, simulation results show the validity of the proposed algorithm.

    Improved behavior-based malware detection algorithm  with AdaBoost
    CAO Ying;LIU Jiachen;MIAO Qiguang;GAO Lin
    J4. 2013, 40(6):  116-124.  doi:10.3969/j.issn.1001-2400.2013.06.021
    Abstract ( 1080 )   PDF (937KB) ( 752 )   Save
    References | Related Articles | Metrics

    We present a new algorithm for abstracting features of a program from its API calls, network packages and static analysis characteristics. API calls are aggregated by a low level data dependence analysis to form the abstract behaviors.Network packages and static analysis characteristics are directly utilized as discrete value features.All of these abstract features are then embedded in a high dimension vector space. Besides, we further design a new behavior-based malware classification algorithm, which advances the AdaBoost boosted decision tree algorithm. Firstly, the new algorithm optimizes an anti-noise loss function to lower the probability of the noise data to train the next classifier, and thus improves the anti-noise ability of the AdaBoost algorithm. Secondly, to improve the algorithm's performance in multi-class classif bication problem, a vote vector is adopted to combine base classifiers, which discriminates the accuracy with which a classifier classifies samples from different classes.

    LBM craniocerebral MR 3D medical image non-rigid  registration method
    ZHENG Xiang;TONG Ming;CAO Yang
    J4. 2013, 40(6):  125-131.  doi:10.3969/j.issn.1001-2400.2013.06.022
    Abstract ( 950 )   PDF (1905KB) ( 642 )   Save
    References | Related Articles | Metrics

    In order to improve the performance of the 3D medical image non-rigid registration method, a new LBM (Lattice Boltzmann Method) craniocerebral MR 3D medical image non-rigid registration method is proposed. The 3D medical image registration process is converted into the flow process of the viscous fluid, the deformation force driving pixels are generated by using two-image gray level difference, and the pixels deformation trajectories are simulated under the control of external force by use of the LBM equation. The LBM equation of the compressible viscous fluid with a control force is set up, meanwhile the boundary conditions and the differential homeomorphism conditions are defined. Experimental results show that this method has the better performance than the similar methods.

    Analysis of electromagnetic scattering from the  wind-blown barchan
    J4. 2013, 40(6):  132-139.  doi:10.3969/j.issn.1001-2400.2013.06.023
    Abstract ( 816 )   PDF (1238KB) ( 590 )   Save
    References | Related Articles | Metrics

    A barchan model is simulated by the theory of wind-blown sand dunes. Using the Kirchhoff Approximation based on the discrete element method, electromagnetic scattering coefficients are calculated for the cases of incident wave impinges on the single sand dune along the up-wind slope, the lee slope and the two-side slope face direction, respectively. A comparison of the backscattering coefficients and bistatic scattering coefficients for the four incident directions are made. Numerical results show that co-polarized backscattering coefficients of the lee slope have a local peak value when the incident angle is equal to the repose angle. Cross-polarized bistatic coefficient of the lee slope near the backscattering region is enhanced when the incident angle approaches the repose angle. Bistatic scattering coefficients of two-side slope faces have symmetry with respect to the azimuth angle in the incident plane.

    Image denoising method based on non-local Markov-chain  Monte Carlo sampling and low rank approximation
    LUO Liang;FENG Xiangchu;HUO Leigang;ZHANG Xuande;WU Yulian;LI Xiaoping
    J4. 2013, 40(6):  140-146.  doi:10.3969/j.issn.1001-2400.2013.06.024
    Abstract ( 1217 )   PDF (1153KB) ( 623 )   Save
    References | Related Articles | Metrics

    Combining non-local Markov-chain Monte Carlo sampling and low-rank approximation of the matrix method, an approach for image noise removal is presented. The cluster of similar patches is searched by using Markov-chain Monte Carlo sampling. The cluster matrix of similar patches is decomposed by the singular value decomposition method,and the image noise is suppressed by applying the low rank structure from decomposing. Simulation results show that the proposed method outperforms the BM3D and the non-local means (NLM)method in computational-complexity. The proposed method has a better performance in protecting image details compared with the NLM method, and has some advantages over the BM3D method in terms of visual quality.

    Method of moment investigation on electromagnetic scattering  from the three-layered rough interfaces
    ZHANG Lianbo;GUO Lixin;GOU Xueyin;WANG Anqi
    J4. 2013, 40(6):  147-154.  doi:10.3969/j.issn.1001-2400.2013.06.025
    Abstract ( 971 )   PDF (732KB) ( 618 )   Save
    References | Related Articles | Metrics

    The properties of electromagnetic(EM) scattering from a multi-layered rough surfaces have been investigated through the method of moments(MOM) with the pulse basis function and the point matching technique. Theoretical formulas such as integral equations, matrix equations, and the definition of the bistatic scattering coefficient of this scattering problem have been derived in detail. The Gaussian rough surface has been applied to simulate the realistic surface by the Monte Carlo method. Firstly, the validity of the presented method has been shown by comparing with the finite difference time domain(FDTD). The versatility of the presented method has been demonstrated by degenerating the three-layered rough interfaces to a single-layered rough interface and then comparing with the exit scattering model. Finally, the influences of the characteristic parameters such as incident angle, relative permittivity of the medium, root mean square height and correlation length, as well as the height of each rough surface on the bistatic scattering coefficient are discussed in detail.

    Combining the wavelet and second order total generalized variation  for the image zooming algorithm
    WU Yulian;FENG Xiangchu
    J4. 2013, 40(6):  155-161.  doi:10.3969/j.issn.1001-2400.2013.06.026
    Abstract ( 938 )   PDF (4318KB) ( 650 )   Save
    References | Related Articles | Metrics

    A new image zooming model combining the wavelet and second order total generalized variation is proposed. The original image is regarded as the wavelet low-frequency band for the zoomed image, and the high-frequency bands are estimated. Further processing is implemented for the zoomed image using the second order total generalized variation. The second order total generalized variation may lead to an absence of the staircase effect and keep most details, and therefore, the high quality image is reconstructed. Finally, experimental results have illustrated that our algorithm not only can achieve better zooming but also can produce a very satisfactory denoising effect.

    Research on RFID anti-collision algorithms based on  adaptive multi-dimension division code
    LI Zhijin;ZHOU Jie;QIAO Jie;WU Wenjuan
    J4. 2013, 40(6):  162-167+179.  doi:10.3969/j.issn.1001-2400.2013.06.027
    Abstract ( 908 )   PDF (442KB) ( 694 )   Save
    References | Related Articles | Metrics

    First, the Multi-Dimension Division Code algorithm is proposed. If there are many tags and many collisions, by using this algorithm, the number of times by which the reader calls each tag and the data used will be greatly decreased. With more and more collisions, the AVG number of TIMES by which the reader searches for one tag will tend to a limit: 4/3,and the data with which the reader searches for one tag will tend to a constant. Second, the adaptive Multi-Dimension Division Code algorithm is proposed. The adaptive Multi-Dimension Division Code algorithm can adaptively decrease the MDDC dimensions according to the numbers of the tags, and can encode the tags again. The adaptive Multi-Dimension Division Code algorithm will greatly improve the efficiency of searching for one tag, whether in many collisions or in few collisions. So the adaptive Multi-Dimension Division Code algorithm is a very good algorithm for searching for one tag in the RFID system.

    Cooperative RRU selection algorithm for multicast service  in C-RAN wireless networks
    LIU Zhanjun;ZHU Zhichao;ZHOU Shiyan;ZHANG Zufan
    J4. 2013, 40(6):  168-173.  doi:10.3969/j.issn.1001-2400.2013.06.028
    Abstract ( 1237 )   PDF (921KB) ( 624 )   Save
    References | Related Articles | Metrics

    In the centralized, collaborative, cloud-based and clean wireless access network(C-RAN), the problem of the selection of the RRUs in cooperating group realizing CoMP for multicast service exists. In this paper, we propose an algorithm for RRU selection based on the signal receiving quality of multicast users and immediate load of RRUs. This algorithm adopts the channel capacity and the occupied resources as the optimal objects to establish the objective functions. And we find the optimal solution of the objective functions to achieve the appropriate cooperating RRU group. Contrasting with the selection algorithm based on signal receiving quality and geographical location, simulations show that the proposed algorithm improves the throughput and service fairness of multicast users in the CoMP system, and meanwhile reduces the load of the selected cooperative RRU and balances the system load.

    Analysis and improvement of an authentication protocol  for the multi-server architecture
    WAN Tao;LIAO Weichuan;MA Jianfeng
    J4. 2013, 40(6):  174-179.  doi:10.3969/j.issn.1001-2400.2013.06.029
    Abstract ( 1029 )   PDF (435KB) ( 623 )   Save
    References | Related Articles | Metrics

    Cryptanalysis of Li et al.'s authentication protocol shows that it is vulnerable to masquerade attack, session key disclosure attack and forge smart card attack. To overcome these security flaws, an improved protocol is presented. This protocol proves secure against some possible attacks. Besides, the improved scheme maintains the features of identity anonymity, concise registration, simple operation, and so on.

    Aurora images classification via features salient coding
    HAN Bing;QIU Wenliang
    J4. 2013, 40(6):  180-186.  doi:10.3969/j.issn.1001-2400.2013.06.030
    Abstract ( 869 )   PDF (1661KB) ( 630 )   Save
    References | Related Articles | Metrics

    The change of the form of the aurora reveals the atmospheric activities and the degree of the influence of the sun on the earth. The research on aurora image classification is an effective way to study the aurora phenomenon. In this paper, an image classification method for auroras is developed. According to the characteristics of aurora images, the SIFT features of aurora image are extracted. Then the clustering centers of all SIFT features are obtained by the fuzzy C-means clustering method. Further, the weights of those clustering centers are calculated by the Salient Coding method and they are regarded as the final features for final aurora classification. Finally, the support vector machine is used to classify the 3200 aurora images. Experimental results show that the proposed method has a good performance not only on arc shape aurora images but also on complicated crown shape aurora images.

    New technique for text region location in images
    LI Ying;TIAN Chunna;YAN Jianqiang;ZHUANG Huaiyu;LI Xiangwei
    J4. 2013, 40(6):  187-192.  doi:10.3969/j.issn.1001-2400.2013.06.031
    Abstract ( 1066 )   PDF (5512KB) ( 781 )   Save
    References | Related Articles | Metrics

    Text regions in images are hard to detect because of the complex background. Using the texture directions of the text region, we propose a new technique for text region location in images based on the Gabor character and neural networks classifier. First, the direction textures of original images are described by Gabor features with several directions and scales. Then the BP neural networks classifier is trained based on the Gabor features of text regions and the non-text regions, which can be used to detect the text regions. Experimental results illustrate that our algorithm greatly improves the accuracy and robustness than the others. And the proposed algorithm is suitable for locating not only the Chinese text but also the text in English and other languages.

Baidu
map