Abstract:
A method for decreasing entropy of a quantum system, for example nuclear spins. The quantum system comprising at least two subsystems, a first subsystem of elements with a first relaxation time (hereinafter—computation elements) and a second subsystem of elements with a second relaxation time (hereinafter—reset elements), the second relaxation time being shorter than the first relaxation time. The method comprises adiabatically decreasing the entropy of the computation elements in the system (by entropy compression, entropy transfer, or both) and increasing the entropy of at least some reset elements, so that the entropy of the subgroup of reset elements is overall increased; and waiting for the total entropy of the subgroup of reset elements to decrease, wherein the above two steps are carried out at least once.
Abstract:
This invention presents a universal framework for the discovery, understanding and matching of dress styles. In one embodiment, a computer-implemented method for building a universal dress style learner is disclosed, said method comprising: learning human skin models; detecting skin using the learned human skin models; collecting a set of dress images worn by a model; computing a set of style features based on the skin detected for at least one subset within the set of dress images; computing a set of clusters on the at least one subset of dress images based on at least one subset of the set of style features; validating the set of clusters for the at least one subset of style features; and computing a set of validated style features and a style basis.
Abstract:
Methods and systems for discovering styles via color and pattern co-occurrence are disclosed. According to one embodiment, a computer-implemented method comprises collecting a set of fashion images, selecting at least one subset within the set of fashion images, the subset comprising at least one image containing a fashion item, and computing a set of segments by segmenting the at least one image into at least one dress segment. Color and pattern representations of the set of segments are computed by using a color analysis method and a pattern analysis method respectively. A graph is created wherein each graph node corresponds to one of a color representation or a pattern representation computed for the set of segments. Weights of edges between nodes of the graph indicate a degree of how the corresponding colors or patterns complement each other in a fashion sense.
Abstract:
A method for classifying polymorphic computer software by extracting features from a suspect file and comparing the extracted features to features of known classes of software.