Search results for "image processing"

showing 10 items of 3285 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

An Approach to the Automatic Comparison of Reference Point-Based Interactive Methods for Multiobjective Optimization

2021

Solving multiobjective optimization problems means finding the best balance among multiple conflicting objectives. This needs preference information from a decision maker who is a domain expert. In interactive methods, the decision maker takes part in an iterative process to learn about the interdependencies and can adjust the preferences. We address the need to compare different interactive multiobjective optimization methods, which is essential when selecting the most suited method for solving a particular problem. We concentrate on a class of interactive methods where a decision maker expresses preference information as reference points, i.e., desirable objective function values. Compari…

General Computer ScienceLinear programmingProcess (engineering)Computer science020209 energypäätöksentukijärjestelmät02 engineering and technologyMachine learningcomputer.software_genreMulti-objective optimizationtestausdecision makingoptimointi0202 electrical engineering electronic engineering information engineeringGeneral Materials Sciencemultiobjective optimizationElectrical and Electronic EngineeringReliability (statistics)computer.programming_languageClass (computer programming)Iterative and incremental developmentinteractive systemsbusiness.industryGeneral EngineeringPython (programming language)monitavoiteoptimointiPreferencetestingTK1-9971interaktiivisuusoptimization methods020201 artificial intelligence & image processingArtificial intelligenceElectrical engineering. Electronics. Nuclear engineeringbusinesscomputerDecision makingoptimization
researchProduct

An efficient data model for energy prediction using wireless sensors

2019

International audience; Energy prediction is in high importance for smart homes and smart cities, since it helps reduce power consumption and provides better energy and cost savings. Many algorithms have been used for predicting energy consumption using data collected from Internet of Things (IoT) devices and wireless sensors. In this paper, we propose a system based on Multilayer Perceptron (MLP) to predict energy consumption of a building using collected information (e.g., light energy, day of the week, humidity, temperature, etc.) from a Wireless Sensor Network (WSN). We compare our system against four other classification algorithms, namely: Linear Regression (LR), Support Vector Machin…

