28 resultados para Script Identification, Wavelets and Fractals, Texture, Document Analysis, Clustering, Classification and Association Rules
Resumo:
In this paper the approach for automatic road extraction for an urban region using structural, spectral and geometric characteristics of roads has been presented. Roads have been extracted based on two levels: Pre-processing and road extraction methods. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, parking lots, vegetation regions and other open spaces). The road segments are then extracted using Texture Progressive Analysis (TPA) and Normalized cut algorithm. The TPA technique uses binary segmentation based on three levels of texture statistical evaluation to extract road segments where as, Normalizedcut method for road extraction is a graph based method that generates optimal partition of road segments. The performance evaluation (quality measures) for road extraction using TPA and normalized cut method is compared. Thus the experimental result show that normalized cut method is efficient in extracting road segments in urban region from high resolution satellite image.
Resumo:
This paper presents a new approach to the location of fault in the high voltage power transmission system using Support Vector Machines (SVMs). A knowledge base is developed using transient stability studies for apparent impedance swing trajectory in the R-X plane. SVM technique is applied to identify the fault location in the system. Results are presented on sample 3-power station, a 9-bus system illustrate the implementation of the proposed method.
Resumo:
A comparatively simple and rapid method for the identification, estimation and preparation of fatty acids has been developed, using reversed phase circular paper chromatography. The method is also suitable for the analysis of “Critical Pairs” of fatty acids and for the preparation of fatty acids. Further, when used at a higher temperature, the method is more sensitive in revealing the presence of even traces of higher fatty acids in the seeds of Adenanthera pavonina.
Resumo:
A practical method is proposed to identify the mode associated with the frequency part of the eigenvalue of the Floquet transition matrix (FTM). From the FTM eigenvector, which contains the states and their derivatives, the ratio of the derivative and the state corresponding to the largest component is computed. The method exploits the fact that the imaginary part of this (complex) ratio closely approximates the frequency of the mode. It also lends itself well to automation and has been tested over a large number of FTMs of order as high as 250.
Resumo:
Two vitellins, VtA and VtB, were purified from the eggs of Dysdercus koenigii by gel filtration and ion exchange chromatography. VtA and VtB have molecular weights of 290 and 260 kDa, respectively. Both Vts are glycolipoproteinaceous in nature. VtA is composed of three polypeptides of M-r 116, 92 and 62 kDa while VtB contained an additional subunit of M-r 40 kDa. All subunits except the 116-kDa subunit are glycolipopolypeptides. Polyclonal antibody raised against VtA (anti-VtA antibody) cross-reacted with VtB and also with vitellogenic haemolymph and ovaries and pre-vitellogenic fat bodies, but not with haemolymph from either adult male, fifth instar female, or pre-vitellogenic females demonstrating sex and stage specificity of the Vts. Immunoblots in the presence of anti-VtA revealed two proteins (of 290 and 260 kDa) in both vitellogenic haemolymph and pre-vitellogenic fat bodies that are recognised as D. koenigii Vgs. In newly emerged females, Vgs appeared on day 1 in fat bodies and on day 3 in haemolymph and ovaries. Vg concentration was maximum on day 2 in fat body, day 4 in haemolymph and day 7 in ovary. Although the biochemical and temporal characteristics of these proteins show similarity to some hemipterans, they are strikingly dissimilar with those of a very closely related species. (C) 1999 Elsevier Science Inc. All rights reserved.
Resumo:
he paper presents, in three parts, a new approach to improve the detection and tracking performance of a track-while-scan (TWS) radar. Part 1 presents a review of current status. In this part, Part 2, it is shown how the detection can be improved by utilising information from tracker. A new multitarget tracking algorithm, capable of tracking manoeuvring targets in clutter, is then presented. The algorithm is specifically tailored so that the solution to the combinatorial problem presented in a companion paper can be applied. The implementation aspects are discussed and a multiprocessor architecture identified to realise the full potential of the algorithm. Part 3 presents analytical derivations for quantitative assessment of the performance of the TWS radar system. It also shows how the performance can be optimised.
Resumo:
The 15-residue apolar peptide, Boc-Val-Ala-Leu-Aib-Val-Ala-Leu-(Val-Ala-Leu-Aib)h2a-sO Mebeen crystallized from 2-propanol-water (form I). The crystal parameters for I are as follows:C74H133N15018*2H20s,p ace group P21, a = 9.185 (6) A, b = 47.410 (3) A, c = 10.325 (9) A, @ = 91.47(2)O, 2 = 2, R = 6.3% for 4532 reflections observed >3aQ, resolution 0.94 A. The structure isalmost completely a-helical with eleven 5-1 hydrogen bonds and one 441 hydrogen bond nearthe N-terminus. The structure has been compared with a polymorph (form 11) obtained frommethanol-water (Karle, I. L.; Flippen-Anderson, J. L.; Uma, K.; Sukumar, M.; Balaram, P., J. An.Chem. SOC19. 90,112,9350-9356). The two forms differ in the extent of hydration; form I contains two water molecules in the head-to-tail region of helical columns, while form I1 is more extensively solvated, with the equivalent of 7.5 water molecules. The three-dimensional packing of helices is completely parallel in I and antiparallel in 11.
Resumo:
We examine the deflected mirage mediation supersymmetry breaking (DMMSB) scenario, which combines three supersymmetry breaking scenarios, namely anomaly mediation, gravity mediation and gauge mediation using the one-loop renormalization group invariants (RGIs). We examine the effects on the RGIs at the threshold where the gauge messengers emerge, and derive the supersymmetry breaking parameters in terms of the RGIs. We further discuss whether the supersymmetry breaking mediation mechanism can be determined using a limited set of invariants, and derive sum rules valid for DMMSB below the gauge messenger scale. In addition we examine the implications of the measured Higgs mass for the DMMSB spectrum.
Resumo:
We report a hierarchical blind script identifier for 11 different Indian scripts. An initial grouping of the 11 scripts is accomplished at the first level of this hierarchy. At the subsequent level, we recognize the script in each group. The various nodes of this tree use different feature-classifier combinations. A database of 20,000 words of different font styles and sizes is collected and used for each script. Effectiveness of Gabor and Discrete Cosine Transform features has been independently, evaluated using nearest neighbor linear discriminant and support vector machine classifiers. The minimum and maximum accuracies obtained, using this hierarchical mechanism, are 92.2% and 97.6%, respectively.
Resumo:
We present a fractal coding method to recognize online handwritten Tamil characters and propose a novel technique to increase the efficiency in terms of time while coding and decoding. This technique exploits the redundancy in data, thereby achieving better compression and usage of lesser memory. It also reduces the encoding time and causes little distortion during reconstruction. Experiments have been conducted to use these fractal codes to classify the online handwritten Tamil characters from the IWFHR 2006 competition dataset. In one approach, we use fractal coding and decoding process. A recognition accuracy of 90% has been achieved by using DTW for distortion evaluation during classification and encoding processes as compared to 78% using nearest neighbor classifier. In other experiments, we use the fractal code, fractal dimensions and features derived from fractal codes as features in separate classifiers. While the fractal code is successful as a feature, the other two features are not able to capture the wide within-class variations.
Resumo:
This paper describes a semi-automatic tool for annotation of multi-script text from natural scene images. To our knowledge, this is the maiden tool that deals with multi-script text or arbitrary orientation. The procedure involves manual seed selection followed by a region growing process to segment each word present in the image. The threshold for region growing can be varied by the user so as to ensure pixel-accurate character segmentation. The text present in the image is tagged word-by-word. A virtual keyboard interface has also been designed for entering the ground truth in ten Indic scripts, besides English. The keyboard interface can easily be generated for any script, thereby expanding the scope of the toolkit. Optionally, each segmented word can further be labeled into its constituent characters/symbols. Polygonal masks are used to split or merge the segmented words into valid characters/symbols. The ground truth is represented by a pixel-level segmented image and a '.txt' file that contains information about the number of words in the image, word bounding boxes, script and ground truth Unicode. The toolkit, developed using MATLAB, can be used to generate ground truth and annotation for any generic document image. Thus, it is useful for researchers in the document image processing community for evaluating the performance of document analysis and recognition techniques. The multi-script annotation toolokit (MAST) is available for free download.
Resumo:
We propose a robust method for mosaicing of document images using features derived from connected components. Each connected component is described using the Angular Radial Tran. form (ART). To ensure geometric consistency during feature matching, the ART coefficients of a connected component are augmented with those of its two nearest neighbors. The proposed method addresses two critical issues often encountered in correspondence matching: (i) The stability of features and (ii) Robustness against false matches due to the multiple instances of characters in a document image. The use of connected components guarantees a stable localization across images. The augmented features ensure a successful correspondence matching even in the presence of multiple similar regions within the page. We illustrate the effectiveness of the proposed method on camera captured document images exhibiting large variations in viewpoint, illumination and scale.
Resumo:
The morbilliviruses which infect ruminants, rinderpest (RPV) and peste des petits ruminants (PPRV), are difficult to distinguish serologically. They can be distinguished by differential neutralisation tests and by the migration of the major virus structural protein, the nucleocapsid protein, on polyacrylamide gels. Both these methods are time consuming and require the isolation of live virus for identification; they are not suitable for analysis of material directly from post-mortem specimens. We describe a rapid method for differential diagnosis of infections caused by RPV or PPRV, which uses specific cDNA probes, derived from the mRNAs for the nucleocapsid protein of each virus, which can be used to distinguish unequivocally the two virus types rapidly.
Resumo:
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of the training samples of a given class are used to select prototypes. In the second method, cumulative distance to allographs of different orientation is used as a criterion to decide if the sample is representative of the group. The latter method is presumed to offset the possible orientation effect. This method still uses fixed number of prototypes for each of the classes. Finally, a prototype set growing algorithm is proposed, with a view to better model the differences in complexity of different character classes. The proposed algorithms are tested and compared for both writer independent and writer adaptation scenarios.