Among　the　Compressed　Sensing(CS)　reconstruction　algorithms,　greedy　algorithm　has　been　widely　studied　for　its　simple　hardware　implementation　and　excellent　recovery　accuracy.　However,　the　diversity　of　algorithms　also　presents　the　problem　of　difficult　algorithm　selection.　As　the　core　of　greedy　algorithms,　the　difference　of　atomic　recognition　strategy　often　determines　its　recovery　performance.　In　this　paper,　atomic　recognition　strategy,　which　is　the　most　important　part　of　greedy　algorithm,　is　taken　as　the　research　object.　Three　one-step　atom　recognition　strategies,　eight　advanced　atom　recognition　strategies　and　three　sparsity　adaptive　atom　recognition　strategies　are　summarized　according　to　the　applicable　stages　and　characteristics.　Finally,　the　recovery　performance　of　the　original　algorithms　corresponding　to　the　atomic　recognition　strategies　are　simulated　and　compared.　The　sorted　strategies　are　convenient　for　the　selection　of　algorithms　in　practical　application,　and　they　provide　references　for　the　further　optimization　of　greedy　algorithms.　©　2023　Science　Press.　All　rights　reserved.