Search

It presents an approach to the automatic generation of pencil sketching with the effects of paper texture. First, proposes a texture mapping of strokes in the aspect of skeleton, the filter algorithm and the standard deviation algorithm for rendering image, the near distances recover algorithm for real-time browsing, and finally implement the Pen-and-Ink Style of pencil sketching Rendering System. In the static rendering, it needn't adjust the threshold for the convenient on rendering and the outlines are more precise and exact. Besides, attaching the graftal and sketching shadow makes the composition of an image more attractive. Through a series of clever image processes, the system finally presents excellent colored pencil style drawings. Because the proposed algorithm is not complicated, the rendering time is quite short compared to other past related studies. Compared with other research works and Photoshop on a set of benchmarks, the system demonstrates its strength in the aspects of full automation, stability of sketching quality and higher visual satisfaction, all achieved in a considerably shorter time. [ABSTRACT FROM AUTHOR]

The storage capacity of the conventional neural network is 0.14 times of the number of neurons (P=0.14N). Due to the huge difficulty in recognizing large number of images or patterns,researchers are looking for new methods at all times. Quantum Neural Network (QNN), which is a young and outlying science built upon the combination of classical neural network and quantum computing,is a candidate to solve this problem.This paper presents Quantum Probability Distribution Network (QPDN) whose elements of the storage matrix are distributed in a probabilistic way on the base of quantum linear superposition and applies QPDN on image recognition. Contrasting to the conventional neural network, the storage capacity of the QPDN is increased by a factor of 2N,where N is the number of neurons. Besides,the case analysis and simulation tests have been carried out for the recognition of images in this paper, and the result indicates that QPDN can recognize the images or patterns effectively and its working process accords with quantum evolvement process. [ABSTRACT FROM AUTHOR]

In this paper, selecting line segments as matching features in stereo vision, the orientation difference (O.D.) of the line segments is more deeply evaluated than the previous studies and two new constraints i.e. ordering and collinearity are proposed. The O.D. was supposed to be used for an indoor application, reducing candidates without elimination of the actual matches, especially if the line is horizontal or vertical with respect to the floor. The findings of this paper are as follows: 1) Applying a threshold on O.D. would result in a missing probability for the actual matches and this probability can be calculated for any given threshold, 2) The upper limit of O.D. for horizontal and vertical lines is a function of geometric parameters of the system, 3) An optimal tilt angle, whose results is the minimum upper limit for O.D., can be computed, 4) for disambiguation process, ordering and collinearity constraints are proposed. These are applied in a matching algorithm and their effectiveness is investigated on real stereo images. [ABSTRACT FROM AUTHOR]

In this paper, the line segment tracking is considered for an imaging system with translational motions (T.M.), rotational motions (R.M.) and arbitrary motions. Assuming a CCD camera with an arbitrary tilt angle installed on a mobile robot equipped with odometry system, to reduce the search space in the correspondence problem, two constraints are developed. These constraints are location and orientation differences (O.D.) for line segments in consecutive images. The findings of this paper include: 1)The development of the effect of camera tilt on the location constraint for T.M., 2)Illustrating that the upper bound of O.D. for both horizontal and vertical lines with respect to the floor, is a function of tilt in T.M., which can considerably be reduced and thus providing a tight constraint, 3)The development of the location constraint for R.M., 4) The development of the PDF and upper bound of O.D. for R.M., 5) The development of the location and O.D. constraint for arbitrary motions. Furthermore, the efficiency of these developed constraints in a line tracking algorithm was verified. [ABSTRACT FROM AUTHOR]

This paper presents a new description of image edge in the form of asymptote equation utilizing knowledge of differential geometry, and modifies a popular parlance in the traditional image processing. This paper develops the gradient concept and defines a generalized grads operator. The operator is a novel nonlinear transform, which inherits the strongpoint of noise suppression from the classical Gaussian differential filter and has a better edge extraction function. The experimental results show the proposed edge detection algorithm is powerful and effective. [ABSTRACT FROM AUTHOR]

The paper proposes a method to control the motion orbit of a cartoon object based on chaos theory. We first propose an adaptive delaying feedback controlling method which can control the Lorenz system to generate periodic, quasi-periodic and chaotic orbits. Then we apply our method to the topic of cartoon object motion controlling. It can enrich the motion type of the object thus enhances the visual effect of the cartoon video. The experiments validate the controlling results of the proposed method. Our research leads to a new area in which the chaotic theory is applied in the field of multimedia processing. [ABSTRACT FROM AUTHOR]

