Quantum　image　processing　has　been　a　hot　topic　as　a　consequence　of　the　development　of　quantum　computation.　Many　quantum　image　processing　algorithms　have　been　proposed,　whose　efficiency　are　theoretically　higher　than　their　corresponding　classical　algorithms.　However,　most　of　the　quantum　schemes　do　not　consider　the　problem　of　measurement.　If　users　want　to　get　the　results,　they　must　measure　the　final　state　many　times　to　get　all　the　pixels＇　values.　Moreover,　executing　the　algorithm　one　time,　users　can　only　measure　the　final　state　one　time.　In　order　to　measure　it　many　times,　users　must　execute　the　algorithms　many　times.　If　the　measurement　process　is　taken　into　account,　whether　or　not　the　algorithms　are　really　efficient　needs　to　be　reconsidered.　In　this　paper,　we　try　to　solve　the　problem　of　measurement　and　give　a　quantum　image　location　algorithm.　This　scheme　modifies　the　probability　of　pixels　to　make　the　target　pixel　to　be　measured　with　higher　probability.　Furthermore,　it　only　has　linear　complexity.