{"id":18782,"date":"2024-04-11T10:12:32","date_gmt":"2024-04-11T14:12:32","guid":{"rendered":"https:\/\/www.uqar.ca\/personnes\/steven-pigeon\/"},"modified":"2026-08-12T00:17:04","modified_gmt":"2026-08-12T04:17:04","slug":"pigeon-steven","status":"publish","type":"personnes","link":"https:\/\/www.uqar.ca\/en\/professeurs\/pigeon-steven\/","title":{"rendered":"Steven Pigeon"},"content":{"rendered":"\n<section class=\"wp-block-stereo-section-bloc section-block-small -section-block-padding-sm\" data-stereo-anchor-name=\"\"><div class=\"wp-block-stereo-section__container\"><div class=\"wp-block-stereo-section__col is-layout-flow wp-block-stereo-section-bloc-is-layout-flow\">\n<div class=\"wp-block-create-block-accordion-block\"><div class=\"c-tabs\" data-module=\"Tabs\"><div class=\"c-tabs-nav__wrap\" role=\"tablist\"><div class=\"c-tabs-nav-mobile\"><button data-tabs=\"button\" tabindex=\"0\" data-tabs-dir=\"<\" class=\"c-tabs-nav-mobile__button\" role=\"tab\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-left\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg#arrow-left\"><\/use><\/svg><\/button><button data-tabs=\"button\" tabindex=\"0\" data-tabs-dir=\"&gt;\" class=\"c-tabs-nav-mobile__button\" role=\"tab\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-right\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg#arrow-right\"><\/use><\/svg><\/button><\/div><div class=\"c-tabs-nav\" data-tabs=\"nav\"><button class=\"c-tabs-nav__item\" data-tabs=\"trigger\" role=\"tab\"><span class=\"c-tab\">Domaines de recherche<\/span><\/button><button class=\"c-tabs-nav__item\" data-tabs=\"trigger\" role=\"tab\"><span class=\"c-tab\">Recherches et expertises<\/span><\/button><button class=\"c-tabs-nav__item\" data-tabs=\"trigger\" role=\"tab\"><span class=\"c-tab\">Publications et communications<\/span><\/button><button class=\"c-tabs-nav__item\" data-tabs=\"trigger\" role=\"tab\"><span class=\"c-tab\">Cours enseign\u00e9s<\/span><\/button><\/div><\/div><div class=\"c-tabs-content__wrap\">\n<div class=\"c-tab-content__item\" data-tabs=\"content\"><div class=\"c-tab-content\"><p>\n    <ul>\n        <li>Informatique<\/li><li>Compression de donn\u00e9es<\/li><li>Structures de donn\u00e9es efficaces<\/li><li>Adaptation multim\u00e9dia<\/li>    <\/ul>\n<\/p><\/div><\/div>\n\n\n\n<div class=\"c-tab-content__item\" data-tabs=\"content\"><div class=\"c-tab-content\">\n<div class=\"wp-block-create-block-accordion-block\"><div class=\"c-accordion\" data-module=\"Accordion\" data-accordion-toggle=\"true\" data-accordion-scroll=\"true\" data-accordion-preopen=\"-1\">\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Formation\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"formation\"><span class=\"c-accordion__button\"> Formation<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<p class=\"wp-block-paragraph\">\u00c0 venir<\/p>\n<\/div><\/div><\/div>\n\n\n\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Projets de recherche en cours et subventions\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"projets-de-recherche-en-cours-et-subventions\"><span class=\"c-accordion__button\"> Projets de recherche en cours et subventions<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<p class=\"wp-block-paragraph\">Mon int\u00e9r\u00eat principal de recherche, c&#8217;est la compression de donn\u00e9es, o\u00f9 on cherche \u00e0 trouver aux donn\u00e9es des repr\u00e9sentations qui utilisent moins d&#8217;espace, c&#8217;est-\u00e0-dire, o\u00f9 l&#8217;on minimise l&#8217;espace de stockage et\/ou le temps de transmission (tout en conservant une qualit\u00e9 raisonnable de la restitution, dans le cas de la compression avec perte). En particulier, je m&#8217;int\u00e9resse au cas d&#8217;adaptation multim\u00e9dia o\u00f9 il s&#8217;agit de transformer des donn\u00e9es d\u00e9j\u00e0 compress\u00e9es (images, vid\u00e9o, son) d&#8217;un format de fichier \u00e0 un autre, adapter d&#8217;un d\u00e9bit binaire \u00e0 un autre, mais en applicant des transformations qui visent \u00e0 maximiser explicitement la qualit\u00e9 r\u00e9sultante\u2014bien qu&#8217;in\u00e9vitablement, il y ait perte de fid\u00e9lit\u00e9.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Je m&#8217;int\u00e9resse aussi aux impl\u00e9mentations efficaces de toutes sortes d&#8217;algorithmes, y compris ceux de compression de donn\u00e9es. Un peu de la m\u00eame fa\u00e7on, je m&#8217;int\u00e9resse aux structures de donn\u00e9es efficaces en m\u00e9moire et en temps. Bien que l&#8217;on puisse imaginer que les structures de donn\u00e9es requi\u00e9rant peu de m\u00e9moire puissent n&#8217;\u00eatre vraiment utiles que dans des environnements o\u00f9 il y a peu de m\u00e9moire disponible comme les syst\u00e8mes embarqu\u00e9s, il s&#8217;av\u00e8re qu&#8217;elles sont fort utiles m\u00eame dans les environnements de type&nbsp;<em>workstation<\/em>&nbsp;ou serveur o\u00f9 il est parfois n\u00e9cessaire de cr\u00e9er des structures de donn\u00e9es contenant des millions, voire des&nbsp;<em>milliards<\/em>, d&#8217;items.<\/p>\n<\/div><\/div><\/div>\n\n\n\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Supervision d'\u00e9tudiants de cycles sup\u00e9rieurs\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"supervision-detudiants-de-cycles-superieurs\"><span class=\"c-accordion__button\"> Supervision d&#8217;\u00e9tudiants de cycles sup\u00e9rieurs<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<p class=\"wp-block-paragraph\">\u00c0 venir<\/p>\n<\/div><\/div><\/div>\n\n\n\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Autres activit\u00e9s\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"autres-activites\"><span class=\"c-accordion__button\"> Autres activit\u00e9s<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<p class=\"wp-block-paragraph\">\u00c0 venir<\/p>\n<\/div><\/div><\/div>\n\n\n\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Exp\u00e9rience professionnelle\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"experience-professionnelle\"><span class=\"c-accordion__button\"> Exp\u00e9rience professionnelle<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<p class=\"wp-block-paragraph\">\u00c0 venir<\/p>\n<\/div><\/div><\/div>\n\n\n\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Affiliations\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"affiliations\"><span class=\"c-accordion__button\"> Affiliations<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<p class=\"wp-block-paragraph\">\u00c0 venir<\/p>\n<\/div><\/div><\/div>\n<\/div><\/div>\n<\/div><\/div>\n\n\n\n<div class=\"c-tab-content__item\" data-tabs=\"content\"><div class=\"c-tab-content\">\n<div class=\"wp-block-create-block-accordion-block\"><div class=\"c-accordion\" data-module=\"Accordion\" data-accordion-toggle=\"true\" data-accordion-scroll=\"true\" data-accordion-preopen=\"-1\">\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Publications\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"publications\"><span class=\"c-accordion__button\"> Publications<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<ul class=\"wp-block-list\">\n<li>Steven Pigeon \u2014\u00a0<em>Codes \u00e9conomiques r\u00e9examin\u00e9s: g\u00e9n\u00e9ralisations, bornes et algorithmes<\/em>\u00a0\u2014 Compression et repr\u00e9sentation des signaux audiovisuels (CORESA&#8217;26) (mai 2026)<\/li>\n\n\n\n<li>Steven Pigeon, Marianne B\u00e9rub\u00e9-Dufour \u2014 Digitizing the Wooden Scale Model of a Twentieth Century Urban Utopia for the Development of a Full-Scale Virtual Tour Application Using a Game Engine \u2014 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XLVIII-M-9-2025 (ao\u00fbt 2025), p. 1197\u20131023<\/li>\n\n\n\n<li>Steven Pigeon, Benjamin Lapointe-Pinel \u2014 Using a Slit to Suppress Optical Aberrations in Laser Triangulation Sensors \u2014 MDPI Sensors, vol. 24 no. 8 (avril 2024), article 2662.<\/li>\n\n\n\n<li>Benjamin Lapointe-Pinel, Steven Pigeon \u2014 Suppressing Laser Triangulation Sensors Optical Aberrations by Replacing the Lens with a Slit \u2014 Procs. 12th IEEE Int. Conf. on Intelligent Data Acquistion and Advanced Computing Systems (IDAACS&#8217;23), Vol. 2 (2023), p. 42\u201346<\/li>\n\n\n\n<li>Steven Pigeon \u2014 Simple but High-Accuracy Approximations for n! \u2014 International Journal of Applied Physics and Mathematics, vol. 11 no. 4 (oct 2021), p. 61\u201370.<\/li>\n\n\n\n<li>Mathieu Juncker, Isma\u00efl Khriss, Jean Brousseau, Steven Pigeon, Alexis Darisse, Billy Lapointe \u2014 A Deep Learning-Based Approach for Quality Controland Defect Detection for Industrial Bagging Systems \u2014 Procs. 19th IEEE Int. Conf. on Cognitive Informatics and Cognitive Computing (ICCI*CC&#8217;20) (26\u201328 Sept. 2020), p. 60\u201367.<\/li>\n\n\n\n<li>St\u00e9phane Duguay, Steven Pigeon \u2014 Comparison of Pixel Correlation Induced by Space-Filling Curves on 2D Image Data \u2014 Procs. Intelligent Data Acquisition and Advanced Computing Systems (IDAACS) 2019 (18-19 Septembre 2019) V1, p. 294\u2013297 &nbsp;Laur\u00e9at du &#8220;Best Paper by a Young Author&#8221; \u00e0 IDAACS 2019.<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Quality-aware predictor-based adaptation of still images for the multimedia messaging service&nbsp;\u2014 Multimedia Tools and Application, vol. 64 no. 1?, (mai 2013)<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;K-Means Based Prediction of Transcoded JPEG File size and Structural Similarity\u2014 J. of Multimedia Data Engineering and Management, vol. 3 no. 2, (Avril-Juin 2012), p. 41\u201357<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Efficient Clustering-Based Algorithm for Predicting File Size and Structural Similarity of Transcoded JPEG Images&nbsp;\u2014 Procs. IEEE Int. Symposium on Multimedia (ISM) 2011 (december 5-7 2011) V1<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Optimal Quality-Aware Predictor-Based Adaptation of Multimedia Messages&nbsp;\u2014 Procs. Intelligent Data Acquisition and Advanced Computing Systems (IDAACS) 2011 (september 15-17 2011) V1 p. 496-499<\/li>\n\n\n\n<li>Luc Trudeau, St\u00e9phane Coulombe, Steven Pigeon \u2014&nbsp;Pixel Domain Referenceless Visual Degratation Detection and Error Concealment for Mobile Video&nbsp;\u2014 International Conference on Image Processing (ICIP) 2011 (september 11-14 2011)<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Exploiting Motion Estimation Resilience to Approximated Metrics on SIMD-Capable General Processors: from Atom to Nehalem&nbsp;\u2014 25th&nbsp;Queen&#8217;s University Biennial Symposium on Communications (QBSC) (12-14 may 2010), p. 18-23<\/li>\n\n\n\n<li>St\u00e9phane Coulombe, Steven Pigeon \u2014&nbsp;Low-Complexity Transcoding of JPEG Images with Near-Optimal Quality Using a Predictive Quality Factor and Scaling Parameters&nbsp;\u2014 IEEE Trans. Image Processing, vol. 19, no. 3, (mars 2010), p. 712-721<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Speeding Up Motion Estimation in Modern Video Encoders Using Approximate Metrics and SIMD Processors&nbsp;\u2014 ISIEA 2009 (IEEE Symposium on Industrial Electronics and Applications), p. 233\u2013238<\/li>\n\n\n\n<li>Fran\u00e7ois-Denis Gonthier, Steven Pigeon \u2014&nbsp;Non Privileged User Package Management: Use Cases, Issues, Proposed Solutions&nbsp;\u2014 Procs. Linux Symposium, 2009, p. 111\u2013122<\/li>\n\n\n\n<li>St\u00e9phane Coulombe, Steven Pigeon \u2014&nbsp;Quality-Aware Selection of Quality Factor and Scaling Parameters in JPEG Image Transcoding&nbsp;\u2014 IEEE CIMSVP 2009 (Computational Intelligence for Multimedia, Signal, and Video Processing), p. 68\u201374<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Computationally Efficient Algorithms for Predicting the File Size of JPEG Images Subject to Changes of Quality Factor and Scaling&nbsp;\u2014 24&nbsp;th&nbsp;Biennial Symposium on Communications, Queen&#8217;s University, 2008<\/li>\n\n\n\n<li>Steven Pigeon, St\u00e9phane Coulombe \u2014&nbsp;Very Low Cost Algorithms for Predicting the File Size of JPEG Images Subject to Changes of Quality Factor and Scaling&nbsp;&amp;mdash Procs. Data Compression Conference 2008, IEEE Computer Society Press, 2008, p. 538<\/li>\n\n\n\n<li>Steven Pigeon, Xiaolin Wu \u2014&nbsp;Searchable Compressed Representation of Very Sparse Bitmaps&nbsp;\u2014 Procs. Data Compression Conference 2003, IEEE Computer Society Press, 2003, p. 353 &#8211; 361<\/li>\n\n\n\n<li>Chapitre 4 sur le codage Huffman dans&nbsp;The Handbook of Lossless Data Compression, Khalid Sayood, ed. Academic Press \/ Elsevier, 2003, ISBN 0-12-620861-1<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;Sorting lists and the Radix Sort&nbsp;\u2014 Doctor Dobb&#8217;s Journal, n\u00b0&nbsp;336, Mai 2002, pp. 89\u201394<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;An Optimizing Lossy Generalization of LZW&nbsp;\u2014 Procs. Data Compression Conference 2001, IEEE Computer Society Press, 2001, p. 509<\/li>\n\n\n\n<li>Steven Pigeon, L\u00e9on Bottou \u2014&nbsp;Masked Wavelets: Applications to image compression&nbsp;\u2014 Procs. Data Compression Conference 2001, IEEE Computer Society Press, 2001, p. 510<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;Start\/Stop Codes&nbsp;\u2014 Procs. Data Compression Conference 2001, IEEE Computer Society Press, 2001, p. 511<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;Unconstrained vector lengths in Fast Wavelet Transforms&nbsp;\u2014 Procs. Data Compression Conference 2001, IEEE Computer Society Press, 2001, p. 512<\/li>\n\n\n\n<li>Steven Pigeon, Yoshua Bengio \u2014&nbsp;Binary pseudowavelets and Applications to Bilevel Image Processing&nbsp;\u2014 Procs. Data Compression Conference 1999, IEEE Computer Society Press, 1999, p. 364\u2013373<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;Image compression with wavelets&nbsp;\u2014 Doctor Dobb&#8217;s Journal, n\u00b0&nbsp;302, Ao\u00fbt 1999, pp. 111\u2013115<\/li>\n\n\n\n<li>Steven Pigeon, Yoshua Bengio \u2014&nbsp;A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols\u2014 Procs. of the Data Compression Conference 1998, IEEE Computer Press, p. 568.<\/li>\n\n\n\n<li>L\u00e9on Bottou, Steven Pigeon \u2014&nbsp;Lossy Compression of Partially Masked Still Images&nbsp;\u2014 Procs of IEEE Data Compression Conference DCC&#8217;98, page 528, Snowbird, March 1998.<\/li>\n\n\n\n<li>Steven Pigeon, Yoshua Bengio \u2014&nbsp;Memory-Efficient Adaptive Huffman Coding&nbsp;\u2014 Doctor Dobb&#8217;s Journal, n\u00b0&nbsp;290, 1998, p. 131\u2013135<\/li>\n\n\n\n<li>Steven Pigeon, Yoshua Bengio \u2014&nbsp;A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols, Revisited&nbsp;\u2014 Rapport technique n\u00b0&nbsp;1095, D\u00e9partement d&#8217;informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, 1997<\/li>\n\n\n\n<li>Steven Pigeon, Yoshua Bengio \u2014&nbsp;A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols\u2014 Rapport technique n\u00b0&nbsp;1081, D\u00e9partement d&#8217;informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, 1997<\/li>\n\n\n\n<li>Jocelyn Cloutier, \u00c9ric Cosatto, Steven Pigeon, Fran\u00e7ois R. Boyer, Patrice Y. Simard \u2014&nbsp;VIP: an FPGA-based Processor for Image Processing and Neural Networks&nbsp;\u2014 Procs of the fifth International Conference on Microelectronics for Neural Networks and Fuzzy Systems, Lausane, Suisse, Feb. 1996.<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;A Fast Image Compression Method based on the Fast Hartley Transform&nbsp;\u2014 Tech rep. n\u00b0&nbsp;HA6156000-961220-01, AT&amp;T Research, Speech &amp; Image Processing Lab 6, Holmdel, 1996<\/li>\n\n\n\n<li>Steven Pigeon \u2014&nbsp;Flatland, ou comment r\u00e9duire une image GIF en modifiant l&#8217;algorithme LZW&nbsp;\u2014 Journal l&#8217;Interactif, mars 1996<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has--color has-text-color\">Brevets<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Canadian Patent No. CA 2723910. S. Pigeon,&nbsp;Method and system for determining a metric for comparing image blocks in motion compensated video coding, \u00c9mis \u00e0 L&#8217;\u00c9cole de Technologie Sup\u00e9rieure (30 Sept. 2014).<\/li>\n\n\n\n<li>Japanese Patent No. 5391465. S. Coulombe, S. Pigeon, J.-F. Franche,&nbsp;System and method for quality-aware selection of parameters in transcoding of digital images, \u00c9mis \u00e0 L&#8217;\u00c9cole de Technologie Sup\u00e9rieure (15 Oct. 2013)<\/li>\n\n\n\n<li>Japanese Patent No. 5176175, S. Pigeon, J.-F. Franche, S. Coulombe,&nbsp;System and method for predicting file size of images subject to trans\u00adformation by scaling and a change of quality-controlling para\u00admeters, \u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (2013)<\/li>\n\n\n\n<li>US Patent #8,270,739. S. Coulombe, S. Pigeon, J.-F. Franche,&nbsp;System and method for quality-aware selection of parameters in transcoding of digital images&nbsp;\u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (Septembre 2012)<\/li>\n\n\n\n<li>US patent #8,224,104. S. Pigeon, J.-F. Franche, S. Coulombe,&nbsp;System and method for predicting the file size of images subject to transformation by scaling and a change of quality-controlling parameters, \u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (juil. 2012)<\/li>\n\n\n\n<li>Chinese patent No. ZL200880113575.7. S. Coulombe, S. Pigeon, J.-F. Franche,&nbsp;System and method for quality-aware selection of parameters in transcoding of digital images, \u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (Mai 2012)<\/li>\n\n\n\n<li>Japanese patent No. 4994500. S. Coulombe, S. Pigeon, J.-F. Franche,&nbsp;System and method for quality-aware selection of parameters in transcoding of digital images, \u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (Mai 2012)<\/li>\n\n\n\n<li>Chinese patent No. ZL 200780101390.X. S. Pigeon, J.-F. Franche, S. Coulombe,&nbsp;System and method for predicting the file size of images subject to transformation by scaling and a change of quality-controlling parameters&nbsp;\u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (Mai 2012)<\/li>\n\n\n\n<li>US Patent #8,559,739. Steven Pigeon, Jean-Fran\u00e7ois Franche, St\u00e9phane Coulombe,&nbsp;System and Method for Quality-Aware Selection of Parameters in Transcoding of Digital Images, \u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (2012)<\/li>\n\n\n\n<li>US Patent #8,295,624. St\u00e9phane Coulombe, Steven Pigeon, Jean-Fran\u00e7ois Franche,&nbsp;Method and System for Generating a Quality Prediction Table for Quality-Aware Transcoding of Digital Images&nbsp;\u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (2012)<\/li>\n\n\n\n<li>US Patent #8,300,961. St\u00e9phane Coulombe, Steven Pigeon,&nbsp;Method and System for Low Complexity Transcoding of Images with Near Optimal Quality&nbsp;\u00c9mis \u00e0 l&#8217;\u00c9cole de Technologie Sup\u00e9rieure (2012)<\/li>\n\n\n\n<li>US patent #7,450,772. Leon Bottou, Steven Pigeon,&nbsp;Compression of Partially-Masked Image Data, \u00e9mis \u00e0 AT&amp;T Research, Nov 2008<\/li>\n\n\n\n<li>US patent #7.286,711. Leon Bottou, Steven Pigeon,&nbsp;Compression of Partially-Masked Image Data, \u00e9mis \u00e0 AT&amp;T Research, Oct 2007<\/li>\n\n\n\n<li>US patent #6,728,411. Leon Bottou, Steven Pigeon,&nbsp;Compression of Partially-Masked Image Data, \u00e9mis \u00e0 AT&amp;T Research, Apr 27, 2004<\/li>\n\n\n\n<li>US patent #6,343,154. Leon Bottou, Steven Pigeon,&nbsp;Compression of Partially-Masked Image Data, \u00e9mis \u00e0 AT&amp;T Research, Jan 29, 2002<\/li>\n\n\n\n<li>US patent #6,160,918. Steven Pigeon,&nbsp;Method and Apparatus for Fast Image Compression, \u00e9mis \u00e0 AT&amp;T Research, Dec 12 2000.<\/li>\n\n\n\n<li>US patent #6,058,214. L\u00e9on Bottou, Steven Pigeon,&nbsp;Compression of Partially Masked Images, \u00e9mis \u00e0 AT&amp;T Research, May 2nd 2000.&nbsp;Un brevet europ\u00e9en existe pour cette m\u00eame invention. Je n&#8217;ai cependant pas le num\u00e9ro.<\/li>\n<\/ul>\n<\/div><\/div><\/div>\n\n\n\n<div class=\"c-accordion__section\" data-accordion=\"wrap\"><button type=\"button\" aria-label=\"Ouvrir  Communications\" class=\"c-accordion__header\" data-accordion=\"trigger\"><span class=\"c-accordion__header__title\" id=\"communications\"><span class=\"c-accordion__button\"> Communications<span class=\"c-accordion__header__icon\"><span class=\"o-button__icon\"><svg aria-hidden=\"true\" focusable=\"false\" class=\"o-ico -icon-arrow-down\"><use xlink:href=\"\/app\/themes\/baserock\/assets\/img\/sprite.svg?v=899ec6baabe4cd8be5?v=899ec6baabe4cd8be5#arrow-down\"><\/use><\/svg><\/span><\/span><\/span><\/span><\/button><div class=\"c-accordion__content\" role=\"region\" data-accordion=\"content\"><div class=\"c-accordion__inner\">\n<ul class=\"wp-block-list\">\n<li>Steven Pigeon \u2014 L&#8217;\u00eele Saint-Barnab\u00e9: entre pragmatisme et utopie \u2014 50e Congr\u00e8s annuel de la Soci\u00e9t\u00e9 pour l&#8217;\u00e9tude de l&#8217;architecture au Canada (27\u201330 mai 2025)<\/li>\n\n\n\n<li>Steven Pigeon \u2014 Simple but High-Accuracy Approximations for n! \u2014 Procs 3rd Int. Applied Mathematics, Modeling, and Simulation Conference (juil 2021)<\/li>\n\n\n\n<li>Steven Pigeon \u2014 Small Is Beautiful! Techniques to Reduce Memory Footprint \u2014 CPPCon 2019, (15\u201320 Septembre 2019)<\/li>\n\n\n\n<li>Steven Pigeon.<em> Quadrature in Ancient Egypt, Revisited<\/em>&nbsp;\u2014 Procs. 7th European Congress of Mathematics (18\u201322 Juillet 2016), CS-12-A<\/li>\n<\/ul>\n<\/div><\/div><\/div>\n<\/div><\/div>\n<\/div><\/div>\n\n\n\n<div class=\"c-tab-content__item\" data-tabs=\"content\"><div class=\"c-tab-content\">\n    <p><strong>Premier cycle :<\/strong><\/p>\n    <ul>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF20107<\/a> S\u00e9minaire I<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF21307<\/a> Structures de donn\u00e9es et algorithmes<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF22107<\/a> Infrastructure de programmation<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF30107<\/a> S\u00e9minaire II<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF32515<\/a> Int\u00e9gration en milieu professionnel I<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF32615<\/a> Int\u00e9gration en milieu professionnel II<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF33515<\/a> Stage en informatique I<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF33615<\/a> Stage en informatique II<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF34515<\/a> Projet en informatique I<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF34615<\/a> Projet en informatique II<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF36207<\/a> S\u00e9curit\u00e9 informatique<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">INF39515<\/a> Stage\/projet en informatique<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">MAT13203<\/a> Structures discr\u00e8tes<\/li>\n            <\/ul>\n    <p><strong>Deuxi\u00e8me cycle :<\/strong><\/p>\n    <ul>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">8INF804<\/a> Traitement num\u00e9rique des images<\/li>\n                    <li><a target=\"_blank\" href=\"\" rel=\"noopener noreferrer\" class=\"no-barba\" aria-label=\"Ouvre dans une nouvelle fen\u00eatre\" tabindex=\"0\">8INF840<\/a> Structures de donn\u00e9es avanc\u00e9es et leurs algorithmes<\/li>\n            <\/ul>\n<\/div><\/div>\n<\/div><\/div><\/div>\n<\/div><\/div><\/section>\n","protected":false},"featured_media":25504,"template":"","departement_personnes":[259],"class_list":["post-18782","personnes","type-personnes","status-publish","has-post-thumbnail","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/personnes\/18782","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/personnes"}],"about":[{"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/types\/personnes"}],"version-history":[{"count":12,"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/personnes\/18782\/revisions"}],"predecessor-version":[{"id":87478,"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/personnes\/18782\/revisions\/87478"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/media\/25504"}],"wp:attachment":[{"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/media?parent=18782"}],"wp:term":[{"taxonomy":"departement_personnes","embeddable":true,"href":"https:\/\/www.uqar.ca\/en\/wp-json\/wp\/v2\/departement_personnes?post=18782"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}