This paper presents an approach for speech information hiding based on G.721 scheme. This approach proposes an Analysis-By-Synthesis (ABS)-based speech information hiding and extracting algorithm, is called ABS algorithm, which form the theoretical basis for designing a secure speech communication system. The ABS algorithm adopts a speech synthesizer in a speech coder. Speech embedding and coding are synchronous, i.e. fusing of secret speech information data into speech coding. Dynamic secret speech information data bits can be embedded into original carrier speech data, with high efficiency in steganography and good quality in output speech. This method is superior to available classical algorithms on hiding capacity and robustness. This paper implements the proposed approach based on speech coding scheme G.721 and the experiments show that this approach meets the requirements of information hiding, satisfies the constraints of speech quality for secure communication, and achieves high hiding capacity of 1.6Kbps with an excellent speech quality and complicating speakers' recognition. [ABSTRACT FROM AUTHOR]

In this paper, an efficient approach to search for the global threshold of image using Gaussian mixture model is proposed. Firstly, a gray-level histogram of an image is represented as a function of the frequencies of gray-level. Then to fit the Gaussian mixtures to the histogram of image, the Expectation Maximisation (EM) algorithm is developed to estimate the number of Gaussian mixture of such histograms. Finally, the optimal threshold which is the average of these means is chosen. The paper compares the new method with the classical discriminate analysis method of Otsu's. And the experimental results show that the new algorithm performs better than that of Otsu's. [ABSTRACT FROM AUTHOR]

In this paper, we proposed image processing technique for automatic real time fire and smoke detection in tunnel environment. To avoid the large scale of damage of fire occurred in the tunnel, it is necessary to have a system to minimize and to discover the incident as fast as possible. However it is impossible to keep the human observation of Closed-Circuit Television (CCTV) in tunnel for 24 hour. So if the fire and smoke detection system through image processing can warn fire state, it will be very convenient, and it can be possible to minimize damage even when people is not in front of monitor. The fire and smoke detection is different from the forest fire detection as there are elements such as car and tunnel lights and others that are different from the forest environment so that an indigenous algorithm has to be developed. The two algorithms proposed in this paper, are able to detect the exact position, at the earlier stage of incident. In addition, by comparing properties of each algorithm throughout experiment, we have proved the validity and efficiency of proposed algorithm. [ABSTRACT FROM AUTHOR]

In speaker recognition fields, score normalization is a widely used and effective technique to enhance the recognition performances and is developing further. In this paper, we are focused on the comparison among many kinds of candidates of score normalization methods and a new implementation of the speaker adaptive test normalization (ATnorm) based on a cross similarity measurement is presented which doesn't need an extra corpus for speaker adaptive impostor cohort selection. The use of ATnorm for the language robustness of the multi-language speaker verification is also investigated. Experiments are conducted on the core task of the 2006 NIST Speaker Recognition Evaluation (SRE) corpus. The experimental results indicate that all the score normalization methods mentioned can improve the recognition performances and ATnorm behaves best. Moreover, ATnorm can further contribute to the performance as a means of language robustness. [ABSTRACT FROM AUTHOR]

Based on neural network with favorable adaptability to handwritten Chinese character multi-features, in this paper a new method is proposed, using existing multi-features as inputs to structure multi neural network recognition subsystems and these subsystems are integrated with parallel connection mode. The integrated system has the lowest false recognition rate. When using traditional von Neumann architecture computer to implement this system, the system response time is longer as a result of serial computation. This paper introduces a kind of parallel computation method of using pc cluster to implement multi subsystems. It can reduce effectively recognition system's response time. [ABSTRACT FROM AUTHOR]

According to Cachin's steganography security criterion, if the statistical distributions of cover and stego images are identical, the hidden message is assumed undetectable. However, any steganographic method will surely cause some statistical distortions, which gives steganalyst a hint. This paper presents a steganalysis method for JPEG images based on Cachin criterion. It estimates the cover image from the stego one by using a small-scale geometrical transform, and then detects the statistical distortions between the cover and stego images based on some features, which are sensitive to the steganographic modifications. Then a classifier is trained on these features. Three different modern steganographic schemes are tested. Experimental results show that the proposed steganalysis scheme has better performance compared to the current steganalysis methods. [ABSTRACT FROM AUTHOR]

