High Resolution vs Low Resolution

Scanning Resolution is Important

Best restoration results start with the best scans.

Scanning resolution is important for our photo restoration process.

In this example the photo looks fine, however, the 600dpi scan is smooth and the 72dpi scan you can see the pixels.

Make sure your scan your photos at least 300dpi if not 600dpi

Contact Us



Heir Hunters Association – Starter Subscription £25.00 GBP


Heir Hunters is the modern name for people or firms who trace missing beneficiaries to deceased peoples estates across the world.

Making a will – a testament or instruction as to whom inherits your assets after your death is not compulsory, but a voluntary act which many people make to ensure the people they want inherit money, property, businesses and personal belongings.

For various reasons some people just do not make a will, and if that is the case the law takes over to ensure the deceased’s assets are distributed to their next of kin, some potentially that they are not aware of, or have ever met. If no kin is ever found or comes forward to claim then the state inherits the estate.

The Heir Hunters Association is committed to supporting aspiring, part time or full time probate Researchers (aka Heir Hunters) Estate Beneficiaries and Associated Probate services such as lawyers and will writers. You can subscribe regardless of location – UK, Europe, North America, Canada, Australia. New Zealand, South America, Africa or Asia since, although inheritance laws may differ across countries, regions, counties and states many principals stay the same.

The starter educational option subscription is for new and fledgling Heir Hunters, members of the public or news media and is available on a 3 month ongoing basis at a cost of £25.00 GBP.

Benefits of joining the HHA include

  • Access to over 10,000 unclaimed estates updated constantly. We also show new and resolved cases from previous results. A high proportion of these estates have been with the Treasury Solicitor for a number of years and therefore not subject to the fierce competition of new listings which enables you to work through cases in your own time (you have up to 30 years from the date of death).
  • Access to every USA State Department who handle the distribution of unclaimed estates and monies, plus investigators handbook to help locate and submit claims.
  • Details of how to submit a claim to the  GLD/BV and handle or administrate the estate after success claiming it or behalf of your fee paying clients.
  • Tools to assist you in starting your Heir Hunting business
  • https://www.hha-bvlive.org.uk tracks new, existing and solved cases (optional subscripton service)

Want to find our more … See here


Dementia – Photos Helping Trigger Memories


Pictures taken by a little-known photographer ‘Joseph Hardman’ between the 1930s and 1960s have found a new use helping to trigger memories and reminiscences among people with dementia.

When Joseph died in 1972, his wife donated almost 5,000 glass negatives to the Museum of Lakeland Life and Industry in Kendal, Cumbria.

Now the photos are used to help a group of people living with dementia using the photos as a catalyst to reminisce about their own lives in the Lake District.



Read More of the BBC article here


Photo Restoration – Texture synthesis

Did you know there are complicated Algorithms and Methods involved in Photo Restoration?

Although the algorithms are never seen, from the proposed equations you can tell how complex it was to get where we are today in terms of photo restoration.

Alexei A. Efros and Thomas K. Leung (Computer Science Division – University of California, Berkeley) developed a method and algorithm that, although initially intended for texture synthesis, has proven most effective for photo restoration problems.

The algorithm allows the image gap to be filled-in recursively, inwards from the gap boundary.

The Equation:

Output(P) = V alue(Q), P ∈ Ω, Q /∈ Ω, Q = arg min d(Ψ(P), Ψ(Q))

where d(Ψ(P), Ψ(Q)) is the Sum of Squared Differences (SSD) among the patches Ψ(P) and Ψ(Q) (considering only available pixels):

d(Ψ1, Ψ2) = X i X j |Ψ1(i, j) − Ψ2(i, j)| 2

Once a pixel is filled-in, the algorithm marchs on to the next pixel at the boundary of the gap, never going back to the completed Pixel (whose value is, therefore, not altered again). The results are really impressive for a wide range of images. The main shortcomings of this algorithm are its computational cost, the selection of the neighborhood size