Question: A convolutional MKL technique for multimodal sentiment analysis and emotion recognition.

This paper presents a novel approach to detecting sarcasm in tweets by leveraging deep convolutional neural networks (CNNs) for a more nuanced understanding of language. Traditionally, sarcasm detection has been approached as a text classification problem, but this method often falls short in capturing the subtleties that define sarcastic expressions. Our research takes a step further by utilizing a pre-trained CNN to extract a rich set of features related to sentiment, emotion, and personality, which are crucial for recognizing sarcasm. These features, in conjunction with the CNN's baseline attributes, enable our models to surpass the performance of current state-of-the-art methods on established benchmark datasets. Furthermore, we tackle the challenge of model generalizability, ensuring that our system can accurately classify unseen data, a critical aspect often overlooked in sarcasm detection studies. This deeper analysis of tweets through the lens of deep learning enhances the accuracy of sarcasm detection, providing a more sophisticated tool for sentiment analysis and other natural language processing tasks.

We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically and semantically) using a language model. The entire network is trained jointly on all these tasks using weight-sharing, an instance of multitask learning. All the tasks use labeled data except the language model which is learnt from unlabeled text and represents a novel form of semi-supervised learning for the shared tasks. We show how both multitask learning and semi-supervised learning improve the generalization of the shared tasks, resulting in state-of-the-art-performance.

We address the problem common space learning approach that maps all related multimodal information into a common space for multimodal data. To establish a fine-grained common space, the aligned relevant local information of different modalities is used to learn a common subspace where the projected fragmented information is further integrated according to intra-modal semantic relationships. Specifically, we propose a novel multimodal LSTM with an attention alignment mechanism, namely attention alignment multimodal LSTM (AAM-LSTM), which mainly includes attentional alignment recurrent network (AA-R) and hierarchical multimodal LSTM (HM-LSTM). Different from the traditional methods which operate on the full modal data directly, the proposed model exploits the inter-modal and intra-modal semantic relationships of local information, to jointly establish a uniform representation of multi-modal data. Specifically, AA-R automatically captures semantic-aligned local information to learn common subspace without the need of supervised labels, then HM-LSTM leverages the potential relationships of these local information to learn a fine-grained common space. The experimental results on Filker30K, Filker8K, and Filker30K entities verify the performance and effectiveness of our model, which compares favorably with the state-of-the-art methods. In particular, the experiment of phrase localization on AA-R with Filker30K entities shows the expected accurate attention alignment. Moreover, from the experiment results of image-sentence retrieval tasks, it can be concluded that the proposed AAM-LSTM outperforms benchmark algorithms by a large margin.

As the expressive depth of an emotional face differs with individuals or expressions, recognizing an expression using a single facial image at a moment is difficult. A relative expression of a query face compared to a reference face might alleviate this difficulty. In this paper, we propose to utilize contrastive representation that embeds a distinctive expressive factor for a discriminative purpose. The contrastive representation is calculated at the embedding layer of deep networks by comparing a given (query) image with the reference image. We attempt to utilize a generative reference image that is estimated based on the given image. Consequently, we deploy deep neural networks that embed a combination of a generative model, a contrastive model, and a discriminative model with an end-to-end training manner. In our proposed networks, we attempt to disentangle a facial expressive factor in two steps including learning of a generator network and a contrastive encoder network. We conducted extensive experiments on publicly available face expression databases (CK+, MMI, Oulu-CASIA, and in-the-wild databases) that have been widely adopted in the recent literatures. The proposed method outperforms the known state-of-the art methods in terms of the recognition accuracy.

Nowadays, the automatic detection of emotions is employed by many applications across different fields like security informatics, e-learning, humor detection, targeted advertising, etc. Many of these applications focus on social media. In this study, we address the problem of emotion detection in Arabic tweets. We focus on the supervised approach for this problem where a classifier is trained on an already labeled dataset. Typically, such a training set is manually annotated, which is expensive and time consuming. We propose to use an automatic approach to annotate the training data based on using emojis, which are a new generation of emoticons. We show that such an approach produces classifiers that are more accurate than the ones trained on a manually annotated dataset. To achieve our goal, a dataset of emotional Arabic tweets is constructed, where the emotion classes under consideration are: anger, disgust, joy and sadness. Moreover, we consider two classifiers: Support Vector Machine (SVM) and Multinomial Naive Bayes (MNB). The results of the tests show that the automatic labeling approaches using SVM and MNB outperform manual labeling approaches.

Sentiment analysis is crucial for extracting social signals from social media content. Due to the prevalence of images in social media, image sentiment analysis is receiving increasing attention in recent years. However, most existing systems are black-boxes that do not provide insight on how image content invokes sentiment and emotion in the viewers. On the other hand, psychological studies have confirmed that salient objects in an image often invoke emotions. In this work, we investigate more fine-grained and more comprehensive interaction between visual saliency and visual sentiment. In particular, we partition images in several meta-level scene-type dimensions that are relevant to most images, including: open-closed, natural-manmade, indoor-outdoor, and face-noface. Facilitated by state of the art saliency detection algorithm and sentiment classification algorithm, we examine how the sentiment of the salient region(s) in an image relates to the overall sentiment of the image. The experiments on a representative image emotion dataset have shown interesting correlation between saliency and sentiment in different scene types and shed light on the mechanism of visual sentiment evocation.

Facial expression recognition systems have attracted much research interest within the field of artificial intelligence. Many established facial expression recognition (FER) systems apply standard machine learning to extracted image features, and these methods generalize poorly to previously unseen data. This project builds upon recent research to classify images of human faces into discrete emotion categories using convolutional neural networks (CNNs). We experimented with different architectures and methods such as fractional max-pooling and finetuning, ultimately achieving an accuracy of 0.48 in a sevenclass classification task.

The purpose of this work is to empirically study desirable properties such as semantic coherence, attention mechanism and kernel reusability in Convolution Neural Networks (CNNs) for learning sentence classification tasks. We propose to learn semantically coherent kernels using clustering scheme combined with Word2Vec representation and domain knowledge such as SentiWordNet. We also suggest a technique to visualize attention mechanism of CNNs. These ideas are useful for decision explanation purpose. Reusable property enables kernels learned on one problem to be used in another problem. This helps in efficient learning as only a few additional domain specific kernels may have to be learned. Experimental results demonstrate the usefulness of our approach. The performance of the proposed approach, which uses semantic and re-usability properties, is close to that of the state-of-the-art approaches on many real-world datasets.

Two large facial-expression databases depicting challenging real-world conditions were constructed using a semi-automatic approach via a recommender system based on subtitles.

The track 2 and track 3 of ChaLearn 2016 can be considered as Multi-Label Classification problems. We present a framework of learning deep binary encoding (DeepBE) to deal with multi-label problems by transforming multi-labels to single labels. The transformation of DeepBE is in a hidden pattern, which can be well addressed by deep convolutions neural networks (CNNs). Furthermore, we adopt an ensemble strategy to enhance the learning robustness. This strategy is inspired by its effectiveness in fine-grained image recognition (FGIR) problem, while most of face related tasks such as track 2 and track 3 are also FGIR problems. By DeepBE, we got 5.45% and 10.84% mean square error for track 2 and track 3 respectively. Additionally, we proposed an algorithm adaption method to treat the multiple labels of track 2 directly and got 6.84% mean square error.

The discipline where sentiment/ opinion/ emotion has been identified and classified in human written text is well known as sentiment analysis. A typical computational approach to sentiment analysis starts with prior polarity lexicons where entries are tagged with their prior out of context polarity as human beings perceive using their cognitive knowledge. Till date, all research efforts found in sentiment lexicon literature deal mostly with English texts. In this article, we propose multiple computational techniques like, WordNet based, dictionary based, corpus based or generative approaches for generating SentiWordNet(s) for Indian languages. Currently, SentiWordNet(s) are being developed for three Indian languages: Bengali, Hindi and Telugu. An online intuitive game has been developed to create and validate the developed SentiWordNet(s) by involving Internet population. A number of automatic, semi-automatic and manual validations and evaluation methodologies have been adopted to measure the coverage and credibility of the developed SentiWordNet(s).


Question: A convolutional MKL technique for multimodal emotion detection and sentiment analysis.