Traditional speech recognition systems have relied on power spectral densities, Mel-frequency cepstral, linear prediction coding and formant analysis. This paper introduces two novel input feature sets and their extraction methods for intelligent phoneme identification. These input sets are based on intrinsic phonetic characteristics of Arabic speech comprising of the dimensionally reduced Power Spectral Densities (DPSD) and Location, Trend, Gradient (LTG) values of the captured speech signal spectrum. These characteristics have been subsequently utilized as inputs to four different neural network based recognition classifiers. The classifiers have been tested for twenty-eight Arabic phonemes utterances from over one hundred non-native speakers. The results obtained using the proposed feature sets have been compared and it has been observed that LTG based input feature set provides an average phoneme identification accuracy of 86% as compared to 70% obtained through applying DPSD based inputs for similar classifiers. It is worthwhile to note that the methods proposed in this paper are generic and are equally applicable to other regional languages such as Persian and Urdu. [ABSTRACT FROM AUTHOR]

In this paper, two new properties of singular value decomposition (SVD) on images are proved. The first property demonstrates the quantitative relationship between singular values and power spectrum. The second one proves that under the condition of losing equal power spectrum, the square-error of the reconstructed image is much smaller when we reduce all singular values proportionally instead of neglect the smaller ones. Based on the two properties, a new data-hiding scheme is proposed. It performs well as for robustness, for it satisfies power-spectrum condition (PSC), and PSC-compliant watermarks are proven to be most robust. Besides, the proposed scheme has a good performance as for capacity and adaptability. [ABSTRACT FROM AUTHOR]

Recent advances in networking technology have increased the potential collaborations for virtual enterprises (VEs) on a global scale. Due to the dynamic nature of collaborations, building and evolving trust is essential to support the formation of VEs. There is a critical need for the new approach suited to this environment. This paper presents a trust-based approach for partner selection problem in the VEs. The proposed model explores the dynamic properties of trustworthy index, which provides a multi-perspective and interactive overview of potential partners to the decision-makers. The model uses the hybrid learning algorithm of fuzzy cognitive map (FCM). As FCM has the excellent ability in modeling complex systems, the proposed model can support historical data mining automatically, and revise the existing model according to the new requirements. Results of three experiments show that this model provides reasonable performance and high adaptability for diverse partner selection problems. [ABSTRACT FROM AUTHOR]

With the growth of critical worm threats, many researchers have studied worm-related topics and internet anomalies. The researches are mainly concentrated on worm propagation and detection more than the fundamental characteristics of worms. It is very important to know worms' characteristics because the characteristics provide basic resource for worm prevention. Unfortunately, this kind of research cases are very few until now. Moreover the existing researches only focus on understanding the function structure of the worm propagation or the taxonomy of the worm according to a sequence of worm attacks. Thus, in this paper, we try to confirm the formalized pattern of the worm action from the existing researches and analyze the report of the anti-virus companies. Finally, we define the formalized actions based on temporal behaviors and worm packet flows, and we apply our proposed method for the new worm classification. [ABSTRACT FROM AUTHOR]

This paper proposes obstacle collision avoidance algorithm for a mobile robot. To navigate without colliding with obstacles the mobile robot uses both the vision system approach and edge detection approach using ultrasonic sensor. The vision system approach is used when the obstacle is located more than 2 meters away from the mobile robot, and the edge detection approach using ultrasonic sensor is used for detecting obstacle remains within 2 meters range. The collision avoidance algorithm proposed in this paper utilizes both the limit-cycle method and the nearness diagram navigation method. The proposed method is tested using Pioneer 2-DX mobile robot. Through experiment, the effectiveness of proposed methods for navigating a mobile robot in the dynamic environment is demonstrated. [ABSTRACT FROM AUTHOR]

The are various definitions of instantaneous frequency (IF) but most of them have short comings. The most popular of these definitions, is the one given by Cohen. To estimate IF accuratly, techniques become more and more complex. This paper introduces the idea of aggregate spectrogram (AS). When we are not interested in the entire spectrum (e.g., finding IF), it is better to find out AS which gives an aggregate view of the spectrogram rather than calculating the individual frequencies. Some properties of AS are also defined. The AS lowers the computational complexity. This paper also presents a technique to construct an AS and finding the IF from the AS. [ABSTRACT FROM AUTHOR]

Conventional hysteresis control schemes for direct torque control (DTC) of dual-three-phase induction machine (DTPIM) usually result highly distorted current waveforms. In this paper, fuzzy space voltage modulation technique is presented for DTPIM. Using two fuzzy controllers, amplitude and space angle of desired stator voltage vector, are obtained dynamically. Combined with unified pulse width modulation method, direct torque control is applied to DTPIM. Simulation results show that fast dynamic responses are achieved. The ripple of torque and the harmonics of stator current in steady state can be reduced remarkably compared with conventional DTC method. [ABSTRACT FROM AUTHOR]

