[특허]High speed signal enhancement using pixons

Pixon LLC

검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
검색연산자

검색연산자	기능	검색시 예
()	우선순위가 가장 높은 연산자	예1) (나노 (기계 \| machine))
공백	두 개의 검색어(식)을 모두 포함하고 있는 문서 검색	예1) (나노 기계) 예2) 나노 장영실
\|	두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색	예1) (줄기세포 \| 면역) 예2) 줄기세포 \| 장영실
!	NOT 이후에 있는 검색어가 포함된 문서는 제외	예1) (황금 !백금) 예2) !image
*	검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색	예) semi*
""	따옴표 내의 구문과 완전히 일치하는 문서만 검색	예) "Transform and Quantization"

과학기술 지식인프라 ScienceON

특허 상세정보

MyON담기

내보내기

High speed signal enhancement using pixons

국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	G06K-009/40 G06K-009/56 G06K-009/54
미국특허분류(USC)	382/265; 382/205; 382/275
출원번호	US-0041253 (2002-01-04)
발명자 / 주소	Yahil,Amos Puetter,Richard
출원인 / 주소	Pixon LLC
대리인 / 주소	Procopio Cory Hargreaves &
인용정보	피인용 횟수 : 34 인용 특허 : 23

초록
▼

Input data comprising a video signal is processed using a combination of a known image processing method to deblur, or sharpen, the image and convolution with Pixon짰 kernels for smoothing. The smoothing process utilizes a plurality of different size Pixon짰 kernels which operate in parallel so that the input data are convolved with each different Pixon짰 kernel simultaneously. The smoothed image is convolved with the point response function (PRF) to form data models that are compared against the input data, then the broadest Pixon짰 kernel that fits the input data within a predetermined criterion are selected to form a Pixon짰 map. The data are smoothed and assembled according to the Pixon짰 map, then are deconvolved and output to a video display or other appropriate device, providing a clearer image with less noise.

대표
청구항
▼