This paper presents a novel Convolutional Recurrent Neural Network (C-RNN) architecture aimed at capturing spatial dependencies within images to improve representation learning. Traditional Convolutional Neural Networks (CNNs) often process image regions independently through convolution and pooling operations, overlooking the potential contextual relationships between these regions. These relationships, however, encode valuable spatial structure information. Recurrent Neural Networks (RNNs), on the other hand, are adept at learning contextual dependencies in sequential data through their recurrent connections. By combining the strengths of both, the C-RNN framework is designed to learn spatial dependencies between image regions, thereby enhancing the discriminative power of image representations. The C-RNN model is trained in an end-to-end fashion directly from raw pixel images. Initially, CNN layers generate intermediate features, followed by an RNN layer that encodes spatial dependencies. This approach is particularly effective for images where spatial contextual dependencies are pronounced. The C-RNN demonstrates impressive performance on benchmark datasets such as ILSVRC 2012, SUN 397, and MIT indoor, showcasing its capability in learning richer image representations.

We consider the problem of learning to summarize images by text and visualize text utilizing images, which we call Mutual-Summarization. We divide the web image-text data space into three subspaces, namely pure image space (PIS), pure text space (PTS) and image-text joint space (ITJS). Naturally, we treat the ITJS as a knowledge base.
 For summarizing images by sentence issue, we map images from PIS to ITJS via image classification models and use text summarization on the corresponding texts in ITJS to summarize images. For text visualization problem, we map texts from PTS to ITJS via text categorization models and generate the visualization by choosing the semantic related images from ITJS, where the selected images are ranked by their confidence. In above approaches images are represented by color histograms, dense visual words and feature descriptors at different levels of spatial pyramid; and the texts are generated according to the Latent Dirichlet Allocation (LDA) topic model. Multiple Kernel (MK) methodologies are used to learn classifiers for image and text respectively. We show the Mutual-Summarization results on our newly collected dataset of six big events ("Gulf Oil Spill", "Haiti Earthquake", etc.) as well as demonstrate improved cross-media retrieval performance over existing methods in terms of MAP, Precision and Recall.

We construct multi-modal concept representations by concatenating a skip-gram linguistic representation vector with a visual concept representation vector computed using the feature extraction layers of a deep convolutional neural network (CNN) trained on a large labeled object recognition dataset. This transfer learning approach brings a clear performance gain over features based on the traditional bag-of-visual-word approach. Experimental results are reported on the WordSim353 and MEN semantic relatedness evaluation tasks. We use visual features computed using either ImageNet or ESP Game images.

Facial expressions are one of the most powerful, natural and immediate means for human being to communicate their emotions and intensions. Recognition of facial expression has many applications including human-computer interaction, cognitive science, human emotion analysis, personality development etc. In this paper, we propose a new method for the recognition of facial expressions from single image frame that uses combination of appearance and geometric features with support vector machines classification. In general, appearance features for the recognition of facial expressions are computed by dividing face region into regular grid (holistic representation). But, in this paper we extracted region specific appearance features by dividing the whole face region into domain specific local regions. Geometric features are also extracted from corresponding domain specific regions. In addition, important local regions are determined by using incremental search approach which results in the reduction of feature dimension and improvement in recognition accuracy. The results of facial expressions recognition using features from domain specific regions are also compared with the results obtained using holistic representation. The performance of the proposed facial expression recognition system has been validated on publicly available extended Cohn-Kanade (CK+) facial expression data sets.

Neural network architectures such as long short-term memory (LSTM) have been proven to be powerful models for processing sequences including text, audio and video. On the basis of vanilla LSTM, multi-modal attention mechanisms are proposed in this paper to synthesize the time and semantic information of input sequences. First, we reconstruct the forget and input gates of the LSTM unit from the perspective of attention model in the temporal dimension. Then the memory content of the LSTM unit is recalculated using a cluster-based attention mechanism in semantic space. Experiments on acoustic scene classification tasks show performance improvements of the proposed methods when compared with vanilla LSTM. The classification errors on LITIS ROUEN dataset and DCASE2016 dataset are reduced by 16.5% and 7.7% relatively. We get a second place in the Kaggle’s YouTube-8M video understanding challenge, and multi-modal attention based LSTM model is one of our bestperforming single systems.

As the expressive depth of an emotional face differs with individuals or expressions, recognizing an expression using a single facial image at a moment is difficult. A relative expression of a query face compared to a reference face might alleviate this difficulty. In this paper, we propose to utilize contrastive representation that embeds a distinctive expressive factor for a discriminative purpose. The contrastive representation is calculated at the embedding layer of deep networks by comparing a given (query) image with the reference image. We attempt to utilize a generative reference image that is estimated based on the given image. Consequently, we deploy deep neural networks that embed a combination of a generative model, a contrastive model, and a discriminative model with an end-to-end training manner. In our proposed networks, we attempt to disentangle a facial expressive factor in two steps including learning of a generator network and a contrastive encoder network. We conducted extensive experiments on publicly available face expression databases (CK+, MMI, Oulu-CASIA, and in-the-wild databases) that have been widely adopted in the recent literatures. The proposed method outperforms the known state-of-the art methods in terms of the recognition accuracy.

We present the first shared task on detecting the intensity of emotion felt by the speaker of a tweet. We create the first datasets of tweets annotated for anger, fear, joy, and sadness intensities using a technique called best–worst scaling (BWS). We show that the annotations lead to reliable fine-grained intensity scores (rankings of tweets by intensity). The data was partitioned into training, development, and test sets for the competition. Twenty-two teams participated in the shared task, with the best system obtaining a Pearson correlation of 0.747 with the gold intensity scores. We summarize the machine learning setups, resources, and tools used by the participating teams, with a focus on the techniques and resources that are particularly useful for the task. The emotion intensity dataset and the shared task are helping improve our understanding of how we convey more or less intense emotions through language.

ses a facial expression recognition system based on Gabor feature using a novel r bank. Traditionally, a global Gabor filter bank with 5 frequencies and 8 ten used to extract the Gabor feature. A lot of time will be involved to extract mensions of such Gabor feature vector are prohibitively high. A novel local Gabor art of frequency and orientation parameters is proposed. In order to evaluate the he local Gabor filter bank, we first employed a two-stage feature compression LDA to select and compress the Gabor feature, then adopted minimum distance nize facial expression. Experimental results show that the method is effective for eduction and good recognition performance in comparison with traditional entire . The best average recognition rate achieves 97.33% for JAFFE facial expression abor filter bank, feature extraction, PCA, LDA, facial expression recognition. deliver rich information about human emotion and play an essential role in human In order to facilitate a more intelligent and natural human machine interface of new cts, automatic facial expression recognition [1][18][20] had been studied world en years, which has become a very active research area in computer vision and n. There are many approaches have been proposed for facial expression analysis ages and image sequences [12][18] in the literature. we focus on the recognition of facial expression from single digital images with feature extraction. A number of approaches have been developed for extracting by: Motorola Labs Research Foundation (No.303D804372), NSFC (No.60275005), GDNSF 105938).

Reliable prediction of affective states in real world scenarios is very challenging and a significant amount of ongoing research is targeted towards improvement of existing systems. Major problems include the unreliability of labels, variations of the same affective states amongst different persons and in different modalities as well as the presence of sensor noise in the signals. This work presents a framework for adaptive fusion of input modalities incorporating variable degrees of certainty on different levels. Using a strategy that starts with ensembles of weak learners, gradually, level by level, the discriminative power of the system is improved by adaptively weighting favorable decisions, while concurrently dismissing unfavorable ones. For the final decision fusion the proposed system leverages a trained Kalman filter. Besides its ability to deal with missing and uncertain values, in its nature, the Kalman filter is a time series predictor and thus a suitable choice to match input signals to a reference time series in the form of ground truth labels. In the case of affect recognition, the proposed system exhibits superior performance in comparison to competing systems on the analysed dataset.

In this paper, we explore a large multimodal dataset of about 65k albums constructed from a combination of Amazon customer reviews, MusicBrainz metadata and AcousticBrainz audio descriptors. Review texts are further enriched with named entity disambiguation along with polarity information derived from an aspect-based sentiment analysis framework. This dataset constitutes the cornerstone of two main contributions: First, we perform experiments on music genre classification, exploring a variety of feature types, including semantic, sentimental and acoustic features. These experiments show that modeling semantic information contributes to outperforming strong bag-of-words baselines. Second, we provide a diachronic study of the criticism of music genres via a quantitative analysis of the polarity associated to musical aspects over time. Our analysis hints at a potential correlation between key cultural and geopolitical events and the language and evolving sentiments found in music reviews.