The focus of situation-aware ubiquitous computing has increased lately. An example of situation-aware applications is a multimedia education system. The development of multimedia computers and communication techniques has made it possible for a mind to be transmitted from a teacher to a student in distance environment. This paper proposed a new model of dynamic window binding by analyzing the window and attributes of the attributes of the object, and based on this, a mechanism that offers a seamless view without interfering with concurrency control is also suggested. As the result of this system's experimental implementation and analysis of the increase of delay factors accordant with the size of collaboration increase, the simulation results clearly showed that the seam increases seriously in that case, and that the dynamic window binding mechanism proposed in this paper is worth implementation and effective when a large scale of collaboration is required. [ABSTRACT FROM AUTHOR]

The real-time information access of goods plays an increasingly important role for decision-making in operations management of supply chain. Based on mobile agent and radio-frequency identification (RFID) technology, this paper proposes a novel solution to track in transit goods. Firstly, mobile RFID reader integrated in a smart phone retrieves information automatically from RFID tags bound to goods. Then, the front-end system that works on the smart phone send information back to the back-end system via short message system of mobile telecommunication platform. Because the solution is built on mobile agent platform, it enables the back-end system to dispatch mobile agents to the front-end system to process raw RFID data locally, and only the filtered results are fed back. Therefore, the solution promises to reduce time and cost of data transfer between the front-end system and the back-end system. Finally, a prototype system, GTSys named, is implemented and verified on simulation platform. [ABSTRACT FROM AUTHOR]

This paper explores the attributes that drive company wealth creation in the Miscellaneous Industrials sector of the Australian Stock Market. It looks at how the company's wealth creation changes in comparison to the changes in the Miscellaneous Industrial Index. We examine traditional and artificial intelligent (AI) feature selection techniques, to select attributes that drive company wealth and observe if a multiple domain model outperforms a single domain model with regards to predicting company wealth. Using a large number of calculated attributes, our empirical findings suggest that a multiple domain model was most effective. We found that WACC, Funds from Operation / EBITDA and EPS assist in guiding the direction of change in shareholder wealth. Whereas ROA, Capital Turnover and Gross Debt / Cashflow are key attributes in understanding the behaviour of the relative shareholder growth. We observed that ROIC, Ordinary Share Price, EVA, EPS and Trading Revenue / Total Assets are the important attributes that drive relative shareholder wealth in this industry. [ABSTRACT FROM AUTHOR]

With the rapid development of WWW, HTML documents become one of the main file formats on the Web. However, blind people find difficulty in accessing the HTML documents for their complex structure and visual reliability. The main methods for the blind to browse the web pages are through screen reader and text web browser with TTS engine. These methods can only read text on the screen without knowing the relationship among the texts. It's very difficult and time consuming to find out some information from a bunch of texts. In this paper, a special web browser called eGuideDog is designed for the visually impaired people. This web browser can extract the structure and the content of an HTML document and represent it in the form of audio. It helps the blind finding out information they concern more quickly. [ABSTRACT FROM AUTHOR]

In this paper, we propose the novel feature extraction method, called the Polar wavelet, which can improve the search performance for locally distributed time series data. Among various feature extraction methods, the Harr wavelet has been popularly used to extract features from time series data. However, the Harr wavelet does not show the good performance for sequences of similar averages. The proposed method uses polar coordinates which are not affected by averages and can reduce the search space efficiently without false dismissals. The experiments are performed on real temperature dataset to verify the performance of the proposed method. [ABSTRACT FROM AUTHOR]

A new method of motion deadlock resolving by using fuzzy decision in robot soccer games is proposed in this paper. For the reasons of complex competition tasks and limited intelligence, soccer robots fall into motion deadlocks in many conditions, which is very difficult for robots to decide whether it is needed to retreat for finding new opportunities. Based on the analysis of human decision for dealing with these kinds of motion deadlocks, the fuzzy decision method is introduced in this paper. Then, fuzzy rules based deadlock resolving system is designed according to relative positions and orientations among robots and the ball in local regions. Lots of experiments by human experts and the fuzzy controller are implemented for comparison. Experimental results show that the method proposed is reasonable and efficient for motion deadlock resolving in most conditions for real soccer robot games. [ABSTRACT FROM AUTHOR]

