{"title":"A design of basic gate circuit ICs detection system","authors":"Chen Long, Z. Yajun, Fan Lingyan","doi":"10.1109/ICNNSP.2008.4590422","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590422","url":null,"abstract":"This paper presents a design method about the basic gate circuit ICs detection system based on microcontroller. We analyze the function of the detection system and give its design and implementation methods. We transmit high and low level to the inputs of 74LS series gate circuit IC, and acquire the signal of the outputs of the IC. Then we can know logical function of the IC is right or not by comparing the output of the gates with the theoretical value of the gates. In addition, we can know whether each gate's logical function is right. College students can improve the efficiency of experiments with the help of the detection system.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132468045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Recursive least squares constant modulus algorithm based on the QR decomposition","authors":"Wang Shuyan, Wu Renbiao, Shi Qing-yan","doi":"10.1109/ICNNSP.2008.4590331","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590331","url":null,"abstract":"A novel QR-RLS constant modulus algorithm called QR-RLS-CMA is proposed. Its potential advantages include numerical stability, computational efficiency and a fast convergence rate. Simulations are performed to compare the convergence performance and the blind extracting ability of the proposed QR-RLS-CMA to the conventional SGD-CMA for adaptive CMA array. Results indicate that the QR-RLS-CMA has a much faster convergence rate than the SGD-CMA in the initial convergence phase. It illustrates the effectiveness of the proposed method.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130252093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Facial expression recognition for neonatal pain assessment","authors":"G. Lu, Xiaonan Li, Haibo Li","doi":"10.1109/ICNNSP.2008.4590392","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590392","url":null,"abstract":"Facial expressions are considered a critical factor in neonatal pain assessment. This paper attempts to apply modern facial expression recognition techniques to the task of distinguishing pain expression from non-pain expression. Firstly, 2D Gabor filter is applied to extract the expression features from facial images. Then we apply Adaboost as a feature selection tool to remove the redundant Gabor features. Finally, the Gabor features selected by Adaboost are fed into the support vector machines (SVMs) for final classification. 510 facial images are investigated by using SVMs. The best recognition rates of pain versus non-pain (85.29%), pain versus calm (94.24%), pain versus cry (78.24%) were obtained from an SVM with a polynomial kernel of degree 3. The results of this study indicate that the application of SVM technique in pain assessment is a promising area of investigation.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134639175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Construction of user preference profile in a personalized image retrieval","authors":"Lin He, J. Zhang, L. Zhuo, Lansun Shen","doi":"10.1109/ICNNSP.2008.4590388","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590388","url":null,"abstract":"In order to reduce the semantic gap between low-level visual features and high-level semantics, a novel approach for constructing user preference profile in personalized image retrieval is proposed. In proposed approach, the user interest is divided into two parts: the short-term interest and the long-term interest. Semantic feature vector in the short-term interest is constructed by building the correlation between image low-level visual features and high-level semantics on the basis of SVM after collecting the visual feature vector in the short-term interest with relevance feedback. Moreover, the visual feature vector in the long-term interest can be collected by the non-linear gradual forgetting interest inference algorithm. Semantic feature vector in the long-term is constructed with clustering algorithm. Experiments results show that the average recall/precision are significantly improved and satisfied by personalized user as well.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"453 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124299104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An option-based empirical investigation of Chinese corporate liquidity value","authors":"J. Du, Lingyun Zheng","doi":"10.1109/ICNNSP.2008.4590305","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590305","url":null,"abstract":"Corporate liquidity pricing is a new topic. With the discussion of the essence of liquidity, this paper established an exchange-option-based corporate liquidity pricing model which combines the investment option and insurance option taking into considerations of their execution probabilities. And we apply the model to investigate the liquidity value of Chinese firms with the data of the listed companies in Shanghai stock market.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125755497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The routing of reconfigurable network based on ant algorithm","authors":"Cheng Xuhua, Zhao Zhijin, Y. Xue-yi","doi":"10.1109/ICNNSP.2008.4590414","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590414","url":null,"abstract":"Finding the optimum path or routing always is an important and difficult issue in a practical dynamic network. In this paper, a new routing approach that due to multiple requirements in the reconfigurable network is briefly discussed. In order to obtain the optimum path between two nodes, we use the ant algorithm with which the problem can be attached to select the path. Simulation results shows that, especially having considered two factors of cost and delay, the proposed approach can be used to search the routing efficiently by the available nodes and paths provided with the reconstructed network topology even if the network changed.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125774408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An epitome-based evolutionary algorithm with behavior division for multimodal optimizations","authors":"Yaming Bo, B. Liu","doi":"10.1109/ICNNSP.2008.4590382","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590382","url":null,"abstract":"In this paper, a novel evolutionary algorithm (EA) with two groups is presented based on the mimicry of a two-group team for a specific objective. The operations of exploration and epitome-based learning behaviors are properly defined. By means of the inherited generation of new individual and the replacement rules of the team, the behavior division between the elite group and the plain group is established, which make the algorithm have the potential for adaptive local, global and directive search. The conflict between the successful global search and the fast convergence in some other algorithms can be obviously mitigated in this algorithm. It can be shown by the comparisons that the presented algorithm is statistically superior to the genetic algorithm and particle swarm optimization in both global optimization and computational cost for multimodal optimization.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125059823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A lossless coding scheme for encoding color-indexed video sequences","authors":"Y. Chan","doi":"10.1109/ICNNSP.2008.4590436","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590436","url":null,"abstract":"A new lossless video compression scheme for coding sequences of color-indexed frames is proposed. This scheme handles the frames sequentially. It reduces both the zero-order entropy and the energy of the index map of a specific frame by turning the index map into a new index map each element of which serves as an index to a pixel-dependently reordered version of the palette. Accordingly, a matching coding scheme can be exploited to encode the new index map effectively. A technique similar to the one used in animated GIF is also used to remove the inter-frame redundancy. Simulation results show that the proposed method is superior (in terms of compression ratio) to other state-of-art lossless compression algorithms in coding color-indexed video sequences.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127348271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Regions of Interest extraction based on visual attention model and watershed segmentation","authors":"J. Zhang, L. Zhuo, Lansun Shen","doi":"10.1109/ICNNSP.2008.4590375","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590375","url":null,"abstract":"The presented research addressed a novel visual attention model and watershed segmentation based approach of regions of interest (ROIs) extraction, which automatically extracts ROIs and copes with the watershed over-segmentation. This approach uses visual attention model to locate salient points, in which the winner point, the most salient point, is selected as the seed point of watershed segmentation. ROIs are extracted by combining salient regions with watershed segmented regions. The focus of attention (FOA) is shifted to measure the importance or interest of the extracted regions. The experimental results show that the proposed method is effective to reduce over-segmentation in auto-extracting ROIs and performs well for different objects.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132182043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AVS video standard implementation for SoC design","authors":"Xin Jin, Songnan Li, K. Ngan","doi":"10.1109/ICNNSP.2008.4590433","DOIUrl":"https://doi.org/10.1109/ICNNSP.2008.4590433","url":null,"abstract":"AVS1-P2 is the newest video standard of Audio Video coding Standard (AVS) workgroup of China, which provides close performance to H.264/AVC main profile with lower complexity. In this paper, a platform independent software package is developed for AVS1-P2 decoder to facilitate embedded video codec development. In order to minimize the on-chip memory and save the time consumed in on-chip/off-chip data transfer, an MB-based architecture is developed by modifying the data flow, decoding hierarchy, and the buffer definition and management for low-level decoding kernels. Such system architecture provides over 80% reduction in on-chip memory compared to the frame-based architecture when decoding 720 p (1280times720) sequences. By modularizing the decoding kernels and data transfer modules, the proposed MB-based decoder facilitates the AVS video decoder development on the target platform.","PeriodicalId":250993,"journal":{"name":"2008 International Conference on Neural Networks and Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127951236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}