Nowadays, sentiment analysis is a popular research area in computer science. which aims to determine a person’s or a group’s mood, behaviour and opinion about any topic with using textual documents. With the proliferation of social micro-blogging sites, digital opinion text data is increased. Thus, many sentiment analysis researches are performed on these public data in different sociological fields, such as finance, economy and politics. In this paper, a novel sentiment analysis method is proposed on micro-blogging sites which uses new user metrics. Proposed method is used to measure financial community’s sentiment polarity on micro-blogging sites. In addition to that we analyze the correlation between the mood of financial community and the behavior of the Borsa Istanbul 100 index weekly by Pearson correlation coefficient method. Our test results show that this novel sentiment analysis method improves to the accuracy of linear relationship between the behavior of the stock market and the sentiment polarity of the financial community.


Question: Automated defect identification in TFT-LCD array processes utilizing quasiconformal kernel support vector data description.

This document explores an innovative approach to intrusion detection in computer networks, utilizing neural networks to monitor and identify unusual user activity, which is critical in maintaining system security. Traditional methods, such as rule-based systems or real-time command prediction, are either time-consuming to develop or insufficiently reliable. The proposed method leverages neural networks to recognize unique patterns of user behavior, akin to how law enforcement uses fingerprints to identify individuals at crime scenes. By training a neural network to learn these behavioral 'fingerprints,' it can accurately distinguish between typical and atypical activities for each user. When deviations from the learned pattern are detected, it triggers an alert, indicating a potential security breach. The effectiveness of this neural network intrusion detection system (NNID) was evaluated on a network of 10 users. The results were promising, with the system achieving a 96% accuracy rate in detecting anomalous activity and a 7% false alarm rate. These findings support the notion that neural networks are a viable and efficient tool for intrusion detection by learning and monitoring user profiles.

We introduce a (semi-)automatic OCR post-processing system that utilizes web-scale linguistic corpora in providing high-quality correction. This paper is a comprehensive system overview with the focus on the computational procedures, applied linguistic analysis, and processing optimization.

This paper aims in classifying and identifying the diseases of mango leaves for Indian agriculture. K-means algorithm is chosen for the disease segmentation, and the disease classification and identification is carried out using the SVM classifier. Disease identification based on analysis of patches or discoloring of leaf will hold good for some of the plant diseases, but some other diseases which will deform the leaf shape cannot be identified based on the same method. In this case leaf shape based disease identification has to be performed. Based on this analysis two topics are addressed in this research paper. (1) Disease identification using the OpenCV libraries (2) Leaf shape based disease identification. Keywordk-means,Principal Component Analysis (PCA), feature extraction, shape detection, disease identification, Elliptic fourier analysis, Support Vector Machine(SVM), Artificial Neural Network (ANN)

Automatic processing of large volume scanned Chinese bank statements is a urgent demand recently. Conventional methods can not well handle the following challenges of this problem: various layout styles, noises, and especially requirement of fast speed for large Chinese character set. This paper proposes a knowledge based table recognition method to meet fast speed requirement with good accuracy. Two kinds of knowledge are utilized to accelerate the identification of digit columns and the cell recognition: i) geometric knowledge about column alignment and quasi equal digit width, and ii) semantic knowledge about prior format based on the results from an optical character recognition (OCR) engine of digits. Experimental results on a real dataset show the effectiveness of our method.

We present a method for automatically solving apictorial jigsaw puzzles that is based on an extension of the method of differential invariant signatures. Our algorithms are designed to solve challenging puzzles, without having to impose any restrictive assumptions on the shape of the puzzle, the shapes of the individual pieces, or their intrinsic arrangement. As a demonstration, the method was successfully used to solve two commercially available puzzles. Finally we perform some preliminary investigations into scalability of the algorithm for even larger puzzles.

Recently, a new ICT approach to agriculture called “Smart Agriculture” has been received great attention to support farmers' decision-making for good final yield on various kinds of field conditions. For this purpose, this paper presents two image sensing methods that enable an automatic observation to capture flowers and seedpods of soybeans in real fields. The developed image sensing methods are considered as sensors in an agricultural cyber-physical system in which big data on the growth status of agricultural plants and environmental information (e.g., weather, temperature, humidity, solar radiation, soil condition, etc.) are analyzed to mine useful rules for appropriate cultivation. The proposed image sensing methods are constructed by combining several image processing and machine learning techniques. The flower detection is realized based on a coarse-to-fine approach where candidate areas of flowers are first detected by SLIC and hue information, and the acceptance of flowers is decided by CNN. In the seedpod detection, candidates of seedpod regions are first detected by the Viola-Jones object detection method, and we also use CNN to make a final decision on the acceptance of detected seedpods. The performance of the proposed image sensing methods is evaluated for a data set of soybean images that were taken from a crowd of soybeans in real agricultural fields in Hokkaido, Japan.

.4 long standing problem in computer vision is the extraction of meaningfulfeatures from images. This paper describes a method of segmenting curves in images into a combination of circular arcs and straight lines. This uses a recursive algorithm that first analyses lists of connected edge points and finds a polygonal description, and then analyses this description fitting arcs to groups of connected lines. The result is a description of image edges consisting of circular arcs and lines. The algorithm uses no thresholding. Instead the best option is chosen at each decision stage.

In recent years, QR codes have found a wide range of applications in business and industry. Moreover, their popularity and function are still growing (fast). Therefore, the processing of the images of QR codes is an important task. In this paper, we try to solve a problem encountered in QR decoding when the QR code is printed near the binding edge inside a book or on the surface of a cylindrical container. When a picture is taken on such a QR code, the picture is no longer in a rectangular shape, which is supposedly the “right” shape that any QR code should take, due to warping from the image capturing mechanism by the camera. We refer to such warping as cylinder-to-screen (C2S) warping. This warping translates into serious distortion of the original QR-code image (also referred to as QR image, for short) and thus causes failure in its decoding. In this paper, a mathematical model called the parametric cylindrical surface model (PCSM) is proposed. Then, based on it, a scheme is proposed to rectify C2S-warped QR images. Experiments show that the proposed scheme is effective, in the sense that many failed QR decodings become successful after the rectification.

Barcode technology is the pillar of automatic identification, that is used in a wide range of real-time applications with various types of codes. The different types of codes and applications impose special problems, so there is a continuous need for solutions with improved effectiveness. There are several methods for barcode localization, that are well characterized by accuracy and speed. Particularly, high-speed processing places need automatic barcode localization, e.g. conveyor belts, automated production, where missed detections cause loss of profit. In this paper, we mainly deal with segmentation of images with 1D barcode, but also analyze the operation of different methods for 2D barcode images as well. Our goal is to detect automatically, rapidly and accurately the barcode location by the help of extracted features. We compare some published method from the literature, which basically rely on the contrast between the background and the shape that represent the code. We also propose a novel algorithm, that outperforms the others in both accuracy and efficiency in detecting 1D codes.

Pattern recognition is a tough problem for computers, although humans are wired for it. Pattern recognition is becoming increasingly important in the age of automation and information handling and retrieval. This paper reviews possible application areas of Pattern recognition. Author covers various sub-disciplines of pattern recognition based on learning methods, such as supervised, unsupervised, semi-supervised learning and key research areas such as grammar induction. Novel solutions to these possible problems could be well deployed for character recognition, speech analysis, man and machine diagnostics, person identification, industrial inspection and so on. The paper concludes with brief discussion on open issues that need to be addressed by future researchers.

Automatic methods for an early detection of plant diseases (i.e., visible symptoms at early stages of disease development) using remote sensing are critical for precision crop protection. Verticillium wilt (VW) of olive caused by Verticillium dahliae can be controlled only if detected at early stages of development. Linear discriminant analysis (LDA) and support vector machine (SVM) classification methods were applied to classify V. dahliae severity using remote sensing at large scale. High-resolution thermal and hyperspectral imagery were acquired with a manned platform which flew a 3000-ha commercial olive area. LDA reached an overall accuracy of 59.0% and a κ of 0.487 while SVM obtained a higher overall accuracy, 79.2% with a similar κ, 0.495. However, LDA better classified trees at initial and low severity levels, reaching accuracies of 71.4 and 75.0%, respectively, in comparison with the 14.3% and 40.6% obtained by SVM. Normalized canopy temperature, chlorophyll fluorescence, structural, xanthophyll, chlorophyll, carotenoid and disease indices were found to be the best indicators for early and advanced stage infection by VW. These results demonstrate that the methods developed in other studies at orchard scale are valid for flights in large areas comprising several olive orchards differing in soil and crop management characteristics.