This paper presents an speech information hiding model for transmitting secret speech through subliminal channel covertly for secure communication over PSTN (Public Switched Telephone Network) or VoIP (Voice over Internet Protocol). This model's main statement is that the embedding operation of a secure communication system should work indeterminate from the attacker's point of view. This model for secure communication based on the technique of information hiding has more severe requirements on the performances of data embedding than watermarking and fingerprinting in the aspects of real time, hiding capacity, and speech quality. Experiments show that this model meets the requirement of secure communication and suits for practical application of covert communication. The security analysis of this model by means of information theory and actual test proved that it is theoretically and practically secure. This information theory based model can be commonly used to help design a system of speech secure communication with different coding schemes. [ABSTRACT FROM AUTHOR]

In this paper, Umeyama's eigen-decomposition approach to weighted graph matching problems is critically examined. We argue that Umeyama's approach only guarantees to work well for graphs that satisfy three critical conditions: (1) The pair of weighted graphs to be matched must be nearly isomorphic; (2) The eigenvalues of the adjacency matrix of each graph have to be single and isolated enough to each other; (3) The rows of the matrix of the corresponding absolute eigenvetors cannot be very similar to each other. For the purpose of matching general weighted graph pairs without such imposed constraints, we shall propose an approximate formula with a theoretical guarantee of accuracy, from which Umeyama's formula can be deduced as a special case. Based on this approximate formula, a new algorithm for matching weighted graphs is developed. The experimental results demonstrate great improvements to the accuracy of weighted graph matching. [ABSTRACT FROM AUTHOR]

The Minimum Bit Error Rate (MBER) detectors outperform the conventional Minimum Mean Squared Error (MMSE) detector by minimizing the Bit Error Rate (BER) directly. In this paper an MBER multiuser detector for Orthogonal Frequency Division Multiplexing-Space Division Multiple Access (OFDM-SDMA) system is proposed employing Particle Swarm Optimization (PSO) for finding the optimum weight vectors. Simulation results show that the proposed system achieves faster convergence with lower complexity as compared to Genetic Algorithms (GA) with same Bit Error Rate (BER) performance. [ABSTRACT FROM AUTHOR]

This paper suggests 3D co-occurrence texture features by extending the concept of co-occurrence feature to the 3D world. The suggested 3D features are described as a 3D co-occurrence matrix by using a co-occurrence histogram of digital elevations at two contiguous positions. With the addition of 3D co-occurrence features, we encounter the high dimensionality problem in the classification process. Since these ANN (Artificial Neural Networks) clustering algorithms are known as robust in this situation, FCM (Fuzzy C-mean) and GBFCM (Gradient Based Fuzzy C-mean) clustering algorithms are employed to implement the terrain classifier. Experimental results show that the classification accuracy with the addition of 3D co-occurrence features is significantly improved over the conventional classification method only with 2D features. [ABSTRACT FROM AUTHOR]

This paper describes a method to know objects in outdoor environment for autonomous robot navigation. The proposition of the method segments and recognizes the object from an image taken by moving robot in outdoor environment. Features are color, straight line, edge, HCM (Hue Co-occurrence Matrix), PCs (Principal Components), vanishing point and geometrical information. We classify the object natural and artificial. We detect tree of natural object and building of artificial object.Then we define their characteristics individually. In the process, we segment regions objects included by preprocessing. Objects can be recognized when we combine predefined multiple features. The correct object recognition of proposed system is over 92% among our test database which consist about 1200 images. We confirm the result of image segmentation using multiple features and object recognition through experiments. [ABSTRACT FROM AUTHOR]

The quality of character image plays an important role for the performance of character recognition system. However there is no good way to measure the recognition difficulty of a given character image. For the given character image with unknown quality, it is improper that apply the single character database to recognize it by the same feature and the same classifier. This paper proposed a novel approach for multi-resolution character recognition whose feature is extracted directly from gray-scale image and classification is adaptive classification which adaptively selects the appropriate character database and classifiers by evaluating the image quality of the input character. A resolution evaluation algorithm based on gray distribution feature was proposed to decide the adaptive classification weights for the classifiers, which make the classification have the higher probability of being the correct decision. Experiment results demonstrate the proposed approach highly improved the performance of character recognition system. [ABSTRACT FROM AUTHOR]