We claim: 1. A method for high speed enhancement of a video image comprising: inputting a signal containing input data corresponding to a frame of the video image, the input data comprising a plurality of data points on a grid; convolving the input data with each kernel of a plurality of different sized kernels to generate a plurality of convolved data sets; determining a change in data between the input data and each convolved data set of the plurality; comparing the change to a fit criterion; selecting the broadest kernel of the plurality of different sized kernels that satisfies the fit criterion for each portion of the plurality of data points; identifying indices within the grid for the selected kernels corresponding to each portion of data points and assembling a kernel map using the indices; assembling the convolved data according to the kernel map to produce smoothed data; deblurring the smoothed data for form a reconstructed image; and outputting the reconstructed image to a video display device. 2. The method of claim 1, wherein the input signal comprises a luminance component of a standard NTSC video stream and the reconstructed image is an enhanced luminance signal. 3. The method of claim 2, wherein, prior to outputting the image to a video display device, the enhanced luminance signal is merged with a chrominance component of the standard NTSC video stream. 4. The method of claim 3, wherein the chrominance component is synchronized with the enhanced luminance signal. 5. The method of claim 2, wherein the NTSC video stream is de-interlaced. 6. The method of claim 5, wherein the image is interlaced prior to output to a video display device. 7. The method of claim 1, wherein the step of deblurring comprises convolving the smoothed image with an approximate inverse point response function. 8. The method of claim 7, wherein the approximate inverse point response function is obtained by minimizing an optimization function of the form: where δi0 is a residual point response function, Hi-j is a point response function, fj is the approximate inverse point response function, λ is an adjustable parameter that sets a tradeoff between resolution gain and noise amplification, and μ is a Lagrange multiplier. 9. The method of claim 1, wherein the change is determined according to the relationship fj =|{tilde over (H)}{circle around (x)}Dj |, where {tilde over (H)} is a broadened point response function (PRF), Dj is the convolved data that was convolved by kernel j, and {circle around (x)} is the convolution operator. 10. The method of claim 9, wherein the fit criterion is f j≦α쨌σ, where α is a variable kernel map smoothness control and σ is the standard deviation of noise in the input image. 11. The method of claim 1, wherein the step of convolving the input data is performed in parallel by all kernels of the plurality of kernels. 12. A method for image reconstruction comprising: (a) receiving input data corresponding to at least one input image, the input data comprising a plurality of data points on a grid; (b) smoothing the at least one input image according to a kernel map comprising selected kernels from a plurality of different kernels, wherein the selected kernels are selected by: (i) convolving the input data with each kernel of the plurality of kernels, wherein each kernel has a different size for encompassing different portions of the plurality of data points and generating convolved data corresponding to each kernel; (ii) for each kernel, determining a change from the input data to the convolved data; (iii) comparing the change to a fit criterion; (iv) selecting the broadest kernel of the plurality of kernels that satisfies the fit criterion for a portion of the plurality of data points; (v) identifying indices within the grid for the selected kernels corresponding to the portion of data points and assembling the kernel map using the indices; (c) before or after the step of smoothing, deblurring the image to form a deblurred image, wherein, if deblurring occurs after the step of smoothing, the smoothed image is deblurred; and if deblurring occurs before the step of smoothing, the deblurred image is smoothed; and (d) outputting a reconstructed image comprising the deblurred and smoothed image to a display device. 13. The method of claim 12, wherein the plurality of kernels comprises 5 to 7 different kernel sizes. 14. The method of claim 12, wherein the step of deblurring comprises convolving the smoothed image with an approximate inverse point response function (PRF). 15. The method of claim 14, wherein the approximate inverse point response function (PRF) is a minimized optimization function which is minimized by minimizing the difference between a deconvolved PRF and a residual PRF, minimizing noise amplification, and normalizing the optimized small kernel deconvolver. 16. The method of claim 12, wherein the step of deblurring comprises convolving the input image with an approximate inverse point response function (PRF). 17. The method of claim 12, wherein the at least one input image comprising at least one video frame. 18. The method of claim 17, wherein the at least one input image comprises a plurality of image frames, and further comprising coadding the data from each image frame to produce the input data. 19. The method of claim 17, wherein the input data comprises a luminance component of a video image frame of a standard NTSC video stream and further comprising, before the step of receiving, dividing the video image frame into the luminance component and a chrominance component. 20. The method of claim 19, wherein the reconstructed image is an enhanced luminance signal. 21. The method of claim 17, wherein the display device is a video display device and further comprising, prior to outputting the image to the video display device, merging the enhanced luminance signal with the chrominance component. 22. The method of claim 21, further comprising synchronizing the chrominance component with the enhanced luminance signal prior to the step of merging. 23. The method of claim 12, wherein steps (b)(i) and (b)(ii) are performed in parallel by all kernels of the plurality of different kernels. 24. A system for high speed enhancement of a video image comprising: an input for inputting a signal containing input data corresponding to a frame of the video image, the input data comprising a plurality of data points on a grid; a processor for convolving the input data with each kernel of a plurality of different sized kernels, assembling a kernel map by selecting the broadest kernel of the plurality of different sized kernels that satisfies a fit criterion for each portion of the plurality of data points, and smoothing the input data in accordance with the kernel map to generate smoothed data; an image processing function within the processor for deblurring the smoothed data for form a reconstructed image; and a video display device for receiving and displaying the reconstructed image. 25. The system of claim 24, wherein the input signal comprises a luminance component of a standard NTSC video stream and the reconstructed image is an enhanced luminance signal. 26. The system of claim 25, further comprising a switch for combining the enhanced luminance signal with a chrominance component of the standard NTSC video stream. 27. The system of claim 26, further comprising a delay element for synchronizing the chrominance component with the enhanced luminance signal. 28. The system of claim 26, further comprising a de-interlacer for de-interlacing the NTSC video stream prior to processing the luminance component. 29. The system of claim 28, further comprising an interlacer for interlacing the combined enhanced luminance signal and the chrominance component prior to output to the video display device. 30. The system of claim 24, wherein the image processing function comprises an approximate inverse point response function. 31. The system of claim 30, wherein the approximate inverse point response function is obtained by minimizing an optimization function of the form: where δi0 is a residual point response function, Hi-j is a point response function, fj is the approximate inverse point response function, λ is an adjustable parameter that sets a tradeoff between resolution gain and noise amplification, and μ is a Lagrange multiplier. 32. The system of claim 24, further comprising a user interface for inputting selections for standard deviation and smoothness of the kernels. 33. The system of claim 24, wherein the processor convolves the input data in parallel, simultaneously using all kernels of the plurality of different kernels.

이 특허에 인용된 특허 (23)

이 특허를 인용한 특허 피인용횟수: 34

IPC 상위 출원인

내보내기

상세정보
내보내기 구분	파일저장 인쇄 메일전송
구성항목	관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	> 총 건의 자료가 검색되었습니다. > 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) > 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. > 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) > 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오 > ~ > Text(ASCII format) Excel format

과학기술 지식인프라 ScienceON

ScienceON Chatbot

특허 상세정보

High speed signal enhancement using pixons

초록
▼

대표
청구항
▼

이 특허에 인용된 특허 (23)

이 특허를 인용한 특허 피인용횟수: 34

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

ScienceON Chatbot

특허 상세정보

High speed signal enhancement using pixons

초록 ▼

대표청구항 ▼

이 특허에 인용된 특허 (23)

이 특허를 인용한 특허 피인용횟수: 34

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

초록
▼

대표
청구항
▼