Search results for "Methodologie"

showing 10 items of 2141 documents

Using skeleton and Hough transform variant to correct skew in historical documents

2020

International audience; As a main part of several document analysis systems, Skew estimation represents one of the major research challenges, particularly in case of historical documents exploration. In this paper, we propose an original skew angle detection and correction technique. Morphological Skeleton is introduced to considerably diminish the amount of data by eliminating the redundant pixels and preserving only the central curves of the image components. Next, the proposed method uses Progressive Probabilistic Hough Transform (PPHT) to find image lines. At the end, a specific procedure is applied in order to measure the global skew angle of the document image from these identified li…

General Computer ScienceHorizontal and verticalMorphological skeletonComputer scienceSkew estimationComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONDocument image analysis010103 numerical & computational mathematics02 engineering and technologySkeleton (category theory)01 natural sciencesMeasure (mathematics)Theoretical Computer ScienceHough transformlaw.inventionImage (mathematics)lawMorphological skeleton0202 electrical engineering electronic engineering information engineering[INFO.INFO-DL]Computer Science [cs]/Digital Libraries [cs.DL]0101 mathematicsNumerical AnalysisPixelbusiness.industryApplied MathematicsProgressive probabilistic Hough transformSkew[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Pattern recognitionSkew correction[INFO.INFO-TT]Computer Science [cs]/Document and Text ProcessingModeling and Simulation020201 artificial intelligence & image processingArtificial intelligencebusinessMathematics and Computers in Simulation
researchProduct

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes

2006

A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G. In particular, we are interested in a minimum multicoloring that uses the least total number of colors. The main focus of this work is to obtain upper bounds on the weighted chromatic number of some classes of graphs in terms of the weighted clique number. We first propose an 11/6-approximation algorithm for multicoloring any weighted planar graph. We then study the multicoloring problem on powers of square and triangular meshes. Among other results, we show that the infi…

General Computer SciencePower graphAstrophysics::High Energy Astrophysical PhenomenaInduced subgraphDisjoint setsAstrophysics::Cosmology and Extragalactic Astrophysics[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Theoretical Computer ScienceCombinatoricssymbols.namesakeTriangle meshGreedy algorithmDiscrete Mathematics and CombinatoricsAstrophysics::Solar and Stellar AstrophysicsColoringPolygon meshProduct graphMathematicsComputingMethodologies_COMPUTERGRAPHICSDiscrete mathematicsGreedy algorithm.lcsh:MathematicsApproximation algorithmGraph theory[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productlcsh:QA1-939Approximation algorithmPlanar graphGraph theory[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]symbolsMulticoloring
researchProduct

Rapid construction of algebraic axioms from samples

1991

Abstract An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.

General Computer ScienceTheorySample (material)Theoretical Computer ScienceSeparation axiomAlgebraAxiom of extensionalityMathematics::LogicConstruction of the real numbersTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONCalculusReverse mathematicsAlgebraic numberAxiomComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Mappings of finite distortion: Sharp Orlicz-conditions

2003

We establish continuity, openness and discreteness, and the condition $(N)$ for mappings of finite distortion under minimal integrability assumptions on the distortion.

General MathematicsDistortionMathematical analysisData_MISCELLANEOUSComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONData_CODINGANDINFORMATIONTHEORYfinite distortionTopologycontinuityopenness and discretenessMathematicsOrlicz conditions30C65
researchProduct

Real quadrics in C n , complex manifolds and convex polytopes

2006

In this paper, we investigate the topology of a class of non-Kähler compact complex manifolds generalizing that of Hopf and Calabi-Eckmann manifolds. These manifolds are diffeomorphic to special systems of real quadrics Cn which are invariant with respect to the natural action of the real torus (S1)n onto Cn. The quotient space is a simple convex polytope. The problem reduces thus to the study of the topology of certain real algebraic sets and can be handled using combinatorial results on convex polytopes. We prove that the homology groups of these compact complex manifolds can have arbitrary amount of torsion so that their topology is extremely rich. We also resolve an associated wall-cros…

General MathematicsHolomorphic functionSubspace arrangementsPolytope52C35Combinatorics52B05Ricci-flat manifoldTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYConvex polytopeComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONMathematics::Symplectic Geometry32Q55Mathematics32M17Equivariant surgeryTopology of non-Kähler compact complex manifoldsMathematics::Geometric TopologyManifoldAffine complex manifoldsMathematics::Differential GeometryDiffeomorphismComplex manifoldCombinatorics of convex polytopesSingular homologyReal quadrics
researchProduct

VLBI imaging of the gravitational lens MGJ0414+0534

2000

6 pages, 3 figures, accepted for publication in Astronomy & Astrophysics.-- Final full-text version of the paper available at: http://aa.springer.de/papers/0362003/2300845.pdf

GeneralLiterature_INTRODUCTORYANDSURVEYAstrophysics::High Energy Astrophysical PhenomenaAstrophysics (astro-ph)FOS: Physical sciencesquasars: individual: MGJ0414+0534 [Galaxies]Astrophysics::Cosmology and Extragalactic Astrophysicsgravitational lensing [Cosmology]AstrophysicsGalaxies: jetsTechniques: interferometricComputingMethodologies_DOCUMENTANDTEXTPROCESSINGGalaxies: quasars: individual: MGJ0414+0534interferometric [Techniques]jets [Galaxies]Cosmology: gravitational lensingAstrophysics::Galaxy Astrophysics
researchProduct

Additional file 2: of Living alone and positive mental health: a systematic review

2019

Review protocol. This file presents the protocol of the study. (DOC 93 kb)

GeneralLiterature_INTRODUCTORYANDSURVEYComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSComputingMethodologies_DOCUMENTANDTEXTPROCESSING3. Good health
researchProduct

Additional file 2: of Living alone and positive mental health: a systematic review

2019

Review protocol. This file presents the protocol of the study. (DOC 93 kb)

GeneralLiterature_INTRODUCTORYANDSURVEYComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSComputingMethodologies_DOCUMENTANDTEXTPROCESSING3. Good health
researchProduct

2014

This paper investigates the proficiency of support vector machine (SVM) using datasets generated by Tennessee Eastman process simulation for fault detection. Due to its excellent performance in generalization, the classification performance of SVM is satisfactory. SVM algorithm combined with kernel function has the nonlinear attribute and can better handle the case where samples and attributes are massive. In addition, with forehand optimizing the parameters using the cross-validation technique, SVM can produce high accuracy in fault detection. Therefore, there is no need to deal with original data or refer to other algorithms, making the classification problem simple to handle. In order to…

GeneralizationApplied MathematicsProcess (computing)computer.software_genreFault detection and isolationSupport vector machineNonlinear systemComputingMethodologies_PATTERNRECOGNITIONRanking SVMBenchmark (computing)Data miningProcess simulationcomputerAnalysisMathematicsAbstract and Applied Analysis
researchProduct

CellLineNavigator: a workbench for cancer cell line analysis

2012

The CellLineNavigator database, freely available at http://www.medicalgenomics.org/celllinenavigator, is a web-based workbench for large scale comparisons of a large collection of diverse cell lines. It aims to support experimental design in the fields of genomics, systems biology and translational biomedical research. Currently, this compendium holds genome wide expression profiles of 317 different cancer cell lines, categorized into 57 different pathological states and 28 individual tissues. To enlarge the scope of CellLineNavigator, the database was furthermore closely linked to commonly used bioinformatics databases and knowledge repositories. To ensure easy data access and search abili…

GeneticsInternetInterface (Java)Systems biologyGenomicsArticlesComputational biologyBiologyGenomeGene nomenclatureAnnotationComputingMethodologies_PATTERNRECOGNITIONData accessCell Line TumorNeoplasmsDatabases GeneticGeneticsHumansWorkbenchTranscriptomeNucleic Acids Research
researchProduct