This paper proposes an algorithm based on fuzzy support vector machine (FSVM), a new pattern analysis method, for detecting the abnormal trajectory patterns of moving objects from surveillance video. Firstly, feature points are extracted for presenting continuous trajectories. Then fuzzy memberships are introduced to measure contributions of the feature points of trajectory. Finally, the algorithm is applied to detect the abnormal patterns in 2D object trajectories. Experiments on trajectory data set show the validity of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a novel face recognition method based on binary face edges is presented to deal with the illumination problem. The Binary Face Edge Map (BFEM) is extracted using the Locally Adaptive Threshold (LAT) algorithm. Based on BEFM, a new image similarity metric is proposed. Experimental results show that face recognition rates of 76.32% and 82.67% are achieved respectively on 798 AR images and 150 Yale images with changed lighting conditions and facial expression variations when one sample per subject is used as the target image. The proposed method takes less time for image matching and outperforms some existing face recognition approaches, especially in changed lighting conditions. [ABSTRACT FROM AUTHOR]

Automatic reconstruction of patient-specific 3D bone model from a limited number of calibrated X-ray images is not a trivial task. Previous published works require either knowledge about anatomical landmarks, which are normally obtained by interactive reconstruction, or a supervised initialization. In this paper, we present an automatic 2D/3D reconstruction scheme and show its applications to reconstruct a surface model of the proximal femur from a limited number of calibrated X-ray images. In our scheme, the geometrical parameters of the proximal femur are obtained by using a Bayesian filter based inference algorithm to fit a parameterized multiple-component geometrical model to the input images. The estimated geometrical parameters are then used to initialize a point distribution model based 2D/3D reconstruction scheme for an accurate reconstruction of a surface model of the proximal femur. Here we report the quantitative and qualitative evaluation results on 10 dry cadaveric bones. Compared to the manual initialization, the automated initialization results in a little bit less accurate reconstruction but has the advantages of elimination of user interactions. [ABSTRACT FROM AUTHOR]

Two-dimension road following is one of the crucial tasks of vision navigation. For the reasons of environment complexity and the discrepancy between motion images, the robust outdoor road following for two-dimension image sequence is still a challenging task. This paper proposes a novel road following method, which firstly uses the Mean Shift algorithm with embedded edge confidence to partition the images into homogenous regions with precise boundary. Then, according to the color statistic information of the road/non-road model obtained from previous frames, the Graph Cuts (GC) algorithm is used to achieve the final binary images and update the road/non-road model simultaneously. This algorithm combines the advantages of Graph Cuts algorithm and Mean Shift algorithm, and effectively solves some difficult problems of conventional methods, such as the adaptive selection of road model under complex environments, and the choice of effective criteria for the region merging. Experiment results indicate our method possesses excellent performance under complicated environment, and meets the requirements of fast computing. [ABSTRACT FROM AUTHOR]

A new algorithm for decomposition of mixed pixels based on orthogonal bases of data space is proposed in this paper. It is a simplex-based method which extracts endmembers sequentially using computations of largest simplex volumes. At each searching step of this extraction algorithm, searching for the simplex with the largest volume is equivalent to searching for a new orthogonal basis which has the largest norm. The new endmember corresponds to the new basis with the largest volume. This algorithm runs very fast and can also avoid the dilemma in traditional simplex-based endmember extraction algorithms such as N-FINDR which generally produces different sets of final endmembers if different initial conditions are used. Moreover, with this set of orthogonal bases, the proposed algorithm can also determine the proper number of endmembers and finish the unmixing of the original images which cannot be done by the traditional simplex-based algorithms. Experimental results of both artificial simulated images and practical remote sensing images demonstrate that the algorithm proposed in this paper is a fast and accurate algorithm for the decomposition of mixed pixels. [ABSTRACT FROM AUTHOR]

This paper introduces the idea that recognition and interpretation of engineering drawings should be two interwoven phases, with each providing feedback to another, and applies this idea to a dynamic-rule-based method. Recognition rules with attributes are obtained by an automatic object feature extraction procedure, and stored in rule database. During the recognition phase, rules are firstly selected according to two attributes, domain and priority. Then the thresholds of the rules are adjusted automatically to obtain better match results and their priorities are modified dynamically to improve recognition efficiency. Especially, the interpretation phase based on the recognition is also valued in validating and rectifying the recognition result automatically and efficiently. This approach was implemented in a system for recognizing and interpreting architectural structure drawings, and has shown to embody good self-adaptability to various drafting conventions. [ABSTRACT FROM AUTHOR]

Emotion is fundamental to human experience influencing cognition, perception and everyday tasks such as learning, communication and even rational decision-making. This aspect must be considered in human-computer interaction. In this paper, we compare four different weighting functions in weighted KNN-based classifiers to recognize five emotions, including anger, happiness, sadness, neutral and boredom, from Mandarin emotional speech. The classifiers studied include weighted KNN, weighted CAP, and weighted D-KNN. To give a baseline performance measure, we also adopt traditional KNN classifier. The experimental results show that the used Fibonacci weighting function outperforms than others in all weighted classifiers. The highest accuracy achieves 81.4% with weighted D-KNN classifier. [ABSTRACT FROM AUTHOR]