General Computer ScienceMean squared errorComputer scienceReal-time computing02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]7. Clean energy[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]0202 electrical engineering electronic engineering information engineeringElectrical and Electronic Engineering020206 networking & telecommunicationsEnergy consumption[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationRandom forestSupport vector machineMean absolute percentage error13. Climate actionControl and Systems Engineering[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Multilayer perceptron020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Gradient boosting[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Wireless sensor network
researchProduct

From Nerode's congruence to Suffix Automata with mismatches

2009

AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…

General Computer ScienceOpen problem[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyString searching algorithm01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automatonSuffix automata0202 electrical engineering electronic engineering information engineeringCombinatorics on words Indexing Suffix Automata Languages with mismatches Approximate string matchingMathematicsDiscrete mathematicsCombinatorics on wordsApproximate string matchingSettore INF/01 - InformaticaLanguages with mismatchesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)PrefixCombinatorics on wordsDeterministic finite automaton010201 computation theory & mathematicsSuffix automatonIndexing020201 artificial intelligence & image processingSuffixComputer Science::Formal Languages and Automata TheoryComputer Science(all)
researchProduct

On the exhaustive generation of k-convex polyominoes

2017

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.

General Computer SciencePolyomino0102 computer and information sciences02 engineering and technologyComputer Science::Computational Geometry01 natural sciencesConvexityTheoretical Computer ScienceCombinatoricsCAT algorithmIntegerExhaustive generation0202 electrical engineering electronic engineering information engineeringConvex polyominoeConvexity K-convex polyominoes.Convex polyominoesComputer Science::DatabasesMathematicsDiscrete mathematicsAmortized analysisMathematics::CombinatoricsDegree (graph theory)Settore INF/01 - InformaticaComputer Science (all)Regular polygonMonotone polygon010201 computation theory & mathematicsPath (graph theory)020201 artificial intelligence & image processingCAT algorithms; Convex polyominoes; Exhaustive generation;CAT algorithms
researchProduct

A combinatorial view on string attractors

2021

Abstract The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w 1 w 2 ⋯ w n is a subset Γ of the positions { 1 , … , n } , such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. In this paper we explore the notion of string attractor by focusing on its combinatorial properties. In particular, we show how the size of the smallest string attractor of a word varies when combinatorial operations are applied and we deduce that such a measure is not monotone. Moreover, we introduce a c…

General Computer ScienceSettore INF/01 - InformaticaString (computer science)de Bruijn word0102 computer and information sciences02 engineering and technologyCharacterization (mathematics)Burrows-Wheeler transform01 natural sciencesMeasure (mathematics)Standard Sturmian wordTheoretical Computer ScienceCombinatoricsConjugacy classMonotone polygonString attractor010201 computation theory & mathematicsAttractorThue-Morse word0202 electrical engineering electronic engineering information engineeringLempel-Ziv encoding020201 artificial intelligence & image processingWord (group theory)Mathematics
researchProduct

An efficient method for fully automatic 3D digitization of unknown objects

2013

Our goal is to develop a complete and automatic scanning strategy with minimum prior information about the object shape. We aim to establish a methodology for the automation of the 3D digitization process. The paper presents a novel approach to determine the Next Best View (NBV) for an efficient reconstruction of highly accurate 3D models. Our method is based on the classification of the acquired surfaces into Well Visible and Barely Visible combined with a best view selection algorithm based on mean shift, which avoids unreachable positions. Our approach is applicable to all kinds of range sensors. To prove the efficiency and the robustness of our method, test objects are first scanned man…

General Computer Sciencebusiness.industryComputer science3D reconstructionGeneral Engineering[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringRanging02 engineering and technology[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Automation[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Robustness (computer science)Fully automatic0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer visionMean-shiftArtificial intelligencebusinessSelection algorithmDigitization
researchProduct

On the Use of GPU for Accelerating Communication-Aware Mapping Techniques

2015

Different communication-aware mapping techniques were proposed in recent years for improving the performance of distributed systems based on both, off-chip and on-chip networks. Some of these proposals were based on heuristic search for finding pseudo-optimal assignments of tasks and processing elements. However, the technology integration improvements have allowed a significant increase in the number of network nodes, requiring the acceleration of the heuristic search. In this paper, we propose a comparative study of the local search method used in a communication-aware mapping technique, when implemented on different parallel architectures. We compare the performance provided by a version…

General Computer Sciencebusiness.industryComputer scienceGraphics processing unit02 engineering and technologyParallel computingSupercomputer020202 computer hardware & architectureAcceleration0202 electrical engineering electronic engineering information engineeringTechnology integration020201 artificial intelligence & image processingLocal search (optimization)Mapping techniquesArchitecturebusinessThe Computer Journal
researchProduct

Implementation of a web and mobile solution for vehicular management based on Aspects Architecture and Agile Methodologies: An educational approach f…

2017

espanolEn el presente articulo se detallan el analisis, aplicacion de metodologias agiles, y tecnologias de codigo abierto en el desarrollo de una aplicacion web y movil, para automatizar y controlar el parque automotor de la Universidad Tecnica Particular de Loja (UTPL), dicha aplicacion fue desarrollada por los profesionales en formacion del componente educativo Programacion Web en marco del proyecto Computacion Afectiva. Dentro de las funciones esenciales del aplicativo esta la gestion de vehiculos que implica el registro: ordenes de combustible y mantenimiento, facturas, proveedores, conductores y vehiculos; ademas de la gestion de prestamos de vehiculos que implica el registro de solic…

General Computer Sciencebusiness.industryEducaciónMethodology020207 software engineering02 engineering and technologyPersonaMetodologíaEducació InvestigacióEducationICONIXOpen sourcePolitical scienceTechnical universityWeb Application0202 electrical engineering electronic engineering information engineeringWeb programmingWeb application020201 artificial intelligence & image processingbusinessAplicativo webPOAHumanitiesRISTI - Revista Ibérica de Sistemas e Tecnologias de Informação
researchProduct

Shall we follow? Impact of reputation concern on information security managers’ investment decisions

2020

Information security (infosec) is important for organizations. While budgeting for infosec is a crucial resource allocation decision, infosec managers may choose to follow other fellow experts’ recommendations or baseline practices. The present paper uses reputational herding theory to explain the decision made by infosec managers to use a “let's follow others” strategy in this context. Based on a sample of 106 organizations in Finland, we find that infosec managers’ ability to accurately predict the benefit of infosec investment, as well as their reputations, have significant effects on motivating them to discount their own information. Infosec managers’ discounting of their own informatio…

General Computer Sciencemedia_common.quotation_subjectpäätöksentekoorganisaatiotContext (language use)02 engineering and technologydecision makingdiscount own informationtietohallintojohtajat0202 electrical engineering electronic engineering information engineeringHerdingtietoturvauncertaintyBaseline (configuration management)media_commonDiscountingActuarial sciencetietoturvapolitiikka020206 networking & telecommunicationsInformation securityInvestment (macroeconomics)maineenhallintareputational herdingInfosec investmentInvestment decisions020201 artificial intelligence & image processingBusinessLawReputationComputers & Security
researchProduct