Question: Automated defect identification in TFT-LCD array processes utilizing quasiconformal kernel support vector data description.

This paper explores the utilization of Support Vector Machines (SVMs) in the domain of computer vision, specifically focusing on face detection. SVMs, a learning technique pioneered by V. Vapnik and his team at AT&T Bell Labs, offer a novel approach to training classifiers such as polynomial, neural network, and Radial Basis Functions. The method involves solving a linearly constrained quadratic programming problem to determine the decision surfaces. However, this optimization task becomes increasingly complex as the size of the data set grows, due to the dense nature of the quadratic form. To address this challenge, a decomposition algorithm is proposed, which ensures global optimality and is capable of training SVMs on extensive data sets. The algorithm's strategy involves iteratively solving sub-problems and evaluating optimality conditions. These conditions not only facilitate the generation of improved iterative values but also serve as the stopping criteria for the algorithm. The efficacy of this approach is demonstrated through experimental results, showcasing its viability on a face detection problem that involved a substantial data set of 50,000 data points.

In a similar vein, the application of Support Vector Machines (SVMs) for the automatic detection of defects in Thin-Film Transistor Liquid Crystal Display (TFT-LCD) array processes is explored. SVMs, with their proven effectiveness in pattern recognition and classification tasks, are employed in a novel context to address the complexities of defect detection in TFT-LCD manufacturing. The SVMs are trained using a quasiconformal kernel, a specialized kernel function designed to enhance the model's ability to adapt to the non-linear and high-dimensional nature of defect data in TFT-LCD arrays. The optimization problem, akin to the one faced in face detection, is addressed through a decomposition algorithm that ensures scalability and efficiency in processing large datasets. The algorithm iteratively solves sub-problems while continuously assessing optimality conditions to refine the SVM model. The results of this method are evaluated on a dataset of TFT-LCD array defects, demonstrating its capability to accurately identify anomalies in the production process. This work highlights the versatility of SVMs in tackling real-world challenges across diverse domains, from computer vision to manufacturing quality control.

The detection of seizure activity in electroencephalogram (EEG) signals is crucial for the classification of epileptic seizures. However, epileptic seizures occur irregularly and unpredictably, automatic seizure detection in EEG recordings is highly required. In this work, we present a new technique for seizure classification of EEG signals using Hilbert–Huang transform (HHT) and support vector machine (SVM). In our method, the HHT based time-frequency representation (TFR) has been considered as time-frequency image (TFI), the segmentation of TFI has been implemented based on the frequency-bands of the rhythms of EEG signals, the histogram of grayscale sub-images has been represented. Statistical features such as ime-frequency image upport vector machine eizure classification mean, variance, skewness and kurtosis of pixel intensity in the histogram have been extracted. The SVM with radial basis function (RBF) kernel has been employed for classification of seizure and nonseizure EEG signals. The classification accuracy and receiver operating characteristics (ROC) curve have been used for evaluating the performance of the classifier. Experimental results show that the best average classification accuracy of this algorithm can reach 99.125% with the theta rhythm of EEG signals.

ÐThis paper describes a robust hierarchical algorithm for fully-automatic registration of a pair of images of the curved human retina photographed by a fundus microscope. Accurate registration is essential for mosaic synthesis, change detection, and design of computer-aided instrumentation. Central to the new algorithm is a 12-parameter interimage transformation derived by modeling the retina as a rigid quadratic surface with unknown parameters, imaged by an uncalibrated weak perspective camera. The parameters of this model are estimated by matching vascular landmarks extracted by an algorithm that recursively traces the blood vessel structure. The parameter estimation technique, which could be generalized to other applications, is a hierarchy of models and methods: an initial match set is pruned based on a zeroth order transformation estimated as the peak of a similarity-weighted histogram; a first order, affine transformation is estimated using the reduced match set and least-median of squares; and the final, second order, 12-parameter transformation is estimated using an M-estimator initialized from the first order estimate. This hierarchy makes the algorithm robust to unmatchable image features and mismatches between features caused by large interframe motions. Before final convergence of the M-estimator, feature positions are refined and the correspondence set is enhanced using normalized sum-of-squared differences matching of regions deformed by the emerging transformation. Experiments involving 3,000 image pairs (I; HPR Â I; HPR pixels) from 16 different healthy eyes were performed. Starting with as low as 20 percent overlap between images, the algorithm improves its success rate exponentially and has a negligible failure rate above 67 percent overlap. The experiments also quantify the reduction in errors as the model complexities increase. Final registration errors less than a pixel are routinely achieved. The speed, accuracy, and ability to handle small overlaps compare favorably with retinal image registration techniques published in the literature.

Producing agricultural products are difficult task as the plant comes to an attack from various micro-organisms, pests and bacterial diseases. The symptoms of the attacks are generally distinguished through the leaves, steams or fruit inspection. The present paper discusses the image processing techniques used in performing early detection of plant diseases through leaf features inspection. The objective of this work is to implement image analysis and classification techniques for extraction and classification of leaf diseases. Leaf image is captured and then processed to determine the status of each plant. Proposed framework is model into four parts image preprocessing including RGB to different color space conversion, image enhancement; segment the region of interest using K-mean clustering for statistical usage to determine the defect and severity areas of plant leaves, feature extraction and classification. texture feature extraction using statistical GLCM and color feature by means of mean values. Finally classification achieved using SVM. This technique will ensure that chemicals only applied when plant leaves are detected to be effected with the disease.

Bernhard Scholkopf" Max-Planck-Institut fur biologische Kybernetik , Spemannstr. 38 72076 Tubingen, Germany bs@mpik-tueb.mpg.de Support Vector Learning Machines (SVM) are finding application in pattern recognition , regression estimation , and operator inversion for ill-posed problems. Against this very general backdrop , any methods for improving the generalization performance, or for improving the speed in test phase, of SVMs are of increasing interest. In this paper we combine two such techniques on a pattern recognition problem. The method for improving generalization performance (the "virtual support vector" method) does so by incorporating known invariances of the problem. This method achieves a drop in the error rate on 10,000 NIST test digit images of 1.4% to 1.0%. The method for improving the speed (the "reduced set" method) does so by approximating the support vector decision surface. We apply this method to achieve a factor of fifty speedup in test phase over the virtual support vector machine. The combined approach yields a machine which is both 22 times faster than the original machine, and which has better generalization performance, achieving 1.1 % error. The virtual support vector method is applicable to any SVM problem with known invariances. The reduced set method is applicable to any support vector machine.

