0000000000875672

AUTHOR

Pierre Loonis

showing 4 related works from this author

On the possibility of detecting ganoderma infection using sonic tomography

2007

International audience

ComputingMilieux_MISCELLANEOUS
researchProduct

A new minimum trees-based approach for shape matching with improved time computing : application to graphical symbols recognition

2010

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longe…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingMatching (graph theory)[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputer scienceFeature extractionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingMinimum spanning tree[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingActive shape model0202 electrical engineering electronic engineering information engineeringDiscrete cosine transformComputingMilieux_MISCELLANEOUS[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingSpanning treebusiness.industry020206 networking & telecommunicationsPattern recognitionGraphShortest path problemGraph (abstract data type)020201 artificial intelligence & image processingArtificial intelligencebusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingImage compression
researchProduct

A new minimum spanning tree-based method for shape description and matching working in Discrete Cosine space

2009

In this article, a new minimum spanning tree-based method for shape description and matching is proposed. Its properties are checked through the problem of graphical symbols recognition. Recognition invariance in front shift and multi-oriented noisy objects was studied in the context of small and low resolution binary images. The approach seems to have many desirable properties, even if the construction of graphs induces an expensive algorithmic cost. In order to reduce time computing, an alternative solution based on image compression concepts is provided. The recognition is realized in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discuss…

Matching (graph theory)business.industryBinary imageFeature extraction020206 networking & telecommunicationsPattern recognition02 engineering and technologyMinimum spanning treeArtificial IntelligenceRobustness (computer science)0202 electrical engineering electronic engineering information engineeringDiscrete cosine transform020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusinessSoftwareTransform codingComputingMilieux_MISCELLANEOUSMathematicsImage compression
researchProduct

Automatisation de l'évaluation de la Fraîcheur des produits de la mer par imagerie couleur

2002

[INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV]
researchProduct