Search results for "wise"

showing 10 items of 369 documents

Two View Line-Based Motion and Structure Estimation for Planar Scenes

2012

We present an algorithm for reconstruction of piece-wise planar scenes from only two views and based on minimum line correspondences. We first recover camera rotation by matching vanishing points based on the methods already exist in the literature and then recover the camera translation by searching among a family of hypothesized planes passing through one line. Unlike algorithms based on line segments, the presented algorithm does not require an overlap between two line segments or more that one line correspon- dence across more than two views to recover the translation and achieves the goal by exploiting photometric constraints of the surface around the line. Experimental results on real…

Surface (mathematics)Computer engineering. Computer hardwareMatching (graph theory)Line correspondenceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyVideo AnalysisTranslation (geometry)[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]TK7885-7895Motion[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Line segment0202 electrical engineering electronic engineering information engineeringComputer visionVanishing pointComputingMilieux_MISCELLANEOUSMathematicsTwo viewsbusiness.industryTracking[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringKeywordsQA75.5-76.953D and StereoReal imageElectronic computers. Computer scienceLine (geometry)Piece-wise planar scene020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusinessStructure and MotionRotation (mathematics)Software
researchProduct

Peripheral T-cell lymphoma classification: the matter of cellular derivation.

2011

Peripheral T-cell lymphomas (PTCLs) represent approximately 12% of all non-Hodgkin's lymphomas in Western countries. They are quite heterogeneous as far as morphology and phenotype are concerned. Furthermore, until now, PTCLs could not be referred to specific normal counterparts, in contrast to B-cell-derived non-Hodgkin's lymphomas. In particular, in the last edition of the WHO classification of Tumors of the Hematopoietic and Lymphoid Tissues, for the majority of nodal PTCLs (including the not otherwise specified type and anaplastic large-cell lymphoma), the postulated cell of origin remained undefined. However, in the last few years, high-throughput genomic techniques, especially gene-ex…

T cellGene Expression ProfilingNot Otherwise SpecifiedT lymphocytesLymphoma T-Cell PeripheralTfhHematologyBiologymedicine.diseasePhenotypePeripheral T-cell lymphomaLymphomaGene expression profilingcytotoxicgene-expression profilemedicine.anatomical_structureImmunologymedicineCancer researchCytotoxic T cellHumansProspective Studiesperipheral T-cell lymphomaTumors of the hematopoietic and lymphoid tissuesExpert review of hematology
researchProduct

PIECEWISE ANOMALY DETECTION USING MINIMAL LEARNING MACHINE FOR HYPERSPECTRAL IMAGES

2021

Abstract. Hyperspectral imaging, with its applications, offers promising tools for remote sensing and Earth observation. Recent development has increased the quality of the sensors. At the same time, the prices of the sensors are lowering. Anomaly detection is one of the popular remote sensing applications, which benefits from real-time solutions. A real-time solution has its limitations, for example, due to a large amount of hyperspectral data, platform’s (drones or a cube satellite) constraints on payload and processing capability. Other examples are the limitations of available energy and the complexity of the machine learning models. When anomalies are detected in real-time from the hyp…

TechnologyMinimal Learning Machinehyperspectral imagingComputer scienceRemote sensing applicationConstant false alarm rateRobustness (computer science)Applied optics. Photonicshyperspektrikuvantaminenbusiness.industryTspektrikuvausPayload (computing)Hyperspectral imagingPattern recognitionEngineering (General). Civil engineering (General)anomaly detectionTA1501-1820piecewise approachmachine learningkoneoppiminenPiecewiseAnomaly detectionNoise (video)Artificial intelligenceTA1-2040businessreal-time computationISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
researchProduct

Learning to Rank Images for Complex Queries in Concept-based Search

2018

Concept-based image search is an emerging search paradigm that utilizes a set of concepts as intermediate semantic descriptors of images to bridge the semantic gap. Typically, a user query is rather complex and cannot be well described using a single concept. However, it is less effective to tackle such complex queries by simply aggregating the individual search results for the constituent concepts. In this paper, we propose to introduce the learning to rank techniques to concept-based image search for complex queries. With freely available social tagged images, we first build concept detectors by jointly leveraging the heterogeneous visual features. Then, to formulate the image relevance, …

Theoretical computer scienceCognitive Neuroscience02 engineering and technologyfactorization machineRanking (information retrieval)Set (abstract data type)Artificial Intelligence020204 information systems0202 electrical engineering electronic engineering information engineeringRelevance (information retrieval)tiedonhakukuvatMathematicslearning to rankta113InternetConcept searchRank (computer programming)kuvahakuComputer Science Applicationscomplex query020201 artificial intelligence & image processingLearning to rankPairwise comparisonconcept-based image searchSemantic gapNeurocomputing
researchProduct

Dictionary-symbolwise flexible parsing

2012

AbstractLinear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compression theory. A recent result is the Flexible Parsing algorithm of Matias and Sahinalp (1999) that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed dictionaries and any symbolwise compressor under some natural hypothesis. In the case of LZ78-like algorithms with variable costs and any, linear as usual, symbolwise compressor we show how to implement our parsing algorithm in linear time. In the case of LZ77-like dictionaries and any symbol…

Theoretical computer scienceComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Data_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technologycomputer.software_genre01 natural sciencesDirected acyclic graphTheoretical Computer ScienceConstant (computer programming)020204 information systemsEncoding (memory)Optimal parsing0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsStringologySymbolwise text compressionTime complexityLossless compressionParsingSettore INF/01 - InformaticaDictionary-based compressionOptimal Parsing Lossless Data Compression DAGDirected acyclic graphPrefixComputational Theory and MathematicsText compression010201 computation theory & mathematicsAlgorithmcomputerBottom-up parsingData compressionJournal of Discrete Algorithms
researchProduct

Supervised learning of time-independent Hamiltonians for gate design

2018

We present a general framework to tackle the problem of finding time-independent dynamics generating target unitary evolutions. We show that this problem is equivalently stated as a set of conditions over the spectrum of the time-independent gate generator, thus transforming the task to an inverse eigenvalue problem. We illustrate our methodology by identifying suitable time-independent generators implementing Toffoli and Fredkin gates without the need for ancillae or effective evolutions. We show how the same conditions can be used to solve the problem numerically, via supervised learning techniques. In turn, this allows us to solve problems that are not amenable, in general, to direct ana…

Theoretical computer scienceDiagonalFOS: Physical sciencesGeneral Physics and AstronomyInverseToffoli gate02 engineering and technologysupervised learning01 natural sciencesUnitary statequantum computingSettore FIS/03 - Fisica Della Materia010305 fluids & plasmasSet (abstract data type)Computer Science::Hardware Architecturesymbols.namesakeComputer Science::Emerging Technologiesquant-ph020204 information systems0103 physical sciences0202 electrical engineering electronic engineering information engineering010306 general physicsEigenvalues and eigenvectorsQuantum computerMathematicsPhysicsFlexibility (engineering)Discrete mathematicsQuantum PhysicsSupervised learningInverse problemHermitian matrixmachine learningQubitsymbolsPairwise comparisonquantum circuitsQuantum Physics (quant-ph)Hamiltonian (quantum mechanics)Generator (mathematics)Quantum Information and Measurement (QIM) V: Quantum Technologies
researchProduct

Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance

2020

We present a pairwise learning to rank approach based on a neural net, called DirectRanker, that generalizes the RankNet architecture. We show mathematically that our model is reflexive, antisymmetric, and transitive allowing for simplified training and improved performance. Experimental results on the LETOR MSLR-WEB10K, MQ2007 and MQ2008 datasets show that our model outperforms numerous state-of-the-art methods, while being inherently simpler in structure and using a pairwise approach only.

Transitive relationPairwise learningTheoretical computer scienceArtificial neural networkAntisymmetric relationComputer scienceRank (computer programming)Structure (category theory)Pairwise comparisonLearning to rank
researchProduct

High-accuracy approximation of piecewise smooth functions using the Truncation and Encode approach

2017

Abstract In the present work, we analyze a technique designed by Geraci et al. in [1,11] named the Truncate and Encode (TE) strategy. It was presented as a non-intrusive method for steady and non-steady Partial Differential Equations (PDEs) in Uncertainty Quantification (UQ), and as a weakly intrusive method in the unsteady case. We analyze the TE algorithm applied to the approximation of functions, and in particular its performance for piecewise smooth functions. We carry out some numerical experiments, comparing the performance of the algorithm when using different linear and non-linear interpolation techniques and provide some recommendations that we find useful in order to achieve a hig…

Truncation errorPartial differential equationGeneral Computer ScienceTruncationApplied MathematicsMathematical analysisOrder (ring theory)010103 numerical & computational mathematicsENCODE01 natural sciences010101 applied mathematicsModeling and SimulationPiecewiseApplied mathematics0101 mathematicsUncertainty quantificationEngineering (miscellaneous)InterpolationApplied Mathematics and Nonlinear Sciences
researchProduct

Multi-class pairwise linear dimensionality reduction using heteroscedastic schemes

2010

Accepted version of an article published in the journal: Pattern Recognition. Published version on Sciverse: http://dx.doi.org/10.1016/j.patcog.2010.01.018 Linear dimensionality reduction (LDR) techniques have been increasingly important in pattern recognition (PR) due to the fact that they permit a relatively simple mapping of the problem onto a lower-dimensional subspace, leading to simple and computationally efficient classification strategies. Although the field has been well developed for the two-class problem, the corresponding issues encountered when dealing with multiple classes are far from trivial. In this paper, we argue that, as opposed to the traditional LDR multi-class schemes…

VDP::Mathematics and natural science: 400::Mathematics: 410::Applied mathematics: 413business.industryVDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422Dimensionality reductionDecision treePattern recognitionBayes classifierLinear discriminant analysisLinear subspaceWeightingArtificial IntelligenceSignal ProcessingPairwise comparisonComputer Vision and Pattern RecognitionArtificial intelligencebusinessAlgorithmSoftwareSubspace topologyMathematics
researchProduct

Mixed l-/l1 fault detection observer design for positive switched systems with time-varying delay via delta operator approach

2014

Published version of an article in the journal: International Journal of Control, Automation and Systems. Also available from the publisher at: http://dx.doi.org/10.1007/s12555-013-0466-1 This paper investigates the problem of fault detection observer design for positive switched systems with time-varying delay via delta operator approach. A new fault sensitivity measure, called l-index, is proposed. The l- fault detection observer design and multi-objective l -/l1 fault detection observer design problems are addressed. Based on the average dwell time approach and the piecewise copositive type Lyapunov-Krasovskii functional method in delta domain, sufficient conditions for the existence of …

VDP::Technology: 500::Mechanical engineering: 570Computer Science Applications1707 Computer Vision and Pattern RecognitionDelta operatorMechatronicsfault sensitivityFault (power engineering)positive switched systemsMeasure (mathematics)VDP::Mathematics and natural science: 400::Mathematics: 410::Analysis: 411Fault detection and isolationfault detectionComputer Science Applicationsdelta operatorDwell timeControl theoryControl and Systems EngineeringPiecewiseAverage dwell time; delta operator; fault detection; fault sensitivity; positive switched systems; Control and Systems Engineering; Computer Science Applications1707 Computer Vision and Pattern RecognitionSensitivity (control systems)Average dwell timeMathematics
researchProduct