Background and objective: According to the World Health Organization (WHO) epilepsy affects approximately 45–50 million people. Electroencephalogram (EEG) records the neurological activity in the brain and it is used to identify epilepsy. Visual inspection of EEG signals is a time-consuming process and it may lead to human error. Feature extraction and classification are two main steps that are required to build an automated epilepsy detection framework. Feature extraction reduces the dimensions of the input signal by retaining informative features and the classifier assigns a proper class label to the extracted feature vector. Our aim is to present effective feature extraction techniques for automated epileptic EEG signal classification. Methods: In this study, two effective feature extraction techniques (Local Neighbor Descriptive Pattern [LNDP] and One-dimensional Local Gradient Pattern [1D-LGP]) have been introduced to classify epileptic EEG signals. The classification between epileptic seizure and non-seizure signals is performed using different machine learning classifiers. The benchmark epilepsy EEG dataset provided by the University of Bonn is used in this research. The classification performance is evaluated using 10-fold cross validation. The classifiers used are the Nearest Neighbor (NN), Support Vector Machine (SVM), Decision Tree (DT) and Artificial Neural Network (ANN). The experiments have been repeated for 50 times. Results: LNDP and 1D-LGP feature extraction techniques with ANN classifier achieved the average classification accuracy of 99.82% and 99.80%, respectively, for the classification between normal and epileptic EEG signals. Eight different experimental cases were tested. The classification results were better than those of some existing methods. Conclusions: This study suggests that LNDP and 1D-LGP could be effective feature extraction techniques for the classification of epileptic EEG signals. . Introduction Epilepsy is a central nervous system disorder and it has been eported that approximately 45–50 million people suffer from this isorder [1]. EEG captures the neurological activity inside the brain y placing electrodes on the scalp and helps in detection of epilepic seizure [2,3]. Epileptic seizure detection can be considered as classification problem where the task is to classify an input sigal either as an epileptic seizure signal or as a non-seizure signal. EG signals are usually recorded for long durations to carry out n analysis. Detection of epileptic seizure in these long duration EG signals requires expertise. In the absence of expert, particuarly in emergencies, seizure detection becomes a challenging task. herefore, providing a framework for automated epileptic seizure ∗ Corresponding author: E-mail address: abegiitdhanbad@gmail.com (A.K. Jaiswal). ttp://dx.doi.org/10.1016/j.bspc.2017.01.005 746-8094/© 2017 Elsevier Ltd. All rights reserved. © 2017 Elsevier Ltd. All rights reserved. detection is of great significance. A number of methods have been proposed in literature for the classification of epileptic EEG signals. The methods can be categorized into following domains of signal analysis: Time domain analysis: Some techniques in the field of epileptic EEG signal classification belong to this category. Techniques like linear prediction [4], Fractional linear prediction [5], Principal component analysis based radial basis function neural network [6], etc. have been proposed for epileptic seizure detection. Frequency domain analysis: With the assumption that the EEG signals are stationary signals, Polat and Gunes [7] introduced a hybrid framework based on frequency domain analysis with Fourier transform and decision tree. In the hybrid model, Fourier transform was used for feature extraction and decision tree was used for the classification. Srinivasan et al. [8] used features extracted from time domain and frequency domain for seizure detection in EEG signals. The extracted features were fed to the Elman neural network to detect epileptic seizure. 82 A.K. Jaiswal, H. Banka / Biomedical Signal Processing and Control 34 (2017) 81–92 0 50

Many studies shows that quality of agricultural products may be reduced from many causes. One of the most important factors contributing to low yield is disease attack. The plant disease such as fungi, bacteria and viruses. The leaf disease completely destroys the quality of the leaf. Common ground nut disease is cercospora. It is one of the type of disease in early stage of ground nut leaf. The upgraded processing pattern comprises of four leading steps. Initially a color renovation constitute intended for the input RGB image is formed, This RGB is converted into HSV because RGB is for Color generation and color descriptor. The next step is plane separation. Next performed the color features. Then using back propagation algorithm detection of leaf disease is done.

A method is presented for automated segmentation of vessels in two-dimensional color images of the retina. This method can be used in computer analyses of retinal images, e.g., in automated screening for diabetic retinopathy. The system is based on extraction of image ridges, which coincide approximately with vessel centerlines. The ridges are used to compose primitives in the form of line elements. With the line elements an image is partitioned into patches by assigning each image pixel to the closest line element. Every line element constitutes a local coordinate frame for its corresponding patch. For every pixel, feature vectors are computed that make use of properties of the patches and the line elements. The feature vectors are classified using a kNN-classifier and sequential forward feature selection. The algorithm was tested on a database consisting of 40 manually labeled images. The method achieves an area under the receiver operating characteristic curve of 0.952. The method is compared with two recently published rule-based methods of Hoover et al. and Jiang et al. . The results show that our method is significantly better than the two rule-based methods (p<0.01). The accuracy of our method is 0.944 versus 0.947 for a second observer.

In this paper, we propose an effective technique that is used to automatically detect fire in video images. The proposed algorithm is composed of four stages: (1) an adaptive Gaussian mixture model to detect moving regions, (2) a fuzzy c-means (FCM) algorithm to segment the candidate fire regions from these moving regions based on the color of fire, (3) special parameters extracted based on the tempospatial characteristics of fire regions, and (4) a support vector machine (SVM) algorithm using these special parameters to distinguish between fire and non-fire. Experimental results indicate that the proposed method outperforms other fire detection algorithms, providing high reliability and a low false alarm rate. & 2012 Elsevier Ltd. All rights reserved.

ÐThis paper presents a theoretically very simple, yet efficient, multiresolution approach to gray-scale and rotation invariant texture classification based on local binary patterns and nonparametric discrimination of sample and prototype distributions. The method is based on recognizing that certain local binary patterns, termed auniform,o are fundamental properties of local image texture and their occurrence histogram is proven to be a very powerful texture feature. We derive a generalized gray-scale and rotation invariant operator presentation that allows for detecting the auniformo patterns for any quantization of the angular space and for any spatial resolution and presents a method for combining multiple operators for multiresolution analysis. The proposed approach is very robust in terms of gray-scale variations since the operator is, by definition, invariant against any monotonic transformation of the gray scale. Another advantage is computational simplicity as the operator can be realized with a few operations in a small neighborhood and a lookup table. Excellent experimental results obtained in true problems of rotation invariance, where the classifier is trained at one particular rotation angle and tested with samples from other rotation angles, demonstrate that good discrimination can be achieved with the occurrence statistics of simple rotation invariant local binary patterns. These operators characterize the spatial configuration of local image texture and the performance can be further improved by combining them with rotation invariant variance measures that characterize the contrast of local image texture. The joint distributions of these orthogonal measures are shown to be very powerful tools for rotation invariant texture analysis. Index TermsÐNonparametric, texture analysis, Outex, Brodatz, distribution, histogram, contrast.

In this paper, we propose a support vector machine with automatic confidence (SVMAC) for pattern classification. The main contributions of this work to learning machines are twofold. One is that we develop an algorithm for calculating the label confidence value of each training sample. Thus, the label confidence values of all of the training samples can be considered in training support vector machines. The other one is that we propose a method for incorporating the label confidence value of each training sample into learning and derive the corresponding quadratic programming problems. To demonstrate the e ff ctiveness of the proposed SVMACs, a series of experiments are performed on three benchmarking pattern classification problems and a challenging gender classification problem. Experimental results show that the generalization performance of our SVMACs is superior to that of traditional SVMs.


Question: Automated defect detection in TFT-LCD array processes utilizing quasiconformal kernel support vector data description.

This paper explores the field of network intrusion detection, a critical strategy for enhancing security in computer systems and networks without compromising their operational openness. Intrusion detection aims to pinpoint unauthorized access, misuse, and abuse by both internal users and external attackers. With the proliferation of diverse and interconnected computer networks, the challenge of intrusion detection has intensified, as increased connectivity offers more entry points for intruders and complicates their identification. The underlying premise of intrusion detection systems (IDS) is that the behavior of intruders significantly diverges from that of legitimate users, and many unauthorized actions can be identified. IDSs typically utilize statistical anomaly detection and rule-based misuse detection models. Various experimental IDS prototypes have been developed and tested in real-world systems. This paper reviews both host-based and network-based IDSs, identifying key system characteristics. Host-based systems primarily rely on the audit trails generated by the host operating system to detect suspicious activity. Network-based IDSs, on the other hand, base their detection mechanisms on monitored network traffic, with some also incorporating host audit trails. The paper also provides an overview of a statistical anomaly detection algorithm commonly used in IDSs.

This paper describes a method for detecting and recognizing road signs in gray-level and color images acquired by a single camera mounted on a moving vehicle. The method works in three stages. First, the search for the road sign is reduced to a suitable region of the image by using some a priori knowledge on the scene or color clues (when available). Secondly, a geometrical analysis of the edges extracted from the image is carried out, which generates candidates to be circular and triangular signs. Thirdly, a recognition stage tests by cross-correlation techniques each candidate which, if validated, is classi ed according to the data-base of signs. An extensive experimentation has shown that the method is robust against low-level noise corrupting edge detection and contour following, and works for images of cluttered urban streets as well as country roads and highways. A further improvement on the detection and recognition scheme has been obtained by means of temporal integration based on Kalman ltering methods of the extracted information. The proposed approach can be very helpful for the development of a system for driving assistance.

Paddy being the staple food of India is majorly affected by deficiency of primary nutrient elements like nitrogen, phosphorus and potassium. Leaves can be deficient with multiple nutrient elements at a same time. This can alter natural color of paddy leaves. Such leaves are considered as defective. The proposed work is to automate multiple nutrient element deficiency identification of paddy leaves. Pattern analysis RGB color features are extracted to identify defective paddy leaves. Firstly the database of healthy, nitrogen, phosphorus and potassium defected paddy leaves are created. For any test image effective comparison at different levels are employed such as multiple color comparison, multiple pattern comparison and combination of color and patterns comparison, so that defectiveness is accurately identified for combination of deficiency such as nitrogen-phosphorus(NP), nitrogen-potassium(NK) and phosphorous-potassium (KP).

