{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T02:26:45Z","timestamp":1782959205520,"version":"3.54.5"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018,2,1]]},"DOI":"10.1109\/tc.2017.2731770","type":"journal-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T18:24:33Z","timestamp":1501007073000},"page":"149-159","source":"Crossref","is-referenced-by-count":83,"title":["Approximate DCT Image Compression Using Inexact Computing"],"prefix":"10.1109","volume":"67","author":[{"given":"Haider A.F.","family":"Almurib","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thulasiraman Nandha","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3152-3245","authenticated-orcid":false,"given":"Fabrizio","family":"Lombardi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.895509"},{"key":"ref32","year":"2012"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.40"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2015.66"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1006\/jvci.1997.0323"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2003.813842"},{"key":"ref35","first-page":"149","article-title":"Image Recognition using discrete cosine transforms as dimensionality reduction","author":"pan","year":"0","journal-title":"Proc IEEE&#x2014;EURASIP Workshop Nonlinear Signal Image Process"},{"key":"ref34","article-title":"High speed face recognition based on discrete cosine transforms and neural networks","author":"pan","year":"1999"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2217962"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.146"},{"key":"ref12","first-page":"343","article-title":"A comparative review and evaluation of approximate adders","author":"jiang","year":"0","journal-title":"Proc ACM\/IEEE Great Lakes Symp VLSI"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NANO.2013.6720793"},{"key":"ref14","first-page":"660","article-title":"Inexact designs for approximate low power addition by cell replacement","year":"0","journal-title":"Proc Des Autom Test Europe Conf"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2007.364664"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1088\/0957-0233\/23\/11\/114003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2013.2295022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.1999.822998"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1989.266596"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2163394"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/76.180688","article-title":"On the fixed-point-error analysis of several fast DCT algorithms","volume":"3","author":"tun","year":"1993","journal-title":"IEEE Trans Circuits Syst Vid Technol"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2011.5938023"},{"key":"ref3","first-page":"1095","article-title":"A fast DCT-SQ scheme for im- ages","volume":"e 71","author":"arai","year":"1988","journal-title":"IEICE Trans"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/78.969511"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/el.2012.1148"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/78.295188"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.145"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/5.949483"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012373624-6\/50003-5"},{"key":"ref9","first-page":"957","article-title":"Approximate logic synthesis for error tolerant applications","author":"shin","year":"0","journal-title":"Proc Des Autom Test Europe"},{"key":"ref1","author":"blahut","year":"1985","journal-title":"Fast Algorithms for Digital Signal Processing"},{"key":"ref20","first-page":"1805","article-title":"New S DCT algorithms suitable for VLSI implementation","author":"duhamel","year":"1987","journal-title":"Proc IEEE Int Conf Acoustics Speech Signal Process"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1049\/el.2011.2392"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.144722"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2004.835151"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1684(01)00106-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICM.2009.5418584"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/el:20082239"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8255532\/07990539.pdf?arnumber=7990539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:25Z","timestamp":1642004665000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7990539\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,1]]},"references-count":37,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tc.2017.2731770","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2,1]]}}}