Multiple horizontally overlapping lines are normally found in printed newspapers of almost every language due to high compression methods used for printing of the newspapers. For any optical character recognition (OCR...
详细信息
Multiple horizontally overlapping lines are normally found in printed newspapers of almost every language due to high compression methods used for printing of the newspapers. For any optical character recognition (OCR) system, presence of horizontally overlapping lines decreases the recognition accuracy drastically. In this paper, we have proposed a solution for segmenting horizontally overlapping lines. Whole document has been divided into strips and proposed algorithm has been applied for segmenting horizontally overlapping lines and associating small strips to their respective lines. The results reveal that the algorithm is almost 99% perfect when applied to the Gurmukhi script.
The modern steganography presents a challenging task of embedding data that should be imperceptible to the human visual system (HVS) and also escape the detection of powerful machine vision of computers. In this paper...
详细信息
The modern steganography presents a challenging task of embedding data that should be imperceptible to the human visual system (HVS) and also escape the detection of powerful machine vision of computers. In this paper we present a high capacity, lossless, secure wavelet steganographic algorithm in which payload bitstream is encrypted and embedded into the wavelet coefficients of the cover image to derive a stego-image. The payload is embedded in the approximation band of the wavelet domain that increases its robustness. It is observed through simulations that mean square error (MSE), mean absolute error (MAE), bit error rate (BER) and histogram analysis that the pay load is retrieved without any errors and its performance is better than the earlier insignificant coefficient replacement (ICR) technique.
In previous work we have applied the novel [7] a method originally designed to evaluate automatic machine translation systems, in assessing short essays written by students [16]. In this paper we present a comparative...
详细信息
In previous work we have applied the novel [7] a method originally designed to evaluate automatic machine translation systems, in assessing short essays written by students [16]. In this paper we present a comparative evaluation between this combination algorithms and a system based on BLEU and Latent Semantic Analysis. In addition we propose an effective combination schema for them. We study how much combination approach scores correlate to human scorings and other evaluation metrics. In spite of the simplicity of these shallow NLP methods, they achieve state-of-the art correlations to the teacher's scores while keeping the language-independence and without requiring any domain specific knowledge.
Progressive image transmission is often used in low bandwidth communications or in limited bandwidth environments. When a user browses an image on a website, the web server first sends a low quality image to the recei...
详细信息
Progressive image transmission is often used in low bandwidth communications or in limited bandwidth environments. When a user browses an image on a website, the web server first sends a low quality image to the receiver and then gradually improves the image quality by subsequent transmissions .Because the image size becomes larger and larger, it is essential to develop a flexible and efficient technique to help users quickly browse or retrieve images on a website. For this reason, using significant features along with a prediction technique for progressive image transmission is proposed in this paper. In our method, significant features of an image need to be extracted first. Next, these features, according to their priority, are sent to the receiver. For reducing the encoding cost of the transmitted data, three approaches, sampling, quantization, and linear regression prediction, are also presented.
Frequent set mining (FSM), an important phase of association rule mining, is the process of generating frequent sets that satisfy a specified minimum support threshold. This paper explores FSM in temporal data domain ...
详细信息
Frequent set mining (FSM), an important phase of association rule mining, is the process of generating frequent sets that satisfy a specified minimum support threshold. This paper explores FSM in temporal data domain or FTP mining and proposes an efficient algorithm for the same. Existing algorithms for FTP mining are based on a priori's level wise principle. In conventional or transactional data domain, a priori has been proven to suffer from the repeated scans limitation and has been succeeded by several algorithms that overcome the setback. The proposed algorithm eliminates a priori's repeated scans limitation in temporal domain, requiring only two overall scans of the original input. Experimental results demonstrate the significant improvements in execution time of the proposed algorithm as opposed to the a priori based one
The sharable content object reference model (SCORM) has become a popular standard for sharing and reusing teaching materials in the field of e-learning. However, efficient retrieval of SCORM-compliant learning objects...
详细信息
The sharable content object reference model (SCORM) has become a popular standard for sharing and reusing teaching materials in the field of e-learning. However, efficient retrieval of SCORM-compliant learning objects stored on grid environments is a challenging problem. In this paper, a performance-based approach is proposed to retrieve teaching materials in grid environments. The proposed architecture uses the real-time information gathered by a resource-monitoring tool to estimate the dynamically changing performance of each node, for CPU loading and network bandwidth. In addition, a grid testbed is built to implement the model. Experimental results show that the proposed approach can choose the most appropriate site to reduce the retrieval time
Traditionally, interlibrary cooperation is an important interaction between libraries. Nevertheless, the emerging digital library architecture has not explicitly supported this requirement. In this paper, we proposed ...
详细信息
Traditionally, interlibrary cooperation is an important interaction between libraries. Nevertheless, the emerging digital library architecture has not explicitly supported this requirement. In this paper, we proposed an interlibrary cooperation framework for digital libraries using P2P technology. An application of this framework to Faculty Publication Sharing System was presented. Besides, a reputation model based on data mining is utilized to provide libraries with incentives to join this framework
In this paper, we propose a cooperative control strategy for a group of robotic vehicles to achieve the specified task issued from a high-level astronaut command. The problem is mathematically formulated as designing ...
详细信息
In this paper, we propose a cooperative control strategy for a group of robotic vehicles to achieve the specified task issued from a high-level astronaut command. The problem is mathematically formulated as designing the cooperative control for a general class of multiple-input-multiple-output (MIMO) dynamical systems in canonical form with arbitrary but finite relative degrees such that the outputs of the overall system converge to the explicitly given steady state. The proposed cooperative control for individual vehicle only need to use the sensed and communicated outputs information from its local neighboring vehicles. No fixed leader and time-invariant communication networks are assumed among vehicles. Particularly, a set of less-restrictive conditions on the connectivity of the sensor/communication networks are established, under which it is rigorously proven by using the newly found nice properties of the convergence of sequences of row stochastic matrices that the cooperative objective of the overall system can be achieved. Simulation results for a group of vehicles achieving a target and surrounding a specified object in formation are provided to support the proposed approach in this paper.
In this paper an efficient user identification scheme based on ID-based cryptosystem is discussed. In this paper, it is indicated that Hwang et al., scheme is vulnerable to the forgery attack. And also improved scheme...
详细信息
In this paper an efficient user identification scheme based on ID-based cryptosystem is discussed. In this paper, it is indicated that Hwang et al., scheme is vulnerable to the forgery attack. And also improved scheme is quite similar to Hwang et al's scheme; the modified scheme is secure against the attack. The time complexity of computing the parameter a requires just one more modular multiplication operation. Thus, the scheme is not only far more secure but also efficient than Hwang et al's
暂无评论