In this paper, we implement machine learning algorithms to automatically quantify knee osteoarthritis severity from X-ray images according to the Kellgren & Lawrence (KL) grades. We implement and evaluate the performance of various machine learning models like transfer learning, support vector machines and fully connected neural networks based on their classification accuracy. We also implement the task of automatically extracting the knee-joint region from the X-ray images and quantifying their severity by training a faster region convolutional neural network (R-CNN).

Traditional Support Vector Domain Description (SVDD) and some improved SVDD algorithms are suboptimal in detecting some complex outliers. To solve the difficulty, we proposed a novel adaptive weighted SVDD (AW-SVDD) algorithm. Firstly, a weighting is computed for each data point based on their spatial position distribution and density distribution in a training dataset. The weighting can be used to measure the degree of the data point to be an outlier. Then the weighted data are trained by traditional SVDD. Lastly, a sphere shaped data description can be obtained for the training data. Experimental results demonstrate that AW-SVDD can overcome the interference from some complex outliers objectively, therefore the algorithm has a better performance than traditional SVDD and other improved SVDD algorithms.

We present our studies on small-sized pixel structures for high-resolution CMOS image sensors. To minimize the number of pixel components, single-transistor pixel and 2T pixel architecture were proposed. To deal with crosstalk between pixels, MOS capacitor deep trench isolation (CDTI) was integrated. CDTI-integrated pixel allows better achievements in dark current and full-well capacity in comparison with the configuration integrating oxide-filled deep trench isolation (DTI). To improve quantum efficiency (QE) and minimize optical crosstalk, back-side illumination (BSI) was developed. Also, vertical photodiode was proposed to maximize its charge-collection region. To take advantages of these structures/technologies, we developed two pixel options (P-type and N-type) combining CDTI or DTI, BSI and vertical photodiode. All the presented pixel structures were designed in 1.4µm-pitch sensor arrays, fabricated and tested.

When a PDF417 barcode are recognized, there are major recognition processes such as segmentation, normalization, and decoding. Among them, the segmentation and normalization steps are very important because they have a strong influence on the rate of barcode recognition. There are also previous segmentation and normalization techniques of processing barcode image, but some issues as follows. First, the previous normalization techniques need an additional restoration process and apply an interpolation process. Second, the previous recognition algorithms recognize a barcode image well only when it is placed in the predefined rectangular area. Therefore, we propose a novel segmentation and normalization method in PDF417 with the aims of improving its recognition rate and precision. The segmentation process to detect the barcode area in an image uses the conventional morphology and Hough transformmethods. The normalization process of the bar code region is based on the conventional perspective transformation and warping algorithms. In addition, we perform experiments using both experimental and actual data for evaluating our algorithms. Consequently, our experimental results can be summarized as follows. First, our method showed a stable performance over existing PDF417 barcode detection and recognition. Second, it overcame the limitation problem where the location of an input image should locate in a predefined rectangle area. Finally, it is expected that our result can be used as a restoration tool of printed images such as documents and pictures.

One of the most critical problems for machine learning methods is overfitting. The overfitting problem is a phenomenon in which the accuracy of the model on unseen data is poor whereas the training accuracy is nearly perfect. This problem is particularly severe in complex models that have a large set of parameters. In this paper, we propose a deep learning neural network model that adopts the support vector data description (SVDD). The SVDD is a variant of the support vector machine, which has high generalization performance by acquiring a maximal margin in one-class classification problems. The proposed model strives to obtain the representational power of deep learning. Generalization performance is maintained using the SVDD. The experimental results showed that the proposed model can learn multiclass data without severe overfitting problems.

A general-purpose, fully interconnected neural-net chip was used to perform computationally intensive tasks for handwritten digit recognition. The chip has nearly 3000 programmable connections, which can be set for template matching. The templates can be reprogrammed as needed during the recognition sequence. The recognition process proceeds in four major steps. First, the image is captured using a TV camera and a digital framegrab. This image is converted, using a digital computer, to either black or white pixels and scaled to fill a 16*16-pixel frame. Next, using the neural-net chip, the image is skeletonized, i.e. the image is thinned to a backbone one pixel wide. Then, the chip is programmed, and a feature map is created by template-matching stored primitive patterns on the chip with regions on the skeletonized image. Finally, recognition, based on the feature map, is achieved using any one of a variety of statistical and heuristic techniques on a digital computer. Best scores range between 90% and 99% correct classification, depending on the quality of the original handwritten digits.<<ETX>>

Texture is one of the important characteristics used in identifying objects or regions of interest in an image, whether the image be a photomicrograph, an aerial photograph, or a satellite image. This paper describes some easily computable textural features based on graytone spatial dependancies, and illustrates their application in categoryidentification tasks of three different kinds of image data: photomicrographs of five kinds of sandstones, 1:20 000 panchromatic aerial photographs of eight land-use categories, and Earth Resources Technology Satellite (ERTS) multispecial imagery containing seven land-use categories. We use two kinds of decision rules: one for which the decision regions are convex polyhedra (a piecewise linear decision rule), and one for which the decision regions are rectangular parallelpipeds (a min-max decision rule). In each experiment the data set was divided into two parts, a training set and a test set. Test set identification accuracy is 89 percent for the photomicrographs, 82 percent for the aerial photographic imagery, and 83 percent for the satellite imagery. These results indicate that the easily computable textural features probably have a general applicability for a wide variety of image-classification applications.

Detection of glaucoma eye disease is still a challenging task for computer-aided diagnostics (CADx) systems. During eye screening process, the ophthalmologists measures the glaucoma by structure changes in optic disc (OD), loss of nerve fibres (LNF) and atrophy of the peripapillary region (APR). In retinal images, the automated CADx systems are developed to assess this eye disease through segmentation-based hand-crafted features. Therefore in this paper, the convolutional neural network (CNN) unsupervised architecture was used to extract the features through multilayer from raw pixel intensities. Afterwards, the deep-belief network (DBN) model was used to select the most discriminative deep features based on the annotated training dataset. At last, the final decision is performed by softmax linear classifier to differentiate between glaucoma and non-glaucoma retinal fundus image. This proposed system is known as Glaucoma-Deep and tested on 1200 retinal images obtained from publically and privately available datasets. To evaluate the performance of Glaucoma-Deep system, the sensitivity (SE), specificity (SP), accuracy (ACC), and precision (PRC) statistical measures were utilized. On average, the SE of 84.50%, SP of 98.01%, ACC of 99% and PRC of 84% values were achieved. Comparing to state-of-the-art systems, the Nodular-Deep system accomplished significant higher results. Consequently, the Glaucoma-Deep system can easily recognize the glaucoma eye disease to solve the problem of clinical experts during eye-screening process on large-scale environments. Keywords—Fundus imaging; glaucoma; diabetic retinopathy; deep learning; convolutional neural networks; deep belief network


Question: Automated defect identification in TFT-LCD array processes utilizing quasiconformal kernel support vector data description.

This study conducts a comprehensive evaluation of various classifier algorithms applied to a widely recognized database of handwritten digits. The analysis goes beyond mere accuracy, delving into aspects such as the system's ability to reject unrecognized inputs, the duration required for training, the time taken for recognition, and the memory consumption associated with each algorithm. By considering these additional factors, the study aims to provide a holistic comparison, offering insights into the practical implications and trade-offs of different learning algorithms in the context of handwritten digit recognition.

This paper presents a survey on CMOS Image Sensors (CIS) based on active Pixel Sensors (APS). Due to its properties, the APS is used in low voltage, low power and its applications in portable imaging systems such as disposable cameras and on-chip autonomous security cameras are random access, faster readout and low noise with peripheral circuitry.

An admissible support vector (SV) kernel (the wavelet kernel), by which we can construct a wavelet support vector machine (SVM), is presented. The wavelet kernel is a kind of multidimensional wavelet function that can approximate arbitrary nonlinear functions. The existence of wavelet kernels is proven by results of theoretic analysis. Computer simulations show the feasibility and validity of wavelet support vector machines (WSVMs) in regression and pattern recognition.

