The present application provides a method of corner detection and an image processing system for detecting corners in an image. The preferred implementation is in software using enabling and reusable hardware features in the underlying vector processor architecture. The advantage of this combined so
The present application provides a method of corner detection and an image processing system for detecting corners in an image. The preferred implementation is in software using enabling and reusable hardware features in the underlying vector processor architecture. The advantage of this combined software and programmable processor datapath hardware is that the same hardware used for the FAST algorithm can also be readily applied to a variety of other computational tasks, not limited to image processing.
대표청구항▼
1. An image processing method for determining whether a candidate pixel within an image is a corner, the method comprising the steps of: selecting pixels in a pattern around the candidate pixel;performing a first determination that comprises determining a first number of pixels within the selected p
1. An image processing method for determining whether a candidate pixel within an image is a corner, the method comprising the steps of: selecting pixels in a pattern around the candidate pixel;performing a first determination that comprises determining a first number of pixels within the selected pixels which exceed the value of the candidate pixel by a threshold value;performing a second determination that comprises determining a second number of pixels within the selected pixels which are less than the value of the candidate pixel by the threshold value;using the first determination or the second determination to construct a vector entry where the bits in the vector entry correspond to the individual determinations for the selected pixels; andperforming a comparison between the vector entry and a series of predefined patterns representative of a corner by performing a bitwise AND operation between the vector entry and each of the individual patterns of the series, wherein a corner is identified by the vector entry matching any of the patterns in the series. 2. The image processing method according to claim 1, wherein the comparison between the series of patterns and the vector entry is only performed when the first number of pixels or the second number of pixels exceeds a predefined number N. 3. The image processing method according to claim 2, wherein an election is made between the use of the results from the first determination and the second determination for use in the construction of the vector entry based on whether the first number of pixels or the second number of pixels exceeded the predefined number N. 4. The image processing method according to claim 1, wherein each pattern in the series represents a different placement of a predefined number of contiguous bits in the pattern. 5. The image processing method according to claim 1, wherein the number of selected pixels in the pattern around the candidate pixel is 16. 6. The image processing method according to claim 1, further comprising: performing a vector score for the candidate corner pixel representing the absolute difference between the candidate pixel and surrounding individual pixels, wherein a mask is used to eliminate surrounding pixels when the difference between the surrounding pixel and the candidate pixel is less than the threshold value. 7. The image processing method according to claim 6, wherein the vector-score is employed to preferentially select between a close group of candidate corner pixels. 8. The image processing method according to claim 1, further comprising: prior to performing the first determination and the second determination, performing a pre-screening process, the pre-screening process comprising: performing individual comparisons between the candidate pixel and a non-contiguous set of pixels to determine whether each individual pixel is within a threshold value of the candidate pixel, andperforming a count of the number of pixels that are within the threshold value of the candidate pixel;wherein performing the first determination and the second determination only occurs if the count exceeds a minimum value. 9. The image processing method according to claim 1, further comprising: prior to performing the first determination and the second determination, performing comparisons between the candidate pixel and a non-contiguous set of pixels about the candidate pixel, wherein the first determination and the second determination is performed based on the result of the comparison. 10. The image processing method according to claim 1, further comprising: reducing the size of a candidate set of pixels in an image for corner detection, by performing a test on each candidate pixel in the candidate set, the test comprising: performing comparisons between each candidate pixel and a non-contiguous set of pixels about the pixel,performing a count of the result of the comparisons for each candidate pixel, andeliminating those candidate pixels from the candidate set having a count less than a threshold to generate a reduced candidate set; andselectively performing all steps of claim 1 on each candidate pixel in the reduced candidate set. 11. The processor being arranged to operate upon data in vector form, wherein the processor is configured to perform the method of claim 1. 12. An image processing method for determining whether a candidate pixel within an image is a corner, the method comprising the steps of: selecting pixels in a pattern around the candidate pixel;performing individual comparisons between the candidate pixel and a non-contiguous set of pixels to determine whether each individual pixel is within a threshold value of the candidate pixel;performing a count of the number of pixels that are within the threshold value of the candidate pixel; andif the count exceeds a minimum value: performing a first determination that comprises determining a first number of pixels within the selected pixels which exceed the value of the candidate pixel by a threshold value,performing a second determination that comprises determining a second number of pixels within the selected pixels which are less than the value of the candidate pixel by the threshold value,using the first determination or the second determination to construct a vector entry where the bits in the vector entry correspond to the individual determinations for the selected pixels, andperforming a comparison between the vector entry and a series of predefined patterns representative of a corner, wherein a corner is identified by the vector entry matching any of the patterns in the series. 13. The image processing method according to claim 12, wherein the comparison between the series of patterns and the vector entry is only performed when the first number of pixels or the second number of pixels exceeds a predefined number N. 14. The image processing method according to claim 13, wherein an election is made between the use of the results from the first determination and the second determination for use in the construction of the vector entry based on whether the first number of pixels or the second number of pixels exceeded the predefined number N. 15. The image processing method according to claim 12, wherein each pattern in the series represents a different placement of a predefined number of contiguous bits in the pattern. 16. The image processing method according to claim 12, wherein the number of selected pixels in the pattern around the candidate pixel is 16. 17. The image processing method according to claim 12, further comprising: performing a vector score for the candidate corner pixel representing the absolute difference between the candidate pixel and surrounding individual pixels, wherein a mask is used to eliminate surrounding pixels when the difference between the surrounding pixel and the candidate pixel is less than the threshold value. 18. The image processing method according to claim 17, wherein the vector-score is employed to preferentially select between a close group of candidate corner pixels. 19. An image processing method for determining whether at least one pixel of a candidate set within an image is a corner, the method comprising the steps of: performing comparisons between each candidate pixel of the candidate set and a non-contiguous set of pixels about the pixel;performing a count of the result of the comparisons for each candidate pixel;eliminating those candidate pixels from the candidate set having a count less than a threshold to generate a reduced candidate set;selecting pixels in a pattern around a candidate pixel of the reduced candidate set;performing a first determination that comprises determining a first number of pixels within the selected pixels which exceed the value of the candidate pixel by a threshold value;performing a second determination that comprises determining a second number of pixels within the selected pixels which are less than the value of the candidate pixel by the threshold value;using the first determination or the second determination to construct a vector entry where the bits in the vector entry correspond to the individual determinations for the selected pixels; andperforming a comparison between the vector entry and a series of predefined patterns representative of a corner, wherein a corner is identified by the vector entry matching any of the patterns in the series. 20. An image processing method for determining whether a candidate pixel within an image is a corner, the method comprising the steps of: selecting pixels in a pattern around the candidate pixel;performing a first determination that comprises determining a first number of pixels within the selected pixels which exceed the value of the candidate pixel by a threshold value;performing a second determination that comprises determining a second number of pixels within the selected pixels which are less than the value of the candidate pixel by the threshold value;using the first determination or the second determination to construct a vector entry where the bits in the vector entry correspond to the individual determinations for the selected pixels; andperforming a comparison between the vector entry and a series of predefined patterns representative of a corner, wherein a corner is identified by the vector entry matching any of the patterns in the series,wherein the comparison between the series of patterns and the vector entry is only performed when the first number of pixels or the second number of pixels exceeds a predefined number N,wherein an election is made between the use of the results from the first determination and the second determination for use in the construction of the vector entry based on whether the first number of pixels or the second number of pixels exceeded the predefined number N.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (34)
Comair, Claude; Li, Xin; Abou-Samra, Samir; Champagne, Robert; Fam, Sun Tjen; Ghali, Prasanna; Pan, Jun, 3D transformation matrix compression and decompression.
Seong,Nak hee; Lim,Kyoung mook; Jeong,Seh woong; Park,Jae hong; Im,Hyung jun; Bae,Gun young; Kim,Young duck, Apparatus and method for dispatching very long instruction word having variable length.
Iwata Yasushi,JPX ; Asato Akira,JPX, Data processing device to compress and decompress VLIW instructions by selectively storing non-branch NOP instructions.
Pitsianis,Nikos P.; Pechanek,Gerald George; Rodriguez,Ricardo, Efficient complex multiplication and fast fourier transform (FFT) implementation on the ManArray architecture.
Pitsianis, Nikos P.; Pechanek, Gerald G.; Rodriguez, Ricardo E., Efficient complex multiplication and fast fourier transform (FFT) implementation on the manarray architecture.
Coleman Charles H. (Redwood City CA) Miller Sidney D. (Mountain View CA) Smidth Peter (Menlo Park CA), Method and apparatus for image data compression using combined luminance/chrominance coding.
Gerald G. Pechanek ; Juan Guillermo Revilla ; Edwin F. Barry, Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor.
Pechanek Gerald G. ; Revilla Juan Guillermo ; Barry Edwin F., Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor.
Pechanek, Gerald G.; Revilla, Juan Guillermo; Barry, Edwin Franklin, Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor.
Drabenstott, Thomas L.; Pechanek, Gerald G.; Barry, Edwin F.; Kurak, Jr., Charles W., Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution.
Drabenstott, Thomas L.; Pechanek, Gerald G.; Barry, Edwin F.; Kurak, Jr., Charles W., Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution.
Drabenstott,Thomas L.; Pechanek,Gerald George; Barry,Edwin Franklin; Kurak, Jr.,Charles W., Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution.
Drabenstott,Thomas L.; Penchanek,Gerald G.; Barry,Edwin F.; Kurak, Jr.,Charles W., Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution.
Thomas L. Drabenstott ; Gerald G. Pechanek ; Edwin F. Barry ; Charles W. Kurak, Jr., Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution.
Hall William E. (Beaverton OR) Stigers Dale A. (Hillsboro OR) Decker Leslie F. (Portland OR), Parallel vector processing system for individual and broadcast distribution of operands and control information.
Topham,Nigel Peter, Processor and method for generating and storing compressed instructions in a program memory and decompressed instructions in an instruction cache wherein the decompressed instructions are assigned im.
Topham,Nigel Peter, Processor and method for generating and storing compressed instructions in a program memory and decompressed instructions in an instruction cache wherein the decompressed instructions are assigned imaginary addresses derived from information stored in the program memory with the compressed instructions.
Booth, Jr.,Lawrence A.; Rosenzweig,Joel; Burr,Jeremy, System and method for high-speed communications between an application processor and coprocessor.
Haikonen Pentti,FIX ; Juhola Janne M.,FIX ; Latva-Rasku Petri,FIX, Video compressing method wherein the direction and location of contours within image blocks are defined using a binary picture of the block.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.