Patent application number | Description | Published |
20080275479 | ANASTOMOTIC SEAL LOADING TOOL - Described herein are methods and devices for loading an anastomotic seal into a delivery lumen. A loading device can fold the seal into a configuration for insertion into the delivery lumen. For example, the loading device can fold the seal into a prolate spheroidal shape. The delivery lumen can then be inserted into the loading device and mated with the folded seal. | 11-06-2008 |
20080275501 | MEDICAL DEVICE LOADING AND DELIVERY SYSTEMS AND METHODS - Described herein are systems and methods for inserting a hemostatic seal into a delivery device. One such system can include a loading tool and a delivery device configured to detachably mate with one another. The loading tool can house a hemostatic seal in its unfolded configuration and can fold the seal for delivery into the delivery device. The delivery device can then be advanced into the loading tool to insert the seal into the delivery device. | 11-06-2008 |
20080306335 | Endoscopic vessel harvesting system components - Components for an endoscopic vessel harvesting system suitable for harvesting target vessels such as the saphenous vein or radial artery for cardiac artery bypass graft surgery. The main components of such systems include a vessel dissector and a vessel harvester, both of which work in conjunction with a separately provided endoscope. The vessel dissector is an elongated cannula having a blunt tip for separating layers of facial around vessels. The tip may be movable, and is typically transparent to permit viewing forward of the tip using the endoscope. Internal features of the tip may reduce glare back to the endoscope. Several devices improve visibility through the tip by reducing interference from tissue or fluid on the tip. The vessel harvester also has an elongated cannula for receiving the endoscope. Several tools within the harvester permit manipulation, severing, and sealing of vessels forward of the distal end. The tool for manipulating vessels may have a low-profile for increased visibility of operation, and may be coupled to the cannula with a damping mechanism to reduce the possibility of avulsion of the vessels. Various vessel cutting and sealing devices are provided that may accommodate various sizes of vessels and improve cutting and sealing efficacy. | 12-11-2008 |
20090043243 | METHODS AND DEVICES FOR LOADING TEMPORARY HEMOSTATIC SEALS - Disclosed herein are methods, devices, and systems for folding a sealing element. A loader can receive a substantially unfolded sealing element, which when moved through the loader is configured for receipt in an insertion instrument. For example, the sealing element can be folded into a substantially prolate spheroidal shape. The folded sealing element can then be inserted into the insertion instrument. In one aspect, the loader is adapted to allow insertion of the folded sealing element into the insertion instrument when the folded sealing element is within a channel of the loader. | 02-12-2009 |
20110046624 | SINGLE HANDLED ENDOSCOPIC VESSEL HARVESTING SYSTEM WITH ROTATION CONTROL - A surgical instrument includes an elongated tube having a proximal end and a distal end, a handle coupled to the proximal end of the tube, and a tool that is rotatable and translatable relative to the tube, wherein the handle includes a control for rotating the tool relative to the tube, and wherein the control is coupled to the tool such that a movement of the control through an angle θ | 02-24-2011 |
20110257643 | APPARATUS AND METHOD FOR REGULATING TISSUE WELDER JAWS - A surgical apparatus and methods for severing and welding tissue, in particular blood vessels. The apparatus includes an elongated shaft having a pair of relatively movable jaws at a distal end thereof. A first heating element on one of the jaws is adapted to heat up to a first temperature and form a welded region within the tissue, while a second heating element on one of the jaws is adapted to heat up to a second temperature and sever the tissue within the welded region. The first and second heating elements may be provided on the same or opposite jaws. A control handle provided on the proximal end of the elongated shaft includes controls for opening and closing the jaws, and may include an actuator for sending current through the first and second heating elements. The first and second heating elements may be electrically connected in series, and the first heating element may be bifurcated such that it conducts about one half of the current as the second heating element. A force-limiting mechanism provided either within the control handle, in the elongated shaft, or at the jaws limits the pressure applied to the tissue by the jaws to ensure that the tissue is severed and the ends effectively welded within a short amount of time. | 10-20-2011 |
20120046677 | MODULAR VESSEL HARVESTING SYSTEM AND METHOD - A vessel harvesting system that is suitable for harvesting target vessels such as the saphenous vein or radial artery for cardiac artery bypass graft surgery. The system includes a vessel harvesting tool with an elongated cannula and a plurality of surgical instruments therein for separating the target vessels from the surrounding tissue and side branches. The harvesting tool includes a modular handle unit with a base attached to the elongated cannula and a sled that can adapt the base to various types of vessel severing/securing tools, such as tissue welders, bipolar scissors, and bipolar bisectors. The handle unit may be relatively rigid and integrated with the various tool movement controls to facilitate one-handed operation by a user. A severing/securing tool rotation mechanism may be incorporated within the handle and operated by a thumbwheel or other such mechanism. The vessel harvesting system may also provide distal CO | 02-23-2012 |
20120071856 | Medical Device and Method for Treatment of a Sinus Opening - A medical device and method for the treatment of a sinus opening includes a handle, a guide catheter, a guide wire, a balloon catheter, a guide wire movement mechanism and a balloon catheter movement mechanism. The handle has proximal and distal ends and a longitudinal axis along the length of the handle. The guide catheter is attached to the distal end of the handle and has a catheter lumen. The guide wire and balloon catheter are both disposed at least partially in the handle and catheter lumen. The guide wire movement mechanism and the balloon catheter movement mechanism are both operatively disposed on the handle. In addition, the guide wire movement mechanism is configured for advancement and retraction of the guide wire through the handle and catheter lumen by user operation of the guide wire movement mechanism. Moreover, the guide wire movement mechanism includes an integrated guide wire locking and rotation mechanism configured for rotation of the guide wire and for securely locking and unlocking the guide wire to the guide wire movement mechanism. Furthermore, the balloon catheter movement mechanism is configured for advancement and retraction of the balloon catheter through the handle and catheter lumen by user operation of the balloon catheter movement mechanism. | 03-22-2012 |
20120316550 | TISSUE WELDING AND CUTTING APPARATUS AND METHOD - A surgical apparatus includes an elongated shaft having a pair of relatively movable jaws at a distal end thereof. A first heating element on one of the jaws is adapted to heat up to a first temperature and form a welded region within the tissue, while a second heating element on one of the jaws is adapted to heat up to a second temperature and sever the tissue within the welded region. The first and second heating elements may be provided on the same or opposite jaws. A control handle provided on the proximal end of the elongated shaft includes controls for opening and closing the jaws, and may include an actuator for sending current through the first and second heating elements. The first and second heating elements may be electrically connected in series. | 12-13-2012 |
20130018373 | APPARATUS AND METHOD FOR REGULATING TISSUE WELDER JAWS - A surgical apparatus and methods for severing and welding tissue, in particular blood vessels. The apparatus includes an elongated shaft having a pair of relatively movable jaws at a distal end thereof. A first heating element on one of the jaws is adapted to heat up to a first temperature and form a welded region within the tissue, while a second heating element on one of the jaws is adapted to heat up to a second temperature and sever the tissue within the welded region. The first and second heating elements may be provided on the same or opposite jaws. A control handle provided on the proximal end of the elongated shaft includes controls for opening and closing the jaws, and may include an actuator for sending current through the first and second heating elements. The first and second heating elements may be electrically connected in series, and the first heating element may be bifurcated such that it conducts about one half of the current as the second heating element. A force-limiting mechanism provided either within the control handle, in the elongated shaft, or at the jaws limits the pressure applied to the tissue by the jaws to ensure that the tissue is severed and the ends effectively welded within a short amount of time. | 01-17-2013 |
20130184574 | DEVICES AND METHODS FOR TRANSNASAL IRRIGATION OR SUCTIONING OF THE SINUSES - An irrigation catheter for the treatment of the sinus anatomy is described. The catheter comprises a proximal portion, a rigid middle portion, and a flexible distal portion. The flexible distal portion comprises an irrigation tip and the proximal portion has a stiffness that is intermediate the stiffness of the rigid middle portion and the flexible distal portion. The irrigation tip has a tip opening and one or more radially facing openings. A method for irrigating or suctioning the sinus anatomy includes inserting an irrigation catheter into a patient's anatomy and irrigating or suctioning a target space. | 07-18-2013 |
20140107427 | Balloon Dilation Catheter System for Treatment and Irrigation of the Sinuses - A medical device for the treatment and irrigation of a sinus opening is described. The device allows for single-handed operation to access, dilate and irrigate a sinus opening. The device includes a sinus guide catheter, a guiding element, a balloon dilation catheter, a balloon catheter movement mechanism and a guiding element movement mechanism. A method for treating a sinus opening and irrigating a sinus is also described. | 04-17-2014 |
20140194876 | APPARATUS AND METHOD FOR REGULATING TISSUE WELDER JAWS - A surgical apparatus and methods for severing and welding tissue, in particular blood vessels. The apparatus includes an elongated shaft having a pair of relatively movable jaws at a distal end thereof. A first heating element on one of the jaws is adapted to heat up to a first temperature and form a welded region within the tissue, while a second heating element on one of the jaws is adapted to heat up to a second temperature and sever the tissue within the welded region. The first and second heating elements may be provided on the same or opposite jaws. A control handle provided on the proximal end of the elongated shaft includes controls for opening and closing the jaws, and may include an actuator for sending current through the first and second heating elements. The first and second heating elements may be electrically connected in series, and the first heating element may be bifurcated such that it conducts about one half of the current as the second heating element. A force-limiting mechanism provided either within the control handle, in the elongated shaft, or at the jaws limits the pressure applied to the tissue by the jaws to ensure that the tissue is severed and the ends effectively welded within a short amount of time. | 07-10-2014 |
20150119923 | Enhanced Gripping Features for Nasal and Paranasal Sinus Systems - A gripping system for use in treating the sinus cavity is described. The system includes a handle for single handed operation that includes access to the sinus cavity and treatment by dilation of an anatomical passageway within the ear, nose or throat. The handle contains a guide catheter or seeker for proper placement of the system and further includes a balloon catheter cartridge for treatment of the cavity. The handle may further contain a guidewire cartridge to ensure proper access of the cavity or a stabilizing feature for incorporation of an endoscope. | 04-30-2015 |
20150142041 | APPARATUS AND METHODS FOR PERFORMING MINIMALLY-INVASIVE SURGICAL PROCEDURES - Devices, tools and methods for performing minimally invasive surgical procedures. Methods of performing minimally invasive ablation procedures. Methods of performing rapid exchange of tools in a device while the device remains in a reduced-access surgical space. | 05-21-2015 |
20160058985 | AUTOMATED INFLATOR FOR BALLOON DILATOR - An inflator system comprises a dilation catheter and a fluid pressure regulator assembly. The dilation catheter comprises a shaft defining a lumen and being sized to fit within an anatomical passageway. The dilation catheter further comprises a dilator configured to receive fluid through the lumen and thereby expand in response to fluid communicated through the lumen. The fluid pressure regulator assembly comprises a pump in fluid communication with the dilation catheter. The fluid pressure regulator assembly further comprises a control module configured to store one or more fluid pressure profiles and is operable to receive a selection of a particular fluid pressure profile from the one or more of fluid pressure profiles. The control module is operable to selectively drive the pump in accordance with a selected fluid pressure profile. The fluid pressure regulator assembly further comprises a user input feature operable to selectively activate the control module. | 03-03-2016 |
20160058988 | INFLATOR WITH VARYING MECHANICAL ADVANTAGE - An inflator comprises a body, a first drive member, and a second drive member. The body defines a reservoir that is configured to hold fluid and includes an outlet. The first drive member is operable to move through the reservoir to drive fluid from the reservoir through the outlet. The second drive member is engaged with the first drive member. The second drive member is movable relative to the body through a first range of motion to actuate the first drive member to drive fluid through the outlet at a first rate. The second drive member is movable relative to the body through a second range of motion following the second range of motion. The first drive member is configured to either drive fluid through the outlet at a second rate or not drive fluid through the outlet as the second drive member moves through the second range of motion. | 03-03-2016 |
20160082233 | BALLOON CATHETER ASSEMBLY - A dilation catheter comprises a handle, a guidewire, a dilation catheter, a guidewire movement mechanism, and dilation catheter movement actuator. The guidewire movement mechanism is configured to translate to thereby cause translation of the guidewire relative to the handle. The dilation catheter movement mechanism is configured to translate to thereby cause translation of the dilation catheter relative to the handle. The guidewire movement mechanism also includes a rotation mechanism configured to impart rotation upon the guidewire. The rotation mechanism may include features configured to limit the amount that the guidewire may rotate. The rotation mechanism may also include features configured to convert linear movement of an actuator into rotational movement of the guidewire. The dilation catheter may include features configured to provide for side entry of the guidewire into the dilation catheter. | 03-24-2016 |
Patent application number | Description | Published |
20120044000 | Method and Apparatus for Accurate Clock Synthesis - Methods and apparatus are provided in the present invention to adjust the frequency of an output clock close to within a required accuracy of an oscillation frequency. In another embodiment, a method comprises: entering a calibration mode; generating a first control word to control a timing of a clock synthesizer; adjusting the first control word until the timing of the clock synthesizer is sufficiently accurate with respect to a timing of a reference clock; sensing a temperature using a temperature sensor; storing a present value of an output of the temperature sensor and the first control word into a non-volatile memory; exiting the calibration mode; entering a normal operation mode; sensing the temperature using the temperature sensor; generating a second control word to control the timing of the clock synthesizer in accordance with an output of the non-volatile memory and the output of the temperature sensor. | 02-23-2012 |
20140118047 | Method and Apparatus for Clock Transmission - Apparatus and methods are provided for an extraction circuit. In one configuration, an apparatus includes: an edge extraction circuit for receiving a first clock signal and outputting a second clock signal, wherein a duty cycle of the second clock is substantially smaller than a duty cycle of the first clock; a transistor for receiving the second clock signal and outputting a current signal; a transmission line for receiving the current signal on a first end and transmitting the current signal to a second end; a termination circuit for receiving the current signal at the second end and converting the current signal into a voltage signal; and an edge detection circuit for outputting a third clock by detecting an edge of the voltage signal. In one embodiment, the edge detection circuit comprises an inverter. In another embodiment, the edge detection circuit comprises a comparator. | 05-01-2014 |
20150180412 | CONTROLLABLE OSCILLATOR AND METHOD THEREOF - An apparatus and related method include a voltage-mode biasing network for receiving a reference current and outputting a biasing voltage, and an oscillator core for receiving the biasing voltage and sustaining an oscillation, wherein the voltage-mode biasing network comprises a current-to-voltage converter for converting the reference current into a reference voltage, a low-pass filter for filtering the reference voltage into a filtered reference voltage, and a source follower for receiving the filtered reference voltage and outputting a biasing voltage. The oscillator core comprises a resonator coupled to a regenerative network. In an embodiment, the current-to-voltage converter comprises at least a diode-connected transistor. | 06-25-2015 |
20150244367 | Method and Apparatus for Equalizing a Level Shifted Signal - A method and apparatus are provided for equalizing an output of a level shifter so as to obtain a symmetrical transition. In one implementation, a transition equalizing inverter includes: an NMOS for establishing a high-to-low transition for an equalized signal in response to a low-to-high transition of an asymmetrical signal; a delay circuit for outputting a delayed signal in response to the asymmetrical signal; and a PMOS for establishing a low-to-high transition for the equalized signal in response to a high-to-low transition of the delayed signal, wherein a delay introduced by the delay circuit offsets a timing mismatch between a low-to-high transition and a high-to-low transition of the asymmetrical signal. In an embodiment, the delay circuit comprises a transmission gate. A corresponding method is also provided. | 08-27-2015 |
20150295538 | LOW-VOLTAGE AMPLIFIER AND METHOD THEREOF - An amplifier is provided having a first mixed-length MOS device set for receiving an input signal and outputting an output signal, and a first load for providing termination for the output signal, wherein the first mixed-length MOS device set comprises a parallel connection of a plurality of MOS devices having different channel lengths including at least a short channel length MOS device and a long channel length MOS device. In one configuration, a threshold voltage of the short channel length MOS device is greater than a threshold voltage of the long channel length MOS device. A related method is also provided. | 10-15-2015 |
20150349794 | SELF-CALIBRATING VCO-BASED ANALOG-TO-DIGITAL CONVERTER AND METHOD THEREOF - A circuit includes an input dispatch unit for receiving an input signal and a calibration signal and outputting N dispatched signals in accordance with a selection signal. The circuit also includes N analog-to-digital converter (ADC) units for receiving the N dispatched signals, N control signals, and N mapping tables and outputting N raw data, and N refined data, respectively. An output dispatch unit receives the N refined data and outputting an output data in accordance with the selection signal, and a calibration controller receives the N raw data and outputting the selection signal, the N control signals, the N mapping tables, and a digital code. A DAC (digital-to-analog converter) receives the digital code and outputting the calibration signal, wherein one of the dispatched signals, as specified by the selection signal is from the calibration signal while the other dispatched signals are from the input signal. | 12-03-2015 |
20150358017 | METHOD AND APPARATUS FOR REDUCING POWER BOUNCING OF INTEGRATED CIRCUITS - A circuit is provided having a core circuit for sinking a first current from a first internal power supply node, a power bouncing reduction circuit for receiving power from a second internal power supply node and sourcing a second current to the first internal power supply node in accordance with a change of voltage at the first internal power supply node, and a package for coupling the first internal power supply node and the second internal power supply node to a first external power supply node and a second external power supply node, respectively. A corresponding method is also provided. | 12-10-2015 |
20160006420 | QUADRATURE OUTPUT RING OSCILLATOR AND METHOD THEREOF - Various circuits are described, which sustain an oscillation using a combination of four primary inverters, four feedforward inverters, and four coupling resistors for outputting a quadrature output signal while avoiding contention between a primary inverter and a feedforward inverter. In one configuration, a circuit includes four primary inverters configured in a ring topology, four coupling resistors uniformly interposed in the ring among the four primary inverters, and four feedforward inverters forming four sub-feedback loops, respectively, each sub-feedback loop comprising two primary inverters, one coupling resistor, and one feedforward inverter. In a further embodiment, the circuit further comprises a voltage-to-current converter is for receiving a control voltage and outputting a supply current to the four primary inverters and the four feedforward inverters. A corresponding method is also provided. | 01-07-2016 |
20160036419 | METHOD AND APPARATUS FOR CALIBRATING CMOS INVERTER - A circuit and method for calibrating CMOS (complementary metal-oxide semiconductor) inverters are provided. In a circuit, a first tunable CMOS inverter, controlled by a control signal, receives a first voltage from a first circuit node and outputs a second voltage to a second circuit node. A second tunable CMOS inverter, controlled by the control signal, receives the second voltage from the second circuit node and outputs the first voltage to the first circuit node. A resistor couples the first circuit node to the second circuit node. A switch, controlled by a reset signal, conditionally shorts the first circuit node to the second circuit node. A finite state machine receives the first voltage and the second voltage and outputs the reset signal and the control signal, wherein the control signal is adjusted based on a difference between the first voltage and the second voltage. | 02-04-2016 |
20160065157 | METHOD AND APPARATUS FOR GAIN ENHANCEMENT OF DIFFERENTIAL AMPLIFIER - A differential amplifier circuit and method having a feed-in network coupling an input signal to an intermediate signal. An amplifier amplifies the intermediate signal by a gain factor to output an output signal to a load network. A feedback network configured in a negative feedback topology and couples the output signal to the intermediate signal. A gain enhancing network is configured in a positive feedback topology and couples the output signal to the intermediate signal. Preferably, an impedance of the gain enhancing network is approximately equal to an impedance of a parallel connection of the feed-in network and the feedback network times the gain factor minus one. | 03-03-2016 |
20160079981 | HIGH-SPEED INVERTER AND METHOD THEREOF - A CMOS (complementary metal oxide semiconductor) inverter includes a PMOS (p-channel metal oxide semiconductor) transistor configured to receive a first input signal via a first input terminal and output a first output signal via a first output terminal, an NMOS (n-channel metal oxide semiconductor) transistor configured to receive a second input signal via a second input terminal and output a second output signal via a second output terminal, and a resistor configured to provide an isolation between the first output signal and the second output signal. In an embodiment, the first input signal is of a fast high-to-low transition but a slow low-to-high transition, and the second input signal is of a fast low-to-high transition but a slow high-to-low transition. A comparative method is also provided. | 03-17-2016 |
20160099722 | METHOD AND APPARATUS FOR CALIBRATING COMPARATOR OFFSET OF SUCCESSIVE-APPROXIMATION-REGISTER ANALOG-TO-DIGITAL CONVERTER - A circuit and method compensates for comparator offset in a successive approximation register analog-to-digital converter. The circuit includes a multiplexed sampler to sample either a common mode voltage or an input signal. The sampled signal is added to a conversion voltage and an offset correction voltage and input to a comparator. The comparator determines a polarity of deviation of the sum of the sampled signal, conversion voltage and off-set correction voltage. Based on the polarity, the offset correction voltage and the conversion voltage are alternately subjected to a successive approximation process to compensate for the offset of the sum from the sampled input signal or sampled common voltage signal. | 04-07-2016 |
Patent application number | Description | Published |
20130034299 | Robust Patch Regression based on In-Place Self-similarity for Image Upscaling - Methods and systems for image upscaling are disclosed. In one embodiment, a low frequency band image intermediate is obtained from an input image. The input image is upsampled by a scale factor to obtain an upsampled image intermediate. A result image is estimated based at least in part on the upsampled image intermediate, the low frequency band image intermediate, and the input image, wherein the input image is of a smaller scale than the result image. | 02-07-2013 |
20130034311 | Denoising and Artifact Removal in Image Upscaling - Methods and systems for denoising and artifact removal in image upscaling are disclosed. In one embodiment, a low frequency band image intermediate is obtained from an input image. An upsampled image intermediate is obtained from the input image by upsampling. A result image is estimated, based at least in part on the upsampled image intermediate, the low frequency band image intermediate, and the input image. The input image is of a smaller scale than the result image. The estimating the result image further includes eliminating from the result image noise that is present in the input image. | 02-07-2013 |
20130034313 | Regression-Based Learning Model for Image Upscaling - Methods and systems for a regression-based learning model in image upscaling are disclosed. In one embodiment, a set of image patch pairs for each of a set of images is generated. Each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image. A regression model based at least in part on the set of image patch pairs is defined. The regression model represents a gradient of a function of the downscaled lower-resolution image. An image is upscaled based at least in part on the regression model. | 02-07-2013 |
20130044947 | Methods and Apparatus for Automated Portrait Retouching Using Facial Feature Localization - Various embodiments of methods and apparatus for facial retouching are disclosed. In one embodiment, a face in an input image is detected. Independent sets of feature points are detected for respective facial feature components. A plurality of masks for each of the facial feature components is generated. Using the plurality of masks, retouch effects are performed to the facial feature components. Some embodiments provide for user interaction to constrain the mask generation. | 02-21-2013 |
20130044958 | Methods and Apparatus for Automated Facial Feature Localization - Various embodiments of methods and apparatus for facial retouching are disclosed. In one embodiment, a face in an input image is detected. One or more transformation parameters for the detected face are estimated based on a profile model. The profile model is applied to obtain a set of feature points for each facial component of the detected face. Global and component-based shape models are applied to generate feature point locations of each facial component of the detected face. | 02-21-2013 |
20130060765 | OBJECT RETRIEVAL AND LOCALIZATION USING A SPATIALLY-CONSTRAINED SIMILARITY MODEL - Methods, apparatus, and computer-readable storage media for object retrieval and localization that employ a spatially-constrained similarity model. A spatially-constrained similarity measure may be evaluated by a voting-based scoring technique. Object retrieval and localization may thus be achieved without post-processing. The spatially-constrained similarity measure may handle object rotation, scaling and view point change. The similarity measure can be efficiently calculated by the voting-based method and integrated with inverted files. The voting-based scoring technique may simultaneously retrieve and localize a query object in a collection of images such as an image database. The object retrieval and localization technique may, for example, be implemented with a k-nearest neighbor (k-NN) re-ranking method in or as a retrieval method, system or module. The k-NN re-ranking method may be applied to improve query results of the object retrieval and localization technique. | 03-07-2013 |
20130060766 | K-NEAREST NEIGHBOR RE-RANKING - Methods, apparatus, and computer-readable storage media for k-NN re-ranking. Based on retrieved images and localized objects, a k-NN re-ranking method may use the k-nearest neighbors of a query to refine query results. Given the top k retrieved images and their localized objects, each k-NN object may be used as a query to perform a search. A database image may have different ranks when using those k-nearest neighbors as queries. Accordingly, a new score for each database image may be collaboratively determined by those ranks, and re-ranking may be performed using the new scores to improve the search results. The k-NN re-ranking technique may be performed two or more times, each time on a new set of k-nearest neighbors, to further refine the search results. | 03-07-2013 |
20130071040 | High-Quality Upscaling of an Image Sequence - A method, system, and computer-readable storage medium are disclosed for upscaling an image sequence. An upsampled frame is generated based on an original frame in an original image sequence comprising a plurality of frames. A smoothed image sequence is generated based on the original image sequence. A plurality of patches are determined in the upsampled frame. Each patch comprises a subset of image data in the upsampled frame. Locations of a plurality of corresponding patches are determined in a neighboring set of the plurality of frames in the smoothed image sequence. A plurality of high-frequency patches are generated. Each high-frequency patch is based on image data at the locations of the corresponding patches in the original image sequence. The plurality of high-frequency patches are added to the upsampled frame to generate a high-quality upscaled frame. | 03-21-2013 |
20130071041 | High-Quality Denoising of an Image Sequence - A method, system, and computer-readable storage medium are disclosed for denoising an image sequence. A first patch is determined in a first frame in an image sequence comprising a plurality of frames. The first patch comprises a subset of image data in the first frame. Locations of a plurality of corresponding patches are determined in a neighboring set of the plurality of frames. One or more neighboring related patches are determined for each of the plurality of corresponding patches in a same frame as the respective one of the corresponding patches. A denoised first patch is generated by averaging image data in the one or more neighboring related patches in the neighboring set of the plurality of frames. | 03-21-2013 |
20130121570 | Methods and Apparatus for Visual Search - For each image of a set of images, the each image is characterized with a set of fixed-orientation texture descriptors and a set of color descriptors. The set of images is indexed in a color index and a texture index. Similarly, a query image is characterized with a set of fixed-orientation texture descriptors. The set of fixed orientation texture descriptors of the query image includes a set of fixed orientation descriptors for each of a set of rotated query images, and a set of color descriptors of the query image. A rotated local Bag-of-Features (BoF) operation is performed upon the set of rotated query images and the set of images. Each of the set of images is ranked based on the rotated local Bag-of-Features operation. | 05-16-2013 |
20130121600 | Methods and Apparatus for Visual Search - Each image of a set of images is characterized with a set of sparse feature descriptors and a set of dense feature descriptors. In some embodiments, both the set of sparse feature descriptors and the set of dense feature descriptors are calculated based on a fixed rotation for computing texture descriptors, while color descriptors are rotation invariant. In some embodiments, the descriptors of both sparse and dense features are then quantized into visual words. Each database image is represented by a feature index including the visual words computed from both sparse and dense features. A query image is characterized with the visual words computed from both sparse and dense features of the query image. A rotated local Bag-of-Features (BoF) operation is performed upon a set of rotated query images against the set of database images. Each of the set of images is ranked based on the rotated local Bag-of-Features operation. | 05-16-2013 |
20140023291 | METHODS AND APPARATUS FOR IMAGE DEBLURRING AND SHARPENING USING LOCAL PATCH SELF-SIMILARITY - Various embodiments of methods and apparatus for image deblurring and sharpening using local patch self-similarity are disclosed. In some embodiments, an input blurred image is down-sampled to generate a downsized image. The downsized image is convolved with a blur kernel to obtain a smoothed image. For each of a plurality of patches of the input blurred image, a corresponding patch in the smoothed image is found. High frequency components between each of the plurality of corresponding patches in the smoothed image and corresponding patches of the downsized image are computed. The high frequency components are applied to the plurality of patches of the input blurred images to generate a deblurred version of the input blurred image. | 01-23-2014 |
20140037195 | IMAGE TAG PAIR GRAPH FOR IMAGE ANNOTATION - An approach is described for automatically tagging a single image or multiple images. The approach, in one example embodiment, is based on a graph-based framework that exploits both visual similarity between images and tag correlation within individual images. The problem is formulated in the context of semi-supervised learning, where a graph modeled as a Gaussian Markov Random Field (MRF) is solved by minimizing an objective function (the image tag score function) using an iterative approach. The iterative approach, in one embodiment, comprises: (1) fixing tags and propagating image tag likelihood values from labeled images to unlabeled images, and (2) fixing images and propagating image tag likelihood based on tag correlation. | 02-06-2014 |
20140089326 | Image Search by Query Object Segmentation - Query object localization, segmentation, and retrieval are disclosed. A query image may be received that includes a query object. Based on respective spatially constrained similarity measures between the query image and a plurality of images from an image database, at least some of the plurality of images may be identified and/or retrieved and a location of the query object in the query image may be estimated. The query object may then be automatically segmented from the query image based on the estimated query object location. In some embodiments, the retrieval, localization and/or segmentation may be iterated. | 03-27-2014 |
20140098988 | Fitting Contours to Features - Various embodiments of methods and apparatus for feature point localization are disclosed. An object in an input image may be detected. A profile model may be applied to determine feature point locations for each object component of the detected object. Applying the profile model may include globally optimizing the feature points for each object component to find a global energy minimum. A component-based shape model may be applied to update the respective feature point locations for each object component. | 04-10-2014 |
20140099031 | Adjusting a Contour by a Shape Model - Various embodiments of methods and apparatus for feature point localization are disclosed. A profile model and a shape model may be applied to an object in an image to determine locations of feature points for each object component. Input may be received to move one of the feature points to a fixed location. Other ones of the feature points may be automatically adjusted to different locations based on the moved feature point. | 04-10-2014 |
20140147022 | Facial Landmark Localization By Exemplar-Based Graph Matching - Systems and methods are discussed to localize facial landmarks using a test facial image and a set of training images. The landmarks can be localized on a test facial image using training facial images. A plurality of candidate landmark locations on the test facial image can be determined. A subset of the training facial images with facial features similar to the facial features in the test facial image can be identified. A plurality of shape constraints can be determined for each test facial image in the subset of test facial images. These shape constraints graphically relate to one landmark location from a linear combination of the other landmark locations in the test facial image. Shape constraints can be determined for every landmark within each test facial image. A candidate landmark can be chosen from the plurality of candidate landmarks using the shape constraints. | 05-29-2014 |
20140153817 | Patch Size Adaptation for Image Enhancement - Systems and methods are provided for providing patch size adaptation for patch-based image enhancement operations. In one embodiment, an image manipulation application receives an input image. The image manipulation application compares a value for an attribute of at least one input patch of the input image to a threshold value. Based on comparing the value for the to the threshold value, the image manipulation application adjusts a first patch size of the input patch to a second patch size that improves performance of a patch-based image enhancement operation as compared to the first patch size. The image manipulation application performs the patch-based image enhancement operation based on one or more input patches of the input image having the second patch size. | 06-05-2014 |
20140153819 | Learned Piece-Wise Patch Regression for Image Enhancement - Systems and methods are provided for providing learned, piece-wise patch regression for image enhancement. In one embodiment, an image manipulation application generates training patch pairs that include training input patches and training output patches. Each training patch pair includes a respective training input patch from a training input image and a respective training output patch from a training output image. The training input image and the training output image include at least some of the same image content. The image manipulation application determines patch-pair functions from at least some of the training patch pairs. Each patch-pair function corresponds to a modification to a respective training input patch to generate a respective training output patch. The image manipulation application receives an input image generates an output image from the input image by applying at least some of the patch-pair functions based on at least some input patches of the input image. | 06-05-2014 |
20140169684 | Distance Metric for Image Comparison - Systems and methods are provided for generating a distance metric. An image manipulation application receives first and second input images. The image manipulation application generates first and second sets of points corresponding to respective edges of a first object in the first input image and a second object in the second input image. The image manipulation application determines costs of arcs connecting each point from the first set to each point of the second set based on point descriptors for each point of each arc. The image manipulation application determines a minimum set of costs between the first set and the second set that includes a cost of each arc connecting each point of the second set to a point in the first set. The image manipulation application obtains, based at least in part on the minimum set of costs, a distance metric for first and second input images. | 06-19-2014 |
20140247963 | OBJECT DETECTION VIA VALIDATION WITH VISUAL SEARCH - One exemplary embodiment involves receiving, at a computing device comprising a processor, a test image having a candidate object and a set of object images detected to depict a similar object as the test image. The embodiment involves localizing the object depicted in each one of the object images based on the candidate object in the test image to determine a location of the object in each respective object image and then generating a validation score for the candidate object in the test image based at least in part on the determined location of the object in the respective object image and known location of the object in the same respective object image. The embodiment also involves computing a final detection score for the candidate object based on the validation score that indicates a confidence level that the object in the test image is located as indicated by the candidate object. | 09-04-2014 |
20140247992 | ATTRIBUTE RECOGNITION VIA VISUAL SEARCH - One exemplary embodiment involves identifying feature matches between each of a plurality of object images and a test image, each feature matches between a feature of a respective object image and a matching feature of the test image, wherein there is a spatial relationship between each respective object image feature and a test image feature, and wherein the object depicted in the test image comprises a plurality of attributes. Additionally, the embodiment involves estimating, for each attribute in the test image, an attribute value based at least in part on information stored in a metadata associated with each of the object images. | 09-04-2014 |
20140247993 | LANDMARK LOCALIZATION VIA VISUAL SEARCH - One exemplary embodiment involves identifying feature matches between each of a plurality of object images and a test image, each of the feature matches between a feature of a respective object image and a matching feature of the test image, wherein there is a spatial relationship between each respective object image feature and a first landmark of the object image, the first landmark at a known location in the object image. The embodiment additionally involves estimating a plurality of locations for a second landmark for the test image, the estimated locations based at least in part on the feature matches and the spatial relationships, and estimating a final location for the second landmark from the plurality of locations for the second landmark for the test image. | 09-04-2014 |
20140247996 | OBJECT DETECTION VIA VISUAL SEARCH - One exemplary embodiment involves receiving a test image generating, by a plurality of maps for the test image based on a plurality of object images. Each of the object images comprises an object of a same object type, e.g., each comprising a different face. Each of the plurality of maps is generated to provide information about the similarity of at least a portion of a respective object image to each of a plurality of portions of the test image. The exemplary embodiment further comprises detecting a test image object within the test image based at least in part on the plurality of maps. | 09-04-2014 |
20140254881 | Statistics of Nearest Neighbor Fields - In embodiments of statistics of nearest neighbor fields, matching patches of a nearest neighbor field can be determined at image grid locations of a first digital image and a second digital image. A motion field can then be determined based on motion data of the matching patches. Predominant motion components of the motion field can be determined based on statistics of the motion data to generate a final motion field. The predominant motion components correspond to a motion of objects as represented by a displacement between the first and second digital images. One of the predominant motion components can then be assigned to each of the matching patches to optimize the final motion field of the matching patches. | 09-11-2014 |
20140254882 | Optical Flow with Nearest Neighbor Field Fusion - In embodiments of optical flow with nearest neighbor field fusion, an initial motion field can be generated based on the apparent motion of objects between digital images, and the initial motion field accounts for small displacements of the object motion. Matching patches of a nearest neighbor field can also be determined for the digital images, where patches of an initial size are compared to determine the matching patches, and the nearest neighbor field accounts for large displacements of the object motion. Additionally, region patch matches can be compared and determined between the digital images, where the region patches are larger than the initial size matching patches. Optimal pixel assignments can then be determined for a fused image representation of the digital images, where the optimal pixel assignments are determined from the initial motion field, the matching patches, and the region patch matches. | 09-11-2014 |
20140254933 | Spatially Coherent Nearest Neighbor Fields - In embodiments of spatially coherent nearest neighbor fields, initial matching patches of a nearest neighbor field can be determined at image grid locations of a first digital image and a second digital image. Spatial coherency can be enforced for each matching patch in the second digital image with reference to respective matching patches in the first digital image based on motion data of neighboring matching patches. A multi-resolution iterative process can then update each spatially coherent matching patch based on overlapping grid regions of the matching patches that are evaluated for matching regions of the first and second digital images. An optimal, spatially coherent matching patch can be selected for each of the image grid locations of the first and second digital images based on iterative interaction to enforce the spatial coherency of each matching patch and the multi-resolution iterative process to update each spatially coherent matching patch. | 09-11-2014 |
20140254943 | Optical Flow Accounting for Image Haze - In embodiments of optical flow accounting for image haze, digital images may include objects that are at least partially obscured by a haze that is visible in the digital images, and an estimate of light that is contributed by the haze in the digital images can be determined The haze can be cleared from the digital images based on the estimate of the light that is contributed by the haze, and clearer digital images can be generated. An optical flow between the clearer digital images can then be computed, and the clearer digital images refined based on the optical flow to further clear the haze from the images in an iterative process to improve visibility of the objects in the digital images. | 09-11-2014 |
20140355899 | VIDEO ENHANCEMENT USING RELATED CONTENT - A method and systems of enhancing a video using a related image are provided. One or more patches are identified in the video, with each patch identifying a region that is present in one of the frames of the video that can be mapped to a similar region in at least one other frame of the video. For each identified patch in the video, a best matching patch in the related image is found. The video is enhanced using the best matching patch in the related image for each identified patch in the video. | 12-04-2014 |
20140355959 | MULTI-FRAME PATCH CORRESPONDENCE IDENTIFICATION IN VIDEO - A method and systems of identifying one or more patches in three or more frames in a video are provided. A region in a reference frame of the video may be detected. A set of regions in a prior frame and subsequent frame that are similar to the region in the reference frame may then be identified. Temporal consistency between the region in the reference frame and two or more regions in the set of regions in the prior and subsequent frames may then be calculated. Patches of regions in the first, reference, and third frames may be identified based at least in part on the calculated temporal consistencies, with each patch identifying a region in the reference frame that can be mapped to a similar region in the prior and subsequent frames. | 12-04-2014 |
20140368509 | Iterative Patch-Based Image Upscaling - Image upscaling techniques are described. These techniques may include use of iterative and adjustment upscaling techniques to upscale an input image. A variety of functionality may be incorporated as part of these techniques, examples of which include content-adaptive patch finding techniques that may be employed to give preference to an in-place patch to minimize structure distortion. In another example, content metric techniques may be employed to assign weights for combining patches. In a further example, algorithm parameters may be adapted with respect to algorithm iterations, which may be performed to increase efficiency of computing device resource utilization and speed of performance. For instance, algorithm parameters may be adapted to enforce a minimum and/or maximum number to iterations, cease iterations for image sizes over a threshold amount, set sampling step sizes for patches, employ techniques based on color channels (which may include independence and joint processing techniques), and so on. | 12-18-2014 |
20140368549 | Adaptive Patch-Based Image Upscaling - Image upscaling techniques are described. These techniques may include use of iterative and adjustment upscaling techniques to upscale an input image. A variety of functionality may be incorporated as part of these techniques, examples of which include content-adaptive patch finding techniques that may be employed to give preference to an in-place patch to minimize structure distortion. In another example, content metric techniques may be employed to assign weights for combining patches. In a further example, algorithm parameters may be adapted with respect to algorithm iterations, which may be performed to increase efficiency of computing device resource utilization and speed of performance. For instance, algorithm parameters may be adapted to enforce a minimum and/or maximum number to iterations, cease iterations for image sizes over a threshold amount, set sampling step sizes for patches, employ techniques based on color channels (which may include independence and joint processing techniques), and so on. | 12-18-2014 |
20150036943 | Patch-Based, Locally Content-Adaptive Image and Video Sharpening - Techniques for sharpening an image using local spatial adaptation and/or patch-based image processing. An image can be sharpened by creating a high-frequency image and then combining that high frequency image with the image. This process can be applied iteratively by using the output of one iteration, i.e., the sharpened image, as the input to the next iteration. Using local spatial adaptation and/or patch-based techniques can provide various advantages. How to change the intensity at a given position in the image can be calculated from more than just information about that same position in the input image and the blurred image. By using information about neighboring positions an improved high frequency image can be determined that, when combined with the input image, reduces ringing and halo artifacts, suppresses noise boosting, and/or generates results with sharper and cleaner edges and details. | 02-05-2015 |
20150055857 | TEXT DETECTION IN NATURAL IMAGES - A system and method of text detection in an image are described. A component detection module applies a filter having a stroke width constraint and a stroke color constraint to an image to identify text stroke pixels in the image and to generate both a first map based on the stroke width constraint and a second map based on the stroke color constraint. A component filtering module has a first classifier and second classifier. The first classifier is applied to both the first map and the second map to generate a third map identifying a component of a text in the image. The second classifier is applied to the third map to generate a fourth map identifying a text line of the text in the image. A text region locator module thresholds the fourth map to identify text regions in the image. | 02-26-2015 |
20150071545 | Image Enhancement Using Self-Examples and External Examples - Systems and methods are provided for image enhancement using self-examples in combination with external examples. In one embodiment, an image manipulation application receives an input image patch of an input image. The image manipulation application determines a first weight for an enhancement operation using self-examples and a second weight for an enhancement operation using external examples. The image manipulation application generates a first interim output image patch by applying the enhancement operation using self-examples to the input image patch and a second interim output image patch by applying the enhancement operation using external examples to the input image patch. The image manipulation application generates an output image patch by combining the first and second interim output image patches as modified using the first and second weights. | 03-12-2015 |
20150071561 | REMOVING NOISE FROM AN IMAGE VIA EFFICIENT PATCH DISTANCE COMPUTATIONS - Systems and methods herein provide for reduced computations in image processing and a more efficient way of computing distances between patches in patch-based image denoising. One method is operable within a processing system to remove noise from a digital image by generating a plurality of lookup tables of pixel values based on a plurality of comparisons of the digital image to offsets of the digital image, generating integral images from the lookup tables, and computing distances between patches of pixels in the digital image from the integral images. The method also includes computing weights for the patches of pixels in the digital image based on the computed distances and applying the weights to pixels in the digital image on a patch-by-patch basis to restore values of the pixels. | 03-12-2015 |
20150110386 | Tree-based Linear Regression for Denoising - Image denoising techniques are described. In one or more implementations, a denoising result is computed by a computing device for a patch of an image. One or more partitions are located by the computing device that correspond to the denoising result and a denoising operator is obtained by the computing device that corresponds to the located one or more partitions. The obtained denoising operator is applied by the computing device to the image. | 04-23-2015 |
20150116350 | COMBINED COMPOSITION AND CHANGE-BASED MODELS FOR IMAGE CROPPING - In techniques of combined composition and change-based models for image cropping, a composition application is implemented to apply one or more image composition modules of a learned composition model to evaluate multiple composition regions of an image. The learned composition model can determine one or more cropped images from the image based on the applied image composition modules, and evaluate a composition of the cropped images and a validity of change from the image to the cropped images. The image composition modules of the learned composition model include a salient regions module that iteratively determines salient image regions of the image, and include a foreground detection module that determines foreground regions of the image. The image composition modules also include one or more imaging models that reduce a number of the composition regions of the image to facilitate determining the cropped images from the image. | 04-30-2015 |
20150117783 | ITERATIVE SALIENCY MAP ESTIMATION - In techniques for iterative saliency map estimation, a salient regions module applies a saliency estimation technique to compute a saliency map of an image that includes image regions. A salient image region of the image is determined from the saliency map, and an image region that corresponds to the salient image region is removed from the image. The salient regions module then iteratively determines subsequent salient image regions of the image utilizing the saliency estimation technique to recompute the saliency map of the image with the image region removed, and removes the image regions that correspond to the subsequent salient image regions from the image. The salient image regions of the image are iteratively determined until no salient image regions are detected in the image, and a salient features map is generated that includes each of the salient image regions determined iteratively and combined to generate the final saliency map. | 04-30-2015 |
20150117784 | IMAGE FOREGROUND DETECTION - In techniques for image foreground detection, a foreground detection module is implemented to generate varying levels of saliency thresholds from a saliency map of an image that includes foreground regions. The saliency thresholds can be generated based on an adaptive thresholding technique applied to the saliency map of the image and/or based on multi-level segmentation of the saliency map. The foreground detection module applies one or more constraints that distinguish the foreground regions in the image, and detects the foreground regions of the image based on the saliency thresholds and the constraints. Additionally, different ones of the constraints can be applied to detect different ones of the foreground regions, as well as to detect multi-level foreground regions based on the saliency thresholds and the constraints. | 04-30-2015 |
20150120760 | IMAGE TAGGING - A system is configured to annotate an image with tags. As configured, the system accesses an image and generates a set of vectors for the image. The set of vectors may be generated by mathematically transforming the image, such as by applying a mathematical transform to predetermined regions of the image. The system may then query a database of tagged images by submitting the set of vectors as search criteria to a search engine. The querying of the database may obtain a set of tagged images. Next, the system may rank the obtained set of tagged images according to similarity scores that quantify degrees of similarity between the image and each tagged image obtained. Tags from a top-ranked subset of the tagged images may be extracted by the system, which may then annotate the image with these extracted tags. | 04-30-2015 |
20150131873 | EXEMPLAR-BASED FEATURE WEIGHTING - In an example embodiment, for each of the image exemplars, a first location offset between an actual landmark location for a first landmark in the image exemplar and a predicted landmark location for the first landmark in the image exemplar is determined. Then, a probability that the image recognition process applied using the first feature produces an accurate identification of the first landmark in the image exemplars is determined based on the first location offsets for each of the image exemplars. A weight may then be assigned to the first feature based on the derived probability. An image recognition process may then be performed on an image, the image recognition process utilizing a voting process, for each of one or more features, for one or more landmarks in the plurality of image exemplars, the voting process for the first feature weighted according to the weight assigned to the first feature. | 05-14-2015 |
20150131915 | ADAPTIVE DENOISING WITH INTERNAL AND EXTERNAL PATCHES - In techniques for adaptive denoising with internal and external patches, example image patches taken from example images are grouped into partitions of similar patches, and a partition center patch is determined for each of the partitions. An image denoising technique is applied to image patches of a noisy image to generate modified image patches, and a closest partition center patch to each of the modified image patches is determined. The image patches of the noisy image are then classified as either a common patch or a complex patch of the noisy image, where an image patch is classified based on a distance between the corresponding modified image patch and the closest partition center patch. A denoising operator can be applied to an image patch based on the classification, such as applying respective denoising operators to denoise the image patches that are classified as the common patches of the noisy image. | 05-14-2015 |
20150139536 | Image Classification Using Images with Separate Grayscale and Color Channels - Image classification techniques using images with separate grayscale and color channels are described. In one or more implementations, an image classification network includes grayscale filters and color filters which are separate from the grayscale filters. The grayscale filters are configured to extract grayscale features from a grayscale channel of an image, and the color filters are configured to extract color features from a color channel of the image. The extracted grayscale features and color features are used to identify an object in the image, and the image is classified based on the identified object. | 05-21-2015 |
20150139538 | OBJECT DETECTION WITH BOOSTED EXEMPLARS - In techniques for object detection with boosted exemplars, weak classifiers of a real-adaboost technique can be learned as exemplars that are collected from example images. The exemplars are examples of an object that is detectable in image patches of an image, such as faces that are detectable in images. The weak classifiers of the real-adaboost technique can be applied to the image patches of the image, and a confidence score is determined for each of the weak classifiers as applied to an image patch of the image. The confidence score of a weak classifier is an indication of whether the object is detected in the image patch of the image based on the weak classifier. All of the confidence scores of the weak classifiers can then be summed to generate an overall object detection score that indicates whether the image patch of the image includes the object. | 05-21-2015 |
20150139551 | Cascaded Object Detection - Cascaded object detection techniques are described. In one or more implementations, cascaded coarse-to-dense object detection techniques are utilized to detect objects in images. In a first stage, coarse features are extracted from an image, and non-object regions are rejected. Then, in one or more subsequent stages, dense features are extracted from the remaining non-rejected regions of the image to detect one or more objects in the image. | 05-21-2015 |
20150139557 | FAST DENSE PATCH SEARCH AND QUANTIZATION - In techniques for fast dense patch search and quantization, partition center patches are determined for partitions of example image patches. Patch groups of an image each include similar image patches and a reference image patch that represents a respective patch group. A partition center patch of the partitions is determined as a nearest neighbor to the reference image patch of a patch group. The partition center patch can be determined based on a single-nearest neighbor (1-NN) distance determination, and the determined partition center patch is allocated as the nearest neighbor to the similar image patches in the patch group. Alternatively, a group of nearby partition center patches are determined as the nearest neighbors to the reference image patch based on a k-nearest neighbor (k-NN) distance determination, and the nearest neighbor to each of the similar image patches in the patch group is determined from the nearby partition center patches. | 05-21-2015 |
20150146973 | DISTRIBUTED SIMILARITY LEARNING FOR HIGH-DIMENSIONAL IMAGE FEATURES - A system and method for distributed similarity learning for high-dimensional image features are described. A set of data features is accessed. Subspaces from a space formed by the set of data features are determined using a set of projection matrices. Each subspace has a dimension lower than a dimension of the set of data features. Similarity functions are computed for the subspaces. Each similarity function is based on the dimension of the corresponding subspace. A linear combination of the similarity functions is performed to determine a similarity function for the set of data features. | 05-28-2015 |
20150213609 | Image Cropping Suggestion - Image cropping suggestion is described. In one or more implementations, multiple croppings of a scene are scored based on parameters that indicate visual characteristics established for visually pleasing croppings. The parameters may include a parameter that indicates composition quality of a candidate cropping, for example. The parameters may also include a parameter that indicates whether content appearing in the scene is preserved and a parameter that indicates simplicity of a boundary of a candidate cropping. Based on the scores, image croppings may be chosen, e.g., to present the chosen image croppings to a user for selection. To choose the croppings, they may be ranked according to the score and chosen such that consecutively ranked croppings are not chosen. Alternately or in addition, image croppings may be chosen that are visually different according to scores which indicate those croppings have different visual characteristics. | 07-30-2015 |
20150213612 | Cropping Boundary Simplicity - Cropping boundary simplicity techniques are described. In one or more implementations, multiple candidate croppings of a scene are generated. For each of the candidate croppings, a score is calculated that is indicative of a boundary simplicity for the candidate cropping. To calculate the boundary simplicity, complexity of the scene along a boundary of a respective candidate cropping is measured. The complexity is measured, for instance, using an average gradient, an image edge map, or entropy along the boundary. Values indicative of the complexity may be derived from the measuring. The candidate croppings may then be ranked according to those values. Based on the scores calculated to indicate the boundary simplicity, one or more of the candidate croppings may be chosen e.g., to present the chosen croppings to a user for selection. | 07-30-2015 |
20150227817 | Category Histogram Image Representation - In techniques for category histogram image representation, image segments of an input image are generated and bounding boxes are selected that each represent a region of the input image, where each of the bounding boxes include image segments of the input image. A saliency map of the input image can also be generated. A bounding box is applied as a query on an images database to determine database image regions that match the region of the input image represented by the bounding box. The query can be augmented based on saliency detection of the input image region that is represented by the bounding box, and a query result is a ranked list of the database image regions. A category histogram for the region of the input image is then generated based on category labels of each of the database image regions that match the input image region. | 08-13-2015 |
20150262336 | Video Denoising Using Optical Flow - In techniques for video denoising using optical flow, image frames of video content include noise that corrupts the video content. A reference frame is selected, and matching patches to an image patch in the reference frame are determined from within the reference frame. A noise estimate is computed for previous and subsequent image frames relative to the reference frame. The noise estimate for an image frame is computed based on optical flow, and is usable to determine a contribution of similar motion patches to denoise the image patch in the reference frame. The similar motion patches from the previous and subsequent image frames that correspond to the image patch in the reference frame are determined based on the optical flow computations. The image patch is denoised based on an average of the matching patches from reference frame and the similar motion patches determined from the previous and subsequent image frames. | 09-17-2015 |
20150332438 | Patch Partitions and Image Processing - Patch partition and image processing techniques are described. In one or more implementations, a system includes one or more modules implemented at least partially in hardware. The one or more modules are configured to perform operations including grouping a plurality of patches taken from a plurality of training samples of images into respective ones of a plurality of partitions, calculating an image processing operator for each of the partitions, determining distances between the plurality of partitions that describe image similarity of patches of the plurality of partitions, one to another, and configuring a database to provide the determined distance and the image processing operator to process an image in response to identification of a respective partition that corresponds to a patch taken from the image. | 11-19-2015 |
20160026899 | TEXT LINE DETECTION IN IMAGES - Techniques for detecting and recognizing text may be provided. For example, an image may be analyzed to detect and recognize text therein. The analysis may involve detecting text components in the image. For example, multiple color spaces and multiple-stage filtering may be applied to detect the text components. Further, the analysis may involve extracting text lines based on the text components. For example, global information about the text components can be analyzed to generate best-fitting text lines. The analysis may also involve pruning and splitting the text lines to generate bounding boxes around groups of text components. Text recognition may be applied to the bounding boxes to recognize text therein. | 01-28-2016 |
20160027152 | Scalable Massive Parallelization of Overlapping Patch Aggregation - Techniques for enhancing an image using pixel-specific processing. An image can be enhanced by updating selected pixels through patch aggregation. Respective patch values for patches of any size of the image are determined. Patch values provide update information for updating the respective pixels in the patch. Relevant patch values for the selected pixel are identified by identifying associated patches of the pixel. Information from the relevant patch values of the selected pixel may be obtained by averaging the relevant patch values or determining the maximum or minimum patch value. Using this information, pixel-specific processing may be performed to determine an updated pixel value for the selected pixel. Pixel-specific processes may be executed for each of the selected pixels. These pixel-specific processes can be executed in parallel. Therefore, through the execution of pixel-specific processes, which may be performed concurrently, an enhanced image may be determined. | 01-28-2016 |
20160027181 | Accelerating Object Detection - Accelerating object detection techniques are described. In one or more implementations, adaptive sampling techniques are used to extract features from an image. Coarse features are extracted from the image and used to generate an object probability map. Then, dense features are extracted from high-probability object regions of the image identified in the object probability map to enable detection of an object in the image. In one or more implementations, cascade object detection techniques are used to detect an object in an image. In a first stage, exemplars in a first subset of exemplars are applied to features extracted from the multiple regions of the image to detect object candidate regions. Then, in one or more validation stages, the object candidate regions are validated by applying exemplars from the first subset of exemplars and one or more additional subsets of exemplars. | 01-28-2016 |
20160034788 | LEARNING IMAGE CATEGORIZATION USING RELATED ATTRIBUTES - A first set of attributes (e.g., style) is generated through pre-trained single column neural networks and leveraged to regularize the training process of a regularized double-column convolutional neural network (RDCNN). Parameters of the first column (e.g., style) of the RDCNN are fixed during RDCNN training Parameters of the second column (e.g., aesthetics) are fine-tuned while training the RDCNN and the learning process is supervised by the label identified by the second column (e.g., aesthetics). Thus, features of the images may be leveraged to boost classification accuracy of other features by learning a RDCNN. | 02-04-2016 |
20160035078 | IMAGE ASSESSMENT USING DEEP CONVOLUTIONAL NEURAL NETWORKS - Deep convolutional neural networks receive local and global representations of images as inputs and learn the best representation for a particular feature through multiple convolutional and fully connected layers. A double-column neural network structure receives each of the local and global representations as two heterogeneous parallel inputs to the two columns. After some layers of transformations, the two columns are merged to form the final classifier. Additionally, features may be learned in one of the fully connected layers. The features of the images may be leveraged to boost classification accuracy of other features by learning a regularized double-column neural network. | 02-04-2016 |
20160062731 | SHORTLIST COMPUTATION FOR SEARCHING HIGH-DIMENSIONAL SPACES - Techniques are disclosed for indexing and searching high-dimensional data using inverted file structures and product quantization encoding. An image descriptor is quantized using a form of product quantization to determine which of several inverted lists the image descriptor is to be stored. The image descriptor is appended to the corresponding inverted list with a compact coding using a product quantization encoding scheme. When processing a query, a shortlist is computed that includes a set of candidate search results. The shortlist is based on the orthogonality between two random vectors in high-dimensional spaces. The inverted lists are traversed in the order of the distance between the query and the centroid of a coarse quantizer corresponding to each inverted list. The shortlist is ranked according to the distance estimated by a form of product quantization, and the top images referred to by the ranked shortlist are reported as the search results. | 03-03-2016 |
20160098823 | Cropping Boundary Simplicity - Cropping boundary simplicity techniques are described. In one or more implementations, multiple candidate cropping s of a scene are generated. For each of the candidate croppings, a score is calculated that is indicative of a boundary simplicity for the candidate cropping. To calculate the boundary simplicity, complexity of the scene along a boundary of a respective candidate cropping is measured. The complexity is measured, for instance, using an average gradient, an image edge map, or entropy along the boundary. Values indicative of the complexity may be derived from the measuring. The candidate croppings may then be ranked according to those values. Based on the scores calculated to indicate the boundary simplicity, one or more of the candidate croppings may be chosen e.g., to present the chosen croppings to a user for selection. | 04-07-2016 |
20160104054 | Saliency Map Computation - Saliency map computation is described. In one or more implementations, a base saliency map is generated for an image of a scene. The base saliency map may be generated from intermediate saliency maps computed for boundary regions of the image. Each of the intermediate saliency maps may represent visual saliency of portions of the scene that are captured in the corresponding boundary region. The boundary regions may include, for instance, a top boundary region, a bottom boundary region, a left boundary region, and a right boundary region. Further, the intermediate saliency maps may be combined in such a way that an effect of a foreground object on the saliency map is suppressed. The foreground objects for which the effect is suppressed are those that occupy a majority of one of the boundary regions. | 04-14-2016 |
20160104055 | Image Cropping Suggestion Using Multiple Saliency Maps - Image cropping suggestion using multiple saliency maps is described. In one or more implementations, component scores, indicative of visual characteristics established for visually-pleasing croppings, are computed for candidate image croppings using multiple different saliency maps. The visual characteristics on which a candidate image cropping is scored may be indicative of its composition quality, an extent to which it preserves content appearing in the scene, and a simplicity of its boundary. Based on the component scores, the croppings may be ranked with regard to each of the visual characteristics. The rankings may be used to cluster the candidate croppings into groups of similar croppings, such that croppings in a group are different by less than a threshold amount and croppings in different groups are different by at least the threshold amount. Based on the clustering, croppings may then be chosen, e.g., to present them to a user for selection. | 04-14-2016 |