Model-based recognition and motion tracking depends upon the ability to solve for projection and model parameters that will best fit a 3-D model to matching 2-D image features. This paper extends current methods of parameter solving to handle objects with arbitrary curved surfaces and with any number of internal parameters representing articulations, variable dimensions, or surface deformations. Numerical stabilization methods are developed that take account of inherent inaccuracies in the image measurements and allow useful solutions to be determined even when there are fewer matches than unknown parameters. The LevenbergMarquardt method is used to always ensure convergence of the solution. These techniques allow model-based vision to be used for a much wider class of problems than was possible with previous methods. Their application is demonstrated for tracking the motion of curved, parameterized objects. This paper has been published in IEEE Transactions on Pattern Analysis and Machine Intelligence, 13, 5 (May 1991), pp. 441–450.

This paper presents a comprehensive test of the principal tasks in document image analysis (DIA), starting with binarization, text line segmentation, and isolated character/glyph recognition, and continuing on to word recognition and transliteration for a new and challenging collection of palm leaf manuscripts from Southeast Asia. This research presents and is performed on a complete dataset collection of Southeast Asian palm leaf manuscripts. It contains three different scripts: Khmer script from Cambodia, and Balinese script and Sundanese script from Indonesia. The binarization task is evaluated on many methods up to the latest in some binarization competitions. The seam carving method is evaluated for the text line segmentation task, compared to a recently new text line segmentation method for palm leaf manuscripts. For the isolated character/glyph recognition task, the evaluation is reported from the handcrafted feature extraction method, the neural network with unsupervised learning feature, and the Convolutional Neural Network (CNN) based method. Finally, the Recurrent Neural Network-Long Short-Term Memory (RNN-LSTM) based method is used to analyze the word recognition and transliteration task for the palm leaf manuscripts. The results from all experiments provide the latest findings and a quantitative benchmark for palm leaf manuscripts analysis for researchers in the DIA community.

Numerical simulations are used to study the electromagnetic scattering from phase agile microstrip reflectarray cells which exploit the voltage controlled dielectric anisotropy property of nematic state liquid crystals (LCs). In the computer model two arrays of equal size elements constructed on a 15 mum thick tuneable LC layer were designed to operate at center frequencies of 102 GHz and 130 GHz. Micromachining processes based on the metallization of quartz/silicon wafers and an industry compatible LCD packaging technique were employed to fabricate the grounded periodic structures. The loss and the phase of the reflected signals were measured using a quasi-optical test bench with the reflectarray inserted at the beam waist of the imaged Gaussian beam, thus eliminating some of the major problems associated with traditional free-space characterization at these frequencies. By applying a low frequency AC bias voltage of 10 V, a 165deg phase shift with a loss 4.5-6.4 dB at 102 GHz and 130deg phase shift with a loss variation between 4.3-7 dB at 130 GHz was obtained. The experimental results are shown to be in close agreement with the computer model.

A new current-programming pixel circuit for active-matrix organic light-emitting diode (AM-OLED) displays, composed of four organic thin-film transistors (OTFTs) and one capacitor, has been designed, simulated and evaluated. The most critical issue in realizing AMOLED displays with OTFTs is the variation and aging of the driving-TFTs and degradation of OLEDs. This can cause image sticking or degradation of image quality. These problems require compensation methods for high-quality display applications, and pixel level approach is considered to be one of the most important factors for improving display image quality. Our design shows that the current OLED and OTFT technology can be implemented for AMOLED displays, compensating the degradation of OTFT device characteristics.

Producing agricultural products are difficult task as the plant comes to an attack from various micro-organisms, pests and bacterial diseases. The symptoms of the attacks are generally distinguished through the leaves, steams or fruit inspection. The present paper discusses the image processing techniques used in performing early detection of plant diseases through leaf features inspection. The objective of this work is to implement image analysis and classification techniques for extraction and classification of leaf diseases. Leaf image is captured and then processed to determine the status of each plant. Proposed framework is model into four parts image preprocessing including RGB to different color space conversion, image enhancement; segment the region of interest using K-mean clustering for statistical usage to determine the defect and severity areas of plant leaves, feature extraction and classification. texture feature extraction using statistical GLCM and color feature by means of mean values. Finally classification achieved using SVM. This technique will ensure that chemicals only applied when plant leaves are detected to be effected with the disease.

Data Matrix codes belong to the group of 2-D bar codes, which are widely used in marking the products in storing, production, distribution and sales processes. Their compact matrix structure enables to store big amount of information in a very small area compared to conventional 1-D bar codes. In following paper we compare several methods for detection of Data Matrix codes in images. When locating the position of the code we start from typical bordering of Data Matrix code — which forms “L” so called Finder Pattern and to it the parallel dotting so called Timing Pattern. On the first stage we try to locate Finder Pattern using the edge detection or adaptive thresholding, then continuing with connecting the points into the continuous regions, we are searching for the regions, which could represent the Finder Pattern. On the second stage we verify Timing Pattern where the number of crossing between the background and foreground must be even.

This is the first in a pair of papers in which we present image-processing-based procedures for the measurement of fluvial gravels. The spatial and temporal resolution of surface grain-size characterization is constrained by the time-consuming and costly nature of traditional measurement techniques. Several groups have developed image-processing-based procedures, but none have demonstrated the transferability of these techniques between sites with different lithological, clast form and textural characteristics. Here we focus on image-processing procedures for identifying and measuring image objects (i.e. grains); the second paper examines the application of such procedures to the measurement of fluvially deposited gravels. Four image-segmentation procedures are developed, each having several internal parameters, giving a total of 416 permutations. These are executed on 39 images from three field sites at which the clasts have contrasting physical properties. The performance of each procedure is evaluated against a sample of manually digitized grains in the same images, by comparing three derived statistics. The results demonstrate that it is relatively straightforward to develop procedures that satisfactorily identify objects in any single image or a set of images with similar sedimentary characteristics. However, the optimal procedure is that which gives consistently good results across sites with dissimilar sedimentary characteristics. We show that neighborhood-based operations are the most powerful, and a morphological bottom-hat transform with a double threshold is optimal. It is demonstrated that its performance approaches that of the procedures giving the best results for individual sites. Overall, it out-performs previously published, or improvements to previously published, methods.

We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning transform, typically a regularized thin plate spline, resulting in a dense correspondence between the two shapes. Object recognition is then handled in a nearest neighbor framework where the distance between exemplar and query is the matching cost between corresponding points. We show results on two datasets. One is the Caltech 101 dataset (Fei-Fei, Fergus and Perona), an extremely challenging dataset with large intraclass variation. Our approach yields a 48% correct classification rate, compared to Fei-Fei et al 's 16%. We also show results for localizing frontal and profile faces that are comparable to special purpose approaches tuned to faces.


Question: An automated defect detection system for TFT-LCD array processing utilizing quasiconformal kernel support vector data description.

This paper delves into the realm of efficient progressive sampling, addressing the challenge that having vast datasets does not inherently necessitate their complete utilization by induction algorithms. Instead, carefully selected samples can often yield comparable accuracy at a fraction of the computational cost. The key question revolves around determining the optimal sample size, which is not always apparent. We investigate methodologies for progressive sampling, employing incrementally larger samples until no further improvements in model accuracy are observed. Our exploration encompasses various facets of efficient progressive sampling. We evaluate efficiency in relation to induction algorithms that utilize all available instances, demonstrating that a straightforward geometric sampling schedule is asymptotically optimal. Additionally, we elucidate how to effectively incorporate prior expectations of accuracy convergence into the sampling process. The paper also tackles the practical considerations involved in implementing an efficient progressive sampling strategy, including the critical aspect of detecting convergence. We present empirical findings that compare a multitude of progressive sampling techniques, concluding that progressive sampling can indeed achieve exceptional efficiency.

In the context of automatic defect detection for TFT-LCD array processes, the application of efficient progressive sampling strategies can significantly enhance the detection algorithms' performance. By progressively increasing the sample size used for training until no additional benefits are observed, the computational resources can be optimized while maintaining high detection accuracy. This approach is particularly relevant in scenarios where large datasets are available but processing them in their entirety would be computationally prohibitive. The optimal sampling schedule, as demonstrated in our analysis, can guide the selection of sample sizes that strike a balance between computational efficiency and model accuracy. Incorporating prior knowledge about the expected convergence of accuracy can further refine the sampling strategy, ensuring that the algorithm is finely tuned to the specific characteristics of the TFT-LCD array process. Empirical evidence supports the efficacy of progressive sampling in this domain, underscoring its potential to revolutionize automatic defect detection in TFT-LCD manufacturing.