In this paper, we present a new image compression algorithm which combines Wavelet Support Vector Machines (WSVM) learning with the wavelet transform. Based on the characteristic of wavelet transform, Daubechies 9/7 wavelet has been used to transform the image and the wavelet coefficients are trained with WSVM using translation-invariant wavelet kernels. Compression is achieved by using WSVM learning to approximate wavelet coefficients with the predefined level of accuracy. A minimal number of coefficients (support vectors) are then encoded by an effective entropy coder based on run-length and arithmetic coding. Experimental results show that the proposed method gains better performance than that of existing compression algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a frame rate up-conversion (FRC) algorithm using the motion vector frequency of neighboring blocks to reduce the block artifacts caused by failure of conventional motion estimation (ME) based on block matching algorithm (BMA) is proposed. The proposed method is based on the Spiral Full Search with early termination, which is applied to avoid the local minima on pattern-like image. Also, the motion vector correction that replaces a low frequency motion vector by a high frequency motion vector of neighborhood is used in the proposed method to reduce the block artifacts caused by the failure of conventional ME. In addition, bi-directional motion compensated interpolation (MCI) using the blocking index to reduce the block artifacts in occlusion area is used in the proposed method. Experimental results show good performance of the proposed scheme with significant reduction of the erroneous motion vectors and block artifacts. [ABSTRACT FROM AUTHOR]

This paper describes our work in implementing a real-time moving object detection system basing on a system on a chip (SoC) system. We have implemented the algorithms necessary for moving object detection while using a SoC IP and have prepared an exclusive image-processing SoC system to implement the algorithms. The implemented IP is the IP for the image, I2C control, edge detection, TFT-LCD, median filter, SRAM control, and moving object detection. Detection of a moving object, as for the input image, requires processing edge detection, image differentiation, application of a median filter, and last, detecting the moving object. The moving object area for a detected movement detects the moving object by the cumulative value of binary conversion density. [ABSTRACT FROM AUTHOR]

The triangle packing problem has yielded many significant theories and applications such as textile cutting and container stuffing. Although the representation method of the popular linear quadtree has many merits, it puts too much emphasis upon the symmetry of image segmentation. Therefore, it is not the optimal representation method. In this paper, inspired by the concept of the triangle packing problem, we present a Triangle Non-symmetry and Anti-packing pattern representation Model (TNAM). Also, we propose a novel algorithm for the TNAM of the gray images. By comparing the algorithm for the TNAM with that for the linear quadtree, the theoretical and experimental results show that the former is much more effective than the latter and is a better method to represent the gray images. The algorithm for the TNAM of the gray images is valuable for the theoretical research and potential business foreground. [ABSTRACT FROM AUTHOR]

Atrial fibrillation data series show the non-linear and chaos characters in the process of time-space kinetics evolution. In the case of unknowing the fractal dimension of atrial fibrillation chaos, the process of querying the similarity of diagnosis curve figure will be affected to a certain degree. An evaluation formula of varying-time Hurst index is established by wavelet and the algorithm of varying-time index is presented, which is applied to extract the characteristics of the atrial fibrillation in this paper. The diagnosis of atrial fibrillation curve figure can be done at some resolution ratio level. The results show that the time-varying fractal dimension rises when atrial fibrillation begins, while it falls when atrial fibrillation ends. The begin and the end characteristics of atrial fibrillation can be successfully detected by means of the change of the time-varying fractal dimension. The results also indicate that the complexity of heart rate variability (HRV) decreases at the beginning of atrial fibrillation. The effectiveness of the method is validated by means of the HRV example in the end. [ABSTRACT FROM AUTHOR]

In cancer diagnosis and treatment, clustering based on gene expression data has been shown to be a powerful method in cancer class discovery. In this paper, we discuss the use of nonnegative matrix factorization with sparseness constraints (NMFSC), a method which can be used to learn a parts representation of the data, to analysis gene expression data. We illustrate how to choose appropriate sparseness factors in the algorithm and demonstrate the improvement of NMFSC by direct comparison with the nonnegative matrix factorization (NMF). In addition, when using it on the two well-studied datasets, we obtain pretty much the same results with the sparse non-negative matrix factorization (SNMF). [ABSTRACT FROM AUTHOR]