This paper presents design considerations along with measurement results pertinent to hydrogenated amorphous silicon (a-Si:H) thin film transistor (TFT) drive circuits for active matrix organic light emitting diode (AMOLED) displays. We describe both pixel architectures and TFT circuit topologies that are amenable for vertically integrated, high aperture ratio pixels. Here, the OLED layer is integrated directly above the TFT circuit layer, to provide an active pixel area that is at least 90% of the total pixel area with an aperture ratio that remains virtually independent of scaling. Both voltage-programmed and current-programmed drive circuits are considered. The latter provides compensation for shifts in device characteristics due to metastable shifts in the threshold voltage of the TFT. Various drive circuits on glass and plastic were fabricated and tested. Integration of on-panel gate drivers is also discussed where we present the architecture of an a-Si:H based gate de-multiplexer that is threshold voltage shift invariant. In addition, a programmable current mirror with good linearity and stability is presented. Programmable current sources are an essential requirement in the design of source driver output stages.

One of the objectives of precision agriculture is to minimize the volume of herbicides that are applied to the fields through the use of site-specific weed management systems. This paper outlines an automatic computer vision-based approach for the detection and differential spraying of weeds in corn crops. The method is designed for post-emergence herbicide applications where weeds and corn plants display similar spectral signatures and the weeds appear irregularly distributed within the crop’s field. The proposed strategy involves two processes: image segmentation and decision making. Image segmentation combines basic suitable image processing techniques in order to extract cells from the image as the low level units. Each cell is described by two area-based measuring relationships between crop and weeds. The decision making determines the cells to be sprayed based on the computation of a posterior probability under a Bayesian framework. The a priori probability in this framework is computed taking into account the dynamic of the physical system (tractor) where the method is embedded. The main contributions of this paper are: (1) the combination of the image segmentation and decision making processes and (2) the decision making itself which exploits a previous knowledge which is mapped as the a priori probability. The performance of the method is illustrated by comparative analysis against some existing strategies. 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

One of the most critical problems for machine learning methods is overfitting. The overfitting problem is a phenomenon in which the accuracy of the model on unseen data is poor whereas the training accuracy is nearly perfect. This problem is particularly severe in complex models that have a large set of parameters. In this paper, we propose a deep learning neural network model that adopts the support vector data description (SVDD). The SVDD is a variant of the support vector machine, which has high generalization performance by acquiring a maximal margin in one-class classification problems. The proposed model strives to obtain the representational power of deep learning. Generalization performance is maintained using the SVDD. The experimental results showed that the proposed model can learn multiclass data without severe overfitting problems.

In this paper, we propose a new approach that we call the ldquofluid vector flowrdquo (FVF) active contour model to address problems of insufficient capture range and poor convergence for concavities. With the ability to capture a large range and extract concave shapes, FVF demonstrates improvements over techniques like gradient vector flow, boundary vector flow, and magnetostatic active contour on three sets of experiments: synthetic images, pediatric head MRI images, and brain tumor MRI images from the Internet brain segmentation repository.

Text displayed in a video is an essential part for the high-level semantic information of the video content. Therefore, video text can be used as a valuable source for automated video indexing in digital video libraries. In this paper, we propose a workflow for video text detection and recognition. In the text detection stage, we have developed a fast localization-verification scheme, in which an edge-based multi-scale text detector first identifies potential text candidates with high recall rate. Then, detected candidate text lines are refined by using an image entropy-based filter. Finally, Stroke Width Transform (SWT)- and Support Vector Machine (SVM)-based verification procedures are applied to eliminate the false alarms. For text recognition, we have developed a novel skeleton-based binarization method in order to separate text from complex backgrounds to make it processible for standard OCR (Optical Character Recognition) software. Operability and accuracy of proposed text detection and binarization methods have been evaluated by using publicly available test data sets.

This paper presents an e cient shape-based object detection method based on Distance Transforms and describes its use for real-time vision on-board vehicles. The method uses a template hierarchy to capture the variety of object shapes; e cient hierarchies can be generated o ine for given shape distributions using stochastic optimization techniques (i.e. simulated annealing). Online, matching involves a simultaneous coarse-tone approach over the shape hierarchy and over the transformation parameters. Very large speedup factors are typically obtained when comparing this approach with the equivalent brute-force formulation; we have measured gains of several orders of magnitudes. We present experimental results on the real-time detection of tra c signs and pedestrians from a moving vehicle. Because of the highly time sensitive nature of these vision tasks, we also discuss some hardwarespeci c implementations of the proposed method as far as SIMD parallelism is concerned.

When a PDF417 barcode are recognized, there are major recognition processes such as segmentation, normalization, and decoding. Among them, the segmentation and normalization steps are very important because they have a strong influence on the rate of barcode recognition. There are also previous segmentation and normalization techniques of processing barcode image, but some issues as follows. First, the previous normalization techniques need an additional restoration process and apply an interpolation process. Second, the previous recognition algorithms recognize a barcode image well only when it is placed in the predefined rectangular area. Therefore, we propose a novel segmentation and normalization method in PDF417 with the aims of improving its recognition rate and precision. The segmentation process to detect the barcode area in an image uses the conventional morphology and Hough transformmethods. The normalization process of the bar code region is based on the conventional perspective transformation and warping algorithms. In addition, we perform experiments using both experimental and actual data for evaluating our algorithms. Consequently, our experimental results can be summarized as follows. First, our method showed a stable performance over existing PDF417 barcode detection and recognition. Second, it overcame the limitation problem where the location of an input image should locate in a predefined rectangle area. Finally, it is expected that our result can be used as a restoration tool of printed images such as documents and pictures.

medical fields has led to the automated processing ofpictorial data. Here, a device called the cytocomputer searches for genetic mutations. A computer revolution has occurred not only in technical fields but also in medicine, where vast amounts of information must be processed quickly and accurately. Nowhere is the need for image processing techniques more apparent than in clinical diagnosis or mass screening applications where data take the form of digital images. New high-resolution scanning techniques such as computed tomography, nuclear magnetic resonance, po-sitron emission tomography, and digital radiography produce images containing immense amounts of relevant information for medical analysis. But as these scanning techniques become more vital to clinical diagnosis, the work for specialists who must visually examine the resultant images increases. In many cases, quantitative data in the form of measurements and counts are needed to supplement nonimage patient data, and the manual extraction of these data is a time-consuming and costly step in an otherwise automated process. Furthermore, subtle variants of shade and shape can be the earliest clues to a diagnosis, placing the additional burden of complete thoroughness on the examining specialist. For the last five years, the University of Michigan and the Environmental Research Institute of Michigan have conducted a unique series of studies that involve the processing of biomedical imagery on a highly parallel computer specifically designed for image processing. System designers have incorporated the requirements of extracting a verifiable answer from an image in a reasonable time into an integrated approach to hardware and software design. The system includes a parallel pipelined image processor, called a cytocomputer, and a high-level language specifically created for image processing, C-3PL, the cytocomputer parallel picture processing language. These studies have involved a great many people from both the medical and engineering communities and have highlighted the interdisciplinary aspects of biomedical image processing. The methods have been tested in anatomy, developmental biology, nuclear medicine, car-diology, and transplant rejection. The general consensus is that quantification by automated image analysis not only increases diagnostic accuracy but also provides significant data not obtainable from qualitative analysis alone. One study in particular, on which descriptions in this article are based, involves a joint effort by the University of Michigan's human genetics and electrical and computer engineering departments and is supported by a grant from the National Cancer Institute. Basically, automated image analysis is being applied via sophisticated biochemical and computer techniques to derive …

This paper presents a technique for automatically detecting human faces in digital color images. This is two-step process which first detects regions contain human skin in the color image and then extracts information from these regions which might indicate the location of a face in the image. The skin detection is performed using a skin filter which relies on color and texture information. The face detection is performed on a grayscale image containing only the detected skin areas. A combination of thresh holding and mathematical morphology are used to extract object features that would indicate the presence of a face. The face detection process works predictably and fairly reliably, as test results show.

The Hough transformation can detect straight lines in an edge-enhanced picture, however its extension to recover ellipses requires too long a computing time. This correspondence proposes a modified method which utilizes two properties of an ellipse in such a way that it iteratively searches for clusters in two different parameter spaces to find almost complete ellipses, then evaluates their parameters by the least mean squares method.