Text categorization (TC) has become one the most researched fields in NLP. In this paper, we try to solve the problem of TC through a 2-step feature selection approach. First we cluster the words that appear in the texts according to their distribution in categories. Then we extract concepts from these clusters, which are DEF terms in HowNet. The extraction is according to the word clusters instead of single words. This method maintains the generalization ability of concept extraction based TC and at the same time makes full use of the occurrences of new words that are not found in concept thesaurus. We test the performance of our feature selection method on the Sogou corpus for TC with an SVM classifier. Results of our experiments show that our method can improve the performance of TC in all categories. [ABSTRACT FROM AUTHOR]

The block matching algorithm (BMA) is one of the most important processing in the video compression. Since the sub-pixel motion estimation and motion compensation are needed, the computational complexity of the BMA is increased. Recently, the sum of absolute difference (SAD) calculation is widely used for BMA but it accounted for much of the total computation of the video compression. To implement the real-time video compression, the fast algorithm for motion estimation and motion compensation based on SAD computation is needed. The partial distortion elimination (PDE) scheme is one of the most advanced methods to decrease the SAD computational complexity. The basic concept of the PDE is that if the accumulated SAD values are greater than the given accumulated SAD value then the SAD computation is stopped. Where, the given accumulated SAD value is a kind of average value. Therefore, the big problem of the PDE is that the division is needed. And, as initial accumulated SAD value is large, PDE operation becomes efficient. Thus scan order is also important in SAD computation. In this paper, we introduce the new average computation method for PDE operation without division, its mathematical modeling and architecture. The new computational method is named as RAVR (Rough Average). And we propose the advanced scan order for efficient PDE scheme based on ARVR concept. Thus, our proposed algorithm combines above two main concepts and suffers the improving SAD performance and the easy hardware implementation methods. [ABSTRACT FROM AUTHOR]

System call sequences are useful criteria to judge the behaviors of processes. How to generate an efficient matching algorithm and how to build up an implementable system are two of the most difficult problems. In this paper, we explore the possibility of extending consecutive system call to incorporate temporal signature to the Host-based Intrusion Detection System. In this model, we use the real-time detected system call sequences and their consecutive time interval as the data source, and use temporal signature to filter the real model. During the monitoring procedure, we use data mining methods to analyze the source dynamically and implement incremental learning mechanism. Through studying small size samples and incremental learning, the detecting ability of the system can be still good when the sample's size is small. This paper also introduces the key technologies to build such a system, and verifies this intrusion detection method in real time environment. Finally, this paper gives the experiments results to verify the availability and efficiency of our system. [ABSTRACT FROM AUTHOR]

The ATIS (Advanced Traveler Information System) provides travelers with real-time and precise information about the shortest path to the destination, the traffic condition, travel time estimation, and so on. To offer these services, we have to collect the speed data which are necessary to ATIS. However many data are lost due to communication or sensor errors during collecting the data. In order to provide accurate service, the lost data have to be compensated. Thus, a lot of prediction methods have been proposed to compensate the lost speed data. In this paper, we propose new prediction method adopting the back propagation neural network under neighboring links' speed as well as weekday and time. Experimental results show that our method reduces prediction error up to 41.8 % compared to the previous method. [ABSTRACT FROM AUTHOR]

This paper presents a systematic isotropy analysis of a caster wheeled omnidirectional mobile robot (COMR) with three active caster wheels. Unlike previous analysis, no assumption is made on the relative scale of the steering link offset and the wheel radius. First, with the characteristic length introduced, the kinematic model of a COMR is obtained based on the orthogonal decomposition of the wheel velocities. Second, the necessary and sufficient isotropy conditions are examined to categorize three different groups to be handled in a similar way. Third, the isotropy conditions are further explored to identify four different sets of all possible isotropic configurations. Fourth, the characteristic lengths required for the isotropy of a COMR are obtained in a closed-form. Finally, the local and the global isotropy indices are used to determine the optimal design parameters. [ABSTRACT FROM AUTHOR]

The motion identification for a class of movements in the space by using stereo vision is considered by observing at least three points in this paper. The considered motion equation can cover a wide class of practical movements in the space. The observability of this class of movement is clarified. The estimations of the motion parameters which are all time-varying are developed in the proposed algorithm based on the second method of Lyapunov. The assumptions about the perspective system are reasonable, and the convergence conditions are intuitive and have apparently physical interpretations. The proposed recursive algorithm requires minor a priori knowledge about the system and can alleviate the noises in the image data. Furthermore, the proposed algorithm is modified to deal with the occlusion phenomenon. Simulation results show the proposed algorithm is effective even in the presence of measurement noises. [ABSTRACT FROM AUTHOR]